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/sll-buckets_true-unreach-call_true-valid-memsafety.i -------------------------------------------------------------------------------- This is Ultimate 0.1.23-666feb3-m [2018-04-10 14:16:21,971 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-04-10 14:16:21,973 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-04-10 14:16:21,985 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-04-10 14:16:21,985 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-04-10 14:16:21,986 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-04-10 14:16:21,987 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-04-10 14:16:21,989 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-04-10 14:16:21,991 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-04-10 14:16:21,992 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-04-10 14:16:21,992 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-04-10 14:16:21,992 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-04-10 14:16:21,993 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-04-10 14:16:21,994 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-04-10 14:16:21,995 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-04-10 14:16:21,997 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-04-10 14:16:21,998 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-04-10 14:16:22,000 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-04-10 14:16:22,000 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-04-10 14:16:22,001 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-04-10 14:16:22,003 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-04-10 14:16:22,003 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-04-10 14:16:22,003 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-04-10 14:16:22,004 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-04-10 14:16:22,005 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-04-10 14:16:22,006 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-04-10 14:16:22,006 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-04-10 14:16:22,007 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-04-10 14:16:22,007 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-04-10 14:16:22,007 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-04-10 14:16:22,008 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-04-10 14:16:22,008 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:16:22,020 INFO L110 SettingsManager]: Loading preferences was successful [2018-04-10 14:16:22,020 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-04-10 14:16:22,021 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-04-10 14:16:22,021 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-04-10 14:16:22,021 INFO L133 SettingsManager]: * Use SBE=true [2018-04-10 14:16:22,021 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-04-10 14:16:22,021 INFO L133 SettingsManager]: * sizeof long=4 [2018-04-10 14:16:22,022 INFO L133 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2018-04-10 14:16:22,022 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-04-10 14:16:22,022 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-04-10 14:16:22,022 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-04-10 14:16:22,022 INFO L133 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2018-04-10 14:16:22,022 INFO L133 SettingsManager]: * Bitprecise bitfields=true [2018-04-10 14:16:22,022 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-04-10 14:16:22,023 INFO L133 SettingsManager]: * sizeof long double=12 [2018-04-10 14:16:22,023 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-04-10 14:16:22,023 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-04-10 14:16:22,023 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-04-10 14:16:22,023 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-04-10 14:16:22,023 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-04-10 14:16:22,024 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-04-10 14:16:22,024 INFO L133 SettingsManager]: * Interpolant automaton=TWOTRACK [2018-04-10 14:16:22,024 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-04-10 14:16:22,024 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2018-04-10 14:16:22,052 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-04-10 14:16:22,061 INFO L266 ainManager$Toolchain]: [Toolchain 1]: Parser(s) successfully (re)initialized [2018-04-10 14:16:22,065 INFO L222 ainManager$Toolchain]: [Toolchain 1]: Toolchain data selected. [2018-04-10 14:16:22,067 INFO L271 PluginConnector]: Initializing CDTParser... [2018-04-10 14:16:22,067 INFO L276 PluginConnector]: CDTParser initialized [2018-04-10 14:16:22,067 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/forester-heap/sll-buckets_true-unreach-call_true-valid-memsafety.i [2018-04-10 14:16:22,435 INFO L225 CDTParser]: Created temporary CDT project at /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/data/FLAGf471cc0fe [2018-04-10 14:16:22,559 INFO L287 CDTParser]: IsIndexed: true [2018-04-10 14:16:22,559 INFO L288 CDTParser]: Found 1 translation units. [2018-04-10 14:16:22,559 INFO L168 CDTParser]: Scanning sll-buckets_true-unreach-call_true-valid-memsafety.i [2018-04-10 14:16:22,566 INFO L210 ultiparseSymbolTable]: Include resolver: [2018-04-10 14:16:22,566 INFO L215 ultiparseSymbolTable]: [2018-04-10 14:16:22,566 INFO L218 ultiparseSymbolTable]: Function table: [2018-04-10 14:16:22,566 INFO L221 ultiparseSymbolTable]: Function definition of null ('main') in sll-buckets_true-unreach-call_true-valid-memsafety.i [2018-04-10 14:16:22,566 INFO L227 ultiparseSymbolTable]: Global variable table: [2018-04-10 14:16:22,567 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fsll_buckets_true_unreach_call_true_valid_memsafety_i__pthread_cond_t in sll-buckets_true-unreach-call_true-valid-memsafety.i [2018-04-10 14:16:22,567 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fsll_buckets_true_unreach_call_true_valid_memsafety_i____blkcnt_t in sll-buckets_true-unreach-call_true-valid-memsafety.i [2018-04-10 14:16:22,567 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fsll_buckets_true_unreach_call_true_valid_memsafety_i__quad_t in sll-buckets_true-unreach-call_true-valid-memsafety.i [2018-04-10 14:16:22,567 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fsll_buckets_true_unreach_call_true_valid_memsafety_i____loff_t in sll-buckets_true-unreach-call_true-valid-memsafety.i [2018-04-10 14:16:22,567 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fsll_buckets_true_unreach_call_true_valid_memsafety_i__u_int16_t in sll-buckets_true-unreach-call_true-valid-memsafety.i [2018-04-10 14:16:22,567 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fsll_buckets_true_unreach_call_true_valid_memsafety_i__fsid_t in sll-buckets_true-unreach-call_true-valid-memsafety.i [2018-04-10 14:16:22,567 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fsll_buckets_true_unreach_call_true_valid_memsafety_i__int64_t in sll-buckets_true-unreach-call_true-valid-memsafety.i [2018-04-10 14:16:22,567 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fsll_buckets_true_unreach_call_true_valid_memsafety_i____daddr_t in sll-buckets_true-unreach-call_true-valid-memsafety.i [2018-04-10 14:16:22,567 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fsll_buckets_true_unreach_call_true_valid_memsafety_i____clockid_t in sll-buckets_true-unreach-call_true-valid-memsafety.i [2018-04-10 14:16:22,567 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fsll_buckets_true_unreach_call_true_valid_memsafety_i__clockid_t in sll-buckets_true-unreach-call_true-valid-memsafety.i [2018-04-10 14:16:22,567 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fsll_buckets_true_unreach_call_true_valid_memsafety_i__suseconds_t in sll-buckets_true-unreach-call_true-valid-memsafety.i [2018-04-10 14:16:22,567 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fsll_buckets_true_unreach_call_true_valid_memsafety_i____pid_t in sll-buckets_true-unreach-call_true-valid-memsafety.i [2018-04-10 14:16:22,567 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fsll_buckets_true_unreach_call_true_valid_memsafety_i____syscall_slong_t in sll-buckets_true-unreach-call_true-valid-memsafety.i [2018-04-10 14:16:22,567 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fsll_buckets_true_unreach_call_true_valid_memsafety_i____sigset_t in sll-buckets_true-unreach-call_true-valid-memsafety.i [2018-04-10 14:16:22,568 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fsll_buckets_true_unreach_call_true_valid_memsafety_i____ino_t in sll-buckets_true-unreach-call_true-valid-memsafety.i [2018-04-10 14:16:22,568 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fsll_buckets_true_unreach_call_true_valid_memsafety_i____u_int in sll-buckets_true-unreach-call_true-valid-memsafety.i [2018-04-10 14:16:22,568 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fsll_buckets_true_unreach_call_true_valid_memsafety_i____gid_t in sll-buckets_true-unreach-call_true-valid-memsafety.i [2018-04-10 14:16:22,568 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fsll_buckets_true_unreach_call_true_valid_memsafety_i__u_int8_t in sll-buckets_true-unreach-call_true-valid-memsafety.i [2018-04-10 14:16:22,568 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fsll_buckets_true_unreach_call_true_valid_memsafety_i__pthread_spinlock_t in sll-buckets_true-unreach-call_true-valid-memsafety.i [2018-04-10 14:16:22,568 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fsll_buckets_true_unreach_call_true_valid_memsafety_i____clock_t in sll-buckets_true-unreach-call_true-valid-memsafety.i [2018-04-10 14:16:22,568 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fsll_buckets_true_unreach_call_true_valid_memsafety_i__pthread_condattr_t in sll-buckets_true-unreach-call_true-valid-memsafety.i [2018-04-10 14:16:22,568 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fsll_buckets_true_unreach_call_true_valid_memsafety_i__dev_t in sll-buckets_true-unreach-call_true-valid-memsafety.i [2018-04-10 14:16:22,568 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fsll_buckets_true_unreach_call_true_valid_memsafety_i__pthread_t in sll-buckets_true-unreach-call_true-valid-memsafety.i [2018-04-10 14:16:22,568 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fsll_buckets_true_unreach_call_true_valid_memsafety_i____fd_mask in sll-buckets_true-unreach-call_true-valid-memsafety.i [2018-04-10 14:16:22,568 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fsll_buckets_true_unreach_call_true_valid_memsafety_i__daddr_t in sll-buckets_true-unreach-call_true-valid-memsafety.i [2018-04-10 14:16:22,568 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fsll_buckets_true_unreach_call_true_valid_memsafety_i__clock_t in sll-buckets_true-unreach-call_true-valid-memsafety.i [2018-04-10 14:16:22,568 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fsll_buckets_true_unreach_call_true_valid_memsafety_i____fsid_t in sll-buckets_true-unreach-call_true-valid-memsafety.i [2018-04-10 14:16:22,568 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fsll_buckets_true_unreach_call_true_valid_memsafety_i__nlink_t in sll-buckets_true-unreach-call_true-valid-memsafety.i [2018-04-10 14:16:22,568 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fsll_buckets_true_unreach_call_true_valid_memsafety_i__id_t in sll-buckets_true-unreach-call_true-valid-memsafety.i [2018-04-10 14:16:22,568 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fsll_buckets_true_unreach_call_true_valid_memsafety_i__uint in sll-buckets_true-unreach-call_true-valid-memsafety.i [2018-04-10 14:16:22,568 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fsll_buckets_true_unreach_call_true_valid_memsafety_i____ino64_t in sll-buckets_true-unreach-call_true-valid-memsafety.i [2018-04-10 14:16:22,568 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fsll_buckets_true_unreach_call_true_valid_memsafety_i__BCK in sll-buckets_true-unreach-call_true-valid-memsafety.i [2018-04-10 14:16:22,569 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fsll_buckets_true_unreach_call_true_valid_memsafety_i____sig_atomic_t in sll-buckets_true-unreach-call_true-valid-memsafety.i [2018-04-10 14:16:22,569 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fsll_buckets_true_unreach_call_true_valid_memsafety_i____uid_t in sll-buckets_true-unreach-call_true-valid-memsafety.i [2018-04-10 14:16:22,569 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fsll_buckets_true_unreach_call_true_valid_memsafety_i__SLL in sll-buckets_true-unreach-call_true-valid-memsafety.i [2018-04-10 14:16:22,569 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fsll_buckets_true_unreach_call_true_valid_memsafety_i____uint64_t in sll-buckets_true-unreach-call_true-valid-memsafety.i [2018-04-10 14:16:22,569 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fsll_buckets_true_unreach_call_true_valid_memsafety_i__ssize_t in sll-buckets_true-unreach-call_true-valid-memsafety.i [2018-04-10 14:16:22,569 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fsll_buckets_true_unreach_call_true_valid_memsafety_i__fd_mask in sll-buckets_true-unreach-call_true-valid-memsafety.i [2018-04-10 14:16:22,569 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fsll_buckets_true_unreach_call_true_valid_memsafety_i____off_t in sll-buckets_true-unreach-call_true-valid-memsafety.i [2018-04-10 14:16:22,569 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fsll_buckets_true_unreach_call_true_valid_memsafety_i__ulong in sll-buckets_true-unreach-call_true-valid-memsafety.i [2018-04-10 14:16:22,569 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fsll_buckets_true_unreach_call_true_valid_memsafety_i__u_long in sll-buckets_true-unreach-call_true-valid-memsafety.i [2018-04-10 14:16:22,569 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fsll_buckets_true_unreach_call_true_valid_memsafety_i____fsword_t in sll-buckets_true-unreach-call_true-valid-memsafety.i [2018-04-10 14:16:22,570 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fsll_buckets_true_unreach_call_true_valid_memsafety_i__pthread_rwlockattr_t in sll-buckets_true-unreach-call_true-valid-memsafety.i [2018-04-10 14:16:22,570 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fsll_buckets_true_unreach_call_true_valid_memsafety_i__sigset_t in sll-buckets_true-unreach-call_true-valid-memsafety.i [2018-04-10 14:16:22,570 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fsll_buckets_true_unreach_call_true_valid_memsafety_i____int8_t in sll-buckets_true-unreach-call_true-valid-memsafety.i [2018-04-10 14:16:22,570 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fsll_buckets_true_unreach_call_true_valid_memsafety_i__register_t in sll-buckets_true-unreach-call_true-valid-memsafety.i [2018-04-10 14:16:22,570 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fsll_buckets_true_unreach_call_true_valid_memsafety_i__pthread_barrierattr_t in sll-buckets_true-unreach-call_true-valid-memsafety.i [2018-04-10 14:16:22,570 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fsll_buckets_true_unreach_call_true_valid_memsafety_i____blksize_t in sll-buckets_true-unreach-call_true-valid-memsafety.i [2018-04-10 14:16:22,570 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fsll_buckets_true_unreach_call_true_valid_memsafety_i__pthread_rwlock_t in sll-buckets_true-unreach-call_true-valid-memsafety.i [2018-04-10 14:16:22,570 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fsll_buckets_true_unreach_call_true_valid_memsafety_i__u_int64_t in sll-buckets_true-unreach-call_true-valid-memsafety.i [2018-04-10 14:16:22,570 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fsll_buckets_true_unreach_call_true_valid_memsafety_i____fsfilcnt64_t in sll-buckets_true-unreach-call_true-valid-memsafety.i [2018-04-10 14:16:22,570 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fsll_buckets_true_unreach_call_true_valid_memsafety_i____qaddr_t in sll-buckets_true-unreach-call_true-valid-memsafety.i [2018-04-10 14:16:22,571 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fsll_buckets_true_unreach_call_true_valid_memsafety_i__loff_t in sll-buckets_true-unreach-call_true-valid-memsafety.i [2018-04-10 14:16:22,571 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fsll_buckets_true_unreach_call_true_valid_memsafety_i____uint16_t in sll-buckets_true-unreach-call_true-valid-memsafety.i [2018-04-10 14:16:22,571 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fsll_buckets_true_unreach_call_true_valid_memsafety_i____rlim64_t in sll-buckets_true-unreach-call_true-valid-memsafety.i [2018-04-10 14:16:22,571 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fsll_buckets_true_unreach_call_true_valid_memsafety_i____fsblkcnt_t in sll-buckets_true-unreach-call_true-valid-memsafety.i [2018-04-10 14:16:22,571 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fsll_buckets_true_unreach_call_true_valid_memsafety_i__int8_t in sll-buckets_true-unreach-call_true-valid-memsafety.i [2018-04-10 14:16:22,571 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fsll_buckets_true_unreach_call_true_valid_memsafety_i__pthread_key_t in sll-buckets_true-unreach-call_true-valid-memsafety.i [2018-04-10 14:16:22,571 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fsll_buckets_true_unreach_call_true_valid_memsafety_i____time_t in sll-buckets_true-unreach-call_true-valid-memsafety.i [2018-04-10 14:16:22,571 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fsll_buckets_true_unreach_call_true_valid_memsafety_i____key_t in sll-buckets_true-unreach-call_true-valid-memsafety.i [2018-04-10 14:16:22,571 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fsll_buckets_true_unreach_call_true_valid_memsafety_i__u_quad_t in sll-buckets_true-unreach-call_true-valid-memsafety.i [2018-04-10 14:16:22,571 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fsll_buckets_true_unreach_call_true_valid_memsafety_i__ushort in sll-buckets_true-unreach-call_true-valid-memsafety.i [2018-04-10 14:16:22,572 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fsll_buckets_true_unreach_call_true_valid_memsafety_i____uint8_t in sll-buckets_true-unreach-call_true-valid-memsafety.i [2018-04-10 14:16:22,572 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fsll_buckets_true_unreach_call_true_valid_memsafety_i____int64_t in sll-buckets_true-unreach-call_true-valid-memsafety.i [2018-04-10 14:16:22,572 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fsll_buckets_true_unreach_call_true_valid_memsafety_i____useconds_t in sll-buckets_true-unreach-call_true-valid-memsafety.i [2018-04-10 14:16:22,572 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fsll_buckets_true_unreach_call_true_valid_memsafety_i__pthread_mutex_t in sll-buckets_true-unreach-call_true-valid-memsafety.i [2018-04-10 14:16:22,572 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fsll_buckets_true_unreach_call_true_valid_memsafety_i__ldiv_t in sll-buckets_true-unreach-call_true-valid-memsafety.i [2018-04-10 14:16:22,572 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fsll_buckets_true_unreach_call_true_valid_memsafety_i__ino_t in sll-buckets_true-unreach-call_true-valid-memsafety.i [2018-04-10 14:16:22,572 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fsll_buckets_true_unreach_call_true_valid_memsafety_i__u_int in sll-buckets_true-unreach-call_true-valid-memsafety.i [2018-04-10 14:16:22,572 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fsll_buckets_true_unreach_call_true_valid_memsafety_i____rlim_t in sll-buckets_true-unreach-call_true-valid-memsafety.i [2018-04-10 14:16:22,572 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fsll_buckets_true_unreach_call_true_valid_memsafety_i____u_short in sll-buckets_true-unreach-call_true-valid-memsafety.i [2018-04-10 14:16:22,572 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fsll_buckets_true_unreach_call_true_valid_memsafety_i____fsfilcnt_t in sll-buckets_true-unreach-call_true-valid-memsafety.i [2018-04-10 14:16:22,572 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fsll_buckets_true_unreach_call_true_valid_memsafety_i__mode_t in sll-buckets_true-unreach-call_true-valid-memsafety.i [2018-04-10 14:16:22,573 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fsll_buckets_true_unreach_call_true_valid_memsafety_i__caddr_t in sll-buckets_true-unreach-call_true-valid-memsafety.i [2018-04-10 14:16:22,573 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fsll_buckets_true_unreach_call_true_valid_memsafety_i__pthread_mutexattr_t in sll-buckets_true-unreach-call_true-valid-memsafety.i [2018-04-10 14:16:22,573 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fsll_buckets_true_unreach_call_true_valid_memsafety_i__key_t in sll-buckets_true-unreach-call_true-valid-memsafety.i [2018-04-10 14:16:22,573 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fsll_buckets_true_unreach_call_true_valid_memsafety_i____timer_t in sll-buckets_true-unreach-call_true-valid-memsafety.i [2018-04-10 14:16:22,573 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fsll_buckets_true_unreach_call_true_valid_memsafety_i__time_t in sll-buckets_true-unreach-call_true-valid-memsafety.i [2018-04-10 14:16:22,573 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fsll_buckets_true_unreach_call_true_valid_memsafety_i__size_t in sll-buckets_true-unreach-call_true-valid-memsafety.i [2018-04-10 14:16:22,573 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fsll_buckets_true_unreach_call_true_valid_memsafety_i__fsblkcnt_t in sll-buckets_true-unreach-call_true-valid-memsafety.i [2018-04-10 14:16:22,573 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fsll_buckets_true_unreach_call_true_valid_memsafety_i____pthread_slist_t in sll-buckets_true-unreach-call_true-valid-memsafety.i [2018-04-10 14:16:22,573 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fsll_buckets_true_unreach_call_true_valid_memsafety_i____int32_t in sll-buckets_true-unreach-call_true-valid-memsafety.i [2018-04-10 14:16:22,573 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fsll_buckets_true_unreach_call_true_valid_memsafety_i____uint32_t in sll-buckets_true-unreach-call_true-valid-memsafety.i [2018-04-10 14:16:22,573 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fsll_buckets_true_unreach_call_true_valid_memsafety_i____intptr_t in sll-buckets_true-unreach-call_true-valid-memsafety.i [2018-04-10 14:16:22,574 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fsll_buckets_true_unreach_call_true_valid_memsafety_i__div_t in sll-buckets_true-unreach-call_true-valid-memsafety.i [2018-04-10 14:16:22,574 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fsll_buckets_true_unreach_call_true_valid_memsafety_i__pid_t in sll-buckets_true-unreach-call_true-valid-memsafety.i [2018-04-10 14:16:22,574 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fsll_buckets_true_unreach_call_true_valid_memsafety_i__fd_set in sll-buckets_true-unreach-call_true-valid-memsafety.i [2018-04-10 14:16:22,574 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fsll_buckets_true_unreach_call_true_valid_memsafety_i__int32_t in sll-buckets_true-unreach-call_true-valid-memsafety.i [2018-04-10 14:16:22,574 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fsll_buckets_true_unreach_call_true_valid_memsafety_i__blksize_t in sll-buckets_true-unreach-call_true-valid-memsafety.i [2018-04-10 14:16:22,574 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fsll_buckets_true_unreach_call_true_valid_memsafety_i____dev_t in sll-buckets_true-unreach-call_true-valid-memsafety.i [2018-04-10 14:16:22,574 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fsll_buckets_true_unreach_call_true_valid_memsafety_i____mode_t in sll-buckets_true-unreach-call_true-valid-memsafety.i [2018-04-10 14:16:22,574 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fsll_buckets_true_unreach_call_true_valid_memsafety_i__idtype_t in sll-buckets_true-unreach-call_true-valid-memsafety.i [2018-04-10 14:16:22,574 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fsll_buckets_true_unreach_call_true_valid_memsafety_i____ssize_t in sll-buckets_true-unreach-call_true-valid-memsafety.i [2018-04-10 14:16:22,574 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fsll_buckets_true_unreach_call_true_valid_memsafety_i____nlink_t in sll-buckets_true-unreach-call_true-valid-memsafety.i [2018-04-10 14:16:22,574 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fsll_buckets_true_unreach_call_true_valid_memsafety_i____caddr_t in sll-buckets_true-unreach-call_true-valid-memsafety.i [2018-04-10 14:16:22,574 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fsll_buckets_true_unreach_call_true_valid_memsafety_i__u_short in sll-buckets_true-unreach-call_true-valid-memsafety.i [2018-04-10 14:16:22,574 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fsll_buckets_true_unreach_call_true_valid_memsafety_i__gid_t in sll-buckets_true-unreach-call_true-valid-memsafety.i [2018-04-10 14:16:22,574 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fsll_buckets_true_unreach_call_true_valid_memsafety_i__fsfilcnt_t in sll-buckets_true-unreach-call_true-valid-memsafety.i [2018-04-10 14:16:22,574 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fsll_buckets_true_unreach_call_true_valid_memsafety_i____blkcnt64_t in sll-buckets_true-unreach-call_true-valid-memsafety.i [2018-04-10 14:16:22,574 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fsll_buckets_true_unreach_call_true_valid_memsafety_i____fsblkcnt64_t in sll-buckets_true-unreach-call_true-valid-memsafety.i [2018-04-10 14:16:22,574 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fsll_buckets_true_unreach_call_true_valid_memsafety_i__u_int32_t in sll-buckets_true-unreach-call_true-valid-memsafety.i [2018-04-10 14:16:22,574 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fsll_buckets_true_unreach_call_true_valid_memsafety_i__blkcnt_t in sll-buckets_true-unreach-call_true-valid-memsafety.i [2018-04-10 14:16:22,575 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fsll_buckets_true_unreach_call_true_valid_memsafety_i__timer_t in sll-buckets_true-unreach-call_true-valid-memsafety.i [2018-04-10 14:16:22,575 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fsll_buckets_true_unreach_call_true_valid_memsafety_i____int16_t in sll-buckets_true-unreach-call_true-valid-memsafety.i [2018-04-10 14:16:22,575 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fsll_buckets_true_unreach_call_true_valid_memsafety_i__u_char in sll-buckets_true-unreach-call_true-valid-memsafety.i [2018-04-10 14:16:22,575 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fsll_buckets_true_unreach_call_true_valid_memsafety_i__off_t in sll-buckets_true-unreach-call_true-valid-memsafety.i [2018-04-10 14:16:22,575 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fsll_buckets_true_unreach_call_true_valid_memsafety_i____syscall_ulong_t in sll-buckets_true-unreach-call_true-valid-memsafety.i [2018-04-10 14:16:22,575 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fsll_buckets_true_unreach_call_true_valid_memsafety_i____u_long in sll-buckets_true-unreach-call_true-valid-memsafety.i [2018-04-10 14:16:22,575 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fsll_buckets_true_unreach_call_true_valid_memsafety_i____id_t in sll-buckets_true-unreach-call_true-valid-memsafety.i [2018-04-10 14:16:22,575 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fsll_buckets_true_unreach_call_true_valid_memsafety_i__pthread_once_t in sll-buckets_true-unreach-call_true-valid-memsafety.i [2018-04-10 14:16:22,575 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fsll_buckets_true_unreach_call_true_valid_memsafety_i__wchar_t in sll-buckets_true-unreach-call_true-valid-memsafety.i [2018-04-10 14:16:22,575 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fsll_buckets_true_unreach_call_true_valid_memsafety_i____socklen_t in sll-buckets_true-unreach-call_true-valid-memsafety.i [2018-04-10 14:16:22,575 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fsll_buckets_true_unreach_call_true_valid_memsafety_i__lldiv_t in sll-buckets_true-unreach-call_true-valid-memsafety.i [2018-04-10 14:16:22,575 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fsll_buckets_true_unreach_call_true_valid_memsafety_i____quad_t in sll-buckets_true-unreach-call_true-valid-memsafety.i [2018-04-10 14:16:22,575 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fsll_buckets_true_unreach_call_true_valid_memsafety_i__int16_t in sll-buckets_true-unreach-call_true-valid-memsafety.i [2018-04-10 14:16:22,575 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fsll_buckets_true_unreach_call_true_valid_memsafety_i__uid_t in sll-buckets_true-unreach-call_true-valid-memsafety.i [2018-04-10 14:16:22,575 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fsll_buckets_true_unreach_call_true_valid_memsafety_i____u_char in sll-buckets_true-unreach-call_true-valid-memsafety.i [2018-04-10 14:16:22,575 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fsll_buckets_true_unreach_call_true_valid_memsafety_i____off64_t in sll-buckets_true-unreach-call_true-valid-memsafety.i [2018-04-10 14:16:22,575 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fsll_buckets_true_unreach_call_true_valid_memsafety_i____suseconds_t in sll-buckets_true-unreach-call_true-valid-memsafety.i [2018-04-10 14:16:22,575 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fsll_buckets_true_unreach_call_true_valid_memsafety_i__pthread_attr_t in sll-buckets_true-unreach-call_true-valid-memsafety.i [2018-04-10 14:16:22,575 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fsll_buckets_true_unreach_call_true_valid_memsafety_i____u_quad_t in sll-buckets_true-unreach-call_true-valid-memsafety.i [2018-04-10 14:16:22,575 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fsll_buckets_true_unreach_call_true_valid_memsafety_i__pthread_barrier_t in sll-buckets_true-unreach-call_true-valid-memsafety.i [2018-04-10 14:16:22,589 INFO L330 CDTParser]: Deleted temporary CDT project at /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/data/FLAGf471cc0fe [2018-04-10 14:16:22,592 INFO L304 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-04-10 14:16:22,593 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2018-04-10 14:16:22,594 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-04-10 14:16:22,594 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-04-10 14:16:22,599 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-04-10 14:16:22,599 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.04 02:16:22" (1/1) ... [2018-04-10 14:16:22,601 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@66547265 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.04 02:16:22, skipping insertion in model container [2018-04-10 14:16:22,602 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.04 02:16:22" (1/1) ... [2018-04-10 14:16:22,615 INFO L167 Dispatcher]: Using SV-COMP mode [2018-04-10 14:16:22,641 INFO L167 Dispatcher]: Using SV-COMP mode [2018-04-10 14:16:22,758 INFO L175 PostProcessor]: Settings: Checked method=main [2018-04-10 14:16:22,795 INFO L175 PostProcessor]: Settings: Checked method=main [2018-04-10 14:16:22,801 INFO L100 SccComputation]: Graph consists of 0 InCaSumBalls and 115 non ball SCCs. Number of states in SCCs 115. [2018-04-10 14:16:22,837 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.04 02:16:22 WrapperNode [2018-04-10 14:16:22,838 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-04-10 14:16:22,838 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-04-10 14:16:22,838 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-04-10 14:16:22,838 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-04-10 14:16:22,849 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.04 02:16:22" (1/1) ... [2018-04-10 14:16:22,849 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.04 02:16:22" (1/1) ... [2018-04-10 14:16:22,862 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.04 02:16:22" (1/1) ... [2018-04-10 14:16:22,862 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.04 02:16:22" (1/1) ... [2018-04-10 14:16:22,872 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.04 02:16:22" (1/1) ... [2018-04-10 14:16:22,878 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.04 02:16:22" (1/1) ... [2018-04-10 14:16:22,880 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.04 02:16:22" (1/1) ... [2018-04-10 14:16:22,884 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-04-10 14:16:22,884 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-04-10 14:16:22,884 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-04-10 14:16:22,884 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-04-10 14:16:22,885 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.04 02:16:22" (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:16:22,963 INFO L136 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-04-10 14:16:22,964 INFO L136 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-04-10 14:16:22,964 INFO L136 BoogieDeclarations]: Found implementation of procedure main [2018-04-10 14:16:22,964 INFO L128 BoogieDeclarations]: Found specification of procedure __ctype_get_mb_cur_max [2018-04-10 14:16:22,964 INFO L128 BoogieDeclarations]: Found specification of procedure atof [2018-04-10 14:16:22,964 INFO L128 BoogieDeclarations]: Found specification of procedure atoi [2018-04-10 14:16:22,964 INFO L128 BoogieDeclarations]: Found specification of procedure atol [2018-04-10 14:16:22,964 INFO L128 BoogieDeclarations]: Found specification of procedure atoll [2018-04-10 14:16:22,964 INFO L128 BoogieDeclarations]: Found specification of procedure strtod [2018-04-10 14:16:22,964 INFO L128 BoogieDeclarations]: Found specification of procedure strtof [2018-04-10 14:16:22,964 INFO L128 BoogieDeclarations]: Found specification of procedure strtold [2018-04-10 14:16:22,964 INFO L128 BoogieDeclarations]: Found specification of procedure strtol [2018-04-10 14:16:22,964 INFO L128 BoogieDeclarations]: Found specification of procedure strtoul [2018-04-10 14:16:22,965 INFO L128 BoogieDeclarations]: Found specification of procedure strtoq [2018-04-10 14:16:22,965 INFO L128 BoogieDeclarations]: Found specification of procedure strtouq [2018-04-10 14:16:22,965 INFO L128 BoogieDeclarations]: Found specification of procedure strtoll [2018-04-10 14:16:22,965 INFO L128 BoogieDeclarations]: Found specification of procedure strtoull [2018-04-10 14:16:22,965 INFO L128 BoogieDeclarations]: Found specification of procedure l64a [2018-04-10 14:16:22,965 INFO L128 BoogieDeclarations]: Found specification of procedure a64l [2018-04-10 14:16:22,965 INFO L128 BoogieDeclarations]: Found specification of procedure select [2018-04-10 14:16:22,965 INFO L128 BoogieDeclarations]: Found specification of procedure pselect [2018-04-10 14:16:22,965 INFO L128 BoogieDeclarations]: Found specification of procedure gnu_dev_major [2018-04-10 14:16:22,966 INFO L128 BoogieDeclarations]: Found specification of procedure gnu_dev_minor [2018-04-10 14:16:22,966 INFO L128 BoogieDeclarations]: Found specification of procedure gnu_dev_makedev [2018-04-10 14:16:22,966 INFO L128 BoogieDeclarations]: Found specification of procedure random [2018-04-10 14:16:22,966 INFO L128 BoogieDeclarations]: Found specification of procedure srandom [2018-04-10 14:16:22,966 INFO L128 BoogieDeclarations]: Found specification of procedure initstate [2018-04-10 14:16:22,966 INFO L128 BoogieDeclarations]: Found specification of procedure setstate [2018-04-10 14:16:22,966 INFO L128 BoogieDeclarations]: Found specification of procedure random_r [2018-04-10 14:16:22,966 INFO L128 BoogieDeclarations]: Found specification of procedure srandom_r [2018-04-10 14:16:22,967 INFO L128 BoogieDeclarations]: Found specification of procedure initstate_r [2018-04-10 14:16:22,967 INFO L128 BoogieDeclarations]: Found specification of procedure setstate_r [2018-04-10 14:16:22,967 INFO L128 BoogieDeclarations]: Found specification of procedure rand [2018-04-10 14:16:22,967 INFO L128 BoogieDeclarations]: Found specification of procedure srand [2018-04-10 14:16:22,967 INFO L128 BoogieDeclarations]: Found specification of procedure rand_r [2018-04-10 14:16:22,967 INFO L128 BoogieDeclarations]: Found specification of procedure drand48 [2018-04-10 14:16:22,967 INFO L128 BoogieDeclarations]: Found specification of procedure erand48 [2018-04-10 14:16:22,967 INFO L128 BoogieDeclarations]: Found specification of procedure lrand48 [2018-04-10 14:16:22,967 INFO L128 BoogieDeclarations]: Found specification of procedure nrand48 [2018-04-10 14:16:22,968 INFO L128 BoogieDeclarations]: Found specification of procedure mrand48 [2018-04-10 14:16:22,968 INFO L128 BoogieDeclarations]: Found specification of procedure jrand48 [2018-04-10 14:16:22,968 INFO L128 BoogieDeclarations]: Found specification of procedure srand48 [2018-04-10 14:16:22,968 INFO L128 BoogieDeclarations]: Found specification of procedure seed48 [2018-04-10 14:16:22,968 INFO L128 BoogieDeclarations]: Found specification of procedure lcong48 [2018-04-10 14:16:22,968 INFO L128 BoogieDeclarations]: Found specification of procedure drand48_r [2018-04-10 14:16:22,968 INFO L128 BoogieDeclarations]: Found specification of procedure erand48_r [2018-04-10 14:16:22,968 INFO L128 BoogieDeclarations]: Found specification of procedure lrand48_r [2018-04-10 14:16:22,968 INFO L128 BoogieDeclarations]: Found specification of procedure nrand48_r [2018-04-10 14:16:22,968 INFO L128 BoogieDeclarations]: Found specification of procedure mrand48_r [2018-04-10 14:16:22,968 INFO L128 BoogieDeclarations]: Found specification of procedure jrand48_r [2018-04-10 14:16:22,969 INFO L128 BoogieDeclarations]: Found specification of procedure srand48_r [2018-04-10 14:16:22,969 INFO L128 BoogieDeclarations]: Found specification of procedure seed48_r [2018-04-10 14:16:22,969 INFO L128 BoogieDeclarations]: Found specification of procedure lcong48_r [2018-04-10 14:16:22,969 INFO L128 BoogieDeclarations]: Found specification of procedure malloc [2018-04-10 14:16:22,969 INFO L128 BoogieDeclarations]: Found specification of procedure calloc [2018-04-10 14:16:22,969 INFO L128 BoogieDeclarations]: Found specification of procedure realloc [2018-04-10 14:16:22,969 INFO L128 BoogieDeclarations]: Found specification of procedure free [2018-04-10 14:16:22,969 INFO L128 BoogieDeclarations]: Found specification of procedure cfree [2018-04-10 14:16:22,969 INFO L128 BoogieDeclarations]: Found specification of procedure alloca [2018-04-10 14:16:22,969 INFO L128 BoogieDeclarations]: Found specification of procedure valloc [2018-04-10 14:16:22,970 INFO L128 BoogieDeclarations]: Found specification of procedure posix_memalign [2018-04-10 14:16:22,970 INFO L128 BoogieDeclarations]: Found specification of procedure aligned_alloc [2018-04-10 14:16:22,970 INFO L128 BoogieDeclarations]: Found specification of procedure abort [2018-04-10 14:16:22,970 INFO L128 BoogieDeclarations]: Found specification of procedure atexit [2018-04-10 14:16:22,970 INFO L128 BoogieDeclarations]: Found specification of procedure at_quick_exit [2018-04-10 14:16:22,970 INFO L128 BoogieDeclarations]: Found specification of procedure on_exit [2018-04-10 14:16:22,970 INFO L128 BoogieDeclarations]: Found specification of procedure exit [2018-04-10 14:16:22,970 INFO L128 BoogieDeclarations]: Found specification of procedure quick_exit [2018-04-10 14:16:22,970 INFO L128 BoogieDeclarations]: Found specification of procedure _Exit [2018-04-10 14:16:22,970 INFO L128 BoogieDeclarations]: Found specification of procedure getenv [2018-04-10 14:16:22,971 INFO L128 BoogieDeclarations]: Found specification of procedure putenv [2018-04-10 14:16:22,971 INFO L128 BoogieDeclarations]: Found specification of procedure setenv [2018-04-10 14:16:22,971 INFO L128 BoogieDeclarations]: Found specification of procedure unsetenv [2018-04-10 14:16:22,971 INFO L128 BoogieDeclarations]: Found specification of procedure clearenv [2018-04-10 14:16:22,971 INFO L128 BoogieDeclarations]: Found specification of procedure mktemp [2018-04-10 14:16:22,971 INFO L128 BoogieDeclarations]: Found specification of procedure mkstemp [2018-04-10 14:16:22,971 INFO L128 BoogieDeclarations]: Found specification of procedure mkstemps [2018-04-10 14:16:22,971 INFO L128 BoogieDeclarations]: Found specification of procedure mkdtemp [2018-04-10 14:16:22,971 INFO L128 BoogieDeclarations]: Found specification of procedure system [2018-04-10 14:16:22,971 INFO L128 BoogieDeclarations]: Found specification of procedure realpath [2018-04-10 14:16:22,971 INFO L128 BoogieDeclarations]: Found specification of procedure bsearch [2018-04-10 14:16:22,972 INFO L128 BoogieDeclarations]: Found specification of procedure qsort [2018-04-10 14:16:22,972 INFO L128 BoogieDeclarations]: Found specification of procedure abs [2018-04-10 14:16:22,972 INFO L128 BoogieDeclarations]: Found specification of procedure labs [2018-04-10 14:16:22,972 INFO L128 BoogieDeclarations]: Found specification of procedure llabs [2018-04-10 14:16:22,972 INFO L128 BoogieDeclarations]: Found specification of procedure div [2018-04-10 14:16:22,972 INFO L128 BoogieDeclarations]: Found specification of procedure ldiv [2018-04-10 14:16:22,972 INFO L128 BoogieDeclarations]: Found specification of procedure lldiv [2018-04-10 14:16:22,972 INFO L128 BoogieDeclarations]: Found specification of procedure ecvt [2018-04-10 14:16:22,972 INFO L128 BoogieDeclarations]: Found specification of procedure fcvt [2018-04-10 14:16:22,972 INFO L128 BoogieDeclarations]: Found specification of procedure gcvt [2018-04-10 14:16:22,973 INFO L128 BoogieDeclarations]: Found specification of procedure qecvt [2018-04-10 14:16:22,973 INFO L128 BoogieDeclarations]: Found specification of procedure qfcvt [2018-04-10 14:16:22,973 INFO L128 BoogieDeclarations]: Found specification of procedure qgcvt [2018-04-10 14:16:22,973 INFO L128 BoogieDeclarations]: Found specification of procedure ecvt_r [2018-04-10 14:16:22,973 INFO L128 BoogieDeclarations]: Found specification of procedure fcvt_r [2018-04-10 14:16:22,973 INFO L128 BoogieDeclarations]: Found specification of procedure qecvt_r [2018-04-10 14:16:22,973 INFO L128 BoogieDeclarations]: Found specification of procedure qfcvt_r [2018-04-10 14:16:22,973 INFO L128 BoogieDeclarations]: Found specification of procedure mblen [2018-04-10 14:16:22,973 INFO L128 BoogieDeclarations]: Found specification of procedure mbtowc [2018-04-10 14:16:22,973 INFO L128 BoogieDeclarations]: Found specification of procedure wctomb [2018-04-10 14:16:22,973 INFO L128 BoogieDeclarations]: Found specification of procedure mbstowcs [2018-04-10 14:16:22,974 INFO L128 BoogieDeclarations]: Found specification of procedure wcstombs [2018-04-10 14:16:22,974 INFO L128 BoogieDeclarations]: Found specification of procedure rpmatch [2018-04-10 14:16:22,974 INFO L128 BoogieDeclarations]: Found specification of procedure getsubopt [2018-04-10 14:16:22,974 INFO L128 BoogieDeclarations]: Found specification of procedure getloadavg [2018-04-10 14:16:22,974 INFO L128 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2018-04-10 14:16:22,974 INFO L128 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2018-04-10 14:16:22,974 INFO L128 BoogieDeclarations]: Found specification of procedure main [2018-04-10 14:16:22,974 INFO L128 BoogieDeclarations]: Found specification of procedure #Ultimate.alloc [2018-04-10 14:16:22,974 INFO L128 BoogieDeclarations]: Found specification of procedure write~int [2018-04-10 14:16:22,974 INFO L128 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2018-04-10 14:16:22,975 INFO L128 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2018-04-10 14:16:22,975 INFO L128 BoogieDeclarations]: Found specification of procedure read~int [2018-04-10 14:16:22,975 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2018-04-10 14:16:22,975 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-04-10 14:16:22,975 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-04-10 14:16:22,975 INFO L128 BoogieDeclarations]: Found specification of procedure write~unchecked~int [2018-04-10 14:16:23,391 INFO L259 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-04-10 14:16:23,391 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.04 02:16:23 BoogieIcfgContainer [2018-04-10 14:16:23,391 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-04-10 14:16:23,392 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-04-10 14:16:23,392 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-04-10 14:16:23,394 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-04-10 14:16:23,394 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 10.04 02:16:22" (1/3) ... [2018-04-10 14:16:23,394 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@27fde8cd and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.04 02:16:23, skipping insertion in model container [2018-04-10 14:16:23,394 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.04 02:16:22" (2/3) ... [2018-04-10 14:16:23,394 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@27fde8cd and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.04 02:16:23, skipping insertion in model container [2018-04-10 14:16:23,394 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.04 02:16:23" (3/3) ... [2018-04-10 14:16:23,396 INFO L107 eAbstractionObserver]: Analyzing ICFG sll-buckets_true-unreach-call_true-valid-memsafety.i [2018-04-10 14:16:23,404 INFO L131 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-04-10 14:16:23,409 INFO L143 ceAbstractionStarter]: Appying trace abstraction to program that has 65 error locations. [2018-04-10 14:16:23,432 INFO L128 ementStrategyFactory]: Using default assertion order modulation [2018-04-10 14:16:23,432 INFO L369 AbstractCegarLoop]: Interprodecural is true [2018-04-10 14:16:23,432 INFO L370 AbstractCegarLoop]: Hoare is false [2018-04-10 14:16:23,432 INFO L371 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-04-10 14:16:23,432 INFO L372 AbstractCegarLoop]: Backedges is TWOTRACK [2018-04-10 14:16:23,433 INFO L373 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-04-10 14:16:23,433 INFO L374 AbstractCegarLoop]: Difference is false [2018-04-10 14:16:23,433 INFO L375 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-04-10 14:16:23,433 INFO L380 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-04-10 14:16:23,433 INFO L87 2NestedWordAutomaton]: Mode: main mode - execution starts in main procedure [2018-04-10 14:16:23,444 INFO L276 IsEmpty]: Start isEmpty. Operand 160 states. [2018-04-10 14:16:23,451 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2018-04-10 14:16:23,451 INFO L347 BasicCegarLoop]: Found error trace [2018-04-10 14:16:23,451 INFO L355 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2018-04-10 14:16:23,451 INFO L408 AbstractCegarLoop]: === Iteration 1 === [mainErr51RequiresViolation, mainErr26RequiresViolation, mainErr54RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr31RequiresViolation, mainErr46RequiresViolation, mainErr29RequiresViolation, mainErr58AssertViolationMEMORY_FREE, mainErr3RequiresViolation, mainErr15RequiresViolation, mainErr49RequiresViolation, mainErr63AssertViolationMEMORY_FREE, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr55RequiresViolation, mainErr17RequiresViolation, mainErr42RequiresViolation, mainErr30RequiresViolation, mainErr11RequiresViolation, mainErr57RequiresViolation, mainErr24RequiresViolation, mainErr44RequiresViolation, mainErr10RequiresViolation, mainErr43RequiresViolation, mainErr4RequiresViolation, mainErr50RequiresViolation, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr59AssertViolationMEMORY_FREE, mainErr36RequiresViolation, mainErr61RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr56RequiresViolation, mainErr62AssertViolationMEMORY_FREE, mainErr64EnsuresViolationMEMORY_LEAK, mainErr48RequiresViolation, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr52RequiresViolation, mainErr45RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr60RequiresViolation, mainErr9RequiresViolation, mainErr53RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr34RequiresViolation, mainErr47RequiresViolation, mainErr14RequiresViolation, mainErr40RequiresViolation]=== [2018-04-10 14:16:23,454 INFO L82 PathProgramCache]: Analyzing trace with hash 723887450, now seen corresponding path program 1 times [2018-04-10 14:16:23,455 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-04-10 14:16:23,455 INFO L68 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-04-10 14:16:23,487 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-10 14:16:23,487 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-10 14:16:23,487 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-10 14:16:23,508 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-10 14:16:23,513 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:23,551 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:16:23,553 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-04-10 14:16:23,554 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-04-10 14:16:23,555 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-04-10 14:16:23,567 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-04-10 14:16:23,567 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-04-10 14:16:23,569 INFO L87 Difference]: Start difference. First operand 160 states. Second operand 4 states. [2018-04-10 14:16:23,726 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-10 14:16:23,727 INFO L93 Difference]: Finished difference Result 202 states and 211 transitions. [2018-04-10 14:16:23,736 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-04-10 14:16:23,737 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 8 [2018-04-10 14:16:23,738 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-10 14:16:23,745 INFO L225 Difference]: With dead ends: 202 [2018-04-10 14:16:23,745 INFO L226 Difference]: Without dead ends: 198 [2018-04-10 14:16:23,747 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:16:23,758 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 198 states. [2018-04-10 14:16:23,773 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 198 to 153. [2018-04-10 14:16:23,774 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 153 states. [2018-04-10 14:16:23,776 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 153 states to 153 states and 160 transitions. [2018-04-10 14:16:23,777 INFO L78 Accepts]: Start accepts. Automaton has 153 states and 160 transitions. Word has length 8 [2018-04-10 14:16:23,777 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-10 14:16:23,777 INFO L459 AbstractCegarLoop]: Abstraction has 153 states and 160 transitions. [2018-04-10 14:16:23,777 INFO L460 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-04-10 14:16:23,777 INFO L276 IsEmpty]: Start isEmpty. Operand 153 states and 160 transitions. [2018-04-10 14:16:23,778 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2018-04-10 14:16:23,778 INFO L347 BasicCegarLoop]: Found error trace [2018-04-10 14:16:23,778 INFO L355 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2018-04-10 14:16:23,778 INFO L408 AbstractCegarLoop]: === Iteration 2 === [mainErr51RequiresViolation, mainErr26RequiresViolation, mainErr54RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr31RequiresViolation, mainErr46RequiresViolation, mainErr29RequiresViolation, mainErr58AssertViolationMEMORY_FREE, mainErr3RequiresViolation, mainErr15RequiresViolation, mainErr49RequiresViolation, mainErr63AssertViolationMEMORY_FREE, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr55RequiresViolation, mainErr17RequiresViolation, mainErr42RequiresViolation, mainErr30RequiresViolation, mainErr11RequiresViolation, mainErr57RequiresViolation, mainErr24RequiresViolation, mainErr44RequiresViolation, mainErr10RequiresViolation, mainErr43RequiresViolation, mainErr4RequiresViolation, mainErr50RequiresViolation, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr59AssertViolationMEMORY_FREE, mainErr36RequiresViolation, mainErr61RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr56RequiresViolation, mainErr62AssertViolationMEMORY_FREE, mainErr64EnsuresViolationMEMORY_LEAK, mainErr48RequiresViolation, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr52RequiresViolation, mainErr45RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr60RequiresViolation, mainErr9RequiresViolation, mainErr53RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr34RequiresViolation, mainErr47RequiresViolation, mainErr14RequiresViolation, mainErr40RequiresViolation]=== [2018-04-10 14:16:23,778 INFO L82 PathProgramCache]: Analyzing trace with hash 723887451, now seen corresponding path program 1 times [2018-04-10 14:16:23,778 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-04-10 14:16:23,778 INFO L68 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-04-10 14:16:23,780 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-10 14:16:23,780 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-10 14:16:23,780 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-10 14:16:23,791 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-10 14:16:23,792 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:23,829 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:16:23,829 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-04-10 14:16:23,829 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-04-10 14:16:23,830 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-04-10 14:16:23,831 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-04-10 14:16:23,831 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-04-10 14:16:23,831 INFO L87 Difference]: Start difference. First operand 153 states and 160 transitions. Second operand 4 states. [2018-04-10 14:16:23,994 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-10 14:16:23,994 INFO L93 Difference]: Finished difference Result 236 states and 246 transitions. [2018-04-10 14:16:23,996 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-04-10 14:16:23,996 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 8 [2018-04-10 14:16:23,996 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-10 14:16:23,997 INFO L225 Difference]: With dead ends: 236 [2018-04-10 14:16:23,997 INFO L226 Difference]: Without dead ends: 236 [2018-04-10 14:16:23,998 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:16:23,999 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 236 states. [2018-04-10 14:16:24,004 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 236 to 149. [2018-04-10 14:16:24,005 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 149 states. [2018-04-10 14:16:24,008 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 149 states to 149 states and 156 transitions. [2018-04-10 14:16:24,008 INFO L78 Accepts]: Start accepts. Automaton has 149 states and 156 transitions. Word has length 8 [2018-04-10 14:16:24,008 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-10 14:16:24,008 INFO L459 AbstractCegarLoop]: Abstraction has 149 states and 156 transitions. [2018-04-10 14:16:24,008 INFO L460 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-04-10 14:16:24,008 INFO L276 IsEmpty]: Start isEmpty. Operand 149 states and 156 transitions. [2018-04-10 14:16:24,008 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2018-04-10 14:16:24,009 INFO L347 BasicCegarLoop]: Found error trace [2018-04-10 14:16:24,009 INFO L355 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-10 14:16:24,009 INFO L408 AbstractCegarLoop]: === Iteration 3 === [mainErr51RequiresViolation, mainErr26RequiresViolation, mainErr54RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr31RequiresViolation, mainErr46RequiresViolation, mainErr29RequiresViolation, mainErr58AssertViolationMEMORY_FREE, mainErr3RequiresViolation, mainErr15RequiresViolation, mainErr49RequiresViolation, mainErr63AssertViolationMEMORY_FREE, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr55RequiresViolation, mainErr17RequiresViolation, mainErr42RequiresViolation, mainErr30RequiresViolation, mainErr11RequiresViolation, mainErr57RequiresViolation, mainErr24RequiresViolation, mainErr44RequiresViolation, mainErr10RequiresViolation, mainErr43RequiresViolation, mainErr4RequiresViolation, mainErr50RequiresViolation, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr59AssertViolationMEMORY_FREE, mainErr36RequiresViolation, mainErr61RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr56RequiresViolation, mainErr62AssertViolationMEMORY_FREE, mainErr64EnsuresViolationMEMORY_LEAK, mainErr48RequiresViolation, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr52RequiresViolation, mainErr45RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr60RequiresViolation, mainErr9RequiresViolation, mainErr53RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr34RequiresViolation, mainErr47RequiresViolation, mainErr14RequiresViolation, mainErr40RequiresViolation]=== [2018-04-10 14:16:24,009 INFO L82 PathProgramCache]: Analyzing trace with hash 1344572609, now seen corresponding path program 1 times [2018-04-10 14:16:24,009 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-04-10 14:16:24,009 INFO L68 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-04-10 14:16:24,011 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-10 14:16:24,011 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-10 14:16:24,011 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-10 14:16:24,024 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-10 14:16:24,025 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:24,063 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:16:24,064 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-04-10 14:16:24,064 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-04-10 14:16:24,064 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-04-10 14:16:24,064 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-04-10 14:16:24,064 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-04-10 14:16:24,065 INFO L87 Difference]: Start difference. First operand 149 states and 156 transitions. Second operand 6 states. [2018-04-10 14:16:24,303 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-10 14:16:24,303 INFO L93 Difference]: Finished difference Result 198 states and 207 transitions. [2018-04-10 14:16:24,303 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-04-10 14:16:24,303 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 14 [2018-04-10 14:16:24,304 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-10 14:16:24,305 INFO L225 Difference]: With dead ends: 198 [2018-04-10 14:16:24,305 INFO L226 Difference]: Without dead ends: 198 [2018-04-10 14:16:24,305 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=30, Invalid=60, Unknown=0, NotChecked=0, Total=90 [2018-04-10 14:16:24,305 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 198 states. [2018-04-10 14:16:24,310 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 198 to 150. [2018-04-10 14:16:24,311 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 150 states. [2018-04-10 14:16:24,312 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 150 states to 150 states and 164 transitions. [2018-04-10 14:16:24,312 INFO L78 Accepts]: Start accepts. Automaton has 150 states and 164 transitions. Word has length 14 [2018-04-10 14:16:24,312 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-10 14:16:24,312 INFO L459 AbstractCegarLoop]: Abstraction has 150 states and 164 transitions. [2018-04-10 14:16:24,312 INFO L460 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-04-10 14:16:24,312 INFO L276 IsEmpty]: Start isEmpty. Operand 150 states and 164 transitions. [2018-04-10 14:16:24,313 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2018-04-10 14:16:24,313 INFO L347 BasicCegarLoop]: Found error trace [2018-04-10 14:16:24,313 INFO L355 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-10 14:16:24,313 INFO L408 AbstractCegarLoop]: === Iteration 4 === [mainErr51RequiresViolation, mainErr26RequiresViolation, mainErr54RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr31RequiresViolation, mainErr46RequiresViolation, mainErr29RequiresViolation, mainErr58AssertViolationMEMORY_FREE, mainErr3RequiresViolation, mainErr15RequiresViolation, mainErr49RequiresViolation, mainErr63AssertViolationMEMORY_FREE, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr55RequiresViolation, mainErr17RequiresViolation, mainErr42RequiresViolation, mainErr30RequiresViolation, mainErr11RequiresViolation, mainErr57RequiresViolation, mainErr24RequiresViolation, mainErr44RequiresViolation, mainErr10RequiresViolation, mainErr43RequiresViolation, mainErr4RequiresViolation, mainErr50RequiresViolation, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr59AssertViolationMEMORY_FREE, mainErr36RequiresViolation, mainErr61RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr56RequiresViolation, mainErr62AssertViolationMEMORY_FREE, mainErr64EnsuresViolationMEMORY_LEAK, mainErr48RequiresViolation, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr52RequiresViolation, mainErr45RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr60RequiresViolation, mainErr9RequiresViolation, mainErr53RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr34RequiresViolation, mainErr47RequiresViolation, mainErr14RequiresViolation, mainErr40RequiresViolation]=== [2018-04-10 14:16:24,313 INFO L82 PathProgramCache]: Analyzing trace with hash 1344572610, now seen corresponding path program 1 times [2018-04-10 14:16:24,313 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-04-10 14:16:24,313 INFO L68 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-04-10 14:16:24,315 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-10 14:16:24,315 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-10 14:16:24,315 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-10 14:16:24,326 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-10 14:16:24,327 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:24,375 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:16:24,375 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-04-10 14:16:24,375 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-04-10 14:16:24,375 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-04-10 14:16:24,375 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-04-10 14:16:24,375 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-04-10 14:16:24,376 INFO L87 Difference]: Start difference. First operand 150 states and 164 transitions. Second operand 6 states. [2018-04-10 14:16:24,529 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-10 14:16:24,529 INFO L93 Difference]: Finished difference Result 208 states and 231 transitions. [2018-04-10 14:16:24,529 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-04-10 14:16:24,529 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 14 [2018-04-10 14:16:24,530 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-10 14:16:24,530 INFO L225 Difference]: With dead ends: 208 [2018-04-10 14:16:24,530 INFO L226 Difference]: Without dead ends: 208 [2018-04-10 14:16:24,530 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=30, Invalid=60, Unknown=0, NotChecked=0, Total=90 [2018-04-10 14:16:24,531 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 208 states. [2018-04-10 14:16:24,535 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 208 to 146. [2018-04-10 14:16:24,535 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 146 states. [2018-04-10 14:16:24,536 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 146 states to 146 states and 160 transitions. [2018-04-10 14:16:24,536 INFO L78 Accepts]: Start accepts. Automaton has 146 states and 160 transitions. Word has length 14 [2018-04-10 14:16:24,536 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-10 14:16:24,536 INFO L459 AbstractCegarLoop]: Abstraction has 146 states and 160 transitions. [2018-04-10 14:16:24,536 INFO L460 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-04-10 14:16:24,536 INFO L276 IsEmpty]: Start isEmpty. Operand 146 states and 160 transitions. [2018-04-10 14:16:24,537 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2018-04-10 14:16:24,537 INFO L347 BasicCegarLoop]: Found error trace [2018-04-10 14:16:24,537 INFO L355 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-10 14:16:24,537 INFO L408 AbstractCegarLoop]: === Iteration 5 === [mainErr51RequiresViolation, mainErr26RequiresViolation, mainErr54RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr31RequiresViolation, mainErr46RequiresViolation, mainErr29RequiresViolation, mainErr58AssertViolationMEMORY_FREE, mainErr3RequiresViolation, mainErr15RequiresViolation, mainErr49RequiresViolation, mainErr63AssertViolationMEMORY_FREE, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr55RequiresViolation, mainErr17RequiresViolation, mainErr42RequiresViolation, mainErr30RequiresViolation, mainErr11RequiresViolation, mainErr57RequiresViolation, mainErr24RequiresViolation, mainErr44RequiresViolation, mainErr10RequiresViolation, mainErr43RequiresViolation, mainErr4RequiresViolation, mainErr50RequiresViolation, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr59AssertViolationMEMORY_FREE, mainErr36RequiresViolation, mainErr61RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr56RequiresViolation, mainErr62AssertViolationMEMORY_FREE, mainErr64EnsuresViolationMEMORY_LEAK, mainErr48RequiresViolation, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr52RequiresViolation, mainErr45RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr60RequiresViolation, mainErr9RequiresViolation, mainErr53RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr34RequiresViolation, mainErr47RequiresViolation, mainErr14RequiresViolation, mainErr40RequiresViolation]=== [2018-04-10 14:16:24,537 INFO L82 PathProgramCache]: Analyzing trace with hash 1600897064, now seen corresponding path program 1 times [2018-04-10 14:16:24,537 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-04-10 14:16:24,538 INFO L68 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-04-10 14:16:24,539 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-10 14:16:24,539 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-10 14:16:24,539 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-10 14:16:24,552 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-10 14:16:24,552 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:24,580 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:16:24,580 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-04-10 14:16:24,580 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-04-10 14:16:24,581 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-04-10 14:16:24,581 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-04-10 14:16:24,581 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-04-10 14:16:24,581 INFO L87 Difference]: Start difference. First operand 146 states and 160 transitions. Second operand 6 states. [2018-04-10 14:16:24,715 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-10 14:16:24,715 INFO L93 Difference]: Finished difference Result 193 states and 202 transitions. [2018-04-10 14:16:24,715 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-04-10 14:16:24,715 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 20 [2018-04-10 14:16:24,716 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-10 14:16:24,716 INFO L225 Difference]: With dead ends: 193 [2018-04-10 14:16:24,716 INFO L226 Difference]: Without dead ends: 193 [2018-04-10 14:16:24,716 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2018-04-10 14:16:24,717 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 193 states. [2018-04-10 14:16:24,719 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 193 to 145. [2018-04-10 14:16:24,719 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 145 states. [2018-04-10 14:16:24,720 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 145 states to 145 states and 159 transitions. [2018-04-10 14:16:24,720 INFO L78 Accepts]: Start accepts. Automaton has 145 states and 159 transitions. Word has length 20 [2018-04-10 14:16:24,720 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-10 14:16:24,721 INFO L459 AbstractCegarLoop]: Abstraction has 145 states and 159 transitions. [2018-04-10 14:16:24,721 INFO L460 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-04-10 14:16:24,721 INFO L276 IsEmpty]: Start isEmpty. Operand 145 states and 159 transitions. [2018-04-10 14:16:24,721 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2018-04-10 14:16:24,721 INFO L347 BasicCegarLoop]: Found error trace [2018-04-10 14:16:24,721 INFO L355 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-10 14:16:24,721 INFO L408 AbstractCegarLoop]: === Iteration 6 === [mainErr51RequiresViolation, mainErr26RequiresViolation, mainErr54RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr31RequiresViolation, mainErr46RequiresViolation, mainErr29RequiresViolation, mainErr58AssertViolationMEMORY_FREE, mainErr3RequiresViolation, mainErr15RequiresViolation, mainErr49RequiresViolation, mainErr63AssertViolationMEMORY_FREE, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr55RequiresViolation, mainErr17RequiresViolation, mainErr42RequiresViolation, mainErr30RequiresViolation, mainErr11RequiresViolation, mainErr57RequiresViolation, mainErr24RequiresViolation, mainErr44RequiresViolation, mainErr10RequiresViolation, mainErr43RequiresViolation, mainErr4RequiresViolation, mainErr50RequiresViolation, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr59AssertViolationMEMORY_FREE, mainErr36RequiresViolation, mainErr61RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr56RequiresViolation, mainErr62AssertViolationMEMORY_FREE, mainErr64EnsuresViolationMEMORY_LEAK, mainErr48RequiresViolation, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr52RequiresViolation, mainErr45RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr60RequiresViolation, mainErr9RequiresViolation, mainErr53RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr34RequiresViolation, mainErr47RequiresViolation, mainErr14RequiresViolation, mainErr40RequiresViolation]=== [2018-04-10 14:16:24,722 INFO L82 PathProgramCache]: Analyzing trace with hash 1600897065, now seen corresponding path program 1 times [2018-04-10 14:16:24,722 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-04-10 14:16:24,722 INFO L68 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-04-10 14:16:24,723 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-10 14:16:24,723 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-10 14:16:24,723 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-10 14:16:24,733 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-10 14:16:24,734 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:24,774 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:16:24,775 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-04-10 14:16:24,775 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-04-10 14:16:24,775 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-04-10 14:16:24,775 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-04-10 14:16:24,775 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-04-10 14:16:24,776 INFO L87 Difference]: Start difference. First operand 145 states and 159 transitions. Second operand 6 states. [2018-04-10 14:16:24,968 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-10 14:16:24,968 INFO L93 Difference]: Finished difference Result 204 states and 227 transitions. [2018-04-10 14:16:24,969 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-04-10 14:16:24,969 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 20 [2018-04-10 14:16:24,969 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-10 14:16:24,969 INFO L225 Difference]: With dead ends: 204 [2018-04-10 14:16:24,969 INFO L226 Difference]: Without dead ends: 204 [2018-04-10 14:16:24,970 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=23, Invalid=49, Unknown=0, NotChecked=0, Total=72 [2018-04-10 14:16:24,970 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 204 states. [2018-04-10 14:16:24,973 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 204 to 142. [2018-04-10 14:16:24,973 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 142 states. [2018-04-10 14:16:24,974 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 142 states to 142 states and 156 transitions. [2018-04-10 14:16:24,974 INFO L78 Accepts]: Start accepts. Automaton has 142 states and 156 transitions. Word has length 20 [2018-04-10 14:16:24,974 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-10 14:16:24,974 INFO L459 AbstractCegarLoop]: Abstraction has 142 states and 156 transitions. [2018-04-10 14:16:24,974 INFO L460 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-04-10 14:16:24,974 INFO L276 IsEmpty]: Start isEmpty. Operand 142 states and 156 transitions. [2018-04-10 14:16:24,975 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2018-04-10 14:16:24,975 INFO L347 BasicCegarLoop]: Found error trace [2018-04-10 14:16:24,975 INFO L355 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-10 14:16:24,975 INFO L408 AbstractCegarLoop]: === Iteration 7 === [mainErr51RequiresViolation, mainErr26RequiresViolation, mainErr54RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr31RequiresViolation, mainErr46RequiresViolation, mainErr29RequiresViolation, mainErr58AssertViolationMEMORY_FREE, mainErr3RequiresViolation, mainErr15RequiresViolation, mainErr49RequiresViolation, mainErr63AssertViolationMEMORY_FREE, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr55RequiresViolation, mainErr17RequiresViolation, mainErr42RequiresViolation, mainErr30RequiresViolation, mainErr11RequiresViolation, mainErr57RequiresViolation, mainErr24RequiresViolation, mainErr44RequiresViolation, mainErr10RequiresViolation, mainErr43RequiresViolation, mainErr4RequiresViolation, mainErr50RequiresViolation, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr59AssertViolationMEMORY_FREE, mainErr36RequiresViolation, mainErr61RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr56RequiresViolation, mainErr62AssertViolationMEMORY_FREE, mainErr64EnsuresViolationMEMORY_LEAK, mainErr48RequiresViolation, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr52RequiresViolation, mainErr45RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr60RequiresViolation, mainErr9RequiresViolation, mainErr53RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr34RequiresViolation, mainErr47RequiresViolation, mainErr14RequiresViolation, mainErr40RequiresViolation]=== [2018-04-10 14:16:24,976 INFO L82 PathProgramCache]: Analyzing trace with hash -1910725372, now seen corresponding path program 1 times [2018-04-10 14:16:24,976 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-04-10 14:16:24,976 INFO L68 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-04-10 14:16:24,976 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-10 14:16:24,977 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-10 14:16:24,977 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-10 14:16:24,988 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-10 14:16:24,989 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:25,016 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:16:25,017 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-04-10 14:16:25,017 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-04-10 14:16:25,017 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-04-10 14:16:25,017 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-04-10 14:16:25,017 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-04-10 14:16:25,018 INFO L87 Difference]: Start difference. First operand 142 states and 156 transitions. Second operand 4 states. [2018-04-10 14:16:25,122 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-10 14:16:25,123 INFO L93 Difference]: Finished difference Result 185 states and 201 transitions. [2018-04-10 14:16:25,123 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-04-10 14:16:25,123 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 29 [2018-04-10 14:16:25,123 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-10 14:16:25,124 INFO L225 Difference]: With dead ends: 185 [2018-04-10 14:16:25,124 INFO L226 Difference]: Without dead ends: 185 [2018-04-10 14:16:25,124 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-04-10 14:16:25,124 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 185 states. [2018-04-10 14:16:25,126 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 185 to 137. [2018-04-10 14:16:25,127 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 137 states. [2018-04-10 14:16:25,127 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 137 states to 137 states and 151 transitions. [2018-04-10 14:16:25,127 INFO L78 Accepts]: Start accepts. Automaton has 137 states and 151 transitions. Word has length 29 [2018-04-10 14:16:25,127 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-10 14:16:25,128 INFO L459 AbstractCegarLoop]: Abstraction has 137 states and 151 transitions. [2018-04-10 14:16:25,128 INFO L460 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-04-10 14:16:25,128 INFO L276 IsEmpty]: Start isEmpty. Operand 137 states and 151 transitions. [2018-04-10 14:16:25,128 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2018-04-10 14:16:25,128 INFO L347 BasicCegarLoop]: Found error trace [2018-04-10 14:16:25,128 INFO L355 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-10 14:16:25,128 INFO L408 AbstractCegarLoop]: === Iteration 8 === [mainErr51RequiresViolation, mainErr26RequiresViolation, mainErr54RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr31RequiresViolation, mainErr46RequiresViolation, mainErr29RequiresViolation, mainErr58AssertViolationMEMORY_FREE, mainErr3RequiresViolation, mainErr15RequiresViolation, mainErr49RequiresViolation, mainErr63AssertViolationMEMORY_FREE, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr55RequiresViolation, mainErr17RequiresViolation, mainErr42RequiresViolation, mainErr30RequiresViolation, mainErr11RequiresViolation, mainErr57RequiresViolation, mainErr24RequiresViolation, mainErr44RequiresViolation, mainErr10RequiresViolation, mainErr43RequiresViolation, mainErr4RequiresViolation, mainErr50RequiresViolation, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr59AssertViolationMEMORY_FREE, mainErr36RequiresViolation, mainErr61RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr56RequiresViolation, mainErr62AssertViolationMEMORY_FREE, mainErr64EnsuresViolationMEMORY_LEAK, mainErr48RequiresViolation, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr52RequiresViolation, mainErr45RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr60RequiresViolation, mainErr9RequiresViolation, mainErr53RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr34RequiresViolation, mainErr47RequiresViolation, mainErr14RequiresViolation, mainErr40RequiresViolation]=== [2018-04-10 14:16:25,128 INFO L82 PathProgramCache]: Analyzing trace with hash -1910725371, now seen corresponding path program 1 times [2018-04-10 14:16:25,128 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-04-10 14:16:25,128 INFO L68 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-04-10 14:16:25,129 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-10 14:16:25,129 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-10 14:16:25,129 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-10 14:16:25,140 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-10 14:16:25,141 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:25,175 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:16:25,176 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-04-10 14:16:25,176 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-04-10 14:16:25,176 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-04-10 14:16:25,176 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-04-10 14:16:25,176 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-04-10 14:16:25,176 INFO L87 Difference]: Start difference. First operand 137 states and 151 transitions. Second operand 4 states. [2018-04-10 14:16:25,290 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-10 14:16:25,290 INFO L93 Difference]: Finished difference Result 204 states and 227 transitions. [2018-04-10 14:16:25,290 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-04-10 14:16:25,290 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 29 [2018-04-10 14:16:25,290 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-10 14:16:25,291 INFO L225 Difference]: With dead ends: 204 [2018-04-10 14:16:25,291 INFO L226 Difference]: Without dead ends: 204 [2018-04-10 14:16:25,291 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-04-10 14:16:25,292 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 204 states. [2018-04-10 14:16:25,293 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 204 to 132. [2018-04-10 14:16:25,293 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 132 states. [2018-04-10 14:16:25,294 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 132 states to 132 states and 146 transitions. [2018-04-10 14:16:25,294 INFO L78 Accepts]: Start accepts. Automaton has 132 states and 146 transitions. Word has length 29 [2018-04-10 14:16:25,294 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-10 14:16:25,294 INFO L459 AbstractCegarLoop]: Abstraction has 132 states and 146 transitions. [2018-04-10 14:16:25,295 INFO L460 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-04-10 14:16:25,295 INFO L276 IsEmpty]: Start isEmpty. Operand 132 states and 146 transitions. [2018-04-10 14:16:25,295 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2018-04-10 14:16:25,295 INFO L347 BasicCegarLoop]: Found error trace [2018-04-10 14:16:25,295 INFO L355 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-10 14:16:25,295 INFO L408 AbstractCegarLoop]: === Iteration 9 === [mainErr51RequiresViolation, mainErr26RequiresViolation, mainErr54RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr31RequiresViolation, mainErr46RequiresViolation, mainErr29RequiresViolation, mainErr58AssertViolationMEMORY_FREE, mainErr3RequiresViolation, mainErr15RequiresViolation, mainErr49RequiresViolation, mainErr63AssertViolationMEMORY_FREE, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr55RequiresViolation, mainErr17RequiresViolation, mainErr42RequiresViolation, mainErr30RequiresViolation, mainErr11RequiresViolation, mainErr57RequiresViolation, mainErr24RequiresViolation, mainErr44RequiresViolation, mainErr10RequiresViolation, mainErr43RequiresViolation, mainErr4RequiresViolation, mainErr50RequiresViolation, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr59AssertViolationMEMORY_FREE, mainErr36RequiresViolation, mainErr61RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr56RequiresViolation, mainErr62AssertViolationMEMORY_FREE, mainErr64EnsuresViolationMEMORY_LEAK, mainErr48RequiresViolation, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr52RequiresViolation, mainErr45RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr60RequiresViolation, mainErr9RequiresViolation, mainErr53RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr34RequiresViolation, mainErr47RequiresViolation, mainErr14RequiresViolation, mainErr40RequiresViolation]=== [2018-04-10 14:16:25,296 INFO L82 PathProgramCache]: Analyzing trace with hash 899613847, now seen corresponding path program 1 times [2018-04-10 14:16:25,296 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-04-10 14:16:25,296 INFO L68 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-04-10 14:16:25,297 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-10 14:16:25,297 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-10 14:16:25,297 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-10 14:16:25,310 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-10 14:16:25,311 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:25,354 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:16:25,355 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-04-10 14:16:25,355 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-04-10 14:16:25,355 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-04-10 14:16:25,355 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-04-10 14:16:25,355 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2018-04-10 14:16:25,355 INFO L87 Difference]: Start difference. First operand 132 states and 146 transitions. Second operand 5 states. [2018-04-10 14:16:25,449 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-10 14:16:25,450 INFO L93 Difference]: Finished difference Result 179 states and 188 transitions. [2018-04-10 14:16:25,450 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-04-10 14:16:25,450 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 30 [2018-04-10 14:16:25,450 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-10 14:16:25,451 INFO L225 Difference]: With dead ends: 179 [2018-04-10 14:16:25,451 INFO L226 Difference]: Without dead ends: 179 [2018-04-10 14:16:25,451 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2018-04-10 14:16:25,451 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 179 states. [2018-04-10 14:16:25,452 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 179 to 140. [2018-04-10 14:16:25,452 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 140 states. [2018-04-10 14:16:25,453 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 140 states to 140 states and 158 transitions. [2018-04-10 14:16:25,453 INFO L78 Accepts]: Start accepts. Automaton has 140 states and 158 transitions. Word has length 30 [2018-04-10 14:16:25,453 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-10 14:16:25,453 INFO L459 AbstractCegarLoop]: Abstraction has 140 states and 158 transitions. [2018-04-10 14:16:25,453 INFO L460 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-04-10 14:16:25,453 INFO L276 IsEmpty]: Start isEmpty. Operand 140 states and 158 transitions. [2018-04-10 14:16:25,453 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2018-04-10 14:16:25,453 INFO L347 BasicCegarLoop]: Found error trace [2018-04-10 14:16:25,453 INFO L355 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-10 14:16:25,453 INFO L408 AbstractCegarLoop]: === Iteration 10 === [mainErr51RequiresViolation, mainErr26RequiresViolation, mainErr54RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr31RequiresViolation, mainErr46RequiresViolation, mainErr29RequiresViolation, mainErr58AssertViolationMEMORY_FREE, mainErr3RequiresViolation, mainErr15RequiresViolation, mainErr49RequiresViolation, mainErr63AssertViolationMEMORY_FREE, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr55RequiresViolation, mainErr17RequiresViolation, mainErr42RequiresViolation, mainErr30RequiresViolation, mainErr11RequiresViolation, mainErr57RequiresViolation, mainErr24RequiresViolation, mainErr44RequiresViolation, mainErr10RequiresViolation, mainErr43RequiresViolation, mainErr4RequiresViolation, mainErr50RequiresViolation, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr59AssertViolationMEMORY_FREE, mainErr36RequiresViolation, mainErr61RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr56RequiresViolation, mainErr62AssertViolationMEMORY_FREE, mainErr64EnsuresViolationMEMORY_LEAK, mainErr48RequiresViolation, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr52RequiresViolation, mainErr45RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr60RequiresViolation, mainErr9RequiresViolation, mainErr53RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr34RequiresViolation, mainErr47RequiresViolation, mainErr14RequiresViolation, mainErr40RequiresViolation]=== [2018-04-10 14:16:25,454 INFO L82 PathProgramCache]: Analyzing trace with hash 899613848, now seen corresponding path program 1 times [2018-04-10 14:16:25,454 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-04-10 14:16:25,454 INFO L68 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-04-10 14:16:25,454 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-10 14:16:25,455 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-10 14:16:25,455 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-10 14:16:25,464 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-10 14:16:25,465 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:25,564 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:16:25,564 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-04-10 14:16:25,564 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-04-10 14:16:25,564 INFO L442 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-04-10 14:16:25,564 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-04-10 14:16:25,564 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2018-04-10 14:16:25,564 INFO L87 Difference]: Start difference. First operand 140 states and 158 transitions. Second operand 8 states. [2018-04-10 14:16:25,942 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-10 14:16:25,942 INFO L93 Difference]: Finished difference Result 361 states and 394 transitions. [2018-04-10 14:16:25,942 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2018-04-10 14:16:25,943 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 30 [2018-04-10 14:16:25,943 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-10 14:16:25,944 INFO L225 Difference]: With dead ends: 361 [2018-04-10 14:16:25,944 INFO L226 Difference]: Without dead ends: 361 [2018-04-10 14:16:25,944 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 58 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=110, Invalid=232, Unknown=0, NotChecked=0, Total=342 [2018-04-10 14:16:25,945 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 361 states. [2018-04-10 14:16:25,948 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 361 to 185. [2018-04-10 14:16:25,948 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 185 states. [2018-04-10 14:16:25,949 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 185 states to 185 states and 217 transitions. [2018-04-10 14:16:25,949 INFO L78 Accepts]: Start accepts. Automaton has 185 states and 217 transitions. Word has length 30 [2018-04-10 14:16:25,949 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-10 14:16:25,949 INFO L459 AbstractCegarLoop]: Abstraction has 185 states and 217 transitions. [2018-04-10 14:16:25,949 INFO L460 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-04-10 14:16:25,949 INFO L276 IsEmpty]: Start isEmpty. Operand 185 states and 217 transitions. [2018-04-10 14:16:25,950 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2018-04-10 14:16:25,950 INFO L347 BasicCegarLoop]: Found error trace [2018-04-10 14:16:25,950 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] [2018-04-10 14:16:25,950 INFO L408 AbstractCegarLoop]: === Iteration 11 === [mainErr51RequiresViolation, mainErr26RequiresViolation, mainErr54RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr31RequiresViolation, mainErr46RequiresViolation, mainErr29RequiresViolation, mainErr58AssertViolationMEMORY_FREE, mainErr3RequiresViolation, mainErr15RequiresViolation, mainErr49RequiresViolation, mainErr63AssertViolationMEMORY_FREE, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr55RequiresViolation, mainErr17RequiresViolation, mainErr42RequiresViolation, mainErr30RequiresViolation, mainErr11RequiresViolation, mainErr57RequiresViolation, mainErr24RequiresViolation, mainErr44RequiresViolation, mainErr10RequiresViolation, mainErr43RequiresViolation, mainErr4RequiresViolation, mainErr50RequiresViolation, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr59AssertViolationMEMORY_FREE, mainErr36RequiresViolation, mainErr61RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr56RequiresViolation, mainErr62AssertViolationMEMORY_FREE, mainErr64EnsuresViolationMEMORY_LEAK, mainErr48RequiresViolation, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr52RequiresViolation, mainErr45RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr60RequiresViolation, mainErr9RequiresViolation, mainErr53RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr34RequiresViolation, mainErr47RequiresViolation, mainErr14RequiresViolation, mainErr40RequiresViolation]=== [2018-04-10 14:16:25,950 INFO L82 PathProgramCache]: Analyzing trace with hash 2118226425, now seen corresponding path program 1 times [2018-04-10 14:16:25,950 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-04-10 14:16:25,951 INFO L68 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-04-10 14:16:25,952 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-10 14:16:25,952 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-10 14:16:25,952 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-10 14:16:25,960 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-10 14:16:25,961 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:25,984 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:16:25,985 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-04-10 14:16:25,985 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-04-10 14:16:25,985 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-04-10 14:16:25,985 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-04-10 14:16:25,985 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-04-10 14:16:25,985 INFO L87 Difference]: Start difference. First operand 185 states and 217 transitions. Second operand 5 states. [2018-04-10 14:16:26,039 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-10 14:16:26,039 INFO L93 Difference]: Finished difference Result 225 states and 253 transitions. [2018-04-10 14:16:26,039 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-04-10 14:16:26,039 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 31 [2018-04-10 14:16:26,039 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-10 14:16:26,040 INFO L225 Difference]: With dead ends: 225 [2018-04-10 14:16:26,040 INFO L226 Difference]: Without dead ends: 225 [2018-04-10 14:16:26,040 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2018-04-10 14:16:26,041 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 225 states. [2018-04-10 14:16:26,042 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 225 to 185. [2018-04-10 14:16:26,042 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 185 states. [2018-04-10 14:16:26,043 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 185 states to 185 states and 216 transitions. [2018-04-10 14:16:26,043 INFO L78 Accepts]: Start accepts. Automaton has 185 states and 216 transitions. Word has length 31 [2018-04-10 14:16:26,043 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-10 14:16:26,043 INFO L459 AbstractCegarLoop]: Abstraction has 185 states and 216 transitions. [2018-04-10 14:16:26,043 INFO L460 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-04-10 14:16:26,043 INFO L276 IsEmpty]: Start isEmpty. Operand 185 states and 216 transitions. [2018-04-10 14:16:26,043 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2018-04-10 14:16:26,044 INFO L347 BasicCegarLoop]: Found error trace [2018-04-10 14:16:26,044 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] [2018-04-10 14:16:26,044 INFO L408 AbstractCegarLoop]: === Iteration 12 === [mainErr51RequiresViolation, mainErr26RequiresViolation, mainErr54RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr31RequiresViolation, mainErr46RequiresViolation, mainErr29RequiresViolation, mainErr58AssertViolationMEMORY_FREE, mainErr3RequiresViolation, mainErr15RequiresViolation, mainErr49RequiresViolation, mainErr63AssertViolationMEMORY_FREE, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr55RequiresViolation, mainErr17RequiresViolation, mainErr42RequiresViolation, mainErr30RequiresViolation, mainErr11RequiresViolation, mainErr57RequiresViolation, mainErr24RequiresViolation, mainErr44RequiresViolation, mainErr10RequiresViolation, mainErr43RequiresViolation, mainErr4RequiresViolation, mainErr50RequiresViolation, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr59AssertViolationMEMORY_FREE, mainErr36RequiresViolation, mainErr61RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr56RequiresViolation, mainErr62AssertViolationMEMORY_FREE, mainErr64EnsuresViolationMEMORY_LEAK, mainErr48RequiresViolation, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr52RequiresViolation, mainErr45RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr60RequiresViolation, mainErr9RequiresViolation, mainErr53RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr34RequiresViolation, mainErr47RequiresViolation, mainErr14RequiresViolation, mainErr40RequiresViolation]=== [2018-04-10 14:16:26,044 INFO L82 PathProgramCache]: Analyzing trace with hash 1426908612, now seen corresponding path program 1 times [2018-04-10 14:16:26,044 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-04-10 14:16:26,044 INFO L68 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-04-10 14:16:26,045 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-10 14:16:26,045 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-10 14:16:26,046 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-10 14:16:26,056 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-10 14:16:26,057 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:26,258 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:16:26,258 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-04-10 14:16:26,258 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [16] imperfect sequences [] total 16 [2018-04-10 14:16:26,258 INFO L442 AbstractCegarLoop]: Interpolant automaton has 16 states [2018-04-10 14:16:26,259 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2018-04-10 14:16:26,259 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=48, Invalid=192, Unknown=0, NotChecked=0, Total=240 [2018-04-10 14:16:26,259 INFO L87 Difference]: Start difference. First operand 185 states and 216 transitions. Second operand 16 states. [2018-04-10 14:16:26,899 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-10 14:16:26,899 INFO L93 Difference]: Finished difference Result 285 states and 321 transitions. [2018-04-10 14:16:26,899 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2018-04-10 14:16:26,899 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 35 [2018-04-10 14:16:26,900 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-10 14:16:26,901 INFO L225 Difference]: With dead ends: 285 [2018-04-10 14:16:26,901 INFO L226 Difference]: Without dead ends: 285 [2018-04-10 14:16:26,902 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 38 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 34 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 234 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=301, Invalid=959, Unknown=0, NotChecked=0, Total=1260 [2018-04-10 14:16:26,902 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 285 states. [2018-04-10 14:16:26,904 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 285 to 196. [2018-04-10 14:16:26,905 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 196 states. [2018-04-10 14:16:26,905 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 196 states to 196 states and 228 transitions. [2018-04-10 14:16:26,905 INFO L78 Accepts]: Start accepts. Automaton has 196 states and 228 transitions. Word has length 35 [2018-04-10 14:16:26,906 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-10 14:16:26,906 INFO L459 AbstractCegarLoop]: Abstraction has 196 states and 228 transitions. [2018-04-10 14:16:26,906 INFO L460 AbstractCegarLoop]: Interpolant automaton has 16 states. [2018-04-10 14:16:26,906 INFO L276 IsEmpty]: Start isEmpty. Operand 196 states and 228 transitions. [2018-04-10 14:16:26,906 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2018-04-10 14:16:26,907 INFO L347 BasicCegarLoop]: Found error trace [2018-04-10 14:16:26,907 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] [2018-04-10 14:16:26,907 INFO L408 AbstractCegarLoop]: === Iteration 13 === [mainErr51RequiresViolation, mainErr26RequiresViolation, mainErr54RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr31RequiresViolation, mainErr46RequiresViolation, mainErr29RequiresViolation, mainErr58AssertViolationMEMORY_FREE, mainErr3RequiresViolation, mainErr15RequiresViolation, mainErr49RequiresViolation, mainErr63AssertViolationMEMORY_FREE, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr55RequiresViolation, mainErr17RequiresViolation, mainErr42RequiresViolation, mainErr30RequiresViolation, mainErr11RequiresViolation, mainErr57RequiresViolation, mainErr24RequiresViolation, mainErr44RequiresViolation, mainErr10RequiresViolation, mainErr43RequiresViolation, mainErr4RequiresViolation, mainErr50RequiresViolation, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr59AssertViolationMEMORY_FREE, mainErr36RequiresViolation, mainErr61RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr56RequiresViolation, mainErr62AssertViolationMEMORY_FREE, mainErr64EnsuresViolationMEMORY_LEAK, mainErr48RequiresViolation, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr52RequiresViolation, mainErr45RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr60RequiresViolation, mainErr9RequiresViolation, mainErr53RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr34RequiresViolation, mainErr47RequiresViolation, mainErr14RequiresViolation, mainErr40RequiresViolation]=== [2018-04-10 14:16:26,907 INFO L82 PathProgramCache]: Analyzing trace with hash 449974014, now seen corresponding path program 1 times [2018-04-10 14:16:26,907 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-04-10 14:16:26,907 INFO L68 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-04-10 14:16:26,908 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-10 14:16:26,908 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-10 14:16:26,908 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-10 14:16:26,918 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-10 14:16:26,919 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:27,189 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:16:27,189 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-04-10 14:16:27,189 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:16:27,196 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-10 14:16:27,220 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-10 14:16:27,225 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-10 14:16:27,265 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 14:16:27,266 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 14:16:27,270 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:27,270 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-10 14:16:27,280 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-10 14:16:27,280 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:11, output treesize:4 [2018-04-10 14:16:27,303 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:16:27,305 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:27,306 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-10 14:16:27,308 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-10 14:16:27,313 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:16:27,314 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:21, output treesize:14 [2018-04-10 14:16:27,364 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 14:16:27,367 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:27,369 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select 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:16:27,369 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-10 14:16:27,373 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-10 14:16:27,377 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-04-10 14:16:27,378 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:34, output treesize:30 [2018-04-10 14:16:27,401 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 14:16:27,401 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 14:16:27,402 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 4 [2018-04-10 14:16:27,402 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-10 14:16:27,406 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-10 14:16:27,407 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:35, output treesize:29 [2018-04-10 14:16:27,426 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 14:16:27,429 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 36 treesize of output 35 [2018-04-10 14:16:27,431 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 14:16:27,432 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 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:27,433 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-10 14:16:27,439 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-10 14:16:27,454 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:16:27,454 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:45, output treesize:38 [2018-04-10 14:16:27,545 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 14:16:27,562 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 67 treesize of output 74 [2018-04-10 14:16:27,568 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 76 treesize of output 75 [2018-04-10 14:16:27,569 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-10 14:16:27,602 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 14:16:27,609 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 47 treesize of output 62 [2018-04-10 14:16:27,609 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 2 xjuncts. [2018-04-10 14:16:27,631 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-04-10 14:16:27,647 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 2 xjuncts. [2018-04-10 14:16:27,647 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 2 variables, input treesize:67, output treesize:99 [2018-04-10 14:16:27,709 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 87 treesize of output 75 [2018-04-10 14:16:27,717 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 14:16:27,718 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 14:16:27,728 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 1 new quantified variables, introduced 3 case distinctions, treesize of input 57 treesize of output 71 [2018-04-10 14:16:27,730 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 2 xjuncts. [2018-04-10 14:16:27,762 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 14:16:27,763 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 66 treesize of output 81 [2018-04-10 14:16:27,764 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-04-10 14:16:27,795 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-04-10 14:16:27,822 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 63 treesize of output 47 [2018-04-10 14:16:27,824 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 14:16:27,825 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 14:16:27,825 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 14:16:27,826 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 58 [2018-04-10 14:16:27,826 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2018-04-10 14:16:27,833 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-10 14:16:27,853 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 2 dim-2 vars, End of recursive call: 4 dim-0 vars, and 3 xjuncts. [2018-04-10 14:16:27,853 INFO L202 ElimStorePlain]: Needed 6 recursive calls to eliminate 5 variables, input treesize:151, output treesize:173 [2018-04-10 14:16:28,091 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 88 treesize of output 69 [2018-04-10 14:16:28,099 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 14:16:28,101 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 73 treesize of output 90 [2018-04-10 14:16:28,101 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-10 14:16:28,129 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-10 14:16:28,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 55 treesize of output 45 [2018-04-10 14:16:28,159 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 14:16:28,160 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 44 treesize of output 57 [2018-04-10 14:16:28,161 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-04-10 14:16:28,170 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-10 14:16:28,188 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 2 dim-2 vars, End of recursive call: 3 dim-0 vars, and 2 xjuncts. [2018-04-10 14:16:28,188 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 5 variables, input treesize:144, output treesize:136 [2018-04-10 14:16:28,365 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 91 treesize of output 64 [2018-04-10 14:16:28,368 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 14:16:28,369 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 57 treesize of output 52 [2018-04-10 14:16:28,369 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-10 14:16:28,400 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 14:16:28,401 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 38 treesize of output 32 [2018-04-10 14:16:28,419 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-04-10 14:16:28,440 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 14:16:28,441 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 51 treesize of output 41 [2018-04-10 14:16:28,442 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-04-10 14:16:28,467 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 14:16:28,468 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 16 [2018-04-10 14:16:28,469 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2018-04-10 14:16:28,480 INFO L267 ElimStorePlain]: Start of recursive call 2: 5 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-10 14:16:28,488 INFO L267 ElimStorePlain]: Start of recursive call 1: 5 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-04-10 14:16:28,489 INFO L202 ElimStorePlain]: Needed 6 recursive calls to eliminate 7 variables, input treesize:150, output treesize:10 [2018-04-10 14:16:28,501 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 14:16:28,501 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:16:28,501 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-10 14:16:28,506 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:28,506 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:16, output treesize:11 [2018-04-10 14:16:28,571 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:16:28,594 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-04-10 14:16:28,594 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [18, 19] total 34 [2018-04-10 14:16:28,594 INFO L442 AbstractCegarLoop]: Interpolant automaton has 35 states [2018-04-10 14:16:28,595 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 35 interpolants. [2018-04-10 14:16:28,595 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=117, Invalid=1073, Unknown=0, NotChecked=0, Total=1190 [2018-04-10 14:16:28,595 INFO L87 Difference]: Start difference. First operand 196 states and 228 transitions. Second operand 35 states. [2018-04-10 14:16:31,480 WARN L151 SmtUtils]: Spent 2106ms on a formula simplification. DAG size of input: 84 DAG size of output 84 [2018-04-10 14:16:33,948 WARN L151 SmtUtils]: Spent 2247ms on a formula simplification. DAG size of input: 82 DAG size of output 80 [2018-04-10 14:16:34,078 WARN L151 SmtUtils]: Spent 102ms on a formula simplification. DAG size of input: 87 DAG size of output 85 [2018-04-10 14:16:34,823 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-10 14:16:34,823 INFO L93 Difference]: Finished difference Result 278 states and 295 transitions. [2018-04-10 14:16:34,823 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 35 states. [2018-04-10 14:16:34,823 INFO L78 Accepts]: Start accepts. Automaton has 35 states. Word has length 47 [2018-04-10 14:16:34,823 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-10 14:16:34,824 INFO L225 Difference]: With dead ends: 278 [2018-04-10 14:16:34,824 INFO L226 Difference]: Without dead ends: 278 [2018-04-10 14:16:34,826 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 102 GetRequests, 33 SyntacticMatches, 4 SemanticMatches, 65 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1208 ImplicationChecksByTransitivity, 6.1s TimeCoverageRelationStatistics Valid=689, Invalid=3733, Unknown=0, NotChecked=0, Total=4422 [2018-04-10 14:16:34,826 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 278 states. [2018-04-10 14:16:34,829 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 278 to 209. [2018-04-10 14:16:34,829 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 209 states. [2018-04-10 14:16:34,830 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 209 states to 209 states and 243 transitions. [2018-04-10 14:16:34,830 INFO L78 Accepts]: Start accepts. Automaton has 209 states and 243 transitions. Word has length 47 [2018-04-10 14:16:34,830 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-10 14:16:34,830 INFO L459 AbstractCegarLoop]: Abstraction has 209 states and 243 transitions. [2018-04-10 14:16:34,830 INFO L460 AbstractCegarLoop]: Interpolant automaton has 35 states. [2018-04-10 14:16:34,830 INFO L276 IsEmpty]: Start isEmpty. Operand 209 states and 243 transitions. [2018-04-10 14:16:34,831 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2018-04-10 14:16:34,831 INFO L347 BasicCegarLoop]: Found error trace [2018-04-10 14:16:34,831 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] [2018-04-10 14:16:34,831 INFO L408 AbstractCegarLoop]: === Iteration 14 === [mainErr51RequiresViolation, mainErr26RequiresViolation, mainErr54RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr31RequiresViolation, mainErr46RequiresViolation, mainErr29RequiresViolation, mainErr58AssertViolationMEMORY_FREE, mainErr3RequiresViolation, mainErr15RequiresViolation, mainErr49RequiresViolation, mainErr63AssertViolationMEMORY_FREE, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr55RequiresViolation, mainErr17RequiresViolation, mainErr42RequiresViolation, mainErr30RequiresViolation, mainErr11RequiresViolation, mainErr57RequiresViolation, mainErr24RequiresViolation, mainErr44RequiresViolation, mainErr10RequiresViolation, mainErr43RequiresViolation, mainErr4RequiresViolation, mainErr50RequiresViolation, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr59AssertViolationMEMORY_FREE, mainErr36RequiresViolation, mainErr61RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr56RequiresViolation, mainErr62AssertViolationMEMORY_FREE, mainErr64EnsuresViolationMEMORY_LEAK, mainErr48RequiresViolation, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr52RequiresViolation, mainErr45RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr60RequiresViolation, mainErr9RequiresViolation, mainErr53RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr34RequiresViolation, mainErr47RequiresViolation, mainErr14RequiresViolation, mainErr40RequiresViolation]=== [2018-04-10 14:16:34,831 INFO L82 PathProgramCache]: Analyzing trace with hash 449974015, now seen corresponding path program 1 times [2018-04-10 14:16:34,832 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-04-10 14:16:34,832 INFO L68 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-04-10 14:16:34,833 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-10 14:16:34,833 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-10 14:16:34,833 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-10 14:16:34,847 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-10 14:16:34,848 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:35,206 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:16:35,207 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-04-10 14:16:35,207 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:16:35,214 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-10 14:16:35,255 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-10 14:16:35,258 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-10 14:16:35,270 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select 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:35,270 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-10 14:16:35,276 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 14:16:35,276 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 14:16:35,277 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 21 [2018-04-10 14:16:35,277 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-10 14:16:35,281 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-10 14:16:35,281 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:26, output treesize:23 [2018-04-10 14:16:35,296 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:16:35,297 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:35,297 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-10 14:16:35,298 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-10 14:16:35,305 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:16:35,307 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select 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:35,307 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-04-10 14:16:35,308 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-10 14:16:35,313 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:35,313 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 3 variables, input treesize:42, output treesize:39 [2018-04-10 14:16:35,363 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 14:16:35,365 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 47 treesize of output 48 [2018-04-10 14:16:35,367 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select 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:16:35,367 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-10 14:16:35,373 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-10 14:16:35,382 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 14:16:35,384 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 26 [2018-04-10 14:16:35,386 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 13 [2018-04-10 14:16:35,386 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-04-10 14:16:35,389 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-10 14:16:35,396 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-04-10 14:16:35,396 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 2 variables, input treesize:72, output treesize:68 [2018-04-10 14:16:35,421 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 14:16:35,421 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:35,421 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-10 14:16:35,439 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 14:16:35,440 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 14:16:35,440 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 14:16:35,441 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:16:35,442 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-10 14:16:35,451 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-10 14:16:35,452 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:79, output treesize:71 [2018-04-10 14:16:35,480 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 14:16:35,484 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 66 treesize of output 65 [2018-04-10 14:16:35,486 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 14:16:35,487 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 23 [2018-04-10 14:16:35,487 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-10 14:16:35,519 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-10 14:16:35,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 32 treesize of output 38 [2018-04-10 14:16:35,541 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 14:16:35,542 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:16:35,542 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-04-10 14:16:35,547 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-10 14:16:35,558 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:16:35,558 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 4 variables, input treesize:93, output treesize:83 [2018-04-10 14:16:35,635 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 14:16:35,635 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 14:16:35,640 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 109 treesize of output 105 [2018-04-10 14:16:35,643 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 9 [2018-04-10 14:16:35,643 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-10 14:16:35,657 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-10 14:16:35,674 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 14:16:35,679 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 34 treesize of output 59 [2018-04-10 14:16:35,680 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 17 [2018-04-10 14:16:35,680 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-04-10 14:16:35,685 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-10 14:16:35,696 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:35,696 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 3 variables, input treesize:129, output treesize:121 [2018-04-10 14:16:35,736 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 173 treesize of output 130 [2018-04-10 14:16:35,739 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 14:16:35,739 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:16:35,739 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-10 14:16:35,754 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-10 14:16:35,774 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 65 treesize of output 80 [2018-04-10 14:16:35,778 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 14:16:35,778 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:16:35,778 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-04-10 14:16:35,786 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-10 14:16:35,799 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:16:35,799 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 4 variables, input treesize:180, output treesize:156 [2018-04-10 14:16:35,897 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 97 [2018-04-10 14:16:35,899 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 14:16:35,899 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:35,899 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-10 14:16:35,908 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-10 14:16:35,933 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 162 treesize of output 123 [2018-04-10 14:16:35,935 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 14:16:35,936 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 135 treesize of output 164 [2018-04-10 14:16:35,937 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-04-10 14:16:35,952 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-10 14:16:35,968 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:16:35,968 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 4 variables, input treesize:182, output treesize:174 [2018-04-10 14:16:36,018 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 165 treesize of output 102 [2018-04-10 14:16:36,022 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 14:16:36,022 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 6 [2018-04-10 14:16:36,023 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-10 14:16:36,038 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 14:16:36,039 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 49 treesize of output 38 [2018-04-10 14:16:36,040 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:36,054 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 14:16:36,056 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 43 treesize of output 29 [2018-04-10 14:16:36,056 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-04-10 14:16:36,064 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:16:36,077 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 49 treesize of output 49 [2018-04-10 14:16:36,079 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select 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:36,079 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2018-04-10 14:16:36,087 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 14:16:36,087 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 6 [2018-04-10 14:16:36,087 INFO L267 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 1 xjuncts. [2018-04-10 14:16:36,092 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 14:16:36,092 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 10 [2018-04-10 14:16:36,092 INFO L267 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 1 xjuncts. [2018-04-10 14:16:36,095 INFO L267 ElimStorePlain]: Start of recursive call 6: 3 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-10 14:16:36,100 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:16:36,100 INFO L202 ElimStorePlain]: Needed 9 recursive calls to eliminate 6 variables, input treesize:188, output treesize:18 [2018-04-10 14:16:36,170 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:16:36,188 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-04-10 14:16:36,188 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 17] total 32 [2018-04-10 14:16:36,188 INFO L442 AbstractCegarLoop]: Interpolant automaton has 33 states [2018-04-10 14:16:36,188 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 33 interpolants. [2018-04-10 14:16:36,188 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=107, Invalid=949, Unknown=0, NotChecked=0, Total=1056 [2018-04-10 14:16:36,189 INFO L87 Difference]: Start difference. First operand 209 states and 243 transitions. Second operand 33 states. [2018-04-10 14:16:38,101 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-10 14:16:38,101 INFO L93 Difference]: Finished difference Result 276 states and 303 transitions. [2018-04-10 14:16:38,101 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2018-04-10 14:16:38,101 INFO L78 Accepts]: Start accepts. Automaton has 33 states. Word has length 47 [2018-04-10 14:16:38,101 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-10 14:16:38,102 INFO L225 Difference]: With dead ends: 276 [2018-04-10 14:16:38,102 INFO L226 Difference]: Without dead ends: 276 [2018-04-10 14:16:38,102 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 91 GetRequests, 35 SyntacticMatches, 3 SemanticMatches, 53 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 720 ImplicationChecksByTransitivity, 1.6s TimeCoverageRelationStatistics Valid=449, Invalid=2521, Unknown=0, NotChecked=0, Total=2970 [2018-04-10 14:16:38,102 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 276 states. [2018-04-10 14:16:38,104 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 276 to 208. [2018-04-10 14:16:38,105 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 208 states. [2018-04-10 14:16:38,105 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 208 states to 208 states and 241 transitions. [2018-04-10 14:16:38,105 INFO L78 Accepts]: Start accepts. Automaton has 208 states and 241 transitions. Word has length 47 [2018-04-10 14:16:38,105 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-10 14:16:38,106 INFO L459 AbstractCegarLoop]: Abstraction has 208 states and 241 transitions. [2018-04-10 14:16:38,106 INFO L460 AbstractCegarLoop]: Interpolant automaton has 33 states. [2018-04-10 14:16:38,106 INFO L276 IsEmpty]: Start isEmpty. Operand 208 states and 241 transitions. [2018-04-10 14:16:38,106 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2018-04-10 14:16:38,106 INFO L347 BasicCegarLoop]: Found error trace [2018-04-10 14:16:38,106 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] [2018-04-10 14:16:38,106 INFO L408 AbstractCegarLoop]: === Iteration 15 === [mainErr51RequiresViolation, mainErr26RequiresViolation, mainErr54RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr31RequiresViolation, mainErr46RequiresViolation, mainErr29RequiresViolation, mainErr58AssertViolationMEMORY_FREE, mainErr3RequiresViolation, mainErr15RequiresViolation, mainErr49RequiresViolation, mainErr63AssertViolationMEMORY_FREE, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr55RequiresViolation, mainErr17RequiresViolation, mainErr42RequiresViolation, mainErr30RequiresViolation, mainErr11RequiresViolation, mainErr57RequiresViolation, mainErr24RequiresViolation, mainErr44RequiresViolation, mainErr10RequiresViolation, mainErr43RequiresViolation, mainErr4RequiresViolation, mainErr50RequiresViolation, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr59AssertViolationMEMORY_FREE, mainErr36RequiresViolation, mainErr61RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr56RequiresViolation, mainErr62AssertViolationMEMORY_FREE, mainErr64EnsuresViolationMEMORY_LEAK, mainErr48RequiresViolation, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr52RequiresViolation, mainErr45RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr60RequiresViolation, mainErr9RequiresViolation, mainErr53RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr34RequiresViolation, mainErr47RequiresViolation, mainErr14RequiresViolation, mainErr40RequiresViolation]=== [2018-04-10 14:16:38,107 INFO L82 PathProgramCache]: Analyzing trace with hash 2005201463, now seen corresponding path program 1 times [2018-04-10 14:16:38,107 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-04-10 14:16:38,107 INFO L68 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-04-10 14:16:38,107 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-10 14:16:38,107 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-10 14:16:38,107 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-10 14:16:38,118 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-10 14:16:38,119 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:38,340 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:16:38,340 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-04-10 14:16:38,341 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:16:38,346 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-10 14:16:38,372 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-10 14:16:38,375 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-10 14:16:38,384 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 14:16:38,384 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 14:16:38,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, 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:38,385 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-10 14:16:38,385 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-10 14:16:38,386 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:11, output treesize:4 [2018-04-10 14:16:38,395 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:16:38,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, 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:38,396 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-10 14:16:38,397 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-10 14:16:38,400 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:16:38,400 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:21, output treesize:14 [2018-04-10 14:16:38,433 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 14:16:38,435 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:38,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, 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:16:38,436 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-10 14:16:38,439 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-10 14:16:38,442 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-04-10 14:16:38,442 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:34, output treesize:30 [2018-04-10 14:16:38,458 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 14:16:38,459 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 14:16:38,459 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:16:38,460 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-10 14:16:38,471 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-10 14:16:38,471 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:41, output treesize:39 [2018-04-10 14:16:38,492 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 14:16:38,494 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 35 [2018-04-10 14:16:38,496 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 14:16:38,497 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:38,497 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-10 14:16:38,502 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-10 14:16:38,510 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:16:38,510 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:55, output treesize:52 [2018-04-10 14:16:38,583 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 14:16:38,595 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 80 treesize of output 81 [2018-04-10 14:16:38,598 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select 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 88 [2018-04-10 14:16:38,599 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-10 14:16:38,634 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 14:16:38,645 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 2 case distinctions, treesize of input 45 treesize of output 58 [2018-04-10 14:16:38,646 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 2 xjuncts. [2018-04-10 14:16:38,670 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-04-10 14:16:38,688 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 2 xjuncts. [2018-04-10 14:16:38,688 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 2 variables, input treesize:85, output treesize:126 [2018-04-10 14:16:38,782 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 105 treesize of output 87 [2018-04-10 14:16:38,786 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 14:16:38,787 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 100 treesize of output 115 [2018-04-10 14:16:38,787 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-10 14:16:38,821 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 14:16:38,823 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 14:16:38,833 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 1 new quantified variables, introduced 3 case distinctions, treesize of input 52 treesize of output 76 [2018-04-10 14:16:38,833 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 2 xjuncts. [2018-04-10 14:16:38,856 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-04-10 14:16:38,892 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 68 treesize of output 52 [2018-04-10 14:16:38,894 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 14:16:38,895 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 14:16:38,895 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 14:16:38,896 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 58 [2018-04-10 14:16:38,896 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2018-04-10 14:16:38,904 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-10 14:16:38,927 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 2 dim-2 vars, End of recursive call: 4 dim-0 vars, and 3 xjuncts. [2018-04-10 14:16:38,927 INFO L202 ElimStorePlain]: Needed 6 recursive calls to eliminate 5 variables, input treesize:174, output treesize:201 [2018-04-10 14:16:39,244 WARN L151 SmtUtils]: Spent 248ms on a formula simplification. DAG size of input: 58 DAG size of output 45 [2018-04-10 14:16:39,267 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 14:16:39,268 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 14:16:39,269 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 14:16:39,269 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 58 treesize of output 70 [2018-04-10 14:16:39,269 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-10 14:16:39,299 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 14:16:39,300 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 14:16:39,300 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 14:16:39,302 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 14:16:39,302 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 104 treesize of output 128 [2018-04-10 14:16:39,303 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-10 14:16:39,332 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:16:39,332 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 5 variables, input treesize:163, output treesize:187 [2018-04-10 14:16:39,503 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 133 treesize of output 112 [2018-04-10 14:16:39,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, 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:39,505 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-10 14:16:39,521 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-10 14:16:39,557 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 75 treesize of output 71 [2018-04-10 14:16:39,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 8 treesize of output 7 [2018-04-10 14:16:39,559 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-04-10 14:16:39,568 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-10 14:16:39,600 INFO L267 ElimStorePlain]: Start of recursive call 1: 5 dim-0 vars, 2 dim-2 vars, End of recursive call: 7 dim-0 vars, and 2 xjuncts. [2018-04-10 14:16:39,600 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 7 variables, input treesize:209, output treesize:201 [2018-04-10 14:16:39,845 WARN L148 SmtUtils]: Spent 192ms on a formula simplification that was a NOOP. DAG size: 71 [2018-04-10 14:16:39,955 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 1 case distinctions, treesize of input 136 treesize of output 95 [2018-04-10 14:16:39,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, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 88 treesize of output 77 [2018-04-10 14:16:39,959 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-10 14:16:40,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, 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 72 [2018-04-10 14:16:40,012 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-04-10 14:16:40,073 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 14:16:40,074 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 4 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 72 treesize of output 63 [2018-04-10 14:16:40,074 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:16:40,108 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 82 treesize of output 71 [2018-04-10 14:16:40,109 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2018-04-10 14:16:40,141 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select 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 66 [2018-04-10 14:16:40,142 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2018-04-10 14:16:40,173 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 14:16:40,174 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 57 treesize of output 51 [2018-04-10 14:16:40,174 INFO L267 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 1 xjuncts. [2018-04-10 14:16:40,205 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 14:16:40,205 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 14:16:40,214 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 4 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 66 treesize of output 71 [2018-04-10 14:16:40,215 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:16:40,255 INFO L267 ElimStorePlain]: Start of recursive call 2: 7 dim-1 vars, End of recursive call: 2 dim-0 vars, and 3 xjuncts. [2018-04-10 14:16:40,307 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 78 treesize of output 60 [2018-04-10 14:16:40,309 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 14:16:40,310 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 6 [2018-04-10 14:16:40,310 INFO L267 ElimStorePlain]: Start of recursive call 11: End of recursive call: and 1 xjuncts. [2018-04-10 14:16:40,320 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 1 [2018-04-10 14:16:40,320 INFO L267 ElimStorePlain]: Start of recursive call 12: End of recursive call: and 1 xjuncts. [2018-04-10 14:16:40,328 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 14 [2018-04-10 14:16:40,328 INFO L267 ElimStorePlain]: Start of recursive call 13: End of recursive call: and 1 xjuncts. [2018-04-10 14:16:40,334 INFO L267 ElimStorePlain]: Start of recursive call 10: 3 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-10 14:16:40,375 INFO L267 ElimStorePlain]: Start of recursive call 1: 11 dim-0 vars, 2 dim-2 vars, End of recursive call: 10 dim-0 vars, and 4 xjuncts. [2018-04-10 14:16:40,376 INFO L202 ElimStorePlain]: Needed 13 recursive calls to eliminate 13 variables, input treesize:215, output treesize:156 [2018-04-10 14:16:40,473 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:16:40,490 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-04-10 14:16:40,491 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [20, 19] total 38 [2018-04-10 14:16:40,491 INFO L442 AbstractCegarLoop]: Interpolant automaton has 39 states [2018-04-10 14:16:40,491 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 39 interpolants. [2018-04-10 14:16:40,491 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=154, Invalid=1327, Unknown=1, NotChecked=0, Total=1482 [2018-04-10 14:16:40,491 INFO L87 Difference]: Start difference. First operand 208 states and 241 transitions. Second operand 39 states. [2018-04-10 14:16:42,409 WARN L151 SmtUtils]: Spent 914ms on a formula simplification. DAG size of input: 99 DAG size of output 84 [2018-04-10 14:16:49,709 WARN L151 SmtUtils]: Spent 7235ms on a formula simplification. DAG size of input: 118 DAG size of output 106 [2018-04-10 14:17:06,717 WARN L151 SmtUtils]: Spent 16874ms on a formula simplification. DAG size of input: 149 DAG size of output 148 [2018-04-10 14:17:23,539 WARN L151 SmtUtils]: Spent 16677ms on a formula simplification. DAG size of input: 163 DAG size of output 151 [2018-04-10 14:17:56,296 WARN L151 SmtUtils]: Spent 32703ms on a formula simplification. DAG size of input: 116 DAG size of output 104 [2018-04-10 14:17:56,556 WARN L151 SmtUtils]: Spent 116ms on a formula simplification. DAG size of input: 102 DAG size of output 98 [2018-04-10 14:18:03,843 WARN L151 SmtUtils]: Spent 7233ms on a formula simplification. DAG size of input: 102 DAG size of output 101 [2018-04-10 14:18:29,912 WARN L151 SmtUtils]: Spent 25981ms on a formula simplification. DAG size of input: 105 DAG size of output 104 [2018-04-10 14:18:31,727 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-10 14:18:31,727 INFO L93 Difference]: Finished difference Result 595 states and 656 transitions. [2018-04-10 14:18:31,727 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 50 states. [2018-04-10 14:18:31,727 INFO L78 Accepts]: Start accepts. Automaton has 39 states. Word has length 47 [2018-04-10 14:18:31,727 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-10 14:18:31,728 INFO L225 Difference]: With dead ends: 595 [2018-04-10 14:18:31,728 INFO L226 Difference]: Without dead ends: 595 [2018-04-10 14:18:31,730 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 117 GetRequests, 33 SyntacticMatches, 0 SemanticMatches, 84 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2241 ImplicationChecksByTransitivity, 110.7s TimeCoverageRelationStatistics Valid=1362, Invalid=5947, Unknown=1, NotChecked=0, Total=7310 [2018-04-10 14:18:31,730 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 595 states. [2018-04-10 14:18:31,733 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 595 to 286. [2018-04-10 14:18:31,733 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 286 states. [2018-04-10 14:18:31,733 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 286 states to 286 states and 344 transitions. [2018-04-10 14:18:31,733 INFO L78 Accepts]: Start accepts. Automaton has 286 states and 344 transitions. Word has length 47 [2018-04-10 14:18:31,733 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-10 14:18:31,734 INFO L459 AbstractCegarLoop]: Abstraction has 286 states and 344 transitions. [2018-04-10 14:18:31,734 INFO L460 AbstractCegarLoop]: Interpolant automaton has 39 states. [2018-04-10 14:18:31,734 INFO L276 IsEmpty]: Start isEmpty. Operand 286 states and 344 transitions. [2018-04-10 14:18:31,734 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2018-04-10 14:18:31,734 INFO L347 BasicCegarLoop]: Found error trace [2018-04-10 14:18:31,734 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] [2018-04-10 14:18:31,734 INFO L408 AbstractCegarLoop]: === Iteration 16 === [mainErr51RequiresViolation, mainErr26RequiresViolation, mainErr54RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr31RequiresViolation, mainErr46RequiresViolation, mainErr29RequiresViolation, mainErr58AssertViolationMEMORY_FREE, mainErr3RequiresViolation, mainErr15RequiresViolation, mainErr49RequiresViolation, mainErr63AssertViolationMEMORY_FREE, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr55RequiresViolation, mainErr17RequiresViolation, mainErr42RequiresViolation, mainErr30RequiresViolation, mainErr11RequiresViolation, mainErr57RequiresViolation, mainErr24RequiresViolation, mainErr44RequiresViolation, mainErr10RequiresViolation, mainErr43RequiresViolation, mainErr4RequiresViolation, mainErr50RequiresViolation, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr59AssertViolationMEMORY_FREE, mainErr36RequiresViolation, mainErr61RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr56RequiresViolation, mainErr62AssertViolationMEMORY_FREE, mainErr64EnsuresViolationMEMORY_LEAK, mainErr48RequiresViolation, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr52RequiresViolation, mainErr45RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr60RequiresViolation, mainErr9RequiresViolation, mainErr53RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr34RequiresViolation, mainErr47RequiresViolation, mainErr14RequiresViolation, mainErr40RequiresViolation]=== [2018-04-10 14:18:31,734 INFO L82 PathProgramCache]: Analyzing trace with hash 2005201464, now seen corresponding path program 1 times [2018-04-10 14:18:31,734 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-04-10 14:18:31,734 INFO L68 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-04-10 14:18:31,735 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-10 14:18:31,735 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-10 14:18:31,735 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-10 14:18:31,745 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-10 14:18:31,746 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-10 14:18:32,094 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:18:32,095 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-04-10 14:18:32,095 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:18:32,103 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-10 14:18:32,132 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-10 14:18:32,135 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-10 14:18:32,157 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 14:18:32,158 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 14:18:32,158 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:18:32,159 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-10 14:18:32,166 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-10 14:18:32,166 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:20, output treesize:18 [2018-04-10 14:18:32,200 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:18:32,202 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:18:32,202 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-10 14:18:32,205 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-10 14:18:32,215 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:18:32,217 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select 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:18:32,217 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-04-10 14:18:32,219 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-10 14:18:32,226 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:18:32,227 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 3 variables, input treesize:37, output treesize:30 [2018-04-10 14:18:32,323 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 14:18:32,326 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 38 treesize of output 39 [2018-04-10 14:18:32,327 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select 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:18:32,327 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-10 14:18:32,333 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-10 14:18:32,343 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 14:18:32,382 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 26 [2018-04-10 14:18:32,383 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 13 [2018-04-10 14:18:32,384 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-04-10 14:18:32,387 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-10 14:18:32,408 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-04-10 14:18:32,408 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 2 variables, input treesize:70, output treesize:66 [2018-04-10 14:18:32,440 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 14:18:32,441 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 21 [2018-04-10 14:18:32,442 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-10 14:18:32,456 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 14:18:32,457 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 14:18:32,457 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 14:18:32,458 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:18:32,458 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-10 14:18:32,472 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-10 14:18:32,472 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:83, output treesize:92 [2018-04-10 14:18:32,511 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 14:18:32,514 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 77 treesize of output 76 [2018-04-10 14:18:32,516 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 14:18:32,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, 3 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 23 [2018-04-10 14:18:32,517 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-10 14:18:32,528 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-10 14:18:32,552 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:18:32,554 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 14:18:32,555 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 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:18:32,555 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-04-10 14:18:32,561 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-10 14:18:32,577 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:18:32,577 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 4 variables, input treesize:122, output treesize:107 [2018-04-10 14:18:32,706 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 14:18:32,707 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 14:18:32,714 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 34 treesize of output 59 [2018-04-10 14:18:32,717 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select 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:18:32,717 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-10 14:18:32,724 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-10 14:18:32,748 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 14:18:32,749 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 14:18:32,754 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 150 treesize of output 138 [2018-04-10 14:18:32,756 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 9 [2018-04-10 14:18:32,756 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-04-10 14:18:32,772 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-10 14:18:32,789 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:18:32,789 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 3 variables, input treesize:161, output treesize:153 [2018-04-10 14:18:32,838 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 65 treesize of output 80 [2018-04-10 14:18:32,859 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 14:18:32,861 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 39 [2018-04-10 14:18:32,861 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-10 14:18:32,869 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-10 14:18:32,896 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 185 treesize of output 142 [2018-04-10 14:18:32,898 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 14:18:32,899 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:18:32,899 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-04-10 14:18:32,915 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-10 14:18:32,933 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:18:32,933 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 4 variables, input treesize:212, output treesize:188 [2018-04-10 14:18:32,999 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 14:18:32,999 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 14:18:33,001 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 14:18:33,002 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 14:18:33,002 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 7 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 90 [2018-04-10 14:18:33,003 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-10 14:18:33,035 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 14:18:33,035 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 14:18:33,036 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 14:18:33,036 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 14:18:33,037 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:18:33,037 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-10 14:18:33,059 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:18:33,059 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:199, output treesize:170 [2018-04-10 14:18:33,143 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 14:18:33,144 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 14:18:33,153 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 162 treesize of output 153 [2018-04-10 14:18:33,156 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select 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:18:33,156 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-10 14:18:33,175 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-10 14:18:33,203 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 14:18:33,204 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 14:18:33,212 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 6 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 64 treesize of output 121 [2018-04-10 14:18:33,219 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select 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:18:33,219 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-04-10 14:18:33,231 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-10 14:18:33,252 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 1 xjuncts. [2018-04-10 14:18:33,252 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 6 variables, input treesize:192, output treesize:184 [2018-04-10 14:18:33,369 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 14:18:33,370 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 14:18:33,384 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 5 new quantified variables, introduced 0 case distinctions, treesize of input 165 treesize of output 118 [2018-04-10 14:18:33,386 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 14:18:33,387 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 6 [2018-04-10 14:18:33,387 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-10 14:18:33,420 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select 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:18:33,420 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-04-10 14:18:33,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, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 40 treesize of output 27 [2018-04-10 14:18:33,434 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-04-10 14:18:33,445 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 14:18:33,447 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 47 treesize of output 36 [2018-04-10 14:18:33,447 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:18:33,457 INFO L267 ElimStorePlain]: Start of recursive call 2: 4 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-04-10 14:18:33,474 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 14:18:33,475 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 14:18:33,478 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 47 treesize of output 59 [2018-04-10 14:18:33,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 11 treesize of output 3 [2018-04-10 14:18:33,481 INFO L267 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 1 xjuncts. [2018-04-10 14:18:33,493 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select 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:18:33,493 INFO L267 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 1 xjuncts. [2018-04-10 14:18:33,499 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 14:18:33,499 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 6 [2018-04-10 14:18:33,499 INFO L267 ElimStorePlain]: Start of recursive call 10: End of recursive call: and 1 xjuncts. [2018-04-10 14:18:33,504 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 1 [2018-04-10 14:18:33,504 INFO L267 ElimStorePlain]: Start of recursive call 11: End of recursive call: and 1 xjuncts. [2018-04-10 14:18:33,505 INFO L267 ElimStorePlain]: Start of recursive call 7: 4 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-10 14:18:33,514 INFO L267 ElimStorePlain]: Start of recursive call 1: 6 dim-0 vars, 2 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2018-04-10 14:18:33,514 INFO L202 ElimStorePlain]: Needed 11 recursive calls to eliminate 8 variables, input treesize:198, output treesize:23 [2018-04-10 14:18:33,599 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:18:33,617 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-04-10 14:18:33,617 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [19, 20] total 38 [2018-04-10 14:18:33,617 INFO L442 AbstractCegarLoop]: Interpolant automaton has 39 states [2018-04-10 14:18:33,617 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 39 interpolants. [2018-04-10 14:18:33,617 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=137, Invalid=1345, Unknown=0, NotChecked=0, Total=1482 [2018-04-10 14:18:33,618 INFO L87 Difference]: Start difference. First operand 286 states and 344 transitions. Second operand 39 states. [2018-04-10 14:18:35,463 WARN L151 SmtUtils]: Spent 102ms on a formula simplification. DAG size of input: 139 DAG size of output 129 [2018-04-10 14:18:35,738 WARN L151 SmtUtils]: Spent 115ms on a formula simplification. DAG size of input: 152 DAG size of output 134 [2018-04-10 14:18:38,230 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-10 14:18:38,230 INFO L93 Difference]: Finished difference Result 524 states and 592 transitions. [2018-04-10 14:18:38,231 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 41 states. [2018-04-10 14:18:38,231 INFO L78 Accepts]: Start accepts. Automaton has 39 states. Word has length 47 [2018-04-10 14:18:38,231 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-10 14:18:38,232 INFO L225 Difference]: With dead ends: 524 [2018-04-10 14:18:38,232 INFO L226 Difference]: Without dead ends: 524 [2018-04-10 14:18:38,233 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 108 GetRequests, 33 SyntacticMatches, 0 SemanticMatches, 75 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1475 ImplicationChecksByTransitivity, 3.4s TimeCoverageRelationStatistics Valid=929, Invalid=4922, Unknown=1, NotChecked=0, Total=5852 [2018-04-10 14:18:38,233 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 524 states. [2018-04-10 14:18:38,237 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 524 to 320. [2018-04-10 14:18:38,238 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 320 states. [2018-04-10 14:18:38,238 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 320 states to 320 states and 383 transitions. [2018-04-10 14:18:38,238 INFO L78 Accepts]: Start accepts. Automaton has 320 states and 383 transitions. Word has length 47 [2018-04-10 14:18:38,239 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-10 14:18:38,239 INFO L459 AbstractCegarLoop]: Abstraction has 320 states and 383 transitions. [2018-04-10 14:18:38,239 INFO L460 AbstractCegarLoop]: Interpolant automaton has 39 states. [2018-04-10 14:18:38,239 INFO L276 IsEmpty]: Start isEmpty. Operand 320 states and 383 transitions. [2018-04-10 14:18:38,239 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2018-04-10 14:18:38,239 INFO L347 BasicCegarLoop]: Found error trace [2018-04-10 14:18:38,240 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] [2018-04-10 14:18:38,240 INFO L408 AbstractCegarLoop]: === Iteration 17 === [mainErr51RequiresViolation, mainErr26RequiresViolation, mainErr54RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr31RequiresViolation, mainErr46RequiresViolation, mainErr29RequiresViolation, mainErr58AssertViolationMEMORY_FREE, mainErr3RequiresViolation, mainErr15RequiresViolation, mainErr49RequiresViolation, mainErr63AssertViolationMEMORY_FREE, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr55RequiresViolation, mainErr17RequiresViolation, mainErr42RequiresViolation, mainErr30RequiresViolation, mainErr11RequiresViolation, mainErr57RequiresViolation, mainErr24RequiresViolation, mainErr44RequiresViolation, mainErr10RequiresViolation, mainErr43RequiresViolation, mainErr4RequiresViolation, mainErr50RequiresViolation, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr59AssertViolationMEMORY_FREE, mainErr36RequiresViolation, mainErr61RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr56RequiresViolation, mainErr62AssertViolationMEMORY_FREE, mainErr64EnsuresViolationMEMORY_LEAK, mainErr48RequiresViolation, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr52RequiresViolation, mainErr45RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr60RequiresViolation, mainErr9RequiresViolation, mainErr53RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr34RequiresViolation, mainErr47RequiresViolation, mainErr14RequiresViolation, mainErr40RequiresViolation]=== [2018-04-10 14:18:38,240 INFO L82 PathProgramCache]: Analyzing trace with hash 1064293490, now seen corresponding path program 1 times [2018-04-10 14:18:38,240 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-04-10 14:18:38,240 INFO L68 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-04-10 14:18:38,241 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-10 14:18:38,241 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-10 14:18:38,241 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-10 14:18:38,251 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-10 14:18:38,252 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-10 14:18:38,458 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:18:38,458 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-04-10 14:18:38,458 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:18:38,464 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-10 14:18:38,483 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-10 14:18:38,485 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-10 14:18:38,495 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 14:18:38,496 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 14:18:38,496 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:18:38,496 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-10 14:18:38,501 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-10 14:18:38,501 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:21, output treesize:19 [2018-04-10 14:18:38,515 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:18:38,516 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:18:38,516 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-10 14:18:38,517 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-10 14:18:38,522 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:18:38,522 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:30, output treesize:31 [2018-04-10 14:18:38,568 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 14:18:38,570 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 46 treesize of output 47 [2018-04-10 14:18:38,572 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 9 [2018-04-10 14:18:38,572 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-10 14:18:38,578 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-10 14:18:38,584 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-04-10 14:18:38,584 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:51, output treesize:47 [2018-04-10 14:18:38,607 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 14:18:38,607 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 14:18:38,608 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 14:18:38,608 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 20 treesize of output 21 [2018-04-10 14:18:38,609 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-10 14:18:38,615 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-10 14:18:38,615 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:52, output treesize:45 [2018-04-10 14:18:38,635 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 14:18:38,638 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 52 treesize of output 51 [2018-04-10 14:18:38,640 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 14:18:38,641 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 23 [2018-04-10 14:18:38,641 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-10 14:18:38,649 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-10 14:18:38,657 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:18:38,658 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:56, output treesize:53 [2018-04-10 14:18:38,734 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 14:18:38,734 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 14:18:38,739 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 82 [2018-04-10 14:18:38,741 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 9 [2018-04-10 14:18:38,741 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-10 14:18:38,751 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-10 14:18:38,759 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:18:38,759 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:82, output treesize:62 [2018-04-10 14:18:38,792 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 102 treesize of output 75 [2018-04-10 14:18:38,794 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 14:18:38,794 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:18:38,794 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-10 14:18:38,802 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-10 14:18:38,809 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:18:38,810 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:102, output treesize:90 [2018-04-10 14:18:38,889 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 103 treesize of output 78 [2018-04-10 14:18:38,891 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 14:18:38,891 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 84 treesize of output 105 [2018-04-10 14:18:38,891 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-10 14:18:38,902 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-10 14:18:38,917 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:18:38,917 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:103, output treesize:99 [2018-04-10 14:18:38,958 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 106 treesize of output 63 [2018-04-10 14:18:38,960 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 14:18:38,960 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 6 [2018-04-10 14:18:38,960 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-10 14:18:38,968 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 4 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 21 [2018-04-10 14:18:38,968 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-04-10 14:18:38,974 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 14:18:38,975 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 20 treesize of output 15 [2018-04-10 14:18:38,975 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-04-10 14:18:38,977 INFO L267 ElimStorePlain]: Start of recursive call 2: 3 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-10 14:18:38,979 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:18:38,979 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 5 variables, input treesize:106, output treesize:4 [2018-04-10 14:18:38,991 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:18:39,009 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-04-10 14:18:39,009 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 18] total 31 [2018-04-10 14:18:39,009 INFO L442 AbstractCegarLoop]: Interpolant automaton has 31 states [2018-04-10 14:18:39,009 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 31 interpolants. [2018-04-10 14:18:39,010 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=103, Invalid=827, Unknown=0, NotChecked=0, Total=930 [2018-04-10 14:18:39,010 INFO L87 Difference]: Start difference. First operand 320 states and 383 transitions. Second operand 31 states. [2018-04-10 14:18:40,282 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-10 14:18:40,283 INFO L93 Difference]: Finished difference Result 380 states and 437 transitions. [2018-04-10 14:18:40,283 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2018-04-10 14:18:40,283 INFO L78 Accepts]: Start accepts. Automaton has 31 states. Word has length 48 [2018-04-10 14:18:40,283 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-10 14:18:40,284 INFO L225 Difference]: With dead ends: 380 [2018-04-10 14:18:40,284 INFO L226 Difference]: Without dead ends: 380 [2018-04-10 14:18:40,285 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 92 GetRequests, 37 SyntacticMatches, 4 SemanticMatches, 51 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 708 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=444, Invalid=2312, Unknown=0, NotChecked=0, Total=2756 [2018-04-10 14:18:40,285 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 380 states. [2018-04-10 14:18:40,289 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 380 to 318. [2018-04-10 14:18:40,289 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 318 states. [2018-04-10 14:18:40,290 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 318 states to 318 states and 380 transitions. [2018-04-10 14:18:40,290 INFO L78 Accepts]: Start accepts. Automaton has 318 states and 380 transitions. Word has length 48 [2018-04-10 14:18:40,290 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-10 14:18:40,290 INFO L459 AbstractCegarLoop]: Abstraction has 318 states and 380 transitions. [2018-04-10 14:18:40,290 INFO L460 AbstractCegarLoop]: Interpolant automaton has 31 states. [2018-04-10 14:18:40,291 INFO L276 IsEmpty]: Start isEmpty. Operand 318 states and 380 transitions. [2018-04-10 14:18:40,291 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2018-04-10 14:18:40,291 INFO L347 BasicCegarLoop]: Found error trace [2018-04-10 14:18:40,291 INFO L355 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-10 14:18:40,291 INFO L408 AbstractCegarLoop]: === Iteration 18 === [mainErr51RequiresViolation, mainErr26RequiresViolation, mainErr54RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr31RequiresViolation, mainErr46RequiresViolation, mainErr29RequiresViolation, mainErr58AssertViolationMEMORY_FREE, mainErr3RequiresViolation, mainErr15RequiresViolation, mainErr49RequiresViolation, mainErr63AssertViolationMEMORY_FREE, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr55RequiresViolation, mainErr17RequiresViolation, mainErr42RequiresViolation, mainErr30RequiresViolation, mainErr11RequiresViolation, mainErr57RequiresViolation, mainErr24RequiresViolation, mainErr44RequiresViolation, mainErr10RequiresViolation, mainErr43RequiresViolation, mainErr4RequiresViolation, mainErr50RequiresViolation, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr59AssertViolationMEMORY_FREE, mainErr36RequiresViolation, mainErr61RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr56RequiresViolation, mainErr62AssertViolationMEMORY_FREE, mainErr64EnsuresViolationMEMORY_LEAK, mainErr48RequiresViolation, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr52RequiresViolation, mainErr45RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr60RequiresViolation, mainErr9RequiresViolation, mainErr53RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr34RequiresViolation, mainErr47RequiresViolation, mainErr14RequiresViolation, mainErr40RequiresViolation]=== [2018-04-10 14:18:40,292 INFO L82 PathProgramCache]: Analyzing trace with hash 2012431293, now seen corresponding path program 1 times [2018-04-10 14:18:40,292 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-04-10 14:18:40,292 INFO L68 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-04-10 14:18:40,294 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-10 14:18:40,294 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-10 14:18:40,294 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-10 14:18:40,306 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-10 14:18:40,306 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-10 14:18:40,895 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:18:40,895 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-04-10 14:18:40,896 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:18:40,901 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-10 14:18:40,917 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-10 14:18:40,919 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-10 14:18:40,930 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select 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:18:40,930 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-10 14:18:40,936 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 14:18:40,937 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 14:18:40,937 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:18:40,937 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-10 14:18:40,942 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-10 14:18:40,942 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:26, output treesize:23 [2018-04-10 14:18:40,961 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:18:40,962 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-04-10 14:18:40,963 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-10 14:18:40,964 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-10 14:18:40,970 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:18:40,971 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select 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:18:40,971 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-04-10 14:18:40,972 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-10 14:18:40,977 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:18:40,977 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 3 variables, input treesize:42, output treesize:39 [2018-04-10 14:18:41,049 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:18:41,050 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-10 14:18:41,069 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-10 14:18:41,069 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:60, output treesize:44 [2018-04-10 14:18:41,108 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 14:18:41,111 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 38 treesize of output 39 [2018-04-10 14:18:41,112 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select 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:18:41,112 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-10 14:18:41,123 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-10 14:18:41,134 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 14:18:41,136 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 33 [2018-04-10 14:18:41,137 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select 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:18:41,138 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-04-10 14:18:41,142 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-10 14:18:41,150 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-04-10 14:18:41,150 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 2 variables, input treesize:70, output treesize:66 [2018-04-10 14:18:41,179 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 14:18:41,183 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 14:18:41,184 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 14:18:41,184 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:18:41,184 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-10 14:18:41,193 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-10 14:18:41,193 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:71, output treesize:64 [2018-04-10 14:18:41,222 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 14:18:41,224 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 57 treesize of output 56 [2018-04-10 14:18:41,226 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 14:18:41,227 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 27 [2018-04-10 14:18:41,228 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-10 14:18:41,236 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-10 14:18:41,275 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 50 treesize of output 56 [2018-04-10 14:18:41,278 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 14:18:41,279 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 35 [2018-04-10 14:18:41,280 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-04-10 14:18:41,289 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-10 14:18:41,299 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:18:41,299 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 4 variables, input treesize:89, output treesize:80 [2018-04-10 14:18:41,385 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 14:18:41,385 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 14:18:41,390 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 123 [2018-04-10 14:18:41,392 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select 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:18:41,392 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-10 14:18:41,401 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-10 14:18:41,413 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 14:18:41,414 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 14:18:41,418 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 107 treesize of output 107 [2018-04-10 14:18:41,419 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select 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:18:41,419 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-04-10 14:18:41,428 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-10 14:18:41,437 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-04-10 14:18:41,437 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 2 variables, input treesize:127, output treesize:107 [2018-04-10 14:18:41,476 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 190 treesize of output 172 [2018-04-10 14:18:41,478 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 14:18:41,478 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 28 treesize of output 47 [2018-04-10 14:18:41,479 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-10 14:18:41,492 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-10 14:18:41,512 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 175 treesize of output 132 [2018-04-10 14:18:41,515 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 14:18:41,515 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 28 treesize of output 47 [2018-04-10 14:18:41,515 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-04-10 14:18:41,528 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-10 14:18:41,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:18:41,540 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 3 variables, input treesize:198, output treesize:166 [2018-04-10 14:18:41,663 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 171 treesize of output 151 [2018-04-10 14:18:41,665 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 14:18:41,665 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 150 treesize of output 173 [2018-04-10 14:18:41,666 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-10 14:18:41,684 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-10 14:18:41,708 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 172 treesize of output 135 [2018-04-10 14:18:41,710 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 14:18:41,711 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 149 treesize of output 174 [2018-04-10 14:18:41,711 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-04-10 14:18:41,724 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-10 14:18:41,738 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:18:41,739 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 3 variables, input treesize:192, output treesize:184 [2018-04-10 14:18:42,016 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 14:18:42,018 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 5 new quantified variables, introduced 0 case distinctions, treesize of input 202 treesize of output 146 [2018-04-10 14:18:42,021 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 14:18:42,022 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 14:18:42,027 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 3 new quantified variables, introduced 1 case distinctions, treesize of input 77 treesize of output 83 [2018-04-10 14:18:42,028 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:18:42,056 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 14:18:42,057 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 77 treesize of output 68 [2018-04-10 14:18:42,057 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:18:42,059 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 14:18:42,060 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 14:18:42,065 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 93 treesize of output 96 [2018-04-10 14:18:42,066 INFO L267 ElimStorePlain]: Start of recursive call 5: 2 dim-0 vars, End of recursive call: 2 dim-0 vars, and 2 xjuncts. [2018-04-10 14:18:42,112 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 14:18:42,112 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 6 [2018-04-10 14:18:42,113 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2018-04-10 14:18:42,150 INFO L267 ElimStorePlain]: Start of recursive call 2: 3 dim-1 vars, End of recursive call: 6 dim-0 vars, and 3 xjuncts. [2018-04-10 14:18:42,185 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 78 treesize of output 60 [2018-04-10 14:18:42,187 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 3 [2018-04-10 14:18:42,187 INFO L267 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 1 xjuncts. [2018-04-10 14:18:42,204 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 14:18:42,205 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 6 [2018-04-10 14:18:42,205 INFO L267 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 1 xjuncts. [2018-04-10 14:18:42,212 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 14:18:42,212 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 10 [2018-04-10 14:18:42,213 INFO L267 ElimStorePlain]: Start of recursive call 10: End of recursive call: and 1 xjuncts. [2018-04-10 14:18:42,217 INFO L267 ElimStorePlain]: Start of recursive call 7: 3 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-10 14:18:42,220 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 78 treesize of output 60 [2018-04-10 14:18:42,222 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 14:18:42,222 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 36 treesize of output 24 [2018-04-10 14:18:42,223 INFO L267 ElimStorePlain]: Start of recursive call 12: End of recursive call: and 1 xjuncts. [2018-04-10 14:18:42,240 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 14:18:42,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, 1 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 6 [2018-04-10 14:18:42,241 INFO L267 ElimStorePlain]: Start of recursive call 13: End of recursive call: and 1 xjuncts. [2018-04-10 14:18:42,247 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select 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:18:42,247 INFO L267 ElimStorePlain]: Start of recursive call 14: End of recursive call: and 1 xjuncts. [2018-04-10 14:18:42,251 INFO L267 ElimStorePlain]: Start of recursive call 11: 3 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-10 14:18:42,255 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 78 treesize of output 60 [2018-04-10 14:18:42,256 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 14:18:42,257 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 6 [2018-04-10 14:18:42,257 INFO L267 ElimStorePlain]: Start of recursive call 16: End of recursive call: and 1 xjuncts. [2018-04-10 14:18:42,265 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 14:18:42,266 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 36 treesize of output 24 [2018-04-10 14:18:42,266 INFO L267 ElimStorePlain]: Start of recursive call 17: End of recursive call: and 1 xjuncts. [2018-04-10 14:18:42,272 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 3 [2018-04-10 14:18:42,273 INFO L267 ElimStorePlain]: Start of recursive call 18: End of recursive call: and 1 xjuncts. [2018-04-10 14:18:42,282 INFO L267 ElimStorePlain]: Start of recursive call 15: 3 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-10 14:18:42,297 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:18:42,297 INFO L202 ElimStorePlain]: Needed 18 recursive calls to eliminate 5 variables, input treesize:224, output treesize:7 [2018-04-10 14:18:42,353 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:18:42,372 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-04-10 14:18:42,382 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [23, 23] total 43 [2018-04-10 14:18:42,382 INFO L442 AbstractCegarLoop]: Interpolant automaton has 43 states [2018-04-10 14:18:42,383 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 43 interpolants. [2018-04-10 14:18:42,383 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=144, Invalid=1660, Unknown=2, NotChecked=0, Total=1806 [2018-04-10 14:18:42,383 INFO L87 Difference]: Start difference. First operand 318 states and 380 transitions. Second operand 43 states. [2018-04-10 14:18:45,237 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-10 14:18:45,237 INFO L93 Difference]: Finished difference Result 350 states and 401 transitions. [2018-04-10 14:18:45,238 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 33 states. [2018-04-10 14:18:45,238 INFO L78 Accepts]: Start accepts. Automaton has 43 states. Word has length 52 [2018-04-10 14:18:45,238 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-10 14:18:45,239 INFO L225 Difference]: With dead ends: 350 [2018-04-10 14:18:45,239 INFO L226 Difference]: Without dead ends: 350 [2018-04-10 14:18:45,240 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 109 GetRequests, 35 SyntacticMatches, 3 SemanticMatches, 71 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1475 ImplicationChecksByTransitivity, 2.8s TimeCoverageRelationStatistics Valid=636, Invalid=4616, Unknown=4, NotChecked=0, Total=5256 [2018-04-10 14:18:45,240 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 350 states. [2018-04-10 14:18:45,242 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 350 to 325. [2018-04-10 14:18:45,242 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 325 states. [2018-04-10 14:18:45,242 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 325 states to 325 states and 387 transitions. [2018-04-10 14:18:45,242 INFO L78 Accepts]: Start accepts. Automaton has 325 states and 387 transitions. Word has length 52 [2018-04-10 14:18:45,242 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-10 14:18:45,243 INFO L459 AbstractCegarLoop]: Abstraction has 325 states and 387 transitions. [2018-04-10 14:18:45,243 INFO L460 AbstractCegarLoop]: Interpolant automaton has 43 states. [2018-04-10 14:18:45,243 INFO L276 IsEmpty]: Start isEmpty. Operand 325 states and 387 transitions. [2018-04-10 14:18:45,243 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2018-04-10 14:18:45,243 INFO L347 BasicCegarLoop]: Found error trace [2018-04-10 14:18:45,243 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] [2018-04-10 14:18:45,243 INFO L408 AbstractCegarLoop]: === Iteration 19 === [mainErr51RequiresViolation, mainErr26RequiresViolation, mainErr54RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr31RequiresViolation, mainErr46RequiresViolation, mainErr29RequiresViolation, mainErr58AssertViolationMEMORY_FREE, mainErr3RequiresViolation, mainErr15RequiresViolation, mainErr49RequiresViolation, mainErr63AssertViolationMEMORY_FREE, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr55RequiresViolation, mainErr17RequiresViolation, mainErr42RequiresViolation, mainErr30RequiresViolation, mainErr11RequiresViolation, mainErr57RequiresViolation, mainErr24RequiresViolation, mainErr44RequiresViolation, mainErr10RequiresViolation, mainErr43RequiresViolation, mainErr4RequiresViolation, mainErr50RequiresViolation, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr59AssertViolationMEMORY_FREE, mainErr36RequiresViolation, mainErr61RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr56RequiresViolation, mainErr62AssertViolationMEMORY_FREE, mainErr64EnsuresViolationMEMORY_LEAK, mainErr48RequiresViolation, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr52RequiresViolation, mainErr45RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr60RequiresViolation, mainErr9RequiresViolation, mainErr53RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr34RequiresViolation, mainErr47RequiresViolation, mainErr14RequiresViolation, mainErr40RequiresViolation]=== [2018-04-10 14:18:45,243 INFO L82 PathProgramCache]: Analyzing trace with hash 1566136465, now seen corresponding path program 1 times [2018-04-10 14:18:45,243 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-04-10 14:18:45,243 INFO L68 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-04-10 14:18:45,244 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-10 14:18:45,244 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-10 14:18:45,244 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-10 14:18:45,254 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-10 14:18:45,255 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-10 14:18:45,559 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:18:45,559 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-04-10 14:18:45,559 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [20] imperfect sequences [] total 20 [2018-04-10 14:18:45,560 INFO L442 AbstractCegarLoop]: Interpolant automaton has 20 states [2018-04-10 14:18:45,560 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2018-04-10 14:18:45,560 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=68, Invalid=312, Unknown=0, NotChecked=0, Total=380 [2018-04-10 14:18:45,560 INFO L87 Difference]: Start difference. First operand 325 states and 387 transitions. Second operand 20 states. [2018-04-10 14:18:46,479 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-10 14:18:46,479 INFO L93 Difference]: Finished difference Result 352 states and 397 transitions. [2018-04-10 14:18:46,480 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2018-04-10 14:18:46,480 INFO L78 Accepts]: Start accepts. Automaton has 20 states. Word has length 52 [2018-04-10 14:18:46,480 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-10 14:18:46,481 INFO L225 Difference]: With dead ends: 352 [2018-04-10 14:18:46,481 INFO L226 Difference]: Without dead ends: 352 [2018-04-10 14:18:46,481 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 48 GetRequests, 6 SyntacticMatches, 1 SemanticMatches, 41 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 294 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=470, Invalid=1336, Unknown=0, NotChecked=0, Total=1806 [2018-04-10 14:18:46,481 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 352 states. [2018-04-10 14:18:46,483 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 352 to 325. [2018-04-10 14:18:46,484 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 325 states. [2018-04-10 14:18:46,484 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 325 states to 325 states and 386 transitions. [2018-04-10 14:18:46,484 INFO L78 Accepts]: Start accepts. Automaton has 325 states and 386 transitions. Word has length 52 [2018-04-10 14:18:46,484 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-10 14:18:46,484 INFO L459 AbstractCegarLoop]: Abstraction has 325 states and 386 transitions. [2018-04-10 14:18:46,484 INFO L460 AbstractCegarLoop]: Interpolant automaton has 20 states. [2018-04-10 14:18:46,484 INFO L276 IsEmpty]: Start isEmpty. Operand 325 states and 386 transitions. [2018-04-10 14:18:46,485 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2018-04-10 14:18:46,485 INFO L347 BasicCegarLoop]: Found error trace [2018-04-10 14:18:46,485 INFO L355 BasicCegarLoop]: trace histogram [3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-10 14:18:46,485 INFO L408 AbstractCegarLoop]: === Iteration 20 === [mainErr51RequiresViolation, mainErr26RequiresViolation, mainErr54RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr31RequiresViolation, mainErr46RequiresViolation, mainErr29RequiresViolation, mainErr58AssertViolationMEMORY_FREE, mainErr3RequiresViolation, mainErr15RequiresViolation, mainErr49RequiresViolation, mainErr63AssertViolationMEMORY_FREE, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr55RequiresViolation, mainErr17RequiresViolation, mainErr42RequiresViolation, mainErr30RequiresViolation, mainErr11RequiresViolation, mainErr57RequiresViolation, mainErr24RequiresViolation, mainErr44RequiresViolation, mainErr10RequiresViolation, mainErr43RequiresViolation, mainErr4RequiresViolation, mainErr50RequiresViolation, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr59AssertViolationMEMORY_FREE, mainErr36RequiresViolation, mainErr61RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr56RequiresViolation, mainErr62AssertViolationMEMORY_FREE, mainErr64EnsuresViolationMEMORY_LEAK, mainErr48RequiresViolation, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr52RequiresViolation, mainErr45RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr60RequiresViolation, mainErr9RequiresViolation, mainErr53RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr34RequiresViolation, mainErr47RequiresViolation, mainErr14RequiresViolation, mainErr40RequiresViolation]=== [2018-04-10 14:18:46,485 INFO L82 PathProgramCache]: Analyzing trace with hash 1755193251, now seen corresponding path program 2 times [2018-04-10 14:18:46,485 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-04-10 14:18:46,485 INFO L68 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-04-10 14:18:46,486 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-10 14:18:46,486 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-10 14:18:46,486 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-10 14:18:46,493 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-10 14:18:46,494 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-10 14:18:46,908 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-10 14:18:46,908 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-04-10 14:18:46,908 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:18:46,913 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-04-10 14:18:46,954 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-04-10 14:18:46,954 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-04-10 14:18:46,957 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-10 14:18:46,960 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select 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:18:46,960 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-10 14:18:46,962 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-10 14:18:46,962 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2018-04-10 14:18:46,979 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:18:46,979 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 9 [2018-04-10 14:18:46,980 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-10 14:18:46,981 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-10 14:18:46,984 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-04-10 14:18:46,984 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:22, output treesize:18 [2018-04-10 14:18:47,004 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 14:18:47,004 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 14:18:47,005 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:18:47,005 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-10 14:18:47,008 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-10 14:18:47,008 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:23, output treesize:17 [2018-04-10 14:18:47,028 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:18:47,029 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:18:47,029 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-10 14:18:47,030 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-10 14:18:47,035 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:18:47,035 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:33, output treesize:26 [2018-04-10 14:18:47,060 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:18:47,061 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 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:18:47,061 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-10 14:18:47,062 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-10 14:18:47,066 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-04-10 14:18:47,066 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:33, output treesize:22 [2018-04-10 14:18:47,110 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:18:47,111 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select 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:18:47,111 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-10 14:18:47,113 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-10 14:18:47,118 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-04-10 14:18:47,118 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:35, output treesize:31 [2018-04-10 14:18:47,146 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 14:18:47,147 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 14:18:47,147 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:18:47,147 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-10 14:18:47,154 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-10 14:18:47,154 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:42, output treesize:40 [2018-04-10 14:18:47,186 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:18:47,188 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:18:47,188 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-10 14:18:47,189 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-10 14:18:47,196 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:18:47,196 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:51, output treesize:48 [2018-04-10 14:18:47,229 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 19 [2018-04-10 14:18:47,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, 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:18:47,235 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-10 14:18:47,238 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-10 14:18:47,244 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:18:47,245 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:55, output treesize:40 [2018-04-10 14:18:47,342 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 32 treesize of output 52 [2018-04-10 14:18:47,344 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select 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:18:47,344 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-10 14:18:47,366 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 14:18:47,370 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 2 case distinctions, treesize of input 30 treesize of output 39 [2018-04-10 14:18:47,370 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 2 xjuncts. [2018-04-10 14:18:47,384 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-04-10 14:18:47,398 INFO L267 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-2 vars, End of recursive call: 6 dim-0 vars, and 2 xjuncts. [2018-04-10 14:18:47,398 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 5 variables, input treesize:53, output treesize:86 [2018-04-10 14:18:47,455 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 14:18:47,455 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 14:18:47,456 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 14:18:47,456 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:18:47,456 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-10 14:18:47,461 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:18:47,461 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:41, output treesize:34 [2018-04-10 14:18:47,535 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 41 [2018-04-10 14:18:47,537 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select 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:18:47,537 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-10 14:18:47,542 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-10 14:18:47,548 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:18:47,548 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:47, output treesize:43 [2018-04-10 14:18:47,658 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 44 treesize of output 46 [2018-04-10 14:18:47,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, 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:18:47,662 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 2 xjuncts. [2018-04-10 14:18:47,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 7 treesize of output 1 [2018-04-10 14:18:47,670 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-04-10 14:18:47,675 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select 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:18:47,675 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-04-10 14:18:47,678 INFO L267 ElimStorePlain]: Start of recursive call 2: 3 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-04-10 14:18:47,686 INFO L267 ElimStorePlain]: Start of recursive call 1: 5 dim-0 vars, 1 dim-2 vars, End of recursive call: and 2 xjuncts. [2018-04-10 14:18:47,686 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 6 variables, input treesize:59, output treesize:24 [2018-04-10 14:18:47,743 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 7 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2018-04-10 14:18:47,761 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-04-10 14:18:47,761 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [22] imperfect sequences [23] total 43 [2018-04-10 14:18:47,761 INFO L442 AbstractCegarLoop]: Interpolant automaton has 43 states [2018-04-10 14:18:47,761 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 43 interpolants. [2018-04-10 14:18:47,762 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=154, Invalid=1652, Unknown=0, NotChecked=0, Total=1806 [2018-04-10 14:18:47,762 INFO L87 Difference]: Start difference. First operand 325 states and 386 transitions. Second operand 43 states. [2018-04-10 14:18:51,787 WARN L151 SmtUtils]: Spent 111ms on a formula simplification. DAG size of input: 124 DAG size of output 105 [2018-04-10 14:18:55,863 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-10 14:18:55,864 INFO L93 Difference]: Finished difference Result 978 states and 1065 transitions. [2018-04-10 14:18:55,864 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 75 states. [2018-04-10 14:18:55,864 INFO L78 Accepts]: Start accepts. Automaton has 43 states. Word has length 53 [2018-04-10 14:18:55,864 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-10 14:18:55,866 INFO L225 Difference]: With dead ends: 978 [2018-04-10 14:18:55,866 INFO L226 Difference]: Without dead ends: 974 [2018-04-10 14:18:55,868 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 149 GetRequests, 37 SyntacticMatches, 0 SemanticMatches, 112 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3699 ImplicationChecksByTransitivity, 4.7s TimeCoverageRelationStatistics Valid=2387, Invalid=10495, Unknown=0, NotChecked=0, Total=12882 [2018-04-10 14:18:55,868 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 974 states. [2018-04-10 14:18:55,874 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 974 to 502. [2018-04-10 14:18:55,874 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 502 states. [2018-04-10 14:18:55,875 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 502 states to 502 states and 612 transitions. [2018-04-10 14:18:55,876 INFO L78 Accepts]: Start accepts. Automaton has 502 states and 612 transitions. Word has length 53 [2018-04-10 14:18:55,876 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-10 14:18:55,876 INFO L459 AbstractCegarLoop]: Abstraction has 502 states and 612 transitions. [2018-04-10 14:18:55,876 INFO L460 AbstractCegarLoop]: Interpolant automaton has 43 states. [2018-04-10 14:18:55,876 INFO L276 IsEmpty]: Start isEmpty. Operand 502 states and 612 transitions. [2018-04-10 14:18:55,876 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2018-04-10 14:18:55,877 INFO L347 BasicCegarLoop]: Found error trace [2018-04-10 14:18:55,877 INFO L355 BasicCegarLoop]: trace histogram [3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-10 14:18:55,877 INFO L408 AbstractCegarLoop]: === Iteration 21 === [mainErr51RequiresViolation, mainErr26RequiresViolation, mainErr54RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr31RequiresViolation, mainErr46RequiresViolation, mainErr29RequiresViolation, mainErr58AssertViolationMEMORY_FREE, mainErr3RequiresViolation, mainErr15RequiresViolation, mainErr49RequiresViolation, mainErr63AssertViolationMEMORY_FREE, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr55RequiresViolation, mainErr17RequiresViolation, mainErr42RequiresViolation, mainErr30RequiresViolation, mainErr11RequiresViolation, mainErr57RequiresViolation, mainErr24RequiresViolation, mainErr44RequiresViolation, mainErr10RequiresViolation, mainErr43RequiresViolation, mainErr4RequiresViolation, mainErr50RequiresViolation, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr59AssertViolationMEMORY_FREE, mainErr36RequiresViolation, mainErr61RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr56RequiresViolation, mainErr62AssertViolationMEMORY_FREE, mainErr64EnsuresViolationMEMORY_LEAK, mainErr48RequiresViolation, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr52RequiresViolation, mainErr45RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr60RequiresViolation, mainErr9RequiresViolation, mainErr53RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr34RequiresViolation, mainErr47RequiresViolation, mainErr14RequiresViolation, mainErr40RequiresViolation]=== [2018-04-10 14:18:55,877 INFO L82 PathProgramCache]: Analyzing trace with hash 2055934000, now seen corresponding path program 1 times [2018-04-10 14:18:55,877 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-04-10 14:18:55,877 INFO L68 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-04-10 14:18:55,878 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-10 14:18:55,878 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-04-10 14:18:55,878 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-10 14:18:55,890 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-10 14:18:55,890 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-10 14:18:56,507 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-10 14:18:56,508 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-04-10 14:18:56,508 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:18:56,513 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-10 14:18:56,538 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-10 14:18:56,541 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-10 14:18:56,555 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 14:18:56,555 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 14:18:56,556 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:18:56,556 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-10 14:18:56,559 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-10 14:18:56,560 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:17, output treesize:15 [2018-04-10 14:18:56,577 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:18:56,578 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 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:18:56,578 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-10 14:18:56,580 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-10 14:18:56,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, 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:18:56,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, 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:18:56,587 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-04-10 14:18:56,588 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-10 14:18:56,593 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:18:56,593 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 4 variables, input treesize:37, output treesize:23 [2018-04-10 14:18:56,655 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 14:18:56,657 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 38 treesize of output 39 [2018-04-10 14:18:56,659 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select 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:18:56,659 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-10 14:18:56,663 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-10 14:18:56,672 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 14:18:56,674 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 26 [2018-04-10 14:18:56,675 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 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:18:56,675 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-04-10 14:18:56,678 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-10 14:18:56,684 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-04-10 14:18:56,685 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 2 variables, input treesize:63, output treesize:59 [2018-04-10 14:18:56,713 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 14:18:56,714 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 14:18:56,714 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 14:18:56,715 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:18:56,715 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-10 14:18:56,728 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 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:18:56,729 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-10 14:18:56,740 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-10 14:18:56,740 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:79, output treesize:84 [2018-04-10 14:18:56,779 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 14:18:56,782 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 66 treesize of output 65 [2018-04-10 14:18:56,784 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 14:18:56,785 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 27 [2018-04-10 14:18:56,785 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-10 14:18:56,794 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-10 14:18:56,813 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 43 treesize of output 49 [2018-04-10 14:18:56,815 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 14:18:56,816 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 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 35 [2018-04-10 14:18:56,816 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-04-10 14:18:56,822 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-10 14:18:56,843 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:18:56,843 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 3 variables, input treesize:103, output treesize:128 [2018-04-10 14:18:56,954 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 14:18:56,955 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 14:18:56,960 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 148 treesize of output 165 [2018-04-10 14:18:56,962 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 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:18:56,962 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-10 14:18:56,975 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-10 14:18:56,993 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 14:18:56,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 2 new quantified variables, introduced 0 case distinctions, treesize of input 153 treesize of output 141 [2018-04-10 14:18:56,999 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select 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:18:56,999 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-04-10 14:18:57,013 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-10 14:18:57,028 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-04-10 14:18:57,028 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 2 variables, input treesize:183, output treesize:163 [2018-04-10 14:18:57,079 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 249 treesize of output 194 [2018-04-10 14:18:57,081 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 14:18:57,081 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 47 [2018-04-10 14:18:57,082 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-10 14:18:57,100 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-10 14:18:57,124 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 216 treesize of output 198 [2018-04-10 14:18:57,126 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 14:18:57,127 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 28 treesize of output 47 [2018-04-10 14:18:57,127 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-04-10 14:18:57,142 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-10 14:18:57,163 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:18:57,163 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 3 variables, input treesize:254, output treesize:222 [2018-04-10 14:18:57,224 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 14:18:57,225 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 14:18:57,226 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 14:18:57,227 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 14:18:57,227 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 7 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 37 treesize of output 73 [2018-04-10 14:18:57,227 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-10 14:18:57,254 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 14:18:57,255 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 6 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 57 [2018-04-10 14:18:57,255 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-10 14:18:57,280 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:18:57,280 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:233, output treesize:208 [2018-04-10 14:18:57,417 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 14:18:57,426 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 210 treesize of output 193 [2018-04-10 14:18:57,429 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-04-10 14:18:57,429 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-10 14:18:57,452 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-10 14:18:57,482 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 14:18:57,490 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 194 treesize of output 218 [2018-04-10 14:18:57,492 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 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:18:57,492 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-04-10 14:18:57,509 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-10 14:18:57,529 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:18:57,529 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 5 variables, input treesize:230, output treesize:222 [2018-04-10 14:18:57,841 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 14:18:57,846 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 5 new quantified variables, introduced 0 case distinctions, treesize of input 251 treesize of output 184 [2018-04-10 14:18:57,849 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 1 [2018-04-10 14:18:57,849 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-10 14:18:57,870 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 14:18:57,871 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 82 treesize of output 46 [2018-04-10 14:18:57,872 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-04-10 14:18:57,886 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 67 treesize of output 55 [2018-04-10 14:18:57,887 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:18:57,916 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 14:18:57,917 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 6 [2018-04-10 14:18:57,917 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2018-04-10 14:18:57,930 INFO L267 ElimStorePlain]: Start of recursive call 2: 4 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-04-10 14:18:57,949 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 14:18:57,949 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 14:18:57,954 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 77 treesize of output 79 [2018-04-10 14:18:57,956 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 14:18:57,956 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 14 [2018-04-10 14:18:57,957 INFO L267 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 1 xjuncts. [2018-04-10 14:18:57,970 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 14:18:57,970 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 6 [2018-04-10 14:18:57,970 INFO L267 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 1 xjuncts. [2018-04-10 14:18:57,976 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable 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 15 treesize of output 11 [2018-04-10 14:18:57,976 INFO L267 ElimStorePlain]: Start of recursive call 10: End of recursive call: and 1 xjuncts. [2018-04-10 14:18:57,980 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select 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:18:57,980 INFO L267 ElimStorePlain]: Start of recursive call 11: End of recursive call: and 1 xjuncts. [2018-04-10 14:18:57,982 INFO L267 ElimStorePlain]: Start of recursive call 7: 4 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-10 14:18:57,989 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:18:57,990 INFO L202 ElimStorePlain]: Needed 11 recursive calls to eliminate 7 variables, input treesize:274, output treesize:23 [2018-04-10 14:18:58,083 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-10 14:18:58,105 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-04-10 14:18:58,106 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [25, 22] total 46 [2018-04-10 14:18:58,106 INFO L442 AbstractCegarLoop]: Interpolant automaton has 47 states [2018-04-10 14:18:58,106 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 47 interpolants. [2018-04-10 14:18:58,106 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=164, Invalid=1998, Unknown=0, NotChecked=0, Total=2162 [2018-04-10 14:18:58,107 INFO L87 Difference]: Start difference. First operand 502 states and 612 transitions. Second operand 47 states. [2018-04-10 14:18:59,786 WARN L151 SmtUtils]: Spent 141ms on a formula simplification. DAG size of input: 133 DAG size of output 128 [2018-04-10 14:19:00,104 WARN L151 SmtUtils]: Spent 173ms on a formula simplification. DAG size of input: 139 DAG size of output 134 [2018-04-10 14:19:00,266 WARN L151 SmtUtils]: Spent 102ms on a formula simplification. DAG size of input: 135 DAG size of output 130 [2018-04-10 14:19:00,443 WARN L151 SmtUtils]: Spent 121ms on a formula simplification. DAG size of input: 138 DAG size of output 133 [2018-04-10 14:19:00,728 WARN L151 SmtUtils]: Spent 138ms on a formula simplification. DAG size of input: 151 DAG size of output 145 [2018-04-10 14:19:02,368 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-10 14:19:02,368 INFO L93 Difference]: Finished difference Result 641 states and 752 transitions. [2018-04-10 14:19:02,368 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 34 states. [2018-04-10 14:19:02,368 INFO L78 Accepts]: Start accepts. Automaton has 47 states. Word has length 54 [2018-04-10 14:19:02,368 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-10 14:19:02,369 INFO L225 Difference]: With dead ends: 641 [2018-04-10 14:19:02,369 INFO L226 Difference]: Without dead ends: 641 [2018-04-10 14:19:02,370 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 112 GetRequests, 36 SyntacticMatches, 0 SemanticMatches, 76 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1578 ImplicationChecksByTransitivity, 3.8s TimeCoverageRelationStatistics Valid=850, Invalid=5156, Unknown=0, NotChecked=0, Total=6006 [2018-04-10 14:19:02,371 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 641 states. [2018-04-10 14:19:02,374 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 641 to 518. [2018-04-10 14:19:02,374 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 518 states. [2018-04-10 14:19:02,375 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 518 states to 518 states and 630 transitions. [2018-04-10 14:19:02,375 INFO L78 Accepts]: Start accepts. Automaton has 518 states and 630 transitions. Word has length 54 [2018-04-10 14:19:02,375 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-10 14:19:02,375 INFO L459 AbstractCegarLoop]: Abstraction has 518 states and 630 transitions. [2018-04-10 14:19:02,375 INFO L460 AbstractCegarLoop]: Interpolant automaton has 47 states. [2018-04-10 14:19:02,375 INFO L276 IsEmpty]: Start isEmpty. Operand 518 states and 630 transitions. [2018-04-10 14:19:02,376 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2018-04-10 14:19:02,376 INFO L347 BasicCegarLoop]: Found error trace [2018-04-10 14:19:02,376 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] [2018-04-10 14:19:02,376 INFO L408 AbstractCegarLoop]: === Iteration 22 === [mainErr51RequiresViolation, mainErr26RequiresViolation, mainErr54RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr31RequiresViolation, mainErr46RequiresViolation, mainErr29RequiresViolation, mainErr58AssertViolationMEMORY_FREE, mainErr3RequiresViolation, mainErr15RequiresViolation, mainErr49RequiresViolation, mainErr63AssertViolationMEMORY_FREE, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr55RequiresViolation, mainErr17RequiresViolation, mainErr42RequiresViolation, mainErr30RequiresViolation, mainErr11RequiresViolation, mainErr57RequiresViolation, mainErr24RequiresViolation, mainErr44RequiresViolation, mainErr10RequiresViolation, mainErr43RequiresViolation, mainErr4RequiresViolation, mainErr50RequiresViolation, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr59AssertViolationMEMORY_FREE, mainErr36RequiresViolation, mainErr61RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr56RequiresViolation, mainErr62AssertViolationMEMORY_FREE, mainErr64EnsuresViolationMEMORY_LEAK, mainErr48RequiresViolation, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr52RequiresViolation, mainErr45RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr60RequiresViolation, mainErr9RequiresViolation, mainErr53RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr34RequiresViolation, mainErr47RequiresViolation, mainErr14RequiresViolation, mainErr40RequiresViolation]=== [2018-04-10 14:19:02,376 INFO L82 PathProgramCache]: Analyzing trace with hash 1909405081, now seen corresponding path program 1 times [2018-04-10 14:19:02,376 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-04-10 14:19:02,376 INFO L68 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-04-10 14:19:02,377 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-10 14:19:02,377 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-10 14:19:02,377 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-10 14:19:02,384 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-10 14:19:02,385 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-10 14:19:03,298 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-10 14:19:03,299 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-04-10 14:19:03,299 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:19:03,304 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-10 14:19:03,328 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-10 14:19:03,331 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-10 14:19:03,334 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 14:19:03,334 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 14:19:03,335 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:19:03,335 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-10 14:19:03,342 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:19:03,342 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-10 14:19:03,348 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-10 14:19:03,348 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:29, output treesize:26 [2018-04-10 14:19:03,375 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:19:03,376 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:19:03,376 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-10 14:19:03,377 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-10 14:19:03,389 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:19:03,390 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select 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:19:03,390 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-04-10 14:19:03,392 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-10 14:19:03,398 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:19:03,398 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 3 variables, input treesize:45, output treesize:42 [2018-04-10 14:19:03,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, 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:19:03,484 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-10 14:19:03,492 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-10 14:19:03,492 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:63, output treesize:47 [2018-04-10 14:19:03,524 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 14:19:03,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 1 new quantified variables, introduced 0 case distinctions, treesize of input 38 treesize of output 39 [2018-04-10 14:19:03,529 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select 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:19:03,529 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-10 14:19:03,534 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-10 14:19:03,545 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 14:19:03,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 28 treesize of output 33 [2018-04-10 14:19:03,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 14 treesize of output 13 [2018-04-10 14:19:03,549 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-04-10 14:19:03,552 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-10 14:19:03,561 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-04-10 14:19:03,562 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 2 variables, input treesize:73, output treesize:69 [2018-04-10 14:19:03,599 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 14:19:03,600 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 14:19:03,600 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 14:19:03,601 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:19:03,601 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-10 14:19:03,614 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-10 14:19:03,614 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:74, output treesize:67 [2018-04-10 14:19:03,649 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 45 [2018-04-10 14:19:03,651 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 14:19:03,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, 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 35 [2018-04-10 14:19:03,653 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-10 14:19:03,660 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-10 14:19:03,677 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 14:19:03,678 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 14:19:03,679 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 72 treesize of output 80 [2018-04-10 14:19:03,681 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 14:19:03,682 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 25 treesize of output 35 [2018-04-10 14:19:03,682 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-04-10 14:19:03,691 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-10 14:19:03,701 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:19:03,701 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 4 variables, input treesize:97, output treesize:80 [2018-04-10 14:19:03,784 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 14:19:03,784 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 14:19:03,785 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 14:19:03,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 34 treesize of output 59 [2018-04-10 14:19:03,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:19:03,792 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-10 14:19:03,798 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-10 14:19:03,813 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 14:19:03,814 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 14:19:03,814 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 14:19:03,816 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 14:19:03,819 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 105 treesize of output 117 [2018-04-10 14:19:03,820 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 9 [2018-04-10 14:19:03,820 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-04-10 14:19:03,832 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-10 14:19:03,845 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:19:03,846 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 3 variables, input treesize:119, output treesize:111 [2018-04-10 14:19:03,890 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 14:19:03,897 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 65 treesize of output 80 [2018-04-10 14:19:03,899 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 14:19:03,899 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:19:03,899 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-10 14:19:03,908 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-10 14:19:03,927 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 14:19:03,928 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 14:19:03,932 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 140 treesize of output 121 [2018-04-10 14:19:03,934 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 14:19:03,935 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 39 [2018-04-10 14:19:03,935 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-04-10 14:19:03,948 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-10 14:19:03,963 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:19:03,963 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 4 variables, input treesize:170, output treesize:146 [2018-04-10 14:19:04,022 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 14:19:04,023 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 14:19:04,023 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 8 [2018-04-10 14:19:04,023 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-10 14:19:04,040 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:19:04,040 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:154, output treesize:148 [2018-04-10 14:19:04,139 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 14:19:04,164 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 3 new quantified variables, introduced 6 case distinctions, treesize of input 64 treesize of output 141 [2018-04-10 14:19:04,168 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 121 treesize of output 120 [2018-04-10 14:19:04,168 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-10 14:19:04,254 INFO L267 ElimStorePlain]: Start of recursive call 2: 4 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-10 14:19:04,280 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 14:19:04,285 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 14:19:04,305 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 138 treesize of output 147 [2018-04-10 14:19:04,310 WARN L307 Elim1Store]: Array PQE input equivalent to false [2018-04-10 14:19:04,310 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-04-10 14:19:04,534 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select 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:19:04,534 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2018-04-10 14:19:04,598 INFO L682 Elim1Store]: detected equality via solver [2018-04-10 14:19:04,600 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 118 treesize of output 100 [2018-04-10 14:19:04,600 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:19:04,648 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-0 vars, 4 dim-1 vars, End of recursive call: 2 dim-0 vars, and 3 xjuncts. [2018-04-10 14:19:04,709 INFO L267 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 2 dim-2 vars, End of recursive call: 12 dim-0 vars, and 3 xjuncts. [2018-04-10 14:19:04,709 INFO L202 ElimStorePlain]: Needed 7 recursive calls to eliminate 6 variables, input treesize:173, output treesize:450 [2018-04-10 14:19:05,344 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 14:19:05,345 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 14:19:05,347 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 14:19:05,349 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 14:19:05,352 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 6 new quantified variables, introduced 1 case distinctions, treesize of input 176 treesize of output 144 [2018-04-10 14:19:05,359 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 132 treesize of output 137 [2018-04-10 14:19:05,360 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:19:05,423 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 106 [2018-04-10 14:19:05,424 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:19:05,463 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 14:19:05,463 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 119 treesize of output 113 [2018-04-10 14:19:05,464 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-04-10 14:19:05,500 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 14:19:05,501 INFO L682 Elim1Store]: detected equality via solver [2018-04-10 14:19:05,502 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 0 case distinctions, treesize of input 107 treesize of output 99 [2018-04-10 14:19:05,503 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:19:05,538 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 14:19:05,539 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 106 treesize of output 95 [2018-04-10 14:19:05,540 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2018-04-10 14:19:05,570 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 82 treesize of output 70 [2018-04-10 14:19:05,570 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:19:05,601 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 14:19:05,601 INFO L682 Elim1Store]: detected equality via solver [2018-04-10 14:19:05,604 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 89 treesize of output 83 [2018-04-10 14:19:05,604 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:19:05,637 INFO L267 ElimStorePlain]: Start of recursive call 2: 7 dim-1 vars, End of recursive call: 4 dim-0 vars, and 2 xjuncts. [2018-04-10 14:19:05,691 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 1 case distinctions, treesize of input 80 treesize of output 74 [2018-04-10 14:19:05,693 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 70 treesize of output 61 [2018-04-10 14:19:05,694 INFO L267 ElimStorePlain]: Start of recursive call 11: End of recursive call: and 1 xjuncts. [2018-04-10 14:19:05,729 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 66 treesize of output 57 [2018-04-10 14:19:05,729 INFO L267 ElimStorePlain]: Start of recursive call 12: End of recursive call: and 1 xjuncts. [2018-04-10 14:19:05,759 INFO L682 Elim1Store]: detected equality via solver [2018-04-10 14:19:05,760 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 61 treesize of output 57 [2018-04-10 14:19:05,760 INFO L267 ElimStorePlain]: Start of recursive call 13: End of recursive call: and 1 xjuncts. [2018-04-10 14:19:05,795 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 52 treesize of output 47 [2018-04-10 14:19:05,795 INFO L267 ElimStorePlain]: Start of recursive call 14: End of recursive call: and 1 xjuncts. [2018-04-10 14:19:05,828 INFO L682 Elim1Store]: detected equality via solver [2018-04-10 14:19:05,828 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 57 treesize of output 53 [2018-04-10 14:19:05,828 INFO L267 ElimStorePlain]: Start of recursive call 15: End of recursive call: and 1 xjuncts. [2018-04-10 14:19:05,853 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 14:19:05,855 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 48 treesize of output 37 [2018-04-10 14:19:05,855 INFO L267 ElimStorePlain]: Start of recursive call 16: End of recursive call: and 1 xjuncts. [2018-04-10 14:19:05,883 INFO L267 ElimStorePlain]: Start of recursive call 10: 7 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-10 14:19:05,888 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 7 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 84 treesize of output 70 [2018-04-10 14:19:05,891 INFO L682 Elim1Store]: detected equality via solver [2018-04-10 14:19:05,891 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 13 [2018-04-10 14:19:05,891 INFO L267 ElimStorePlain]: Start of recursive call 18: End of recursive call: and 1 xjuncts. [2018-04-10 14:19:05,906 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select 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:19:05,906 INFO L267 ElimStorePlain]: Start of recursive call 19: End of recursive call: and 1 xjuncts. [2018-04-10 14:19:05,918 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 14:19:05,918 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 6 [2018-04-10 14:19:05,918 INFO L267 ElimStorePlain]: Start of recursive call 20: End of recursive call: and 1 xjuncts. [2018-04-10 14:19:05,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, 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:19:05,929 INFO L267 ElimStorePlain]: Start of recursive call 21: End of recursive call: and 1 xjuncts. [2018-04-10 14:19:05,935 INFO L267 ElimStorePlain]: Start of recursive call 17: 4 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-10 14:19:05,956 INFO L267 ElimStorePlain]: Start of recursive call 1: 5 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-04-10 14:19:05,956 INFO L202 ElimStorePlain]: Needed 21 recursive calls to eliminate 7 variables, input treesize:202, output treesize:7 [2018-04-10 14:19:06,004 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-10 14:19:06,022 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-04-10 14:19:06,023 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [25, 25] total 43 [2018-04-10 14:19:06,023 INFO L442 AbstractCegarLoop]: Interpolant automaton has 43 states [2018-04-10 14:19:06,023 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 43 interpolants. [2018-04-10 14:19:06,023 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=171, Invalid=1634, Unknown=1, NotChecked=0, Total=1806 [2018-04-10 14:19:06,023 INFO L87 Difference]: Start difference. First operand 518 states and 630 transitions. Second operand 43 states. [2018-04-10 14:19:07,494 WARN L151 SmtUtils]: Spent 120ms on a formula simplification. DAG size of input: 143 DAG size of output 140 [2018-04-10 14:19:07,981 WARN L151 SmtUtils]: Spent 203ms on a formula simplification. DAG size of input: 198 DAG size of output 193 [2018-04-10 14:19:08,471 WARN L151 SmtUtils]: Spent 232ms on a formula simplification. DAG size of input: 192 DAG size of output 189 [2018-04-10 14:19:09,179 WARN L151 SmtUtils]: Spent 484ms on a formula simplification. DAG size of input: 251 DAG size of output 247 [2018-04-10 14:19:09,541 WARN L151 SmtUtils]: Spent 204ms on a formula simplification. DAG size of input: 197 DAG size of output 193 [2018-04-10 14:19:10,362 WARN L151 SmtUtils]: Spent 155ms on a formula simplification. DAG size of input: 172 DAG size of output 169 [2018-04-10 14:19:10,645 WARN L151 SmtUtils]: Spent 138ms on a formula simplification. DAG size of input: 176 DAG size of output 173 [2018-04-10 14:19:11,604 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-10 14:19:11,605 INFO L93 Difference]: Finished difference Result 567 states and 656 transitions. [2018-04-10 14:19:11,605 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 34 states. [2018-04-10 14:19:11,605 INFO L78 Accepts]: Start accepts. Automaton has 43 states. Word has length 59 [2018-04-10 14:19:11,605 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-10 14:19:11,606 INFO L225 Difference]: With dead ends: 567 [2018-04-10 14:19:11,606 INFO L226 Difference]: Without dead ends: 567 [2018-04-10 14:19:11,606 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 116 GetRequests, 42 SyntacticMatches, 2 SemanticMatches, 72 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1366 ImplicationChecksByTransitivity, 5.1s TimeCoverageRelationStatistics Valid=731, Invalid=4670, Unknown=1, NotChecked=0, Total=5402 [2018-04-10 14:19:11,607 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 567 states. [2018-04-10 14:19:11,610 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 567 to 518. [2018-04-10 14:19:11,610 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 518 states. [2018-04-10 14:19:11,611 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 518 states to 518 states and 628 transitions. [2018-04-10 14:19:11,612 INFO L78 Accepts]: Start accepts. Automaton has 518 states and 628 transitions. Word has length 59 [2018-04-10 14:19:11,612 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-10 14:19:11,612 INFO L459 AbstractCegarLoop]: Abstraction has 518 states and 628 transitions. [2018-04-10 14:19:11,612 INFO L460 AbstractCegarLoop]: Interpolant automaton has 43 states. [2018-04-10 14:19:11,612 INFO L276 IsEmpty]: Start isEmpty. Operand 518 states and 628 transitions. [2018-04-10 14:19:11,613 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2018-04-10 14:19:11,613 INFO L347 BasicCegarLoop]: Found error trace [2018-04-10 14:19:11,613 INFO L355 BasicCegarLoop]: trace histogram [4, 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, 1, 1, 1, 1, 1, 1] [2018-04-10 14:19:11,613 INFO L408 AbstractCegarLoop]: === Iteration 23 === [mainErr51RequiresViolation, mainErr26RequiresViolation, mainErr54RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr31RequiresViolation, mainErr46RequiresViolation, mainErr29RequiresViolation, mainErr58AssertViolationMEMORY_FREE, mainErr3RequiresViolation, mainErr15RequiresViolation, mainErr49RequiresViolation, mainErr63AssertViolationMEMORY_FREE, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr55RequiresViolation, mainErr17RequiresViolation, mainErr42RequiresViolation, mainErr30RequiresViolation, mainErr11RequiresViolation, mainErr57RequiresViolation, mainErr24RequiresViolation, mainErr44RequiresViolation, mainErr10RequiresViolation, mainErr43RequiresViolation, mainErr4RequiresViolation, mainErr50RequiresViolation, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr59AssertViolationMEMORY_FREE, mainErr36RequiresViolation, mainErr61RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr56RequiresViolation, mainErr62AssertViolationMEMORY_FREE, mainErr64EnsuresViolationMEMORY_LEAK, mainErr48RequiresViolation, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr52RequiresViolation, mainErr45RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr60RequiresViolation, mainErr9RequiresViolation, mainErr53RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr34RequiresViolation, mainErr47RequiresViolation, mainErr14RequiresViolation, mainErr40RequiresViolation]=== [2018-04-10 14:19:11,613 INFO L82 PathProgramCache]: Analyzing trace with hash -488381541, now seen corresponding path program 1 times [2018-04-10 14:19:11,613 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-04-10 14:19:11,613 INFO L68 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-04-10 14:19:11,614 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-10 14:19:11,614 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-10 14:19:11,614 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-10 14:19:11,627 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-10 14:19:11,628 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-10 14:19:12,325 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 16 proven. 5 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2018-04-10 14:19:12,326 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-04-10 14:19:12,326 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:19:12,331 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-10 14:19:12,353 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-10 14:19:12,356 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-10 14:19:12,360 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 14:19:12,365 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 5 [2018-04-10 14:19:12,366 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-10 14:19:12,366 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-10 14:19:12,367 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:12, output treesize:5 [2018-04-10 14:19:12,391 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select 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:19:12,391 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-10 14:19:12,396 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 14:19:12,396 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 14:19:12,396 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:19:12,397 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-10 14:19:12,400 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-10 14:19:12,401 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:23, output treesize:20 [2018-04-10 14:19:12,419 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:19:12,420 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-04-10 14:19:12,420 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-10 14:19:12,421 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-10 14:19:12,425 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:19:12,425 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:31, output treesize:32 [2018-04-10 14:19:12,489 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:19:12,490 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select 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:19:12,490 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-10 14:19:12,491 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-10 14:19:12,498 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-04-10 14:19:12,498 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:59, output treesize:59 [2018-04-10 14:19:12,528 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 14:19:12,531 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 60 treesize of output 61 [2018-04-10 14:19:12,532 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select 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:19:12,532 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-10 14:19:12,539 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-10 14:19:12,547 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-04-10 14:19:12,547 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:72, output treesize:68 [2018-04-10 14:19:12,580 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 14:19:12,581 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 37 [2018-04-10 14:19:12,581 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-10 14:19:12,596 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 14:19:12,597 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 14:19:12,597 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 14:19:12,597 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 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:19:12,598 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-10 14:19:12,611 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-10 14:19:12,611 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:85, output treesize:94 [2018-04-10 14:19:12,650 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 14:19:12,652 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 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 85 [2018-04-10 14:19:12,654 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 14:19:12,655 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 23 [2018-04-10 14:19:12,655 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-10 14:19:12,666 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-10 14:19:12,680 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:19:12,680 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:108, output treesize:113 [2018-04-10 14:19:12,812 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 14:19:12,814 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 40 [2018-04-10 14:19:12,816 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select 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:19:12,816 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-10 14:19:12,820 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-10 14:19:12,837 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:19:12,837 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:150, output treesize:154 [2018-04-10 14:19:12,883 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 14:19:12,884 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 14:19:12,889 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 159 treesize of output 147 [2018-04-10 14:19:12,891 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select 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:19:12,891 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-10 14:19:12,917 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-10 14:19:12,937 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:19:12,937 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:167, output treesize:155 [2018-04-10 14:19:12,996 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 179 treesize of output 140 [2018-04-10 14:19:12,998 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 14:19:12,998 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:19:12,998 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-10 14:19:13,022 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-10 14:19:13,041 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:19:13,042 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:187, output treesize:175 [2018-04-10 14:19:13,116 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 14:19:13,116 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 14:19:13,117 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 14:19:13,117 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 40 treesize of output 89 [2018-04-10 14:19:13,117 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-10 14:19:13,147 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 14:19:13,148 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 14:19:13,149 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 14:19:13,150 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 14:19:13,150 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 39 treesize of output 99 [2018-04-10 14:19:13,150 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-10 14:19:13,190 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:19:13,190 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:192, output treesize:189 [2018-04-10 14:19:13,310 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 14:19:13,311 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 14:19:13,319 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 178 treesize of output 169 [2018-04-10 14:19:13,321 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select 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:19:13,321 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-10 14:19:13,342 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-10 14:19:13,368 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:19:13,368 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:200, output treesize:196 [2018-04-10 14:19:13,447 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 14:19:13,447 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 14:19:13,452 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 44 treesize of output 77 [2018-04-10 14:19:13,454 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select 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:19:13,454 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-10 14:19:13,461 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-10 14:19:13,488 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:19:13,488 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:209, output treesize:205 [2018-04-10 14:19:13,626 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 14:19:13,627 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 14:19:13,627 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 33 treesize of output 61 [2018-04-10 14:19:13,627 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-10 14:19:13,651 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:19:13,651 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:205, output treesize:173 [2018-04-10 14:19:13,715 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 14:19:13,716 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 14:19:13,723 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 5 new quantified variables, introduced 0 case distinctions, treesize of input 159 treesize of output 116 [2018-04-10 14:19:13,725 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select 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:19:13,725 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-10 14:19:13,746 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 14:19:13,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, 3 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 40 treesize of output 31 [2018-04-10 14:19:13,747 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:19:13,760 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 45 treesize of output 30 [2018-04-10 14:19:13,760 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-04-10 14:19:13,772 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 14:19:13,772 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 6 [2018-04-10 14:19:13,772 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2018-04-10 14:19:13,782 INFO L267 ElimStorePlain]: Start of recursive call 2: 4 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-04-10 14:19:13,802 INFO L267 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-2 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2018-04-10 14:19:13,802 INFO L202 ElimStorePlain]: Needed 6 recursive calls to eliminate 5 variables, input treesize:180, output treesize:57 [2018-04-10 14:19:13,896 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 14:19:13,896 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 14:19:13,897 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 14:19:13,897 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 30 treesize of output 19 [2018-04-10 14:19:13,897 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-10 14:19:13,907 INFO L267 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-1 vars, End of recursive call: 4 dim-0 vars, and 1 xjuncts. [2018-04-10 14:19:13,907 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:73, output treesize:58 [2018-04-10 14:19:13,955 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 46 treesize of output 48 [2018-04-10 14:19:13,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 7 treesize of output 1 [2018-04-10 14:19:13,957 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-10 14:19:13,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, 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:19:13,963 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-04-10 14:19:13,970 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:19:13,970 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 2 xjuncts. [2018-04-10 14:19:13,974 INFO L267 ElimStorePlain]: Start of recursive call 2: 3 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-04-10 14:19:13,983 INFO L267 ElimStorePlain]: Start of recursive call 1: 6 dim-0 vars, 1 dim-2 vars, End of recursive call: and 2 xjuncts. [2018-04-10 14:19:13,983 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 7 variables, input treesize:67, output treesize:27 [2018-04-10 14:19:14,061 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 16 proven. 5 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2018-04-10 14:19:14,079 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-04-10 14:19:14,080 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [26, 28] total 51 [2018-04-10 14:19:14,080 INFO L442 AbstractCegarLoop]: Interpolant automaton has 51 states [2018-04-10 14:19:14,080 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 51 interpolants. [2018-04-10 14:19:14,080 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=190, Invalid=2360, Unknown=0, NotChecked=0, Total=2550 [2018-04-10 14:19:14,080 INFO L87 Difference]: Start difference. First operand 518 states and 628 transitions. Second operand 51 states. [2018-04-10 14:19:14,925 WARN L151 SmtUtils]: Spent 109ms on a formula simplification. DAG size of input: 126 DAG size of output 78 [2018-04-10 14:19:15,841 WARN L151 SmtUtils]: Spent 114ms on a formula simplification. DAG size of input: 129 DAG size of output 99 [2018-04-10 14:19:16,075 WARN L151 SmtUtils]: Spent 112ms on a formula simplification. DAG size of input: 136 DAG size of output 105 [2018-04-10 14:19:16,263 WARN L151 SmtUtils]: Spent 116ms on a formula simplification. DAG size of input: 142 DAG size of output 112 [2018-04-10 14:19:16,603 WARN L151 SmtUtils]: Spent 145ms on a formula simplification. DAG size of input: 167 DAG size of output 140 [2018-04-10 14:19:16,999 WARN L151 SmtUtils]: Spent 162ms on a formula simplification. DAG size of input: 186 DAG size of output 159 [2018-04-10 14:19:17,174 WARN L151 SmtUtils]: Spent 110ms on a formula simplification. DAG size of input: 146 DAG size of output 119 [2018-04-10 14:19:17,387 WARN L151 SmtUtils]: Spent 130ms on a formula simplification. DAG size of input: 157 DAG size of output 130 [2018-04-10 14:19:17,593 WARN L151 SmtUtils]: Spent 135ms on a formula simplification. DAG size of input: 169 DAG size of output 133 [2018-04-10 14:19:17,780 WARN L151 SmtUtils]: Spent 112ms on a formula simplification. DAG size of input: 148 DAG size of output 121 [2018-04-10 14:19:18,938 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-10 14:19:18,938 INFO L93 Difference]: Finished difference Result 538 states and 608 transitions. [2018-04-10 14:19:18,938 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 41 states. [2018-04-10 14:19:18,939 INFO L78 Accepts]: Start accepts. Automaton has 51 states. Word has length 60 [2018-04-10 14:19:18,939 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-10 14:19:18,940 INFO L225 Difference]: With dead ends: 538 [2018-04-10 14:19:18,940 INFO L226 Difference]: Without dead ends: 537 [2018-04-10 14:19:18,940 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 128 GetRequests, 40 SyntacticMatches, 1 SemanticMatches, 87 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2151 ImplicationChecksByTransitivity, 4.9s TimeCoverageRelationStatistics Valid=1133, Invalid=6699, Unknown=0, NotChecked=0, Total=7832 [2018-04-10 14:19:18,940 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 537 states. [2018-04-10 14:19:18,943 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 537 to 485. [2018-04-10 14:19:18,943 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 485 states. [2018-04-10 14:19:18,944 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 485 states to 485 states and 577 transitions. [2018-04-10 14:19:18,944 INFO L78 Accepts]: Start accepts. Automaton has 485 states and 577 transitions. Word has length 60 [2018-04-10 14:19:18,944 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-10 14:19:18,945 INFO L459 AbstractCegarLoop]: Abstraction has 485 states and 577 transitions. [2018-04-10 14:19:18,945 INFO L460 AbstractCegarLoop]: Interpolant automaton has 51 states. [2018-04-10 14:19:18,945 INFO L276 IsEmpty]: Start isEmpty. Operand 485 states and 577 transitions. [2018-04-10 14:19:18,945 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2018-04-10 14:19:18,945 INFO L347 BasicCegarLoop]: Found error trace [2018-04-10 14:19:18,946 INFO L355 BasicCegarLoop]: trace histogram [4, 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, 1, 1, 1, 1, 1, 1] [2018-04-10 14:19:18,946 INFO L408 AbstractCegarLoop]: === Iteration 24 === [mainErr51RequiresViolation, mainErr26RequiresViolation, mainErr54RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr31RequiresViolation, mainErr46RequiresViolation, mainErr29RequiresViolation, mainErr58AssertViolationMEMORY_FREE, mainErr3RequiresViolation, mainErr15RequiresViolation, mainErr49RequiresViolation, mainErr63AssertViolationMEMORY_FREE, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr55RequiresViolation, mainErr17RequiresViolation, mainErr42RequiresViolation, mainErr30RequiresViolation, mainErr11RequiresViolation, mainErr57RequiresViolation, mainErr24RequiresViolation, mainErr44RequiresViolation, mainErr10RequiresViolation, mainErr43RequiresViolation, mainErr4RequiresViolation, mainErr50RequiresViolation, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr59AssertViolationMEMORY_FREE, mainErr36RequiresViolation, mainErr61RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr56RequiresViolation, mainErr62AssertViolationMEMORY_FREE, mainErr64EnsuresViolationMEMORY_LEAK, mainErr48RequiresViolation, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr52RequiresViolation, mainErr45RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr60RequiresViolation, mainErr9RequiresViolation, mainErr53RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr34RequiresViolation, mainErr47RequiresViolation, mainErr14RequiresViolation, mainErr40RequiresViolation]=== [2018-04-10 14:19:18,946 INFO L82 PathProgramCache]: Analyzing trace with hash 1703444219, now seen corresponding path program 1 times [2018-04-10 14:19:18,946 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-04-10 14:19:18,946 INFO L68 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-04-10 14:19:18,947 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-10 14:19:18,947 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-10 14:19:18,947 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-10 14:19:18,959 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-10 14:19:18,960 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-10 14:19:19,696 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 10 proven. 14 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-10 14:19:19,696 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-04-10 14:19:19,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 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:19:19,704 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-10 14:19:19,724 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-10 14:19:19,727 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-10 14:19:19,729 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 14:19:19,729 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 5 [2018-04-10 14:19:19,730 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-10 14:19:19,730 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-10 14:19:19,731 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:12, output treesize:5 [2018-04-10 14:19:19,799 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 14:19:19,800 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 14:19:19,800 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:19:19,801 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-10 14:19:19,804 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-10 14:19:19,804 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:17, output treesize:15 [2018-04-10 14:19:19,823 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 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:19:19,824 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select 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:19:19,824 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-10 14:19:19,825 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-10 14:19:19,832 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:19:19,833 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:19:19,833 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-04-10 14:19:19,834 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-10 14:19:19,838 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:19:19,838 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 4 variables, input treesize:37, output treesize:23 [2018-04-10 14:19:19,933 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 14:19:19,935 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 26 [2018-04-10 14:19:19,937 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select 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:19:19,937 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-10 14:19:19,940 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-10 14:19:19,949 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 14:19:19,951 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 51 treesize of output 52 [2018-04-10 14:19:19,952 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select 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:19:19,952 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-04-10 14:19:19,958 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-10 14:19:19,965 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-04-10 14:19:19,965 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 2 variables, input treesize:63, output treesize:59 [2018-04-10 14:19:19,998 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 14:19:19,998 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 14:19:19,999 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 14:19:19,999 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:19:19,999 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-10 14:19:20,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, 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:19:20,011 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-10 14:19:20,023 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-10 14:19:20,023 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:76, output treesize:81 [2018-04-10 14:19:20,068 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:19:20,071 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 14:19:20,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 0 case distinctions, treesize of input 20 treesize of output 35 [2018-04-10 14:19:20,072 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-10 14:19:20,079 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-10 14:19:20,097 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 14:19:20,099 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 81 treesize of output 80 [2018-04-10 14:19:20,102 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 14:19:20,103 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 27 [2018-04-10 14:19:20,103 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-04-10 14:19:20,114 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-10 14:19:20,132 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:19:20,132 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 4 variables, input treesize:103, output treesize:113 [2018-04-10 14:19:20,260 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 22 [2018-04-10 14:19:20,261 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select 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:19:20,262 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-10 14:19:20,263 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-10 14:19:20,278 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-04-10 14:19:20,278 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:162, output treesize:170 [2018-04-10 14:19:20,331 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 14:19:20,331 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 14:19:20,337 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 154 treesize of output 171 [2018-04-10 14:19:20,339 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select 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:19:20,339 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-10 14:19:20,353 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-10 14:19:20,373 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 14:19:20,378 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 159 treesize of output 143 [2018-04-10 14:19:20,380 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select 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:19:20,380 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-04-10 14:19:20,394 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-10 14:19:20,411 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-04-10 14:19:20,412 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 2 variables, input treesize:196, output treesize:176 [2018-04-10 14:19:20,474 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 257 treesize of output 239 [2018-04-10 14:19:20,476 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 14:19:20,476 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 47 [2018-04-10 14:19:20,477 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-10 14:19:20,497 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-10 14:19:20,527 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 258 treesize of output 199 [2018-04-10 14:19:20,530 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 14:19:20,530 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 28 treesize of output 47 [2018-04-10 14:19:20,530 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-04-10 14:19:20,550 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-10 14:19:20,570 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:19:20,570 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 3 variables, input treesize:282, output treesize:250 [2018-04-10 14:19:20,635 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 14:19:20,635 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 14:19:20,636 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 14:19:20,637 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 14:19:20,637 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:19:20,637 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-10 14:19:20,672 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 14:19:20,673 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 6 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 43 treesize of output 76 [2018-04-10 14:19:20,673 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-10 14:19:20,704 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:19:20,704 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:267, output treesize:272 [2018-04-10 14:19:20,859 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 14:19:20,868 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 261 treesize of output 232 [2018-04-10 14:19:20,870 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-04-10 14:19:20,870 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-10 14:19:20,894 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-10 14:19:20,929 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 14:19:20,938 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 236 treesize of output 260 [2018-04-10 14:19:20,940 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select 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:19:20,940 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-04-10 14:19:20,961 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-10 14:19:20,991 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:19:20,991 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 3 variables, input treesize:294, output treesize:286 [2018-04-10 14:19:21,077 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 14:19:21,079 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 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 35 treesize of output 48 [2018-04-10 14:19:21,081 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select 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:19:21,081 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-10 14:19:21,085 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-10 14:19:21,120 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:19:21,121 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:299, output treesize:295 [2018-04-10 14:19:21,308 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 14:19:21,309 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 37 treesize of output 73 [2018-04-10 14:19:21,309 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-10 14:19:21,336 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:19:21,336 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:295, output treesize:259 [2018-04-10 14:19:21,419 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 14:19:21,424 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 5 new quantified variables, introduced 0 case distinctions, treesize of input 222 treesize of output 213 [2018-04-10 14:19:21,426 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select 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:19:21,426 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-10 14:19:21,447 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 14:19:21,447 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 6 [2018-04-10 14:19:21,447 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-04-10 14:19:21,461 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select 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:19:21,461 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-04-10 14:19:21,473 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 140 treesize of output 119 [2018-04-10 14:19:21,473 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2018-04-10 14:19:21,483 INFO L267 ElimStorePlain]: Start of recursive call 2: 4 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-10 14:19:21,504 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:19:21,504 INFO L202 ElimStorePlain]: Needed 6 recursive calls to eliminate 4 variables, input treesize:273, output treesize:170 [2018-04-10 14:19:21,695 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 14:19:21,699 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 5 new quantified variables, introduced 0 case distinctions, treesize of input 164 treesize of output 107 [2018-04-10 14:19:21,701 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 14:19:21,701 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 6 [2018-04-10 14:19:21,701 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-10 14:19:21,715 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 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:19:21,715 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-04-10 14:19:21,731 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 14:19:21,732 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 54 treesize of output 38 [2018-04-10 14:19:21,732 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-04-10 14:19:21,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, 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:19:21,740 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:19:21,747 INFO L267 ElimStorePlain]: Start of recursive call 2: 4 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-04-10 14:19:21,758 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:19:21,758 INFO L202 ElimStorePlain]: Needed 6 recursive calls to eliminate 5 variables, input treesize:188, output treesize:48 [2018-04-10 14:19:21,865 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 14:19:21,866 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 14:19:21,866 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 14:19:21,867 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 14:19:21,867 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 30 treesize of output 26 [2018-04-10 14:19:21,868 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-10 14:19:21,875 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2018-04-10 14:19:21,876 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:64, output treesize:41 [2018-04-10 14:19:21,925 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 33 [2018-04-10 14:19:21,928 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:19:21,928 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 2 xjuncts. [2018-04-10 14:19:21,934 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select 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:19:21,934 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-04-10 14:19:21,937 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-04-10 14:19:21,944 INFO L267 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-2 vars, End of recursive call: and 2 xjuncts. [2018-04-10 14:19:21,944 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 5 variables, input treesize:50, output treesize:27 [2018-04-10 14:19:22,060 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 8 proven. 16 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-10 14:19:22,078 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-04-10 14:19:22,078 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [28, 30] total 56 [2018-04-10 14:19:22,078 INFO L442 AbstractCegarLoop]: Interpolant automaton has 56 states [2018-04-10 14:19:22,078 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 56 interpolants. [2018-04-10 14:19:22,078 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=190, Invalid=2889, Unknown=1, NotChecked=0, Total=3080 [2018-04-10 14:19:22,078 INFO L87 Difference]: Start difference. First operand 485 states and 577 transitions. Second operand 56 states. [2018-04-10 14:19:23,825 WARN L151 SmtUtils]: Spent 129ms on a formula simplification. DAG size of input: 143 DAG size of output 102 [2018-04-10 14:19:24,053 WARN L151 SmtUtils]: Spent 134ms on a formula simplification. DAG size of input: 150 DAG size of output 109 [2018-04-10 14:19:24,385 WARN L151 SmtUtils]: Spent 139ms on a formula simplification. DAG size of input: 157 DAG size of output 116 [2018-04-10 14:19:24,838 WARN L151 SmtUtils]: Spent 194ms on a formula simplification. DAG size of input: 188 DAG size of output 160 [2018-04-10 14:19:25,433 WARN L151 SmtUtils]: Spent 228ms on a formula simplification. DAG size of input: 220 DAG size of output 187 [2018-04-10 14:19:25,677 WARN L151 SmtUtils]: Spent 133ms on a formula simplification. DAG size of input: 178 DAG size of output 146 [2018-04-10 14:19:25,937 WARN L151 SmtUtils]: Spent 143ms on a formula simplification. DAG size of input: 180 DAG size of output 148 [2018-04-10 14:19:26,435 WARN L151 SmtUtils]: Spent 164ms on a formula simplification. DAG size of input: 200 DAG size of output 166 [2018-04-10 14:19:26,639 WARN L151 SmtUtils]: Spent 130ms on a formula simplification. DAG size of input: 154 DAG size of output 119 [2018-04-10 14:19:26,870 WARN L151 SmtUtils]: Spent 139ms on a formula simplification. DAG size of input: 163 DAG size of output 121 [2018-04-10 14:19:27,148 WARN L151 SmtUtils]: Spent 143ms on a formula simplification. DAG size of input: 172 DAG size of output 123 [2018-04-10 14:19:28,181 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-10 14:19:28,181 INFO L93 Difference]: Finished difference Result 519 states and 586 transitions. [2018-04-10 14:19:28,181 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 38 states. [2018-04-10 14:19:28,181 INFO L78 Accepts]: Start accepts. Automaton has 56 states. Word has length 60 [2018-04-10 14:19:28,181 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-10 14:19:28,182 INFO L225 Difference]: With dead ends: 519 [2018-04-10 14:19:28,182 INFO L226 Difference]: Without dead ends: 519 [2018-04-10 14:19:28,183 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 126 GetRequests, 34 SyntacticMatches, 3 SemanticMatches, 89 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1889 ImplicationChecksByTransitivity, 5.9s TimeCoverageRelationStatistics Valid=1067, Invalid=7122, Unknown=1, NotChecked=0, Total=8190 [2018-04-10 14:19:28,183 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 519 states. [2018-04-10 14:19:28,185 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 519 to 471. [2018-04-10 14:19:28,185 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 471 states. [2018-04-10 14:19:28,186 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 471 states to 471 states and 554 transitions. [2018-04-10 14:19:28,186 INFO L78 Accepts]: Start accepts. Automaton has 471 states and 554 transitions. Word has length 60 [2018-04-10 14:19:28,186 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-10 14:19:28,186 INFO L459 AbstractCegarLoop]: Abstraction has 471 states and 554 transitions. [2018-04-10 14:19:28,186 INFO L460 AbstractCegarLoop]: Interpolant automaton has 56 states. [2018-04-10 14:19:28,186 INFO L276 IsEmpty]: Start isEmpty. Operand 471 states and 554 transitions. [2018-04-10 14:19:28,186 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 62 [2018-04-10 14:19:28,186 INFO L347 BasicCegarLoop]: Found error trace [2018-04-10 14:19:28,187 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] [2018-04-10 14:19:28,187 INFO L408 AbstractCegarLoop]: === Iteration 25 === [mainErr51RequiresViolation, mainErr26RequiresViolation, mainErr54RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr31RequiresViolation, mainErr46RequiresViolation, mainErr29RequiresViolation, mainErr58AssertViolationMEMORY_FREE, mainErr3RequiresViolation, mainErr15RequiresViolation, mainErr49RequiresViolation, mainErr63AssertViolationMEMORY_FREE, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr55RequiresViolation, mainErr17RequiresViolation, mainErr42RequiresViolation, mainErr30RequiresViolation, mainErr11RequiresViolation, mainErr57RequiresViolation, mainErr24RequiresViolation, mainErr44RequiresViolation, mainErr10RequiresViolation, mainErr43RequiresViolation, mainErr4RequiresViolation, mainErr50RequiresViolation, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr59AssertViolationMEMORY_FREE, mainErr36RequiresViolation, mainErr61RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr56RequiresViolation, mainErr62AssertViolationMEMORY_FREE, mainErr64EnsuresViolationMEMORY_LEAK, mainErr48RequiresViolation, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr52RequiresViolation, mainErr45RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr60RequiresViolation, mainErr9RequiresViolation, mainErr53RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr34RequiresViolation, mainErr47RequiresViolation, mainErr14RequiresViolation, mainErr40RequiresViolation]=== [2018-04-10 14:19:28,187 INFO L82 PathProgramCache]: Analyzing trace with hash 703897152, now seen corresponding path program 1 times [2018-04-10 14:19:28,187 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-04-10 14:19:28,187 INFO L68 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-04-10 14:19:28,187 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-10 14:19:28,187 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-10 14:19:28,187 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-10 14:19:28,193 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-10 14:19:28,194 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-10 14:19:28,251 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:19:28,252 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-04-10 14:19:28,252 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-04-10 14:19:28,252 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-04-10 14:19:28,252 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-04-10 14:19:28,252 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2018-04-10 14:19:28,252 INFO L87 Difference]: Start difference. First operand 471 states and 554 transitions. Second operand 7 states. [2018-04-10 14:19:28,524 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-10 14:19:28,524 INFO L93 Difference]: Finished difference Result 586 states and 690 transitions. [2018-04-10 14:19:28,524 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-04-10 14:19:28,524 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 61 [2018-04-10 14:19:28,525 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-10 14:19:28,525 INFO L225 Difference]: With dead ends: 586 [2018-04-10 14:19:28,526 INFO L226 Difference]: Without dead ends: 586 [2018-04-10 14:19:28,526 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 5 SyntacticMatches, 1 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=38, Invalid=72, Unknown=0, NotChecked=0, Total=110 [2018-04-10 14:19:28,526 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 586 states. [2018-04-10 14:19:28,529 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 586 to 510. [2018-04-10 14:19:28,530 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 510 states. [2018-04-10 14:19:28,531 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 510 states to 510 states and 602 transitions. [2018-04-10 14:19:28,531 INFO L78 Accepts]: Start accepts. Automaton has 510 states and 602 transitions. Word has length 61 [2018-04-10 14:19:28,531 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-10 14:19:28,531 INFO L459 AbstractCegarLoop]: Abstraction has 510 states and 602 transitions. [2018-04-10 14:19:28,531 INFO L460 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-04-10 14:19:28,531 INFO L276 IsEmpty]: Start isEmpty. Operand 510 states and 602 transitions. [2018-04-10 14:19:28,532 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 62 [2018-04-10 14:19:28,532 INFO L347 BasicCegarLoop]: Found error trace [2018-04-10 14:19:28,532 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] [2018-04-10 14:19:28,532 INFO L408 AbstractCegarLoop]: === Iteration 26 === [mainErr51RequiresViolation, mainErr26RequiresViolation, mainErr54RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr31RequiresViolation, mainErr46RequiresViolation, mainErr29RequiresViolation, mainErr58AssertViolationMEMORY_FREE, mainErr3RequiresViolation, mainErr15RequiresViolation, mainErr49RequiresViolation, mainErr63AssertViolationMEMORY_FREE, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr55RequiresViolation, mainErr17RequiresViolation, mainErr42RequiresViolation, mainErr30RequiresViolation, mainErr11RequiresViolation, mainErr57RequiresViolation, mainErr24RequiresViolation, mainErr44RequiresViolation, mainErr10RequiresViolation, mainErr43RequiresViolation, mainErr4RequiresViolation, mainErr50RequiresViolation, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr59AssertViolationMEMORY_FREE, mainErr36RequiresViolation, mainErr61RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr56RequiresViolation, mainErr62AssertViolationMEMORY_FREE, mainErr64EnsuresViolationMEMORY_LEAK, mainErr48RequiresViolation, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr52RequiresViolation, mainErr45RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr60RequiresViolation, mainErr9RequiresViolation, mainErr53RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr34RequiresViolation, mainErr47RequiresViolation, mainErr14RequiresViolation, mainErr40RequiresViolation]=== [2018-04-10 14:19:28,532 INFO L82 PathProgramCache]: Analyzing trace with hash 703897153, now seen corresponding path program 1 times [2018-04-10 14:19:28,532 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-04-10 14:19:28,532 INFO L68 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-04-10 14:19:28,533 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-10 14:19:28,533 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-10 14:19:28,533 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-10 14:19:28,545 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-10 14:19:28,546 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-10 14:19:28,740 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:19:28,741 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-04-10 14:19:28,741 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2018-04-10 14:19:28,741 INFO L442 AbstractCegarLoop]: Interpolant automaton has 12 states [2018-04-10 14:19:28,741 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2018-04-10 14:19:28,741 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=102, Unknown=0, NotChecked=0, Total=132 [2018-04-10 14:19:28,741 INFO L87 Difference]: Start difference. First operand 510 states and 602 transitions. Second operand 12 states. [2018-04-10 14:19:29,164 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-10 14:19:29,164 INFO L93 Difference]: Finished difference Result 845 states and 1006 transitions. [2018-04-10 14:19:29,164 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-04-10 14:19:29,164 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 61 [2018-04-10 14:19:29,164 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-10 14:19:29,166 INFO L225 Difference]: With dead ends: 845 [2018-04-10 14:19:29,166 INFO L226 Difference]: Without dead ends: 845 [2018-04-10 14:19:29,166 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 2 SyntacticMatches, 2 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 34 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=120, Invalid=260, Unknown=0, NotChecked=0, Total=380 [2018-04-10 14:19:29,166 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 845 states. [2018-04-10 14:19:29,170 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 845 to 667. [2018-04-10 14:19:29,170 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 667 states. [2018-04-10 14:19:29,170 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 667 states to 667 states and 806 transitions. [2018-04-10 14:19:29,170 INFO L78 Accepts]: Start accepts. Automaton has 667 states and 806 transitions. Word has length 61 [2018-04-10 14:19:29,171 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-10 14:19:29,171 INFO L459 AbstractCegarLoop]: Abstraction has 667 states and 806 transitions. [2018-04-10 14:19:29,171 INFO L460 AbstractCegarLoop]: Interpolant automaton has 12 states. [2018-04-10 14:19:29,171 INFO L276 IsEmpty]: Start isEmpty. Operand 667 states and 806 transitions. [2018-04-10 14:19:29,171 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2018-04-10 14:19:29,171 INFO L347 BasicCegarLoop]: Found error trace [2018-04-10 14:19:29,171 INFO L355 BasicCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-10 14:19:29,171 INFO L408 AbstractCegarLoop]: === Iteration 27 === [mainErr51RequiresViolation, mainErr26RequiresViolation, mainErr54RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr31RequiresViolation, mainErr46RequiresViolation, mainErr29RequiresViolation, mainErr58AssertViolationMEMORY_FREE, mainErr3RequiresViolation, mainErr15RequiresViolation, mainErr49RequiresViolation, mainErr63AssertViolationMEMORY_FREE, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr55RequiresViolation, mainErr17RequiresViolation, mainErr42RequiresViolation, mainErr30RequiresViolation, mainErr11RequiresViolation, mainErr57RequiresViolation, mainErr24RequiresViolation, mainErr44RequiresViolation, mainErr10RequiresViolation, mainErr43RequiresViolation, mainErr4RequiresViolation, mainErr50RequiresViolation, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr59AssertViolationMEMORY_FREE, mainErr36RequiresViolation, mainErr61RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr56RequiresViolation, mainErr62AssertViolationMEMORY_FREE, mainErr64EnsuresViolationMEMORY_LEAK, mainErr48RequiresViolation, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr52RequiresViolation, mainErr45RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr60RequiresViolation, mainErr9RequiresViolation, mainErr53RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr34RequiresViolation, mainErr47RequiresViolation, mainErr14RequiresViolation, mainErr40RequiresViolation]=== [2018-04-10 14:19:29,171 INFO L82 PathProgramCache]: Analyzing trace with hash -1417265289, now seen corresponding path program 2 times [2018-04-10 14:19:29,171 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-04-10 14:19:29,172 INFO L68 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-04-10 14:19:29,172 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-10 14:19:29,172 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-10 14:19:29,172 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-10 14:19:29,184 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-10 14:19:29,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:19:29,719 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:19:29,719 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-04-10 14:19:29,719 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:19:29,726 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-04-10 14:19:29,766 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-04-10 14:19:29,766 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-04-10 14:19:29,769 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-10 14:19:29,771 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 14:19:29,771 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 14:19:29,772 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:19:29,772 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-10 14:19:29,776 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-10 14:19:29,776 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:23, output treesize:21 [2018-04-10 14:19:29,795 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:19:29,796 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:19:29,796 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-10 14:19:29,797 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-10 14:19:29,804 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:19:29,805 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select 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:19:29,805 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-04-10 14:19:29,806 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-10 14:19:29,823 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:19:29,823 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 3 variables, input treesize:40, output treesize:33 [2018-04-10 14:19:29,849 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:19:29,850 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 3 [2018-04-10 14:19:29,851 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-10 14:19:29,851 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-10 14:19:29,857 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-04-10 14:19:29,857 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:47, output treesize:36 [2018-04-10 14:19:29,889 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 31 [2018-04-10 14:19:29,890 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select 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:19:29,890 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-10 14:19:29,894 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-10 14:19:29,900 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-04-10 14:19:29,900 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:45, output treesize:41 [2018-04-10 14:19:29,925 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 14:19:29,925 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 14:19:29,926 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 14:19:29,926 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:19:29,927 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-10 14:19:29,937 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-10 14:19:29,937 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:52, output treesize:62 [2018-04-10 14:19:29,968 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 14:19:29,969 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 14:19:29,970 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 61 [2018-04-10 14:19:29,971 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 14:19:29,972 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 25 treesize of output 31 [2018-04-10 14:19:29,972 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-10 14:19:29,990 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-10 14:19:30,000 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:19:30,000 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:73, output treesize:66 [2018-04-10 14:19:30,097 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 14:19:30,097 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 14:19:30,098 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 14:19:30,099 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 14:19:30,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 2 new quantified variables, introduced 0 case distinctions, treesize of input 86 treesize of output 98 [2018-04-10 14:19:30,103 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select 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:19:30,103 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-10 14:19:30,113 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-10 14:19:30,121 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-04-10 14:19:30,122 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:94, output treesize:82 [2018-04-10 14:19:30,157 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 14:19:30,158 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 14:19:30,162 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 106 treesize of output 91 [2018-04-10 14:19:30,163 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 14:19:30,163 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:19:30,164 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-10 14:19:30,173 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-10 14:19:30,189 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:19:30,189 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:114, output treesize:102 [2018-04-10 14:19:30,267 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 14:19:30,268 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 14:19:30,270 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 14:19:30,272 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 3 new quantified variables, introduced 0 case distinctions, treesize of input 107 treesize of output 103 [2018-04-10 14:19:30,275 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 14:19:30,282 INFO L477 Elim1Store]: Elim1 applied some preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 115 treesize of output 154 [2018-04-10 14:19:30,283 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:19:30,305 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-10 14:19:30,316 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:19:30,316 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:115, output treesize:111 [2018-04-10 14:19:30,473 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 14:19:30,473 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 14:19:30,504 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 64 [2018-04-10 14:19:30,504 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-10 14:19:30,514 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:19:30,515 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:119, output treesize:101 [2018-04-10 14:19:30,551 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 14:19:30,551 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 14:19:30,552 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 14:19:30,559 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 0 case distinctions, treesize of input 109 treesize of output 107 [2018-04-10 14:19:30,561 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 14:19:30,580 INFO L477 Elim1Store]: Elim1 applied some preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 5 case distinctions, treesize of input 71 treesize of output 100 [2018-04-10 14:19:30,584 INFO L267 ElimStorePlain]: Start of recursive call 3: 6 dim-0 vars, End of recursive call: 6 dim-0 vars, and 7 xjuncts. [2018-04-10 14:19:30,690 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: 6 dim-0 vars, and 6 xjuncts. [2018-04-10 14:19:30,783 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: 18 dim-0 vars, and 6 xjuncts. [2018-04-10 14:19:30,784 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:114, output treesize:571 [2018-04-10 14:19:31,018 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 14:19:31,019 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 14:19:31,020 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 14:19:31,021 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 111 treesize of output 94 [2018-04-10 14:19:31,023 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 14:19:31,023 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 6 [2018-04-10 14:19:31,023 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-10 14:19:31,037 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 14:19:31,041 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 26 treesize of output 24 [2018-04-10 14:19:31,042 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 2 xjuncts. [2018-04-10 14:19:31,055 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 14:19:31,058 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 14:19:31,073 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 5 select indices, 5 select index equivalence classes, 5 disjoint index pairs (out of 10 index pairs), introduced 2 new quantified variables, introduced 4 case distinctions, treesize of input 38 treesize of output 63 [2018-04-10 14:19:31,074 INFO L267 ElimStorePlain]: Start of recursive call 5: 2 dim-0 vars, End of recursive call: 2 dim-0 vars, and 16 xjuncts. [2018-04-10 14:19:31,136 INFO L267 ElimStorePlain]: Start of recursive call 2: 3 dim-1 vars, End of recursive call: 2 dim-0 vars, and 5 xjuncts. [2018-04-10 14:19:31,179 INFO L267 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-2 vars, End of recursive call: 7 dim-0 vars, and 5 xjuncts. [2018-04-10 14:19:31,179 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 5 variables, input treesize:122, output treesize:155 [2018-04-10 14:19:31,342 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 14:19:31,342 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 14:19:31,343 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 14:19:31,343 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 34 [2018-04-10 14:19:31,343 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-10 14:19:31,349 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:19:31,349 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:26, output treesize:20 [2018-04-10 14:19:31,406 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:19:31,423 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-04-10 14:19:31,423 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [25, 27] total 47 [2018-04-10 14:19:31,424 INFO L442 AbstractCegarLoop]: Interpolant automaton has 48 states [2018-04-10 14:19:31,424 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 48 interpolants. [2018-04-10 14:19:31,424 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=222, Invalid=2034, Unknown=0, NotChecked=0, Total=2256 [2018-04-10 14:19:31,424 INFO L87 Difference]: Start difference. First operand 667 states and 806 transitions. Second operand 48 states. [2018-04-10 14:19:33,992 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-10 14:19:33,993 INFO L93 Difference]: Finished difference Result 737 states and 860 transitions. [2018-04-10 14:19:33,993 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 38 states. [2018-04-10 14:19:33,993 INFO L78 Accepts]: Start accepts. Automaton has 48 states. Word has length 64 [2018-04-10 14:19:33,993 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-10 14:19:33,994 INFO L225 Difference]: With dead ends: 737 [2018-04-10 14:19:33,994 INFO L226 Difference]: Without dead ends: 737 [2018-04-10 14:19:33,995 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 129 GetRequests, 41 SyntacticMatches, 7 SemanticMatches, 81 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2115 ImplicationChecksByTransitivity, 2.5s TimeCoverageRelationStatistics Valid=801, Invalid=6005, Unknown=0, NotChecked=0, Total=6806 [2018-04-10 14:19:33,995 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 737 states. [2018-04-10 14:19:34,000 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 737 to 680. [2018-04-10 14:19:34,000 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 680 states. [2018-04-10 14:19:34,001 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 680 states to 680 states and 821 transitions. [2018-04-10 14:19:34,001 INFO L78 Accepts]: Start accepts. Automaton has 680 states and 821 transitions. Word has length 64 [2018-04-10 14:19:34,001 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-10 14:19:34,002 INFO L459 AbstractCegarLoop]: Abstraction has 680 states and 821 transitions. [2018-04-10 14:19:34,002 INFO L460 AbstractCegarLoop]: Interpolant automaton has 48 states. [2018-04-10 14:19:34,002 INFO L276 IsEmpty]: Start isEmpty. Operand 680 states and 821 transitions. [2018-04-10 14:19:34,002 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2018-04-10 14:19:34,003 INFO L347 BasicCegarLoop]: Found error trace [2018-04-10 14:19:34,003 INFO L355 BasicCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-10 14:19:34,003 INFO L408 AbstractCegarLoop]: === Iteration 28 === [mainErr51RequiresViolation, mainErr26RequiresViolation, mainErr54RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr31RequiresViolation, mainErr46RequiresViolation, mainErr29RequiresViolation, mainErr58AssertViolationMEMORY_FREE, mainErr3RequiresViolation, mainErr15RequiresViolation, mainErr49RequiresViolation, mainErr63AssertViolationMEMORY_FREE, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr55RequiresViolation, mainErr17RequiresViolation, mainErr42RequiresViolation, mainErr30RequiresViolation, mainErr11RequiresViolation, mainErr57RequiresViolation, mainErr24RequiresViolation, mainErr44RequiresViolation, mainErr10RequiresViolation, mainErr43RequiresViolation, mainErr4RequiresViolation, mainErr50RequiresViolation, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr59AssertViolationMEMORY_FREE, mainErr36RequiresViolation, mainErr61RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr56RequiresViolation, mainErr62AssertViolationMEMORY_FREE, mainErr64EnsuresViolationMEMORY_LEAK, mainErr48RequiresViolation, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr52RequiresViolation, mainErr45RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr60RequiresViolation, mainErr9RequiresViolation, mainErr53RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr34RequiresViolation, mainErr47RequiresViolation, mainErr14RequiresViolation, mainErr40RequiresViolation]=== [2018-04-10 14:19:34,003 INFO L82 PathProgramCache]: Analyzing trace with hash -1417265288, now seen corresponding path program 2 times [2018-04-10 14:19:34,003 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-04-10 14:19:34,003 INFO L68 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-04-10 14:19:34,004 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-10 14:19:34,004 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-04-10 14:19:34,004 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-10 14:19:34,013 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-10 14:19:34,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:19:34,574 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:19:34,574 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-04-10 14:19:34,574 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:19:34,580 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-04-10 14:19:34,614 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-04-10 14:19:34,615 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-04-10 14:19:34,617 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-10 14:19:34,620 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select 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:19:34,620 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-10 14:19:34,628 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 14:19:34,629 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 14:19:34,629 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:19:34,630 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-10 14:19:34,636 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-10 14:19:34,637 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:29, output treesize:26 [2018-04-10 14:19:34,658 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:19:34,659 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:19:34,659 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-10 14:19:34,660 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-10 14:19:34,668 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 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:19:34,669 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select 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:19:34,669 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-04-10 14:19:34,670 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-10 14:19:34,676 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:19:34,676 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 3 variables, input treesize:45, output treesize:42 [2018-04-10 14:19:34,700 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:19:34,701 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 3 [2018-04-10 14:19:34,701 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-10 14:19:34,702 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-10 14:19:34,709 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-04-10 14:19:34,709 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:56, output treesize:45 [2018-04-10 14:19:34,764 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 14:19:34,766 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 47 treesize of output 48 [2018-04-10 14:19:34,767 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 9 [2018-04-10 14:19:34,768 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-10 14:19:34,773 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-10 14:19:34,780 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-04-10 14:19:34,780 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:58, output treesize:54 [2018-04-10 14:19:34,810 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 14:19:34,811 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:19:34,811 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-10 14:19:34,823 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 14:19:34,824 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 14:19:34,824 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 14:19:34,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, 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:19:34,825 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-10 14:19:34,834 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-10 14:19:34,834 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:68, output treesize:60 [2018-04-10 14:19:34,866 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 14:19:34,868 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 14:19:34,869 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 61 [2018-04-10 14:19:34,870 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 14:19:34,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, 3 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 31 [2018-04-10 14:19:34,871 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-10 14:19:34,880 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-10 14:19:34,891 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 12 [2018-04-10 14:19:34,892 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 11 [2018-04-10 14:19:34,893 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-04-10 14:19:34,894 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-10 14:19:34,903 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:19:34,903 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 3 variables, input treesize:79, output treesize:72 [2018-04-10 14:19:34,990 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 14:19:34,991 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 14:19:34,992 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 14:19:34,992 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 14:19:34,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, 4 disjoint index pairs (out of 3 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 97 treesize of output 109 [2018-04-10 14:19:34,998 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 9 [2018-04-10 14:19:34,998 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-10 14:19:35,010 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-10 14:19:35,024 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 25 treesize of output 38 [2018-04-10 14:19:35,025 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select 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:19:35,025 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-04-10 14:19:35,029 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-10 14:19:35,039 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-04-10 14:19:35,039 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 2 variables, input treesize:113, output treesize:105 [2018-04-10 14:19:35,078 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 14:19:35,078 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 14:19:35,083 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 161 treesize of output 134 [2018-04-10 14:19:35,085 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 14:19:35,085 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:19:35,085 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-10 14:19:35,101 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-10 14:19:35,119 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 56 treesize of output 51 [2018-04-10 14:19:35,121 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 14:19:35,121 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:19:35,121 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-04-10 14:19:35,126 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-10 14:19:35,138 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:19:35,138 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 3 variables, input treesize:164, output treesize:140 [2018-04-10 14:19:35,226 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 14:19:35,231 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 57 treesize of output 90 [2018-04-10 14:19:35,233 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select 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:19:35,233 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-10 14:19:35,240 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-10 14:19:35,257 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 14:19:35,258 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 14:19:35,259 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 14:19:35,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, 5 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 150 treesize of output 136 [2018-04-10 14:19:35,265 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 14:19:35,273 INFO L477 Elim1Store]: Elim1 applied some preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 152 treesize of output 197 [2018-04-10 14:19:35,274 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 2 xjuncts. [2018-04-10 14:19:35,305 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-10 14:19:35,321 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:19:35,322 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 3 variables, input treesize:166, output treesize:158 [2018-04-10 14:19:35,466 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 14:19:35,475 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 3 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 64 treesize of output 94 [2018-04-10 14:19:35,477 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:19:35,478 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-10 14:19:35,487 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-10 14:19:35,510 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 14:19:35,514 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 14:19:35,517 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 0 case distinctions, treesize of input 177 treesize of output 143 [2018-04-10 14:19:35,519 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 14:19:35,544 INFO L477 Elim1Store]: Elim1 applied some preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 5 case distinctions, treesize of input 91 treesize of output 116 [2018-04-10 14:19:35,546 INFO L267 ElimStorePlain]: Start of recursive call 5: 6 dim-0 vars, End of recursive call: 6 dim-0 vars, and 7 xjuncts. [2018-04-10 14:19:35,665 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: 6 dim-0 vars, and 6 xjuncts. [2018-04-10 14:19:35,821 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-2 vars, End of recursive call: 18 dim-0 vars, and 6 xjuncts. [2018-04-10 14:19:35,821 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 4 variables, input treesize:184, output treesize:874 [2018-04-10 14:19:42,064 WARN L151 SmtUtils]: Spent 6128ms on a formula simplification. DAG size of input: 258 DAG size of output 100 [2018-04-10 14:19:42,188 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 14:19:42,190 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 14:19:42,191 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 5 new quantified variables, introduced 0 case distinctions, treesize of input 227 treesize of output 147 [2018-04-10 14:19:42,193 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 14:19:42,195 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 14:19:42,207 INFO L477 Elim1Store]: Elim1 applied some 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 4 new quantified variables, introduced 3 case distinctions, treesize of input 68 treesize of output 83 [2018-04-10 14:19:42,211 INFO L267 ElimStorePlain]: Start of recursive call 3: 12 dim-0 vars, End of recursive call: 12 dim-0 vars, and 7 xjuncts. [2018-04-10 14:19:42,326 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 14:19:42,329 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 14:19:42,370 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 6 select indices, 6 select index equivalence classes, 10 disjoint index pairs (out of 15 index pairs), introduced 3 new quantified variables, introduced 7 case distinctions, treesize of input 118 treesize of output 161 [2018-04-10 14:19:42,370 WARN L130 XnfTransformerHelper]: expecting exponential blowup for input size 7 [2018-04-10 14:19:42,399 INFO L267 ElimStorePlain]: Start of recursive call 4: 10 dim-0 vars, End of recursive call: 10 dim-0 vars, and 128 xjuncts. [2018-04-10 14:19:42,401 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 14:19:42,405 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 14:19:42,419 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 5 select indices, 5 select index equivalence classes, 7 disjoint index pairs (out of 10 index pairs), introduced 2 new quantified variables, introduced 4 case distinctions, treesize of input 104 treesize of output 119 [2018-04-10 14:19:42,422 INFO L267 ElimStorePlain]: Start of recursive call 5: 2 dim-0 vars, End of recursive call: 2 dim-0 vars, and 16 xjuncts. [2018-04-10 14:19:42,426 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 14:19:42,430 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 14:19:42,459 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 6 select indices, 6 select index equivalence classes, 9 disjoint index pairs (out of 15 index pairs), introduced 3 new quantified variables, introduced 8 case distinctions, treesize of input 114 treesize of output 161 [2018-04-10 14:19:42,460 WARN L130 XnfTransformerHelper]: expecting exponential blowup for input size 8 [2018-04-10 14:19:42,517 INFO L267 ElimStorePlain]: Start of recursive call 6: 14 dim-0 vars, End of recursive call: 14 dim-0 vars, and 256 xjuncts. [2018-04-10 14:19:42,519 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 14:19:42,523 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 14:19:42,541 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 5 select indices, 5 select index equivalence classes, 6 disjoint index pairs (out of 10 index pairs), introduced 2 new quantified variables, introduced 4 case distinctions, treesize of input 100 treesize of output 115 [2018-04-10 14:19:42,544 INFO L267 ElimStorePlain]: Start of recursive call 7: 2 dim-0 vars, End of recursive call: 2 dim-0 vars, and 16 xjuncts. [2018-04-10 14:19:42,548 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 14:19:42,552 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 14:19:42,589 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 6 select indices, 6 select index equivalence classes, 9 disjoint index pairs (out of 15 index pairs), introduced 3 new quantified variables, introduced 7 case distinctions, treesize of input 114 treesize of output 153 [2018-04-10 14:19:42,590 WARN L130 XnfTransformerHelper]: expecting exponential blowup for input size 7 [2018-04-10 14:19:42,613 INFO L267 ElimStorePlain]: Start of recursive call 8: 10 dim-0 vars, End of recursive call: 10 dim-0 vars, and 128 xjuncts. [2018-04-10 14:19:42,625 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 14:19:42,633 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 14:19:42,668 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 6 select indices, 6 select index equivalence classes, 9 disjoint index pairs (out of 15 index pairs), introduced 3 new quantified variables, introduced 7 case distinctions, treesize of input 114 treesize of output 157 [2018-04-10 14:19:42,669 WARN L130 XnfTransformerHelper]: expecting exponential blowup for input size 7 [2018-04-10 14:19:42,702 INFO L267 ElimStorePlain]: Start of recursive call 9: 10 dim-0 vars, End of recursive call: 10 dim-0 vars, and 128 xjuncts. [2018-04-10 14:19:42,706 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 14:19:42,710 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 14:19:42,749 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 6 select indices, 6 select index equivalence classes, 8 disjoint index pairs (out of 15 index pairs), introduced 3 new quantified variables, introduced 8 case distinctions, treesize of input 110 treesize of output 157 [2018-04-10 14:19:42,750 WARN L130 XnfTransformerHelper]: expecting exponential blowup for input size 8 [2018-04-10 14:19:42,792 INFO L267 ElimStorePlain]: Start of recursive call 10: 14 dim-0 vars, End of recursive call: 14 dim-0 vars, and 256 xjuncts. Received shutdown request... [2018-04-10 14:19:44,304 INFO L175 TraceCheckSpWp]: Timeout while computing interpolants [2018-04-10 14:19:44,304 WARN L519 AbstractCegarLoop]: Verification canceled [2018-04-10 14:19:44,308 WARN L197 ceAbstractionStarter]: Timeout [2018-04-10 14:19:44,308 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 10.04 02:19:44 BoogieIcfgContainer [2018-04-10 14:19:44,308 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-04-10 14:19:44,309 INFO L168 Benchmark]: Toolchain (without parser) took 201716.60 ms. Allocated memory was 394.3 MB in the beginning and 653.3 MB in the end (delta: 259.0 MB). Free memory was 330.8 MB in the beginning and 398.2 MB in the end (delta: -67.4 MB). Peak memory consumption was 200.7 MB. Max. memory is 5.3 GB. [2018-04-10 14:19:44,310 INFO L168 Benchmark]: CDTParser took 0.13 ms. Allocated memory is still 394.3 MB. Free memory is still 355.9 MB. There was no memory consumed. Max. memory is 5.3 GB. [2018-04-10 14:19:44,310 INFO L168 Benchmark]: CACSL2BoogieTranslator took 244.25 ms. Allocated memory is still 394.3 MB. Free memory was 330.8 MB in the beginning and 301.8 MB in the end (delta: 29.1 MB). Peak memory consumption was 29.1 MB. Max. memory is 5.3 GB. [2018-04-10 14:19:44,310 INFO L168 Benchmark]: Boogie Preprocessor took 45.81 ms. Allocated memory is still 394.3 MB. Free memory was 301.8 MB in the beginning and 299.1 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:19:44,311 INFO L168 Benchmark]: RCFGBuilder took 507.24 ms. Allocated memory was 394.3 MB in the beginning and 595.1 MB in the end (delta: 200.8 MB). Free memory was 299.1 MB in the beginning and 510.5 MB in the end (delta: -211.4 MB). Peak memory consumption was 26.1 MB. Max. memory is 5.3 GB. [2018-04-10 14:19:44,311 INFO L168 Benchmark]: TraceAbstraction took 200916.27 ms. Allocated memory was 595.1 MB in the beginning and 653.3 MB in the end (delta: 58.2 MB). Free memory was 510.5 MB in the beginning and 398.2 MB in the end (delta: 112.3 MB). Peak memory consumption was 179.6 MB. Max. memory is 5.3 GB. [2018-04-10 14:19:44,312 INFO L344 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.13 ms. Allocated memory is still 394.3 MB. Free memory is still 355.9 MB. There was no memory consumed. Max. memory is 5.3 GB. * CACSL2BoogieTranslator took 244.25 ms. Allocated memory is still 394.3 MB. Free memory was 330.8 MB in the beginning and 301.8 MB in the end (delta: 29.1 MB). Peak memory consumption was 29.1 MB. Max. memory is 5.3 GB. * Boogie Preprocessor took 45.81 ms. Allocated memory is still 394.3 MB. Free memory was 301.8 MB in the beginning and 299.1 MB in the end (delta: 2.6 MB). Peak memory consumption was 2.6 MB. Max. memory is 5.3 GB. * RCFGBuilder took 507.24 ms. Allocated memory was 394.3 MB in the beginning and 595.1 MB in the end (delta: 200.8 MB). Free memory was 299.1 MB in the beginning and 510.5 MB in the end (delta: -211.4 MB). Peak memory consumption was 26.1 MB. Max. memory is 5.3 GB. * TraceAbstraction took 200916.27 ms. Allocated memory was 595.1 MB in the beginning and 653.3 MB in the end (delta: 58.2 MB). Free memory was 510.5 MB in the beginning and 398.2 MB in the end (delta: 112.3 MB). Peak memory consumption was 179.6 MB. Max. memory is 5.3 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - TimeoutResultAtElement [Line: 1045]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 1045). Cancelled while BasicCegarLoop was analyzing trace of length 65 with TraceHistMax 3, while TraceCheckSpWp was constructing forward predicates, while PartialQuantifierElimination was eliminating quantifiers from formula with 0 quantifier alternations, while SimplifyDDAWithTimeout was simplifying term of DAG size 1898. - TimeoutResultAtElement [Line: 1017]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 1017). Cancelled while BasicCegarLoop was analyzing trace of length 65 with TraceHistMax 3, while TraceCheckSpWp was constructing forward predicates, while PartialQuantifierElimination was eliminating quantifiers from formula with 0 quantifier alternations, while SimplifyDDAWithTimeout was simplifying term of DAG size 1898. - TimeoutResultAtElement [Line: 1050]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 1050). Cancelled while BasicCegarLoop was analyzing trace of length 65 with TraceHistMax 3, while TraceCheckSpWp was constructing forward predicates, while PartialQuantifierElimination was eliminating quantifiers from formula with 0 quantifier alternations, while SimplifyDDAWithTimeout was simplifying term of DAG size 1898. - TimeoutResultAtElement [Line: 1005]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 1005). Cancelled while BasicCegarLoop was analyzing trace of length 65 with TraceHistMax 3, while TraceCheckSpWp was constructing forward predicates, while PartialQuantifierElimination was eliminating quantifiers from formula with 0 quantifier alternations, while SimplifyDDAWithTimeout was simplifying term of DAG size 1898. - TimeoutResultAtElement [Line: 1013]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 1013). Cancelled while BasicCegarLoop was analyzing trace of length 65 with TraceHistMax 3, while TraceCheckSpWp was constructing forward predicates, while PartialQuantifierElimination was eliminating quantifiers from formula with 0 quantifier alternations, while SimplifyDDAWithTimeout was simplifying term of DAG size 1898. - TimeoutResultAtElement [Line: 1030]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 1030). Cancelled while BasicCegarLoop was analyzing trace of length 65 with TraceHistMax 3, while TraceCheckSpWp was constructing forward predicates, while PartialQuantifierElimination was eliminating quantifiers from formula with 0 quantifier alternations, while SimplifyDDAWithTimeout was simplifying term of DAG size 1898. - TimeoutResultAtElement [Line: 994]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 994). Cancelled while BasicCegarLoop was analyzing trace of length 65 with TraceHistMax 3, while TraceCheckSpWp was constructing forward predicates, while PartialQuantifierElimination was eliminating quantifiers from formula with 0 quantifier alternations, while SimplifyDDAWithTimeout was simplifying term of DAG size 1898. - TimeoutResultAtElement [Line: 1025]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 1025). Cancelled while BasicCegarLoop was analyzing trace of length 65 with TraceHistMax 3, while TraceCheckSpWp was constructing forward predicates, while PartialQuantifierElimination was eliminating quantifiers from formula with 0 quantifier alternations, while SimplifyDDAWithTimeout was simplifying term of DAG size 1898. - TimeoutResultAtElement [Line: 1036]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 1036). Cancelled while BasicCegarLoop was analyzing trace of length 65 with TraceHistMax 3, while TraceCheckSpWp was constructing forward predicates, while PartialQuantifierElimination was eliminating quantifiers from formula with 0 quantifier alternations, while SimplifyDDAWithTimeout was simplifying term of DAG size 1898. - TimeoutResultAtElement [Line: 1019]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 1019). Cancelled while BasicCegarLoop was analyzing trace of length 65 with TraceHistMax 3, while TraceCheckSpWp was constructing forward predicates, while PartialQuantifierElimination was eliminating quantifiers from formula with 0 quantifier alternations, while SimplifyDDAWithTimeout was simplifying term of DAG size 1898. - TimeoutResultAtElement [Line: 1051]: Timeout (TraceAbstraction) Unable to prove that free always succeeds (line 1051). Cancelled while BasicCegarLoop was analyzing trace of length 65 with TraceHistMax 3, while TraceCheckSpWp was constructing forward predicates, while PartialQuantifierElimination was eliminating quantifiers from formula with 0 quantifier alternations, while SimplifyDDAWithTimeout was simplifying term of DAG size 1898. - TimeoutResultAtElement [Line: 995]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 995). Cancelled while BasicCegarLoop was analyzing trace of length 65 with TraceHistMax 3, while TraceCheckSpWp was constructing forward predicates, while PartialQuantifierElimination was eliminating quantifiers from formula with 0 quantifier alternations, while SimplifyDDAWithTimeout was simplifying term of DAG size 1898. - TimeoutResultAtElement [Line: 1003]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 1003). Cancelled while BasicCegarLoop was analyzing trace of length 65 with TraceHistMax 3, while TraceCheckSpWp was constructing forward predicates, while PartialQuantifierElimination was eliminating quantifiers from formula with 0 quantifier alternations, while SimplifyDDAWithTimeout was simplifying term of DAG size 1898. - TimeoutResultAtElement [Line: 1044]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 1044). Cancelled while BasicCegarLoop was analyzing trace of length 65 with TraceHistMax 3, while TraceCheckSpWp was constructing forward predicates, while PartialQuantifierElimination was eliminating quantifiers from formula with 0 quantifier alternations, while SimplifyDDAWithTimeout was simplifying term of DAG size 1898. - TimeoutResultAtElement [Line: 1056]: Timeout (TraceAbstraction) Unable to prove that free always succeeds (line 1056). Cancelled while BasicCegarLoop was analyzing trace of length 65 with TraceHistMax 3, while TraceCheckSpWp was constructing forward predicates, while PartialQuantifierElimination was eliminating quantifiers from formula with 0 quantifier alternations, while SimplifyDDAWithTimeout was simplifying term of DAG size 1898. - TimeoutResultAtElement [Line: 1002]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 1002). Cancelled while BasicCegarLoop was analyzing trace of length 65 with TraceHistMax 3, while TraceCheckSpWp was constructing forward predicates, while PartialQuantifierElimination was eliminating quantifiers from formula with 0 quantifier alternations, while SimplifyDDAWithTimeout was simplifying term of DAG size 1898. - TimeoutResultAtElement [Line: 998]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 998). Cancelled while BasicCegarLoop was analyzing trace of length 65 with TraceHistMax 3, while TraceCheckSpWp was constructing forward predicates, while PartialQuantifierElimination was eliminating quantifiers from formula with 0 quantifier alternations, while SimplifyDDAWithTimeout was simplifying term of DAG size 1898. - TimeoutResultAtElement [Line: 1026]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 1026). Cancelled while BasicCegarLoop was analyzing trace of length 65 with TraceHistMax 3, while TraceCheckSpWp was constructing forward predicates, while PartialQuantifierElimination was eliminating quantifiers from formula with 0 quantifier alternations, while SimplifyDDAWithTimeout was simplifying term of DAG size 1898. - TimeoutResultAtElement [Line: 1050]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 1050). Cancelled while BasicCegarLoop was analyzing trace of length 65 with TraceHistMax 3, while TraceCheckSpWp was constructing forward predicates, while PartialQuantifierElimination was eliminating quantifiers from formula with 0 quantifier alternations, while SimplifyDDAWithTimeout was simplifying term of DAG size 1898. - TimeoutResultAtElement [Line: 1004]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 1004). Cancelled while BasicCegarLoop was analyzing trace of length 65 with TraceHistMax 3, while TraceCheckSpWp was constructing forward predicates, while PartialQuantifierElimination was eliminating quantifiers from formula with 0 quantifier alternations, while SimplifyDDAWithTimeout was simplifying term of DAG size 1898. - TimeoutResultAtElement [Line: 1034]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 1034). Cancelled while BasicCegarLoop was analyzing trace of length 65 with TraceHistMax 3, while TraceCheckSpWp was constructing forward predicates, while PartialQuantifierElimination was eliminating quantifiers from formula with 0 quantifier alternations, while SimplifyDDAWithTimeout was simplifying term of DAG size 1898. - TimeoutResultAtElement [Line: 1025]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 1025). Cancelled while BasicCegarLoop was analyzing trace of length 65 with TraceHistMax 3, while TraceCheckSpWp was constructing forward predicates, while PartialQuantifierElimination was eliminating quantifiers from formula with 0 quantifier alternations, while SimplifyDDAWithTimeout was simplifying term of DAG size 1898. - TimeoutResultAtElement [Line: 1000]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 1000). Cancelled while BasicCegarLoop was analyzing trace of length 65 with TraceHistMax 3, while TraceCheckSpWp was constructing forward predicates, while PartialQuantifierElimination was eliminating quantifiers from formula with 0 quantifier alternations, while SimplifyDDAWithTimeout was simplifying term of DAG size 1898. - TimeoutResultAtElement [Line: 1050]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 1050). Cancelled while BasicCegarLoop was analyzing trace of length 65 with TraceHistMax 3, while TraceCheckSpWp was constructing forward predicates, while PartialQuantifierElimination was eliminating quantifiers from formula with 0 quantifier alternations, while SimplifyDDAWithTimeout was simplifying term of DAG size 1898. - TimeoutResultAtElement [Line: 1015]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 1015). Cancelled while BasicCegarLoop was analyzing trace of length 65 with TraceHistMax 3, while TraceCheckSpWp was constructing forward predicates, while PartialQuantifierElimination was eliminating quantifiers from formula with 0 quantifier alternations, while SimplifyDDAWithTimeout was simplifying term of DAG size 1898. - TimeoutResultAtElement [Line: 1035]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 1035). Cancelled while BasicCegarLoop was analyzing trace of length 65 with TraceHistMax 3, while TraceCheckSpWp was constructing forward predicates, while PartialQuantifierElimination was eliminating quantifiers from formula with 0 quantifier alternations, while SimplifyDDAWithTimeout was simplifying term of DAG size 1898. - TimeoutResultAtElement [Line: 1000]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 1000). Cancelled while BasicCegarLoop was analyzing trace of length 65 with TraceHistMax 3, while TraceCheckSpWp was constructing forward predicates, while PartialQuantifierElimination was eliminating quantifiers from formula with 0 quantifier alternations, while SimplifyDDAWithTimeout was simplifying term of DAG size 1898. - TimeoutResultAtElement [Line: 1034]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 1034). Cancelled while BasicCegarLoop was analyzing trace of length 65 with TraceHistMax 3, while TraceCheckSpWp was constructing forward predicates, while PartialQuantifierElimination was eliminating quantifiers from formula with 0 quantifier alternations, while SimplifyDDAWithTimeout was simplifying term of DAG size 1898. - TimeoutResultAtElement [Line: 997]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 997). Cancelled while BasicCegarLoop was analyzing trace of length 65 with TraceHistMax 3, while TraceCheckSpWp was constructing forward predicates, while PartialQuantifierElimination was eliminating quantifiers from formula with 0 quantifier alternations, while SimplifyDDAWithTimeout was simplifying term of DAG size 1898. - TimeoutResultAtElement [Line: 1045]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 1045). Cancelled while BasicCegarLoop was analyzing trace of length 65 with TraceHistMax 3, while TraceCheckSpWp was constructing forward predicates, while PartialQuantifierElimination was eliminating quantifiers from formula with 0 quantifier alternations, while SimplifyDDAWithTimeout was simplifying term of DAG size 1898. - TimeoutResultAtElement [Line: 1029]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 1029). Cancelled while BasicCegarLoop was analyzing trace of length 65 with TraceHistMax 3, while TraceCheckSpWp was constructing forward predicates, while PartialQuantifierElimination was eliminating quantifiers from formula with 0 quantifier alternations, while SimplifyDDAWithTimeout was simplifying term of DAG size 1898. - TimeoutResultAtElement [Line: 997]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 997). Cancelled while BasicCegarLoop was analyzing trace of length 65 with TraceHistMax 3, while TraceCheckSpWp was constructing forward predicates, while PartialQuantifierElimination was eliminating quantifiers from formula with 0 quantifier alternations, while SimplifyDDAWithTimeout was simplifying term of DAG size 1898. - TimeoutResultAtElement [Line: 1002]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 1002). Cancelled while BasicCegarLoop was analyzing trace of length 65 with TraceHistMax 3, while TraceCheckSpWp was constructing forward predicates, while PartialQuantifierElimination was eliminating quantifiers from formula with 0 quantifier alternations, while SimplifyDDAWithTimeout was simplifying term of DAG size 1898. - TimeoutResultAtElement [Line: 1051]: Timeout (TraceAbstraction) Unable to prove that free always succeeds (line 1051). Cancelled while BasicCegarLoop was analyzing trace of length 65 with TraceHistMax 3, while TraceCheckSpWp was constructing forward predicates, while PartialQuantifierElimination was eliminating quantifiers from formula with 0 quantifier alternations, while SimplifyDDAWithTimeout was simplifying term of DAG size 1898. - TimeoutResultAtElement [Line: 1029]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 1029). Cancelled while BasicCegarLoop was analyzing trace of length 65 with TraceHistMax 3, while TraceCheckSpWp was constructing forward predicates, while PartialQuantifierElimination was eliminating quantifiers from formula with 0 quantifier alternations, while SimplifyDDAWithTimeout was simplifying term of DAG size 1898. - TimeoutResultAtElement [Line: 1055]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 1055). Cancelled while BasicCegarLoop was analyzing trace of length 65 with TraceHistMax 3, while TraceCheckSpWp was constructing forward predicates, while PartialQuantifierElimination was eliminating quantifiers from formula with 0 quantifier alternations, while SimplifyDDAWithTimeout was simplifying term of DAG size 1898. - TimeoutResultAtElement [Line: 1019]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 1019). Cancelled while BasicCegarLoop was analyzing trace of length 65 with TraceHistMax 3, while TraceCheckSpWp was constructing forward predicates, while PartialQuantifierElimination was eliminating quantifiers from formula with 0 quantifier alternations, while SimplifyDDAWithTimeout was simplifying term of DAG size 1898. - TimeoutResultAtElement [Line: 1025]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 1025). Cancelled while BasicCegarLoop was analyzing trace of length 65 with TraceHistMax 3, while TraceCheckSpWp was constructing forward predicates, while PartialQuantifierElimination was eliminating quantifiers from formula with 0 quantifier alternations, while SimplifyDDAWithTimeout was simplifying term of DAG size 1898. - TimeoutResultAtElement [Line: 1006]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 1006). Cancelled while BasicCegarLoop was analyzing trace of length 65 with TraceHistMax 3, while TraceCheckSpWp was constructing forward predicates, while PartialQuantifierElimination was eliminating quantifiers from formula with 0 quantifier alternations, while SimplifyDDAWithTimeout was simplifying term of DAG size 1898. - TimeoutResultAtElement [Line: 1033]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 1033). Cancelled while BasicCegarLoop was analyzing trace of length 65 with TraceHistMax 3, while TraceCheckSpWp was constructing forward predicates, while PartialQuantifierElimination was eliminating quantifiers from formula with 0 quantifier alternations, while SimplifyDDAWithTimeout was simplifying term of DAG size 1898. - TimeoutResultAtElement [Line: 1050]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 1050). Cancelled while BasicCegarLoop was analyzing trace of length 65 with TraceHistMax 3, while TraceCheckSpWp was constructing forward predicates, while PartialQuantifierElimination was eliminating quantifiers from formula with 0 quantifier alternations, while SimplifyDDAWithTimeout was simplifying term of DAG size 1898. - TimeoutResultAtElement [Line: 1056]: Timeout (TraceAbstraction) Unable to prove that free always succeeds (line 1056). Cancelled while BasicCegarLoop was analyzing trace of length 65 with TraceHistMax 3, while TraceCheckSpWp was constructing forward predicates, while PartialQuantifierElimination was eliminating quantifiers from formula with 0 quantifier alternations, while SimplifyDDAWithTimeout was simplifying term of DAG size 1898. - TimeoutResultAtElement [Line: 990]: Timeout (TraceAbstraction) Unable to prove that all allocated memory was freed (line 990). Cancelled while BasicCegarLoop was analyzing trace of length 65 with TraceHistMax 3, while TraceCheckSpWp was constructing forward predicates, while PartialQuantifierElimination was eliminating quantifiers from formula with 0 quantifier alternations, while SimplifyDDAWithTimeout was simplifying term of DAG size 1898. - TimeoutResultAtElement [Line: 1044]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 1044). Cancelled while BasicCegarLoop was analyzing trace of length 65 with TraceHistMax 3, while TraceCheckSpWp was constructing forward predicates, while PartialQuantifierElimination was eliminating quantifiers from formula with 0 quantifier alternations, while SimplifyDDAWithTimeout was simplifying term of DAG size 1898. - TimeoutResultAtElement [Line: 1030]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 1030). Cancelled while BasicCegarLoop was analyzing trace of length 65 with TraceHistMax 3, while TraceCheckSpWp was constructing forward predicates, while PartialQuantifierElimination was eliminating quantifiers from formula with 0 quantifier alternations, while SimplifyDDAWithTimeout was simplifying term of DAG size 1898. - TimeoutResultAtElement [Line: 1004]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 1004). Cancelled while BasicCegarLoop was analyzing trace of length 65 with TraceHistMax 3, while TraceCheckSpWp was constructing forward predicates, while PartialQuantifierElimination was eliminating quantifiers from formula with 0 quantifier alternations, while SimplifyDDAWithTimeout was simplifying term of DAG size 1898. - TimeoutResultAtElement [Line: 1015]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 1015). Cancelled while BasicCegarLoop was analyzing trace of length 65 with TraceHistMax 3, while TraceCheckSpWp was constructing forward predicates, while PartialQuantifierElimination was eliminating quantifiers from formula with 0 quantifier alternations, while SimplifyDDAWithTimeout was simplifying term of DAG size 1898. - TimeoutResultAtElement [Line: 995]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 995). Cancelled while BasicCegarLoop was analyzing trace of length 65 with TraceHistMax 3, while TraceCheckSpWp was constructing forward predicates, while PartialQuantifierElimination was eliminating quantifiers from formula with 0 quantifier alternations, while SimplifyDDAWithTimeout was simplifying term of DAG size 1898. - TimeoutResultAtElement [Line: 1049]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 1049). Cancelled while BasicCegarLoop was analyzing trace of length 65 with TraceHistMax 3, while TraceCheckSpWp was constructing forward predicates, while PartialQuantifierElimination was eliminating quantifiers from formula with 0 quantifier alternations, while SimplifyDDAWithTimeout was simplifying term of DAG size 1898. - TimeoutResultAtElement [Line: 1035]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 1035). Cancelled while BasicCegarLoop was analyzing trace of length 65 with TraceHistMax 3, while TraceCheckSpWp was constructing forward predicates, while PartialQuantifierElimination was eliminating quantifiers from formula with 0 quantifier alternations, while SimplifyDDAWithTimeout was simplifying term of DAG size 1898. - TimeoutResultAtElement [Line: 1005]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 1005). Cancelled while BasicCegarLoop was analyzing trace of length 65 with TraceHistMax 3, while TraceCheckSpWp was constructing forward predicates, while PartialQuantifierElimination was eliminating quantifiers from formula with 0 quantifier alternations, while SimplifyDDAWithTimeout was simplifying term of DAG size 1898. - TimeoutResultAtElement [Line: 1013]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 1013). Cancelled while BasicCegarLoop was analyzing trace of length 65 with TraceHistMax 3, while TraceCheckSpWp was constructing forward predicates, while PartialQuantifierElimination was eliminating quantifiers from formula with 0 quantifier alternations, while SimplifyDDAWithTimeout was simplifying term of DAG size 1898. - TimeoutResultAtElement [Line: 1025]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 1025). Cancelled while BasicCegarLoop was analyzing trace of length 65 with TraceHistMax 3, while TraceCheckSpWp was constructing forward predicates, while PartialQuantifierElimination was eliminating quantifiers from formula with 0 quantifier alternations, while SimplifyDDAWithTimeout was simplifying term of DAG size 1898. - TimeoutResultAtElement [Line: 1017]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 1017). Cancelled while BasicCegarLoop was analyzing trace of length 65 with TraceHistMax 3, while TraceCheckSpWp was constructing forward predicates, while PartialQuantifierElimination was eliminating quantifiers from formula with 0 quantifier alternations, while SimplifyDDAWithTimeout was simplifying term of DAG size 1898. - TimeoutResultAtElement [Line: 994]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 994). Cancelled while BasicCegarLoop was analyzing trace of length 65 with TraceHistMax 3, while TraceCheckSpWp was constructing forward predicates, while PartialQuantifierElimination was eliminating quantifiers from formula with 0 quantifier alternations, while SimplifyDDAWithTimeout was simplifying term of DAG size 1898. - TimeoutResultAtElement [Line: 1055]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 1055). Cancelled while BasicCegarLoop was analyzing trace of length 65 with TraceHistMax 3, while TraceCheckSpWp was constructing forward predicates, while PartialQuantifierElimination was eliminating quantifiers from formula with 0 quantifier alternations, while SimplifyDDAWithTimeout was simplifying term of DAG size 1898. - TimeoutResultAtElement [Line: 999]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 999). Cancelled while BasicCegarLoop was analyzing trace of length 65 with TraceHistMax 3, while TraceCheckSpWp was constructing forward predicates, while PartialQuantifierElimination was eliminating quantifiers from formula with 0 quantifier alternations, while SimplifyDDAWithTimeout was simplifying term of DAG size 1898. - TimeoutResultAtElement [Line: 1049]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 1049). Cancelled while BasicCegarLoop was analyzing trace of length 65 with TraceHistMax 3, while TraceCheckSpWp was constructing forward predicates, while PartialQuantifierElimination was eliminating quantifiers from formula with 0 quantifier alternations, while SimplifyDDAWithTimeout was simplifying term of DAG size 1898. - TimeoutResultAtElement [Line: 998]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 998). Cancelled while BasicCegarLoop was analyzing trace of length 65 with TraceHistMax 3, while TraceCheckSpWp was constructing forward predicates, while PartialQuantifierElimination was eliminating quantifiers from formula with 0 quantifier alternations, while SimplifyDDAWithTimeout was simplifying term of DAG size 1898. - TimeoutResultAtElement [Line: 1006]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 1006). Cancelled while BasicCegarLoop was analyzing trace of length 65 with TraceHistMax 3, while TraceCheckSpWp was constructing forward predicates, while PartialQuantifierElimination was eliminating quantifiers from formula with 0 quantifier alternations, while SimplifyDDAWithTimeout was simplifying term of DAG size 1898. - TimeoutResultAtElement [Line: 999]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 999). Cancelled while BasicCegarLoop was analyzing trace of length 65 with TraceHistMax 3, while TraceCheckSpWp was constructing forward predicates, while PartialQuantifierElimination was eliminating quantifiers from formula with 0 quantifier alternations, while SimplifyDDAWithTimeout was simplifying term of DAG size 1898. - TimeoutResultAtElement [Line: 1026]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 1026). Cancelled while BasicCegarLoop was analyzing trace of length 65 with TraceHistMax 3, while TraceCheckSpWp was constructing forward predicates, while PartialQuantifierElimination was eliminating quantifiers from formula with 0 quantifier alternations, while SimplifyDDAWithTimeout was simplifying term of DAG size 1898. - TimeoutResultAtElement [Line: 1036]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 1036). Cancelled while BasicCegarLoop was analyzing trace of length 65 with TraceHistMax 3, while TraceCheckSpWp was constructing forward predicates, while PartialQuantifierElimination was eliminating quantifiers from formula with 0 quantifier alternations, while SimplifyDDAWithTimeout was simplifying term of DAG size 1898. - TimeoutResultAtElement [Line: 1003]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 1003). Cancelled while BasicCegarLoop was analyzing trace of length 65 with TraceHistMax 3, while TraceCheckSpWp was constructing forward predicates, while PartialQuantifierElimination was eliminating quantifiers from formula with 0 quantifier alternations, while SimplifyDDAWithTimeout was simplifying term of DAG size 1898. - TimeoutResultAtElement [Line: 1033]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 1033). Cancelled while BasicCegarLoop was analyzing trace of length 65 with TraceHistMax 3, while TraceCheckSpWp was constructing forward predicates, while PartialQuantifierElimination was eliminating quantifiers from formula with 0 quantifier alternations, while SimplifyDDAWithTimeout was simplifying term of DAG size 1898. - StatisticsResult: Ultimate Automizer benchmark data CFG has 3 procedures, 160 locations, 65 error locations. TIMEOUT Result, 200.8s OverallTime, 28 OverallIterations, 4 TraceHistogramMax, 163.7s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 2600 SDtfs, 25933 SDslu, 24937 SDs, 0 SdLazy, 30727 SolverSat, 3572 SolverUnsat, 5 SolverUnknown, 0 SolverNotchecked, 20.8s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 1588 GetRequests, 470 SyntacticMatches, 31 SemanticMatches, 1087 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 21266 ImplicationChecksByTransitivity, 154.9s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=680occurred in iteration=27, 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, 27 MinimizatonAttempts, 2635 StatesRemovedByMinimization, 27 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.5s SatisfiabilityAnalysisTime, 25.4s InterpolantComputationTime, 1718 NumberOfCodeBlocks, 1718 NumberOfCodeBlocksAsserted, 41 NumberOfCheckSat, 1679 ConstructedInterpolants, 356 QuantifiedInterpolants, 4336695 SizeOfPredicates, 213 NumberOfNonLiveVariables, 2768 ConjunctsInSsa, 644 ConjunctsInUnsatCore, 39 InterpolantComputations, 16 PerfectInterpolantSequences, 72/234 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/sll-buckets_true-unreach-call_true-valid-memsafety.i_svcomp-DerefFreeMemtrack-32bit-Automizer_Camel.epf_AutomizerC.xml/Csv-Benchmark-0-2018-04-10_14-19-44-319.csv Written .csv to /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/sll-buckets_true-unreach-call_true-valid-memsafety.i_svcomp-DerefFreeMemtrack-32bit-Automizer_Camel.epf_AutomizerC.xml/Csv-TraceAbstractionBenchmarks-0-2018-04-10_14-19-44-319.csv Completed graceful shutdown