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-reverse_simple_true-unreach-call_true-valid-memsafety.i -------------------------------------------------------------------------------- This is Ultimate 0.1.23-666feb3-m [2018-04-10 14:25:59,457 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-04-10 14:25:59,458 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-04-10 14:25:59,472 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-04-10 14:25:59,472 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-04-10 14:25:59,473 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-04-10 14:25:59,474 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-04-10 14:25:59,476 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-04-10 14:25:59,477 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-04-10 14:25:59,478 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-04-10 14:25:59,479 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-04-10 14:25:59,479 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-04-10 14:25:59,480 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-04-10 14:25:59,481 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-04-10 14:25:59,481 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-04-10 14:25:59,483 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-04-10 14:25:59,485 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-04-10 14:25:59,486 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-04-10 14:25:59,487 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-04-10 14:25:59,488 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-04-10 14:25:59,489 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-04-10 14:25:59,490 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-04-10 14:25:59,490 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-04-10 14:25:59,491 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-04-10 14:25:59,491 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-04-10 14:25:59,492 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-04-10 14:25:59,492 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-04-10 14:25:59,493 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-04-10 14:25:59,493 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-04-10 14:25:59,494 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-04-10 14:25:59,494 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-04-10 14:25:59,494 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:25:59,506 INFO L110 SettingsManager]: Loading preferences was successful [2018-04-10 14:25:59,506 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-04-10 14:25:59,507 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-04-10 14:25:59,507 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-04-10 14:25:59,507 INFO L133 SettingsManager]: * Use SBE=true [2018-04-10 14:25:59,507 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-04-10 14:25:59,508 INFO L133 SettingsManager]: * sizeof long=4 [2018-04-10 14:25:59,508 INFO L133 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2018-04-10 14:25:59,508 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-04-10 14:25:59,508 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-04-10 14:25:59,508 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-04-10 14:25:59,508 INFO L133 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2018-04-10 14:25:59,508 INFO L133 SettingsManager]: * Bitprecise bitfields=true [2018-04-10 14:25:59,509 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-04-10 14:25:59,509 INFO L133 SettingsManager]: * sizeof long double=12 [2018-04-10 14:25:59,509 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-04-10 14:25:59,509 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-04-10 14:25:59,509 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-04-10 14:25:59,509 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-04-10 14:25:59,509 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-04-10 14:25:59,510 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-04-10 14:25:59,510 INFO L133 SettingsManager]: * Interpolant automaton=TWOTRACK [2018-04-10 14:25:59,510 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-04-10 14:25:59,510 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2018-04-10 14:25:59,538 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-04-10 14:25:59,547 INFO L266 ainManager$Toolchain]: [Toolchain 1]: Parser(s) successfully (re)initialized [2018-04-10 14:25:59,550 INFO L222 ainManager$Toolchain]: [Toolchain 1]: Toolchain data selected. [2018-04-10 14:25:59,551 INFO L271 PluginConnector]: Initializing CDTParser... [2018-04-10 14:25:59,552 INFO L276 PluginConnector]: CDTParser initialized [2018-04-10 14:25:59,552 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/forester-heap/sll-reverse_simple_true-unreach-call_true-valid-memsafety.i [2018-04-10 14:25:59,866 INFO L225 CDTParser]: Created temporary CDT project at /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/data/FLAGf25595e84 [2018-04-10 14:25:59,989 INFO L287 CDTParser]: IsIndexed: true [2018-04-10 14:25:59,990 INFO L288 CDTParser]: Found 1 translation units. [2018-04-10 14:25:59,990 INFO L168 CDTParser]: Scanning sll-reverse_simple_true-unreach-call_true-valid-memsafety.i [2018-04-10 14:25:59,998 INFO L210 ultiparseSymbolTable]: Include resolver: [2018-04-10 14:25:59,998 INFO L215 ultiparseSymbolTable]: [2018-04-10 14:25:59,998 INFO L218 ultiparseSymbolTable]: Function table: [2018-04-10 14:25:59,998 INFO L221 ultiparseSymbolTable]: Function definition of null ('main') in sll-reverse_simple_true-unreach-call_true-valid-memsafety.i [2018-04-10 14:25:59,998 INFO L227 ultiparseSymbolTable]: Global variable table: [2018-04-10 14:25:59,998 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fsll_reverse_simple_true_unreach_call_true_valid_memsafety_i____uint8_t in sll-reverse_simple_true-unreach-call_true-valid-memsafety.i [2018-04-10 14:25:59,999 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fsll_reverse_simple_true_unreach_call_true_valid_memsafety_i____key_t in sll-reverse_simple_true-unreach-call_true-valid-memsafety.i [2018-04-10 14:25:59,999 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fsll_reverse_simple_true_unreach_call_true_valid_memsafety_i__SLL in sll-reverse_simple_true-unreach-call_true-valid-memsafety.i [2018-04-10 14:25:59,999 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fsll_reverse_simple_true_unreach_call_true_valid_memsafety_i____clockid_t in sll-reverse_simple_true-unreach-call_true-valid-memsafety.i [2018-04-10 14:25:59,999 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fsll_reverse_simple_true_unreach_call_true_valid_memsafety_i__clockid_t in sll-reverse_simple_true-unreach-call_true-valid-memsafety.i [2018-04-10 14:25:59,999 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fsll_reverse_simple_true_unreach_call_true_valid_memsafety_i__pthread_spinlock_t in sll-reverse_simple_true-unreach-call_true-valid-memsafety.i [2018-04-10 14:25:59,999 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fsll_reverse_simple_true_unreach_call_true_valid_memsafety_i____u_int in sll-reverse_simple_true-unreach-call_true-valid-memsafety.i [2018-04-10 14:25:59,999 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fsll_reverse_simple_true_unreach_call_true_valid_memsafety_i____daddr_t in sll-reverse_simple_true-unreach-call_true-valid-memsafety.i [2018-04-10 14:25:59,999 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fsll_reverse_simple_true_unreach_call_true_valid_memsafety_i____blkcnt_t in sll-reverse_simple_true-unreach-call_true-valid-memsafety.i [2018-04-10 14:25:59,999 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fsll_reverse_simple_true_unreach_call_true_valid_memsafety_i__int64_t in sll-reverse_simple_true-unreach-call_true-valid-memsafety.i [2018-04-10 14:26:00,000 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fsll_reverse_simple_true_unreach_call_true_valid_memsafety_i__pthread_cond_t in sll-reverse_simple_true-unreach-call_true-valid-memsafety.i [2018-04-10 14:26:00,000 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fsll_reverse_simple_true_unreach_call_true_valid_memsafety_i__fsid_t in sll-reverse_simple_true-unreach-call_true-valid-memsafety.i [2018-04-10 14:26:00,000 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fsll_reverse_simple_true_unreach_call_true_valid_memsafety_i__id_t in sll-reverse_simple_true-unreach-call_true-valid-memsafety.i [2018-04-10 14:26:00,000 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fsll_reverse_simple_true_unreach_call_true_valid_memsafety_i__quad_t in sll-reverse_simple_true-unreach-call_true-valid-memsafety.i [2018-04-10 14:26:00,000 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fsll_reverse_simple_true_unreach_call_true_valid_memsafety_i____fd_mask in sll-reverse_simple_true-unreach-call_true-valid-memsafety.i [2018-04-10 14:26:00,000 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fsll_reverse_simple_true_unreach_call_true_valid_memsafety_i____loff_t in sll-reverse_simple_true-unreach-call_true-valid-memsafety.i [2018-04-10 14:26:00,000 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fsll_reverse_simple_true_unreach_call_true_valid_memsafety_i__u_int8_t in sll-reverse_simple_true-unreach-call_true-valid-memsafety.i [2018-04-10 14:26:00,000 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fsll_reverse_simple_true_unreach_call_true_valid_memsafety_i__dev_t in sll-reverse_simple_true-unreach-call_true-valid-memsafety.i [2018-04-10 14:26:00,000 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fsll_reverse_simple_true_unreach_call_true_valid_memsafety_i__u_int16_t in sll-reverse_simple_true-unreach-call_true-valid-memsafety.i [2018-04-10 14:26:00,001 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fsll_reverse_simple_true_unreach_call_true_valid_memsafety_i__pthread_condattr_t in sll-reverse_simple_true-unreach-call_true-valid-memsafety.i [2018-04-10 14:26:00,001 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fsll_reverse_simple_true_unreach_call_true_valid_memsafety_i__pthread_t in sll-reverse_simple_true-unreach-call_true-valid-memsafety.i [2018-04-10 14:26:00,001 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fsll_reverse_simple_true_unreach_call_true_valid_memsafety_i____clock_t in sll-reverse_simple_true-unreach-call_true-valid-memsafety.i [2018-04-10 14:26:00,001 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fsll_reverse_simple_true_unreach_call_true_valid_memsafety_i____u_quad_t in sll-reverse_simple_true-unreach-call_true-valid-memsafety.i [2018-04-10 14:26:00,001 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fsll_reverse_simple_true_unreach_call_true_valid_memsafety_i__pthread_barrier_t in sll-reverse_simple_true-unreach-call_true-valid-memsafety.i [2018-04-10 14:26:00,001 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fsll_reverse_simple_true_unreach_call_true_valid_memsafety_i__pthread_attr_t in sll-reverse_simple_true-unreach-call_true-valid-memsafety.i [2018-04-10 14:26:00,001 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fsll_reverse_simple_true_unreach_call_true_valid_memsafety_i____gid_t in sll-reverse_simple_true-unreach-call_true-valid-memsafety.i [2018-04-10 14:26:00,001 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fsll_reverse_simple_true_unreach_call_true_valid_memsafety_i____pid_t in sll-reverse_simple_true-unreach-call_true-valid-memsafety.i [2018-04-10 14:26:00,001 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fsll_reverse_simple_true_unreach_call_true_valid_memsafety_i____syscall_slong_t in sll-reverse_simple_true-unreach-call_true-valid-memsafety.i [2018-04-10 14:26:00,001 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fsll_reverse_simple_true_unreach_call_true_valid_memsafety_i____fsblkcnt64_t in sll-reverse_simple_true-unreach-call_true-valid-memsafety.i [2018-04-10 14:26:00,001 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fsll_reverse_simple_true_unreach_call_true_valid_memsafety_i__loff_t in sll-reverse_simple_true-unreach-call_true-valid-memsafety.i [2018-04-10 14:26:00,001 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fsll_reverse_simple_true_unreach_call_true_valid_memsafety_i____quad_t in sll-reverse_simple_true-unreach-call_true-valid-memsafety.i [2018-04-10 14:26:00,001 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fsll_reverse_simple_true_unreach_call_true_valid_memsafety_i__wchar_t in sll-reverse_simple_true-unreach-call_true-valid-memsafety.i [2018-04-10 14:26:00,002 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fsll_reverse_simple_true_unreach_call_true_valid_memsafety_i____useconds_t in sll-reverse_simple_true-unreach-call_true-valid-memsafety.i [2018-04-10 14:26:00,002 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fsll_reverse_simple_true_unreach_call_true_valid_memsafety_i__ushort in sll-reverse_simple_true-unreach-call_true-valid-memsafety.i [2018-04-10 14:26:00,002 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fsll_reverse_simple_true_unreach_call_true_valid_memsafety_i____int64_t in sll-reverse_simple_true-unreach-call_true-valid-memsafety.i [2018-04-10 14:26:00,002 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fsll_reverse_simple_true_unreach_call_true_valid_memsafety_i____nlink_t in sll-reverse_simple_true-unreach-call_true-valid-memsafety.i [2018-04-10 14:26:00,002 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fsll_reverse_simple_true_unreach_call_true_valid_memsafety_i__timer_t in sll-reverse_simple_true-unreach-call_true-valid-memsafety.i [2018-04-10 14:26:00,002 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fsll_reverse_simple_true_unreach_call_true_valid_memsafety_i__register_t in sll-reverse_simple_true-unreach-call_true-valid-memsafety.i [2018-04-10 14:26:00,002 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fsll_reverse_simple_true_unreach_call_true_valid_memsafety_i__sigset_t in sll-reverse_simple_true-unreach-call_true-valid-memsafety.i [2018-04-10 14:26:00,002 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fsll_reverse_simple_true_unreach_call_true_valid_memsafety_i__pthread_barrierattr_t in sll-reverse_simple_true-unreach-call_true-valid-memsafety.i [2018-04-10 14:26:00,002 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fsll_reverse_simple_true_unreach_call_true_valid_memsafety_i__u_int32_t in sll-reverse_simple_true-unreach-call_true-valid-memsafety.i [2018-04-10 14:26:00,003 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fsll_reverse_simple_true_unreach_call_true_valid_memsafety_i____sig_atomic_t in sll-reverse_simple_true-unreach-call_true-valid-memsafety.i [2018-04-10 14:26:00,003 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fsll_reverse_simple_true_unreach_call_true_valid_memsafety_i____uid_t in sll-reverse_simple_true-unreach-call_true-valid-memsafety.i [2018-04-10 14:26:00,003 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fsll_reverse_simple_true_unreach_call_true_valid_memsafety_i____ino64_t in sll-reverse_simple_true-unreach-call_true-valid-memsafety.i [2018-04-10 14:26:00,003 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fsll_reverse_simple_true_unreach_call_true_valid_memsafety_i__idtype_t in sll-reverse_simple_true-unreach-call_true-valid-memsafety.i [2018-04-10 14:26:00,003 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fsll_reverse_simple_true_unreach_call_true_valid_memsafety_i__key_t in sll-reverse_simple_true-unreach-call_true-valid-memsafety.i [2018-04-10 14:26:00,003 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fsll_reverse_simple_true_unreach_call_true_valid_memsafety_i____ssize_t in sll-reverse_simple_true-unreach-call_true-valid-memsafety.i [2018-04-10 14:26:00,003 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fsll_reverse_simple_true_unreach_call_true_valid_memsafety_i__uint in sll-reverse_simple_true-unreach-call_true-valid-memsafety.i [2018-04-10 14:26:00,003 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fsll_reverse_simple_true_unreach_call_true_valid_memsafety_i__int32_t in sll-reverse_simple_true-unreach-call_true-valid-memsafety.i [2018-04-10 14:26:00,003 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fsll_reverse_simple_true_unreach_call_true_valid_memsafety_i__nlink_t in sll-reverse_simple_true-unreach-call_true-valid-memsafety.i [2018-04-10 14:26:00,003 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fsll_reverse_simple_true_unreach_call_true_valid_memsafety_i____blkcnt64_t in sll-reverse_simple_true-unreach-call_true-valid-memsafety.i [2018-04-10 14:26:00,003 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fsll_reverse_simple_true_unreach_call_true_valid_memsafety_i____off_t in sll-reverse_simple_true-unreach-call_true-valid-memsafety.i [2018-04-10 14:26:00,004 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fsll_reverse_simple_true_unreach_call_true_valid_memsafety_i__pthread_rwlockattr_t in sll-reverse_simple_true-unreach-call_true-valid-memsafety.i [2018-04-10 14:26:00,004 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fsll_reverse_simple_true_unreach_call_true_valid_memsafety_i____uint64_t in sll-reverse_simple_true-unreach-call_true-valid-memsafety.i [2018-04-10 14:26:00,004 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fsll_reverse_simple_true_unreach_call_true_valid_memsafety_i__ssize_t in sll-reverse_simple_true-unreach-call_true-valid-memsafety.i [2018-04-10 14:26:00,004 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fsll_reverse_simple_true_unreach_call_true_valid_memsafety_i__fd_mask in sll-reverse_simple_true-unreach-call_true-valid-memsafety.i [2018-04-10 14:26:00,004 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fsll_reverse_simple_true_unreach_call_true_valid_memsafety_i__fsfilcnt_t in sll-reverse_simple_true-unreach-call_true-valid-memsafety.i [2018-04-10 14:26:00,004 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fsll_reverse_simple_true_unreach_call_true_valid_memsafety_i____fsword_t in sll-reverse_simple_true-unreach-call_true-valid-memsafety.i [2018-04-10 14:26:00,004 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fsll_reverse_simple_true_unreach_call_true_valid_memsafety_i____suseconds_t in sll-reverse_simple_true-unreach-call_true-valid-memsafety.i [2018-04-10 14:26:00,004 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fsll_reverse_simple_true_unreach_call_true_valid_memsafety_i__div_t in sll-reverse_simple_true-unreach-call_true-valid-memsafety.i [2018-04-10 14:26:00,004 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fsll_reverse_simple_true_unreach_call_true_valid_memsafety_i__fsblkcnt_t in sll-reverse_simple_true-unreach-call_true-valid-memsafety.i [2018-04-10 14:26:00,004 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fsll_reverse_simple_true_unreach_call_true_valid_memsafety_i__time_t in sll-reverse_simple_true-unreach-call_true-valid-memsafety.i [2018-04-10 14:26:00,004 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fsll_reverse_simple_true_unreach_call_true_valid_memsafety_i____pthread_slist_t in sll-reverse_simple_true-unreach-call_true-valid-memsafety.i [2018-04-10 14:26:00,005 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fsll_reverse_simple_true_unreach_call_true_valid_memsafety_i____rlim64_t in sll-reverse_simple_true-unreach-call_true-valid-memsafety.i [2018-04-10 14:26:00,005 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fsll_reverse_simple_true_unreach_call_true_valid_memsafety_i__mode_t in sll-reverse_simple_true-unreach-call_true-valid-memsafety.i [2018-04-10 14:26:00,005 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fsll_reverse_simple_true_unreach_call_true_valid_memsafety_i__caddr_t in sll-reverse_simple_true-unreach-call_true-valid-memsafety.i [2018-04-10 14:26:00,005 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fsll_reverse_simple_true_unreach_call_true_valid_memsafety_i__uid_t in sll-reverse_simple_true-unreach-call_true-valid-memsafety.i [2018-04-10 14:26:00,005 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fsll_reverse_simple_true_unreach_call_true_valid_memsafety_i__u_int in sll-reverse_simple_true-unreach-call_true-valid-memsafety.i [2018-04-10 14:26:00,005 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fsll_reverse_simple_true_unreach_call_true_valid_memsafety_i____uint32_t in sll-reverse_simple_true-unreach-call_true-valid-memsafety.i [2018-04-10 14:26:00,005 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fsll_reverse_simple_true_unreach_call_true_valid_memsafety_i__pthread_rwlock_t in sll-reverse_simple_true-unreach-call_true-valid-memsafety.i [2018-04-10 14:26:00,005 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fsll_reverse_simple_true_unreach_call_true_valid_memsafety_i__size_t in sll-reverse_simple_true-unreach-call_true-valid-memsafety.i [2018-04-10 14:26:00,005 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fsll_reverse_simple_true_unreach_call_true_valid_memsafety_i____int32_t in sll-reverse_simple_true-unreach-call_true-valid-memsafety.i [2018-04-10 14:26:00,006 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fsll_reverse_simple_true_unreach_call_true_valid_memsafety_i____id_t in sll-reverse_simple_true-unreach-call_true-valid-memsafety.i [2018-04-10 14:26:00,006 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fsll_reverse_simple_true_unreach_call_true_valid_memsafety_i____syscall_ulong_t in sll-reverse_simple_true-unreach-call_true-valid-memsafety.i [2018-04-10 14:26:00,006 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fsll_reverse_simple_true_unreach_call_true_valid_memsafety_i____off64_t in sll-reverse_simple_true-unreach-call_true-valid-memsafety.i [2018-04-10 14:26:00,006 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fsll_reverse_simple_true_unreach_call_true_valid_memsafety_i____u_char in sll-reverse_simple_true-unreach-call_true-valid-memsafety.i [2018-04-10 14:26:00,006 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fsll_reverse_simple_true_unreach_call_true_valid_memsafety_i____timer_t in sll-reverse_simple_true-unreach-call_true-valid-memsafety.i [2018-04-10 14:26:00,006 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fsll_reverse_simple_true_unreach_call_true_valid_memsafety_i____blksize_t in sll-reverse_simple_true-unreach-call_true-valid-memsafety.i [2018-04-10 14:26:00,006 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fsll_reverse_simple_true_unreach_call_true_valid_memsafety_i____time_t in sll-reverse_simple_true-unreach-call_true-valid-memsafety.i [2018-04-10 14:26:00,006 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fsll_reverse_simple_true_unreach_call_true_valid_memsafety_i__int8_t in sll-reverse_simple_true-unreach-call_true-valid-memsafety.i [2018-04-10 14:26:00,006 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fsll_reverse_simple_true_unreach_call_true_valid_memsafety_i__pthread_key_t in sll-reverse_simple_true-unreach-call_true-valid-memsafety.i [2018-04-10 14:26:00,006 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fsll_reverse_simple_true_unreach_call_true_valid_memsafety_i____qaddr_t in sll-reverse_simple_true-unreach-call_true-valid-memsafety.i [2018-04-10 14:26:00,006 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fsll_reverse_simple_true_unreach_call_true_valid_memsafety_i__int16_t in sll-reverse_simple_true-unreach-call_true-valid-memsafety.i [2018-04-10 14:26:00,007 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fsll_reverse_simple_true_unreach_call_true_valid_memsafety_i__lldiv_t in sll-reverse_simple_true-unreach-call_true-valid-memsafety.i [2018-04-10 14:26:00,007 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fsll_reverse_simple_true_unreach_call_true_valid_memsafety_i____fsfilcnt_t in sll-reverse_simple_true-unreach-call_true-valid-memsafety.i [2018-04-10 14:26:00,007 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fsll_reverse_simple_true_unreach_call_true_valid_memsafety_i__pthread_mutexattr_t in sll-reverse_simple_true-unreach-call_true-valid-memsafety.i [2018-04-10 14:26:00,007 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fsll_reverse_simple_true_unreach_call_true_valid_memsafety_i____fsblkcnt_t in sll-reverse_simple_true-unreach-call_true-valid-memsafety.i [2018-04-10 14:26:00,007 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fsll_reverse_simple_true_unreach_call_true_valid_memsafety_i____socklen_t in sll-reverse_simple_true-unreach-call_true-valid-memsafety.i [2018-04-10 14:26:00,007 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fsll_reverse_simple_true_unreach_call_true_valid_memsafety_i__ino_t in sll-reverse_simple_true-unreach-call_true-valid-memsafety.i [2018-04-10 14:26:00,007 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fsll_reverse_simple_true_unreach_call_true_valid_memsafety_i____rlim_t in sll-reverse_simple_true-unreach-call_true-valid-memsafety.i [2018-04-10 14:26:00,007 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fsll_reverse_simple_true_unreach_call_true_valid_memsafety_i__pthread_mutex_t in sll-reverse_simple_true-unreach-call_true-valid-memsafety.i [2018-04-10 14:26:00,007 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fsll_reverse_simple_true_unreach_call_true_valid_memsafety_i__u_int64_t in sll-reverse_simple_true-unreach-call_true-valid-memsafety.i [2018-04-10 14:26:00,007 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fsll_reverse_simple_true_unreach_call_true_valid_memsafety_i____fsfilcnt64_t in sll-reverse_simple_true-unreach-call_true-valid-memsafety.i [2018-04-10 14:26:00,007 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fsll_reverse_simple_true_unreach_call_true_valid_memsafety_i__ldiv_t in sll-reverse_simple_true-unreach-call_true-valid-memsafety.i [2018-04-10 14:26:00,007 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fsll_reverse_simple_true_unreach_call_true_valid_memsafety_i__u_quad_t in sll-reverse_simple_true-unreach-call_true-valid-memsafety.i [2018-04-10 14:26:00,007 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fsll_reverse_simple_true_unreach_call_true_valid_memsafety_i____u_long in sll-reverse_simple_true-unreach-call_true-valid-memsafety.i [2018-04-10 14:26:00,007 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fsll_reverse_simple_true_unreach_call_true_valid_memsafety_i____int16_t in sll-reverse_simple_true-unreach-call_true-valid-memsafety.i [2018-04-10 14:26:00,007 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fsll_reverse_simple_true_unreach_call_true_valid_memsafety_i__u_char in sll-reverse_simple_true-unreach-call_true-valid-memsafety.i [2018-04-10 14:26:00,007 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fsll_reverse_simple_true_unreach_call_true_valid_memsafety_i__off_t in sll-reverse_simple_true-unreach-call_true-valid-memsafety.i [2018-04-10 14:26:00,007 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fsll_reverse_simple_true_unreach_call_true_valid_memsafety_i__u_short in sll-reverse_simple_true-unreach-call_true-valid-memsafety.i [2018-04-10 14:26:00,007 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fsll_reverse_simple_true_unreach_call_true_valid_memsafety_i____int8_t in sll-reverse_simple_true-unreach-call_true-valid-memsafety.i [2018-04-10 14:26:00,008 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fsll_reverse_simple_true_unreach_call_true_valid_memsafety_i__daddr_t in sll-reverse_simple_true-unreach-call_true-valid-memsafety.i [2018-04-10 14:26:00,008 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fsll_reverse_simple_true_unreach_call_true_valid_memsafety_i____uint16_t in sll-reverse_simple_true-unreach-call_true-valid-memsafety.i [2018-04-10 14:26:00,008 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fsll_reverse_simple_true_unreach_call_true_valid_memsafety_i__blkcnt_t in sll-reverse_simple_true-unreach-call_true-valid-memsafety.i [2018-04-10 14:26:00,008 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fsll_reverse_simple_true_unreach_call_true_valid_memsafety_i__pthread_once_t in sll-reverse_simple_true-unreach-call_true-valid-memsafety.i [2018-04-10 14:26:00,008 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fsll_reverse_simple_true_unreach_call_true_valid_memsafety_i____intptr_t in sll-reverse_simple_true-unreach-call_true-valid-memsafety.i [2018-04-10 14:26:00,008 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fsll_reverse_simple_true_unreach_call_true_valid_memsafety_i____caddr_t in sll-reverse_simple_true-unreach-call_true-valid-memsafety.i [2018-04-10 14:26:00,008 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fsll_reverse_simple_true_unreach_call_true_valid_memsafety_i__u_long in sll-reverse_simple_true-unreach-call_true-valid-memsafety.i [2018-04-10 14:26:00,008 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fsll_reverse_simple_true_unreach_call_true_valid_memsafety_i__blksize_t in sll-reverse_simple_true-unreach-call_true-valid-memsafety.i [2018-04-10 14:26:00,008 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fsll_reverse_simple_true_unreach_call_true_valid_memsafety_i____mode_t in sll-reverse_simple_true-unreach-call_true-valid-memsafety.i [2018-04-10 14:26:00,008 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fsll_reverse_simple_true_unreach_call_true_valid_memsafety_i__suseconds_t in sll-reverse_simple_true-unreach-call_true-valid-memsafety.i [2018-04-10 14:26:00,008 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fsll_reverse_simple_true_unreach_call_true_valid_memsafety_i____dev_t in sll-reverse_simple_true-unreach-call_true-valid-memsafety.i [2018-04-10 14:26:00,008 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fsll_reverse_simple_true_unreach_call_true_valid_memsafety_i____ino_t in sll-reverse_simple_true-unreach-call_true-valid-memsafety.i [2018-04-10 14:26:00,008 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fsll_reverse_simple_true_unreach_call_true_valid_memsafety_i__pid_t in sll-reverse_simple_true-unreach-call_true-valid-memsafety.i [2018-04-10 14:26:00,008 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fsll_reverse_simple_true_unreach_call_true_valid_memsafety_i__clock_t in sll-reverse_simple_true-unreach-call_true-valid-memsafety.i [2018-04-10 14:26:00,008 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fsll_reverse_simple_true_unreach_call_true_valid_memsafety_i____sigset_t in sll-reverse_simple_true-unreach-call_true-valid-memsafety.i [2018-04-10 14:26:00,008 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fsll_reverse_simple_true_unreach_call_true_valid_memsafety_i__fd_set in sll-reverse_simple_true-unreach-call_true-valid-memsafety.i [2018-04-10 14:26:00,008 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fsll_reverse_simple_true_unreach_call_true_valid_memsafety_i____u_short in sll-reverse_simple_true-unreach-call_true-valid-memsafety.i [2018-04-10 14:26:00,008 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fsll_reverse_simple_true_unreach_call_true_valid_memsafety_i____fsid_t in sll-reverse_simple_true-unreach-call_true-valid-memsafety.i [2018-04-10 14:26:00,008 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fsll_reverse_simple_true_unreach_call_true_valid_memsafety_i__ulong in sll-reverse_simple_true-unreach-call_true-valid-memsafety.i [2018-04-10 14:26:00,008 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fsll_reverse_simple_true_unreach_call_true_valid_memsafety_i__gid_t in sll-reverse_simple_true-unreach-call_true-valid-memsafety.i [2018-04-10 14:26:00,045 INFO L330 CDTParser]: Deleted temporary CDT project at /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/data/FLAGf25595e84 [2018-04-10 14:26:00,050 INFO L304 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-04-10 14:26:00,052 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2018-04-10 14:26:00,052 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-04-10 14:26:00,052 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-04-10 14:26:00,056 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-04-10 14:26:00,057 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.04 02:26:00" (1/1) ... [2018-04-10 14:26:00,059 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@44060268 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.04 02:26:00, skipping insertion in model container [2018-04-10 14:26:00,059 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.04 02:26:00" (1/1) ... [2018-04-10 14:26:00,069 INFO L167 Dispatcher]: Using SV-COMP mode [2018-04-10 14:26:00,097 INFO L167 Dispatcher]: Using SV-COMP mode [2018-04-10 14:26:00,244 INFO L175 PostProcessor]: Settings: Checked method=main [2018-04-10 14:26:00,282 INFO L175 PostProcessor]: Settings: Checked method=main [2018-04-10 14:26:00,288 INFO L100 SccComputation]: Graph consists of 0 InCaSumBalls and 115 non ball SCCs. Number of states in SCCs 115. [2018-04-10 14:26:00,326 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.04 02:26:00 WrapperNode [2018-04-10 14:26:00,327 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-04-10 14:26:00,327 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-04-10 14:26:00,327 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-04-10 14:26:00,328 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-04-10 14:26:00,340 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.04 02:26:00" (1/1) ... [2018-04-10 14:26:00,340 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.04 02:26:00" (1/1) ... [2018-04-10 14:26:00,353 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.04 02:26:00" (1/1) ... [2018-04-10 14:26:00,354 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.04 02:26:00" (1/1) ... [2018-04-10 14:26:00,363 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.04 02:26:00" (1/1) ... [2018-04-10 14:26:00,368 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.04 02:26:00" (1/1) ... [2018-04-10 14:26:00,370 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.04 02:26:00" (1/1) ... [2018-04-10 14:26:00,372 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-04-10 14:26:00,373 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-04-10 14:26:00,373 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-04-10 14:26:00,373 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-04-10 14:26:00,373 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.04 02:26:00" (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:26:00,462 INFO L136 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-04-10 14:26:00,462 INFO L136 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-04-10 14:26:00,462 INFO L136 BoogieDeclarations]: Found implementation of procedure main [2018-04-10 14:26:00,462 INFO L128 BoogieDeclarations]: Found specification of procedure __ctype_get_mb_cur_max [2018-04-10 14:26:00,463 INFO L128 BoogieDeclarations]: Found specification of procedure atof [2018-04-10 14:26:00,463 INFO L128 BoogieDeclarations]: Found specification of procedure atoi [2018-04-10 14:26:00,463 INFO L128 BoogieDeclarations]: Found specification of procedure atol [2018-04-10 14:26:00,463 INFO L128 BoogieDeclarations]: Found specification of procedure atoll [2018-04-10 14:26:00,463 INFO L128 BoogieDeclarations]: Found specification of procedure strtod [2018-04-10 14:26:00,463 INFO L128 BoogieDeclarations]: Found specification of procedure strtof [2018-04-10 14:26:00,463 INFO L128 BoogieDeclarations]: Found specification of procedure strtold [2018-04-10 14:26:00,463 INFO L128 BoogieDeclarations]: Found specification of procedure strtol [2018-04-10 14:26:00,463 INFO L128 BoogieDeclarations]: Found specification of procedure strtoul [2018-04-10 14:26:00,463 INFO L128 BoogieDeclarations]: Found specification of procedure strtoq [2018-04-10 14:26:00,463 INFO L128 BoogieDeclarations]: Found specification of procedure strtouq [2018-04-10 14:26:00,463 INFO L128 BoogieDeclarations]: Found specification of procedure strtoll [2018-04-10 14:26:00,464 INFO L128 BoogieDeclarations]: Found specification of procedure strtoull [2018-04-10 14:26:00,464 INFO L128 BoogieDeclarations]: Found specification of procedure l64a [2018-04-10 14:26:00,464 INFO L128 BoogieDeclarations]: Found specification of procedure a64l [2018-04-10 14:26:00,464 INFO L128 BoogieDeclarations]: Found specification of procedure select [2018-04-10 14:26:00,464 INFO L128 BoogieDeclarations]: Found specification of procedure pselect [2018-04-10 14:26:00,464 INFO L128 BoogieDeclarations]: Found specification of procedure gnu_dev_major [2018-04-10 14:26:00,464 INFO L128 BoogieDeclarations]: Found specification of procedure gnu_dev_minor [2018-04-10 14:26:00,464 INFO L128 BoogieDeclarations]: Found specification of procedure gnu_dev_makedev [2018-04-10 14:26:00,464 INFO L128 BoogieDeclarations]: Found specification of procedure random [2018-04-10 14:26:00,465 INFO L128 BoogieDeclarations]: Found specification of procedure srandom [2018-04-10 14:26:00,465 INFO L128 BoogieDeclarations]: Found specification of procedure initstate [2018-04-10 14:26:00,465 INFO L128 BoogieDeclarations]: Found specification of procedure setstate [2018-04-10 14:26:00,465 INFO L128 BoogieDeclarations]: Found specification of procedure random_r [2018-04-10 14:26:00,465 INFO L128 BoogieDeclarations]: Found specification of procedure srandom_r [2018-04-10 14:26:00,465 INFO L128 BoogieDeclarations]: Found specification of procedure initstate_r [2018-04-10 14:26:00,465 INFO L128 BoogieDeclarations]: Found specification of procedure setstate_r [2018-04-10 14:26:00,465 INFO L128 BoogieDeclarations]: Found specification of procedure rand [2018-04-10 14:26:00,465 INFO L128 BoogieDeclarations]: Found specification of procedure srand [2018-04-10 14:26:00,466 INFO L128 BoogieDeclarations]: Found specification of procedure rand_r [2018-04-10 14:26:00,466 INFO L128 BoogieDeclarations]: Found specification of procedure drand48 [2018-04-10 14:26:00,466 INFO L128 BoogieDeclarations]: Found specification of procedure erand48 [2018-04-10 14:26:00,466 INFO L128 BoogieDeclarations]: Found specification of procedure lrand48 [2018-04-10 14:26:00,466 INFO L128 BoogieDeclarations]: Found specification of procedure nrand48 [2018-04-10 14:26:00,466 INFO L128 BoogieDeclarations]: Found specification of procedure mrand48 [2018-04-10 14:26:00,466 INFO L128 BoogieDeclarations]: Found specification of procedure jrand48 [2018-04-10 14:26:00,466 INFO L128 BoogieDeclarations]: Found specification of procedure srand48 [2018-04-10 14:26:00,466 INFO L128 BoogieDeclarations]: Found specification of procedure seed48 [2018-04-10 14:26:00,466 INFO L128 BoogieDeclarations]: Found specification of procedure lcong48 [2018-04-10 14:26:00,467 INFO L128 BoogieDeclarations]: Found specification of procedure drand48_r [2018-04-10 14:26:00,467 INFO L128 BoogieDeclarations]: Found specification of procedure erand48_r [2018-04-10 14:26:00,467 INFO L128 BoogieDeclarations]: Found specification of procedure lrand48_r [2018-04-10 14:26:00,467 INFO L128 BoogieDeclarations]: Found specification of procedure nrand48_r [2018-04-10 14:26:00,467 INFO L128 BoogieDeclarations]: Found specification of procedure mrand48_r [2018-04-10 14:26:00,467 INFO L128 BoogieDeclarations]: Found specification of procedure jrand48_r [2018-04-10 14:26:00,467 INFO L128 BoogieDeclarations]: Found specification of procedure srand48_r [2018-04-10 14:26:00,467 INFO L128 BoogieDeclarations]: Found specification of procedure seed48_r [2018-04-10 14:26:00,467 INFO L128 BoogieDeclarations]: Found specification of procedure lcong48_r [2018-04-10 14:26:00,467 INFO L128 BoogieDeclarations]: Found specification of procedure malloc [2018-04-10 14:26:00,468 INFO L128 BoogieDeclarations]: Found specification of procedure calloc [2018-04-10 14:26:00,468 INFO L128 BoogieDeclarations]: Found specification of procedure realloc [2018-04-10 14:26:00,468 INFO L128 BoogieDeclarations]: Found specification of procedure free [2018-04-10 14:26:00,468 INFO L128 BoogieDeclarations]: Found specification of procedure cfree [2018-04-10 14:26:00,468 INFO L128 BoogieDeclarations]: Found specification of procedure alloca [2018-04-10 14:26:00,468 INFO L128 BoogieDeclarations]: Found specification of procedure valloc [2018-04-10 14:26:00,468 INFO L128 BoogieDeclarations]: Found specification of procedure posix_memalign [2018-04-10 14:26:00,468 INFO L128 BoogieDeclarations]: Found specification of procedure aligned_alloc [2018-04-10 14:26:00,468 INFO L128 BoogieDeclarations]: Found specification of procedure abort [2018-04-10 14:26:00,469 INFO L128 BoogieDeclarations]: Found specification of procedure atexit [2018-04-10 14:26:00,469 INFO L128 BoogieDeclarations]: Found specification of procedure at_quick_exit [2018-04-10 14:26:00,469 INFO L128 BoogieDeclarations]: Found specification of procedure on_exit [2018-04-10 14:26:00,469 INFO L128 BoogieDeclarations]: Found specification of procedure exit [2018-04-10 14:26:00,469 INFO L128 BoogieDeclarations]: Found specification of procedure quick_exit [2018-04-10 14:26:00,469 INFO L128 BoogieDeclarations]: Found specification of procedure _Exit [2018-04-10 14:26:00,469 INFO L128 BoogieDeclarations]: Found specification of procedure getenv [2018-04-10 14:26:00,469 INFO L128 BoogieDeclarations]: Found specification of procedure putenv [2018-04-10 14:26:00,469 INFO L128 BoogieDeclarations]: Found specification of procedure setenv [2018-04-10 14:26:00,469 INFO L128 BoogieDeclarations]: Found specification of procedure unsetenv [2018-04-10 14:26:00,469 INFO L128 BoogieDeclarations]: Found specification of procedure clearenv [2018-04-10 14:26:00,470 INFO L128 BoogieDeclarations]: Found specification of procedure mktemp [2018-04-10 14:26:00,470 INFO L128 BoogieDeclarations]: Found specification of procedure mkstemp [2018-04-10 14:26:00,470 INFO L128 BoogieDeclarations]: Found specification of procedure mkstemps [2018-04-10 14:26:00,470 INFO L128 BoogieDeclarations]: Found specification of procedure mkdtemp [2018-04-10 14:26:00,470 INFO L128 BoogieDeclarations]: Found specification of procedure system [2018-04-10 14:26:00,470 INFO L128 BoogieDeclarations]: Found specification of procedure realpath [2018-04-10 14:26:00,470 INFO L128 BoogieDeclarations]: Found specification of procedure bsearch [2018-04-10 14:26:00,470 INFO L128 BoogieDeclarations]: Found specification of procedure qsort [2018-04-10 14:26:00,470 INFO L128 BoogieDeclarations]: Found specification of procedure abs [2018-04-10 14:26:00,470 INFO L128 BoogieDeclarations]: Found specification of procedure labs [2018-04-10 14:26:00,471 INFO L128 BoogieDeclarations]: Found specification of procedure llabs [2018-04-10 14:26:00,471 INFO L128 BoogieDeclarations]: Found specification of procedure div [2018-04-10 14:26:00,471 INFO L128 BoogieDeclarations]: Found specification of procedure ldiv [2018-04-10 14:26:00,471 INFO L128 BoogieDeclarations]: Found specification of procedure lldiv [2018-04-10 14:26:00,471 INFO L128 BoogieDeclarations]: Found specification of procedure ecvt [2018-04-10 14:26:00,471 INFO L128 BoogieDeclarations]: Found specification of procedure fcvt [2018-04-10 14:26:00,471 INFO L128 BoogieDeclarations]: Found specification of procedure gcvt [2018-04-10 14:26:00,471 INFO L128 BoogieDeclarations]: Found specification of procedure qecvt [2018-04-10 14:26:00,471 INFO L128 BoogieDeclarations]: Found specification of procedure qfcvt [2018-04-10 14:26:00,471 INFO L128 BoogieDeclarations]: Found specification of procedure qgcvt [2018-04-10 14:26:00,472 INFO L128 BoogieDeclarations]: Found specification of procedure ecvt_r [2018-04-10 14:26:00,472 INFO L128 BoogieDeclarations]: Found specification of procedure fcvt_r [2018-04-10 14:26:00,472 INFO L128 BoogieDeclarations]: Found specification of procedure qecvt_r [2018-04-10 14:26:00,472 INFO L128 BoogieDeclarations]: Found specification of procedure qfcvt_r [2018-04-10 14:26:00,472 INFO L128 BoogieDeclarations]: Found specification of procedure mblen [2018-04-10 14:26:00,472 INFO L128 BoogieDeclarations]: Found specification of procedure mbtowc [2018-04-10 14:26:00,472 INFO L128 BoogieDeclarations]: Found specification of procedure wctomb [2018-04-10 14:26:00,472 INFO L128 BoogieDeclarations]: Found specification of procedure mbstowcs [2018-04-10 14:26:00,472 INFO L128 BoogieDeclarations]: Found specification of procedure wcstombs [2018-04-10 14:26:00,472 INFO L128 BoogieDeclarations]: Found specification of procedure rpmatch [2018-04-10 14:26:00,472 INFO L128 BoogieDeclarations]: Found specification of procedure getsubopt [2018-04-10 14:26:00,473 INFO L128 BoogieDeclarations]: Found specification of procedure getloadavg [2018-04-10 14:26:00,473 INFO L128 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2018-04-10 14:26:00,473 INFO L128 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2018-04-10 14:26:00,473 INFO L128 BoogieDeclarations]: Found specification of procedure main [2018-04-10 14:26:00,473 INFO L128 BoogieDeclarations]: Found specification of procedure #Ultimate.alloc [2018-04-10 14:26:00,473 INFO L128 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2018-04-10 14:26:00,473 INFO L128 BoogieDeclarations]: Found specification of procedure write~int [2018-04-10 14:26:00,473 INFO L128 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2018-04-10 14:26:00,473 INFO L128 BoogieDeclarations]: Found specification of procedure read~int [2018-04-10 14:26:00,473 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2018-04-10 14:26:00,474 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-04-10 14:26:00,474 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-04-10 14:26:00,474 INFO L128 BoogieDeclarations]: Found specification of procedure write~unchecked~int [2018-04-10 14:26:00,884 INFO L259 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-04-10 14:26:00,884 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.04 02:26:00 BoogieIcfgContainer [2018-04-10 14:26:00,884 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-04-10 14:26:00,885 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-04-10 14:26:00,885 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-04-10 14:26:00,887 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-04-10 14:26:00,887 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 10.04 02:26:00" (1/3) ... [2018-04-10 14:26:00,888 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@770193aa and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.04 02:26:00, skipping insertion in model container [2018-04-10 14:26:00,888 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.04 02:26:00" (2/3) ... [2018-04-10 14:26:00,888 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@770193aa and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.04 02:26:00, skipping insertion in model container [2018-04-10 14:26:00,888 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.04 02:26:00" (3/3) ... [2018-04-10 14:26:00,890 INFO L107 eAbstractionObserver]: Analyzing ICFG sll-reverse_simple_true-unreach-call_true-valid-memsafety.i [2018-04-10 14:26:00,896 INFO L131 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-04-10 14:26:00,903 INFO L143 ceAbstractionStarter]: Appying trace abstraction to program that has 53 error locations. [2018-04-10 14:26:00,928 INFO L128 ementStrategyFactory]: Using default assertion order modulation [2018-04-10 14:26:00,929 INFO L369 AbstractCegarLoop]: Interprodecural is true [2018-04-10 14:26:00,929 INFO L370 AbstractCegarLoop]: Hoare is false [2018-04-10 14:26:00,929 INFO L371 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-04-10 14:26:00,929 INFO L372 AbstractCegarLoop]: Backedges is TWOTRACK [2018-04-10 14:26:00,929 INFO L373 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-04-10 14:26:00,929 INFO L374 AbstractCegarLoop]: Difference is false [2018-04-10 14:26:00,930 INFO L375 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-04-10 14:26:00,930 INFO L380 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-04-10 14:26:00,930 INFO L87 2NestedWordAutomaton]: Mode: main mode - execution starts in main procedure [2018-04-10 14:26:00,941 INFO L276 IsEmpty]: Start isEmpty. Operand 136 states. [2018-04-10 14:26:00,948 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2018-04-10 14:26:00,948 INFO L347 BasicCegarLoop]: Found error trace [2018-04-10 14:26:00,949 INFO L355 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2018-04-10 14:26:00,949 INFO L408 AbstractCegarLoop]: === Iteration 1 === [mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr31RequiresViolation, mainErr46RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr15RequiresViolation, mainErr49RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr17RequiresViolation, mainErr42RequiresViolation, mainErr30RequiresViolation, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr44RequiresViolation, mainErr10RequiresViolation, mainErr43RequiresViolation, mainErr4RequiresViolation, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr51AssertViolationMEMORY_FREE, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr48RequiresViolation, mainErr52EnsuresViolationMEMORY_LEAK, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr45RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr9RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr50AssertViolationMEMORY_FREE, mainErr8RequiresViolation, mainErr34RequiresViolation, mainErr47RequiresViolation, mainErr14RequiresViolation, mainErr40RequiresViolation]=== [2018-04-10 14:26:00,952 INFO L82 PathProgramCache]: Analyzing trace with hash 2115138312, now seen corresponding path program 1 times [2018-04-10 14:26:00,953 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-04-10 14:26:00,953 INFO L68 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-04-10 14:26:00,988 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-10 14:26:00,988 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-10 14:26:00,988 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-10 14:26:01,011 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-10 14:26:01,017 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-10 14:26:01,054 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:26:01,056 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-04-10 14:26:01,056 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-04-10 14:26:01,058 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-04-10 14:26:01,066 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-04-10 14:26:01,067 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-04-10 14:26:01,068 INFO L87 Difference]: Start difference. First operand 136 states. Second operand 4 states. [2018-04-10 14:26:01,217 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-10 14:26:01,218 INFO L93 Difference]: Finished difference Result 149 states and 158 transitions. [2018-04-10 14:26:01,218 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-04-10 14:26:01,219 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 8 [2018-04-10 14:26:01,219 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-10 14:26:01,227 INFO L225 Difference]: With dead ends: 149 [2018-04-10 14:26:01,228 INFO L226 Difference]: Without dead ends: 145 [2018-04-10 14:26:01,230 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:26:01,248 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 145 states. [2018-04-10 14:26:01,263 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 145 to 131. [2018-04-10 14:26:01,264 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 131 states. [2018-04-10 14:26:01,266 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 131 states to 131 states and 139 transitions. [2018-04-10 14:26:01,267 INFO L78 Accepts]: Start accepts. Automaton has 131 states and 139 transitions. Word has length 8 [2018-04-10 14:26:01,267 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-10 14:26:01,268 INFO L459 AbstractCegarLoop]: Abstraction has 131 states and 139 transitions. [2018-04-10 14:26:01,268 INFO L460 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-04-10 14:26:01,268 INFO L276 IsEmpty]: Start isEmpty. Operand 131 states and 139 transitions. [2018-04-10 14:26:01,268 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2018-04-10 14:26:01,268 INFO L347 BasicCegarLoop]: Found error trace [2018-04-10 14:26:01,268 INFO L355 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2018-04-10 14:26:01,269 INFO L408 AbstractCegarLoop]: === Iteration 2 === [mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr31RequiresViolation, mainErr46RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr15RequiresViolation, mainErr49RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr17RequiresViolation, mainErr42RequiresViolation, mainErr30RequiresViolation, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr44RequiresViolation, mainErr10RequiresViolation, mainErr43RequiresViolation, mainErr4RequiresViolation, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr51AssertViolationMEMORY_FREE, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr48RequiresViolation, mainErr52EnsuresViolationMEMORY_LEAK, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr45RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr9RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr50AssertViolationMEMORY_FREE, mainErr8RequiresViolation, mainErr34RequiresViolation, mainErr47RequiresViolation, mainErr14RequiresViolation, mainErr40RequiresViolation]=== [2018-04-10 14:26:01,269 INFO L82 PathProgramCache]: Analyzing trace with hash 2115138313, now seen corresponding path program 1 times [2018-04-10 14:26:01,269 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-04-10 14:26:01,269 INFO L68 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-04-10 14:26:01,271 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-10 14:26:01,272 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-10 14:26:01,272 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-10 14:26:01,285 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-10 14:26:01,286 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-10 14:26:01,324 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-10 14:26:01,325 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-04-10 14:26:01,325 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-04-10 14:26:01,326 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-04-10 14:26:01,326 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-04-10 14:26:01,326 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-04-10 14:26:01,327 INFO L87 Difference]: Start difference. First operand 131 states and 139 transitions. Second operand 4 states. [2018-04-10 14:26:01,591 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-10 14:26:01,591 INFO L93 Difference]: Finished difference Result 129 states and 137 transitions. [2018-04-10 14:26:01,592 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-04-10 14:26:01,592 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 8 [2018-04-10 14:26:01,592 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-10 14:26:01,593 INFO L225 Difference]: With dead ends: 129 [2018-04-10 14:26:01,593 INFO L226 Difference]: Without dead ends: 129 [2018-04-10 14:26:01,593 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:26:01,594 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 129 states. [2018-04-10 14:26:01,599 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 129 to 129. [2018-04-10 14:26:01,599 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 129 states. [2018-04-10 14:26:01,600 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 129 states to 129 states and 137 transitions. [2018-04-10 14:26:01,601 INFO L78 Accepts]: Start accepts. Automaton has 129 states and 137 transitions. Word has length 8 [2018-04-10 14:26:01,601 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-10 14:26:01,601 INFO L459 AbstractCegarLoop]: Abstraction has 129 states and 137 transitions. [2018-04-10 14:26:01,601 INFO L460 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-04-10 14:26:01,601 INFO L276 IsEmpty]: Start isEmpty. Operand 129 states and 137 transitions. [2018-04-10 14:26:01,601 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2018-04-10 14:26:01,601 INFO L347 BasicCegarLoop]: Found error trace [2018-04-10 14:26:01,601 INFO L355 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-10 14:26:01,601 INFO L408 AbstractCegarLoop]: === Iteration 3 === [mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr31RequiresViolation, mainErr46RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr15RequiresViolation, mainErr49RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr17RequiresViolation, mainErr42RequiresViolation, mainErr30RequiresViolation, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr44RequiresViolation, mainErr10RequiresViolation, mainErr43RequiresViolation, mainErr4RequiresViolation, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr51AssertViolationMEMORY_FREE, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr48RequiresViolation, mainErr52EnsuresViolationMEMORY_LEAK, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr45RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr9RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr50AssertViolationMEMORY_FREE, mainErr8RequiresViolation, mainErr34RequiresViolation, mainErr47RequiresViolation, mainErr14RequiresViolation, mainErr40RequiresViolation]=== [2018-04-10 14:26:01,601 INFO L82 PathProgramCache]: Analyzing trace with hash 1814518955, now seen corresponding path program 1 times [2018-04-10 14:26:01,602 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-04-10 14:26:01,602 INFO L68 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-04-10 14:26:01,603 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-10 14:26:01,603 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-10 14:26:01,603 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-10 14:26:01,617 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-10 14:26:01,618 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-10 14:26:01,656 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:26:01,657 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-04-10 14:26:01,657 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-04-10 14:26:01,657 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-04-10 14:26:01,657 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-04-10 14:26:01,658 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-04-10 14:26:01,658 INFO L87 Difference]: Start difference. First operand 129 states and 137 transitions. Second operand 4 states. [2018-04-10 14:26:01,766 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-10 14:26:01,766 INFO L93 Difference]: Finished difference Result 125 states and 134 transitions. [2018-04-10 14:26:01,766 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-04-10 14:26:01,767 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 15 [2018-04-10 14:26:01,767 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-10 14:26:01,767 INFO L225 Difference]: With dead ends: 125 [2018-04-10 14:26:01,767 INFO L226 Difference]: Without dead ends: 125 [2018-04-10 14:26:01,768 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:26:01,768 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 125 states. [2018-04-10 14:26:01,772 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 125 to 121. [2018-04-10 14:26:01,772 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 121 states. [2018-04-10 14:26:01,774 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 121 states to 121 states and 133 transitions. [2018-04-10 14:26:01,774 INFO L78 Accepts]: Start accepts. Automaton has 121 states and 133 transitions. Word has length 15 [2018-04-10 14:26:01,774 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-10 14:26:01,774 INFO L459 AbstractCegarLoop]: Abstraction has 121 states and 133 transitions. [2018-04-10 14:26:01,774 INFO L460 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-04-10 14:26:01,774 INFO L276 IsEmpty]: Start isEmpty. Operand 121 states and 133 transitions. [2018-04-10 14:26:01,775 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2018-04-10 14:26:01,775 INFO L347 BasicCegarLoop]: Found error trace [2018-04-10 14:26:01,775 INFO L355 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-10 14:26:01,775 INFO L408 AbstractCegarLoop]: === Iteration 4 === [mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr31RequiresViolation, mainErr46RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr15RequiresViolation, mainErr49RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr17RequiresViolation, mainErr42RequiresViolation, mainErr30RequiresViolation, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr44RequiresViolation, mainErr10RequiresViolation, mainErr43RequiresViolation, mainErr4RequiresViolation, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr51AssertViolationMEMORY_FREE, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr48RequiresViolation, mainErr52EnsuresViolationMEMORY_LEAK, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr45RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr9RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr50AssertViolationMEMORY_FREE, mainErr8RequiresViolation, mainErr34RequiresViolation, mainErr47RequiresViolation, mainErr14RequiresViolation, mainErr40RequiresViolation]=== [2018-04-10 14:26:01,775 INFO L82 PathProgramCache]: Analyzing trace with hash 1814518956, now seen corresponding path program 1 times [2018-04-10 14:26:01,775 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-04-10 14:26:01,775 INFO L68 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-04-10 14:26:01,777 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-10 14:26:01,777 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-10 14:26:01,777 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-10 14:26:01,788 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-10 14:26:01,789 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-10 14:26:01,841 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:26:01,841 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-04-10 14:26:01,841 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-04-10 14:26:01,842 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-04-10 14:26:01,842 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-04-10 14:26:01,842 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-04-10 14:26:01,842 INFO L87 Difference]: Start difference. First operand 121 states and 133 transitions. Second operand 5 states. [2018-04-10 14:26:02,079 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-10 14:26:02,079 INFO L93 Difference]: Finished difference Result 157 states and 171 transitions. [2018-04-10 14:26:02,079 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-04-10 14:26:02,079 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 15 [2018-04-10 14:26:02,079 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-10 14:26:02,080 INFO L225 Difference]: With dead ends: 157 [2018-04-10 14:26:02,080 INFO L226 Difference]: Without dead ends: 157 [2018-04-10 14:26:02,080 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:26:02,081 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 157 states. [2018-04-10 14:26:02,085 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 157 to 146. [2018-04-10 14:26:02,085 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 146 states. [2018-04-10 14:26:02,086 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 146 states to 146 states and 160 transitions. [2018-04-10 14:26:02,086 INFO L78 Accepts]: Start accepts. Automaton has 146 states and 160 transitions. Word has length 15 [2018-04-10 14:26:02,086 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-10 14:26:02,087 INFO L459 AbstractCegarLoop]: Abstraction has 146 states and 160 transitions. [2018-04-10 14:26:02,087 INFO L460 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-04-10 14:26:02,087 INFO L276 IsEmpty]: Start isEmpty. Operand 146 states and 160 transitions. [2018-04-10 14:26:02,087 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2018-04-10 14:26:02,087 INFO L347 BasicCegarLoop]: Found error trace [2018-04-10 14:26:02,087 INFO L355 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-10 14:26:02,088 INFO L408 AbstractCegarLoop]: === Iteration 5 === [mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr31RequiresViolation, mainErr46RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr15RequiresViolation, mainErr49RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr17RequiresViolation, mainErr42RequiresViolation, mainErr30RequiresViolation, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr44RequiresViolation, mainErr10RequiresViolation, mainErr43RequiresViolation, mainErr4RequiresViolation, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr51AssertViolationMEMORY_FREE, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr48RequiresViolation, mainErr52EnsuresViolationMEMORY_LEAK, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr45RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr9RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr50AssertViolationMEMORY_FREE, mainErr8RequiresViolation, mainErr34RequiresViolation, mainErr47RequiresViolation, mainErr14RequiresViolation, mainErr40RequiresViolation]=== [2018-04-10 14:26:02,088 INFO L82 PathProgramCache]: Analyzing trace with hash -124202925, now seen corresponding path program 1 times [2018-04-10 14:26:02,088 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-04-10 14:26:02,088 INFO L68 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-04-10 14:26:02,089 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-10 14:26:02,089 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-10 14:26:02,089 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-10 14:26:02,100 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-10 14:26:02,101 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-10 14:26:02,143 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:26:02,143 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-04-10 14:26:02,143 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-04-10 14:26:02,143 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-04-10 14:26:02,144 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-04-10 14:26:02,144 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-04-10 14:26:02,144 INFO L87 Difference]: Start difference. First operand 146 states and 160 transitions. Second operand 6 states. [2018-04-10 14:26:02,437 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-10 14:26:02,437 INFO L93 Difference]: Finished difference Result 259 states and 285 transitions. [2018-04-10 14:26:02,438 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-04-10 14:26:02,438 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 18 [2018-04-10 14:26:02,438 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-10 14:26:02,439 INFO L225 Difference]: With dead ends: 259 [2018-04-10 14:26:02,439 INFO L226 Difference]: Without dead ends: 259 [2018-04-10 14:26:02,439 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=40, Invalid=70, Unknown=0, NotChecked=0, Total=110 [2018-04-10 14:26:02,439 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 259 states. [2018-04-10 14:26:02,444 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 259 to 136. [2018-04-10 14:26:02,444 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 136 states. [2018-04-10 14:26:02,445 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 136 states to 136 states and 149 transitions. [2018-04-10 14:26:02,445 INFO L78 Accepts]: Start accepts. Automaton has 136 states and 149 transitions. Word has length 18 [2018-04-10 14:26:02,445 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-10 14:26:02,445 INFO L459 AbstractCegarLoop]: Abstraction has 136 states and 149 transitions. [2018-04-10 14:26:02,445 INFO L460 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-04-10 14:26:02,445 INFO L276 IsEmpty]: Start isEmpty. Operand 136 states and 149 transitions. [2018-04-10 14:26:02,446 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2018-04-10 14:26:02,446 INFO L347 BasicCegarLoop]: Found error trace [2018-04-10 14:26:02,446 INFO L355 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-10 14:26:02,446 INFO L408 AbstractCegarLoop]: === Iteration 6 === [mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr31RequiresViolation, mainErr46RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr15RequiresViolation, mainErr49RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr17RequiresViolation, mainErr42RequiresViolation, mainErr30RequiresViolation, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr44RequiresViolation, mainErr10RequiresViolation, mainErr43RequiresViolation, mainErr4RequiresViolation, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr51AssertViolationMEMORY_FREE, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr48RequiresViolation, mainErr52EnsuresViolationMEMORY_LEAK, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr45RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr9RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr50AssertViolationMEMORY_FREE, mainErr8RequiresViolation, mainErr34RequiresViolation, mainErr47RequiresViolation, mainErr14RequiresViolation, mainErr40RequiresViolation]=== [2018-04-10 14:26:02,447 INFO L82 PathProgramCache]: Analyzing trace with hash -124202926, now seen corresponding path program 1 times [2018-04-10 14:26:02,447 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-04-10 14:26:02,447 INFO L68 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-04-10 14:26:02,448 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-10 14:26:02,448 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-10 14:26:02,448 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-10 14:26:02,456 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-10 14:26:02,457 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-10 14:26:02,482 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:26:02,482 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-04-10 14:26:02,482 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-04-10 14:26:02,482 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-04-10 14:26:02,482 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-04-10 14:26:02,483 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-04-10 14:26:02,483 INFO L87 Difference]: Start difference. First operand 136 states and 149 transitions. Second operand 6 states. [2018-04-10 14:26:02,692 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-10 14:26:02,693 INFO L93 Difference]: Finished difference Result 258 states and 282 transitions. [2018-04-10 14:26:02,693 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-04-10 14:26:02,693 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 18 [2018-04-10 14:26:02,693 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-10 14:26:02,694 INFO L225 Difference]: With dead ends: 258 [2018-04-10 14:26:02,694 INFO L226 Difference]: Without dead ends: 258 [2018-04-10 14:26:02,694 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2018-04-10 14:26:02,694 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 258 states. [2018-04-10 14:26:02,697 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 258 to 135. [2018-04-10 14:26:02,697 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 135 states. [2018-04-10 14:26:02,697 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 135 states to 135 states and 148 transitions. [2018-04-10 14:26:02,697 INFO L78 Accepts]: Start accepts. Automaton has 135 states and 148 transitions. Word has length 18 [2018-04-10 14:26:02,697 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-10 14:26:02,697 INFO L459 AbstractCegarLoop]: Abstraction has 135 states and 148 transitions. [2018-04-10 14:26:02,698 INFO L460 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-04-10 14:26:02,698 INFO L276 IsEmpty]: Start isEmpty. Operand 135 states and 148 transitions. [2018-04-10 14:26:02,698 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2018-04-10 14:26:02,698 INFO L347 BasicCegarLoop]: Found error trace [2018-04-10 14:26:02,698 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] [2018-04-10 14:26:02,698 INFO L408 AbstractCegarLoop]: === Iteration 7 === [mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr31RequiresViolation, mainErr46RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr15RequiresViolation, mainErr49RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr17RequiresViolation, mainErr42RequiresViolation, mainErr30RequiresViolation, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr44RequiresViolation, mainErr10RequiresViolation, mainErr43RequiresViolation, mainErr4RequiresViolation, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr51AssertViolationMEMORY_FREE, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr48RequiresViolation, mainErr52EnsuresViolationMEMORY_LEAK, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr45RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr9RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr50AssertViolationMEMORY_FREE, mainErr8RequiresViolation, mainErr34RequiresViolation, mainErr47RequiresViolation, mainErr14RequiresViolation, mainErr40RequiresViolation]=== [2018-04-10 14:26:02,698 INFO L82 PathProgramCache]: Analyzing trace with hash -687523821, now seen corresponding path program 1 times [2018-04-10 14:26:02,698 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-04-10 14:26:02,698 INFO L68 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-04-10 14:26:02,699 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-10 14:26:02,699 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-10 14:26:02,700 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-10 14:26:02,707 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-10 14:26:02,708 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-10 14:26:02,761 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-10 14:26:02,761 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-04-10 14:26:02,761 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-04-10 14:26:02,762 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-04-10 14:26:02,762 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-04-10 14:26:02,762 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-04-10 14:26:02,762 INFO L87 Difference]: Start difference. First operand 135 states and 148 transitions. Second operand 6 states. [2018-04-10 14:26:02,902 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-10 14:26:02,903 INFO L93 Difference]: Finished difference Result 169 states and 185 transitions. [2018-04-10 14:26:02,903 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-04-10 14:26:02,903 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 26 [2018-04-10 14:26:02,903 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-10 14:26:02,904 INFO L225 Difference]: With dead ends: 169 [2018-04-10 14:26:02,904 INFO L226 Difference]: Without dead ends: 169 [2018-04-10 14:26:02,904 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 2 SyntacticMatches, 1 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:26:02,904 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 169 states. [2018-04-10 14:26:02,906 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 169 to 145. [2018-04-10 14:26:02,906 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 145 states. [2018-04-10 14:26:02,907 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 145 states to 145 states and 159 transitions. [2018-04-10 14:26:02,907 INFO L78 Accepts]: Start accepts. Automaton has 145 states and 159 transitions. Word has length 26 [2018-04-10 14:26:02,907 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-10 14:26:02,907 INFO L459 AbstractCegarLoop]: Abstraction has 145 states and 159 transitions. [2018-04-10 14:26:02,907 INFO L460 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-04-10 14:26:02,907 INFO L276 IsEmpty]: Start isEmpty. Operand 145 states and 159 transitions. [2018-04-10 14:26:02,908 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2018-04-10 14:26:02,908 INFO L347 BasicCegarLoop]: Found error trace [2018-04-10 14:26:02,908 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] [2018-04-10 14:26:02,908 INFO L408 AbstractCegarLoop]: === Iteration 8 === [mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr31RequiresViolation, mainErr46RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr15RequiresViolation, mainErr49RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr17RequiresViolation, mainErr42RequiresViolation, mainErr30RequiresViolation, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr44RequiresViolation, mainErr10RequiresViolation, mainErr43RequiresViolation, mainErr4RequiresViolation, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr51AssertViolationMEMORY_FREE, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr48RequiresViolation, mainErr52EnsuresViolationMEMORY_LEAK, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr45RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr9RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr50AssertViolationMEMORY_FREE, mainErr8RequiresViolation, mainErr34RequiresViolation, mainErr47RequiresViolation, mainErr14RequiresViolation, mainErr40RequiresViolation]=== [2018-04-10 14:26:02,908 INFO L82 PathProgramCache]: Analyzing trace with hash -1498398890, now seen corresponding path program 1 times [2018-04-10 14:26:02,908 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-04-10 14:26:02,908 INFO L68 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-04-10 14:26:02,909 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-10 14:26:02,909 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-10 14:26:02,909 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-10 14:26:02,913 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-10 14:26:02,914 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-10 14:26:02,948 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:26:02,948 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-04-10 14:26:02,948 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-04-10 14:26:02,948 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-04-10 14:26:02,948 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-04-10 14:26:02,948 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2018-04-10 14:26:02,948 INFO L87 Difference]: Start difference. First operand 145 states and 159 transitions. Second operand 6 states. [2018-04-10 14:26:03,046 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-10 14:26:03,046 INFO L93 Difference]: Finished difference Result 167 states and 181 transitions. [2018-04-10 14:26:03,046 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-04-10 14:26:03,046 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 27 [2018-04-10 14:26:03,046 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-10 14:26:03,047 INFO L225 Difference]: With dead ends: 167 [2018-04-10 14:26:03,047 INFO L226 Difference]: Without dead ends: 167 [2018-04-10 14:26:03,047 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=25, Invalid=47, Unknown=0, NotChecked=0, Total=72 [2018-04-10 14:26:03,047 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 167 states. [2018-04-10 14:26:03,049 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 167 to 157. [2018-04-10 14:26:03,049 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 157 states. [2018-04-10 14:26:03,049 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 157 states to 157 states and 173 transitions. [2018-04-10 14:26:03,049 INFO L78 Accepts]: Start accepts. Automaton has 157 states and 173 transitions. Word has length 27 [2018-04-10 14:26:03,050 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-10 14:26:03,050 INFO L459 AbstractCegarLoop]: Abstraction has 157 states and 173 transitions. [2018-04-10 14:26:03,050 INFO L460 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-04-10 14:26:03,050 INFO L276 IsEmpty]: Start isEmpty. Operand 157 states and 173 transitions. [2018-04-10 14:26:03,050 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2018-04-10 14:26:03,051 INFO L347 BasicCegarLoop]: Found error trace [2018-04-10 14:26:03,051 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:26:03,051 INFO L408 AbstractCegarLoop]: === Iteration 9 === [mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr31RequiresViolation, mainErr46RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr15RequiresViolation, mainErr49RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr17RequiresViolation, mainErr42RequiresViolation, mainErr30RequiresViolation, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr44RequiresViolation, mainErr10RequiresViolation, mainErr43RequiresViolation, mainErr4RequiresViolation, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr51AssertViolationMEMORY_FREE, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr48RequiresViolation, mainErr52EnsuresViolationMEMORY_LEAK, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr45RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr9RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr50AssertViolationMEMORY_FREE, mainErr8RequiresViolation, mainErr34RequiresViolation, mainErr47RequiresViolation, mainErr14RequiresViolation, mainErr40RequiresViolation]=== [2018-04-10 14:26:03,051 INFO L82 PathProgramCache]: Analyzing trace with hash -1679519150, now seen corresponding path program 1 times [2018-04-10 14:26:03,051 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-04-10 14:26:03,051 INFO L68 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-04-10 14:26:03,052 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-10 14:26:03,052 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-10 14:26:03,052 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-10 14:26:03,059 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-10 14:26:03,059 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-10 14:26:03,089 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:26:03,090 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-04-10 14:26:03,090 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-04-10 14:26:03,090 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-04-10 14:26:03,090 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-04-10 14:26:03,090 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-04-10 14:26:03,090 INFO L87 Difference]: Start difference. First operand 157 states and 173 transitions. Second operand 6 states. [2018-04-10 14:26:03,286 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-10 14:26:03,286 INFO L93 Difference]: Finished difference Result 218 states and 238 transitions. [2018-04-10 14:26:03,286 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-04-10 14:26:03,286 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 30 [2018-04-10 14:26:03,287 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-10 14:26:03,288 INFO L225 Difference]: With dead ends: 218 [2018-04-10 14:26:03,288 INFO L226 Difference]: Without dead ends: 218 [2018-04-10 14:26:03,288 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:26:03,288 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 218 states. [2018-04-10 14:26:03,291 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 218 to 156. [2018-04-10 14:26:03,292 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 156 states. [2018-04-10 14:26:03,292 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 156 states to 156 states and 172 transitions. [2018-04-10 14:26:03,293 INFO L78 Accepts]: Start accepts. Automaton has 156 states and 172 transitions. Word has length 30 [2018-04-10 14:26:03,293 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-10 14:26:03,293 INFO L459 AbstractCegarLoop]: Abstraction has 156 states and 172 transitions. [2018-04-10 14:26:03,293 INFO L460 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-04-10 14:26:03,293 INFO L276 IsEmpty]: Start isEmpty. Operand 156 states and 172 transitions. [2018-04-10 14:26:03,294 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2018-04-10 14:26:03,294 INFO L347 BasicCegarLoop]: Found error trace [2018-04-10 14:26:03,294 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:26:03,294 INFO L408 AbstractCegarLoop]: === Iteration 10 === [mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr31RequiresViolation, mainErr46RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr15RequiresViolation, mainErr49RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr17RequiresViolation, mainErr42RequiresViolation, mainErr30RequiresViolation, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr44RequiresViolation, mainErr10RequiresViolation, mainErr43RequiresViolation, mainErr4RequiresViolation, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr51AssertViolationMEMORY_FREE, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr48RequiresViolation, mainErr52EnsuresViolationMEMORY_LEAK, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr45RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr9RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr50AssertViolationMEMORY_FREE, mainErr8RequiresViolation, mainErr34RequiresViolation, mainErr47RequiresViolation, mainErr14RequiresViolation, mainErr40RequiresViolation]=== [2018-04-10 14:26:03,294 INFO L82 PathProgramCache]: Analyzing trace with hash -1679519149, now seen corresponding path program 1 times [2018-04-10 14:26:03,294 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-04-10 14:26:03,294 INFO L68 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-04-10 14:26:03,297 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-10 14:26:03,297 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-10 14:26:03,297 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-10 14:26:03,311 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-10 14:26:03,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:26:03,390 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:26:03,390 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-04-10 14:26:03,391 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-04-10 14:26:03,391 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-04-10 14:26:03,391 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-04-10 14:26:03,391 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-04-10 14:26:03,391 INFO L87 Difference]: Start difference. First operand 156 states and 172 transitions. Second operand 6 states. [2018-04-10 14:26:03,584 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-10 14:26:03,585 INFO L93 Difference]: Finished difference Result 212 states and 234 transitions. [2018-04-10 14:26:03,585 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-04-10 14:26:03,585 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 30 [2018-04-10 14:26:03,585 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-10 14:26:03,586 INFO L225 Difference]: With dead ends: 212 [2018-04-10 14:26:03,586 INFO L226 Difference]: Without dead ends: 212 [2018-04-10 14:26:03,587 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:26:03,587 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 212 states. [2018-04-10 14:26:03,589 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 212 to 154. [2018-04-10 14:26:03,590 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 154 states. [2018-04-10 14:26:03,590 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 154 states to 154 states and 170 transitions. [2018-04-10 14:26:03,590 INFO L78 Accepts]: Start accepts. Automaton has 154 states and 170 transitions. Word has length 30 [2018-04-10 14:26:03,591 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-10 14:26:03,591 INFO L459 AbstractCegarLoop]: Abstraction has 154 states and 170 transitions. [2018-04-10 14:26:03,591 INFO L460 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-04-10 14:26:03,591 INFO L276 IsEmpty]: Start isEmpty. Operand 154 states and 170 transitions. [2018-04-10 14:26:03,592 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2018-04-10 14:26:03,592 INFO L347 BasicCegarLoop]: Found error trace [2018-04-10 14:26:03,592 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] [2018-04-10 14:26:03,592 INFO L408 AbstractCegarLoop]: === Iteration 11 === [mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr31RequiresViolation, mainErr46RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr15RequiresViolation, mainErr49RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr17RequiresViolation, mainErr42RequiresViolation, mainErr30RequiresViolation, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr44RequiresViolation, mainErr10RequiresViolation, mainErr43RequiresViolation, mainErr4RequiresViolation, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr51AssertViolationMEMORY_FREE, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr48RequiresViolation, mainErr52EnsuresViolationMEMORY_LEAK, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr45RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr9RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr50AssertViolationMEMORY_FREE, mainErr8RequiresViolation, mainErr34RequiresViolation, mainErr47RequiresViolation, mainErr14RequiresViolation, mainErr40RequiresViolation]=== [2018-04-10 14:26:03,592 INFO L82 PathProgramCache]: Analyzing trace with hash -1284483111, now seen corresponding path program 1 times [2018-04-10 14:26:03,592 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-04-10 14:26:03,593 INFO L68 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-04-10 14:26:03,593 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-10 14:26:03,594 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-10 14:26:03,594 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-10 14:26:03,605 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-10 14:26:03,606 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-10 14:26:03,749 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-10 14:26:03,749 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-04-10 14:26:03,749 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:26:03,759 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-10 14:26:03,790 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-10 14:26:03,798 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-10 14:26:03,840 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 14:26:03,840 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 14:26:03,845 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 21 [2018-04-10 14:26:03,846 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-10 14:26:03,855 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-10 14:26:03,855 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:23, output treesize:21 [2018-04-10 14:26:03,907 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:26:03,909 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:26:03,909 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-10 14:26:03,911 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-10 14:26:03,918 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:26:03,919 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:32, output treesize:29 [2018-04-10 14:26:03,994 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 37 treesize of output 33 [2018-04-10 14:26:03,996 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select 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:26:03,997 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-10 14:26:04,001 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-10 14:26:04,005 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:26:04,005 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:42, output treesize:34 [2018-04-10 14:26:04,064 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 36 treesize of output 24 [2018-04-10 14:26:04,066 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:26:04,066 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-10 14:26:04,070 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select 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:26:04,070 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-04-10 14:26:04,084 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-10 14:26:04,088 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-04-10 14:26:04,088 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 4 variables, input treesize:41, output treesize:15 [2018-04-10 14:26:04,137 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-10 14:26:04,164 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-04-10 14:26:04,164 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 11] total 20 [2018-04-10 14:26:04,164 INFO L442 AbstractCegarLoop]: Interpolant automaton has 21 states [2018-04-10 14:26:04,164 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2018-04-10 14:26:04,164 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=71, Invalid=349, Unknown=0, NotChecked=0, Total=420 [2018-04-10 14:26:04,165 INFO L87 Difference]: Start difference. First operand 154 states and 170 transitions. Second operand 21 states. [2018-04-10 14:26:04,954 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-10 14:26:04,954 INFO L93 Difference]: Finished difference Result 258 states and 283 transitions. [2018-04-10 14:26:04,954 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2018-04-10 14:26:04,954 INFO L78 Accepts]: Start accepts. Automaton has 21 states. Word has length 35 [2018-04-10 14:26:04,955 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-10 14:26:04,956 INFO L225 Difference]: With dead ends: 258 [2018-04-10 14:26:04,957 INFO L226 Difference]: Without dead ends: 258 [2018-04-10 14:26:04,957 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 57 GetRequests, 26 SyntacticMatches, 2 SemanticMatches, 29 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 171 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=202, Invalid=728, Unknown=0, NotChecked=0, Total=930 [2018-04-10 14:26:04,958 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 258 states. [2018-04-10 14:26:04,961 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 258 to 176. [2018-04-10 14:26:04,961 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 176 states. [2018-04-10 14:26:04,962 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 176 states to 176 states and 196 transitions. [2018-04-10 14:26:04,962 INFO L78 Accepts]: Start accepts. Automaton has 176 states and 196 transitions. Word has length 35 [2018-04-10 14:26:04,962 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-10 14:26:04,962 INFO L459 AbstractCegarLoop]: Abstraction has 176 states and 196 transitions. [2018-04-10 14:26:04,962 INFO L460 AbstractCegarLoop]: Interpolant automaton has 21 states. [2018-04-10 14:26:04,963 INFO L276 IsEmpty]: Start isEmpty. Operand 176 states and 196 transitions. [2018-04-10 14:26:04,963 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2018-04-10 14:26:04,963 INFO L347 BasicCegarLoop]: Found error trace [2018-04-10 14:26:04,964 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] [2018-04-10 14:26:04,964 INFO L408 AbstractCegarLoop]: === Iteration 12 === [mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr31RequiresViolation, mainErr46RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr15RequiresViolation, mainErr49RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr17RequiresViolation, mainErr42RequiresViolation, mainErr30RequiresViolation, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr44RequiresViolation, mainErr10RequiresViolation, mainErr43RequiresViolation, mainErr4RequiresViolation, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr51AssertViolationMEMORY_FREE, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr48RequiresViolation, mainErr52EnsuresViolationMEMORY_LEAK, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr45RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr9RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr50AssertViolationMEMORY_FREE, mainErr8RequiresViolation, mainErr34RequiresViolation, mainErr47RequiresViolation, mainErr14RequiresViolation, mainErr40RequiresViolation]=== [2018-04-10 14:26:04,964 INFO L82 PathProgramCache]: Analyzing trace with hash -1284483110, now seen corresponding path program 1 times [2018-04-10 14:26:04,964 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-04-10 14:26:04,964 INFO L68 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-04-10 14:26:04,965 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-10 14:26:04,965 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-10 14:26:04,965 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-10 14:26:04,977 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-10 14:26:04,978 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-10 14:26:05,128 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-10 14:26:05,129 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-04-10 14:26:05,129 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:26:05,138 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-10 14:26:05,157 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-10 14:26:05,160 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-10 14:26:05,168 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 14:26:05,169 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 14:26:05,169 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 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:26:05,170 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-10 14:26:05,177 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:26:05,177 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-10 14:26:05,183 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-10 14:26:05,183 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:26, output treesize:19 [2018-04-10 14:26:05,191 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:26:05,193 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:26:05,194 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-10 14:26:05,195 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-10 14:26:05,206 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:26:05,208 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-04-10 14:26:05,208 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-04-10 14:26:05,209 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-10 14:26:05,217 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:26:05,218 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 3 variables, input treesize:38, output treesize:31 [2018-04-10 14:26:05,275 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 56 treesize of output 52 [2018-04-10 14:26:05,277 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select 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:26:05,277 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-10 14:26:05,282 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-10 14:26:05,291 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 27 treesize of output 28 [2018-04-10 14:26:05,293 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select 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:26:05,293 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-04-10 14:26:05,297 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-10 14:26:05,303 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:26:05,303 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 3 variables, input treesize:63, output treesize:47 [2018-04-10 14:26:05,352 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 47 treesize of output 33 [2018-04-10 14:26:05,354 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 28 treesize of output 17 [2018-04-10 14:26:05,354 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-10 14:26:05,363 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select 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:26:05,363 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-04-10 14:26:05,368 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-10 14:26:05,375 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 22 treesize of output 20 [2018-04-10 14:26:05,377 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select 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:26:05,377 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2018-04-10 14:26:05,381 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 1 [2018-04-10 14:26:05,381 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2018-04-10 14:26:05,382 INFO L267 ElimStorePlain]: Start of recursive call 5: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-10 14:26:05,385 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:26:05,385 INFO L202 ElimStorePlain]: Needed 7 recursive calls to eliminate 5 variables, input treesize:61, output treesize:9 [2018-04-10 14:26:05,411 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-10 14:26:05,431 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-04-10 14:26:05,431 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11] total 16 [2018-04-10 14:26:05,432 INFO L442 AbstractCegarLoop]: Interpolant automaton has 17 states [2018-04-10 14:26:05,432 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2018-04-10 14:26:05,432 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=44, Invalid=228, Unknown=0, NotChecked=0, Total=272 [2018-04-10 14:26:05,432 INFO L87 Difference]: Start difference. First operand 176 states and 196 transitions. Second operand 17 states. [2018-04-10 14:26:06,204 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-10 14:26:06,204 INFO L93 Difference]: Finished difference Result 286 states and 315 transitions. [2018-04-10 14:26:06,204 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2018-04-10 14:26:06,204 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 35 [2018-04-10 14:26:06,204 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-10 14:26:06,205 INFO L225 Difference]: With dead ends: 286 [2018-04-10 14:26:06,205 INFO L226 Difference]: Without dead ends: 286 [2018-04-10 14:26:06,206 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 58 GetRequests, 26 SyntacticMatches, 5 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 147 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=149, Invalid=663, Unknown=0, NotChecked=0, Total=812 [2018-04-10 14:26:06,206 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 286 states. [2018-04-10 14:26:06,208 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 286 to 174. [2018-04-10 14:26:06,208 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 174 states. [2018-04-10 14:26:06,209 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 174 states to 174 states and 193 transitions. [2018-04-10 14:26:06,209 INFO L78 Accepts]: Start accepts. Automaton has 174 states and 193 transitions. Word has length 35 [2018-04-10 14:26:06,209 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-10 14:26:06,209 INFO L459 AbstractCegarLoop]: Abstraction has 174 states and 193 transitions. [2018-04-10 14:26:06,209 INFO L460 AbstractCegarLoop]: Interpolant automaton has 17 states. [2018-04-10 14:26:06,209 INFO L276 IsEmpty]: Start isEmpty. Operand 174 states and 193 transitions. [2018-04-10 14:26:06,210 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2018-04-10 14:26:06,210 INFO L347 BasicCegarLoop]: Found error trace [2018-04-10 14:26:06,210 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] [2018-04-10 14:26:06,210 INFO L408 AbstractCegarLoop]: === Iteration 13 === [mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr31RequiresViolation, mainErr46RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr15RequiresViolation, mainErr49RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr17RequiresViolation, mainErr42RequiresViolation, mainErr30RequiresViolation, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr44RequiresViolation, mainErr10RequiresViolation, mainErr43RequiresViolation, mainErr4RequiresViolation, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr51AssertViolationMEMORY_FREE, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr48RequiresViolation, mainErr52EnsuresViolationMEMORY_LEAK, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr45RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr9RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr50AssertViolationMEMORY_FREE, mainErr8RequiresViolation, mainErr34RequiresViolation, mainErr47RequiresViolation, mainErr14RequiresViolation, mainErr40RequiresViolation]=== [2018-04-10 14:26:06,210 INFO L82 PathProgramCache]: Analyzing trace with hash 1863726610, now seen corresponding path program 1 times [2018-04-10 14:26:06,210 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-04-10 14:26:06,210 INFO L68 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-04-10 14:26:06,211 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-10 14:26:06,211 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-10 14:26:06,212 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-10 14:26:06,222 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-10 14:26:06,223 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-10 14:26:06,303 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:26:06,303 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-04-10 14:26:06,303 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:26:06,311 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-10 14:26:06,328 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-10 14:26:06,331 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-10 14:26:06,349 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 14:26:06,350 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 14:26:06,351 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:26:06,351 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-10 14:26:06,359 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-10 14:26:06,359 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:23, output treesize:21 [2018-04-10 14:26:06,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:26:06,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, 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:26:06,392 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-10 14:26:06,394 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-10 14:26:06,402 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:26:06,402 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:32, output treesize:29 [2018-04-10 14:26:06,453 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 37 treesize of output 33 [2018-04-10 14:26:06,455 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select 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:26:06,455 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-10 14:26:06,458 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-10 14:26:06,463 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-04-10 14:26:06,463 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:42, output treesize:34 [2018-04-10 14:26:06,537 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 36 treesize of output 24 [2018-04-10 14:26:06,539 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 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:26:06,540 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-10 14:26:06,546 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select 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:26:06,546 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-04-10 14:26:06,549 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-10 14:26:06,553 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-04-10 14:26:06,553 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 4 variables, input treesize:41, output treesize:15 [2018-04-10 14:26:06,579 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:26:06,609 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-04-10 14:26:06,609 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 10] total 18 [2018-04-10 14:26:06,609 INFO L442 AbstractCegarLoop]: Interpolant automaton has 19 states [2018-04-10 14:26:06,609 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2018-04-10 14:26:06,610 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=56, Invalid=286, Unknown=0, NotChecked=0, Total=342 [2018-04-10 14:26:06,610 INFO L87 Difference]: Start difference. First operand 174 states and 193 transitions. Second operand 19 states. [2018-04-10 14:26:07,171 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-10 14:26:07,171 INFO L93 Difference]: Finished difference Result 278 states and 307 transitions. [2018-04-10 14:26:07,172 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2018-04-10 14:26:07,172 INFO L78 Accepts]: Start accepts. Automaton has 19 states. Word has length 36 [2018-04-10 14:26:07,172 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-10 14:26:07,173 INFO L225 Difference]: With dead ends: 278 [2018-04-10 14:26:07,173 INFO L226 Difference]: Without dead ends: 278 [2018-04-10 14:26:07,173 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 56 GetRequests, 28 SyntacticMatches, 2 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 117 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=145, Invalid=611, Unknown=0, NotChecked=0, Total=756 [2018-04-10 14:26:07,173 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 278 states. [2018-04-10 14:26:07,175 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 278 to 182. [2018-04-10 14:26:07,175 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 182 states. [2018-04-10 14:26:07,175 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 182 states to 182 states and 203 transitions. [2018-04-10 14:26:07,175 INFO L78 Accepts]: Start accepts. Automaton has 182 states and 203 transitions. Word has length 36 [2018-04-10 14:26:07,176 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-10 14:26:07,176 INFO L459 AbstractCegarLoop]: Abstraction has 182 states and 203 transitions. [2018-04-10 14:26:07,176 INFO L460 AbstractCegarLoop]: Interpolant automaton has 19 states. [2018-04-10 14:26:07,176 INFO L276 IsEmpty]: Start isEmpty. Operand 182 states and 203 transitions. [2018-04-10 14:26:07,176 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2018-04-10 14:26:07,176 INFO L347 BasicCegarLoop]: Found error trace [2018-04-10 14:26:07,177 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] [2018-04-10 14:26:07,177 INFO L408 AbstractCegarLoop]: === Iteration 14 === [mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr31RequiresViolation, mainErr46RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr15RequiresViolation, mainErr49RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr17RequiresViolation, mainErr42RequiresViolation, mainErr30RequiresViolation, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr44RequiresViolation, mainErr10RequiresViolation, mainErr43RequiresViolation, mainErr4RequiresViolation, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr51AssertViolationMEMORY_FREE, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr48RequiresViolation, mainErr52EnsuresViolationMEMORY_LEAK, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr45RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr9RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr50AssertViolationMEMORY_FREE, mainErr8RequiresViolation, mainErr34RequiresViolation, mainErr47RequiresViolation, mainErr14RequiresViolation, mainErr40RequiresViolation]=== [2018-04-10 14:26:07,177 INFO L82 PathProgramCache]: Analyzing trace with hash 1863726611, now seen corresponding path program 1 times [2018-04-10 14:26:07,177 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-04-10 14:26:07,177 INFO L68 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-04-10 14:26:07,178 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-10 14:26:07,178 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-10 14:26:07,178 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-10 14:26:07,192 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-10 14:26:07,192 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-10 14:26:07,304 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:26:07,304 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-04-10 14:26:07,304 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:26:07,312 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-10 14:26:07,329 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-10 14:26:07,330 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-10 14:26:07,336 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select 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:26:07,337 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-10 14:26:07,355 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 14:26:07,356 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 14:26:07,356 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 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:26:07,356 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-10 14:26:07,361 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-10 14:26:07,361 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:26, output treesize:19 [2018-04-10 14:26:07,368 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:26:07,370 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-04-10 14:26:07,370 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-10 14:26:07,373 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-10 14:26:07,381 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:26:07,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 8 treesize of output 7 [2018-04-10 14:26:07,383 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-04-10 14:26:07,384 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-10 14:26:07,391 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:26:07,391 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 3 variables, input treesize:38, output treesize:31 [2018-04-10 14:26:07,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 2 new quantified variables, introduced 0 case distinctions, treesize of input 56 treesize of output 52 [2018-04-10 14:26:07,437 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 11 [2018-04-10 14:26:07,437 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-10 14:26:07,442 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-10 14:26:07,454 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 27 treesize of output 28 [2018-04-10 14:26:07,455 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select 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:26:07,456 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-04-10 14:26:07,459 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-10 14:26:07,465 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:26:07,465 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 3 variables, input treesize:63, output treesize:47 [2018-04-10 14:26:07,528 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 47 treesize of output 33 [2018-04-10 14:26:07,530 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 1 [2018-04-10 14:26:07,530 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-10 14:26:07,536 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 28 treesize of output 17 [2018-04-10 14:26:07,536 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-04-10 14:26:07,540 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-10 14:26:07,547 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 22 treesize of output 20 [2018-04-10 14:26:07,549 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 3 [2018-04-10 14:26:07,549 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2018-04-10 14:26:07,553 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 1 [2018-04-10 14:26:07,553 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2018-04-10 14:26:07,554 INFO L267 ElimStorePlain]: Start of recursive call 5: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-10 14:26:07,557 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:26:07,557 INFO L202 ElimStorePlain]: Needed 7 recursive calls to eliminate 5 variables, input treesize:61, output treesize:9 [2018-04-10 14:26:07,568 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:26:07,587 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-04-10 14:26:07,587 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10] total 15 [2018-04-10 14:26:07,588 INFO L442 AbstractCegarLoop]: Interpolant automaton has 16 states [2018-04-10 14:26:07,588 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2018-04-10 14:26:07,588 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=42, Invalid=198, Unknown=0, NotChecked=0, Total=240 [2018-04-10 14:26:07,588 INFO L87 Difference]: Start difference. First operand 182 states and 203 transitions. Second operand 16 states. [2018-04-10 14:26:08,127 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-10 14:26:08,128 INFO L93 Difference]: Finished difference Result 277 states and 306 transitions. [2018-04-10 14:26:08,128 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2018-04-10 14:26:08,128 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 36 [2018-04-10 14:26:08,128 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-10 14:26:08,129 INFO L225 Difference]: With dead ends: 277 [2018-04-10 14:26:08,129 INFO L226 Difference]: Without dead ends: 277 [2018-04-10 14:26:08,129 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 56 GetRequests, 28 SyntacticMatches, 4 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 108 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=134, Invalid=516, Unknown=0, NotChecked=0, Total=650 [2018-04-10 14:26:08,130 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 277 states. [2018-04-10 14:26:08,132 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 277 to 182. [2018-04-10 14:26:08,132 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 182 states. [2018-04-10 14:26:08,133 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 182 states to 182 states and 202 transitions. [2018-04-10 14:26:08,133 INFO L78 Accepts]: Start accepts. Automaton has 182 states and 202 transitions. Word has length 36 [2018-04-10 14:26:08,133 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-10 14:26:08,133 INFO L459 AbstractCegarLoop]: Abstraction has 182 states and 202 transitions. [2018-04-10 14:26:08,133 INFO L460 AbstractCegarLoop]: Interpolant automaton has 16 states. [2018-04-10 14:26:08,134 INFO L276 IsEmpty]: Start isEmpty. Operand 182 states and 202 transitions. [2018-04-10 14:26:08,134 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2018-04-10 14:26:08,134 INFO L347 BasicCegarLoop]: Found error trace [2018-04-10 14:26:08,134 INFO L355 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-10 14:26:08,134 INFO L408 AbstractCegarLoop]: === Iteration 15 === [mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr31RequiresViolation, mainErr46RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr15RequiresViolation, mainErr49RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr17RequiresViolation, mainErr42RequiresViolation, mainErr30RequiresViolation, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr44RequiresViolation, mainErr10RequiresViolation, mainErr43RequiresViolation, mainErr4RequiresViolation, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr51AssertViolationMEMORY_FREE, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr48RequiresViolation, mainErr52EnsuresViolationMEMORY_LEAK, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr45RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr9RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr50AssertViolationMEMORY_FREE, mainErr8RequiresViolation, mainErr34RequiresViolation, mainErr47RequiresViolation, mainErr14RequiresViolation, mainErr40RequiresViolation]=== [2018-04-10 14:26:08,135 INFO L82 PathProgramCache]: Analyzing trace with hash -991108664, now seen corresponding path program 1 times [2018-04-10 14:26:08,135 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-04-10 14:26:08,135 INFO L68 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-04-10 14:26:08,136 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-10 14:26:08,136 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-10 14:26:08,136 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-10 14:26:08,142 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-10 14:26:08,143 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-10 14:26:08,178 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:26:08,178 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-04-10 14:26:08,179 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-04-10 14:26:08,179 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-04-10 14:26:08,179 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-04-10 14:26:08,179 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-04-10 14:26:08,179 INFO L87 Difference]: Start difference. First operand 182 states and 202 transitions. Second operand 5 states. [2018-04-10 14:26:08,248 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-10 14:26:08,248 INFO L93 Difference]: Finished difference Result 216 states and 238 transitions. [2018-04-10 14:26:08,248 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-04-10 14:26:08,248 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 38 [2018-04-10 14:26:08,248 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-10 14:26:08,249 INFO L225 Difference]: With dead ends: 216 [2018-04-10 14:26:08,249 INFO L226 Difference]: Without dead ends: 216 [2018-04-10 14:26:08,249 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:26:08,249 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 216 states. [2018-04-10 14:26:08,251 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 216 to 182. [2018-04-10 14:26:08,251 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 182 states. [2018-04-10 14:26:08,252 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 182 states to 182 states and 201 transitions. [2018-04-10 14:26:08,252 INFO L78 Accepts]: Start accepts. Automaton has 182 states and 201 transitions. Word has length 38 [2018-04-10 14:26:08,252 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-10 14:26:08,252 INFO L459 AbstractCegarLoop]: Abstraction has 182 states and 201 transitions. [2018-04-10 14:26:08,252 INFO L460 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-04-10 14:26:08,252 INFO L276 IsEmpty]: Start isEmpty. Operand 182 states and 201 transitions. [2018-04-10 14:26:08,253 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2018-04-10 14:26:08,253 INFO L347 BasicCegarLoop]: Found error trace [2018-04-10 14:26:08,253 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] [2018-04-10 14:26:08,253 INFO L408 AbstractCegarLoop]: === Iteration 16 === [mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr31RequiresViolation, mainErr46RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr15RequiresViolation, mainErr49RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr17RequiresViolation, mainErr42RequiresViolation, mainErr30RequiresViolation, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr44RequiresViolation, mainErr10RequiresViolation, mainErr43RequiresViolation, mainErr4RequiresViolation, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr51AssertViolationMEMORY_FREE, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr48RequiresViolation, mainErr52EnsuresViolationMEMORY_LEAK, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr45RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr9RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr50AssertViolationMEMORY_FREE, mainErr8RequiresViolation, mainErr34RequiresViolation, mainErr47RequiresViolation, mainErr14RequiresViolation, mainErr40RequiresViolation]=== [2018-04-10 14:26:08,253 INFO L82 PathProgramCache]: Analyzing trace with hash -559589853, now seen corresponding path program 1 times [2018-04-10 14:26:08,253 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-04-10 14:26:08,253 INFO L68 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-04-10 14:26:08,254 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-10 14:26:08,254 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-10 14:26:08,255 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-10 14:26:08,263 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-10 14:26:08,264 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-10 14:26:08,393 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:26:08,393 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-04-10 14:26:08,393 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:26:08,411 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-10 14:26:08,426 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-10 14:26:08,428 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-10 14:26:08,439 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 14:26:08,440 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 14:26:08,440 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:26:08,441 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-10 14:26:08,447 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-10 14:26:08,447 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:23, output treesize:21 [2018-04-10 14:26:08,464 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:26:08,466 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:26:08,466 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-10 14:26:08,467 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-10 14:26:08,473 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:26:08,473 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:32, output treesize:29 [2018-04-10 14:26:08,519 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 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:26:08,520 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 11 [2018-04-10 14:26:08,520 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-10 14:26:08,524 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-10 14:26:08,528 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:26:08,529 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:42, output treesize:34 [2018-04-10 14:26:08,568 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 36 treesize of output 24 [2018-04-10 14:26:08,569 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select 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:26:08,570 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-10 14:26:08,573 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:26:08,574 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-04-10 14:26:08,576 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-10 14:26:08,579 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-04-10 14:26:08,579 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 4 variables, input treesize:41, output treesize:15 [2018-04-10 14:26:08,631 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:26:08,649 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-04-10 14:26:08,650 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 12] total 22 [2018-04-10 14:26:08,650 INFO L442 AbstractCegarLoop]: Interpolant automaton has 23 states [2018-04-10 14:26:08,650 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2018-04-10 14:26:08,650 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=76, Invalid=430, Unknown=0, NotChecked=0, Total=506 [2018-04-10 14:26:08,650 INFO L87 Difference]: Start difference. First operand 182 states and 201 transitions. Second operand 23 states. [2018-04-10 14:26:09,333 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-10 14:26:09,334 INFO L93 Difference]: Finished difference Result 278 states and 303 transitions. [2018-04-10 14:26:09,334 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2018-04-10 14:26:09,334 INFO L78 Accepts]: Start accepts. Automaton has 23 states. Word has length 41 [2018-04-10 14:26:09,334 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-10 14:26:09,335 INFO L225 Difference]: With dead ends: 278 [2018-04-10 14:26:09,335 INFO L226 Difference]: Without dead ends: 278 [2018-04-10 14:26:09,335 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 66 GetRequests, 31 SyntacticMatches, 2 SemanticMatches, 33 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 193 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=231, Invalid=959, Unknown=0, NotChecked=0, Total=1190 [2018-04-10 14:26:09,335 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 278 states. [2018-04-10 14:26:09,337 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 278 to 216. [2018-04-10 14:26:09,337 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 216 states. [2018-04-10 14:26:09,337 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 216 states to 216 states and 240 transitions. [2018-04-10 14:26:09,337 INFO L78 Accepts]: Start accepts. Automaton has 216 states and 240 transitions. Word has length 41 [2018-04-10 14:26:09,338 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-10 14:26:09,338 INFO L459 AbstractCegarLoop]: Abstraction has 216 states and 240 transitions. [2018-04-10 14:26:09,338 INFO L460 AbstractCegarLoop]: Interpolant automaton has 23 states. [2018-04-10 14:26:09,338 INFO L276 IsEmpty]: Start isEmpty. Operand 216 states and 240 transitions. [2018-04-10 14:26:09,338 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2018-04-10 14:26:09,338 INFO L347 BasicCegarLoop]: Found error trace [2018-04-10 14:26:09,338 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] [2018-04-10 14:26:09,338 INFO L408 AbstractCegarLoop]: === Iteration 17 === [mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr31RequiresViolation, mainErr46RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr15RequiresViolation, mainErr49RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr17RequiresViolation, mainErr42RequiresViolation, mainErr30RequiresViolation, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr44RequiresViolation, mainErr10RequiresViolation, mainErr43RequiresViolation, mainErr4RequiresViolation, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr51AssertViolationMEMORY_FREE, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr48RequiresViolation, mainErr52EnsuresViolationMEMORY_LEAK, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr45RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr9RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr50AssertViolationMEMORY_FREE, mainErr8RequiresViolation, mainErr34RequiresViolation, mainErr47RequiresViolation, mainErr14RequiresViolation, mainErr40RequiresViolation]=== [2018-04-10 14:26:09,338 INFO L82 PathProgramCache]: Analyzing trace with hash -559589852, now seen corresponding path program 1 times [2018-04-10 14:26:09,338 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-04-10 14:26:09,338 INFO L68 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-04-10 14:26:09,339 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-10 14:26:09,339 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-10 14:26:09,339 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-10 14:26:09,345 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-10 14:26:09,346 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-10 14:26:09,516 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:26:09,516 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-04-10 14:26:09,516 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:26:09,528 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-10 14:26:09,540 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-10 14:26:09,542 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-10 14:26:09,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 6 treesize of output 5 [2018-04-10 14:26:09,548 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-10 14:26:09,554 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 14:26:09,554 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 14:26:09,555 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:26:09,555 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-10 14:26:09,559 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-10 14:26:09,559 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:26, output treesize:19 [2018-04-10 14:26:09,564 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:26:09,565 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select 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:26:09,565 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-10 14:26:09,566 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-10 14:26:09,573 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 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:26:09,574 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 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:26:09,574 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-04-10 14:26:09,575 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-10 14:26:09,580 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:26:09,581 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 3 variables, input treesize:38, output treesize:31 [2018-04-10 14:26:09,623 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 27 treesize of output 28 [2018-04-10 14:26:09,624 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select 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:26:09,625 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-10 14:26:09,628 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-10 14:26:09,636 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 48 treesize of output 44 [2018-04-10 14:26:09,637 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 11 [2018-04-10 14:26:09,637 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-04-10 14:26:09,641 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-10 14:26:09,646 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:26:09,646 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 3 variables, input treesize:63, output treesize:47 [2018-04-10 14:26:09,692 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 47 treesize of output 33 [2018-04-10 14:26:09,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, 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 17 [2018-04-10 14:26:09,694 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-10 14:26:09,702 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select 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:26:09,702 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-04-10 14:26:09,706 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-10 14:26:09,712 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 22 treesize of output 20 [2018-04-10 14:26:09,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 11 treesize of output 3 [2018-04-10 14:26:09,715 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2018-04-10 14:26:09,719 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select 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:26:09,719 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2018-04-10 14:26:09,720 INFO L267 ElimStorePlain]: Start of recursive call 5: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-10 14:26:09,723 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:26:09,723 INFO L202 ElimStorePlain]: Needed 7 recursive calls to eliminate 5 variables, input treesize:61, output treesize:9 [2018-04-10 14:26:09,755 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:26:09,778 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-04-10 14:26:09,778 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 12] total 19 [2018-04-10 14:26:09,778 INFO L442 AbstractCegarLoop]: Interpolant automaton has 20 states [2018-04-10 14:26:09,779 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2018-04-10 14:26:09,779 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=52, Invalid=328, Unknown=0, NotChecked=0, Total=380 [2018-04-10 14:26:09,779 INFO L87 Difference]: Start difference. First operand 216 states and 240 transitions. Second operand 20 states. [2018-04-10 14:26:10,489 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-10 14:26:10,489 INFO L93 Difference]: Finished difference Result 274 states and 301 transitions. [2018-04-10 14:26:10,489 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2018-04-10 14:26:10,489 INFO L78 Accepts]: Start accepts. Automaton has 20 states. Word has length 41 [2018-04-10 14:26:10,490 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-10 14:26:10,490 INFO L225 Difference]: With dead ends: 274 [2018-04-10 14:26:10,490 INFO L226 Difference]: Without dead ends: 274 [2018-04-10 14:26:10,491 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 67 GetRequests, 32 SyntacticMatches, 6 SemanticMatches, 29 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 157 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=146, Invalid=784, Unknown=0, NotChecked=0, Total=930 [2018-04-10 14:26:10,491 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 274 states. [2018-04-10 14:26:10,492 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 274 to 215. [2018-04-10 14:26:10,492 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 215 states. [2018-04-10 14:26:10,493 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 215 states to 215 states and 238 transitions. [2018-04-10 14:26:10,493 INFO L78 Accepts]: Start accepts. Automaton has 215 states and 238 transitions. Word has length 41 [2018-04-10 14:26:10,493 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-10 14:26:10,493 INFO L459 AbstractCegarLoop]: Abstraction has 215 states and 238 transitions. [2018-04-10 14:26:10,493 INFO L460 AbstractCegarLoop]: Interpolant automaton has 20 states. [2018-04-10 14:26:10,493 INFO L276 IsEmpty]: Start isEmpty. Operand 215 states and 238 transitions. [2018-04-10 14:26:10,493 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2018-04-10 14:26:10,493 INFO L347 BasicCegarLoop]: Found error trace [2018-04-10 14:26:10,493 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] [2018-04-10 14:26:10,494 INFO L408 AbstractCegarLoop]: === Iteration 18 === [mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr31RequiresViolation, mainErr46RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr15RequiresViolation, mainErr49RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr17RequiresViolation, mainErr42RequiresViolation, mainErr30RequiresViolation, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr44RequiresViolation, mainErr10RequiresViolation, mainErr43RequiresViolation, mainErr4RequiresViolation, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr51AssertViolationMEMORY_FREE, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr48RequiresViolation, mainErr52EnsuresViolationMEMORY_LEAK, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr45RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr9RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr50AssertViolationMEMORY_FREE, mainErr8RequiresViolation, mainErr34RequiresViolation, mainErr47RequiresViolation, mainErr14RequiresViolation, mainErr40RequiresViolation]=== [2018-04-10 14:26:10,494 INFO L82 PathProgramCache]: Analyzing trace with hash -1974624012, now seen corresponding path program 1 times [2018-04-10 14:26:10,494 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-04-10 14:26:10,494 INFO L68 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-04-10 14:26:10,494 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-10 14:26:10,494 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-10 14:26:10,494 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-10 14:26:10,500 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-10 14:26:10,500 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-10 14:26:10,529 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:26:10,529 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-04-10 14:26:10,529 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:26:10,535 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-10 14:26:10,553 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-10 14:26:10,556 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-10 14:26:10,565 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:26:10,591 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-04-10 14:26:10,591 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 5] total 6 [2018-04-10 14:26:10,591 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-04-10 14:26:10,591 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-04-10 14:26:10,591 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2018-04-10 14:26:10,591 INFO L87 Difference]: Start difference. First operand 215 states and 238 transitions. Second operand 7 states. [2018-04-10 14:26:10,770 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-10 14:26:10,770 INFO L93 Difference]: Finished difference Result 267 states and 292 transitions. [2018-04-10 14:26:10,770 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-04-10 14:26:10,770 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 44 [2018-04-10 14:26:10,770 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-10 14:26:10,771 INFO L225 Difference]: With dead ends: 267 [2018-04-10 14:26:10,771 INFO L226 Difference]: Without dead ends: 267 [2018-04-10 14:26:10,771 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 55 GetRequests, 44 SyntacticMatches, 2 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 13 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=40, Invalid=70, Unknown=0, NotChecked=0, Total=110 [2018-04-10 14:26:10,772 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 267 states. [2018-04-10 14:26:10,774 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 267 to 220. [2018-04-10 14:26:10,774 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 220 states. [2018-04-10 14:26:10,775 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 220 states to 220 states and 247 transitions. [2018-04-10 14:26:10,775 INFO L78 Accepts]: Start accepts. Automaton has 220 states and 247 transitions. Word has length 44 [2018-04-10 14:26:10,776 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-10 14:26:10,776 INFO L459 AbstractCegarLoop]: Abstraction has 220 states and 247 transitions. [2018-04-10 14:26:10,776 INFO L460 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-04-10 14:26:10,776 INFO L276 IsEmpty]: Start isEmpty. Operand 220 states and 247 transitions. [2018-04-10 14:26:10,776 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2018-04-10 14:26:10,776 INFO L347 BasicCegarLoop]: Found error trace [2018-04-10 14:26:10,777 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] [2018-04-10 14:26:10,777 INFO L408 AbstractCegarLoop]: === Iteration 19 === [mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr31RequiresViolation, mainErr46RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr15RequiresViolation, mainErr49RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr17RequiresViolation, mainErr42RequiresViolation, mainErr30RequiresViolation, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr44RequiresViolation, mainErr10RequiresViolation, mainErr43RequiresViolation, mainErr4RequiresViolation, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr51AssertViolationMEMORY_FREE, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr48RequiresViolation, mainErr52EnsuresViolationMEMORY_LEAK, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr45RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr9RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr50AssertViolationMEMORY_FREE, mainErr8RequiresViolation, mainErr34RequiresViolation, mainErr47RequiresViolation, mainErr14RequiresViolation, mainErr40RequiresViolation]=== [2018-04-10 14:26:10,777 INFO L82 PathProgramCache]: Analyzing trace with hash -1974624011, now seen corresponding path program 1 times [2018-04-10 14:26:10,777 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-04-10 14:26:10,777 INFO L68 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-04-10 14:26:10,778 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-10 14:26:10,778 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-10 14:26:10,778 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-10 14:26:10,786 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-10 14:26:10,786 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-10 14:26:10,906 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:26:10,906 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-04-10 14:26:10,906 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:26:10,912 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-10 14:26:10,924 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-10 14:26:10,926 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-10 14:26:10,931 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 14:26:10,931 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 14:26:10,932 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 4 [2018-04-10 14:26:10,932 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-10 14:26:10,934 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-10 14:26:10,934 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:21, output treesize:15 [2018-04-10 14:26:10,938 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:26:10,939 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 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:26:10,940 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-10 14:26:10,940 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-10 14:26:10,944 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:26:10,945 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:26, output treesize:23 [2018-04-10 14:26:10,977 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 32 [2018-04-10 14:26:10,978 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select 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:26:10,978 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-10 14:26:10,980 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-10 14:26:10,983 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:26:10,983 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:36, output treesize:28 [2018-04-10 14:26:11,013 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 35 treesize of output 23 [2018-04-10 14:26:11,014 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 18 treesize of output 9 [2018-04-10 14:26:11,014 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-10 14:26:11,018 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select 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:26:11,018 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-04-10 14:26:11,019 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-10 14:26:11,021 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-04-10 14:26:11,021 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 4 variables, input treesize:35, output treesize:4 [2018-04-10 14:26:11,039 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:26:11,057 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-04-10 14:26:11,057 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 13] total 20 [2018-04-10 14:26:11,057 INFO L442 AbstractCegarLoop]: Interpolant automaton has 20 states [2018-04-10 14:26:11,058 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2018-04-10 14:26:11,058 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=55, Invalid=325, Unknown=0, NotChecked=0, Total=380 [2018-04-10 14:26:11,058 INFO L87 Difference]: Start difference. First operand 220 states and 247 transitions. Second operand 20 states. [2018-04-10 14:26:11,428 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-10 14:26:11,428 INFO L93 Difference]: Finished difference Result 236 states and 262 transitions. [2018-04-10 14:26:11,428 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2018-04-10 14:26:11,428 INFO L78 Accepts]: Start accepts. Automaton has 20 states. Word has length 44 [2018-04-10 14:26:11,429 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-10 14:26:11,429 INFO L225 Difference]: With dead ends: 236 [2018-04-10 14:26:11,429 INFO L226 Difference]: Without dead ends: 236 [2018-04-10 14:26:11,430 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 69 GetRequests, 35 SyntacticMatches, 5 SemanticMatches, 29 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 184 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=153, Invalid=777, Unknown=0, NotChecked=0, Total=930 [2018-04-10 14:26:11,430 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 236 states. [2018-04-10 14:26:11,432 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 236 to 218. [2018-04-10 14:26:11,432 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 218 states. [2018-04-10 14:26:11,433 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 218 states to 218 states and 244 transitions. [2018-04-10 14:26:11,433 INFO L78 Accepts]: Start accepts. Automaton has 218 states and 244 transitions. Word has length 44 [2018-04-10 14:26:11,433 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-10 14:26:11,433 INFO L459 AbstractCegarLoop]: Abstraction has 218 states and 244 transitions. [2018-04-10 14:26:11,433 INFO L460 AbstractCegarLoop]: Interpolant automaton has 20 states. [2018-04-10 14:26:11,433 INFO L276 IsEmpty]: Start isEmpty. Operand 218 states and 244 transitions. [2018-04-10 14:26:11,434 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2018-04-10 14:26:11,434 INFO L347 BasicCegarLoop]: Found error trace [2018-04-10 14:26:11,434 INFO L355 BasicCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-10 14:26:11,434 INFO L408 AbstractCegarLoop]: === Iteration 20 === [mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr31RequiresViolation, mainErr46RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr15RequiresViolation, mainErr49RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr17RequiresViolation, mainErr42RequiresViolation, mainErr30RequiresViolation, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr44RequiresViolation, mainErr10RequiresViolation, mainErr43RequiresViolation, mainErr4RequiresViolation, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr51AssertViolationMEMORY_FREE, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr48RequiresViolation, mainErr52EnsuresViolationMEMORY_LEAK, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr45RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr9RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr50AssertViolationMEMORY_FREE, mainErr8RequiresViolation, mainErr34RequiresViolation, mainErr47RequiresViolation, mainErr14RequiresViolation, mainErr40RequiresViolation]=== [2018-04-10 14:26:11,434 INFO L82 PathProgramCache]: Analyzing trace with hash 1961203411, now seen corresponding path program 2 times [2018-04-10 14:26:11,434 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-04-10 14:26:11,434 INFO L68 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-04-10 14:26:11,435 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-10 14:26:11,435 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-10 14:26:11,435 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-10 14:26:11,444 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-10 14:26:11,445 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-10 14:26:11,557 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 0 proven. 17 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-10 14:26:11,557 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-04-10 14:26:11,557 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:26:11,562 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-04-10 14:26:11,576 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-04-10 14:26:11,576 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-04-10 14:26:11,578 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-10 14:26:11,622 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 14:26:11,623 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 14:26:11,623 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:26:11,623 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-10 14:26:11,626 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-10 14:26:11,626 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:20, output treesize:14 [2018-04-10 14:26:11,640 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 8 [2018-04-10 14:26:11,641 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:26:11,641 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-10 14:26:11,642 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-10 14:26:11,647 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:26:11,648 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:30, output treesize:23 [2018-04-10 14:26:11,696 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 14:26:11,698 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 27 treesize of output 28 [2018-04-10 14:26:11,700 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select 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:26:11,700 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-10 14:26:11,703 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-10 14:26:11,707 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-04-10 14:26:11,707 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:35, output treesize:27 [2018-04-10 14:26:11,727 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 14:26:11,727 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 14:26:11,728 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 4 [2018-04-10 14:26:11,728 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-10 14:26:11,734 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-10 14:26:11,734 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:32, output treesize:26 [2018-04-10 14:26:11,756 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 25 [2018-04-10 14:26:11,757 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 7 [2018-04-10 14:26:11,758 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-10 14:26:11,760 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-10 14:26:11,766 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:26:11,766 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:42, output treesize:28 [2018-04-10 14:26:11,833 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 4 new quantified variables, introduced 3 case distinctions, treesize of input 57 treesize of output 61 [2018-04-10 14:26:11,835 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 62 treesize of output 61 [2018-04-10 14:26:11,836 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-10 14:26:11,855 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 37 treesize of output 48 [2018-04-10 14:26:11,855 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 2 xjuncts. [2018-04-10 14:26:11,866 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-04-10 14:26:11,881 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: 3 dim-0 vars, and 2 xjuncts. [2018-04-10 14:26:11,881 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 3 variables, input treesize:60, output treesize:81 [2018-04-10 14:26:12,014 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 42 treesize of output 35 [2018-04-10 14:26:12,018 INFO L682 Elim1Store]: detected equality via solver [2018-04-10 14:26:12,019 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 13 [2018-04-10 14:26:12,019 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-10 14:26:12,025 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select 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:26:12,025 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-04-10 14:26:12,028 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-10 14:26:12,044 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 5 new quantified variables, introduced 1 case distinctions, treesize of input 58 treesize of output 54 [2018-04-10 14:26:12,046 INFO L682 Elim1Store]: detected equality via solver [2018-04-10 14:26:12,046 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 30 [2018-04-10 14:26:12,046 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2018-04-10 14:26:12,060 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 44 treesize of output 39 [2018-04-10 14:26:12,060 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2018-04-10 14:26:12,108 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 24 treesize of output 25 [2018-04-10 14:26:12,109 INFO L267 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 2 xjuncts. [2018-04-10 14:26:12,137 INFO L682 Elim1Store]: detected equality via solver [2018-04-10 14:26:12,137 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 39 treesize of output 31 [2018-04-10 14:26:12,137 INFO L267 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 1 xjuncts. [2018-04-10 14:26:12,150 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 25 treesize of output 21 [2018-04-10 14:26:12,150 INFO L267 ElimStorePlain]: Start of recursive call 10: End of recursive call: and 1 xjuncts. [2018-04-10 14:26:12,156 INFO L267 ElimStorePlain]: Start of recursive call 5: 5 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-10 14:26:12,162 INFO L267 ElimStorePlain]: Start of recursive call 1: 7 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-04-10 14:26:12,162 INFO L202 ElimStorePlain]: Needed 10 recursive calls to eliminate 9 variables, input treesize:101, output treesize:5 [2018-04-10 14:26:12,168 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 0 proven. 17 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-10 14:26:12,186 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-04-10 14:26:12,186 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 19] total 31 [2018-04-10 14:26:12,187 INFO L442 AbstractCegarLoop]: Interpolant automaton has 32 states [2018-04-10 14:26:12,187 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 32 interpolants. [2018-04-10 14:26:12,187 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=118, Invalid=874, Unknown=0, NotChecked=0, Total=992 [2018-04-10 14:26:12,187 INFO L87 Difference]: Start difference. First operand 218 states and 244 transitions. Second operand 32 states. [2018-04-10 14:26:13,446 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-10 14:26:13,446 INFO L93 Difference]: Finished difference Result 350 states and 383 transitions. [2018-04-10 14:26:13,446 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2018-04-10 14:26:13,446 INFO L78 Accepts]: Start accepts. Automaton has 32 states. Word has length 44 [2018-04-10 14:26:13,447 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-10 14:26:13,447 INFO L225 Difference]: With dead ends: 350 [2018-04-10 14:26:13,447 INFO L226 Difference]: Without dead ends: 350 [2018-04-10 14:26:13,448 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 84 GetRequests, 30 SyntacticMatches, 1 SemanticMatches, 53 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 652 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=499, Invalid=2470, Unknown=1, NotChecked=0, Total=2970 [2018-04-10 14:26:13,448 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 350 states. [2018-04-10 14:26:13,449 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 350 to 240. [2018-04-10 14:26:13,449 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 240 states. [2018-04-10 14:26:13,450 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 240 states to 240 states and 270 transitions. [2018-04-10 14:26:13,450 INFO L78 Accepts]: Start accepts. Automaton has 240 states and 270 transitions. Word has length 44 [2018-04-10 14:26:13,450 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-10 14:26:13,450 INFO L459 AbstractCegarLoop]: Abstraction has 240 states and 270 transitions. [2018-04-10 14:26:13,450 INFO L460 AbstractCegarLoop]: Interpolant automaton has 32 states. [2018-04-10 14:26:13,450 INFO L276 IsEmpty]: Start isEmpty. Operand 240 states and 270 transitions. [2018-04-10 14:26:13,450 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2018-04-10 14:26:13,450 INFO L347 BasicCegarLoop]: Found error trace [2018-04-10 14:26:13,450 INFO L355 BasicCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-10 14:26:13,451 INFO L408 AbstractCegarLoop]: === Iteration 21 === [mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr31RequiresViolation, mainErr46RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr15RequiresViolation, mainErr49RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr17RequiresViolation, mainErr42RequiresViolation, mainErr30RequiresViolation, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr44RequiresViolation, mainErr10RequiresViolation, mainErr43RequiresViolation, mainErr4RequiresViolation, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr51AssertViolationMEMORY_FREE, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr48RequiresViolation, mainErr52EnsuresViolationMEMORY_LEAK, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr45RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr9RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr50AssertViolationMEMORY_FREE, mainErr8RequiresViolation, mainErr34RequiresViolation, mainErr47RequiresViolation, mainErr14RequiresViolation, mainErr40RequiresViolation]=== [2018-04-10 14:26:13,451 INFO L82 PathProgramCache]: Analyzing trace with hash 1961203412, now seen corresponding path program 2 times [2018-04-10 14:26:13,451 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-04-10 14:26:13,451 INFO L68 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-04-10 14:26:13,451 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-10 14:26:13,451 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-04-10 14:26:13,451 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-10 14:26:13,457 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-10 14:26:13,457 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-10 14:26:13,619 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 0 proven. 17 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-10 14:26:13,619 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-04-10 14:26:13,619 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:26:13,624 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-04-10 14:26:13,639 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-04-10 14:26:13,639 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-04-10 14:26:13,641 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-10 14:26:13,682 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 14:26:13,683 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 14:26:13,683 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:26:13,683 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-10 14:26:13,687 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-10 14:26:13,687 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:23, output treesize:17 [2018-04-10 14:26:13,706 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 8 [2018-04-10 14:26:13,710 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-04-10 14:26:13,710 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-10 14:26:13,711 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-10 14:26:13,719 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 8 [2018-04-10 14:26:13,720 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 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:26:13,720 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-04-10 14:26:13,721 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-10 14:26:13,734 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:26:13,734 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 3 variables, input treesize:41, output treesize:30 [2018-04-10 14:26:13,812 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 14:26:13,815 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 19 treesize of output 24 [2018-04-10 14:26:13,817 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select 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:26:13,817 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-10 14:26:13,821 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-10 14:26:13,832 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 14:26:13,834 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:26:13,836 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select 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:26:13,836 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-04-10 14:26:13,840 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-10 14:26:13,848 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-04-10 14:26:13,848 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 2 variables, input treesize:56, output treesize:48 [2018-04-10 14:26:13,883 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 14:26:13,884 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 14:26:13,884 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 4 [2018-04-10 14:26:13,884 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-10 14:26:13,892 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-10 14:26:13,893 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:53, output treesize:47 [2018-04-10 14:26:13,944 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 36 [2018-04-10 14:26:13,949 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 18 treesize of output 11 [2018-04-10 14:26:13,949 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-10 14:26:13,954 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-10 14:26:13,972 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 37 treesize of output 36 [2018-04-10 14:26:13,975 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 7 [2018-04-10 14:26:13,975 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-04-10 14:26:13,979 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-10 14:26:13,996 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:26:13,996 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 4 variables, input treesize:76, output treesize:40 [2018-04-10 14:26:14,112 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 35 treesize of output 36 [2018-04-10 14:26:14,114 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 15 [2018-04-10 14:26:14,114 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-10 14:26:14,118 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-10 14:26:14,144 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 4 new quantified variables, introduced 3 case distinctions, treesize of input 74 treesize of output 72 [2018-04-10 14:26:14,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 79 treesize of output 78 [2018-04-10 14:26:14,156 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-04-10 14:26:14,188 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 48 treesize of output 61 [2018-04-10 14:26:14,188 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 2 xjuncts. [2018-04-10 14:26:14,207 INFO L267 ElimStorePlain]: Start of recursive call 4: 2 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-04-10 14:26:14,225 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-2 vars, End of recursive call: 3 dim-0 vars, and 2 xjuncts. [2018-04-10 14:26:14,226 INFO L202 ElimStorePlain]: Needed 6 recursive calls to eliminate 4 variables, input treesize:99, output treesize:131 [2018-04-10 14:26:14,493 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 5 new quantified variables, introduced 1 case distinctions, treesize of input 92 treesize of output 82 [2018-04-10 14:26:14,497 INFO L682 Elim1Store]: detected equality via solver [2018-04-10 14:26:14,497 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 72 treesize of output 64 [2018-04-10 14:26:14,498 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-10 14:26:14,532 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 64 treesize of output 63 [2018-04-10 14:26:14,533 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 2 xjuncts. [2018-04-10 14:26:14,574 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 58 treesize of output 53 [2018-04-10 14:26:14,574 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-04-10 14:26:14,618 INFO L682 Elim1Store]: detected equality via solver [2018-04-10 14:26:14,619 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 55 treesize of output 49 [2018-04-10 14:26:14,619 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2018-04-10 14:26:14,620 INFO L682 Elim1Store]: detected equality via solver [2018-04-10 14:26:14,621 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 59 treesize of output 53 [2018-04-10 14:26:14,621 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2018-04-10 14:26:14,674 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 53 treesize of output 47 [2018-04-10 14:26:14,675 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:26:14,710 INFO L267 ElimStorePlain]: Start of recursive call 2: 5 dim-1 vars, End of recursive call: 2 dim-0 vars, and 3 xjuncts. [2018-04-10 14:26:14,822 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 47 treesize of output 41 [2018-04-10 14:26:14,825 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2018-04-10 14:26:14,825 INFO L267 ElimStorePlain]: Start of recursive call 10: End of recursive call: and 1 xjuncts. [2018-04-10 14:26:14,834 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select 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:26:14,835 INFO L267 ElimStorePlain]: Start of recursive call 11: End of recursive call: and 1 xjuncts. [2018-04-10 14:26:14,841 INFO L267 ElimStorePlain]: Start of recursive call 9: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-10 14:26:14,843 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 47 treesize of output 41 [2018-04-10 14:26:14,845 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 1 [2018-04-10 14:26:14,845 INFO L267 ElimStorePlain]: Start of recursive call 13: End of recursive call: and 1 xjuncts. [2018-04-10 14:26:14,853 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2018-04-10 14:26:14,853 INFO L267 ElimStorePlain]: Start of recursive call 14: End of recursive call: and 1 xjuncts. [2018-04-10 14:26:14,859 INFO L267 ElimStorePlain]: Start of recursive call 12: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-10 14:26:14,860 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 43 treesize of output 37 [2018-04-10 14:26:14,862 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2018-04-10 14:26:14,863 INFO L267 ElimStorePlain]: Start of recursive call 16: End of recursive call: and 1 xjuncts. [2018-04-10 14:26:14,869 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 1 [2018-04-10 14:26:14,870 INFO L267 ElimStorePlain]: Start of recursive call 17: End of recursive call: and 1 xjuncts. [2018-04-10 14:26:14,874 INFO L267 ElimStorePlain]: Start of recursive call 15: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-10 14:26:14,909 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 72 treesize of output 62 [2018-04-10 14:26:14,911 INFO L682 Elim1Store]: detected equality via solver [2018-04-10 14:26:14,911 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2018-04-10 14:26:14,911 INFO L267 ElimStorePlain]: Start of recursive call 19: End of recursive call: and 1 xjuncts. [2018-04-10 14:26:14,920 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 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:26:14,920 INFO L267 ElimStorePlain]: Start of recursive call 20: End of recursive call: and 1 xjuncts. [2018-04-10 14:26:14,927 INFO L267 ElimStorePlain]: Start of recursive call 18: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-10 14:26:14,957 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 47 treesize of output 40 [2018-04-10 14:26:14,958 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 15 [2018-04-10 14:26:14,958 INFO L267 ElimStorePlain]: Start of recursive call 22: End of recursive call: and 1 xjuncts. [2018-04-10 14:26:14,964 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select 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:26:14,964 INFO L267 ElimStorePlain]: Start of recursive call 23: End of recursive call: and 1 xjuncts. [2018-04-10 14:26:14,968 INFO L267 ElimStorePlain]: Start of recursive call 21: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-10 14:26:14,991 INFO L267 ElimStorePlain]: Start of recursive call 1: 7 dim-0 vars, 4 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-04-10 14:26:14,991 INFO L202 ElimStorePlain]: Needed 23 recursive calls to eliminate 11 variables, input treesize:165, output treesize:9 [2018-04-10 14:26:15,035 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 0 proven. 17 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-10 14:26:15,053 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-04-10 14:26:15,053 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 19] total 33 [2018-04-10 14:26:15,111 INFO L442 AbstractCegarLoop]: Interpolant automaton has 34 states [2018-04-10 14:26:15,112 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 34 interpolants. [2018-04-10 14:26:15,112 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=111, Invalid=1010, Unknown=1, NotChecked=0, Total=1122 [2018-04-10 14:26:15,112 INFO L87 Difference]: Start difference. First operand 240 states and 270 transitions. Second operand 34 states. [2018-04-10 14:26:17,219 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-10 14:26:17,219 INFO L93 Difference]: Finished difference Result 366 states and 403 transitions. [2018-04-10 14:26:17,219 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2018-04-10 14:26:17,219 INFO L78 Accepts]: Start accepts. Automaton has 34 states. Word has length 44 [2018-04-10 14:26:17,220 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-10 14:26:17,220 INFO L225 Difference]: With dead ends: 366 [2018-04-10 14:26:17,220 INFO L226 Difference]: Without dead ends: 366 [2018-04-10 14:26:17,221 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 83 GetRequests, 28 SyntacticMatches, 1 SemanticMatches, 54 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 528 ImplicationChecksByTransitivity, 1.7s TimeCoverageRelationStatistics Valid=462, Invalid=2615, Unknown=3, NotChecked=0, Total=3080 [2018-04-10 14:26:17,221 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 366 states. [2018-04-10 14:26:17,223 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 366 to 233. [2018-04-10 14:26:17,223 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 233 states. [2018-04-10 14:26:17,223 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 233 states to 233 states and 262 transitions. [2018-04-10 14:26:17,223 INFO L78 Accepts]: Start accepts. Automaton has 233 states and 262 transitions. Word has length 44 [2018-04-10 14:26:17,223 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-10 14:26:17,223 INFO L459 AbstractCegarLoop]: Abstraction has 233 states and 262 transitions. [2018-04-10 14:26:17,224 INFO L460 AbstractCegarLoop]: Interpolant automaton has 34 states. [2018-04-10 14:26:17,224 INFO L276 IsEmpty]: Start isEmpty. Operand 233 states and 262 transitions. [2018-04-10 14:26:17,224 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2018-04-10 14:26:17,224 INFO L347 BasicCegarLoop]: Found error trace [2018-04-10 14:26:17,224 INFO L355 BasicCegarLoop]: trace histogram [3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-10 14:26:17,224 INFO L408 AbstractCegarLoop]: === Iteration 22 === [mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr31RequiresViolation, mainErr46RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr15RequiresViolation, mainErr49RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr17RequiresViolation, mainErr42RequiresViolation, mainErr30RequiresViolation, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr44RequiresViolation, mainErr10RequiresViolation, mainErr43RequiresViolation, mainErr4RequiresViolation, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr51AssertViolationMEMORY_FREE, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr48RequiresViolation, mainErr52EnsuresViolationMEMORY_LEAK, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr45RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr9RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr50AssertViolationMEMORY_FREE, mainErr8RequiresViolation, mainErr34RequiresViolation, mainErr47RequiresViolation, mainErr14RequiresViolation, mainErr40RequiresViolation]=== [2018-04-10 14:26:17,224 INFO L82 PathProgramCache]: Analyzing trace with hash 1178630697, now seen corresponding path program 3 times [2018-04-10 14:26:17,224 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-04-10 14:26:17,224 INFO L68 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-04-10 14:26:17,225 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-10 14:26:17,225 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-04-10 14:26:17,225 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-10 14:26:17,231 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-10 14:26:17,231 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-10 14:26:17,338 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 10 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-10 14:26:17,338 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-04-10 14:26:17,338 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:26:17,343 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-04-10 14:26:17,358 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2018-04-10 14:26:17,358 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-04-10 14:26:17,360 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-10 14:26:17,400 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 14:26:17,400 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 14:26:17,400 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:26:17,401 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-10 14:26:17,403 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-10 14:26:17,403 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:20, output treesize:14 [2018-04-10 14:26:17,418 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 8 [2018-04-10 14:26:17,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, 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:26:17,419 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-10 14:26:17,420 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-10 14:26:17,428 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 8 [2018-04-10 14:26:17,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:26:17,429 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-04-10 14:26:17,430 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-10 14:26:17,434 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:26:17,435 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 4 variables, input treesize:36, output treesize:18 [2018-04-10 14:26:17,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, 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:26:17,486 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 15 [2018-04-10 14:26:17,486 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-10 14:26:17,490 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-10 14:26:17,506 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 47 treesize of output 43 [2018-04-10 14:26:17,507 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 15 [2018-04-10 14:26:17,508 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-04-10 14:26:17,511 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-10 14:26:17,515 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-04-10 14:26:17,515 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 2 variables, input treesize:58, output treesize:42 [2018-04-10 14:26:17,630 INFO L682 Elim1Store]: detected equality via solver [2018-04-10 14:26:17,631 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 69 treesize of output 63 [2018-04-10 14:26:17,633 INFO L682 Elim1Store]: detected equality via solver [2018-04-10 14:26:17,634 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 15 [2018-04-10 14:26:17,634 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-10 14:26:17,641 INFO L682 Elim1Store]: detected equality via solver [2018-04-10 14:26:17,641 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 30 [2018-04-10 14:26:17,642 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:26:17,647 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-04-10 14:26:17,652 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 23 treesize of output 19 [2018-04-10 14:26:17,653 INFO L682 Elim1Store]: detected equality via solver [2018-04-10 14:26:17,654 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11 [2018-04-10 14:26:17,654 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2018-04-10 14:26:17,656 INFO L267 ElimStorePlain]: Start of recursive call 5: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-10 14:26:17,660 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:26:17,660 INFO L202 ElimStorePlain]: Needed 6 recursive calls to eliminate 4 variables, input treesize:75, output treesize:7 [2018-04-10 14:26:17,688 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 10 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-10 14:26:17,704 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-04-10 14:26:17,705 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 17] total 29 [2018-04-10 14:26:17,705 INFO L442 AbstractCegarLoop]: Interpolant automaton has 29 states [2018-04-10 14:26:17,705 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2018-04-10 14:26:17,705 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=78, Invalid=731, Unknown=3, NotChecked=0, Total=812 [2018-04-10 14:26:17,705 INFO L87 Difference]: Start difference. First operand 233 states and 262 transitions. Second operand 29 states. [2018-04-10 14:26:18,704 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-10 14:26:18,704 INFO L93 Difference]: Finished difference Result 288 states and 316 transitions. [2018-04-10 14:26:18,704 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2018-04-10 14:26:18,704 INFO L78 Accepts]: Start accepts. Automaton has 29 states. Word has length 45 [2018-04-10 14:26:18,705 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-10 14:26:18,705 INFO L225 Difference]: With dead ends: 288 [2018-04-10 14:26:18,705 INFO L226 Difference]: Without dead ends: 288 [2018-04-10 14:26:18,706 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 78 GetRequests, 33 SyntacticMatches, 1 SemanticMatches, 44 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 302 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=317, Invalid=1749, Unknown=4, NotChecked=0, Total=2070 [2018-04-10 14:26:18,706 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 288 states. [2018-04-10 14:26:18,709 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 288 to 242. [2018-04-10 14:26:18,709 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 242 states. [2018-04-10 14:26:18,709 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 242 states to 242 states and 271 transitions. [2018-04-10 14:26:18,710 INFO L78 Accepts]: Start accepts. Automaton has 242 states and 271 transitions. Word has length 45 [2018-04-10 14:26:18,710 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-10 14:26:18,710 INFO L459 AbstractCegarLoop]: Abstraction has 242 states and 271 transitions. [2018-04-10 14:26:18,710 INFO L460 AbstractCegarLoop]: Interpolant automaton has 29 states. [2018-04-10 14:26:18,710 INFO L276 IsEmpty]: Start isEmpty. Operand 242 states and 271 transitions. [2018-04-10 14:26:18,710 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2018-04-10 14:26:18,711 INFO L347 BasicCegarLoop]: Found error trace [2018-04-10 14:26:18,711 INFO L355 BasicCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-10 14:26:18,711 INFO L408 AbstractCegarLoop]: === Iteration 23 === [mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr31RequiresViolation, mainErr46RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr15RequiresViolation, mainErr49RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr17RequiresViolation, mainErr42RequiresViolation, mainErr30RequiresViolation, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr44RequiresViolation, mainErr10RequiresViolation, mainErr43RequiresViolation, mainErr4RequiresViolation, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr51AssertViolationMEMORY_FREE, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr48RequiresViolation, mainErr52EnsuresViolationMEMORY_LEAK, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr45RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr9RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr50AssertViolationMEMORY_FREE, mainErr8RequiresViolation, mainErr34RequiresViolation, mainErr47RequiresViolation, mainErr14RequiresViolation, mainErr40RequiresViolation]=== [2018-04-10 14:26:18,711 INFO L82 PathProgramCache]: Analyzing trace with hash -599206312, now seen corresponding path program 2 times [2018-04-10 14:26:18,711 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-04-10 14:26:18,711 INFO L68 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-04-10 14:26:18,712 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-10 14:26:18,712 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-04-10 14:26:18,712 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-10 14:26:18,721 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-10 14:26:18,722 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-10 14:26:18,838 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 15 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-10 14:26:18,838 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-04-10 14:26:18,838 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:26:18,843 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-04-10 14:26:18,857 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-04-10 14:26:18,857 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-04-10 14:26:18,859 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-10 14:26:18,898 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 14:26:18,899 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 14:26:18,899 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:26:18,899 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-10 14:26:18,902 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-10 14:26:18,902 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:20, output treesize:14 [2018-04-10 14:26:18,915 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 8 [2018-04-10 14:26:18,916 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:26:18,916 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-10 14:26:18,917 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-10 14:26:18,922 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:26:18,922 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:30, output treesize:23 [2018-04-10 14:26:18,970 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 14:26:18,972 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 27 treesize of output 28 [2018-04-10 14:26:18,973 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select 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:26:18,973 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-10 14:26:18,976 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-10 14:26:18,980 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-04-10 14:26:18,980 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:35, output treesize:27 [2018-04-10 14:26:18,998 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 14:26:18,998 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 14:26:18,999 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 4 [2018-04-10 14:26:18,999 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-10 14:26:19,003 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-10 14:26:19,003 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:32, output treesize:26 [2018-04-10 14:26:19,022 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 26 treesize of output 25 [2018-04-10 14:26:19,023 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 7 [2018-04-10 14:26:19,024 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-10 14:26:19,026 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-10 14:26:19,031 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:26:19,031 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:42, output treesize:28 [2018-04-10 14:26:19,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, 2 disjoint index pairs (out of 3 index pairs), introduced 4 new quantified variables, introduced 3 case distinctions, treesize of input 57 treesize of output 61 [2018-04-10 14:26:19,128 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 62 treesize of output 61 [2018-04-10 14:26:19,128 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-10 14:26:19,158 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 37 treesize of output 45 [2018-04-10 14:26:19,158 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 2 xjuncts. [2018-04-10 14:26:19,170 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-04-10 14:26:19,181 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: 3 dim-0 vars, and 2 xjuncts. [2018-04-10 14:26:19,181 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 3 variables, input treesize:60, output treesize:81 [2018-04-10 14:26:19,341 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 42 treesize of output 35 [2018-04-10 14:26:19,343 INFO L682 Elim1Store]: detected equality via solver [2018-04-10 14:26:19,343 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 13 [2018-04-10 14:26:19,344 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-10 14:26:19,351 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 1 [2018-04-10 14:26:19,352 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-04-10 14:26:19,356 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-10 14:26:19,380 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 5 new quantified variables, introduced 1 case distinctions, treesize of input 58 treesize of output 54 [2018-04-10 14:26:19,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 1 new quantified variables, introduced 1 case distinctions, treesize of input 36 treesize of output 37 [2018-04-10 14:26:19,388 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 2 xjuncts. [2018-04-10 14:26:19,415 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 44 treesize of output 39 [2018-04-10 14:26:19,415 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2018-04-10 14:26:19,439 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 39 treesize of output 35 [2018-04-10 14:26:19,440 INFO L267 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 1 xjuncts. [2018-04-10 14:26:19,462 INFO L682 Elim1Store]: detected equality via solver [2018-04-10 14:26:19,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 29 treesize of output 23 [2018-04-10 14:26:19,463 INFO L267 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 1 xjuncts. [2018-04-10 14:26:19,464 INFO L682 Elim1Store]: detected equality via solver [2018-04-10 14:26:19,465 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 29 treesize of output 23 [2018-04-10 14:26:19,465 INFO L267 ElimStorePlain]: Start of recursive call 10: End of recursive call: and 1 xjuncts. [2018-04-10 14:26:19,502 INFO L682 Elim1Store]: detected equality via solver [2018-04-10 14:26:19,502 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 19 [2018-04-10 14:26:19,502 INFO L267 ElimStorePlain]: Start of recursive call 11: End of recursive call: and 1 xjuncts. [2018-04-10 14:26:19,510 INFO L267 ElimStorePlain]: Start of recursive call 5: 5 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-10 14:26:19,519 INFO L267 ElimStorePlain]: Start of recursive call 1: 7 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-04-10 14:26:19,520 INFO L202 ElimStorePlain]: Needed 11 recursive calls to eliminate 9 variables, input treesize:101, output treesize:5 [2018-04-10 14:26:19,531 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 15 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-10 14:26:19,551 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-04-10 14:26:19,551 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 18] total 30 [2018-04-10 14:26:19,552 INFO L442 AbstractCegarLoop]: Interpolant automaton has 31 states [2018-04-10 14:26:19,552 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 31 interpolants. [2018-04-10 14:26:19,552 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=110, Invalid=820, Unknown=0, NotChecked=0, Total=930 [2018-04-10 14:26:19,552 INFO L87 Difference]: Start difference. First operand 242 states and 271 transitions. Second operand 31 states. [2018-04-10 14:26:20,893 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-10 14:26:20,893 INFO L93 Difference]: Finished difference Result 349 states and 383 transitions. [2018-04-10 14:26:20,893 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2018-04-10 14:26:20,894 INFO L78 Accepts]: Start accepts. Automaton has 31 states. Word has length 45 [2018-04-10 14:26:20,894 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-10 14:26:20,895 INFO L225 Difference]: With dead ends: 349 [2018-04-10 14:26:20,895 INFO L226 Difference]: Without dead ends: 349 [2018-04-10 14:26:20,895 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 84 GetRequests, 32 SyntacticMatches, 1 SemanticMatches, 51 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 572 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=449, Invalid=2306, Unknown=1, NotChecked=0, Total=2756 [2018-04-10 14:26:20,896 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 349 states. [2018-04-10 14:26:20,898 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 349 to 250. [2018-04-10 14:26:20,898 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 250 states. [2018-04-10 14:26:20,898 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 250 states to 250 states and 281 transitions. [2018-04-10 14:26:20,898 INFO L78 Accepts]: Start accepts. Automaton has 250 states and 281 transitions. Word has length 45 [2018-04-10 14:26:20,899 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-10 14:26:20,899 INFO L459 AbstractCegarLoop]: Abstraction has 250 states and 281 transitions. [2018-04-10 14:26:20,899 INFO L460 AbstractCegarLoop]: Interpolant automaton has 31 states. [2018-04-10 14:26:20,899 INFO L276 IsEmpty]: Start isEmpty. Operand 250 states and 281 transitions. [2018-04-10 14:26:20,899 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2018-04-10 14:26:20,899 INFO L347 BasicCegarLoop]: Found error trace [2018-04-10 14:26:20,899 INFO L355 BasicCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-10 14:26:20,899 INFO L408 AbstractCegarLoop]: === Iteration 24 === [mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr31RequiresViolation, mainErr46RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr15RequiresViolation, mainErr49RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr17RequiresViolation, mainErr42RequiresViolation, mainErr30RequiresViolation, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr44RequiresViolation, mainErr10RequiresViolation, mainErr43RequiresViolation, mainErr4RequiresViolation, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr51AssertViolationMEMORY_FREE, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr48RequiresViolation, mainErr52EnsuresViolationMEMORY_LEAK, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr45RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr9RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr50AssertViolationMEMORY_FREE, mainErr8RequiresViolation, mainErr34RequiresViolation, mainErr47RequiresViolation, mainErr14RequiresViolation, mainErr40RequiresViolation]=== [2018-04-10 14:26:20,899 INFO L82 PathProgramCache]: Analyzing trace with hash -599206311, now seen corresponding path program 2 times [2018-04-10 14:26:20,899 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-04-10 14:26:20,899 INFO L68 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-04-10 14:26:20,900 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-10 14:26:20,900 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-04-10 14:26:20,900 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-10 14:26:20,909 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-10 14:26:20,910 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-10 14:26:21,080 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 15 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-10 14:26:21,081 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-04-10 14:26:21,081 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:26:21,086 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-04-10 14:26:21,100 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-04-10 14:26:21,100 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-04-10 14:26:21,102 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-10 14:26:21,151 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 14:26:21,152 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 14:26:21,152 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:26:21,152 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-10 14:26:21,159 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-10 14:26:21,159 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:29, output treesize:27 [2018-04-10 14:26:21,178 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 8 [2018-04-10 14:26:21,179 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-04-10 14:26:21,179 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-10 14:26:21,181 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-10 14:26:21,189 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 8 [2018-04-10 14:26:21,190 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select 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:26:21,191 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-04-10 14:26:21,192 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-10 14:26:21,198 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:26:21,199 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 3 variables, input treesize:46, output treesize:39 [2018-04-10 14:26:21,257 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 14:26:21,267 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 36 treesize of output 37 [2018-04-10 14:26:21,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 8 treesize of output 7 [2018-04-10 14:26:21,270 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-10 14:26:21,275 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-10 14:26:21,287 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 19 treesize of output 24 [2018-04-10 14:26:21,288 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select 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:26:21,288 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-04-10 14:26:21,291 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-10 14:26:21,319 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-04-10 14:26:21,319 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 2 variables, input treesize:65, output treesize:57 [2018-04-10 14:26:21,379 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 14:26:21,380 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 14 treesize of output 21 [2018-04-10 14:26:21,380 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-10 14:26:21,394 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 14:26:21,395 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 14:26:21,395 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 14:26:21,396 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:26:21,396 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-10 14:26:21,406 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-10 14:26:21,407 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:75, output treesize:71 [2018-04-10 14:26:21,453 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 30 treesize of output 36 [2018-04-10 14:26:21,456 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 18 treesize of output 11 [2018-04-10 14:26:21,457 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-10 14:26:21,460 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-10 14:26:21,478 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 55 [2018-04-10 14:26:21,481 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 14 treesize of output 7 [2018-04-10 14:26:21,481 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-04-10 14:26:21,487 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-10 14:26:21,498 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:26:21,498 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 4 variables, input treesize:93, output treesize:65 [2018-04-10 14:26:21,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 3 new quantified variables, introduced 0 case distinctions, treesize of input 115 treesize of output 90 [2018-04-10 14:26:21,642 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 15 [2018-04-10 14:26:21,642 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-10 14:26:21,650 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-10 14:26:21,666 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 35 treesize of output 36 [2018-04-10 14:26:21,668 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 15 [2018-04-10 14:26:21,668 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-04-10 14:26:21,671 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-10 14:26:21,682 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:26:21,682 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 4 variables, input treesize:128, output treesize:104 [2018-04-10 14:26:21,793 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 5 new quantified variables, introduced 0 case distinctions, treesize of input 98 treesize of output 66 [2018-04-10 14:26:21,796 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 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:26:21,796 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-10 14:26:21,807 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 31 treesize of output 23 [2018-04-10 14:26:21,807 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:26:21,816 INFO L682 Elim1Store]: detected equality via solver [2018-04-10 14:26:21,817 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 27 treesize of output 19 [2018-04-10 14:26:21,817 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-04-10 14:26:21,825 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:26:21,840 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 20 [2018-04-10 14:26:21,842 INFO L682 Elim1Store]: detected equality via solver [2018-04-10 14:26:21,842 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2018-04-10 14:26:21,842 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2018-04-10 14:26:21,847 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select 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:26:21,847 INFO L267 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 1 xjuncts. [2018-04-10 14:26:21,848 INFO L267 ElimStorePlain]: Start of recursive call 6: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-10 14:26:21,858 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:26:21,858 INFO L202 ElimStorePlain]: Needed 8 recursive calls to eliminate 6 variables, input treesize:121, output treesize:21 [2018-04-10 14:26:21,898 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 15 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-10 14:26:21,917 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-04-10 14:26:21,917 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 19] total 32 [2018-04-10 14:26:21,917 INFO L442 AbstractCegarLoop]: Interpolant automaton has 33 states [2018-04-10 14:26:21,917 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 33 interpolants. [2018-04-10 14:26:21,917 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=116, Invalid=940, Unknown=0, NotChecked=0, Total=1056 [2018-04-10 14:26:21,918 INFO L87 Difference]: Start difference. First operand 250 states and 281 transitions. Second operand 33 states. [2018-04-10 14:26:23,860 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-10 14:26:23,861 INFO L93 Difference]: Finished difference Result 354 states and 388 transitions. [2018-04-10 14:26:23,861 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2018-04-10 14:26:23,861 INFO L78 Accepts]: Start accepts. Automaton has 33 states. Word has length 45 [2018-04-10 14:26:23,861 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-10 14:26:23,862 INFO L225 Difference]: With dead ends: 354 [2018-04-10 14:26:23,862 INFO L226 Difference]: Without dead ends: 354 [2018-04-10 14:26:23,862 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 83 GetRequests, 30 SyntacticMatches, 1 SemanticMatches, 52 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 512 ImplicationChecksByTransitivity, 1.4s TimeCoverageRelationStatistics Valid=435, Invalid=2427, Unknown=0, NotChecked=0, Total=2862 [2018-04-10 14:26:23,862 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 354 states. [2018-04-10 14:26:23,864 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 354 to 242. [2018-04-10 14:26:23,864 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 242 states. [2018-04-10 14:26:23,864 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 242 states to 242 states and 271 transitions. [2018-04-10 14:26:23,864 INFO L78 Accepts]: Start accepts. Automaton has 242 states and 271 transitions. Word has length 45 [2018-04-10 14:26:23,865 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-10 14:26:23,865 INFO L459 AbstractCegarLoop]: Abstraction has 242 states and 271 transitions. [2018-04-10 14:26:23,865 INFO L460 AbstractCegarLoop]: Interpolant automaton has 33 states. [2018-04-10 14:26:23,865 INFO L276 IsEmpty]: Start isEmpty. Operand 242 states and 271 transitions. [2018-04-10 14:26:23,865 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2018-04-10 14:26:23,865 INFO L347 BasicCegarLoop]: Found error trace [2018-04-10 14:26:23,865 INFO L355 BasicCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-10 14:26:23,865 INFO L408 AbstractCegarLoop]: === Iteration 25 === [mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr31RequiresViolation, mainErr46RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr15RequiresViolation, mainErr49RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr17RequiresViolation, mainErr42RequiresViolation, mainErr30RequiresViolation, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr44RequiresViolation, mainErr10RequiresViolation, mainErr43RequiresViolation, mainErr4RequiresViolation, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr51AssertViolationMEMORY_FREE, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr48RequiresViolation, mainErr52EnsuresViolationMEMORY_LEAK, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr45RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr9RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr50AssertViolationMEMORY_FREE, mainErr8RequiresViolation, mainErr34RequiresViolation, mainErr47RequiresViolation, mainErr14RequiresViolation, mainErr40RequiresViolation]=== [2018-04-10 14:26:23,865 INFO L82 PathProgramCache]: Analyzing trace with hash -198428809, now seen corresponding path program 2 times [2018-04-10 14:26:23,865 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-04-10 14:26:23,865 INFO L68 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-04-10 14:26:23,866 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-10 14:26:23,866 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-04-10 14:26:23,866 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-10 14:26:23,871 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-10 14:26:23,872 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-10 14:26:24,124 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 2 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-10 14:26:24,124 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-04-10 14:26:24,124 INFO L213 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 15 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 15 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-04-10 14:26:24,129 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-04-10 14:26:24,146 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-04-10 14:26:24,146 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-04-10 14:26:24,148 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-10 14:26:24,214 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 14:26:24,214 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 14:26:24,215 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:26:24,215 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-10 14:26:24,218 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-10 14:26:24,218 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:23, output treesize:17 [2018-04-10 14:26:24,249 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 8 [2018-04-10 14:26:24,251 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select 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:26:24,251 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-10 14:26:24,253 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-10 14:26:24,263 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 8 [2018-04-10 14:26:24,264 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:26:24,264 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-04-10 14:26:24,265 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-10 14:26:24,271 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:26:24,271 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 4 variables, input treesize:39, output treesize:21 [2018-04-10 14:26:24,337 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:26:24,338 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 15 [2018-04-10 14:26:24,338 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-10 14:26:24,341 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-10 14:26:24,356 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 47 treesize of output 43 [2018-04-10 14:26:24,358 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 15 [2018-04-10 14:26:24,358 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-04-10 14:26:24,361 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-10 14:26:24,367 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:26:24,367 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 3 variables, input treesize:64, output treesize:48 [2018-04-10 14:26:24,485 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 49 treesize of output 48 [2018-04-10 14:26:24,487 INFO L682 Elim1Store]: detected equality via solver [2018-04-10 14:26:24,490 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 40 treesize of output 33 [2018-04-10 14:26:24,490 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-10 14:26:24,496 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-10 14:26:24,510 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 49 treesize of output 41 [2018-04-10 14:26:24,512 INFO L682 Elim1Store]: detected equality via solver [2018-04-10 14:26:24,513 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 38 treesize of output 29 [2018-04-10 14:26:24,513 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-04-10 14:26:24,517 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-10 14:26:24,525 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:26:24,525 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 7 variables, input treesize:87, output treesize:15 [2018-04-10 14:26:24,543 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:26:24,544 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 3 [2018-04-10 14:26:24,544 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-10 14:26:24,545 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-10 14:26:24,548 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:26:24,549 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 3 [2018-04-10 14:26:24,549 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-04-10 14:26:24,549 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-10 14:26:24,551 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:26:24,551 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 4 variables, input treesize:29, output treesize:7 [2018-04-10 14:26:24,581 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 2 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-10 14:26:24,598 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-04-10 14:26:24,598 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [19, 20] total 33 [2018-04-10 14:26:24,598 INFO L442 AbstractCegarLoop]: Interpolant automaton has 33 states [2018-04-10 14:26:24,599 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 33 interpolants. [2018-04-10 14:26:24,599 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=97, Invalid=959, Unknown=0, NotChecked=0, Total=1056 [2018-04-10 14:26:24,599 INFO L87 Difference]: Start difference. First operand 242 states and 271 transitions. Second operand 33 states. [2018-04-10 14:26:25,597 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-10 14:26:25,597 INFO L93 Difference]: Finished difference Result 320 states and 355 transitions. [2018-04-10 14:26:25,597 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2018-04-10 14:26:25,598 INFO L78 Accepts]: Start accepts. Automaton has 33 states. Word has length 47 [2018-04-10 14:26:25,598 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-10 14:26:25,598 INFO L225 Difference]: With dead ends: 320 [2018-04-10 14:26:25,598 INFO L226 Difference]: Without dead ends: 320 [2018-04-10 14:26:25,599 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 94 GetRequests, 33 SyntacticMatches, 4 SemanticMatches, 57 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 720 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=420, Invalid=3001, Unknown=1, NotChecked=0, Total=3422 [2018-04-10 14:26:25,599 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 320 states. [2018-04-10 14:26:25,601 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 320 to 250. [2018-04-10 14:26:25,601 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 250 states. [2018-04-10 14:26:25,601 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 250 states to 250 states and 279 transitions. [2018-04-10 14:26:25,601 INFO L78 Accepts]: Start accepts. Automaton has 250 states and 279 transitions. Word has length 47 [2018-04-10 14:26:25,602 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-10 14:26:25,602 INFO L459 AbstractCegarLoop]: Abstraction has 250 states and 279 transitions. [2018-04-10 14:26:25,602 INFO L460 AbstractCegarLoop]: Interpolant automaton has 33 states. [2018-04-10 14:26:25,602 INFO L276 IsEmpty]: Start isEmpty. Operand 250 states and 279 transitions. [2018-04-10 14:26:25,602 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2018-04-10 14:26:25,602 INFO L347 BasicCegarLoop]: Found error trace [2018-04-10 14:26:25,602 INFO L355 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-10 14:26:25,602 INFO L408 AbstractCegarLoop]: === Iteration 26 === [mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr31RequiresViolation, mainErr46RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr15RequiresViolation, mainErr49RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr17RequiresViolation, mainErr42RequiresViolation, mainErr30RequiresViolation, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr44RequiresViolation, mainErr10RequiresViolation, mainErr43RequiresViolation, mainErr4RequiresViolation, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr51AssertViolationMEMORY_FREE, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr48RequiresViolation, mainErr52EnsuresViolationMEMORY_LEAK, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr45RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr9RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr50AssertViolationMEMORY_FREE, mainErr8RequiresViolation, mainErr34RequiresViolation, mainErr47RequiresViolation, mainErr14RequiresViolation, mainErr40RequiresViolation]=== [2018-04-10 14:26:25,602 INFO L82 PathProgramCache]: Analyzing trace with hash 439322798, now seen corresponding path program 1 times [2018-04-10 14:26:25,602 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-04-10 14:26:25,602 INFO L68 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-04-10 14:26:25,603 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-10 14:26:25,603 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-04-10 14:26:25,603 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-10 14:26:25,608 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-10 14:26:25,608 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-10 14:26:25,654 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2018-04-10 14:26:25,654 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-04-10 14:26:25,654 INFO L213 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 16 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 16 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-04-10 14:26:25,659 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-10 14:26:25,684 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-10 14:26:25,686 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-10 14:26:25,699 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 13 [2018-04-10 14:26:25,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 13 treesize of output 5 [2018-04-10 14:26:25,701 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-10 14:26:25,702 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-10 14:26:25,703 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-04-10 14:26:25,704 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:17, output treesize:5 [2018-04-10 14:26:25,711 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2018-04-10 14:26:25,740 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-04-10 14:26:25,740 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 8 [2018-04-10 14:26:25,740 INFO L442 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-04-10 14:26:25,741 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-04-10 14:26:25,741 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2018-04-10 14:26:25,741 INFO L87 Difference]: Start difference. First operand 250 states and 279 transitions. Second operand 9 states. [2018-04-10 14:26:26,065 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-10 14:26:26,066 INFO L93 Difference]: Finished difference Result 366 states and 401 transitions. [2018-04-10 14:26:26,066 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2018-04-10 14:26:26,066 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 47 [2018-04-10 14:26:26,066 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-10 14:26:26,067 INFO L225 Difference]: With dead ends: 366 [2018-04-10 14:26:26,067 INFO L226 Difference]: Without dead ends: 366 [2018-04-10 14:26:26,067 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 65 GetRequests, 46 SyntacticMatches, 3 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 27 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=79, Invalid=227, Unknown=0, NotChecked=0, Total=306 [2018-04-10 14:26:26,067 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 366 states. [2018-04-10 14:26:26,069 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 366 to 263. [2018-04-10 14:26:26,069 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 263 states. [2018-04-10 14:26:26,069 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 263 states to 263 states and 296 transitions. [2018-04-10 14:26:26,069 INFO L78 Accepts]: Start accepts. Automaton has 263 states and 296 transitions. Word has length 47 [2018-04-10 14:26:26,069 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-10 14:26:26,070 INFO L459 AbstractCegarLoop]: Abstraction has 263 states and 296 transitions. [2018-04-10 14:26:26,070 INFO L460 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-04-10 14:26:26,070 INFO L276 IsEmpty]: Start isEmpty. Operand 263 states and 296 transitions. [2018-04-10 14:26:26,070 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2018-04-10 14:26:26,070 INFO L347 BasicCegarLoop]: Found error trace [2018-04-10 14:26:26,070 INFO L355 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-10 14:26:26,070 INFO L408 AbstractCegarLoop]: === Iteration 27 === [mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr31RequiresViolation, mainErr46RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr15RequiresViolation, mainErr49RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr17RequiresViolation, mainErr42RequiresViolation, mainErr30RequiresViolation, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr44RequiresViolation, mainErr10RequiresViolation, mainErr43RequiresViolation, mainErr4RequiresViolation, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr51AssertViolationMEMORY_FREE, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr48RequiresViolation, mainErr52EnsuresViolationMEMORY_LEAK, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr45RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr9RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr50AssertViolationMEMORY_FREE, mainErr8RequiresViolation, mainErr34RequiresViolation, mainErr47RequiresViolation, mainErr14RequiresViolation, mainErr40RequiresViolation]=== [2018-04-10 14:26:26,071 INFO L82 PathProgramCache]: Analyzing trace with hash 439322799, now seen corresponding path program 1 times [2018-04-10 14:26:26,071 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-04-10 14:26:26,071 INFO L68 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-04-10 14:26:26,071 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-10 14:26:26,071 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-10 14:26:26,072 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-10 14:26:26,077 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-10 14:26:26,078 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-10 14:26:26,290 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-10 14:26:26,291 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-04-10 14:26:26,291 INFO L213 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 17 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 17 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-04-10 14:26:26,296 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-10 14:26:26,308 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-10 14:26:26,309 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-10 14:26:26,313 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 14:26:26,314 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 14:26:26,314 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:26:26,314 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-10 14:26:26,317 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-10 14:26:26,317 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:20, output treesize:14 [2018-04-10 14:26:26,321 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:26:26,322 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select 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:26:26,322 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-10 14:26:26,323 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-10 14:26:26,329 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:26:26,330 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:26:26,330 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-04-10 14:26:26,331 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-10 14:26:26,335 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:26:26,335 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 3 variables, input treesize:33, output treesize:22 [2018-04-10 14:26:26,349 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:26:26,350 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:26:26,350 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-10 14:26:26,351 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-10 14:26:26,353 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-04-10 14:26:26,353 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:23, output treesize:12 [2018-04-10 14:26:26,360 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 19 treesize of output 20 [2018-04-10 14:26:26,361 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select 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:26:26,361 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-10 14:26:26,364 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-10 14:26:26,367 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:26:26,367 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:23, output treesize:19 [2018-04-10 14:26:26,473 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 23 treesize of output 19 [2018-04-10 14:26:26,474 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 11 [2018-04-10 14:26:26,474 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-10 14:26:26,475 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-10 14:26:26,481 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 29 [2018-04-10 14:26:26,482 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select 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:26:26,483 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-04-10 14:26:26,487 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 11 [2018-04-10 14:26:26,487 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2018-04-10 14:26:26,489 INFO L267 ElimStorePlain]: Start of recursive call 4: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-10 14:26:26,492 INFO L267 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-04-10 14:26:26,492 INFO L202 ElimStorePlain]: Needed 6 recursive calls to eliminate 6 variables, input treesize:48, output treesize:11 [2018-04-10 14:26:26,536 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-10 14:26:26,555 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-04-10 14:26:26,555 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 15] total 25 [2018-04-10 14:26:26,555 INFO L442 AbstractCegarLoop]: Interpolant automaton has 26 states [2018-04-10 14:26:26,555 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2018-04-10 14:26:26,555 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=73, Invalid=577, Unknown=0, NotChecked=0, Total=650 [2018-04-10 14:26:26,555 INFO L87 Difference]: Start difference. First operand 263 states and 296 transitions. Second operand 26 states. [2018-04-10 14:26:27,947 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-10 14:26:27,947 INFO L93 Difference]: Finished difference Result 475 states and 530 transitions. [2018-04-10 14:26:27,947 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 31 states. [2018-04-10 14:26:27,947 INFO L78 Accepts]: Start accepts. Automaton has 26 states. Word has length 47 [2018-04-10 14:26:27,947 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-10 14:26:27,949 INFO L225 Difference]: With dead ends: 475 [2018-04-10 14:26:27,949 INFO L226 Difference]: Without dead ends: 475 [2018-04-10 14:26:27,949 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 89 GetRequests, 36 SyntacticMatches, 4 SemanticMatches, 49 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 542 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=347, Invalid=2203, Unknown=0, NotChecked=0, Total=2550 [2018-04-10 14:26:27,950 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 475 states. [2018-04-10 14:26:27,952 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 475 to 273. [2018-04-10 14:26:27,952 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 273 states. [2018-04-10 14:26:27,953 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 273 states to 273 states and 307 transitions. [2018-04-10 14:26:27,953 INFO L78 Accepts]: Start accepts. Automaton has 273 states and 307 transitions. Word has length 47 [2018-04-10 14:26:27,953 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-10 14:26:27,953 INFO L459 AbstractCegarLoop]: Abstraction has 273 states and 307 transitions. [2018-04-10 14:26:27,953 INFO L460 AbstractCegarLoop]: Interpolant automaton has 26 states. [2018-04-10 14:26:27,953 INFO L276 IsEmpty]: Start isEmpty. Operand 273 states and 307 transitions. [2018-04-10 14:26:27,953 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2018-04-10 14:26:27,954 INFO L347 BasicCegarLoop]: Found error trace [2018-04-10 14:26:27,954 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] [2018-04-10 14:26:27,954 INFO L408 AbstractCegarLoop]: === Iteration 28 === [mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr31RequiresViolation, mainErr46RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr15RequiresViolation, mainErr49RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr17RequiresViolation, mainErr42RequiresViolation, mainErr30RequiresViolation, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr44RequiresViolation, mainErr10RequiresViolation, mainErr43RequiresViolation, mainErr4RequiresViolation, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr51AssertViolationMEMORY_FREE, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr48RequiresViolation, mainErr52EnsuresViolationMEMORY_LEAK, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr45RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr9RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr50AssertViolationMEMORY_FREE, mainErr8RequiresViolation, mainErr34RequiresViolation, mainErr47RequiresViolation, mainErr14RequiresViolation, mainErr40RequiresViolation]=== [2018-04-10 14:26:27,954 INFO L82 PathProgramCache]: Analyzing trace with hash -1519038687, now seen corresponding path program 2 times [2018-04-10 14:26:27,954 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-04-10 14:26:27,954 INFO L68 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-04-10 14:26:27,955 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-10 14:26:27,955 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-10 14:26:27,955 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-10 14:26:27,962 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-10 14:26:27,962 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-10 14:26:28,222 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:26:28,222 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-04-10 14:26:28,222 INFO L213 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 18 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 18 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-04-10 14:26:28,230 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-04-10 14:26:28,258 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-04-10 14:26:28,258 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-04-10 14:26:28,260 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-10 14:26:28,325 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select 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:26:28,325 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-10 14:26:28,333 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 14:26:28,334 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 14:26:28,334 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:26:28,334 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-10 14:26:28,340 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-10 14:26:28,340 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:32, output treesize:25 [2018-04-10 14:26:28,361 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 8 [2018-04-10 14:26:28,362 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:26:28,362 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-10 14:26:28,364 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-10 14:26:28,373 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 8 [2018-04-10 14:26:28,375 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select 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:26:28,375 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-04-10 14:26:28,376 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-10 14:26:28,383 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:26:28,384 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 3 variables, input treesize:44, output treesize:37 [2018-04-10 14:26:28,447 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 56 treesize of output 52 [2018-04-10 14:26:28,448 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 11 [2018-04-10 14:26:28,448 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-10 14:26:28,453 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-10 14:26:28,464 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 28 [2018-04-10 14:26:28,466 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select 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:26:28,466 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-04-10 14:26:28,469 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-10 14:26:28,477 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:26:28,477 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 4 variables, input treesize:72, output treesize:56 [2018-04-10 14:26:28,528 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 47 treesize of output 38 [2018-04-10 14:26:28,529 INFO L682 Elim1Store]: detected equality via solver [2018-04-10 14:26:28,529 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 28 treesize of output 20 [2018-04-10 14:26:28,530 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-10 14:26:28,535 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select 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:26:28,535 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-04-10 14:26:28,537 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-10 14:26:28,546 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 22 treesize of output 20 [2018-04-10 14:26:28,548 INFO L682 Elim1Store]: detected equality via solver [2018-04-10 14:26:28,548 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2018-04-10 14:26:28,548 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2018-04-10 14:26:28,552 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select 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:26:28,552 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2018-04-10 14:26:28,553 INFO L267 ElimStorePlain]: Start of recursive call 5: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-10 14:26:28,558 INFO L267 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-04-10 14:26:28,558 INFO L202 ElimStorePlain]: Needed 7 recursive calls to eliminate 6 variables, input treesize:73, output treesize:9 [2018-04-10 14:26:28,616 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:26:28,634 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-04-10 14:26:28,635 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 16] total 26 [2018-04-10 14:26:28,635 INFO L442 AbstractCegarLoop]: Interpolant automaton has 27 states [2018-04-10 14:26:28,635 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. [2018-04-10 14:26:28,635 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=81, Invalid=620, Unknown=1, NotChecked=0, Total=702 [2018-04-10 14:26:28,635 INFO L87 Difference]: Start difference. First operand 273 states and 307 transitions. Second operand 27 states. [2018-04-10 14:26:29,641 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-10 14:26:29,642 INFO L93 Difference]: Finished difference Result 352 states and 392 transitions. [2018-04-10 14:26:29,642 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2018-04-10 14:26:29,642 INFO L78 Accepts]: Start accepts. Automaton has 27 states. Word has length 50 [2018-04-10 14:26:29,642 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-10 14:26:29,643 INFO L225 Difference]: With dead ends: 352 [2018-04-10 14:26:29,643 INFO L226 Difference]: Without dead ends: 352 [2018-04-10 14:26:29,643 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 87 GetRequests, 34 SyntacticMatches, 9 SemanticMatches, 44 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 382 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=325, Invalid=1744, Unknown=1, NotChecked=0, Total=2070 [2018-04-10 14:26:29,643 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 352 states. [2018-04-10 14:26:29,645 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 352 to 289. [2018-04-10 14:26:29,645 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 289 states. [2018-04-10 14:26:29,645 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 289 states to 289 states and 328 transitions. [2018-04-10 14:26:29,645 INFO L78 Accepts]: Start accepts. Automaton has 289 states and 328 transitions. Word has length 50 [2018-04-10 14:26:29,645 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-10 14:26:29,645 INFO L459 AbstractCegarLoop]: Abstraction has 289 states and 328 transitions. [2018-04-10 14:26:29,645 INFO L460 AbstractCegarLoop]: Interpolant automaton has 27 states. [2018-04-10 14:26:29,645 INFO L276 IsEmpty]: Start isEmpty. Operand 289 states and 328 transitions. [2018-04-10 14:26:29,646 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2018-04-10 14:26:29,646 INFO L347 BasicCegarLoop]: Found error trace [2018-04-10 14:26:29,646 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] [2018-04-10 14:26:29,646 INFO L408 AbstractCegarLoop]: === Iteration 29 === [mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr31RequiresViolation, mainErr46RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr15RequiresViolation, mainErr49RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr17RequiresViolation, mainErr42RequiresViolation, mainErr30RequiresViolation, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr44RequiresViolation, mainErr10RequiresViolation, mainErr43RequiresViolation, mainErr4RequiresViolation, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr51AssertViolationMEMORY_FREE, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr48RequiresViolation, mainErr52EnsuresViolationMEMORY_LEAK, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr45RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr9RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr50AssertViolationMEMORY_FREE, mainErr8RequiresViolation, mainErr34RequiresViolation, mainErr47RequiresViolation, mainErr14RequiresViolation, mainErr40RequiresViolation]=== [2018-04-10 14:26:29,646 INFO L82 PathProgramCache]: Analyzing trace with hash 1098735242, now seen corresponding path program 1 times [2018-04-10 14:26:29,646 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-04-10 14:26:29,646 INFO L68 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-04-10 14:26:29,647 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-10 14:26:29,647 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-04-10 14:26:29,647 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-10 14:26:29,651 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-10 14:26:29,651 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-10 14:26:29,776 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2018-04-10 14:26:29,777 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-04-10 14:26:29,777 INFO L213 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 19 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 19 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-04-10 14:26:29,785 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-10 14:26:29,802 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-10 14:26:29,804 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-10 14:26:29,836 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 19 [2018-04-10 14:26:29,838 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 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:26:29,838 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-10 14:26:29,840 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-10 14:26:29,846 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 12 treesize of output 10 [2018-04-10 14:26:29,846 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select 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:26:29,847 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-04-10 14:26:29,847 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-10 14:26:29,852 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 19 [2018-04-10 14:26:29,853 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:26:29,854 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2018-04-10 14:26:29,856 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-10 14:26:29,860 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 10 [2018-04-10 14:26:29,861 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 1 [2018-04-10 14:26:29,861 INFO L267 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 1 xjuncts. [2018-04-10 14:26:29,862 INFO L267 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-10 14:26:29,872 INFO L267 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 4 dim-2 vars, End of recursive call: and 2 xjuncts. [2018-04-10 14:26:29,872 INFO L202 ElimStorePlain]: Needed 9 recursive calls to eliminate 8 variables, input treesize:47, output treesize:9 [2018-04-10 14:26:29,887 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2018-04-10 14:26:29,904 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-04-10 14:26:29,905 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 10] total 15 [2018-04-10 14:26:29,905 INFO L442 AbstractCegarLoop]: Interpolant automaton has 15 states [2018-04-10 14:26:29,905 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2018-04-10 14:26:29,905 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=177, Unknown=0, NotChecked=0, Total=210 [2018-04-10 14:26:29,905 INFO L87 Difference]: Start difference. First operand 289 states and 328 transitions. Second operand 15 states. [2018-04-10 14:26:30,396 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-10 14:26:30,396 INFO L93 Difference]: Finished difference Result 342 states and 376 transitions. [2018-04-10 14:26:30,396 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2018-04-10 14:26:30,397 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 50 [2018-04-10 14:26:30,397 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-10 14:26:30,397 INFO L225 Difference]: With dead ends: 342 [2018-04-10 14:26:30,397 INFO L226 Difference]: Without dead ends: 342 [2018-04-10 14:26:30,398 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 72 GetRequests, 44 SyntacticMatches, 4 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 101 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=127, Invalid=523, Unknown=0, NotChecked=0, Total=650 [2018-04-10 14:26:30,398 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 342 states. [2018-04-10 14:26:30,399 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 342 to 296. [2018-04-10 14:26:30,400 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 296 states. [2018-04-10 14:26:30,400 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 296 states to 296 states and 333 transitions. [2018-04-10 14:26:30,400 INFO L78 Accepts]: Start accepts. Automaton has 296 states and 333 transitions. Word has length 50 [2018-04-10 14:26:30,400 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-10 14:26:30,401 INFO L459 AbstractCegarLoop]: Abstraction has 296 states and 333 transitions. [2018-04-10 14:26:30,401 INFO L460 AbstractCegarLoop]: Interpolant automaton has 15 states. [2018-04-10 14:26:30,401 INFO L276 IsEmpty]: Start isEmpty. Operand 296 states and 333 transitions. [2018-04-10 14:26:30,401 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2018-04-10 14:26:30,401 INFO L347 BasicCegarLoop]: Found error trace [2018-04-10 14:26:30,402 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:26:30,402 INFO L408 AbstractCegarLoop]: === Iteration 30 === [mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr31RequiresViolation, mainErr46RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr15RequiresViolation, mainErr49RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr17RequiresViolation, mainErr42RequiresViolation, mainErr30RequiresViolation, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr44RequiresViolation, mainErr10RequiresViolation, mainErr43RequiresViolation, mainErr4RequiresViolation, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr51AssertViolationMEMORY_FREE, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr48RequiresViolation, mainErr52EnsuresViolationMEMORY_LEAK, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr45RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr9RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr50AssertViolationMEMORY_FREE, mainErr8RequiresViolation, mainErr34RequiresViolation, mainErr47RequiresViolation, mainErr14RequiresViolation, mainErr40RequiresViolation]=== [2018-04-10 14:26:30,402 INFO L82 PathProgramCache]: Analyzing trace with hash -1906167058, now seen corresponding path program 1 times [2018-04-10 14:26:30,402 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-04-10 14:26:30,402 INFO L68 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-04-10 14:26:30,403 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-10 14:26:30,403 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-10 14:26:30,403 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-10 14:26:30,409 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-10 14:26:30,410 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-10 14:26:30,442 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2018-04-10 14:26:30,442 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-04-10 14:26:30,442 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-04-10 14:26:30,442 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-04-10 14:26:30,443 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-04-10 14:26:30,443 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-04-10 14:26:30,443 INFO L87 Difference]: Start difference. First operand 296 states and 333 transitions. Second operand 4 states. [2018-04-10 14:26:30,502 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-10 14:26:30,502 INFO L93 Difference]: Finished difference Result 304 states and 338 transitions. [2018-04-10 14:26:30,502 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-04-10 14:26:30,502 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 53 [2018-04-10 14:26:30,502 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-10 14:26:30,503 INFO L225 Difference]: With dead ends: 304 [2018-04-10 14:26:30,503 INFO L226 Difference]: Without dead ends: 304 [2018-04-10 14:26:30,503 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 4 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:26:30,503 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 304 states. [2018-04-10 14:26:30,505 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 304 to 296. [2018-04-10 14:26:30,505 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 296 states. [2018-04-10 14:26:30,505 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 296 states to 296 states and 331 transitions. [2018-04-10 14:26:30,505 INFO L78 Accepts]: Start accepts. Automaton has 296 states and 331 transitions. Word has length 53 [2018-04-10 14:26:30,505 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-10 14:26:30,505 INFO L459 AbstractCegarLoop]: Abstraction has 296 states and 331 transitions. [2018-04-10 14:26:30,505 INFO L460 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-04-10 14:26:30,505 INFO L276 IsEmpty]: Start isEmpty. Operand 296 states and 331 transitions. [2018-04-10 14:26:30,506 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2018-04-10 14:26:30,506 INFO L347 BasicCegarLoop]: Found error trace [2018-04-10 14:26:30,506 INFO L355 BasicCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-10 14:26:30,506 INFO L408 AbstractCegarLoop]: === Iteration 31 === [mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr31RequiresViolation, mainErr46RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr15RequiresViolation, mainErr49RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr17RequiresViolation, mainErr42RequiresViolation, mainErr30RequiresViolation, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr44RequiresViolation, mainErr10RequiresViolation, mainErr43RequiresViolation, mainErr4RequiresViolation, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr51AssertViolationMEMORY_FREE, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr48RequiresViolation, mainErr52EnsuresViolationMEMORY_LEAK, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr45RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr9RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr50AssertViolationMEMORY_FREE, mainErr8RequiresViolation, mainErr34RequiresViolation, mainErr47RequiresViolation, mainErr14RequiresViolation, mainErr40RequiresViolation]=== [2018-04-10 14:26:30,506 INFO L82 PathProgramCache]: Analyzing trace with hash -1865738814, now seen corresponding path program 2 times [2018-04-10 14:26:30,506 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-04-10 14:26:30,506 INFO L68 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-04-10 14:26:30,507 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-10 14:26:30,507 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-10 14:26:30,507 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-10 14:26:30,513 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-10 14:26:30,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:26:30,799 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 2 proven. 13 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-10 14:26:30,799 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-04-10 14:26:30,799 INFO L213 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 20 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 20 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-04-10 14:26:30,804 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-04-10 14:26:30,825 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-04-10 14:26:30,825 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-04-10 14:26:30,827 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-10 14:26:30,881 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 14:26:30,881 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 14:26:30,882 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:26:30,883 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-10 14:26:30,888 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-10 14:26:30,888 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:20, output treesize:14 [2018-04-10 14:26:30,909 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 8 [2018-04-10 14:26:30,911 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:26:30,911 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-10 14:26:30,912 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-10 14:26:30,923 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 8 [2018-04-10 14:26:30,924 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select 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:26:30,924 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-04-10 14:26:30,926 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-10 14:26:30,934 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:26:30,934 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 4 variables, input treesize:36, output treesize:18 [2018-04-10 14:26:31,009 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:26:31,011 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 15 [2018-04-10 14:26:31,011 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-10 14:26:31,018 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-10 14:26:31,028 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 47 treesize of output 43 [2018-04-10 14:26:31,038 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 15 [2018-04-10 14:26:31,038 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-04-10 14:26:31,041 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-10 14:26:31,048 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-04-10 14:26:31,048 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 2 variables, input treesize:58, output treesize:42 [2018-04-10 14:26:31,202 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 57 treesize of output 49 [2018-04-10 14:26:31,204 INFO L682 Elim1Store]: detected equality via solver [2018-04-10 14:26:31,205 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 46 treesize of output 37 [2018-04-10 14:26:31,205 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-10 14:26:31,210 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-10 14:26:31,221 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 41 treesize of output 36 [2018-04-10 14:26:31,222 INFO L682 Elim1Store]: detected equality via solver [2018-04-10 14:26:31,223 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 25 [2018-04-10 14:26:31,224 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-04-10 14:26:31,227 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-10 14:26:31,233 INFO L267 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-04-10 14:26:31,233 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 6 variables, input treesize:81, output treesize:15 [2018-04-10 14:26:31,251 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:26:31,252 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select 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:26:31,252 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-10 14:26:31,253 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-10 14:26:31,256 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:26:31,257 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select 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:26:31,257 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-04-10 14:26:31,257 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-10 14:26:31,259 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:26:31,259 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 4 variables, input treesize:29, output treesize:7 [2018-04-10 14:26:31,289 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 2 proven. 13 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-10 14:26:31,308 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-04-10 14:26:31,308 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [20, 20] total 34 [2018-04-10 14:26:31,308 INFO L442 AbstractCegarLoop]: Interpolant automaton has 34 states [2018-04-10 14:26:31,308 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 34 interpolants. [2018-04-10 14:26:31,308 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=99, Invalid=1023, Unknown=0, NotChecked=0, Total=1122 [2018-04-10 14:26:31,308 INFO L87 Difference]: Start difference. First operand 296 states and 331 transitions. Second operand 34 states. [2018-04-10 14:26:32,428 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-10 14:26:32,428 INFO L93 Difference]: Finished difference Result 405 states and 444 transitions. [2018-04-10 14:26:32,428 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2018-04-10 14:26:32,428 INFO L78 Accepts]: Start accepts. Automaton has 34 states. Word has length 53 [2018-04-10 14:26:32,428 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-10 14:26:32,429 INFO L225 Difference]: With dead ends: 405 [2018-04-10 14:26:32,429 INFO L226 Difference]: Without dead ends: 405 [2018-04-10 14:26:32,430 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 101 GetRequests, 39 SyntacticMatches, 4 SemanticMatches, 58 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 803 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=416, Invalid=3124, Unknown=0, NotChecked=0, Total=3540 [2018-04-10 14:26:32,430 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 405 states. [2018-04-10 14:26:32,432 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 405 to 320. [2018-04-10 14:26:32,432 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 320 states. [2018-04-10 14:26:32,433 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 320 states to 320 states and 356 transitions. [2018-04-10 14:26:32,433 INFO L78 Accepts]: Start accepts. Automaton has 320 states and 356 transitions. Word has length 53 [2018-04-10 14:26:32,433 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-10 14:26:32,433 INFO L459 AbstractCegarLoop]: Abstraction has 320 states and 356 transitions. [2018-04-10 14:26:32,433 INFO L460 AbstractCegarLoop]: Interpolant automaton has 34 states. [2018-04-10 14:26:32,433 INFO L276 IsEmpty]: Start isEmpty. Operand 320 states and 356 transitions. [2018-04-10 14:26:32,434 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2018-04-10 14:26:32,434 INFO L347 BasicCegarLoop]: Found error trace [2018-04-10 14:26:32,434 INFO L355 BasicCegarLoop]: trace histogram [4, 4, 3, 3, 3, 3, 3, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-10 14:26:32,434 INFO L408 AbstractCegarLoop]: === Iteration 32 === [mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr31RequiresViolation, mainErr46RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr15RequiresViolation, mainErr49RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr17RequiresViolation, mainErr42RequiresViolation, mainErr30RequiresViolation, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr44RequiresViolation, mainErr10RequiresViolation, mainErr43RequiresViolation, mainErr4RequiresViolation, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr51AssertViolationMEMORY_FREE, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr48RequiresViolation, mainErr52EnsuresViolationMEMORY_LEAK, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr45RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr9RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr50AssertViolationMEMORY_FREE, mainErr8RequiresViolation, mainErr34RequiresViolation, mainErr47RequiresViolation, mainErr14RequiresViolation, mainErr40RequiresViolation]=== [2018-04-10 14:26:32,434 INFO L82 PathProgramCache]: Analyzing trace with hash -533819111, now seen corresponding path program 4 times [2018-04-10 14:26:32,434 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-04-10 14:26:32,434 INFO L68 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-04-10 14:26:32,435 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-10 14:26:32,435 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-04-10 14:26:32,435 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-10 14:26:32,441 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-10 14:26:32,442 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-10 14:26:32,778 INFO L134 CoverageAnalysis]: Checked inductivity of 38 backedges. 0 proven. 38 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-10 14:26:32,779 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-04-10 14:26:32,779 INFO L213 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 21 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 21 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-04-10 14:26:32,785 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-04-10 14:26:32,807 INFO L242 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-04-10 14:26:32,807 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-04-10 14:26:32,809 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-10 14:26:32,842 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 14:26:32,843 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 14:26:32,843 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:26:32,843 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-10 14:26:32,846 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-10 14:26:32,846 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:17, output treesize:11 [2018-04-10 14:26:32,872 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 8 [2018-04-10 14:26:32,877 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:26:32,878 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-10 14:26:32,887 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-10 14:26:32,895 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:26:32,895 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:27, output treesize:20 [2018-04-10 14:26:32,963 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 14:26:32,966 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 27 treesize of output 28 [2018-04-10 14:26:32,967 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select 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:26:32,967 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-10 14:26:32,970 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-10 14:26:32,973 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-04-10 14:26:32,973 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:32, output treesize:24 [2018-04-10 14:26:32,990 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 14:26:32,990 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 14:26:32,991 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:26:32,991 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-10 14:26:32,998 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-10 14:26:32,999 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:35, output treesize:33 [2018-04-10 14:26:33,029 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 26 treesize of output 25 [2018-04-10 14:26:33,034 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 7 [2018-04-10 14:26:33,034 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-10 14:26:33,037 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-10 14:26:33,045 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:26:33,045 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:49, output treesize:39 [2018-04-10 14:26:33,136 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 14:26:33,148 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 65 treesize of output 72 [2018-04-10 14:26:33,151 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 74 treesize of output 73 [2018-04-10 14:26:33,151 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-10 14:26:33,183 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 36 treesize of output 39 [2018-04-10 14:26:33,183 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 2 xjuncts. [2018-04-10 14:26:33,201 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-04-10 14:26:33,215 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:26:33,215 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 2 variables, input treesize:70, output treesize:100 [2018-04-10 14:26:33,260 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 14:26:33,260 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 14:26:33,261 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 14:26:33,261 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 44 treesize of output 64 [2018-04-10 14:26:33,262 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-10 14:26:33,297 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 14:26:33,297 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 14:26:33,298 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 14:26:33,299 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 14:26:33,300 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 77 treesize of output 101 [2018-04-10 14:26:33,300 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-10 14:26:33,330 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 2 xjuncts. [2018-04-10 14:26:33,330 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:122, output treesize:146 [2018-04-10 14:26:33,387 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 61 treesize of output 56 [2018-04-10 14:26:33,389 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 14 treesize of output 7 [2018-04-10 14:26:33,389 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-10 14:26:33,397 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-10 14:26:33,424 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 14:26:33,437 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 3 case distinctions, treesize of input 106 treesize of output 105 [2018-04-10 14:26:33,440 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 113 treesize of output 107 [2018-04-10 14:26:33,441 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-04-10 14:26:33,533 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 3 case distinctions, treesize of input 61 treesize of output 65 [2018-04-10 14:26:33,534 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 3 xjuncts. [2018-04-10 14:26:33,578 INFO L267 ElimStorePlain]: Start of recursive call 4: 2 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-04-10 14:26:33,612 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 2 dim-2 vars, End of recursive call: 1 dim-0 vars, and 3 xjuncts. [2018-04-10 14:26:33,613 INFO L202 ElimStorePlain]: Needed 6 recursive calls to eliminate 5 variables, input treesize:168, output treesize:214 [2018-04-10 14:26:33,783 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 91 treesize of output 74 [2018-04-10 14:26:33,785 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 15 [2018-04-10 14:26:33,785 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-10 14:26:33,791 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-10 14:26:33,819 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 4 new quantified variables, introduced 1 case distinctions, treesize of input 160 treesize of output 110 [2018-04-10 14:26:33,821 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 19 [2018-04-10 14:26:33,821 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-04-10 14:26:33,836 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-10 14:26:33,856 INFO L267 ElimStorePlain]: Start of recursive call 1: 5 dim-0 vars, 2 dim-2 vars, End of recursive call: 5 dim-0 vars, and 2 xjuncts. [2018-04-10 14:26:33,856 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 7 variables, input treesize:252, output treesize:224 [2018-04-10 14:26:33,999 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 5 disjoint index pairs (out of 6 index pairs), introduced 6 new quantified variables, introduced 1 case distinctions, treesize of input 151 treesize of output 89 [2018-04-10 14:26:34,001 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 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:26:34,001 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-10 14:26:34,037 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 77 treesize of output 69 [2018-04-10 14:26:34,037 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:26:34,060 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 69 treesize of output 64 [2018-04-10 14:26:34,061 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-04-10 14:26:34,082 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 5 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 66 treesize of output 56 [2018-04-10 14:26:34,083 INFO L267 ElimStorePlain]: Start of recursive call 6: 2 dim-0 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2018-04-10 14:26:34,105 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 56 treesize of output 45 [2018-04-10 14:26:34,105 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2018-04-10 14:26:34,130 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 64 treesize of output 56 [2018-04-10 14:26:34,131 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:26:34,152 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 56 treesize of output 45 [2018-04-10 14:26:34,152 INFO L267 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 1 xjuncts. [2018-04-10 14:26:34,172 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:26:34,208 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 86 treesize of output 55 [2018-04-10 14:26:34,210 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 16 [2018-04-10 14:26:34,210 INFO L267 ElimStorePlain]: Start of recursive call 11: End of recursive call: and 1 xjuncts. [2018-04-10 14:26:34,220 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 14 [2018-04-10 14:26:34,221 INFO L267 ElimStorePlain]: Start of recursive call 12: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-04-10 14:26:34,229 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select 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:26:34,229 INFO L267 ElimStorePlain]: Start of recursive call 13: End of recursive call: and 1 xjuncts. [2018-04-10 14:26:34,234 INFO L267 ElimStorePlain]: Start of recursive call 10: 3 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-04-10 14:26:34,261 INFO L267 ElimStorePlain]: Start of recursive call 1: 9 dim-0 vars, 2 dim-2 vars, End of recursive call: 8 dim-0 vars, and 3 xjuncts. [2018-04-10 14:26:34,261 INFO L202 ElimStorePlain]: Needed 13 recursive calls to eliminate 11 variables, input treesize:238, output treesize:115 [2018-04-10 14:26:34,356 INFO L134 CoverageAnalysis]: Checked inductivity of 38 backedges. 0 proven. 38 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-10 14:26:34,374 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-04-10 14:26:34,375 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [25, 21] total 45 [2018-04-10 14:26:34,375 INFO L442 AbstractCegarLoop]: Interpolant automaton has 46 states [2018-04-10 14:26:34,375 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 46 interpolants. [2018-04-10 14:26:34,375 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=218, Invalid=1852, Unknown=0, NotChecked=0, Total=2070 [2018-04-10 14:26:34,375 INFO L87 Difference]: Start difference. First operand 320 states and 356 transitions. Second operand 46 states. [2018-04-10 14:26:35,277 WARN L151 SmtUtils]: Spent 107ms on a formula simplification. DAG size of input: 100 DAG size of output 46 [2018-04-10 14:26:39,101 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-10 14:26:39,101 INFO L93 Difference]: Finished difference Result 576 states and 627 transitions. [2018-04-10 14:26:39,101 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 55 states. [2018-04-10 14:26:39,101 INFO L78 Accepts]: Start accepts. Automaton has 46 states. Word has length 53 [2018-04-10 14:26:39,101 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-10 14:26:39,102 INFO L225 Difference]: With dead ends: 576 [2018-04-10 14:26:39,102 INFO L226 Difference]: Without dead ends: 576 [2018-04-10 14:26:39,104 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 133 GetRequests, 36 SyntacticMatches, 1 SemanticMatches, 96 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2958 ImplicationChecksByTransitivity, 3.3s TimeCoverageRelationStatistics Valid=1535, Invalid=7962, Unknown=9, NotChecked=0, Total=9506 [2018-04-10 14:26:39,104 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 576 states. [2018-04-10 14:26:39,107 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 576 to 351. [2018-04-10 14:26:39,107 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 351 states. [2018-04-10 14:26:39,108 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 351 states to 351 states and 392 transitions. [2018-04-10 14:26:39,108 INFO L78 Accepts]: Start accepts. Automaton has 351 states and 392 transitions. Word has length 53 [2018-04-10 14:26:39,108 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-10 14:26:39,108 INFO L459 AbstractCegarLoop]: Abstraction has 351 states and 392 transitions. [2018-04-10 14:26:39,108 INFO L460 AbstractCegarLoop]: Interpolant automaton has 46 states. [2018-04-10 14:26:39,108 INFO L276 IsEmpty]: Start isEmpty. Operand 351 states and 392 transitions. [2018-04-10 14:26:39,109 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2018-04-10 14:26:39,109 INFO L347 BasicCegarLoop]: Found error trace [2018-04-10 14:26:39,109 INFO L355 BasicCegarLoop]: trace histogram [4, 4, 3, 3, 3, 3, 3, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-10 14:26:39,109 INFO L408 AbstractCegarLoop]: === Iteration 33 === [mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr31RequiresViolation, mainErr46RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr15RequiresViolation, mainErr49RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr17RequiresViolation, mainErr42RequiresViolation, mainErr30RequiresViolation, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr44RequiresViolation, mainErr10RequiresViolation, mainErr43RequiresViolation, mainErr4RequiresViolation, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr51AssertViolationMEMORY_FREE, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr48RequiresViolation, mainErr52EnsuresViolationMEMORY_LEAK, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr45RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr9RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr50AssertViolationMEMORY_FREE, mainErr8RequiresViolation, mainErr34RequiresViolation, mainErr47RequiresViolation, mainErr14RequiresViolation, mainErr40RequiresViolation]=== [2018-04-10 14:26:39,109 INFO L82 PathProgramCache]: Analyzing trace with hash -533819110, now seen corresponding path program 3 times [2018-04-10 14:26:39,109 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-04-10 14:26:39,109 INFO L68 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-04-10 14:26:39,110 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-10 14:26:39,110 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-04-10 14:26:39,110 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-10 14:26:39,118 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-10 14:26:39,118 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-10 14:26:39,607 INFO L134 CoverageAnalysis]: Checked inductivity of 38 backedges. 0 proven. 38 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-10 14:26:39,607 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-04-10 14:26:39,607 INFO L213 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 22 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 22 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-04-10 14:26:39,615 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-04-10 14:26:39,665 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) [2018-04-10 14:26:39,665 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-04-10 14:26:39,668 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-10 14:26:39,678 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 14:26:39,679 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 14:26:39,679 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:26:39,680 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-10 14:26:39,690 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 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:26:39,690 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-10 14:26:39,698 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-10 14:26:39,699 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:29, output treesize:22 [2018-04-10 14:26:39,709 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:26:39,710 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 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:26:39,711 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-10 14:26:39,712 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-10 14:26:39,722 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:26:39,723 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select 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:26:39,723 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-04-10 14:26:39,725 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-10 14:26:39,733 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:26:39,733 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 3 variables, input treesize:46, output treesize:39 [2018-04-10 14:26:39,755 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 19 treesize of output 20 [2018-04-10 14:26:39,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 8 treesize of output 7 [2018-04-10 14:26:39,756 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-10 14:26:39,759 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-10 14:26:39,770 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 19 treesize of output 24 [2018-04-10 14:26:39,771 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select 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:26:39,771 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-04-10 14:26:39,775 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-10 14:26:39,782 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-04-10 14:26:39,782 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 2 variables, input treesize:54, output treesize:50 [2018-04-10 14:26:39,808 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 14:26:39,809 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 14:26:39,809 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 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:26:39,809 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-10 14:26:39,823 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 15 [2018-04-10 14:26:39,823 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-10 14:26:39,834 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-10 14:26:39,834 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:67, output treesize:68 [2018-04-10 14:26:39,867 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 36 [2018-04-10 14:26:39,870 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 18 treesize of output 11 [2018-04-10 14:26:39,870 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-10 14:26:39,874 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-10 14:26:39,890 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 46 treesize of output 45 [2018-04-10 14:26:39,892 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 7 [2018-04-10 14:26:39,892 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-04-10 14:26:39,897 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-10 14:26:39,907 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:26:39,907 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 4 variables, input treesize:90, output treesize:62 [2018-04-10 14:26:39,989 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 14:26:39,991 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 19 treesize of output 28 [2018-04-10 14:26:39,993 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 15 [2018-04-10 14:26:39,993 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-10 14:26:39,996 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-10 14:26:40,010 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 14:26:40,021 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 93 treesize of output 88 [2018-04-10 14:26:40,023 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 102 treesize of output 101 [2018-04-10 14:26:40,023 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-04-10 14:26:40,062 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 50 treesize of output 47 [2018-04-10 14:26:40,063 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 2 xjuncts. [2018-04-10 14:26:40,084 INFO L267 ElimStorePlain]: Start of recursive call 4: 2 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-04-10 14:26:40,105 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 2 xjuncts. [2018-04-10 14:26:40,105 INFO L202 ElimStorePlain]: Needed 6 recursive calls to eliminate 3 variables, input treesize:104, output treesize:156 [2018-04-10 14:26:40,162 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 14:26:40,162 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 118 treesize of output 129 [2018-04-10 14:26:40,163 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-10 14:26:40,199 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 14:26:40,199 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 14:26:40,200 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 14:26:40,200 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 117 treesize of output 110 [2018-04-10 14:26:40,200 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-10 14:26:40,233 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 14:26:40,233 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 65 treesize of output 72 [2018-04-10 14:26:40,233 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-04-10 14:26:40,267 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 14:26:40,267 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 14:26:40,268 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 14:26:40,268 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 68 treesize of output 61 [2018-04-10 14:26:40,269 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-04-10 14:26:40,296 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 4 dim-1 vars, End of recursive call: 1 dim-0 vars, and 2 xjuncts. [2018-04-10 14:26:40,297 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 5 variables, input treesize:184, output treesize:172 [2018-04-10 14:26:40,377 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 14:26:40,389 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 129 treesize of output 122 [2018-04-10 14:26:40,392 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 136 treesize of output 130 [2018-04-10 14:26:40,392 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-10 14:26:40,466 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 3 case distinctions, treesize of input 84 treesize of output 84 [2018-04-10 14:26:40,467 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 3 xjuncts. [2018-04-10 14:26:40,531 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: and 3 xjuncts. [2018-04-10 14:26:40,601 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 80 treesize of output 75 [2018-04-10 14:26:40,604 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 14 treesize of output 7 [2018-04-10 14:26:40,604 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2018-04-10 14:26:40,615 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-10 14:26:40,671 INFO L682 Elim1Store]: detected equality via solver [2018-04-10 14:26:40,673 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 118 treesize of output 117 [2018-04-10 14:26:40,675 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 22 treesize of output 15 [2018-04-10 14:26:40,675 INFO L267 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 1 xjuncts. [2018-04-10 14:26:40,687 INFO L267 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-10 14:26:40,689 INFO L682 Elim1Store]: detected equality via solver [2018-04-10 14:26:40,690 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 71 treesize of output 70 [2018-04-10 14:26:40,692 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 18 treesize of output 11 [2018-04-10 14:26:40,693 INFO L267 ElimStorePlain]: Start of recursive call 10: End of recursive call: and 1 xjuncts. [2018-04-10 14:26:40,704 INFO L267 ElimStorePlain]: Start of recursive call 9: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-10 14:26:40,760 INFO L682 Elim1Store]: detected equality via solver [2018-04-10 14:26:40,761 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 69 treesize of output 68 [2018-04-10 14:26:40,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, 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 11 [2018-04-10 14:26:40,763 INFO L267 ElimStorePlain]: Start of recursive call 12: End of recursive call: and 1 xjuncts. [2018-04-10 14:26:40,772 INFO L267 ElimStorePlain]: Start of recursive call 11: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-10 14:26:40,830 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 4 dim-2 vars, End of recursive call: 1 dim-0 vars, and 3 xjuncts. [2018-04-10 14:26:40,830 INFO L202 ElimStorePlain]: Needed 12 recursive calls to eliminate 7 variables, input treesize:210, output treesize:246 [2018-04-10 14:26:41,035 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 150 treesize of output 151 [2018-04-10 14:26:41,037 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 23 [2018-04-10 14:26:41,037 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-10 14:26:41,049 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-10 14:26:41,093 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 138 treesize of output 117 [2018-04-10 14:26:41,094 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 23 [2018-04-10 14:26:41,094 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-04-10 14:26:41,105 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-10 14:26:41,157 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 5 new quantified variables, introduced 4 case distinctions, treesize of input 219 treesize of output 152 [2018-04-10 14:26:41,160 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 224 treesize of output 223 [2018-04-10 14:26:41,161 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2018-04-10 14:26:41,216 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 126 treesize of output 112 [2018-04-10 14:26:41,217 INFO L267 ElimStorePlain]: Start of recursive call 8: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 2 xjuncts. [2018-04-10 14:26:41,262 INFO L267 ElimStorePlain]: Start of recursive call 6: 2 dim-1 vars, End of recursive call: 1 dim-0 vars, and 2 xjuncts. [2018-04-10 14:26:41,321 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 203 treesize of output 188 [2018-04-10 14:26:41,323 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 31 [2018-04-10 14:26:41,323 INFO L267 ElimStorePlain]: Start of recursive call 10: End of recursive call: and 1 xjuncts. [2018-04-10 14:26:41,336 INFO L267 ElimStorePlain]: Start of recursive call 9: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-10 14:26:41,341 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 100 treesize of output 93 [2018-04-10 14:26:41,343 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 15 [2018-04-10 14:26:41,343 INFO L267 ElimStorePlain]: Start of recursive call 12: End of recursive call: and 1 xjuncts. [2018-04-10 14:26:41,355 INFO L267 ElimStorePlain]: Start of recursive call 11: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-10 14:26:41,397 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 4 dim-2 vars, End of recursive call: 5 dim-0 vars, and 3 xjuncts. [2018-04-10 14:26:41,398 INFO L202 ElimStorePlain]: Needed 12 recursive calls to eliminate 7 variables, input treesize:370, output treesize:403 [2018-04-10 14:26:41,685 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 4 disjoint index pairs (out of 6 index pairs), introduced 7 new quantified variables, introduced 2 case distinctions, treesize of input 204 treesize of output 139 [2018-04-10 14:26:41,689 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 116 treesize of output 114 [2018-04-10 14:26:41,689 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-10 14:26:41,777 INFO L682 Elim1Store]: detected equality via solver [2018-04-10 14:26:41,777 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 105 treesize of output 97 [2018-04-10 14:26:41,777 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-04-10 14:26:41,855 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 5 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 91 treesize of output 75 [2018-04-10 14:26:41,856 INFO L267 ElimStorePlain]: Start of recursive call 5: 2 dim-0 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2018-04-10 14:26:41,933 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 124 treesize of output 110 [2018-04-10 14:26:41,934 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:26:42,010 INFO L682 Elim1Store]: detected equality via solver [2018-04-10 14:26:42,010 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 110 treesize of output 100 [2018-04-10 14:26:42,011 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2018-04-10 14:26:42,091 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 94 treesize of output 84 [2018-04-10 14:26:42,092 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:26:42,166 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 84 treesize of output 75 [2018-04-10 14:26:42,167 INFO L267 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 1 xjuncts. [2018-04-10 14:26:42,240 INFO L682 Elim1Store]: detected equality via solver [2018-04-10 14:26:42,241 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 108 treesize of output 102 [2018-04-10 14:26:42,241 INFO L267 ElimStorePlain]: Start of recursive call 10: End of recursive call: and 1 xjuncts. [2018-04-10 14:26:42,317 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 2 new quantified variables, introduced 2 case distinctions, treesize of input 96 treesize of output 87 [2018-04-10 14:26:42,319 INFO L267 ElimStorePlain]: Start of recursive call 11: 4 dim-0 vars, End of recursive call: 4 dim-0 vars, and 3 xjuncts. [2018-04-10 14:26:42,434 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 116 treesize of output 108 [2018-04-10 14:26:42,434 INFO L267 ElimStorePlain]: Start of recursive call 12: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-04-10 14:26:42,548 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 108 treesize of output 93 [2018-04-10 14:26:42,549 INFO L267 ElimStorePlain]: Start of recursive call 13: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 2 xjuncts. [2018-04-10 14:26:42,685 INFO L682 Elim1Store]: detected equality via solver [2018-04-10 14:26:42,685 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 89 treesize of output 81 [2018-04-10 14:26:42,686 INFO L267 ElimStorePlain]: Start of recursive call 14: End of recursive call: and 1 xjuncts. [2018-04-10 14:26:42,687 INFO L682 Elim1Store]: detected equality via solver [2018-04-10 14:26:42,688 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 85 treesize of output 77 [2018-04-10 14:26:42,688 INFO L267 ElimStorePlain]: Start of recursive call 15: End of recursive call: and 1 xjuncts. [2018-04-10 14:26:42,840 INFO L267 ElimStorePlain]: Start of recursive call 2: 12 dim-1 vars, End of recursive call: 11 dim-0 vars, and 7 xjuncts. [2018-04-10 14:26:43,014 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 5 new quantified variables, introduced 0 case distinctions, treesize of input 143 treesize of output 105 [2018-04-10 14:26:43,015 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 37 treesize of output 29 [2018-04-10 14:26:43,016 INFO L267 ElimStorePlain]: Start of recursive call 17: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-04-10 14:26:43,030 INFO L682 Elim1Store]: detected equality via solver [2018-04-10 14:26:43,030 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 58 treesize of output 44 [2018-04-10 14:26:43,031 INFO L267 ElimStorePlain]: Start of recursive call 18: End of recursive call: and 1 xjuncts. [2018-04-10 14:26:43,075 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select 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 7 [2018-04-10 14:26:43,076 INFO L267 ElimStorePlain]: Start of recursive call 19: End of recursive call: and 1 xjuncts. [2018-04-10 14:26:43,084 INFO L267 ElimStorePlain]: Start of recursive call 16: 3 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-04-10 14:26:43,252 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 58 treesize of output 48 [2018-04-10 14:26:43,253 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 5 [2018-04-10 14:26:43,253 INFO L267 ElimStorePlain]: Start of recursive call 21: End of recursive call: and 1 xjuncts. [2018-04-10 14:26:43,262 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2018-04-10 14:26:43,262 INFO L267 ElimStorePlain]: Start of recursive call 22: End of recursive call: and 1 xjuncts. [2018-04-10 14:26:43,269 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select 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:26:43,269 INFO L267 ElimStorePlain]: Start of recursive call 23: End of recursive call: and 1 xjuncts. [2018-04-10 14:26:43,277 INFO L267 ElimStorePlain]: Start of recursive call 20: 3 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-10 14:26:43,434 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 75 treesize of output 65 [2018-04-10 14:26:43,436 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 5 [2018-04-10 14:26:43,436 INFO L267 ElimStorePlain]: Start of recursive call 25: End of recursive call: and 1 xjuncts. [2018-04-10 14:26:43,448 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 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:26:43,448 INFO L267 ElimStorePlain]: Start of recursive call 26: End of recursive call: and 1 xjuncts. [2018-04-10 14:26:43,459 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2018-04-10 14:26:43,459 INFO L267 ElimStorePlain]: Start of recursive call 27: End of recursive call: and 1 xjuncts. [2018-04-10 14:26:43,468 INFO L267 ElimStorePlain]: Start of recursive call 24: 3 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-10 14:26:43,470 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 79 treesize of output 73 [2018-04-10 14:26:43,474 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 5 [2018-04-10 14:26:43,474 INFO L267 ElimStorePlain]: Start of recursive call 29: End of recursive call: and 1 xjuncts. [2018-04-10 14:26:43,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:26:43,493 INFO L267 ElimStorePlain]: Start of recursive call 30: End of recursive call: and 1 xjuncts. [2018-04-10 14:26:43,505 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2018-04-10 14:26:43,506 INFO L267 ElimStorePlain]: Start of recursive call 31: End of recursive call: and 1 xjuncts. [2018-04-10 14:26:43,515 INFO L267 ElimStorePlain]: Start of recursive call 28: 3 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-10 14:26:43,518 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 5 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 75 treesize of output 69 [2018-04-10 14:26:43,519 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2018-04-10 14:26:43,519 INFO L267 ElimStorePlain]: Start of recursive call 33: End of recursive call: and 1 xjuncts. [2018-04-10 14:26:43,532 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 5 [2018-04-10 14:26:43,532 INFO L267 ElimStorePlain]: Start of recursive call 34: End of recursive call: and 1 xjuncts. [2018-04-10 14:26:43,543 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 1 [2018-04-10 14:26:43,543 INFO L267 ElimStorePlain]: Start of recursive call 35: End of recursive call: and 1 xjuncts. [2018-04-10 14:26:43,551 INFO L267 ElimStorePlain]: Start of recursive call 32: 3 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-10 14:26:43,554 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 5 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 75 treesize of output 65 [2018-04-10 14:26:43,556 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 13 treesize of output 5 [2018-04-10 14:26:43,556 INFO L267 ElimStorePlain]: Start of recursive call 37: End of recursive call: and 1 xjuncts. [2018-04-10 14:26:43,568 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select 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:26:43,568 INFO L267 ElimStorePlain]: Start of recursive call 38: End of recursive call: and 1 xjuncts. [2018-04-10 14:26:43,579 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2018-04-10 14:26:43,579 INFO L267 ElimStorePlain]: Start of recursive call 39: End of recursive call: and 1 xjuncts. [2018-04-10 14:26:43,588 INFO L267 ElimStorePlain]: Start of recursive call 36: 3 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-10 14:26:43,590 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 71 treesize of output 61 [2018-04-10 14:26:43,592 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2018-04-10 14:26:43,592 INFO L267 ElimStorePlain]: Start of recursive call 41: End of recursive call: and 1 xjuncts. [2018-04-10 14:26:43,603 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 5 [2018-04-10 14:26:43,603 INFO L267 ElimStorePlain]: Start of recursive call 42: End of recursive call: and 1 xjuncts. [2018-04-10 14:26:43,613 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select 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:26:43,613 INFO L267 ElimStorePlain]: Start of recursive call 43: End of recursive call: and 1 xjuncts. [2018-04-10 14:26:43,621 INFO L267 ElimStorePlain]: Start of recursive call 40: 3 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-10 14:26:43,624 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 75 treesize of output 65 [2018-04-10 14:26:43,625 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2018-04-10 14:26:43,625 INFO L267 ElimStorePlain]: Start of recursive call 45: End of recursive call: and 1 xjuncts. [2018-04-10 14:26:43,638 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 5 [2018-04-10 14:26:43,638 INFO L267 ElimStorePlain]: Start of recursive call 46: End of recursive call: and 1 xjuncts. [2018-04-10 14:26:43,648 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select 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:26:43,649 INFO L267 ElimStorePlain]: Start of recursive call 47: End of recursive call: and 1 xjuncts. [2018-04-10 14:26:43,657 INFO L267 ElimStorePlain]: Start of recursive call 44: 3 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-10 14:26:43,660 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 75 treesize of output 65 [2018-04-10 14:26:43,661 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 5 [2018-04-10 14:26:43,662 INFO L267 ElimStorePlain]: Start of recursive call 49: End of recursive call: and 1 xjuncts. [2018-04-10 14:26:43,674 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2018-04-10 14:26:43,674 INFO L267 ElimStorePlain]: Start of recursive call 50: End of recursive call: and 1 xjuncts. [2018-04-10 14:26:43,686 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 1 [2018-04-10 14:26:43,686 INFO L267 ElimStorePlain]: Start of recursive call 51: End of recursive call: and 1 xjuncts. [2018-04-10 14:26:43,695 INFO L267 ElimStorePlain]: Start of recursive call 48: 3 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-10 14:26:43,809 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 106 treesize of output 104 [2018-04-10 14:26:43,810 INFO L682 Elim1Store]: detected equality via solver [2018-04-10 14:26:43,811 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2018-04-10 14:26:43,811 INFO L267 ElimStorePlain]: Start of recursive call 53: End of recursive call: and 1 xjuncts. [2018-04-10 14:26:43,826 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 5 [2018-04-10 14:26:43,826 INFO L267 ElimStorePlain]: Start of recursive call 54: End of recursive call: and 1 xjuncts. [2018-04-10 14:26:43,837 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 1 [2018-04-10 14:26:43,837 INFO L267 ElimStorePlain]: Start of recursive call 55: End of recursive call: and 1 xjuncts. [2018-04-10 14:26:43,846 INFO L267 ElimStorePlain]: Start of recursive call 52: 3 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-10 14:26:43,953 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 14:26:43,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 4 new quantified variables, introduced 0 case distinctions, treesize of input 70 treesize of output 73 [2018-04-10 14:26:43,957 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 21 [2018-04-10 14:26:43,957 INFO L267 ElimStorePlain]: Start of recursive call 57: End of recursive call: and 1 xjuncts. [2018-04-10 14:26:43,965 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:26:43,965 INFO L267 ElimStorePlain]: Start of recursive call 58: End of recursive call: and 1 xjuncts. [2018-04-10 14:26:43,971 INFO L267 ElimStorePlain]: Start of recursive call 56: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-10 14:26:44,069 INFO L267 ElimStorePlain]: Start of recursive call 1: 11 dim-0 vars, 6 dim-2 vars, End of recursive call: 13 dim-0 vars, and 9 xjuncts. [2018-04-10 14:26:44,069 INFO L202 ElimStorePlain]: Needed 58 recursive calls to eliminate 17 variables, input treesize:454, output treesize:218 [2018-04-10 14:26:44,192 INFO L134 CoverageAnalysis]: Checked inductivity of 38 backedges. 0 proven. 38 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-10 14:26:44,210 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-04-10 14:26:44,211 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [24, 24] total 39 [2018-04-10 14:26:44,211 INFO L442 AbstractCegarLoop]: Interpolant automaton has 40 states [2018-04-10 14:26:44,211 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 40 interpolants. [2018-04-10 14:26:44,211 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=196, Invalid=1357, Unknown=7, NotChecked=0, Total=1560 [2018-04-10 14:26:44,211 INFO L87 Difference]: Start difference. First operand 351 states and 392 transitions. Second operand 40 states. [2018-04-10 14:26:45,506 WARN L151 SmtUtils]: Spent 174ms on a formula simplification. DAG size of input: 140 DAG size of output 123 [2018-04-10 14:26:46,010 WARN L151 SmtUtils]: Spent 139ms on a formula simplification. DAG size of input: 151 DAG size of output 131 [2018-04-10 14:26:48,965 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-10 14:26:48,965 INFO L93 Difference]: Finished difference Result 626 states and 684 transitions. [2018-04-10 14:26:48,966 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 50 states. [2018-04-10 14:26:48,966 INFO L78 Accepts]: Start accepts. Automaton has 40 states. Word has length 53 [2018-04-10 14:26:48,966 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-10 14:26:48,967 INFO L225 Difference]: With dead ends: 626 [2018-04-10 14:26:48,967 INFO L226 Difference]: Without dead ends: 626 [2018-04-10 14:26:48,968 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 126 GetRequests, 35 SyntacticMatches, 6 SemanticMatches, 85 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2271 ImplicationChecksByTransitivity, 4.1s TimeCoverageRelationStatistics Valid=1214, Invalid=6242, Unknown=26, NotChecked=0, Total=7482 [2018-04-10 14:26:48,969 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 626 states. [2018-04-10 14:26:48,970 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 626 to 344. [2018-04-10 14:26:48,970 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 344 states. [2018-04-10 14:26:48,971 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 344 states to 344 states and 384 transitions. [2018-04-10 14:26:48,971 INFO L78 Accepts]: Start accepts. Automaton has 344 states and 384 transitions. Word has length 53 [2018-04-10 14:26:48,971 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-10 14:26:48,972 INFO L459 AbstractCegarLoop]: Abstraction has 344 states and 384 transitions. [2018-04-10 14:26:48,972 INFO L460 AbstractCegarLoop]: Interpolant automaton has 40 states. [2018-04-10 14:26:48,972 INFO L276 IsEmpty]: Start isEmpty. Operand 344 states and 384 transitions. [2018-04-10 14:26:48,972 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2018-04-10 14:26:48,972 INFO L347 BasicCegarLoop]: Found error trace [2018-04-10 14:26:48,972 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:26:48,972 INFO L408 AbstractCegarLoop]: === Iteration 34 === [mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr31RequiresViolation, mainErr46RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr15RequiresViolation, mainErr49RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr17RequiresViolation, mainErr42RequiresViolation, mainErr30RequiresViolation, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr44RequiresViolation, mainErr10RequiresViolation, mainErr43RequiresViolation, mainErr4RequiresViolation, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr51AssertViolationMEMORY_FREE, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr48RequiresViolation, mainErr52EnsuresViolationMEMORY_LEAK, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr45RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr9RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr50AssertViolationMEMORY_FREE, mainErr8RequiresViolation, mainErr34RequiresViolation, mainErr47RequiresViolation, mainErr14RequiresViolation, mainErr40RequiresViolation]=== [2018-04-10 14:26:48,972 INFO L82 PathProgramCache]: Analyzing trace with hash 1044055590, now seen corresponding path program 1 times [2018-04-10 14:26:48,972 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-04-10 14:26:48,972 INFO L68 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-04-10 14:26:48,973 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-10 14:26:48,973 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-04-10 14:26:48,973 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-10 14:26:48,978 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-10 14:26:48,979 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-10 14:26:49,034 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:26:49,034 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-04-10 14:26:49,034 INFO L213 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 23 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 23 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-04-10 14:26:49,043 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-10 14:26:49,070 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-10 14:26:49,072 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-10 14:26:49,082 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 8 [2018-04-10 14:26:49,083 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-04-10 14:26:49,084 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-10 14:26:49,085 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-10 14:26:49,088 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:26:49,088 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:17, output treesize:9 [2018-04-10 14:26:49,110 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 13 [2018-04-10 14:26:49,111 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 5 [2018-04-10 14:26:49,112 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-10 14:26:49,113 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-10 14:26:49,114 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-04-10 14:26:49,114 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:17, output treesize:5 [2018-04-10 14:26:49,122 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:26:49,149 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-04-10 14:26:49,149 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 8] total 9 [2018-04-10 14:26:49,150 INFO L442 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-04-10 14:26:49,150 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-04-10 14:26:49,150 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=70, Unknown=0, NotChecked=0, Total=90 [2018-04-10 14:26:49,150 INFO L87 Difference]: Start difference. First operand 344 states and 384 transitions. Second operand 10 states. [2018-04-10 14:26:49,434 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-10 14:26:49,434 INFO L93 Difference]: Finished difference Result 462 states and 503 transitions. [2018-04-10 14:26:49,434 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2018-04-10 14:26:49,434 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 54 [2018-04-10 14:26:49,434 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-10 14:26:49,435 INFO L225 Difference]: With dead ends: 462 [2018-04-10 14:26:49,435 INFO L226 Difference]: Without dead ends: 462 [2018-04-10 14:26:49,435 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 78 GetRequests, 50 SyntacticMatches, 6 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 86 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=174, Invalid=378, Unknown=0, NotChecked=0, Total=552 [2018-04-10 14:26:49,436 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 462 states. [2018-04-10 14:26:49,438 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 462 to 360. [2018-04-10 14:26:49,438 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 360 states. [2018-04-10 14:26:49,439 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 360 states to 360 states and 404 transitions. [2018-04-10 14:26:49,439 INFO L78 Accepts]: Start accepts. Automaton has 360 states and 404 transitions. Word has length 54 [2018-04-10 14:26:49,439 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-10 14:26:49,439 INFO L459 AbstractCegarLoop]: Abstraction has 360 states and 404 transitions. [2018-04-10 14:26:49,439 INFO L460 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-04-10 14:26:49,439 INFO L276 IsEmpty]: Start isEmpty. Operand 360 states and 404 transitions. [2018-04-10 14:26:49,440 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2018-04-10 14:26:49,440 INFO L347 BasicCegarLoop]: Found error trace [2018-04-10 14:26:49,440 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:26:49,440 INFO L408 AbstractCegarLoop]: === Iteration 35 === [mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr31RequiresViolation, mainErr46RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr15RequiresViolation, mainErr49RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr17RequiresViolation, mainErr42RequiresViolation, mainErr30RequiresViolation, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr44RequiresViolation, mainErr10RequiresViolation, mainErr43RequiresViolation, mainErr4RequiresViolation, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr51AssertViolationMEMORY_FREE, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr48RequiresViolation, mainErr52EnsuresViolationMEMORY_LEAK, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr45RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr9RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr50AssertViolationMEMORY_FREE, mainErr8RequiresViolation, mainErr34RequiresViolation, mainErr47RequiresViolation, mainErr14RequiresViolation, mainErr40RequiresViolation]=== [2018-04-10 14:26:49,441 INFO L82 PathProgramCache]: Analyzing trace with hash 1044055591, now seen corresponding path program 1 times [2018-04-10 14:26:49,441 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-04-10 14:26:49,441 INFO L68 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-04-10 14:26:49,441 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-10 14:26:49,441 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-10 14:26:49,442 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-10 14:26:49,448 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-10 14:26:49,449 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-10 14:26:49,567 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:26:49,567 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-04-10 14:26:49,567 INFO L213 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 24 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 24 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-04-10 14:26:49,572 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-10 14:26:49,588 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-10 14:26:49,589 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-10 14:26:49,625 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 14:26:49,626 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 17 [2018-04-10 14:26:49,626 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-10 14:26:49,631 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 14:26:49,632 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 14:26:49,632 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:26:49,632 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-10 14:26:49,636 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:26:49,636 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:27, output treesize:20 [2018-04-10 14:26:49,687 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 8 [2018-04-10 14:26:49,689 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-04-10 14:26:49,689 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-10 14:26:49,692 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-10 14:26:49,706 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 8 [2018-04-10 14:26:49,707 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select 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:26:49,708 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-04-10 14:26:49,709 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-10 14:26:49,715 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-04-10 14:26:49,715 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 4 variables, input treesize:37, output treesize:30 [2018-04-10 14:26:49,752 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 19 [2018-04-10 14:26:49,754 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 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:26:49,754 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-10 14:26:49,756 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-10 14:26:49,761 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:26:49,762 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select 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:26:49,762 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-04-10 14:26:49,763 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-10 14:26:49,767 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 2 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-04-10 14:26:49,767 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 5 variables, input treesize:44, output treesize:18 [2018-04-10 14:26:49,786 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:26:49,804 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-04-10 14:26:49,804 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11] total 21 [2018-04-10 14:26:49,804 INFO L442 AbstractCegarLoop]: Interpolant automaton has 22 states [2018-04-10 14:26:49,804 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2018-04-10 14:26:49,805 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=63, Invalid=399, Unknown=0, NotChecked=0, Total=462 [2018-04-10 14:26:49,805 INFO L87 Difference]: Start difference. First operand 360 states and 404 transitions. Second operand 22 states. [2018-04-10 14:26:50,486 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-10 14:26:50,486 INFO L93 Difference]: Finished difference Result 535 states and 588 transitions. [2018-04-10 14:26:50,486 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2018-04-10 14:26:50,486 INFO L78 Accepts]: Start accepts. Automaton has 22 states. Word has length 54 [2018-04-10 14:26:50,486 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-10 14:26:50,488 INFO L225 Difference]: With dead ends: 535 [2018-04-10 14:26:50,488 INFO L226 Difference]: Without dead ends: 535 [2018-04-10 14:26:50,488 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 87 GetRequests, 47 SyntacticMatches, 3 SemanticMatches, 37 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 354 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=267, Invalid=1215, Unknown=0, NotChecked=0, Total=1482 [2018-04-10 14:26:50,489 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 535 states. [2018-04-10 14:26:50,491 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 535 to 410. [2018-04-10 14:26:50,491 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 410 states. [2018-04-10 14:26:50,492 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 410 states to 410 states and 477 transitions. [2018-04-10 14:26:50,492 INFO L78 Accepts]: Start accepts. Automaton has 410 states and 477 transitions. Word has length 54 [2018-04-10 14:26:50,492 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-10 14:26:50,492 INFO L459 AbstractCegarLoop]: Abstraction has 410 states and 477 transitions. [2018-04-10 14:26:50,492 INFO L460 AbstractCegarLoop]: Interpolant automaton has 22 states. [2018-04-10 14:26:50,492 INFO L276 IsEmpty]: Start isEmpty. Operand 410 states and 477 transitions. [2018-04-10 14:26:50,492 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2018-04-10 14:26:50,492 INFO L347 BasicCegarLoop]: Found error trace [2018-04-10 14:26:50,492 INFO L355 BasicCegarLoop]: trace histogram [3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-10 14:26:50,492 INFO L408 AbstractCegarLoop]: === Iteration 36 === [mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr31RequiresViolation, mainErr46RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr15RequiresViolation, mainErr49RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr17RequiresViolation, mainErr42RequiresViolation, mainErr30RequiresViolation, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr44RequiresViolation, mainErr10RequiresViolation, mainErr43RequiresViolation, mainErr4RequiresViolation, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr51AssertViolationMEMORY_FREE, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr48RequiresViolation, mainErr52EnsuresViolationMEMORY_LEAK, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr45RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr9RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr50AssertViolationMEMORY_FREE, mainErr8RequiresViolation, mainErr34RequiresViolation, mainErr47RequiresViolation, mainErr14RequiresViolation, mainErr40RequiresViolation]=== [2018-04-10 14:26:50,493 INFO L82 PathProgramCache]: Analyzing trace with hash 1142343843, now seen corresponding path program 5 times [2018-04-10 14:26:50,493 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-04-10 14:26:50,493 INFO L68 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-04-10 14:26:50,493 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-10 14:26:50,493 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-10 14:26:50,494 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-10 14:26:50,500 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-10 14:26:50,501 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-10 14:26:50,782 INFO L134 CoverageAnalysis]: Checked inductivity of 29 backedges. 0 proven. 29 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-10 14:26:50,782 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-04-10 14:26:50,783 INFO L213 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 25 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 25 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-04-10 14:26:50,789 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2018-04-10 14:26:50,822 INFO L242 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 3 check-sat command(s) [2018-04-10 14:26:50,822 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-04-10 14:26:50,824 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-10 14:26:50,831 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 14:26:50,832 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 14:26:50,833 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 21 [2018-04-10 14:26:50,833 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-10 14:26:50,841 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-10 14:26:50,841 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:26, output treesize:24 [2018-04-10 14:26:50,865 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:26:50,866 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:26:50,866 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-10 14:26:50,867 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-10 14:26:50,875 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:26:50,876 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select 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:26:50,877 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-04-10 14:26:50,878 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-10 14:26:50,884 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:26:50,884 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 3 variables, input treesize:43, output treesize:36 [2018-04-10 14:26:50,948 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 14:26:50,950 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 31 [2018-04-10 14:26:50,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 12 treesize of output 15 [2018-04-10 14:26:50,952 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-10 14:26:50,956 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-10 14:26:50,965 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 14:26:50,966 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:26:50,968 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select 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 11 [2018-04-10 14:26:50,968 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-04-10 14:26:50,973 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-10 14:26:50,981 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-04-10 14:26:50,981 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 2 variables, input treesize:66, output treesize:66 [2018-04-10 14:26:51,006 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 14:26:51,007 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 14:26:51,007 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 14:26:51,008 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:26:51,008 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-10 14:26:51,023 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-10 14:26:51,023 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:77, output treesize:83 [2018-04-10 14:26:51,089 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 52 treesize of output 62 [2018-04-10 14:26:51,091 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 22 treesize of output 30 [2018-04-10 14:26:51,091 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-10 14:26:51,096 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-10 14:26:51,112 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 62 treesize of output 61 [2018-04-10 14:26:51,114 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 18 treesize of output 26 [2018-04-10 14:26:51,114 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-04-10 14:26:51,120 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-10 14:26:51,130 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:26:51,131 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 4 variables, input treesize:105, output treesize:81 [2018-04-10 14:26:51,217 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 141 treesize of output 112 [2018-04-10 14:26:51,218 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 19 [2018-04-10 14:26:51,219 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-10 14:26:51,226 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-10 14:26:51,248 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 115 treesize of output 103 [2018-04-10 14:26:51,249 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 19 [2018-04-10 14:26:51,249 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-04-10 14:26:51,256 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-10 14:26:51,265 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:26:51,265 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 3 variables, input treesize:153, output treesize:121 [2018-04-10 14:26:51,349 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 106 treesize of output 93 [2018-04-10 14:26:51,351 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 1 [2018-04-10 14:26:51,351 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-10 14:26:51,359 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 75 treesize of output 60 [2018-04-10 14:26:51,359 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-04-10 14:26:51,365 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-10 14:26:51,375 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:26:51,376 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 4 variables, input treesize:135, output treesize:89 [2018-04-10 14:26:51,436 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 85 treesize of output 50 [2018-04-10 14:26:51,437 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 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:26:51,438 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-04-10 14:26:51,444 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:26:51,444 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-04-10 14:26:51,449 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 1 [2018-04-10 14:26:51,449 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-04-10 14:26:51,452 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:26:51,457 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2018-04-10 14:26:51,457 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 4 variables, input treesize:90, output treesize:28 [2018-04-10 14:26:51,525 INFO L134 CoverageAnalysis]: Checked inductivity of 29 backedges. 0 proven. 29 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-10 14:26:51,542 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-04-10 14:26:51,542 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [19, 18] total 34 [2018-04-10 14:26:51,543 INFO L442 AbstractCegarLoop]: Interpolant automaton has 35 states [2018-04-10 14:26:51,543 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 35 interpolants. [2018-04-10 14:26:51,543 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=139, Invalid=1051, Unknown=0, NotChecked=0, Total=1190 [2018-04-10 14:26:51,543 INFO L87 Difference]: Start difference. First operand 410 states and 477 transitions. Second operand 35 states. [2018-04-10 14:26:53,900 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-10 14:26:53,900 INFO L93 Difference]: Finished difference Result 525 states and 597 transitions. [2018-04-10 14:26:53,900 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2018-04-10 14:26:53,900 INFO L78 Accepts]: Start accepts. Automaton has 35 states. Word has length 54 [2018-04-10 14:26:53,900 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-10 14:26:53,901 INFO L225 Difference]: With dead ends: 525 [2018-04-10 14:26:53,901 INFO L226 Difference]: Without dead ends: 525 [2018-04-10 14:26:53,902 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 91 GetRequests, 39 SyntacticMatches, 3 SemanticMatches, 49 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 577 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=357, Invalid=2193, Unknown=0, NotChecked=0, Total=2550 [2018-04-10 14:26:53,902 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 525 states. [2018-04-10 14:26:53,904 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 525 to 427. [2018-04-10 14:26:53,904 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 427 states. [2018-04-10 14:26:53,905 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 427 states to 427 states and 497 transitions. [2018-04-10 14:26:53,905 INFO L78 Accepts]: Start accepts. Automaton has 427 states and 497 transitions. Word has length 54 [2018-04-10 14:26:53,905 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-10 14:26:53,905 INFO L459 AbstractCegarLoop]: Abstraction has 427 states and 497 transitions. [2018-04-10 14:26:53,905 INFO L460 AbstractCegarLoop]: Interpolant automaton has 35 states. [2018-04-10 14:26:53,905 INFO L276 IsEmpty]: Start isEmpty. Operand 427 states and 497 transitions. [2018-04-10 14:26:53,905 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2018-04-10 14:26:53,906 INFO L347 BasicCegarLoop]: Found error trace [2018-04-10 14:26:53,906 INFO L355 BasicCegarLoop]: trace histogram [3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-10 14:26:53,906 INFO L408 AbstractCegarLoop]: === Iteration 37 === [mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr31RequiresViolation, mainErr46RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr15RequiresViolation, mainErr49RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr17RequiresViolation, mainErr42RequiresViolation, mainErr30RequiresViolation, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr44RequiresViolation, mainErr10RequiresViolation, mainErr43RequiresViolation, mainErr4RequiresViolation, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr51AssertViolationMEMORY_FREE, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr48RequiresViolation, mainErr52EnsuresViolationMEMORY_LEAK, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr45RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr9RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr50AssertViolationMEMORY_FREE, mainErr8RequiresViolation, mainErr34RequiresViolation, mainErr47RequiresViolation, mainErr14RequiresViolation, mainErr40RequiresViolation]=== [2018-04-10 14:26:53,906 INFO L82 PathProgramCache]: Analyzing trace with hash 1142343844, now seen corresponding path program 4 times [2018-04-10 14:26:53,906 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-04-10 14:26:53,906 INFO L68 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-04-10 14:26:53,906 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-10 14:26:53,906 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-04-10 14:26:53,907 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-10 14:26:53,912 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-10 14:26:53,912 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-10 14:26:54,142 INFO L134 CoverageAnalysis]: Checked inductivity of 29 backedges. 0 proven. 29 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-10 14:26:54,142 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-04-10 14:26:54,142 INFO L213 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 26 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 26 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-04-10 14:26:54,147 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-04-10 14:26:54,161 INFO L242 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-04-10 14:26:54,161 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-04-10 14:26:54,163 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-10 14:26:54,167 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 14:26:54,167 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 14:26:54,168 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:26:54,168 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-10 14:26:54,181 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-10 14:26:54,181 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:26, output treesize:24 [2018-04-10 14:26:54,203 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:26:54,205 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 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:26:54,205 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-10 14:26:54,206 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-10 14:26:54,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:26:54,216 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select 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:26:54,216 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-04-10 14:26:54,217 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-10 14:26:54,225 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:26:54,225 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 3 variables, input treesize:43, output treesize:36 [2018-04-10 14:26:54,292 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 14:26:54,294 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 31 [2018-04-10 14:26:54,295 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 15 [2018-04-10 14:26:54,296 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-10 14:26:54,300 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-10 14:26:54,309 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 14:26:54,311 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:26:54,312 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select 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 11 [2018-04-10 14:26:54,312 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-04-10 14:26:54,317 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-10 14:26:54,324 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-04-10 14:26:54,324 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 2 variables, input treesize:66, output treesize:66 [2018-04-10 14:26:54,352 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 14:26:54,353 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 14:26:54,353 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 14:26:54,353 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:26:54,353 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-10 14:26:54,364 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:26:54,365 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-10 14:26:54,374 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-10 14:26:54,374 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:80, output treesize:72 [2018-04-10 14:26:54,409 INFO L682 Elim1Store]: detected equality via solver [2018-04-10 14:26:54,411 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 52 treesize of output 63 [2018-04-10 14:26:54,412 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 30 [2018-04-10 14:26:54,412 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-10 14:26:54,417 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-10 14:26:54,430 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 53 treesize of output 52 [2018-04-10 14:26:54,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 18 treesize of output 26 [2018-04-10 14:26:54,432 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-04-10 14:26:54,437 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-10 14:26:54,445 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:26:54,445 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 3 variables, input treesize:91, output treesize:82 [2018-04-10 14:26:54,525 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 146 treesize of output 142 [2018-04-10 14:26:54,526 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 19 [2018-04-10 14:26:54,526 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-10 14:26:54,536 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-10 14:26:54,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 3 new quantified variables, introduced 0 case distinctions, treesize of input 131 treesize of output 106 [2018-04-10 14:26:54,554 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 19 [2018-04-10 14:26:54,554 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-04-10 14:26:54,562 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-10 14:26:54,572 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:26:54,572 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 3 variables, input treesize:154, output treesize:122 [2018-04-10 14:26:54,717 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 145 treesize of output 98 [2018-04-10 14:26:54,719 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 56 treesize of output 23 [2018-04-10 14:26:54,719 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-10 14:26:54,727 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select 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:26:54,728 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-04-10 14:26:54,734 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 39 treesize of output 31 [2018-04-10 14:26:54,735 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:26:54,740 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:26:54,750 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 37 treesize of output 37 [2018-04-10 14:26:54,751 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select 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:26:54,751 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2018-04-10 14:26:54,756 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 11 [2018-04-10 14:26:54,756 INFO L267 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 1 xjuncts. [2018-04-10 14:26:54,758 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select 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:26:54,759 INFO L267 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 1 xjuncts. [2018-04-10 14:26:54,759 INFO L267 ElimStorePlain]: Start of recursive call 6: 3 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-10 14:26:54,763 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:26:54,763 INFO L202 ElimStorePlain]: Needed 9 recursive calls to eliminate 5 variables, input treesize:152, output treesize:9 [2018-04-10 14:26:54,794 INFO L134 CoverageAnalysis]: Checked inductivity of 29 backedges. 0 proven. 29 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-10 14:26:54,812 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-04-10 14:26:54,812 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [18, 18] total 31 [2018-04-10 14:26:54,812 INFO L442 AbstractCegarLoop]: Interpolant automaton has 32 states [2018-04-10 14:26:54,812 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 32 interpolants. [2018-04-10 14:26:54,812 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=98, Invalid=894, Unknown=0, NotChecked=0, Total=992 [2018-04-10 14:26:54,812 INFO L87 Difference]: Start difference. First operand 427 states and 497 transitions. Second operand 32 states. [2018-04-10 14:26:56,246 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-10 14:26:56,246 INFO L93 Difference]: Finished difference Result 547 states and 623 transitions. [2018-04-10 14:26:56,247 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2018-04-10 14:26:56,247 INFO L78 Accepts]: Start accepts. Automaton has 32 states. Word has length 54 [2018-04-10 14:26:56,247 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-10 14:26:56,248 INFO L225 Difference]: With dead ends: 547 [2018-04-10 14:26:56,248 INFO L226 Difference]: Without dead ends: 547 [2018-04-10 14:26:56,248 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 90 GetRequests, 40 SyntacticMatches, 5 SemanticMatches, 45 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 517 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=238, Invalid=1924, Unknown=0, NotChecked=0, Total=2162 [2018-04-10 14:26:56,248 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 547 states. [2018-04-10 14:26:56,250 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 547 to 420. [2018-04-10 14:26:56,250 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 420 states. [2018-04-10 14:26:56,251 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 420 states to 420 states and 489 transitions. [2018-04-10 14:26:56,251 INFO L78 Accepts]: Start accepts. Automaton has 420 states and 489 transitions. Word has length 54 [2018-04-10 14:26:56,251 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-10 14:26:56,251 INFO L459 AbstractCegarLoop]: Abstraction has 420 states and 489 transitions. [2018-04-10 14:26:56,251 INFO L460 AbstractCegarLoop]: Interpolant automaton has 32 states. [2018-04-10 14:26:56,251 INFO L276 IsEmpty]: Start isEmpty. Operand 420 states and 489 transitions. [2018-04-10 14:26:56,252 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2018-04-10 14:26:56,252 INFO L347 BasicCegarLoop]: Found error trace [2018-04-10 14:26:56,252 INFO L355 BasicCegarLoop]: trace histogram [4, 4, 3, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-10 14:26:56,252 INFO L408 AbstractCegarLoop]: === Iteration 38 === [mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr31RequiresViolation, mainErr46RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr15RequiresViolation, mainErr49RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr17RequiresViolation, mainErr42RequiresViolation, mainErr30RequiresViolation, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr44RequiresViolation, mainErr10RequiresViolation, mainErr43RequiresViolation, mainErr4RequiresViolation, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr51AssertViolationMEMORY_FREE, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr48RequiresViolation, mainErr52EnsuresViolationMEMORY_LEAK, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr45RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr9RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr50AssertViolationMEMORY_FREE, mainErr8RequiresViolation, mainErr34RequiresViolation, mainErr47RequiresViolation, mainErr14RequiresViolation, mainErr40RequiresViolation]=== [2018-04-10 14:26:56,252 INFO L82 PathProgramCache]: Analyzing trace with hash -635493166, now seen corresponding path program 3 times [2018-04-10 14:26:56,252 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-04-10 14:26:56,252 INFO L68 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-04-10 14:26:56,254 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-10 14:26:56,254 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-04-10 14:26:56,254 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-10 14:26:56,263 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-10 14:26:56,264 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-10 14:26:56,876 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 36 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-10 14:26:56,876 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-04-10 14:26:56,876 INFO L213 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 27 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 27 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-04-10 14:26:56,882 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-04-10 14:26:56,921 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) [2018-04-10 14:26:56,921 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-04-10 14:26:56,923 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-10 14:26:56,988 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 8 [2018-04-10 14:26:56,989 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 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:26:56,989 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-10 14:26:56,990 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-10 14:26:56,996 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 8 [2018-04-10 14:26:56,997 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-04-10 14:26:56,998 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-04-10 14:26:56,998 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-10 14:26:57,003 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:26:57,003 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 3 variables, input treesize:32, output treesize:17 [2018-04-10 14:26:57,076 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 19 treesize of output 31 [2018-04-10 14:26:57,078 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 23 [2018-04-10 14:26:57,078 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-10 14:26:57,088 INFO L682 Elim1Store]: detected equality via solver [2018-04-10 14:26:57,088 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 18 [2018-04-10 14:26:57,088 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-04-10 14:26:57,094 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-04-10 14:26:57,104 INFO L682 Elim1Store]: detected equality via solver [2018-04-10 14:26:57,105 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 40 treesize of output 36 [2018-04-10 14:26:57,106 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 21 [2018-04-10 14:26:57,106 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2018-04-10 14:26:57,109 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-10 14:26:57,118 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 44 treesize of output 64 [2018-04-10 14:26:57,119 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 53 treesize of output 56 [2018-04-10 14:26:57,119 INFO L267 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 1 xjuncts. [2018-04-10 14:26:57,143 INFO L267 ElimStorePlain]: Start of recursive call 7: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-10 14:26:57,154 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 2 xjuncts. [2018-04-10 14:26:57,154 INFO L202 ElimStorePlain]: Needed 8 recursive calls to eliminate 2 variables, input treesize:47, output treesize:76 [2018-04-10 14:26:57,246 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 78 treesize of output 86 [2018-04-10 14:26:57,249 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 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 78 [2018-04-10 14:26:57,249 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-10 14:26:57,288 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 59 treesize of output 69 [2018-04-10 14:26:57,289 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-04-10 14:26:57,314 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-04-10 14:26:57,354 INFO L682 Elim1Store]: detected equality via solver [2018-04-10 14:26:57,354 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 59 treesize of output 51 [2018-04-10 14:26:57,355 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 43 treesize of output 27 [2018-04-10 14:26:57,355 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2018-04-10 14:26:57,362 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-10 14:26:57,364 INFO L682 Elim1Store]: detected equality via solver [2018-04-10 14:26:57,366 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 71 treesize of output 71 [2018-04-10 14:26:57,369 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 30 [2018-04-10 14:26:57,370 INFO L267 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 1 xjuncts. [2018-04-10 14:26:57,377 INFO L267 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-10 14:26:57,409 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 51 treesize of output 46 [2018-04-10 14:26:57,411 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 14 treesize of output 11 [2018-04-10 14:26:57,411 INFO L267 ElimStorePlain]: Start of recursive call 10: End of recursive call: and 1 xjuncts. [2018-04-10 14:26:57,419 INFO L267 ElimStorePlain]: Start of recursive call 9: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-10 14:26:57,452 INFO L682 Elim1Store]: detected equality via solver [2018-04-10 14:26:57,452 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 40 treesize of output 35 [2018-04-10 14:26:57,454 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 14 treesize of output 11 [2018-04-10 14:26:57,454 INFO L267 ElimStorePlain]: Start of recursive call 12: End of recursive call: and 1 xjuncts. [2018-04-10 14:26:57,459 INFO L267 ElimStorePlain]: Start of recursive call 11: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-10 14:26:57,480 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 4 dim-2 vars, End of recursive call: and 3 xjuncts. [2018-04-10 14:26:57,480 INFO L202 ElimStorePlain]: Needed 12 recursive calls to eliminate 6 variables, input treesize:130, output treesize:97 [2018-04-10 14:26:57,634 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 4 new quantified variables, introduced 7 case distinctions, treesize of input 87 treesize of output 111 [2018-04-10 14:26:57,637 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 96 treesize of output 107 [2018-04-10 14:26:57,638 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-10 14:26:57,736 INFO L682 Elim1Store]: detected equality via solver [2018-04-10 14:26:57,737 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 85 treesize of output 94 [2018-04-10 14:26:57,737 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-04-10 14:26:57,795 INFO L682 Elim1Store]: detected equality via solver [2018-04-10 14:26:57,796 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 58 treesize of output 51 [2018-04-10 14:26:57,796 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-04-10 14:26:57,848 INFO L682 Elim1Store]: detected equality via solver [2018-04-10 14:26:57,848 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 79 treesize of output 73 [2018-04-10 14:26:57,849 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:26:57,892 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-0 vars, 4 dim-1 vars, End of recursive call: 1 dim-0 vars, and 4 xjuncts. [2018-04-10 14:26:57,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, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 52 treesize of output 64 [2018-04-10 14:26:57,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 53 treesize of output 56 [2018-04-10 14:26:57,979 INFO L267 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 1 xjuncts. [2018-04-10 14:26:58,003 INFO L682 Elim1Store]: detected equality via solver [2018-04-10 14:26:58,004 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 50 treesize of output 51 [2018-04-10 14:26:58,004 INFO L267 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 1 xjuncts. [2018-04-10 14:26:58,029 INFO L267 ElimStorePlain]: Start of recursive call 7: 2 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-04-10 14:26:58,132 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 7 case distinctions, treesize of input 95 treesize of output 98 [2018-04-10 14:26:58,135 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 104 treesize of output 115 [2018-04-10 14:26:58,135 INFO L267 ElimStorePlain]: Start of recursive call 11: End of recursive call: and 1 xjuncts. [2018-04-10 14:26:58,189 INFO L267 ElimStorePlain]: Start of recursive call 10: 1 dim-1 vars, End of recursive call: and 4 xjuncts. [2018-04-10 14:26:58,193 INFO L682 Elim1Store]: detected equality via solver [2018-04-10 14:26:58,201 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 2 new quantified variables, introduced 4 case distinctions, treesize of input 70 treesize of output 65 [2018-04-10 14:26:58,203 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 46 treesize of output 32 [2018-04-10 14:26:58,203 INFO L267 ElimStorePlain]: Start of recursive call 13: End of recursive call: and 1 xjuncts. [2018-04-10 14:26:58,212 INFO L267 ElimStorePlain]: Start of recursive call 12: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-10 14:26:58,213 INFO L682 Elim1Store]: detected equality via solver [2018-04-10 14:26:58,214 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 48 treesize of output 44 [2018-04-10 14:26:58,216 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 14 [2018-04-10 14:26:58,216 INFO L267 ElimStorePlain]: Start of recursive call 15: End of recursive call: and 1 xjuncts. [2018-04-10 14:26:58,222 INFO L267 ElimStorePlain]: Start of recursive call 14: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-10 14:26:58,227 INFO L682 Elim1Store]: detected equality via solver [2018-04-10 14:26:58,234 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 2 new quantified variables, introduced 4 case distinctions, treesize of input 79 treesize of output 70 [2018-04-10 14:26:58,236 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 40 treesize of output 41 [2018-04-10 14:26:58,236 INFO L267 ElimStorePlain]: Start of recursive call 17: End of recursive call: and 1 xjuncts. [2018-04-10 14:26:58,244 INFO L267 ElimStorePlain]: Start of recursive call 16: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-10 14:26:58,345 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 52 treesize of output 64 [2018-04-10 14:26:58,347 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 61 treesize of output 64 [2018-04-10 14:26:58,347 INFO L267 ElimStorePlain]: Start of recursive call 19: End of recursive call: and 1 xjuncts. [2018-04-10 14:26:58,363 INFO L267 ElimStorePlain]: Start of recursive call 18: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-10 14:26:58,408 INFO L267 ElimStorePlain]: Start of recursive call 1: 4 dim-2 vars, End of recursive call: 1 dim-0 vars, and 5 xjuncts. [2018-04-10 14:26:58,408 INFO L202 ElimStorePlain]: Needed 19 recursive calls to eliminate 4 variables, input treesize:140, output treesize:296 [2018-04-10 14:26:58,516 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 14:26:58,517 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 14:26:58,517 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 74 treesize of output 86 [2018-04-10 14:26:58,518 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-10 14:26:58,590 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 14:26:58,590 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 14:26:58,591 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 43 treesize of output 47 [2018-04-10 14:26:58,591 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-10 14:26:58,662 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 14:26:58,663 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 14:26:58,663 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 61 treesize of output 65 [2018-04-10 14:26:58,663 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-04-10 14:26:58,733 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 14:26:58,733 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 14:26:58,734 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 70 treesize of output 74 [2018-04-10 14:26:58,734 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-04-10 14:26:58,817 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 14:26:58,818 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 14:26:58,818 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 117 treesize of output 129 [2018-04-10 14:26:58,818 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2018-04-10 14:26:58,877 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 5 dim-1 vars, End of recursive call: 1 dim-0 vars, and 5 xjuncts. [2018-04-10 14:26:58,877 INFO L202 ElimStorePlain]: Needed 6 recursive calls to eliminate 6 variables, input treesize:366, output treesize:364 [2018-04-10 14:26:59,010 INFO L682 Elim1Store]: detected equality via solver [2018-04-10 14:26:59,016 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 2 new quantified variables, introduced 4 case distinctions, treesize of input 100 treesize of output 97 [2018-04-10 14:26:59,018 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 30 [2018-04-10 14:26:59,018 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-10 14:26:59,028 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-10 14:26:59,455 INFO L682 Elim1Store]: detected equality via solver [2018-04-10 14:26:59,467 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 7 case distinctions, treesize of input 143 treesize of output 121 [2018-04-10 14:26:59,469 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 50 [2018-04-10 14:26:59,469 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-04-10 14:26:59,488 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-10 14:26:59,779 INFO L682 Elim1Store]: detected equality via solver [2018-04-10 14:26:59,787 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 2 new quantified variables, introduced 4 case distinctions, treesize of input 92 treesize of output 101 [2018-04-10 14:26:59,788 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 100 treesize of output 89 [2018-04-10 14:26:59,789 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2018-04-10 14:26:59,821 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-04-10 14:27:00,044 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 60 treesize of output 55 [2018-04-10 14:27:00,045 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 11 [2018-04-10 14:27:00,046 INFO L267 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 1 xjuncts. [2018-04-10 14:27:00,054 INFO L267 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-10 14:27:00,218 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 14:27:00,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, 2 disjoint index pairs (out of 3 index pairs), introduced 4 new quantified variables, introduced 7 case distinctions, treesize of input 132 treesize of output 155 [2018-04-10 14:27:00,236 INFO L267 ElimStorePlain]: Start of recursive call 11: 2 dim-0 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2018-04-10 14:27:00,394 INFO L682 Elim1Store]: detected equality via solver [2018-04-10 14:27:00,395 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 73 treesize of output 63 [2018-04-10 14:27:00,395 INFO L267 ElimStorePlain]: Start of recursive call 12: End of recursive call: and 1 xjuncts. [2018-04-10 14:27:00,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, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 127 treesize of output 121 [2018-04-10 14:27:00,517 INFO L267 ElimStorePlain]: Start of recursive call 13: End of recursive call: and 1 xjuncts. [2018-04-10 14:27:00,591 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 14:27:00,592 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 104 treesize of output 146 [2018-04-10 14:27:00,592 INFO L267 ElimStorePlain]: Start of recursive call 14: End of recursive call: and 1 xjuncts. [2018-04-10 14:27:00,650 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 99 treesize of output 90 [2018-04-10 14:27:00,650 INFO L267 ElimStorePlain]: Start of recursive call 15: End of recursive call: and 1 xjuncts. [2018-04-10 14:27:00,697 INFO L267 ElimStorePlain]: Start of recursive call 10: 5 dim-1 vars, End of recursive call: and 4 xjuncts. [2018-04-10 14:27:00,905 INFO L682 Elim1Store]: detected equality via solver [2018-04-10 14:27:00,905 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 49 treesize of output 44 [2018-04-10 14:27:00,907 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 14 treesize of output 11 [2018-04-10 14:27:00,907 INFO L267 ElimStorePlain]: Start of recursive call 17: End of recursive call: and 1 xjuncts. [2018-04-10 14:27:00,914 INFO L267 ElimStorePlain]: Start of recursive call 16: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-10 14:27:01,101 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 83 treesize of output 93 [2018-04-10 14:27:01,104 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 82 treesize of output 80 [2018-04-10 14:27:01,105 INFO L267 ElimStorePlain]: Start of recursive call 19: End of recursive call: and 1 xjuncts. [2018-04-10 14:27:01,142 INFO L682 Elim1Store]: detected equality via solver [2018-04-10 14:27:01,143 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 14:27:01,144 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 67 treesize of output 85 [2018-04-10 14:27:01,144 INFO L267 ElimStorePlain]: Start of recursive call 20: End of recursive call: and 1 xjuncts. [2018-04-10 14:27:01,175 INFO L267 ElimStorePlain]: Start of recursive call 18: 2 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-04-10 14:27:01,339 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 14:27:01,340 INFO L682 Elim1Store]: detected equality via solver [2018-04-10 14:27:01,341 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 76 treesize of output 79 [2018-04-10 14:27:01,342 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 18 treesize of output 15 [2018-04-10 14:27:01,343 INFO L267 ElimStorePlain]: Start of recursive call 22: End of recursive call: and 1 xjuncts. [2018-04-10 14:27:01,353 INFO L267 ElimStorePlain]: Start of recursive call 21: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-10 14:27:01,355 INFO L682 Elim1Store]: detected equality via solver [2018-04-10 14:27:01,355 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 71 treesize of output 63 [2018-04-10 14:27:01,356 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 44 treesize of output 28 [2018-04-10 14:27:01,357 INFO L267 ElimStorePlain]: Start of recursive call 24: End of recursive call: and 1 xjuncts. [2018-04-10 14:27:01,365 INFO L267 ElimStorePlain]: Start of recursive call 23: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-10 14:27:01,540 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 81 treesize of output 89 [2018-04-10 14:27:01,551 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 80 treesize of output 74 [2018-04-10 14:27:01,551 INFO L267 ElimStorePlain]: Start of recursive call 26: End of recursive call: and 1 xjuncts. [2018-04-10 14:27:01,582 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 14:27:01,582 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 57 treesize of output 61 [2018-04-10 14:27:01,583 INFO L267 ElimStorePlain]: Start of recursive call 27: End of recursive call: and 1 xjuncts. [2018-04-10 14:27:01,609 INFO L267 ElimStorePlain]: Start of recursive call 25: 2 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-04-10 14:27:01,953 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 14:27:01,961 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 84 treesize of output 95 [2018-04-10 14:27:01,964 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 92 treesize of output 85 [2018-04-10 14:27:01,964 INFO L267 ElimStorePlain]: Start of recursive call 29: End of recursive call: and 1 xjuncts. [2018-04-10 14:27:01,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, 1 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 61 treesize of output 64 [2018-04-10 14:27:02,000 INFO L267 ElimStorePlain]: Start of recursive call 30: End of recursive call: and 1 xjuncts. [2018-04-10 14:27:02,022 INFO L267 ElimStorePlain]: Start of recursive call 28: 2 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-04-10 14:27:02,178 INFO L267 ElimStorePlain]: Start of recursive call 1: 6 dim-0 vars, 10 dim-2 vars, End of recursive call: 1 dim-0 vars, and 11 xjuncts. [2018-04-10 14:27:02,178 INFO L202 ElimStorePlain]: Needed 30 recursive calls to eliminate 16 variables, input treesize:479, output treesize:820 [2018-04-10 14:27:02,405 WARN L151 SmtUtils]: Spent 128ms on a formula simplification. DAG size of input: 133 DAG size of output 93 [2018-04-10 14:27:02,670 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 14:27:02,671 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 14:27:02,672 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 14:27:02,695 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 5 new quantified variables, introduced 6 case distinctions, treesize of input 342 treesize of output 319 [2018-04-10 14:27:02,701 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 431 treesize of output 430 [2018-04-10 14:27:02,701 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-10 14:27:02,774 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-10 14:27:02,918 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 79 treesize of output 72 [2018-04-10 14:27:02,919 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 15 [2018-04-10 14:27:02,920 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-04-10 14:27:02,926 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-10 14:27:03,041 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 71 treesize of output 67 [2018-04-10 14:27:03,043 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 15 [2018-04-10 14:27:03,043 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2018-04-10 14:27:03,049 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-10 14:27:03,150 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 14:27:03,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, 2 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 166 treesize of output 157 [2018-04-10 14:27:03,164 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 175 treesize of output 174 [2018-04-10 14:27:03,164 INFO L267 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 1 xjuncts. [2018-04-10 14:27:03,186 INFO L267 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-10 14:27:03,270 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 14:27:03,273 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 14:27:03,284 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 4 new quantified variables, introduced 3 case distinctions, treesize of input 150 treesize of output 146 [2018-04-10 14:27:03,287 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 171 treesize of output 170 [2018-04-10 14:27:03,287 INFO L267 ElimStorePlain]: Start of recursive call 11: End of recursive call: and 1 xjuncts. [2018-04-10 14:27:03,333 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 2 new quantified variables, introduced 0 case distinctions, treesize of input 93 treesize of output 84 [2018-04-10 14:27:03,333 INFO L267 ElimStorePlain]: Start of recursive call 12: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-04-10 14:27:03,356 INFO L267 ElimStorePlain]: Start of recursive call 10: 2 dim-1 vars, End of recursive call: 1 dim-0 vars, and 2 xjuncts. [2018-04-10 14:27:03,441 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 14:27:03,444 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 14:27:03,457 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 2 disjoint index pairs (out of 6 index pairs), introduced 2 new quantified variables, introduced 6 case distinctions, treesize of input 118 treesize of output 145 [2018-04-10 14:27:03,459 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 150 treesize of output 149 [2018-04-10 14:27:03,460 INFO L267 ElimStorePlain]: Start of recursive call 14: End of recursive call: and 1 xjuncts. [2018-04-10 14:27:03,488 INFO L267 ElimStorePlain]: Start of recursive call 13: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-10 14:27:03,565 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 14:27:03,566 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 14:27:03,567 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 14:27:03,572 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 14:27:03,574 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 14:27:03,599 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 6 new quantified variables, introduced 6 case distinctions, treesize of input 310 treesize of output 282 [2018-04-10 14:27:03,627 INFO L477 Elim1Store]: Elim1 applied some 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 6 new quantified variables, introduced 7 case distinctions, treesize of input 368 treesize of output 353 [2018-04-10 14:27:03,634 INFO L267 ElimStorePlain]: Start of recursive call 16: 21 dim-0 vars, End of recursive call: 21 dim-0 vars, and 9 xjuncts. [2018-04-10 14:27:04,157 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 279 treesize of output 278 [2018-04-10 14:27:04,157 INFO L267 ElimStorePlain]: Start of recursive call 17: End of recursive call: and 1 xjuncts. [2018-04-10 14:27:04,456 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 196 treesize of output 193 [2018-04-10 14:27:04,456 INFO L267 ElimStorePlain]: Start of recursive call 18: End of recursive call: and 1 xjuncts. [2018-04-10 14:27:04,726 INFO L267 ElimStorePlain]: Start of recursive call 15: 3 dim-1 vars, End of recursive call: 21 dim-0 vars, and 11 xjuncts. [2018-04-10 14:27:05,080 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 14:27:05,082 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 14:27:05,093 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 118 treesize of output 133 [2018-04-10 14:27:05,095 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 131 treesize of output 130 [2018-04-10 14:27:05,095 INFO L267 ElimStorePlain]: Start of recursive call 20: End of recursive call: and 1 xjuncts. [2018-04-10 14:27:05,176 INFO L682 Elim1Store]: detected equality via solver [2018-04-10 14:27:05,178 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 84 treesize of output 92 [2018-04-10 14:27:05,178 INFO L267 ElimStorePlain]: Start of recursive call 21: End of recursive call: and 1 xjuncts. [2018-04-10 14:27:05,214 INFO L267 ElimStorePlain]: Start of recursive call 19: 2 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-04-10 14:27:05,545 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 8 dim-2 vars, End of recursive call: 23 dim-0 vars, and 14 xjuncts. [2018-04-10 14:27:05,545 INFO L202 ElimStorePlain]: Needed 21 recursive calls to eliminate 9 variables, input treesize:706, output treesize:2604 [2018-04-10 14:27:06,003 WARN L151 SmtUtils]: Spent 198ms on a formula simplification. DAG size of input: 399 DAG size of output 70 [2018-04-10 14:27:06,267 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 80 treesize of output 66 [2018-04-10 14:27:06,268 INFO L682 Elim1Store]: detected equality via solver [2018-04-10 14:27:06,269 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 23 [2018-04-10 14:27:06,269 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-10 14:27:06,280 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2018-04-10 14:27:06,280 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-04-10 14:27:06,287 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-10 14:27:06,375 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 14:27:06,380 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 151 treesize of output 132 [2018-04-10 14:27:06,383 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 125 treesize of output 114 [2018-04-10 14:27:06,383 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2018-04-10 14:27:06,412 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 98 treesize of output 83 [2018-04-10 14:27:06,412 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2018-04-10 14:27:06,436 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 106 treesize of output 99 [2018-04-10 14:27:06,436 INFO L267 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 1 xjuncts. [2018-04-10 14:27:06,458 INFO L682 Elim1Store]: detected equality via solver [2018-04-10 14:27:06,458 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 99 treesize of output 85 [2018-04-10 14:27:06,458 INFO L267 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 1 xjuncts. [2018-04-10 14:27:06,478 INFO L682 Elim1Store]: detected equality via solver [2018-04-10 14:27:06,478 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 83 treesize of output 73 [2018-04-10 14:27:06,478 INFO L267 ElimStorePlain]: Start of recursive call 10: End of recursive call: and 1 xjuncts. [2018-04-10 14:27:06,490 INFO L267 ElimStorePlain]: Start of recursive call 5: 5 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-10 14:27:06,546 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 98 treesize of output 68 [2018-04-10 14:27:06,547 INFO L682 Elim1Store]: detected equality via solver [2018-04-10 14:27:06,548 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 34 treesize of output 27 [2018-04-10 14:27:06,548 INFO L267 ElimStorePlain]: Start of recursive call 12: End of recursive call: and 1 xjuncts. [2018-04-10 14:27:06,559 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select 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:27:06,559 INFO L267 ElimStorePlain]: Start of recursive call 13: End of recursive call: and 1 xjuncts. [2018-04-10 14:27:06,567 INFO L267 ElimStorePlain]: Start of recursive call 11: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-10 14:27:06,619 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 14:27:06,619 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 14:27:06,620 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 14:27:06,630 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 4 disjoint index pairs (out of 6 index pairs), introduced 6 new quantified variables, introduced 2 case distinctions, treesize of input 295 treesize of output 245 [2018-04-10 14:27:06,633 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 249 treesize of output 231 [2018-04-10 14:27:06,633 INFO L267 ElimStorePlain]: Start of recursive call 15: End of recursive call: and 1 xjuncts. [2018-04-10 14:27:06,726 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 186 treesize of output 177 [2018-04-10 14:27:06,726 INFO L267 ElimStorePlain]: Start of recursive call 16: End of recursive call: and 1 xjuncts. [2018-04-10 14:27:06,794 INFO L682 Elim1Store]: detected equality via solver [2018-04-10 14:27:06,795 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 182 treesize of output 153 [2018-04-10 14:27:06,795 INFO L267 ElimStorePlain]: Start of recursive call 17: End of recursive call: and 1 xjuncts. [2018-04-10 14:27:06,860 INFO L682 Elim1Store]: detected equality via solver [2018-04-10 14:27:06,861 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 177 treesize of output 145 [2018-04-10 14:27:06,861 INFO L267 ElimStorePlain]: Start of recursive call 18: End of recursive call: and 1 xjuncts. [2018-04-10 14:27:06,922 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 139 treesize of output 112 [2018-04-10 14:27:06,923 INFO L267 ElimStorePlain]: Start of recursive call 19: End of recursive call: and 1 xjuncts. [2018-04-10 14:27:06,981 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 139 treesize of output 132 [2018-04-10 14:27:06,982 INFO L267 ElimStorePlain]: Start of recursive call 20: End of recursive call: and 1 xjuncts. [2018-04-10 14:27:07,038 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 144 treesize of output 133 [2018-04-10 14:27:07,039 INFO L267 ElimStorePlain]: Start of recursive call 21: End of recursive call: and 1 xjuncts. [2018-04-10 14:27:07,097 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 166 treesize of output 147 [2018-04-10 14:27:07,098 INFO L267 ElimStorePlain]: Start of recursive call 22: End of recursive call: and 1 xjuncts. [2018-04-10 14:27:07,153 INFO L682 Elim1Store]: detected equality via solver [2018-04-10 14:27:07,153 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 147 treesize of output 121 [2018-04-10 14:27:07,154 INFO L267 ElimStorePlain]: Start of recursive call 23: End of recursive call: and 1 xjuncts. [2018-04-10 14:27:07,214 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 115 treesize of output 108 [2018-04-10 14:27:07,215 INFO L267 ElimStorePlain]: Start of recursive call 24: End of recursive call: and 1 xjuncts. [2018-04-10 14:27:07,263 INFO L682 Elim1Store]: detected equality via solver [2018-04-10 14:27:07,263 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 112 treesize of output 98 [2018-04-10 14:27:07,263 INFO L267 ElimStorePlain]: Start of recursive call 25: End of recursive call: and 1 xjuncts. [2018-04-10 14:27:07,287 INFO L267 ElimStorePlain]: Start of recursive call 14: 12 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-10 14:27:07,323 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 4 dim-2 vars, End of recursive call: 1 dim-0 vars, and 4 xjuncts. [2018-04-10 14:27:07,323 INFO L202 ElimStorePlain]: Needed 25 recursive calls to eliminate 6 variables, input treesize:625, output treesize:252 [2018-04-10 14:27:07,547 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 14:27:07,547 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 14:27:07,548 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 39 [2018-04-10 14:27:07,551 INFO L477 Elim1Store]: Elim1 applied some preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 29 treesize of output 28 [2018-04-10 14:27:07,552 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:27:07,560 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select 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:27:07,560 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-04-10 14:27:07,563 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-10 14:27:07,582 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 14:27:07,583 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 14:27:07,584 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 14:27:07,585 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 14:27:07,585 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 14:27:07,586 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 53 treesize of output 64 [2018-04-10 14:27:07,596 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 4 new quantified variables, introduced 3 case distinctions, treesize of input 41 treesize of output 56 [2018-04-10 14:27:07,598 INFO L267 ElimStorePlain]: Start of recursive call 6: 10 dim-0 vars, End of recursive call: 10 dim-0 vars, and 7 xjuncts. [2018-04-10 14:27:07,614 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 33 treesize of output 27 [2018-04-10 14:27:07,615 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:27:07,621 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 1 [2018-04-10 14:27:07,621 INFO L267 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 1 xjuncts. [2018-04-10 14:27:07,626 INFO L267 ElimStorePlain]: Start of recursive call 5: 3 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-04-10 14:27:07,661 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 14:27:07,661 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 14:27:07,662 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 14:27:07,663 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 14:27:07,664 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 14:27:07,664 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 14:27:07,665 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 14:27:07,669 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 9 disjoint index pairs (out of 6 index pairs), introduced 6 new quantified variables, introduced 1 case distinctions, treesize of input 94 treesize of output 102 [2018-04-10 14:27:07,674 INFO L477 Elim1Store]: Elim1 applied some preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 4 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 92 treesize of output 94 [2018-04-10 14:27:07,675 INFO L267 ElimStorePlain]: Start of recursive call 10: 3 dim-0 vars, End of recursive call: 3 dim-0 vars, and 2 xjuncts. [2018-04-10 14:27:07,732 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 78 treesize of output 70 [2018-04-10 14:27:07,732 INFO L267 ElimStorePlain]: Start of recursive call 11: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-04-10 14:27:07,733 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 72 treesize of output 64 [2018-04-10 14:27:07,734 INFO L267 ElimStorePlain]: Start of recursive call 12: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-04-10 14:27:07,775 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 5 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 70 treesize of output 61 [2018-04-10 14:27:07,775 INFO L267 ElimStorePlain]: Start of recursive call 13: End of recursive call: and 2 xjuncts. [2018-04-10 14:27:07,776 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 4 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 64 treesize of output 49 [2018-04-10 14:27:07,777 INFO L267 ElimStorePlain]: Start of recursive call 14: End of recursive call: and 1 xjuncts. [2018-04-10 14:27:07,814 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 64 treesize of output 58 [2018-04-10 14:27:07,814 INFO L267 ElimStorePlain]: Start of recursive call 15: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-04-10 14:27:07,846 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 49 treesize of output 44 [2018-04-10 14:27:07,847 INFO L267 ElimStorePlain]: Start of recursive call 16: End of recursive call: and 1 xjuncts. [2018-04-10 14:27:07,847 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 49 treesize of output 44 [2018-04-10 14:27:07,848 INFO L267 ElimStorePlain]: Start of recursive call 17: End of recursive call: and 1 xjuncts. [2018-04-10 14:27:07,877 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 58 treesize of output 49 [2018-04-10 14:27:07,877 INFO L267 ElimStorePlain]: Start of recursive call 18: End of recursive call: and 1 xjuncts. [2018-04-10 14:27:07,905 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 49 treesize of output 36 [2018-04-10 14:27:07,905 INFO L267 ElimStorePlain]: Start of recursive call 19: End of recursive call: and 1 xjuncts. [2018-04-10 14:27:07,931 INFO L267 ElimStorePlain]: Start of recursive call 9: 7 dim-1 vars, End of recursive call: 5 dim-0 vars, and 3 xjuncts. [2018-04-10 14:27:07,990 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 3 dim-2 vars, End of recursive call: 7 dim-0 vars, and 5 xjuncts. [2018-04-10 14:27:07,990 INFO L202 ElimStorePlain]: Needed 19 recursive calls to eliminate 6 variables, input treesize:189, output treesize:127 [2018-04-10 14:27:08,093 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 36 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-10 14:27:08,114 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-04-10 14:27:08,114 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [25, 24] total 48 [2018-04-10 14:27:08,115 INFO L442 AbstractCegarLoop]: Interpolant automaton has 49 states [2018-04-10 14:27:08,115 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 49 interpolants. [2018-04-10 14:27:08,115 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=190, Invalid=2160, Unknown=2, NotChecked=0, Total=2352 [2018-04-10 14:27:08,115 INFO L87 Difference]: Start difference. First operand 420 states and 489 transitions. Second operand 49 states. [2018-04-10 14:27:08,928 WARN L151 SmtUtils]: Spent 115ms on a formula simplification. DAG size of input: 201 DAG size of output 36 [2018-04-10 14:27:09,266 WARN L151 SmtUtils]: Spent 189ms on a formula simplification. DAG size of input: 215 DAG size of output 54 [2018-04-10 14:27:09,448 WARN L151 SmtUtils]: Spent 122ms on a formula simplification. DAG size of input: 216 DAG size of output 42 [2018-04-10 14:27:09,803 WARN L151 SmtUtils]: Spent 123ms on a formula simplification. DAG size of input: 172 DAG size of output 52 [2018-04-10 14:27:10,212 WARN L151 SmtUtils]: Spent 151ms on a formula simplification. DAG size of input: 200 DAG size of output 52 [2018-04-10 14:27:10,633 WARN L151 SmtUtils]: Spent 165ms on a formula simplification. DAG size of input: 217 DAG size of output 56 [2018-04-10 14:27:10,940 WARN L151 SmtUtils]: Spent 209ms on a formula simplification. DAG size of input: 209 DAG size of output 62 [2018-04-10 14:27:11,230 WARN L151 SmtUtils]: Spent 197ms on a formula simplification. DAG size of input: 245 DAG size of output 60 [2018-04-10 14:27:11,406 WARN L151 SmtUtils]: Spent 138ms on a formula simplification. DAG size of input: 75 DAG size of output 68 [2018-04-10 14:27:11,580 WARN L151 SmtUtils]: Spent 121ms on a formula simplification. DAG size of input: 143 DAG size of output 57 [2018-04-10 14:27:11,887 WARN L151 SmtUtils]: Spent 203ms on a formula simplification. DAG size of input: 156 DAG size of output 76 [2018-04-10 14:27:12,155 WARN L151 SmtUtils]: Spent 182ms on a formula simplification. DAG size of input: 224 DAG size of output 57 [2018-04-10 14:27:12,368 WARN L151 SmtUtils]: Spent 177ms on a formula simplification. DAG size of input: 84 DAG size of output 73 [2018-04-10 14:27:12,516 WARN L151 SmtUtils]: Spent 116ms on a formula simplification. DAG size of input: 75 DAG size of output 75 [2018-04-10 14:27:12,986 WARN L151 SmtUtils]: Spent 370ms on a formula simplification. DAG size of input: 150 DAG size of output 118 [2018-04-10 14:27:13,223 WARN L151 SmtUtils]: Spent 191ms on a formula simplification. DAG size of input: 92 DAG size of output 81 [2018-04-10 14:27:13,594 WARN L151 SmtUtils]: Spent 190ms on a formula simplification. DAG size of input: 154 DAG size of output 72 [2018-04-10 14:27:13,868 WARN L151 SmtUtils]: Spent 175ms on a formula simplification. DAG size of input: 247 DAG size of output 62 [2018-04-10 14:27:14,243 WARN L151 SmtUtils]: Spent 205ms on a formula simplification. DAG size of input: 163 DAG size of output 82 [2018-04-10 14:27:14,507 WARN L151 SmtUtils]: Spent 186ms on a formula simplification. DAG size of input: 226 DAG size of output 59 [2018-04-10 14:27:14,783 WARN L151 SmtUtils]: Spent 211ms on a formula simplification. DAG size of input: 166 DAG size of output 85 [2018-04-10 14:27:15,292 WARN L151 SmtUtils]: Spent 220ms on a formula simplification. DAG size of input: 184 DAG size of output 79 [2018-04-10 14:27:15,873 WARN L151 SmtUtils]: Spent 234ms on a formula simplification. DAG size of input: 93 DAG size of output 76 [2018-04-10 14:27:16,461 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-10 14:27:16,461 INFO L93 Difference]: Finished difference Result 581 states and 650 transitions. [2018-04-10 14:27:16,461 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 49 states. [2018-04-10 14:27:16,461 INFO L78 Accepts]: Start accepts. Automaton has 49 states. Word has length 54 [2018-04-10 14:27:16,461 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-10 14:27:16,462 INFO L225 Difference]: With dead ends: 581 [2018-04-10 14:27:16,462 INFO L226 Difference]: Without dead ends: 567 [2018-04-10 14:27:16,463 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 127 GetRequests, 34 SyntacticMatches, 1 SemanticMatches, 92 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2033 ImplicationChecksByTransitivity, 8.8s TimeCoverageRelationStatistics Valid=1393, Invalid=7347, Unknown=2, NotChecked=0, Total=8742 [2018-04-10 14:27:16,463 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 567 states. [2018-04-10 14:27:16,465 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 567 to 434. [2018-04-10 14:27:16,465 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 434 states. [2018-04-10 14:27:16,466 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 434 states to 434 states and 502 transitions. [2018-04-10 14:27:16,466 INFO L78 Accepts]: Start accepts. Automaton has 434 states and 502 transitions. Word has length 54 [2018-04-10 14:27:16,466 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-10 14:27:16,466 INFO L459 AbstractCegarLoop]: Abstraction has 434 states and 502 transitions. [2018-04-10 14:27:16,466 INFO L460 AbstractCegarLoop]: Interpolant automaton has 49 states. [2018-04-10 14:27:16,466 INFO L276 IsEmpty]: Start isEmpty. Operand 434 states and 502 transitions. [2018-04-10 14:27:16,467 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2018-04-10 14:27:16,467 INFO L347 BasicCegarLoop]: Found error trace [2018-04-10 14:27:16,467 INFO L355 BasicCegarLoop]: trace histogram [4, 4, 3, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-10 14:27:16,467 INFO L408 AbstractCegarLoop]: === Iteration 39 === [mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr31RequiresViolation, mainErr46RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr15RequiresViolation, mainErr49RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr17RequiresViolation, mainErr42RequiresViolation, mainErr30RequiresViolation, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr44RequiresViolation, mainErr10RequiresViolation, mainErr43RequiresViolation, mainErr4RequiresViolation, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr51AssertViolationMEMORY_FREE, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr48RequiresViolation, mainErr52EnsuresViolationMEMORY_LEAK, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr45RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr9RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr50AssertViolationMEMORY_FREE, mainErr8RequiresViolation, mainErr34RequiresViolation, mainErr47RequiresViolation, mainErr14RequiresViolation, mainErr40RequiresViolation]=== [2018-04-10 14:27:16,467 INFO L82 PathProgramCache]: Analyzing trace with hash -635493165, now seen corresponding path program 3 times [2018-04-10 14:27:16,467 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-04-10 14:27:16,467 INFO L68 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-04-10 14:27:16,468 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-10 14:27:16,468 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-04-10 14:27:16,468 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-10 14:27:16,474 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-10 14:27:16,475 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-10 14:27:16,800 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 36 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-10 14:27:16,800 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-04-10 14:27:16,800 INFO L213 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 28 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 28 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-04-10 14:27:16,806 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-04-10 14:27:16,841 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) [2018-04-10 14:27:16,841 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-04-10 14:27:16,843 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-10 14:27:16,848 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select 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:27:16,848 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-10 14:27:16,855 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 14:27:16,856 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 14:27:16,856 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 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:27:16,856 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-10 14:27:16,864 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-10 14:27:16,864 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:35, output treesize:32 [2018-04-10 14:27:16,890 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:27:16,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, 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:27:16,891 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-10 14:27:16,892 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-10 14:27:16,901 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:27:16,902 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select 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:27:16,902 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-04-10 14:27:16,904 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-10 14:27:16,911 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:27:16,912 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 3 variables, input treesize:51, output treesize:48 [2018-04-10 14:27:16,981 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 14:27:16,983 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 45 treesize of output 46 [2018-04-10 14:27:16,984 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select 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:27:16,984 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-10 14:27:16,990 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-10 14:27:17,002 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 19 treesize of output 24 [2018-04-10 14:27:17,003 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 11 [2018-04-10 14:27:17,003 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-04-10 14:27:17,006 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-10 14:27:17,014 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-04-10 14:27:17,014 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 2 variables, input treesize:71, output treesize:63 [2018-04-10 14:27:17,042 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 14:27:17,042 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:27:17,043 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-10 14:27:17,056 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 14:27:17,056 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 14:27:17,057 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 14:27:17,057 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:27:17,057 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-10 14:27:17,068 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-10 14:27:17,068 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:77, output treesize:69 [2018-04-10 14:27:17,100 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 30 treesize of output 36 [2018-04-10 14:27:17,102 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 18 treesize of output 11 [2018-04-10 14:27:17,103 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-10 14:27:17,106 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-10 14:27:17,121 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 54 treesize of output 53 [2018-04-10 14:27:17,123 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 7 [2018-04-10 14:27:17,123 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-04-10 14:27:17,129 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-10 14:27:17,139 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:27:17,139 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 4 variables, input treesize:91, output treesize:71 [2018-04-10 14:27:17,227 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 14:27:17,227 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 14:27:17,232 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 41 treesize of output 66 [2018-04-10 14:27:17,234 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 15 [2018-04-10 14:27:17,234 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-10 14:27:17,241 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-10 14:27:17,256 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 14:27:17,257 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 14:27:17,261 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 118 treesize of output 114 [2018-04-10 14:27:17,263 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 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:27:17,263 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-04-10 14:27:17,275 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-10 14:27:17,287 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:27:17,288 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 3 variables, input treesize:124, output treesize:116 [2018-04-10 14:27:17,328 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 29 treesize of output 44 [2018-04-10 14:27:17,329 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-10 14:27:17,346 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:27:17,346 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:125, output treesize:124 [2018-04-10 14:27:17,388 INFO L682 Elim1Store]: detected equality via solver [2018-04-10 14:27:17,392 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 56 treesize of output 82 [2018-04-10 14:27:17,394 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 22 treesize of output 15 [2018-04-10 14:27:17,394 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-10 14:27:17,411 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-10 14:27:17,433 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 14:27:17,442 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 113 treesize of output 111 [2018-04-10 14:27:17,445 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 14 treesize of output 7 [2018-04-10 14:27:17,445 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-04-10 14:27:17,457 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-10 14:27:17,474 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-04-10 14:27:17,474 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 4 variables, input treesize:146, output treesize:121 [2018-04-10 14:27:17,632 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 6 new quantified variables, introduced 9 case distinctions, treesize of input 159 treesize of output 161 [2018-04-10 14:27:17,633 WARN L130 XnfTransformerHelper]: expecting exponential blowup for input size 6 [2018-04-10 14:27:17,648 INFO L682 Elim1Store]: detected equality via solver [2018-04-10 14:27:17,649 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 169 treesize of output 181 [2018-04-10 14:27:17,650 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-04-10 14:27:22,181 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:27:25,353 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 156 treesize of output 155 [2018-04-10 14:27:25,353 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-04-10 14:27:30,751 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 113 treesize of output 105 [2018-04-10 14:27:30,752 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 2 xjuncts. [2018-04-10 14:27:32,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 1 new quantified variables, introduced 0 case distinctions, treesize of input 135 treesize of output 113 [2018-04-10 14:27:32,366 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:27:34,981 INFO L267 ElimStorePlain]: Start of recursive call 2: 4 dim-0 vars, 10 dim-1 vars, End of recursive call: 7 dim-0 vars, and 10 xjuncts. [2018-04-10 14:27:36,324 INFO L682 Elim1Store]: detected equality via solver [2018-04-10 14:27:36,329 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 159 treesize of output 153 [2018-04-10 14:27:36,331 INFO L682 Elim1Store]: detected equality via solver [2018-04-10 14:27:36,331 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 43 treesize of output 29 [2018-04-10 14:27:36,332 INFO L267 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 1 xjuncts. [2018-04-10 14:27:36,348 INFO L267 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-10 14:27:36,351 INFO L682 Elim1Store]: detected equality via solver [2018-04-10 14:27:36,355 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 147 treesize of output 183 [2018-04-10 14:27:36,357 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 35 treesize of output 38 [2018-04-10 14:27:36,358 INFO L267 ElimStorePlain]: Start of recursive call 11: End of recursive call: and 1 xjuncts. [2018-04-10 14:27:36,377 INFO L267 ElimStorePlain]: Start of recursive call 10: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-10 14:27:36,414 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 3 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 9 case distinctions, treesize of input 162 treesize of output 202 [2018-04-10 14:27:36,414 WARN L130 XnfTransformerHelper]: expecting exponential blowup for input size 6 [2018-04-10 14:27:36,422 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 183 treesize of output 182 [2018-04-10 14:27:36,422 INFO L267 ElimStorePlain]: Start of recursive call 13: End of recursive call: and 1 xjuncts. [2018-04-10 14:27:36,716 INFO L267 ElimStorePlain]: Start of recursive call 12: 8 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-10 14:27:36,719 INFO L682 Elim1Store]: detected equality via solver [2018-04-10 14:27:36,724 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 3 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 109 treesize of output 121 [2018-04-10 14:27:36,726 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 35 treesize of output 38 [2018-04-10 14:27:36,726 INFO L267 ElimStorePlain]: Start of recursive call 15: End of recursive call: and 1 xjuncts. [2018-04-10 14:27:36,741 INFO L267 ElimStorePlain]: Start of recursive call 14: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-10 14:27:36,757 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 143 treesize of output 140 [2018-04-10 14:27:36,760 INFO L682 Elim1Store]: detected equality via solver [2018-04-10 14:27:36,760 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 31 treesize of output 64 [2018-04-10 14:27:36,761 INFO L267 ElimStorePlain]: Start of recursive call 17: End of recursive call: and 1 xjuncts. [2018-04-10 14:27:36,778 INFO L267 ElimStorePlain]: Start of recursive call 16: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-10 14:27:36,781 INFO L682 Elim1Store]: detected equality via solver [2018-04-10 14:27:36,785 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 153 treesize of output 143 [2018-04-10 14:27:36,787 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 40 treesize of output 26 [2018-04-10 14:27:36,787 INFO L267 ElimStorePlain]: Start of recursive call 19: End of recursive call: and 1 xjuncts. [2018-04-10 14:27:36,801 INFO L267 ElimStorePlain]: Start of recursive call 18: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-10 14:27:36,804 INFO L682 Elim1Store]: detected equality via solver [2018-04-10 14:27:36,807 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 104 treesize of output 102 [2018-04-10 14:27:36,809 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 44 [2018-04-10 14:27:36,809 INFO L267 ElimStorePlain]: Start of recursive call 21: End of recursive call: and 1 xjuncts. [2018-04-10 14:27:36,822 INFO L267 ElimStorePlain]: Start of recursive call 20: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-10 14:27:36,825 INFO L682 Elim1Store]: detected equality via solver [2018-04-10 14:27:36,829 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 145 treesize of output 181 [2018-04-10 14:27:36,830 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 35 treesize of output 38 [2018-04-10 14:27:36,830 INFO L267 ElimStorePlain]: Start of recursive call 23: End of recursive call: and 1 xjuncts. [2018-04-10 14:27:36,848 INFO L267 ElimStorePlain]: Start of recursive call 22: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-10 14:27:36,851 INFO L682 Elim1Store]: detected equality via solver [2018-04-10 14:27:36,855 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 168 treesize of output 158 [2018-04-10 14:27:36,857 INFO L682 Elim1Store]: detected equality via solver [2018-04-10 14:27:36,857 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 47 treesize of output 33 [2018-04-10 14:27:36,857 INFO L267 ElimStorePlain]: Start of recursive call 25: End of recursive call: and 1 xjuncts. [2018-04-10 14:27:36,873 INFO L267 ElimStorePlain]: Start of recursive call 24: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-10 14:27:36,876 INFO L682 Elim1Store]: detected equality via solver [2018-04-10 14:27:36,880 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 154 treesize of output 198 [2018-04-10 14:27:36,882 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 35 treesize of output 38 [2018-04-10 14:27:36,883 INFO L267 ElimStorePlain]: Start of recursive call 27: End of recursive call: and 1 xjuncts. [2018-04-10 14:27:36,900 INFO L267 ElimStorePlain]: Start of recursive call 26: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-10 14:27:37,165 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 2 dim-2 vars, End of recursive call: 27 dim-0 vars, and 10 xjuncts. [2018-04-10 14:27:37,165 INFO L202 ElimStorePlain]: Needed 27 recursive calls to eliminate 5 variables, input treesize:172, output treesize:1335 [2018-04-10 14:27:37,574 WARN L151 SmtUtils]: Spent 194ms on a formula simplification. DAG size of input: 316 DAG size of output 129 [2018-04-10 14:27:37,986 WARN L148 SmtUtils]: Spent 117ms on a formula simplification that was a NOOP. DAG size: 136 [2018-04-10 14:27:38,515 WARN L151 SmtUtils]: Spent 338ms on a formula simplification. DAG size of input: 248 DAG size of output 157 [2018-04-10 14:27:38,681 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 14:27:38,686 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 14:27:38,686 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 114 treesize of output 111 [2018-04-10 14:27:38,690 INFO L682 Elim1Store]: detected equality via solver [2018-04-10 14:27:38,704 INFO L477 Elim1Store]: Elim1 applied some preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 48 treesize of output 46 [2018-04-10 14:27:38,704 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:27:38,735 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable 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 7 treesize of output 5 [2018-04-10 14:27:38,735 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:27:38,753 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select 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:27:38,754 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-04-10 14:27:38,769 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:27:38,835 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 14:27:38,836 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 14:27:38,837 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 137 treesize of output 115 [2018-04-10 14:27:38,842 INFO L477 Elim1Store]: Elim1 applied some preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 10 treesize of output 15 [2018-04-10 14:27:38,842 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2018-04-10 14:27:38,860 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 31 treesize of output 23 [2018-04-10 14:27:38,861 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:27:38,877 INFO L682 Elim1Store]: detected equality via solver [2018-04-10 14:27:38,877 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 49 treesize of output 35 [2018-04-10 14:27:38,878 INFO L267 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 1 xjuncts. [2018-04-10 14:27:38,891 INFO L267 ElimStorePlain]: Start of recursive call 6: 3 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-04-10 14:27:38,960 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 68 treesize of output 58 [2018-04-10 14:27:38,961 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2018-04-10 14:27:38,962 INFO L267 ElimStorePlain]: Start of recursive call 11: End of recursive call: and 1 xjuncts. [2018-04-10 14:27:38,972 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select 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:27:38,972 INFO L267 ElimStorePlain]: Start of recursive call 12: End of recursive call: and 1 xjuncts. [2018-04-10 14:27:38,982 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2018-04-10 14:27:38,982 INFO L267 ElimStorePlain]: Start of recursive call 13: End of recursive call: and 1 xjuncts. [2018-04-10 14:27:38,990 INFO L267 ElimStorePlain]: Start of recursive call 10: 3 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-10 14:27:39,056 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 80 treesize of output 68 [2018-04-10 14:27:39,057 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select 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:27:39,057 INFO L267 ElimStorePlain]: Start of recursive call 15: End of recursive call: and 1 xjuncts. [2018-04-10 14:27:39,071 INFO L682 Elim1Store]: detected equality via solver [2018-04-10 14:27:39,071 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2018-04-10 14:27:39,071 INFO L267 ElimStorePlain]: Start of recursive call 16: End of recursive call: and 1 xjuncts. [2018-04-10 14:27:39,085 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2018-04-10 14:27:39,085 INFO L267 ElimStorePlain]: Start of recursive call 17: End of recursive call: and 1 xjuncts. [2018-04-10 14:27:39,095 INFO L267 ElimStorePlain]: Start of recursive call 14: 3 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-10 14:27:39,142 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 14:27:39,144 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 14:27:39,153 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 5 disjoint index pairs (out of 6 index pairs), introduced 6 new quantified variables, introduced 2 case distinctions, treesize of input 189 treesize of output 161 [2018-04-10 14:27:39,156 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable 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 141 treesize of output 139 [2018-04-10 14:27:39,156 INFO L267 ElimStorePlain]: Start of recursive call 19: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-04-10 14:27:39,275 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 135 treesize of output 120 [2018-04-10 14:27:39,276 INFO L267 ElimStorePlain]: Start of recursive call 20: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 2 xjuncts. [2018-04-10 14:27:39,432 INFO L682 Elim1Store]: detected equality via solver [2018-04-10 14:27:39,432 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 116 treesize of output 102 [2018-04-10 14:27:39,432 INFO L267 ElimStorePlain]: Start of recursive call 21: End of recursive call: and 1 xjuncts. [2018-04-10 14:27:39,434 INFO L682 Elim1Store]: detected equality via solver [2018-04-10 14:27:39,434 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 106 treesize of output 94 [2018-04-10 14:27:39,434 INFO L267 ElimStorePlain]: Start of recursive call 22: End of recursive call: and 1 xjuncts. [2018-04-10 14:27:39,600 INFO L682 Elim1Store]: detected equality via solver [2018-04-10 14:27:39,605 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 131 treesize of output 126 [2018-04-10 14:27:39,606 INFO L267 ElimStorePlain]: Start of recursive call 23: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 2 xjuncts. [2018-04-10 14:27:39,795 INFO L682 Elim1Store]: detected equality via solver [2018-04-10 14:27:39,795 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 112 treesize of output 98 [2018-04-10 14:27:39,795 INFO L267 ElimStorePlain]: Start of recursive call 24: End of recursive call: and 1 xjuncts. [2018-04-10 14:27:39,797 INFO L682 Elim1Store]: detected equality via solver [2018-04-10 14:27:39,797 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 97 treesize of output 85 [2018-04-10 14:27:39,797 INFO L267 ElimStorePlain]: Start of recursive call 25: End of recursive call: and 1 xjuncts. [2018-04-10 14:27:39,934 INFO L682 Elim1Store]: detected equality via solver [2018-04-10 14:27:39,934 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 137 treesize of output 121 [2018-04-10 14:27:39,935 INFO L267 ElimStorePlain]: Start of recursive call 26: End of recursive call: and 1 xjuncts. [2018-04-10 14:27:40,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, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 115 treesize of output 103 [2018-04-10 14:27:40,061 INFO L267 ElimStorePlain]: Start of recursive call 27: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-04-10 14:27:40,183 INFO L682 Elim1Store]: detected equality via solver [2018-04-10 14:27:40,184 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 103 treesize of output 103 [2018-04-10 14:27:40,184 INFO L267 ElimStorePlain]: Start of recursive call 28: End of recursive call: and 1 xjuncts. [2018-04-10 14:27:40,304 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 143 treesize of output 129 [2018-04-10 14:27:40,305 INFO L267 ElimStorePlain]: Start of recursive call 29: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-04-10 14:27:40,421 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable 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 129 treesize of output 127 [2018-04-10 14:27:40,422 INFO L267 ElimStorePlain]: Start of recursive call 30: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-04-10 14:27:40,561 INFO L682 Elim1Store]: detected equality via solver [2018-04-10 14:27:40,561 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 127 treesize of output 111 [2018-04-10 14:27:40,561 INFO L267 ElimStorePlain]: Start of recursive call 31: End of recursive call: and 1 xjuncts. [2018-04-10 14:27:40,674 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 105 treesize of output 96 [2018-04-10 14:27:40,674 INFO L267 ElimStorePlain]: Start of recursive call 32: End of recursive call: and 1 xjuncts. [2018-04-10 14:27:40,786 INFO L267 ElimStorePlain]: Start of recursive call 18: 12 dim-1 vars, End of recursive call: 6 dim-0 vars, and 5 xjuncts. [2018-04-10 14:27:40,938 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 96 treesize of output 90 [2018-04-10 14:27:40,940 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 86 treesize of output 79 [2018-04-10 14:27:40,940 INFO L267 ElimStorePlain]: Start of recursive call 34: End of recursive call: and 1 xjuncts. [2018-04-10 14:27:40,987 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 82 treesize of output 75 [2018-04-10 14:27:40,987 INFO L267 ElimStorePlain]: Start of recursive call 35: End of recursive call: and 1 xjuncts. [2018-04-10 14:27:41,033 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 75 treesize of output 68 [2018-04-10 14:27:41,033 INFO L267 ElimStorePlain]: Start of recursive call 36: End of recursive call: and 1 xjuncts. [2018-04-10 14:27:41,087 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 79 treesize of output 72 [2018-04-10 14:27:41,088 INFO L267 ElimStorePlain]: Start of recursive call 37: End of recursive call: and 1 xjuncts. [2018-04-10 14:27:41,136 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 72 treesize of output 67 [2018-04-10 14:27:41,136 INFO L267 ElimStorePlain]: Start of recursive call 38: End of recursive call: and 1 xjuncts. [2018-04-10 14:27:41,193 INFO L682 Elim1Store]: detected equality via solver [2018-04-10 14:27:41,193 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 68 treesize of output 56 [2018-04-10 14:27:41,194 INFO L267 ElimStorePlain]: Start of recursive call 39: End of recursive call: and 1 xjuncts. [2018-04-10 14:27:41,227 INFO L267 ElimStorePlain]: Start of recursive call 33: 7 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-10 14:27:41,238 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 5 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 2 case distinctions, treesize of input 92 treesize of output 94 [2018-04-10 14:27:41,240 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 86 treesize of output 79 [2018-04-10 14:27:41,240 INFO L267 ElimStorePlain]: Start of recursive call 41: End of recursive call: and 1 xjuncts. [2018-04-10 14:27:41,332 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 79 treesize of output 72 [2018-04-10 14:27:41,333 INFO L267 ElimStorePlain]: Start of recursive call 42: End of recursive call: and 1 xjuncts. [2018-04-10 14:27:41,422 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 72 treesize of output 68 [2018-04-10 14:27:41,423 INFO L267 ElimStorePlain]: Start of recursive call 43: End of recursive call: and 1 xjuncts. [2018-04-10 14:27:41,510 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 75 treesize of output 68 [2018-04-10 14:27:41,511 INFO L267 ElimStorePlain]: Start of recursive call 44: End of recursive call: and 1 xjuncts. [2018-04-10 14:27:41,595 INFO L682 Elim1Store]: detected equality via solver [2018-04-10 14:27:41,595 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 68 treesize of output 52 [2018-04-10 14:27:41,595 INFO L267 ElimStorePlain]: Start of recursive call 45: End of recursive call: and 1 xjuncts. [2018-04-10 14:27:41,693 INFO L267 ElimStorePlain]: Start of recursive call 40: 12 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-10 14:27:41,698 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 96 treesize of output 82 [2018-04-10 14:27:41,700 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2018-04-10 14:27:41,700 INFO L267 ElimStorePlain]: Start of recursive call 47: End of recursive call: and 1 xjuncts. [2018-04-10 14:27:41,726 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select 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 5 [2018-04-10 14:27:41,726 INFO L267 ElimStorePlain]: Start of recursive call 48: End of recursive call: and 1 xjuncts. [2018-04-10 14:27:41,754 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 1 [2018-04-10 14:27:41,754 INFO L267 ElimStorePlain]: Start of recursive call 49: End of recursive call: and 1 xjuncts. [2018-04-10 14:27:41,772 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2018-04-10 14:27:41,772 INFO L267 ElimStorePlain]: Start of recursive call 50: End of recursive call: and 1 xjuncts. [2018-04-10 14:27:41,787 INFO L267 ElimStorePlain]: Start of recursive call 46: 4 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-10 14:27:41,800 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 4 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 2 case distinctions, treesize of input 79 treesize of output 81 [2018-04-10 14:27:41,804 INFO L682 Elim1Store]: detected equality via solver [2018-04-10 14:27:41,804 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 65 treesize of output 46 [2018-04-10 14:27:41,804 INFO L267 ElimStorePlain]: Start of recursive call 52: End of recursive call: and 1 xjuncts. [2018-04-10 14:27:41,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 43 treesize of output 36 [2018-04-10 14:27:41,891 INFO L267 ElimStorePlain]: Start of recursive call 53: End of recursive call: and 1 xjuncts. [2018-04-10 14:27:41,995 INFO L267 ElimStorePlain]: Start of recursive call 51: 12 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-10 14:27:42,003 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 96 treesize of output 88 [2018-04-10 14:27:42,005 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 84 treesize of output 75 [2018-04-10 14:27:42,005 INFO L267 ElimStorePlain]: Start of recursive call 55: End of recursive call: and 1 xjuncts. [2018-04-10 14:27:42,049 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 73 treesize of output 69 [2018-04-10 14:27:42,049 INFO L267 ElimStorePlain]: Start of recursive call 56: End of recursive call: and 1 xjuncts. [2018-04-10 14:27:42,089 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 75 treesize of output 68 [2018-04-10 14:27:42,089 INFO L267 ElimStorePlain]: Start of recursive call 57: End of recursive call: and 1 xjuncts. [2018-04-10 14:27:42,129 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 68 treesize of output 64 [2018-04-10 14:27:42,129 INFO L267 ElimStorePlain]: Start of recursive call 58: End of recursive call: and 1 xjuncts. [2018-04-10 14:27:42,165 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 66 treesize of output 59 [2018-04-10 14:27:42,165 INFO L267 ElimStorePlain]: Start of recursive call 59: End of recursive call: and 1 xjuncts. [2018-04-10 14:27:42,200 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 59 treesize of output 52 [2018-04-10 14:27:42,201 INFO L267 ElimStorePlain]: Start of recursive call 60: End of recursive call: and 1 xjuncts. [2018-04-10 14:27:42,234 INFO L267 ElimStorePlain]: Start of recursive call 54: 7 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-10 14:27:42,338 INFO L267 ElimStorePlain]: Start of recursive call 1: 13 dim-0 vars, 6 dim-2 vars, End of recursive call: 9 dim-0 vars, and 7 xjuncts. [2018-04-10 14:27:42,339 INFO L202 ElimStorePlain]: Needed 60 recursive calls to eliminate 19 variables, input treesize:453, output treesize:176 [2018-04-10 14:27:42,444 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 36 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-10 14:27:42,461 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-04-10 14:27:42,462 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [22, 25] total 42 [2018-04-10 14:27:42,462 INFO L442 AbstractCegarLoop]: Interpolant automaton has 43 states [2018-04-10 14:27:42,462 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 43 interpolants. [2018-04-10 14:27:42,462 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=221, Invalid=1579, Unknown=6, NotChecked=0, Total=1806 [2018-04-10 14:27:42,462 INFO L87 Difference]: Start difference. First operand 434 states and 502 transitions. Second operand 43 states. [2018-04-10 14:27:43,642 WARN L151 SmtUtils]: Spent 154ms on a formula simplification. DAG size of input: 152 DAG size of output 149 [2018-04-10 14:27:44,041 WARN L151 SmtUtils]: Spent 123ms on a formula simplification. DAG size of input: 224 DAG size of output 141 [2018-04-10 14:27:44,245 WARN L151 SmtUtils]: Spent 144ms on a formula simplification. DAG size of input: 152 DAG size of output 152 [2018-04-10 14:27:44,863 WARN L151 SmtUtils]: Spent 418ms on a formula simplification. DAG size of input: 230 DAG size of output 147 [2018-04-10 14:27:45,442 WARN L151 SmtUtils]: Spent 366ms on a formula simplification. DAG size of input: 292 DAG size of output 154 [2018-04-10 14:27:46,603 WARN L151 SmtUtils]: Spent 1012ms on a formula simplification. DAG size of input: 236 DAG size of output 116 [2018-04-10 14:27:46,831 WARN L151 SmtUtils]: Spent 161ms on a formula simplification. DAG size of input: 153 DAG size of output 153 [2018-04-10 14:27:47,053 WARN L151 SmtUtils]: Spent 142ms on a formula simplification. DAG size of input: 217 DAG size of output 109 [2018-04-10 14:27:47,384 WARN L151 SmtUtils]: Spent 142ms on a formula simplification. DAG size of input: 226 DAG size of output 140 [2018-04-10 14:27:47,633 WARN L151 SmtUtils]: Spent 167ms on a formula simplification. DAG size of input: 136 DAG size of output 136 [2018-04-10 14:27:47,944 WARN L151 SmtUtils]: Spent 194ms on a formula simplification. DAG size of input: 224 DAG size of output 147 [2018-04-10 14:27:48,169 WARN L151 SmtUtils]: Spent 151ms on a formula simplification. DAG size of input: 228 DAG size of output 116 [2018-04-10 14:27:48,685 WARN L151 SmtUtils]: Spent 423ms on a formula simplification. DAG size of input: 286 DAG size of output 154 [2018-04-10 14:27:49,166 WARN L151 SmtUtils]: Spent 214ms on a formula simplification. DAG size of input: 232 DAG size of output 149 [2018-04-10 14:27:49,784 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-10 14:27:49,784 INFO L93 Difference]: Finished difference Result 575 states and 644 transitions. [2018-04-10 14:27:49,784 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 40 states. [2018-04-10 14:27:49,784 INFO L78 Accepts]: Start accepts. Automaton has 43 states. Word has length 54 [2018-04-10 14:27:49,784 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-10 14:27:49,785 INFO L225 Difference]: With dead ends: 575 [2018-04-10 14:27:49,785 INFO L226 Difference]: Without dead ends: 575 [2018-04-10 14:27:49,786 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 116 GetRequests, 36 SyntacticMatches, 2 SemanticMatches, 78 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1871 ImplicationChecksByTransitivity, 7.6s TimeCoverageRelationStatistics Valid=984, Invalid=5320, Unknown=16, NotChecked=0, Total=6320 [2018-04-10 14:27:49,786 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 575 states. [2018-04-10 14:27:49,788 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 575 to 434. [2018-04-10 14:27:49,788 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 434 states. [2018-04-10 14:27:49,789 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 434 states to 434 states and 501 transitions. [2018-04-10 14:27:49,789 INFO L78 Accepts]: Start accepts. Automaton has 434 states and 501 transitions. Word has length 54 [2018-04-10 14:27:49,789 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-10 14:27:49,789 INFO L459 AbstractCegarLoop]: Abstraction has 434 states and 501 transitions. [2018-04-10 14:27:49,789 INFO L460 AbstractCegarLoop]: Interpolant automaton has 43 states. [2018-04-10 14:27:49,789 INFO L276 IsEmpty]: Start isEmpty. Operand 434 states and 501 transitions. [2018-04-10 14:27:49,789 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2018-04-10 14:27:49,789 INFO L347 BasicCegarLoop]: Found error trace [2018-04-10 14:27:49,790 INFO L355 BasicCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-10 14:27:49,790 INFO L408 AbstractCegarLoop]: === Iteration 40 === [mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr31RequiresViolation, mainErr46RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr15RequiresViolation, mainErr49RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr17RequiresViolation, mainErr42RequiresViolation, mainErr30RequiresViolation, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr44RequiresViolation, mainErr10RequiresViolation, mainErr43RequiresViolation, mainErr4RequiresViolation, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr51AssertViolationMEMORY_FREE, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr48RequiresViolation, mainErr52EnsuresViolationMEMORY_LEAK, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr45RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr9RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr50AssertViolationMEMORY_FREE, mainErr8RequiresViolation, mainErr34RequiresViolation, mainErr47RequiresViolation, mainErr14RequiresViolation, mainErr40RequiresViolation]=== [2018-04-10 14:27:49,790 INFO L82 PathProgramCache]: Analyzing trace with hash -214049144, now seen corresponding path program 1 times [2018-04-10 14:27:49,790 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-04-10 14:27:49,790 INFO L68 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-04-10 14:27:49,791 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-10 14:27:49,791 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-04-10 14:27:49,791 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-10 14:27:49,798 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-10 14:27:49,799 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-10 14:27:49,996 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 0 proven. 20 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-10 14:27:49,996 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-04-10 14:27:49,996 INFO L213 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 29 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 29 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-04-10 14:27:50,001 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-10 14:27:50,015 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-10 14:27:50,017 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-10 14:27:50,021 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 14:27:50,021 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 14:27:50,022 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:27:50,022 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-10 14:27:50,027 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-10 14:27:50,027 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:26, output treesize:24 [2018-04-10 14:27:50,046 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:27:50,047 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:27:50,047 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-10 14:27:50,048 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-10 14:27:50,056 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:27:50,057 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select 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:27:50,057 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-04-10 14:27:50,058 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-10 14:27:50,064 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:27:50,064 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 3 variables, input treesize:43, output treesize:36 [2018-04-10 14:27:50,126 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 14:27:50,129 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 36 treesize of output 37 [2018-04-10 14:27:50,130 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select 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 11 [2018-04-10 14:27:50,130 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-10 14:27:50,135 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-10 14:27:50,145 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 37 treesize of output 42 [2018-04-10 14:27:50,147 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 15 [2018-04-10 14:27:50,147 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-04-10 14:27:50,151 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-10 14:27:50,158 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-04-10 14:27:50,158 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 2 variables, input treesize:66, output treesize:66 [2018-04-10 14:27:50,186 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 14:27:50,187 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 14:27:50,187 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 14:27:50,187 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 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:27:50,188 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-10 14:27:50,200 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-10 14:27:50,200 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:77, output treesize:83 [2018-04-10 14:27:50,234 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 62 treesize of output 61 [2018-04-10 14:27:50,239 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 18 treesize of output 26 [2018-04-10 14:27:50,239 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-10 14:27:50,248 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-10 14:27:50,265 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 52 treesize of output 58 [2018-04-10 14:27:50,267 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 22 treesize of output 30 [2018-04-10 14:27:50,267 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-04-10 14:27:50,273 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-10 14:27:50,283 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:27:50,284 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 4 variables, input treesize:105, output treesize:81 [2018-04-10 14:27:50,377 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 141 treesize of output 112 [2018-04-10 14:27:50,378 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 19 [2018-04-10 14:27:50,378 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-10 14:27:50,386 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-10 14:27:50,398 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 115 treesize of output 103 [2018-04-10 14:27:50,399 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 19 [2018-04-10 14:27:50,400 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-04-10 14:27:50,406 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-10 14:27:50,415 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:27:50,415 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 3 variables, input treesize:153, output treesize:121 [2018-04-10 14:27:50,487 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 106 treesize of output 93 [2018-04-10 14:27:50,491 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 75 treesize of output 60 [2018-04-10 14:27:50,491 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-10 14:27:50,498 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select 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:27:50,498 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-04-10 14:27:50,503 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-10 14:27:50,512 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:27:50,512 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 4 variables, input treesize:135, output treesize:89 [2018-04-10 14:27:50,582 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 85 treesize of output 50 [2018-04-10 14:27:50,583 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 16 [2018-04-10 14:27:50,583 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-10 14:27:50,588 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 14 [2018-04-10 14:27:50,588 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:27:50,593 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select 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:27:50,593 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-04-10 14:27:50,597 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:27:50,606 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2018-04-10 14:27:50,606 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 4 variables, input treesize:90, output treesize:28 [2018-04-10 14:27:50,644 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 0 proven. 20 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-10 14:27:50,662 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-04-10 14:27:50,662 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [18, 17] total 32 [2018-04-10 14:27:50,662 INFO L442 AbstractCegarLoop]: Interpolant automaton has 33 states [2018-04-10 14:27:50,662 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 33 interpolants. [2018-04-10 14:27:50,662 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=114, Invalid=942, Unknown=0, NotChecked=0, Total=1056 [2018-04-10 14:27:50,662 INFO L87 Difference]: Start difference. First operand 434 states and 501 transitions. Second operand 33 states. [2018-04-10 14:27:51,952 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-10 14:27:51,972 INFO L93 Difference]: Finished difference Result 534 states and 608 transitions. [2018-04-10 14:27:51,973 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2018-04-10 14:27:51,973 INFO L78 Accepts]: Start accepts. Automaton has 33 states. Word has length 55 [2018-04-10 14:27:51,973 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-10 14:27:51,974 INFO L225 Difference]: With dead ends: 534 [2018-04-10 14:27:51,974 INFO L226 Difference]: Without dead ends: 534 [2018-04-10 14:27:51,974 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 91 GetRequests, 42 SyntacticMatches, 3 SemanticMatches, 46 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 478 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=275, Invalid=1981, Unknown=0, NotChecked=0, Total=2256 [2018-04-10 14:27:51,974 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 534 states. [2018-04-10 14:27:51,976 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 534 to 442. [2018-04-10 14:27:51,977 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 442 states. [2018-04-10 14:27:51,977 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 442 states to 442 states and 511 transitions. [2018-04-10 14:27:51,977 INFO L78 Accepts]: Start accepts. Automaton has 442 states and 511 transitions. Word has length 55 [2018-04-10 14:27:51,977 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-10 14:27:51,977 INFO L459 AbstractCegarLoop]: Abstraction has 442 states and 511 transitions. [2018-04-10 14:27:51,977 INFO L460 AbstractCegarLoop]: Interpolant automaton has 33 states. [2018-04-10 14:27:51,977 INFO L276 IsEmpty]: Start isEmpty. Operand 442 states and 511 transitions. [2018-04-10 14:27:51,978 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2018-04-10 14:27:51,978 INFO L347 BasicCegarLoop]: Found error trace [2018-04-10 14:27:51,978 INFO L355 BasicCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-10 14:27:51,978 INFO L408 AbstractCegarLoop]: === Iteration 41 === [mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr31RequiresViolation, mainErr46RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr15RequiresViolation, mainErr49RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr17RequiresViolation, mainErr42RequiresViolation, mainErr30RequiresViolation, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr44RequiresViolation, mainErr10RequiresViolation, mainErr43RequiresViolation, mainErr4RequiresViolation, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr51AssertViolationMEMORY_FREE, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr48RequiresViolation, mainErr52EnsuresViolationMEMORY_LEAK, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr45RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr9RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr50AssertViolationMEMORY_FREE, mainErr8RequiresViolation, mainErr34RequiresViolation, mainErr47RequiresViolation, mainErr14RequiresViolation, mainErr40RequiresViolation]=== [2018-04-10 14:27:51,978 INFO L82 PathProgramCache]: Analyzing trace with hash -214049143, now seen corresponding path program 1 times [2018-04-10 14:27:51,978 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-04-10 14:27:51,978 INFO L68 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-04-10 14:27:51,979 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-10 14:27:51,979 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-10 14:27:51,979 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-10 14:27:51,984 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-10 14:27:51,984 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-10 14:27:52,353 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 0 proven. 20 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-10 14:27:52,353 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-04-10 14:27:52,353 INFO L213 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 30 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 30 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-04-10 14:27:52,360 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-10 14:27:52,386 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-10 14:27:52,388 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-10 14:27:52,393 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 14:27:52,394 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 14:27:52,394 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:27:52,394 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-10 14:27:52,412 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-10 14:27:52,412 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:26, output treesize:24 [2018-04-10 14:27:52,443 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 8 [2018-04-10 14:27:52,444 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 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:27:52,444 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-10 14:27:52,446 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-10 14:27:52,456 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 8 [2018-04-10 14:27:52,458 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select 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:27:52,458 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-04-10 14:27:52,460 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-10 14:27:52,470 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:27:52,470 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 3 variables, input treesize:43, output treesize:36 [2018-04-10 14:27:52,565 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 14:27:52,577 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 36 treesize of output 37 [2018-04-10 14:27:52,580 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select 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 11 [2018-04-10 14:27:52,580 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-10 14:27:52,588 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-10 14:27:52,611 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 37 treesize of output 42 [2018-04-10 14:27:52,614 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 15 [2018-04-10 14:27:52,614 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-04-10 14:27:52,621 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-10 14:27:52,631 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-04-10 14:27:52,631 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 2 variables, input treesize:66, output treesize:66 [2018-04-10 14:27:52,671 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 14:27:52,672 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 14:27:52,673 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 14:27:52,673 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:27:52,673 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-10 14:27:52,689 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 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:27:52,689 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-10 14:27:52,699 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-10 14:27:52,700 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:80, output treesize:72 [2018-04-10 14:27:52,743 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 53 treesize of output 52 [2018-04-10 14:27:52,745 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 18 treesize of output 26 [2018-04-10 14:27:52,745 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-10 14:27:52,752 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-10 14:27:52,765 INFO L682 Elim1Store]: detected equality via solver [2018-04-10 14:27:52,767 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 52 treesize of output 63 [2018-04-10 14:27:52,768 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 30 [2018-04-10 14:27:52,768 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-04-10 14:27:52,774 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-10 14:27:52,784 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:27:52,784 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 3 variables, input treesize:91, output treesize:82 [2018-04-10 14:27:52,871 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 146 treesize of output 142 [2018-04-10 14:27:52,873 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 19 [2018-04-10 14:27:52,873 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-10 14:27:52,883 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-10 14:27:52,903 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 131 treesize of output 106 [2018-04-10 14:27:52,905 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 19 [2018-04-10 14:27:52,905 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-04-10 14:27:52,914 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-10 14:27:52,924 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:27:52,924 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 3 variables, input treesize:154, output treesize:122 [2018-04-10 14:27:53,086 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 145 treesize of output 98 [2018-04-10 14:27:53,092 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 45 treesize of output 37 [2018-04-10 14:27:53,092 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-04-10 14:27:53,103 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 54 treesize of output 21 [2018-04-10 14:27:53,103 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-04-10 14:27:53,111 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select 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:27:53,111 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-04-10 14:27:53,117 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:27:53,127 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 37 treesize of output 37 [2018-04-10 14:27:53,128 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select 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 11 [2018-04-10 14:27:53,128 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2018-04-10 14:27:53,133 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 3 [2018-04-10 14:27:53,134 INFO L267 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 1 xjuncts. [2018-04-10 14:27:53,136 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 1 [2018-04-10 14:27:53,136 INFO L267 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 1 xjuncts. [2018-04-10 14:27:53,137 INFO L267 ElimStorePlain]: Start of recursive call 6: 3 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-10 14:27:53,141 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:27:53,141 INFO L202 ElimStorePlain]: Needed 9 recursive calls to eliminate 5 variables, input treesize:152, output treesize:9 [2018-04-10 14:27:53,165 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 0 proven. 20 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-10 14:27:53,184 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-04-10 14:27:53,184 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [18, 17] total 31 [2018-04-10 14:27:53,184 INFO L442 AbstractCegarLoop]: Interpolant automaton has 32 states [2018-04-10 14:27:53,184 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 32 interpolants. [2018-04-10 14:27:53,184 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=99, Invalid=893, Unknown=0, NotChecked=0, Total=992 [2018-04-10 14:27:53,184 INFO L87 Difference]: Start difference. First operand 442 states and 511 transitions. Second operand 32 states. [2018-04-10 14:27:54,327 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-10 14:27:54,328 INFO L93 Difference]: Finished difference Result 533 states and 607 transitions. [2018-04-10 14:27:54,328 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2018-04-10 14:27:54,328 INFO L78 Accepts]: Start accepts. Automaton has 32 states. Word has length 55 [2018-04-10 14:27:54,328 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-10 14:27:54,329 INFO L225 Difference]: With dead ends: 533 [2018-04-10 14:27:54,329 INFO L226 Difference]: Without dead ends: 533 [2018-04-10 14:27:54,329 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 90 GetRequests, 43 SyntacticMatches, 3 SemanticMatches, 44 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 488 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=241, Invalid=1829, Unknown=0, NotChecked=0, Total=2070 [2018-04-10 14:27:54,329 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 533 states. [2018-04-10 14:27:54,331 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 533 to 442. [2018-04-10 14:27:54,331 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 442 states. [2018-04-10 14:27:54,332 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 442 states to 442 states and 510 transitions. [2018-04-10 14:27:54,332 INFO L78 Accepts]: Start accepts. Automaton has 442 states and 510 transitions. Word has length 55 [2018-04-10 14:27:54,332 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-10 14:27:54,332 INFO L459 AbstractCegarLoop]: Abstraction has 442 states and 510 transitions. [2018-04-10 14:27:54,332 INFO L460 AbstractCegarLoop]: Interpolant automaton has 32 states. [2018-04-10 14:27:54,332 INFO L276 IsEmpty]: Start isEmpty. Operand 442 states and 510 transitions. [2018-04-10 14:27:54,333 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2018-04-10 14:27:54,333 INFO L347 BasicCegarLoop]: Found error trace [2018-04-10 14:27:54,333 INFO L355 BasicCegarLoop]: trace histogram [3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-10 14:27:54,333 INFO L408 AbstractCegarLoop]: === Iteration 42 === [mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr31RequiresViolation, mainErr46RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr15RequiresViolation, mainErr49RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr17RequiresViolation, mainErr42RequiresViolation, mainErr30RequiresViolation, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr44RequiresViolation, mainErr10RequiresViolation, mainErr43RequiresViolation, mainErr4RequiresViolation, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr51AssertViolationMEMORY_FREE, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr48RequiresViolation, mainErr52EnsuresViolationMEMORY_LEAK, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr45RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr9RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr50AssertViolationMEMORY_FREE, mainErr8RequiresViolation, mainErr34RequiresViolation, mainErr47RequiresViolation, mainErr14RequiresViolation, mainErr40RequiresViolation]=== [2018-04-10 14:27:54,333 INFO L82 PathProgramCache]: Analyzing trace with hash -1054619402, now seen corresponding path program 2 times [2018-04-10 14:27:54,333 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-04-10 14:27:54,333 INFO L68 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-04-10 14:27:54,334 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-10 14:27:54,334 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-10 14:27:54,334 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-10 14:27:54,341 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-10 14:27:54,342 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-10 14:27:54,518 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 0 proven. 13 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-10 14:27:54,518 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-04-10 14:27:54,518 INFO L213 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 31 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 31 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-04-10 14:27:54,524 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-04-10 14:27:54,542 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-04-10 14:27:54,542 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-04-10 14:27:54,544 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-10 14:27:54,652 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 19 [2018-04-10 14:27:54,653 INFO L682 Elim1Store]: detected equality via solver [2018-04-10 14:27:54,653 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 15 [2018-04-10 14:27:54,654 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-10 14:27:54,656 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-10 14:27:54,663 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 15 [2018-04-10 14:27:54,664 INFO L682 Elim1Store]: detected equality via solver [2018-04-10 14:27:54,664 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 14 [2018-04-10 14:27:54,664 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-04-10 14:27:54,666 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-10 14:27:54,670 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:27:54,671 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 5 variables, input treesize:42, output treesize:7 [2018-04-10 14:27:54,760 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2018-04-10 14:27:54,779 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-04-10 14:27:54,779 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 13] total 27 [2018-04-10 14:27:54,779 INFO L442 AbstractCegarLoop]: Interpolant automaton has 28 states [2018-04-10 14:27:54,779 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. [2018-04-10 14:27:54,779 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=72, Invalid=684, Unknown=0, NotChecked=0, Total=756 [2018-04-10 14:27:54,780 INFO L87 Difference]: Start difference. First operand 442 states and 510 transitions. Second operand 28 states. [2018-04-10 14:27:56,903 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-10 14:27:56,903 INFO L93 Difference]: Finished difference Result 653 states and 733 transitions. [2018-04-10 14:27:56,903 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 52 states. [2018-04-10 14:27:56,903 INFO L78 Accepts]: Start accepts. Automaton has 28 states. Word has length 56 [2018-04-10 14:27:56,903 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-10 14:27:56,904 INFO L225 Difference]: With dead ends: 653 [2018-04-10 14:27:56,904 INFO L226 Difference]: Without dead ends: 653 [2018-04-10 14:27:56,905 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 125 GetRequests, 47 SyntacticMatches, 3 SemanticMatches, 75 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1332 ImplicationChecksByTransitivity, 1.5s TimeCoverageRelationStatistics Valid=912, Invalid=4938, Unknown=2, NotChecked=0, Total=5852 [2018-04-10 14:27:56,905 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 653 states. [2018-04-10 14:27:56,909 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 653 to 424. [2018-04-10 14:27:56,909 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 424 states. [2018-04-10 14:27:56,910 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 424 states to 424 states and 491 transitions. [2018-04-10 14:27:56,910 INFO L78 Accepts]: Start accepts. Automaton has 424 states and 491 transitions. Word has length 56 [2018-04-10 14:27:56,910 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-10 14:27:56,910 INFO L459 AbstractCegarLoop]: Abstraction has 424 states and 491 transitions. [2018-04-10 14:27:56,910 INFO L460 AbstractCegarLoop]: Interpolant automaton has 28 states. [2018-04-10 14:27:56,910 INFO L276 IsEmpty]: Start isEmpty. Operand 424 states and 491 transitions. [2018-04-10 14:27:56,911 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2018-04-10 14:27:56,911 INFO L347 BasicCegarLoop]: Found error trace [2018-04-10 14:27:56,911 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, 1, 1, 1, 1, 1, 1] [2018-04-10 14:27:56,911 INFO L408 AbstractCegarLoop]: === Iteration 43 === [mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr31RequiresViolation, mainErr46RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr15RequiresViolation, mainErr49RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr17RequiresViolation, mainErr42RequiresViolation, mainErr30RequiresViolation, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr44RequiresViolation, mainErr10RequiresViolation, mainErr43RequiresViolation, mainErr4RequiresViolation, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr51AssertViolationMEMORY_FREE, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr48RequiresViolation, mainErr52EnsuresViolationMEMORY_LEAK, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr45RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr9RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr50AssertViolationMEMORY_FREE, mainErr8RequiresViolation, mainErr34RequiresViolation, mainErr47RequiresViolation, mainErr14RequiresViolation, mainErr40RequiresViolation]=== [2018-04-10 14:27:56,911 INFO L82 PathProgramCache]: Analyzing trace with hash -1004012804, now seen corresponding path program 1 times [2018-04-10 14:27:56,911 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-04-10 14:27:56,912 INFO L68 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-04-10 14:27:56,912 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-10 14:27:56,912 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-04-10 14:27:56,913 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-10 14:27:56,917 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-10 14:27:56,917 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-10 14:27:56,947 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2018-04-10 14:27:56,948 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-04-10 14:27:56,980 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-04-10 14:27:56,981 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-04-10 14:27:56,981 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-04-10 14:27:56,981 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2018-04-10 14:27:56,981 INFO L87 Difference]: Start difference. First operand 424 states and 491 transitions. Second operand 7 states. [2018-04-10 14:27:57,093 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-10 14:27:57,093 INFO L93 Difference]: Finished difference Result 438 states and 501 transitions. [2018-04-10 14:27:57,093 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-04-10 14:27:57,093 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 60 [2018-04-10 14:27:57,094 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-10 14:27:57,094 INFO L225 Difference]: With dead ends: 438 [2018-04-10 14:27:57,094 INFO L226 Difference]: Without dead ends: 438 [2018-04-10 14:27:57,095 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2018-04-10 14:27:57,095 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 438 states. [2018-04-10 14:27:57,097 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 438 to 431. [2018-04-10 14:27:57,097 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 431 states. [2018-04-10 14:27:57,097 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 431 states to 431 states and 495 transitions. [2018-04-10 14:27:57,097 INFO L78 Accepts]: Start accepts. Automaton has 431 states and 495 transitions. Word has length 60 [2018-04-10 14:27:57,098 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-10 14:27:57,098 INFO L459 AbstractCegarLoop]: Abstraction has 431 states and 495 transitions. [2018-04-10 14:27:57,098 INFO L460 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-04-10 14:27:57,098 INFO L276 IsEmpty]: Start isEmpty. Operand 431 states and 495 transitions. [2018-04-10 14:27:57,098 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2018-04-10 14:27:57,098 INFO L347 BasicCegarLoop]: Found error trace [2018-04-10 14:27:57,098 INFO L355 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-10 14:27:57,098 INFO L408 AbstractCegarLoop]: === Iteration 44 === [mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr31RequiresViolation, mainErr46RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr15RequiresViolation, mainErr49RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr17RequiresViolation, mainErr42RequiresViolation, mainErr30RequiresViolation, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr44RequiresViolation, mainErr10RequiresViolation, mainErr43RequiresViolation, mainErr4RequiresViolation, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr51AssertViolationMEMORY_FREE, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr48RequiresViolation, mainErr52EnsuresViolationMEMORY_LEAK, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr45RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr9RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr50AssertViolationMEMORY_FREE, mainErr8RequiresViolation, mainErr34RequiresViolation, mainErr47RequiresViolation, mainErr14RequiresViolation, mainErr40RequiresViolation]=== [2018-04-10 14:27:57,098 INFO L82 PathProgramCache]: Analyzing trace with hash -1345919667, now seen corresponding path program 1 times [2018-04-10 14:27:57,098 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-04-10 14:27:57,099 INFO L68 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-04-10 14:27:57,099 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-10 14:27:57,099 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-10 14:27:57,099 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-10 14:27:57,104 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-10 14:27:57,104 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-10 14:27:57,264 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 0 proven. 11 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-10 14:27:57,265 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-04-10 14:27:57,265 INFO L213 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 32 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 32 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-04-10 14:27:57,270 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-10 14:27:57,289 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-10 14:27:57,291 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-10 14:27:57,294 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 14:27:57,295 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 14:27:57,295 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:27:57,295 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-10 14:27:57,298 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-10 14:27:57,298 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:17, output treesize:11 [2018-04-10 14:27:57,301 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:27:57,302 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 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:27:57,303 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-10 14:27:57,303 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-10 14:27:57,307 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:27:57,308 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:27, output treesize:20 [2018-04-10 14:27:57,322 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 28 treesize of output 24 [2018-04-10 14:27:57,324 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select 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:27:57,324 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-10 14:27:57,326 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-10 14:27:57,329 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:27:57,329 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:33, output treesize:25 [2018-04-10 14:27:57,411 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 14:27:57,412 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 14:27:57,412 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:27:57,412 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-10 14:27:57,415 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:27:57,415 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:37, output treesize:31 [2018-04-10 14:27:57,443 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 38 treesize of output 29 [2018-04-10 14:27:57,448 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 14 treesize of output 19 [2018-04-10 14:27:57,448 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 2 xjuncts. [2018-04-10 14:27:57,456 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-04-10 14:27:57,468 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 2 xjuncts. [2018-04-10 14:27:57,468 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:47, output treesize:66 [2018-04-10 14:27:57,540 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 57 treesize of output 61 [2018-04-10 14:27:57,551 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 43 treesize of output 45 [2018-04-10 14:27:57,552 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 2 xjuncts. [2018-04-10 14:27:57,572 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 46 treesize of output 45 [2018-04-10 14:27:57,572 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-04-10 14:27:57,583 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-04-10 14:27:57,592 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: 3 dim-0 vars, and 2 xjuncts. [2018-04-10 14:27:57,593 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 3 variables, input treesize:57, output treesize:75 [2018-04-10 14:27:57,661 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 52 treesize of output 43 [2018-04-10 14:27:57,662 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 31 [2018-04-10 14:27:57,662 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-10 14:27:57,673 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 31 treesize of output 22 [2018-04-10 14:27:57,673 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-04-10 14:27:57,682 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 18 [2018-04-10 14:27:57,682 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-04-10 14:27:57,688 INFO L267 ElimStorePlain]: Start of recursive call 2: 5 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-10 14:27:57,695 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 36 treesize of output 24 [2018-04-10 14:27:57,696 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 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:27:57,697 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2018-04-10 14:27:57,699 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 1 [2018-04-10 14:27:57,700 INFO L267 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 1 xjuncts. [2018-04-10 14:27:57,701 INFO L267 ElimStorePlain]: Start of recursive call 6: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-10 14:27:57,706 INFO L267 ElimStorePlain]: Start of recursive call 1: 7 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-04-10 14:27:57,706 INFO L202 ElimStorePlain]: Needed 8 recursive calls to eliminate 9 variables, input treesize:89, output treesize:5 [2018-04-10 14:27:57,722 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 0 proven. 11 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-10 14:27:57,739 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-04-10 14:27:57,740 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [19, 20] total 29 [2018-04-10 14:27:57,740 INFO L442 AbstractCegarLoop]: Interpolant automaton has 30 states [2018-04-10 14:27:57,740 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 30 interpolants. [2018-04-10 14:27:57,740 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=105, Invalid=765, Unknown=0, NotChecked=0, Total=870 [2018-04-10 14:27:57,740 INFO L87 Difference]: Start difference. First operand 431 states and 495 transitions. Second operand 30 states. [2018-04-10 14:27:58,966 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-10 14:27:58,966 INFO L93 Difference]: Finished difference Result 536 states and 602 transitions. [2018-04-10 14:27:58,966 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2018-04-10 14:27:58,966 INFO L78 Accepts]: Start accepts. Automaton has 30 states. Word has length 60 [2018-04-10 14:27:58,966 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-10 14:27:58,967 INFO L225 Difference]: With dead ends: 536 [2018-04-10 14:27:58,967 INFO L226 Difference]: Without dead ends: 536 [2018-04-10 14:27:58,968 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 102 GetRequests, 44 SyntacticMatches, 8 SemanticMatches, 50 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 666 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=387, Invalid=2265, Unknown=0, NotChecked=0, Total=2652 [2018-04-10 14:27:58,968 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 536 states. [2018-04-10 14:27:58,970 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 536 to 454. [2018-04-10 14:27:58,970 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 454 states. [2018-04-10 14:27:58,971 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 454 states to 454 states and 520 transitions. [2018-04-10 14:27:58,971 INFO L78 Accepts]: Start accepts. Automaton has 454 states and 520 transitions. Word has length 60 [2018-04-10 14:27:58,971 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-10 14:27:58,971 INFO L459 AbstractCegarLoop]: Abstraction has 454 states and 520 transitions. [2018-04-10 14:27:58,971 INFO L460 AbstractCegarLoop]: Interpolant automaton has 30 states. [2018-04-10 14:27:58,971 INFO L276 IsEmpty]: Start isEmpty. Operand 454 states and 520 transitions. [2018-04-10 14:27:58,971 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2018-04-10 14:27:58,971 INFO L347 BasicCegarLoop]: Found error trace [2018-04-10 14:27:58,972 INFO L355 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-10 14:27:58,972 INFO L408 AbstractCegarLoop]: === Iteration 45 === [mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr31RequiresViolation, mainErr46RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr15RequiresViolation, mainErr49RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr17RequiresViolation, mainErr42RequiresViolation, mainErr30RequiresViolation, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr44RequiresViolation, mainErr10RequiresViolation, mainErr43RequiresViolation, mainErr4RequiresViolation, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr51AssertViolationMEMORY_FREE, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr48RequiresViolation, mainErr52EnsuresViolationMEMORY_LEAK, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr45RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr9RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr50AssertViolationMEMORY_FREE, mainErr8RequiresViolation, mainErr34RequiresViolation, mainErr47RequiresViolation, mainErr14RequiresViolation, mainErr40RequiresViolation]=== [2018-04-10 14:27:58,972 INFO L82 PathProgramCache]: Analyzing trace with hash -1345919666, now seen corresponding path program 1 times [2018-04-10 14:27:58,972 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-04-10 14:27:58,972 INFO L68 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-04-10 14:27:58,972 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-10 14:27:58,973 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-10 14:27:58,973 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-10 14:27:58,978 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-10 14:27:58,979 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-10 14:27:59,272 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 0 proven. 11 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-10 14:27:59,272 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-04-10 14:27:59,272 INFO L213 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 33 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 33 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-04-10 14:27:59,277 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-10 14:27:59,298 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-10 14:27:59,300 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-10 14:27:59,305 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 14:27:59,306 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 14:27:59,306 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:27:59,306 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-10 14:27:59,309 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-10 14:27:59,309 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:20, output treesize:14 [2018-04-10 14:27:59,330 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:27:59,332 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select 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:27:59,332 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-10 14:27:59,333 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-10 14:27:59,340 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:27:59,341 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:27:59,341 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-04-10 14:27:59,342 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-10 14:27:59,347 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:27:59,347 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 3 variables, input treesize:38, output treesize:27 [2018-04-10 14:27:59,408 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 27 treesize of output 28 [2018-04-10 14:27:59,409 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select 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:27:59,410 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-10 14:27:59,413 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-10 14:27:59,421 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 39 treesize of output 35 [2018-04-10 14:27:59,422 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select 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:27:59,422 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-04-10 14:27:59,426 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-10 14:27:59,431 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:27:59,431 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 3 variables, input treesize:59, output treesize:43 [2018-04-10 14:27:59,627 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 14:27:59,628 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:27:59,628 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-10 14:27:59,642 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 14:27:59,642 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 14:27:59,643 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 14:27:59,643 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 14:27:59,644 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:27:59,644 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-10 14:27:59,655 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:27:59,655 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:78, output treesize:70 [2018-04-10 14:27:59,695 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 52 treesize of output 47 [2018-04-10 14:27:59,702 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 2 case distinctions, treesize of input 14 treesize of output 19 [2018-04-10 14:27:59,702 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 2 xjuncts. [2018-04-10 14:27:59,713 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-04-10 14:27:59,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 1 new quantified variables, introduced 0 case distinctions, treesize of input 58 treesize of output 57 [2018-04-10 14:27:59,756 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 18 treesize of output 15 [2018-04-10 14:27:59,756 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-04-10 14:27:59,763 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-10 14:27:59,768 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 62 treesize of output 61 [2018-04-10 14:27:59,774 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 2 case distinctions, treesize of input 18 treesize of output 27 [2018-04-10 14:27:59,774 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 2 xjuncts. [2018-04-10 14:27:59,786 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-04-10 14:27:59,813 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 2 dim-2 vars, End of recursive call: 1 dim-0 vars, and 2 xjuncts. [2018-04-10 14:27:59,813 INFO L202 ElimStorePlain]: Needed 7 recursive calls to eliminate 5 variables, input treesize:92, output treesize:139 [2018-04-10 14:27:59,939 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 115 treesize of output 90 [2018-04-10 14:27:59,941 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 15 [2018-04-10 14:27:59,941 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-10 14:27:59,951 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-10 14:27:59,965 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 35 treesize of output 36 [2018-04-10 14:27:59,966 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 15 [2018-04-10 14:27:59,966 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-04-10 14:27:59,970 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-10 14:27:59,980 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:27:59,980 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 4 variables, input treesize:127, output treesize:103 [2018-04-10 14:28:00,072 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 98 treesize of output 61 [2018-04-10 14:28:00,074 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 1 [2018-04-10 14:28:00,074 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-10 14:28:00,083 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 31 treesize of output 23 [2018-04-10 14:28:00,084 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:28:00,093 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 16 [2018-04-10 14:28:00,093 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-04-10 14:28:00,107 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:28:00,117 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 20 [2018-04-10 14:28:00,118 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 3 [2018-04-10 14:28:00,118 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2018-04-10 14:28:00,122 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select 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:28:00,122 INFO L267 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 1 xjuncts. [2018-04-10 14:28:00,123 INFO L267 ElimStorePlain]: Start of recursive call 6: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-10 14:28:00,131 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:28:00,131 INFO L202 ElimStorePlain]: Needed 8 recursive calls to eliminate 6 variables, input treesize:117, output treesize:18 [2018-04-10 14:28:00,253 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 0 proven. 11 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-10 14:28:00,270 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-04-10 14:28:00,270 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [21, 22] total 40 [2018-04-10 14:28:00,271 INFO L442 AbstractCegarLoop]: Interpolant automaton has 41 states [2018-04-10 14:28:00,271 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 41 interpolants. [2018-04-10 14:28:00,271 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=136, Invalid=1504, Unknown=0, NotChecked=0, Total=1640 [2018-04-10 14:28:00,271 INFO L87 Difference]: Start difference. First operand 454 states and 520 transitions. Second operand 41 states. [2018-04-10 14:28:03,154 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-10 14:28:03,154 INFO L93 Difference]: Finished difference Result 545 states and 614 transitions. [2018-04-10 14:28:03,155 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 33 states. [2018-04-10 14:28:03,155 INFO L78 Accepts]: Start accepts. Automaton has 41 states. Word has length 60 [2018-04-10 14:28:03,155 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-10 14:28:03,156 INFO L225 Difference]: With dead ends: 545 [2018-04-10 14:28:03,156 INFO L226 Difference]: Without dead ends: 545 [2018-04-10 14:28:03,156 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 111 GetRequests, 42 SyntacticMatches, 2 SemanticMatches, 67 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1001 ImplicationChecksByTransitivity, 2.0s TimeCoverageRelationStatistics Valid=490, Invalid=4202, Unknown=0, NotChecked=0, Total=4692 [2018-04-10 14:28:03,156 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 545 states. [2018-04-10 14:28:03,158 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 545 to 456. [2018-04-10 14:28:03,158 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 456 states. [2018-04-10 14:28:03,159 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 456 states to 456 states and 521 transitions. [2018-04-10 14:28:03,159 INFO L78 Accepts]: Start accepts. Automaton has 456 states and 521 transitions. Word has length 60 [2018-04-10 14:28:03,159 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-10 14:28:03,159 INFO L459 AbstractCegarLoop]: Abstraction has 456 states and 521 transitions. [2018-04-10 14:28:03,159 INFO L460 AbstractCegarLoop]: Interpolant automaton has 41 states. [2018-04-10 14:28:03,159 INFO L276 IsEmpty]: Start isEmpty. Operand 456 states and 521 transitions. [2018-04-10 14:28:03,159 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 63 [2018-04-10 14:28:03,159 INFO L347 BasicCegarLoop]: Found error trace [2018-04-10 14:28:03,159 INFO L355 BasicCegarLoop]: trace histogram [3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-10 14:28:03,160 INFO L408 AbstractCegarLoop]: === Iteration 46 === [mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr31RequiresViolation, mainErr46RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr15RequiresViolation, mainErr49RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr17RequiresViolation, mainErr42RequiresViolation, mainErr30RequiresViolation, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr44RequiresViolation, mainErr10RequiresViolation, mainErr43RequiresViolation, mainErr4RequiresViolation, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr51AssertViolationMEMORY_FREE, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr48RequiresViolation, mainErr52EnsuresViolationMEMORY_LEAK, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr45RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr9RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr50AssertViolationMEMORY_FREE, mainErr8RequiresViolation, mainErr34RequiresViolation, mainErr47RequiresViolation, mainErr14RequiresViolation, mainErr40RequiresViolation]=== [2018-04-10 14:28:03,160 INFO L82 PathProgramCache]: Analyzing trace with hash 1689737537, now seen corresponding path program 1 times [2018-04-10 14:28:03,160 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-04-10 14:28:03,160 INFO L68 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-04-10 14:28:03,160 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-10 14:28:03,160 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-10 14:28:03,160 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-10 14:28:03,164 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-10 14:28:03,164 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-10 14:28:03,206 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 0 proven. 13 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-10 14:28:03,206 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-04-10 14:28:03,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 34 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 34 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-04-10 14:28:03,219 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-10 14:28:03,243 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-10 14:28:03,245 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-10 14:28:03,251 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 8 [2018-04-10 14:28:03,252 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-04-10 14:28:03,252 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-10 14:28:03,253 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-10 14:28:03,256 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:28:03,256 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:17, output treesize:9 [2018-04-10 14:28:03,268 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 13 [2018-04-10 14:28:03,269 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 5 [2018-04-10 14:28:03,269 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-10 14:28:03,270 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-10 14:28:03,270 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-04-10 14:28:03,270 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:17, output treesize:5 [2018-04-10 14:28:03,278 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 0 proven. 13 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-10 14:28:03,307 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-04-10 14:28:03,307 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 8] total 9 [2018-04-10 14:28:03,307 INFO L442 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-04-10 14:28:03,307 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-04-10 14:28:03,307 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=70, Unknown=0, NotChecked=0, Total=90 [2018-04-10 14:28:03,307 INFO L87 Difference]: Start difference. First operand 456 states and 521 transitions. Second operand 10 states. [2018-04-10 14:28:03,616 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-10 14:28:03,616 INFO L93 Difference]: Finished difference Result 535 states and 582 transitions. [2018-04-10 14:28:03,616 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2018-04-10 14:28:03,616 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 62 [2018-04-10 14:28:03,616 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-10 14:28:03,617 INFO L225 Difference]: With dead ends: 535 [2018-04-10 14:28:03,617 INFO L226 Difference]: Without dead ends: 535 [2018-04-10 14:28:03,617 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 84 GetRequests, 59 SyntacticMatches, 6 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 60 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=136, Invalid=284, Unknown=0, NotChecked=0, Total=420 [2018-04-10 14:28:03,617 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 535 states. [2018-04-10 14:28:03,619 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 535 to 473. [2018-04-10 14:28:03,620 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 473 states. [2018-04-10 14:28:03,620 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 473 states to 473 states and 543 transitions. [2018-04-10 14:28:03,620 INFO L78 Accepts]: Start accepts. Automaton has 473 states and 543 transitions. Word has length 62 [2018-04-10 14:28:03,620 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-10 14:28:03,620 INFO L459 AbstractCegarLoop]: Abstraction has 473 states and 543 transitions. [2018-04-10 14:28:03,620 INFO L460 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-04-10 14:28:03,620 INFO L276 IsEmpty]: Start isEmpty. Operand 473 states and 543 transitions. [2018-04-10 14:28:03,621 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 63 [2018-04-10 14:28:03,621 INFO L347 BasicCegarLoop]: Found error trace [2018-04-10 14:28:03,621 INFO L355 BasicCegarLoop]: trace histogram [3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-10 14:28:03,621 INFO L408 AbstractCegarLoop]: === Iteration 47 === [mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr31RequiresViolation, mainErr46RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr15RequiresViolation, mainErr49RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr17RequiresViolation, mainErr42RequiresViolation, mainErr30RequiresViolation, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr44RequiresViolation, mainErr10RequiresViolation, mainErr43RequiresViolation, mainErr4RequiresViolation, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr51AssertViolationMEMORY_FREE, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr48RequiresViolation, mainErr52EnsuresViolationMEMORY_LEAK, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr45RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr9RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr50AssertViolationMEMORY_FREE, mainErr8RequiresViolation, mainErr34RequiresViolation, mainErr47RequiresViolation, mainErr14RequiresViolation, mainErr40RequiresViolation]=== [2018-04-10 14:28:03,621 INFO L82 PathProgramCache]: Analyzing trace with hash 1689737538, now seen corresponding path program 1 times [2018-04-10 14:28:03,621 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-04-10 14:28:03,622 INFO L68 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-04-10 14:28:03,622 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-10 14:28:03,622 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-10 14:28:03,623 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-10 14:28:03,630 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-10 14:28:03,630 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-10 14:28:03,808 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 0 proven. 13 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-10 14:28:03,808 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-04-10 14:28:03,808 INFO L213 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 35 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 35 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-04-10 14:28:03,813 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-10 14:28:03,828 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-10 14:28:03,830 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-10 14:28:03,877 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 14:28:03,878 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 17 [2018-04-10 14:28:03,878 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-10 14:28:03,884 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 14:28:03,885 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 14:28:03,885 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:28:03,885 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-10 14:28:03,888 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:28:03,889 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:27, output treesize:20 [2018-04-10 14:28:03,945 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 8 [2018-04-10 14:28:03,946 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:28:03,946 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-10 14:28:03,947 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-10 14:28:03,953 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 8 [2018-04-10 14:28:03,954 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select 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:28:03,954 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-04-10 14:28:03,955 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-10 14:28:03,959 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-04-10 14:28:03,959 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 4 variables, input treesize:37, output treesize:30 [2018-04-10 14:28:03,997 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 19 [2018-04-10 14:28:03,998 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:28:03,998 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-10 14:28:04,001 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-10 14:28:04,006 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:28:04,006 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select 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:28:04,007 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-04-10 14:28:04,007 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-10 14:28:04,010 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 2 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-04-10 14:28:04,010 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 5 variables, input treesize:44, output treesize:18 [2018-04-10 14:28:04,048 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 0 proven. 13 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-10 14:28:04,065 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-04-10 14:28:04,065 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 11] total 24 [2018-04-10 14:28:04,065 INFO L442 AbstractCegarLoop]: Interpolant automaton has 25 states [2018-04-10 14:28:04,065 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2018-04-10 14:28:04,065 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=73, Invalid=527, Unknown=0, NotChecked=0, Total=600 [2018-04-10 14:28:04,065 INFO L87 Difference]: Start difference. First operand 473 states and 543 transitions. Second operand 25 states. [2018-04-10 14:28:05,214 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-10 14:28:05,215 INFO L93 Difference]: Finished difference Result 650 states and 713 transitions. [2018-04-10 14:28:05,215 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2018-04-10 14:28:05,215 INFO L78 Accepts]: Start accepts. Automaton has 25 states. Word has length 62 [2018-04-10 14:28:05,215 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-10 14:28:05,216 INFO L225 Difference]: With dead ends: 650 [2018-04-10 14:28:05,216 INFO L226 Difference]: Without dead ends: 650 [2018-04-10 14:28:05,216 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 103 GetRequests, 56 SyntacticMatches, 2 SemanticMatches, 45 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 550 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=357, Invalid=1805, Unknown=0, NotChecked=0, Total=2162 [2018-04-10 14:28:05,216 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 650 states. [2018-04-10 14:28:05,219 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 650 to 498. [2018-04-10 14:28:05,219 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 498 states. [2018-04-10 14:28:05,220 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 498 states to 498 states and 573 transitions. [2018-04-10 14:28:05,220 INFO L78 Accepts]: Start accepts. Automaton has 498 states and 573 transitions. Word has length 62 [2018-04-10 14:28:05,220 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-10 14:28:05,220 INFO L459 AbstractCegarLoop]: Abstraction has 498 states and 573 transitions. [2018-04-10 14:28:05,220 INFO L460 AbstractCegarLoop]: Interpolant automaton has 25 states. [2018-04-10 14:28:05,220 INFO L276 IsEmpty]: Start isEmpty. Operand 498 states and 573 transitions. [2018-04-10 14:28:05,220 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 63 [2018-04-10 14:28:05,220 INFO L347 BasicCegarLoop]: Found error trace [2018-04-10 14:28:05,221 INFO L355 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-10 14:28:05,221 INFO L408 AbstractCegarLoop]: === Iteration 48 === [mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr31RequiresViolation, mainErr46RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr15RequiresViolation, mainErr49RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr17RequiresViolation, mainErr42RequiresViolation, mainErr30RequiresViolation, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr44RequiresViolation, mainErr10RequiresViolation, mainErr43RequiresViolation, mainErr4RequiresViolation, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr51AssertViolationMEMORY_FREE, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr48RequiresViolation, mainErr52EnsuresViolationMEMORY_LEAK, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr45RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr9RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr50AssertViolationMEMORY_FREE, mainErr8RequiresViolation, mainErr34RequiresViolation, mainErr47RequiresViolation, mainErr14RequiresViolation, mainErr40RequiresViolation]=== [2018-04-10 14:28:05,221 INFO L82 PathProgramCache]: Analyzing trace with hash -619689412, now seen corresponding path program 3 times [2018-04-10 14:28:05,221 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-04-10 14:28:05,221 INFO L68 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-04-10 14:28:05,221 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-10 14:28:05,221 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-10 14:28:05,221 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-10 14:28:05,226 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-10 14:28:05,227 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-10 14:28:05,531 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 0 proven. 27 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-10 14:28:05,531 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-04-10 14:28:05,531 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 36 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 36 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-04-10 14:28:05,536 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-04-10 14:28:05,577 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2018-04-10 14:28:05,577 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-04-10 14:28:05,580 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-10 14:28:05,643 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 14:28:05,644 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 14:28:05,644 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:28:05,644 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-10 14:28:05,658 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-10 14:28:05,659 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:29, output treesize:27 [2018-04-10 14:28:05,684 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 8 [2018-04-10 14:28:05,685 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:28:05,685 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-10 14:28:05,686 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-10 14:28:05,695 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 8 [2018-04-10 14:28:05,697 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-04-10 14:28:05,697 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-04-10 14:28:05,698 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-10 14:28:05,704 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:28:05,705 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 3 variables, input treesize:46, output treesize:39 [2018-04-10 14:28:05,782 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 14:28:05,785 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 37 [2018-04-10 14:28:05,786 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select 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 11 [2018-04-10 14:28:05,786 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-10 14:28:05,790 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-10 14:28:05,802 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 37 treesize of output 42 [2018-04-10 14:28:05,803 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 15 [2018-04-10 14:28:05,803 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-04-10 14:28:05,808 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-10 14:28:05,816 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-04-10 14:28:05,816 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 2 variables, input treesize:69, output treesize:69 [2018-04-10 14:28:05,865 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 14:28:05,865 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 14:28:05,866 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 14:28:05,866 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:28:05,866 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-10 14:28:05,879 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-10 14:28:05,879 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:80, output treesize:86 [2018-04-10 14:28:05,918 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 14:28:05,919 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 62 treesize of output 70 [2018-04-10 14:28:05,921 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 27 treesize of output 34 [2018-04-10 14:28:05,921 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-10 14:28:05,928 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-10 14:28:05,943 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 14:28:05,946 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 52 treesize of output 58 [2018-04-10 14:28:05,948 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 22 treesize of output 30 [2018-04-10 14:28:05,948 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-04-10 14:28:05,953 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-10 14:28:05,963 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:28:05,963 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 4 variables, input treesize:108, output treesize:80 [2018-04-10 14:28:06,062 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 131 treesize of output 119 [2018-04-10 14:28:06,063 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 19 [2018-04-10 14:28:06,063 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-10 14:28:06,070 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-10 14:28:06,081 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 14:28:06,082 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 14:28:06,086 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 117 treesize of output 108 [2018-04-10 14:28:06,087 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 19 [2018-04-10 14:28:06,087 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-04-10 14:28:06,094 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-10 14:28:06,103 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:28:06,103 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 3 variables, input treesize:148, output treesize:116 [2018-04-10 14:28:06,323 INFO L682 Elim1Store]: detected equality via solver [2018-04-10 14:28:06,325 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 117 treesize of output 108 [2018-04-10 14:28:06,326 INFO L682 Elim1Store]: detected equality via solver [2018-04-10 14:28:06,327 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 105 treesize of output 85 [2018-04-10 14:28:06,327 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-10 14:28:06,335 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-10 14:28:06,351 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 14:28:06,352 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 14:28:06,355 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 99 treesize of output 90 [2018-04-10 14:28:06,358 INFO L682 Elim1Store]: detected equality via solver [2018-04-10 14:28:06,367 INFO L477 Elim1Store]: Elim1 applied some preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 2 new quantified variables, introduced 4 case distinctions, treesize of input 94 treesize of output 94 [2018-04-10 14:28:06,368 INFO L267 ElimStorePlain]: Start of recursive call 5: 2 dim-0 vars, End of recursive call: 2 dim-0 vars, and 3 xjuncts. [2018-04-10 14:28:06,384 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-10 14:28:06,396 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:28:06,396 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 5 variables, input treesize:155, output treesize:85 [2018-04-10 14:28:06,494 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 14:28:06,496 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 62 treesize of output 54 [2018-04-10 14:28:06,498 INFO L682 Elim1Store]: detected equality via solver [2018-04-10 14:28:06,498 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 40 treesize of output 24 [2018-04-10 14:28:06,498 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-10 14:28:06,505 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 1 [2018-04-10 14:28:06,505 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-04-10 14:28:06,510 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select 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:28:06,510 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-04-10 14:28:06,514 INFO L267 ElimStorePlain]: Start of recursive call 2: 3 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-10 14:28:06,526 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 22 treesize of output 28 [2018-04-10 14:28:06,527 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select 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:28:06,527 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2018-04-10 14:28:06,531 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select 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:28:06,531 INFO L267 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 1 xjuncts. [2018-04-10 14:28:06,532 INFO L267 ElimStorePlain]: Start of recursive call 6: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-10 14:28:06,540 INFO L267 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 2 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2018-04-10 14:28:06,541 INFO L202 ElimStorePlain]: Needed 8 recursive calls to eliminate 6 variables, input treesize:96, output treesize:28 [2018-04-10 14:28:06,660 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 0 proven. 27 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-10 14:28:06,678 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-04-10 14:28:06,678 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [23, 23] total 45 [2018-04-10 14:28:06,678 INFO L442 AbstractCegarLoop]: Interpolant automaton has 46 states [2018-04-10 14:28:06,679 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 46 interpolants. [2018-04-10 14:28:06,679 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=208, Invalid=1862, Unknown=0, NotChecked=0, Total=2070 [2018-04-10 14:28:06,679 INFO L87 Difference]: Start difference. First operand 498 states and 573 transitions. Second operand 46 states. [2018-04-10 14:28:09,863 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-10 14:28:09,863 INFO L93 Difference]: Finished difference Result 708 states and 801 transitions. [2018-04-10 14:28:09,863 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 39 states. [2018-04-10 14:28:09,864 INFO L78 Accepts]: Start accepts. Automaton has 46 states. Word has length 62 [2018-04-10 14:28:09,864 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-10 14:28:09,865 INFO L225 Difference]: With dead ends: 708 [2018-04-10 14:28:09,865 INFO L226 Difference]: Without dead ends: 708 [2018-04-10 14:28:09,865 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 125 GetRequests, 43 SyntacticMatches, 2 SemanticMatches, 80 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1619 ImplicationChecksByTransitivity, 2.0s TimeCoverageRelationStatistics Valid=857, Invalid=5785, Unknown=0, NotChecked=0, Total=6642 [2018-04-10 14:28:09,865 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 708 states. [2018-04-10 14:28:09,868 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 708 to 558. [2018-04-10 14:28:09,868 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 558 states. [2018-04-10 14:28:09,869 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 558 states to 558 states and 651 transitions. [2018-04-10 14:28:09,869 INFO L78 Accepts]: Start accepts. Automaton has 558 states and 651 transitions. Word has length 62 [2018-04-10 14:28:09,869 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-10 14:28:09,869 INFO L459 AbstractCegarLoop]: Abstraction has 558 states and 651 transitions. [2018-04-10 14:28:09,869 INFO L460 AbstractCegarLoop]: Interpolant automaton has 46 states. [2018-04-10 14:28:09,869 INFO L276 IsEmpty]: Start isEmpty. Operand 558 states and 651 transitions. [2018-04-10 14:28:09,869 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 63 [2018-04-10 14:28:09,869 INFO L347 BasicCegarLoop]: Found error trace [2018-04-10 14:28:09,870 INFO L355 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-10 14:28:09,870 INFO L408 AbstractCegarLoop]: === Iteration 49 === [mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr31RequiresViolation, mainErr46RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr15RequiresViolation, mainErr49RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr17RequiresViolation, mainErr42RequiresViolation, mainErr30RequiresViolation, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr44RequiresViolation, mainErr10RequiresViolation, mainErr43RequiresViolation, mainErr4RequiresViolation, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr51AssertViolationMEMORY_FREE, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr48RequiresViolation, mainErr52EnsuresViolationMEMORY_LEAK, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr45RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr9RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr50AssertViolationMEMORY_FREE, mainErr8RequiresViolation, mainErr34RequiresViolation, mainErr47RequiresViolation, mainErr14RequiresViolation, mainErr40RequiresViolation]=== [2018-04-10 14:28:09,870 INFO L82 PathProgramCache]: Analyzing trace with hash -619689411, now seen corresponding path program 2 times [2018-04-10 14:28:09,870 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-04-10 14:28:09,870 INFO L68 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-04-10 14:28:09,870 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-10 14:28:09,870 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-04-10 14:28:09,870 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-10 14:28:09,876 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-10 14:28:09,876 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-10 14:28:10,239 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 0 proven. 27 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-10 14:28:10,240 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-04-10 14:28:10,240 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 37 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 37 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-04-10 14:28:10,245 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-04-10 14:28:10,266 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-04-10 14:28:10,267 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-04-10 14:28:10,269 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-10 14:28:10,338 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 14:28:10,339 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 14:28:10,339 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:28:10,339 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-10 14:28:10,345 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-10 14:28:10,345 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:29, output treesize:27 [2018-04-10 14:28:10,371 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 8 [2018-04-10 14:28:10,372 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select 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:28:10,372 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-10 14:28:10,373 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-10 14:28:10,381 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 8 [2018-04-10 14:28:10,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, 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:28:10,383 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-04-10 14:28:10,384 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-10 14:28:10,391 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:28:10,391 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 3 variables, input treesize:46, output treesize:39 [2018-04-10 14:28:10,483 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 14:28:10,485 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 31 [2018-04-10 14:28:10,486 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 15 [2018-04-10 14:28:10,487 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-10 14:28:10,490 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-10 14:28:10,500 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 14:28:10,502 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:28:10,504 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select 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 11 [2018-04-10 14:28:10,504 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-04-10 14:28:10,509 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-10 14:28:10,520 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-04-10 14:28:10,520 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 2 variables, input treesize:69, output treesize:69 [2018-04-10 14:28:10,555 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 14:28:10,555 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 14:28:10,556 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 14:28:10,556 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:28:10,556 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-10 14:28:10,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, 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:28:10,568 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-10 14:28:10,585 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-10 14:28:10,585 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:83, output treesize:75 [2018-04-10 14:28:10,629 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 14:28:10,629 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:28:10,632 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 27 treesize of output 34 [2018-04-10 14:28:10,632 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-10 14:28:10,638 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-10 14:28:10,652 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 14:28:10,653 INFO L682 Elim1Store]: detected equality via solver [2018-04-10 14:28:10,654 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 52 treesize of output 63 [2018-04-10 14:28:10,656 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 30 [2018-04-10 14:28:10,656 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-04-10 14:28:10,662 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-10 14:28:10,671 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:28:10,671 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 3 variables, input treesize:94, output treesize:81 [2018-04-10 14:28:10,763 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 14:28:10,764 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 14:28:10,768 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 139 treesize of output 126 [2018-04-10 14:28:10,770 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 19 [2018-04-10 14:28:10,770 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-10 14:28:10,778 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-10 14:28:10,789 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 14:28:10,794 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 130 treesize of output 126 [2018-04-10 14:28:10,795 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 19 [2018-04-10 14:28:10,795 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-04-10 14:28:10,803 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-10 14:28:10,812 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:28:10,812 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 3 variables, input treesize:149, output treesize:117 [2018-04-10 14:28:11,080 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 14:28:11,081 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 14:28:11,085 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 125 treesize of output 116 [2018-04-10 14:28:11,089 INFO L682 Elim1Store]: detected equality via solver [2018-04-10 14:28:11,098 INFO L477 Elim1Store]: Elim1 applied some preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 2 new quantified variables, introduced 4 case distinctions, treesize of input 120 treesize of output 120 [2018-04-10 14:28:11,099 INFO L267 ElimStorePlain]: Start of recursive call 3: 2 dim-0 vars, End of recursive call: 2 dim-0 vars, and 3 xjuncts. [2018-04-10 14:28:11,124 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-10 14:28:11,140 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 14:28:11,144 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 92 treesize of output 92 [2018-04-10 14:28:11,146 INFO L682 Elim1Store]: detected equality via solver [2018-04-10 14:28:11,148 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 85 treesize of output 68 [2018-04-10 14:28:11,148 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-04-10 14:28:11,157 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-10 14:28:11,170 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:28:11,170 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 7 variables, input treesize:156, output treesize:56 [2018-04-10 14:28:11,255 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 14:28:11,256 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 47 treesize of output 39 [2018-04-10 14:28:11,257 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select 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:28:11,257 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-10 14:28:11,262 INFO L682 Elim1Store]: detected equality via solver [2018-04-10 14:28:11,263 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 20 [2018-04-10 14:28:11,263 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-04-10 14:28:11,266 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-10 14:28:11,273 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 22 treesize of output 20 [2018-04-10 14:28:11,274 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select 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:28:11,274 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2018-04-10 14:28:11,277 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 3 [2018-04-10 14:28:11,277 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2018-04-10 14:28:11,278 INFO L267 ElimStorePlain]: Start of recursive call 5: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-10 14:28:11,282 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:28:11,282 INFO L202 ElimStorePlain]: Needed 7 recursive calls to eliminate 5 variables, input treesize:67, output treesize:9 [2018-04-10 14:28:11,351 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 0 proven. 27 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-10 14:28:11,369 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-04-10 14:28:11,369 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [23, 24] total 44 [2018-04-10 14:28:11,369 INFO L442 AbstractCegarLoop]: Interpolant automaton has 45 states [2018-04-10 14:28:11,369 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 45 interpolants. [2018-04-10 14:28:11,370 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=161, Invalid=1819, Unknown=0, NotChecked=0, Total=1980 [2018-04-10 14:28:11,370 INFO L87 Difference]: Start difference. First operand 558 states and 651 transitions. Second operand 45 states. [2018-04-10 14:28:14,007 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-10 14:28:14,007 INFO L93 Difference]: Finished difference Result 702 states and 798 transitions. [2018-04-10 14:28:14,007 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 33 states. [2018-04-10 14:28:14,007 INFO L78 Accepts]: Start accepts. Automaton has 45 states. Word has length 62 [2018-04-10 14:28:14,007 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-10 14:28:14,008 INFO L225 Difference]: With dead ends: 702 [2018-04-10 14:28:14,009 INFO L226 Difference]: Without dead ends: 702 [2018-04-10 14:28:14,009 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 120 GetRequests, 41 SyntacticMatches, 6 SemanticMatches, 73 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1359 ImplicationChecksByTransitivity, 1.9s TimeCoverageRelationStatistics Valid=573, Invalid=4977, Unknown=0, NotChecked=0, Total=5550 [2018-04-10 14:28:14,009 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 702 states. [2018-04-10 14:28:14,011 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 702 to 560. [2018-04-10 14:28:14,012 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 560 states. [2018-04-10 14:28:14,012 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 560 states to 560 states and 652 transitions. [2018-04-10 14:28:14,012 INFO L78 Accepts]: Start accepts. Automaton has 560 states and 652 transitions. Word has length 62 [2018-04-10 14:28:14,012 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-10 14:28:14,012 INFO L459 AbstractCegarLoop]: Abstraction has 560 states and 652 transitions. [2018-04-10 14:28:14,012 INFO L460 AbstractCegarLoop]: Interpolant automaton has 45 states. [2018-04-10 14:28:14,012 INFO L276 IsEmpty]: Start isEmpty. Operand 560 states and 652 transitions. [2018-04-10 14:28:14,013 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2018-04-10 14:28:14,013 INFO L347 BasicCegarLoop]: Found error trace [2018-04-10 14:28:14,013 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, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-10 14:28:14,013 INFO L408 AbstractCegarLoop]: === Iteration 50 === [mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr31RequiresViolation, mainErr46RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr15RequiresViolation, mainErr49RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr17RequiresViolation, mainErr42RequiresViolation, mainErr30RequiresViolation, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr44RequiresViolation, mainErr10RequiresViolation, mainErr43RequiresViolation, mainErr4RequiresViolation, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr51AssertViolationMEMORY_FREE, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr48RequiresViolation, mainErr52EnsuresViolationMEMORY_LEAK, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr45RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr9RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr50AssertViolationMEMORY_FREE, mainErr8RequiresViolation, mainErr34RequiresViolation, mainErr47RequiresViolation, mainErr14RequiresViolation, mainErr40RequiresViolation]=== [2018-04-10 14:28:14,013 INFO L82 PathProgramCache]: Analyzing trace with hash 1474915425, now seen corresponding path program 1 times [2018-04-10 14:28:14,013 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-04-10 14:28:14,013 INFO L68 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-04-10 14:28:14,013 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-10 14:28:14,014 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-04-10 14:28:14,014 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-10 14:28:14,018 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-10 14:28:14,019 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-10 14:28:14,068 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:28:14,068 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-04-10 14:28:14,068 INFO L213 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 38 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 38 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-04-10 14:28:14,073 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-10 14:28:14,088 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-10 14:28:14,089 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-10 14:28:14,106 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 13 [2018-04-10 14:28:14,106 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 5 [2018-04-10 14:28:14,107 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-10 14:28:14,107 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-10 14:28:14,108 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-04-10 14:28:14,108 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:17, output treesize:5 [2018-04-10 14:28:14,110 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2018-04-10 14:28:14,137 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-04-10 14:28:14,137 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [9] total 10 [2018-04-10 14:28:14,137 INFO L442 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-04-10 14:28:14,137 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-04-10 14:28:14,137 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=88, Unknown=0, NotChecked=0, Total=110 [2018-04-10 14:28:14,137 INFO L87 Difference]: Start difference. First operand 560 states and 652 transitions. Second operand 11 states. [2018-04-10 14:28:14,479 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-10 14:28:14,479 INFO L93 Difference]: Finished difference Result 616 states and 688 transitions. [2018-04-10 14:28:14,479 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2018-04-10 14:28:14,479 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 63 [2018-04-10 14:28:14,479 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-10 14:28:14,480 INFO L225 Difference]: With dead ends: 616 [2018-04-10 14:28:14,480 INFO L226 Difference]: Without dead ends: 616 [2018-04-10 14:28:14,480 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 104 GetRequests, 72 SyntacticMatches, 1 SemanticMatches, 31 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 181 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=309, Invalid=747, Unknown=0, NotChecked=0, Total=1056 [2018-04-10 14:28:14,481 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 616 states. [2018-04-10 14:28:14,483 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 616 to 557. [2018-04-10 14:28:14,483 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 557 states. [2018-04-10 14:28:14,484 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 557 states to 557 states and 646 transitions. [2018-04-10 14:28:14,484 INFO L78 Accepts]: Start accepts. Automaton has 557 states and 646 transitions. Word has length 63 [2018-04-10 14:28:14,484 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-10 14:28:14,484 INFO L459 AbstractCegarLoop]: Abstraction has 557 states and 646 transitions. [2018-04-10 14:28:14,484 INFO L460 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-04-10 14:28:14,484 INFO L276 IsEmpty]: Start isEmpty. Operand 557 states and 646 transitions. [2018-04-10 14:28:14,484 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2018-04-10 14:28:14,484 INFO L347 BasicCegarLoop]: Found error trace [2018-04-10 14:28:14,484 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, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-10 14:28:14,484 INFO L408 AbstractCegarLoop]: === Iteration 51 === [mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr31RequiresViolation, mainErr46RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr15RequiresViolation, mainErr49RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr17RequiresViolation, mainErr42RequiresViolation, mainErr30RequiresViolation, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr44RequiresViolation, mainErr10RequiresViolation, mainErr43RequiresViolation, mainErr4RequiresViolation, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr51AssertViolationMEMORY_FREE, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr48RequiresViolation, mainErr52EnsuresViolationMEMORY_LEAK, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr45RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr9RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr50AssertViolationMEMORY_FREE, mainErr8RequiresViolation, mainErr34RequiresViolation, mainErr47RequiresViolation, mainErr14RequiresViolation, mainErr40RequiresViolation]=== [2018-04-10 14:28:14,485 INFO L82 PathProgramCache]: Analyzing trace with hash 1474915426, now seen corresponding path program 1 times [2018-04-10 14:28:14,485 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-04-10 14:28:14,485 INFO L68 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-04-10 14:28:14,485 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-10 14:28:14,485 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-10 14:28:14,485 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-10 14:28:14,489 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-10 14:28:14,489 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-10 14:28:14,608 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:28:14,608 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-04-10 14:28:14,608 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 39 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 39 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-04-10 14:28:14,613 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-10 14:28:14,632 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-10 14:28:14,635 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-10 14:28:14,667 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 8 [2018-04-10 14:28:14,668 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 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:28:14,668 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-10 14:28:14,669 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-10 14:28:14,672 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:28:14,672 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:15, output treesize:7 [2018-04-10 14:28:14,727 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 19 [2018-04-10 14:28:14,728 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 11 [2018-04-10 14:28:14,728 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-10 14:28:14,730 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-10 14:28:14,734 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 26 treesize of output 20 [2018-04-10 14:28:14,735 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 11 [2018-04-10 14:28:14,735 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-04-10 14:28:14,737 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-10 14:28:14,739 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:28:14,739 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 4 variables, input treesize:37, output treesize:11 [2018-04-10 14:28:14,764 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 5 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-10 14:28:14,792 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-04-10 14:28:14,792 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 9] total 19 [2018-04-10 14:28:14,793 INFO L442 AbstractCegarLoop]: Interpolant automaton has 20 states [2018-04-10 14:28:14,793 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2018-04-10 14:28:14,793 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=53, Invalid=327, Unknown=0, NotChecked=0, Total=380 [2018-04-10 14:28:14,793 INFO L87 Difference]: Start difference. First operand 557 states and 646 transitions. Second operand 20 states. [2018-04-10 14:28:15,715 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-10 14:28:15,715 INFO L93 Difference]: Finished difference Result 680 states and 750 transitions. [2018-04-10 14:28:15,716 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 54 states. [2018-04-10 14:28:15,716 INFO L78 Accepts]: Start accepts. Automaton has 20 states. Word has length 63 [2018-04-10 14:28:15,716 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-10 14:28:15,717 INFO L225 Difference]: With dead ends: 680 [2018-04-10 14:28:15,717 INFO L226 Difference]: Without dead ends: 680 [2018-04-10 14:28:15,717 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 136 GetRequests, 67 SyntacticMatches, 0 SemanticMatches, 69 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1493 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=1063, Invalid=3907, Unknown=0, NotChecked=0, Total=4970 [2018-04-10 14:28:15,717 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 680 states. [2018-04-10 14:28:15,720 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 680 to 557. [2018-04-10 14:28:15,720 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 557 states. [2018-04-10 14:28:15,721 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 557 states to 557 states and 640 transitions. [2018-04-10 14:28:15,721 INFO L78 Accepts]: Start accepts. Automaton has 557 states and 640 transitions. Word has length 63 [2018-04-10 14:28:15,721 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-10 14:28:15,721 INFO L459 AbstractCegarLoop]: Abstraction has 557 states and 640 transitions. [2018-04-10 14:28:15,721 INFO L460 AbstractCegarLoop]: Interpolant automaton has 20 states. [2018-04-10 14:28:15,721 INFO L276 IsEmpty]: Start isEmpty. Operand 557 states and 640 transitions. [2018-04-10 14:28:15,721 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2018-04-10 14:28:15,721 INFO L347 BasicCegarLoop]: Found error trace [2018-04-10 14:28:15,722 INFO L355 BasicCegarLoop]: trace histogram [4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-10 14:28:15,722 INFO L408 AbstractCegarLoop]: === Iteration 52 === [mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr31RequiresViolation, mainErr46RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr15RequiresViolation, mainErr49RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr17RequiresViolation, mainErr42RequiresViolation, mainErr30RequiresViolation, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr44RequiresViolation, mainErr10RequiresViolation, mainErr43RequiresViolation, mainErr4RequiresViolation, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr51AssertViolationMEMORY_FREE, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr48RequiresViolation, mainErr52EnsuresViolationMEMORY_LEAK, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr45RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr9RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr50AssertViolationMEMORY_FREE, mainErr8RequiresViolation, mainErr34RequiresViolation, mainErr47RequiresViolation, mainErr14RequiresViolation, mainErr40RequiresViolation]=== [2018-04-10 14:28:15,722 INFO L82 PathProgramCache]: Analyzing trace with hash 1115169641, now seen corresponding path program 6 times [2018-04-10 14:28:15,722 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-04-10 14:28:15,722 INFO L68 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-04-10 14:28:15,723 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-10 14:28:15,723 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-10 14:28:15,723 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-10 14:28:15,734 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-10 14:28:15,735 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-10 14:28:16,304 INFO L134 CoverageAnalysis]: Checked inductivity of 50 backedges. 0 proven. 50 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-10 14:28:16,304 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-04-10 14:28:16,305 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 40 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 40 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-04-10 14:28:16,309 INFO L103 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2018-04-10 14:28:16,338 INFO L242 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 4 check-sat command(s) [2018-04-10 14:28:16,338 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-04-10 14:28:16,341 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-10 14:28:16,347 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 14:28:16,347 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 14:28:16,347 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:28:16,348 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-10 14:28:16,354 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-10 14:28:16,354 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:29, output treesize:27 [2018-04-10 14:28:16,387 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:28:16,388 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:28:16,388 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-10 14:28:16,389 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-10 14:28:16,398 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:28:16,399 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select 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:28:16,399 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-04-10 14:28:16,401 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-10 14:28:16,407 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:28:16,407 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 3 variables, input treesize:46, output treesize:39 [2018-04-10 14:28:16,472 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 19 treesize of output 20 [2018-04-10 14:28:16,474 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 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:28:16,474 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-10 14:28:16,477 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-10 14:28:16,489 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 19 treesize of output 24 [2018-04-10 14:28:16,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 12 treesize of output 11 [2018-04-10 14:28:16,490 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-04-10 14:28:16,493 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-10 14:28:16,501 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-04-10 14:28:16,502 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 2 variables, input treesize:57, output treesize:53 [2018-04-10 14:28:16,535 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 14:28:16,535 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 14:28:16,536 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 14:28:16,536 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:28:16,536 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-10 14:28:16,544 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-10 14:28:16,545 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:58, output treesize:51 [2018-04-10 14:28:16,578 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 14:28:16,579 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 4 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 37 treesize of output 45 [2018-04-10 14:28:16,581 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 19 [2018-04-10 14:28:16,581 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-10 14:28:16,594 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-10 14:28:16,606 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 14:28:16,609 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 30 treesize of output 36 [2018-04-10 14:28:16,611 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 18 treesize of output 15 [2018-04-10 14:28:16,612 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-04-10 14:28:16,615 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-10 14:28:16,623 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:28:16,624 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 4 variables, input treesize:78, output treesize:42 [2018-04-10 14:28:16,654 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 19 treesize of output 28 [2018-04-10 14:28:16,655 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 15 [2018-04-10 14:28:16,656 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-10 14:28:16,659 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-10 14:28:16,669 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 14:28:16,672 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 14:28:16,673 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 55 treesize of output 71 [2018-04-10 14:28:16,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 8 treesize of output 7 [2018-04-10 14:28:16,675 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-04-10 14:28:16,682 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-10 14:28:16,690 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-04-10 14:28:16,690 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 2 variables, input treesize:65, output treesize:65 [2018-04-10 14:28:16,726 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 14:28:16,726 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 14:28:16,726 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 15 treesize of output 8 [2018-04-10 14:28:16,726 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-10 14:28:16,734 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-10 14:28:16,735 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:73, output treesize:67 [2018-04-10 14:28:16,772 INFO L682 Elim1Store]: detected equality via solver [2018-04-10 14:28:16,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, 2 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 34 treesize of output 44 [2018-04-10 14:28:16,775 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 22 treesize of output 15 [2018-04-10 14:28:16,775 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-10 14:28:16,779 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-10 14:28:16,791 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 14:28:16,794 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 14:28:16,795 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 5 disjoint index pairs (out of 3 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 61 treesize of output 75 [2018-04-10 14:28:16,798 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 7 [2018-04-10 14:28:16,798 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-04-10 14:28:16,805 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-10 14:28:16,814 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:28:16,814 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 3 variables, input treesize:91, output treesize:66 [2018-04-10 14:28:16,945 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 6 case distinctions, treesize of input 117 treesize of output 188 [2018-04-10 14:28:16,948 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 154 treesize of output 153 [2018-04-10 14:28:16,948 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-10 14:28:16,988 INFO L267 ElimStorePlain]: Start of recursive call 2: 4 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-10 14:28:17,000 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 14:28:17,004 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 14:28:17,020 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 6 new quantified variables, introduced 6 case distinctions, treesize of input 155 treesize of output 143 [2018-04-10 14:28:17,033 INFO L477 Elim1Store]: Elim1 applied some 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 4 new quantified variables, introduced 3 case distinctions, treesize of input 165 treesize of output 157 [2018-04-10 14:28:17,034 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:28:17,070 INFO L267 ElimStorePlain]: Start of recursive call 5: 4 dim-0 vars, 1 dim-1 vars, End of recursive call: 5 dim-0 vars, and 3 xjuncts. [2018-04-10 14:28:17,313 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 107 treesize of output 143 [2018-04-10 14:28:17,314 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 2 xjuncts. [2018-04-10 14:28:17,413 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:28:17,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 140 treesize of output 139 [2018-04-10 14:28:17,505 INFO L267 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 1 xjuncts. [2018-04-10 14:28:17,578 INFO L267 ElimStorePlain]: Start of recursive call 4: 5 dim-1 vars, End of recursive call: 6 dim-0 vars, and 6 xjuncts. [2018-04-10 14:28:17,668 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-2 vars, End of recursive call: 12 dim-0 vars, and 6 xjuncts. [2018-04-10 14:28:17,668 INFO L202 ElimStorePlain]: Needed 9 recursive calls to eliminate 3 variables, input treesize:181, output treesize:692 [2018-04-10 14:28:26,060 WARN L151 SmtUtils]: Spent 8216ms on a formula simplification. DAG size of input: 156 DAG size of output 73 [2018-04-10 14:28:26,541 WARN L151 SmtUtils]: Spent 198ms on a formula simplification. DAG size of input: 87 DAG size of output 80 [2018-04-10 14:28:26,648 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 14:28:26,654 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 174 treesize of output 182 [2018-04-10 14:28:26,656 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 178 treesize of output 169 [2018-04-10 14:28:26,656 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-10 14:28:26,697 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 141 treesize of output 136 [2018-04-10 14:28:26,698 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-04-10 14:28:26,730 INFO L682 Elim1Store]: detected equality via solver [2018-04-10 14:28:26,731 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 126 treesize of output 122 [2018-04-10 14:28:26,731 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-04-10 14:28:26,764 INFO L682 Elim1Store]: detected equality via solver [2018-04-10 14:28:26,764 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 136 treesize of output 132 [2018-04-10 14:28:26,764 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2018-04-10 14:28:26,795 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 116 treesize of output 102 [2018-04-10 14:28:26,796 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2018-04-10 14:28:26,814 INFO L267 ElimStorePlain]: Start of recursive call 2: 5 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-10 14:28:26,837 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 14:28:26,838 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 106 treesize of output 84 [2018-04-10 14:28:26,839 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 19 [2018-04-10 14:28:26,840 INFO L267 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 1 xjuncts. [2018-04-10 14:28:26,850 INFO L682 Elim1Store]: detected equality via solver [2018-04-10 14:28:26,851 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2018-04-10 14:28:26,851 INFO L267 ElimStorePlain]: Start of recursive call 10: End of recursive call: and 1 xjuncts. [2018-04-10 14:28:26,858 INFO L267 ElimStorePlain]: Start of recursive call 8: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-10 14:28:26,876 INFO L267 ElimStorePlain]: Start of recursive call 1: 6 dim-0 vars, 2 dim-2 vars, End of recursive call: 3 dim-0 vars, and 2 xjuncts. [2018-04-10 14:28:26,876 INFO L202 ElimStorePlain]: Needed 10 recursive calls to eliminate 8 variables, input treesize:281, output treesize:147 [2018-04-10 14:28:27,056 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 14:28:27,057 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 14:28:27,057 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 14:28:27,058 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 14:28:27,059 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 14:28:27,059 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 48 treesize of output 57 [2018-04-10 14:28:27,069 INFO L477 Elim1Store]: Elim1 applied some preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 5 disjoint index pairs (out of 3 index pairs), introduced 5 new quantified variables, introduced 3 case distinctions, treesize of input 29 treesize of output 51 [2018-04-10 14:28:27,070 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-10 14:28:27,073 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select 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:28:27,074 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-04-10 14:28:27,077 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 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:28:27,077 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-04-10 14:28:27,079 INFO L267 ElimStorePlain]: Start of recursive call 2: 3 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-10 14:28:27,090 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 14:28:27,091 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 14:28:27,093 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 14:28:27,102 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 14:28:27,104 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 100 treesize of output 84 [2018-04-10 14:28:27,106 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 72 treesize of output 66 [2018-04-10 14:28:27,106 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2018-04-10 14:28:27,129 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 58 treesize of output 57 [2018-04-10 14:28:27,129 INFO L267 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 2 xjuncts. [2018-04-10 14:28:27,153 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 44 treesize of output 39 [2018-04-10 14:28:27,153 INFO L267 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 1 xjuncts. [2018-04-10 14:28:27,176 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 39 treesize of output 33 [2018-04-10 14:28:27,176 INFO L267 ElimStorePlain]: Start of recursive call 10: End of recursive call: and 1 xjuncts. [2018-04-10 14:28:27,196 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:28:27,196 INFO L267 ElimStorePlain]: Start of recursive call 11: End of recursive call: and 1 xjuncts. [2018-04-10 14:28:27,206 INFO L267 ElimStorePlain]: Start of recursive call 6: 7 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-10 14:28:27,211 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:28:27,211 INFO L202 ElimStorePlain]: Needed 11 recursive calls to eliminate 5 variables, input treesize:149, output treesize:5 [2018-04-10 14:28:27,238 INFO L134 CoverageAnalysis]: Checked inductivity of 50 backedges. 0 proven. 50 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-10 14:28:27,256 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-04-10 14:28:27,256 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [27, 28] total 44 [2018-04-10 14:28:27,256 INFO L442 AbstractCegarLoop]: Interpolant automaton has 45 states [2018-04-10 14:28:27,256 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 45 interpolants. [2018-04-10 14:28:27,257 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=170, Invalid=1810, Unknown=0, NotChecked=0, Total=1980 [2018-04-10 14:28:27,257 INFO L87 Difference]: Start difference. First operand 557 states and 640 transitions. Second operand 45 states. [2018-04-10 14:28:30,189 WARN L151 SmtUtils]: Spent 137ms on a formula simplification. DAG size of input: 103 DAG size of output 102 [2018-04-10 14:28:30,607 WARN L151 SmtUtils]: Spent 110ms on a formula simplification. DAG size of input: 140 DAG size of output 81 [2018-04-10 14:28:30,963 WARN L151 SmtUtils]: Spent 134ms on a formula simplification. DAG size of input: 138 DAG size of output 92 [2018-04-10 14:28:31,298 WARN L151 SmtUtils]: Spent 254ms on a formula simplification. DAG size of input: 148 DAG size of output 99 [2018-04-10 14:28:31,490 WARN L151 SmtUtils]: Spent 109ms on a formula simplification. DAG size of input: 147 DAG size of output 69 [2018-04-10 14:28:31,940 WARN L151 SmtUtils]: Spent 110ms on a formula simplification. DAG size of input: 144 DAG size of output 84 [2018-04-10 14:28:32,235 WARN L151 SmtUtils]: Spent 138ms on a formula simplification. DAG size of input: 167 DAG size of output 107 [2018-04-10 14:28:32,502 WARN L151 SmtUtils]: Spent 170ms on a formula simplification. DAG size of input: 124 DAG size of output 124 [2018-04-10 14:28:32,793 WARN L151 SmtUtils]: Spent 159ms on a formula simplification. DAG size of input: 126 DAG size of output 126 [2018-04-10 14:28:33,155 WARN L151 SmtUtils]: Spent 176ms on a formula simplification. DAG size of input: 137 DAG size of output 137 [2018-04-10 14:28:33,573 WARN L151 SmtUtils]: Spent 175ms on a formula simplification. DAG size of input: 129 DAG size of output 129 [2018-04-10 14:28:34,673 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-10 14:28:34,673 INFO L93 Difference]: Finished difference Result 724 states and 804 transitions. [2018-04-10 14:28:34,674 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 57 states. [2018-04-10 14:28:34,674 INFO L78 Accepts]: Start accepts. Automaton has 45 states. Word has length 63 [2018-04-10 14:28:34,674 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-10 14:28:34,675 INFO L225 Difference]: With dead ends: 724 [2018-04-10 14:28:34,675 INFO L226 Difference]: Without dead ends: 724 [2018-04-10 14:28:34,675 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 146 GetRequests, 41 SyntacticMatches, 8 SemanticMatches, 97 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2875 ImplicationChecksByTransitivity, 13.6s TimeCoverageRelationStatistics Valid=1233, Invalid=8461, Unknown=8, NotChecked=0, Total=9702 [2018-04-10 14:28:34,675 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 724 states. [2018-04-10 14:28:34,678 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 724 to 574. [2018-04-10 14:28:34,678 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 574 states. [2018-04-10 14:28:34,678 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 574 states to 574 states and 660 transitions. [2018-04-10 14:28:34,678 INFO L78 Accepts]: Start accepts. Automaton has 574 states and 660 transitions. Word has length 63 [2018-04-10 14:28:34,679 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-10 14:28:34,679 INFO L459 AbstractCegarLoop]: Abstraction has 574 states and 660 transitions. [2018-04-10 14:28:34,679 INFO L460 AbstractCegarLoop]: Interpolant automaton has 45 states. [2018-04-10 14:28:34,679 INFO L276 IsEmpty]: Start isEmpty. Operand 574 states and 660 transitions. [2018-04-10 14:28:34,679 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2018-04-10 14:28:34,679 INFO L347 BasicCegarLoop]: Found error trace [2018-04-10 14:28:34,679 INFO L355 BasicCegarLoop]: trace histogram [4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-10 14:28:34,679 INFO L408 AbstractCegarLoop]: === Iteration 53 === [mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr31RequiresViolation, mainErr46RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr15RequiresViolation, mainErr49RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr17RequiresViolation, mainErr42RequiresViolation, mainErr30RequiresViolation, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr44RequiresViolation, mainErr10RequiresViolation, mainErr43RequiresViolation, mainErr4RequiresViolation, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr51AssertViolationMEMORY_FREE, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr48RequiresViolation, mainErr52EnsuresViolationMEMORY_LEAK, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr45RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr9RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr50AssertViolationMEMORY_FREE, mainErr8RequiresViolation, mainErr34RequiresViolation, mainErr47RequiresViolation, mainErr14RequiresViolation, mainErr40RequiresViolation]=== [2018-04-10 14:28:34,679 INFO L82 PathProgramCache]: Analyzing trace with hash 1115169642, now seen corresponding path program 5 times [2018-04-10 14:28:34,680 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-04-10 14:28:34,680 INFO L68 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-04-10 14:28:34,680 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-10 14:28:34,680 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-04-10 14:28:34,680 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-10 14:28:34,686 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-10 14:28:34,687 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-10 14:28:35,122 INFO L134 CoverageAnalysis]: Checked inductivity of 50 backedges. 0 proven. 50 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-10 14:28:35,122 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-04-10 14:28:35,122 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 41 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 41 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-04-10 14:28:35,128 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2018-04-10 14:28:35,174 INFO L242 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 4 check-sat command(s) [2018-04-10 14:28:35,174 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-04-10 14:28:35,176 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-10 14:28:35,208 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 14:28:35,209 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 14:28:35,209 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:28:35,209 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-10 14:28:35,214 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-10 14:28:35,214 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:26, output treesize:24 [2018-04-10 14:28:35,237 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 8 [2018-04-10 14:28:35,238 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-04-10 14:28:35,238 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-10 14:28:35,239 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-10 14:28:35,247 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 8 [2018-04-10 14:28:35,248 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 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:28:35,248 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-04-10 14:28:35,249 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-10 14:28:35,255 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:28:35,255 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 3 variables, input treesize:43, output treesize:36 [2018-04-10 14:28:35,326 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 14:28:35,329 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 36 treesize of output 37 [2018-04-10 14:28:35,330 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select 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 11 [2018-04-10 14:28:35,330 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-10 14:28:35,334 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-10 14:28:35,345 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 37 treesize of output 42 [2018-04-10 14:28:35,346 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 15 [2018-04-10 14:28:35,346 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-04-10 14:28:35,350 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-10 14:28:35,357 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-04-10 14:28:35,357 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 2 variables, input treesize:66, output treesize:66 [2018-04-10 14:28:35,389 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select 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:28:35,390 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-10 14:28:35,404 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 14:28:35,405 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 14:28:35,405 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 14:28:35,405 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:28:35,406 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-10 14:28:35,420 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-10 14:28:35,420 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:86, output treesize:91 [2018-04-10 14:28:35,473 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 62 treesize of output 61 [2018-04-10 14:28:35,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, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 26 [2018-04-10 14:28:35,476 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-10 14:28:35,483 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-10 14:28:35,499 INFO L682 Elim1Store]: detected equality via solver [2018-04-10 14:28:35,500 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 52 treesize of output 63 [2018-04-10 14:28:35,502 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 30 [2018-04-10 14:28:35,502 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-04-10 14:28:35,507 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-10 14:28:35,519 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:28:35,519 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 3 variables, input treesize:115, output treesize:105 [2018-04-10 14:28:35,644 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 14:28:35,644 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 14:28:35,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 2 new quantified variables, introduced 0 case distinctions, treesize of input 129 treesize of output 125 [2018-04-10 14:28:35,650 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select 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:28:35,650 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-10 14:28:35,662 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-10 14:28:35,676 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 14:28:35,680 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 103 treesize of output 120 [2018-04-10 14:28:35,681 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-04-10 14:28:35,681 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-04-10 14:28:35,690 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-10 14:28:35,701 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-04-10 14:28:35,701 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 2 variables, input treesize:152, output treesize:132 [2018-04-10 14:28:35,744 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 14:28:35,745 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 14:28:35,745 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 14:28:35,746 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 14:28:35,746 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 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:28:35,746 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-10 14:28:35,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, 5 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:28:35,763 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-10 14:28:35,777 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-10 14:28:35,777 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:143, output treesize:146 [2018-04-10 14:28:35,830 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 14:28:35,831 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 14:28:35,835 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 5 disjoint index pairs (out of 3 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 134 treesize of output 128 [2018-04-10 14:28:35,838 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 7 [2018-04-10 14:28:35,838 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-10 14:28:35,851 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-10 14:28:35,875 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 14:28:35,875 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 14:28:35,879 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 5 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 125 treesize of output 140 [2018-04-10 14:28:35,881 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 14 treesize of output 7 [2018-04-10 14:28:35,882 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-04-10 14:28:35,892 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-10 14:28:35,906 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:28:35,906 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 4 variables, input treesize:168, output treesize:136 [2018-04-10 14:28:36,048 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 6 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 260 treesize of output 162 [2018-04-10 14:28:36,049 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 23 [2018-04-10 14:28:36,050 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-10 14:28:36,064 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-10 14:28:36,084 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 239 treesize of output 231 [2018-04-10 14:28:36,086 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 23 [2018-04-10 14:28:36,086 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-04-10 14:28:36,100 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-10 14:28:36,114 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:28:36,115 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 4 variables, input treesize:267, output treesize:227 [2018-04-10 14:28:36,345 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 6 disjoint index pairs (out of 6 index pairs), introduced 6 new quantified variables, introduced 0 case distinctions, treesize of input 250 treesize of output 132 [2018-04-10 14:28:36,346 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 43 treesize of output 33 [2018-04-10 14:28:36,346 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-04-10 14:28:36,361 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select 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:28:36,361 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-04-10 14:28:36,373 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 53 treesize of output 20 [2018-04-10 14:28:36,373 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-04-10 14:28:36,384 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 45 treesize of output 35 [2018-04-10 14:28:36,384 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:28:36,395 INFO L267 ElimStorePlain]: Start of recursive call 2: 4 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2018-04-10 14:28:36,408 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 37 treesize of output 37 [2018-04-10 14:28:36,409 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 11 [2018-04-10 14:28:36,410 INFO L267 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 1 xjuncts. [2018-04-10 14:28:36,414 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 3 [2018-04-10 14:28:36,415 INFO L267 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 1 xjuncts. [2018-04-10 14:28:36,417 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 1 [2018-04-10 14:28:36,417 INFO L267 ElimStorePlain]: Start of recursive call 10: End of recursive call: and 1 xjuncts. [2018-04-10 14:28:36,418 INFO L267 ElimStorePlain]: Start of recursive call 7: 3 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-10 14:28:36,426 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:28:36,426 INFO L202 ElimStorePlain]: Needed 10 recursive calls to eliminate 6 variables, input treesize:257, output treesize:18 [2018-04-10 14:28:36,516 INFO L134 CoverageAnalysis]: Checked inductivity of 50 backedges. 0 proven. 50 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-10 14:28:36,533 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-04-10 14:28:36,533 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [27, 23] total 49 [2018-04-10 14:28:36,533 INFO L442 AbstractCegarLoop]: Interpolant automaton has 50 states [2018-04-10 14:28:36,533 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 50 interpolants. [2018-04-10 14:28:36,533 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=186, Invalid=2264, Unknown=0, NotChecked=0, Total=2450 [2018-04-10 14:28:36,533 INFO L87 Difference]: Start difference. First operand 574 states and 660 transitions. Second operand 50 states. [2018-04-10 14:28:41,801 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-10 14:28:41,801 INFO L93 Difference]: Finished difference Result 758 states and 840 transitions. [2018-04-10 14:28:41,801 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 49 states. [2018-04-10 14:28:41,801 INFO L78 Accepts]: Start accepts. Automaton has 50 states. Word has length 63 [2018-04-10 14:28:41,801 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-10 14:28:41,802 INFO L225 Difference]: With dead ends: 758 [2018-04-10 14:28:41,802 INFO L226 Difference]: Without dead ends: 758 [2018-04-10 14:28:41,803 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 139 GetRequests, 43 SyntacticMatches, 2 SemanticMatches, 94 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2486 ImplicationChecksByTransitivity, 3.3s TimeCoverageRelationStatistics Valid=981, Invalid=8136, Unknown=3, NotChecked=0, Total=9120 [2018-04-10 14:28:41,803 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 758 states. [2018-04-10 14:28:41,805 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 758 to 567. [2018-04-10 14:28:41,805 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 567 states. [2018-04-10 14:28:41,806 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 567 states to 567 states and 652 transitions. [2018-04-10 14:28:41,806 INFO L78 Accepts]: Start accepts. Automaton has 567 states and 652 transitions. Word has length 63 [2018-04-10 14:28:41,806 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-10 14:28:41,806 INFO L459 AbstractCegarLoop]: Abstraction has 567 states and 652 transitions. [2018-04-10 14:28:41,806 INFO L460 AbstractCegarLoop]: Interpolant automaton has 50 states. [2018-04-10 14:28:41,806 INFO L276 IsEmpty]: Start isEmpty. Operand 567 states and 652 transitions. [2018-04-10 14:28:41,807 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2018-04-10 14:28:41,807 INFO L347 BasicCegarLoop]: Found error trace [2018-04-10 14:28:41,807 INFO L355 BasicCegarLoop]: trace histogram [5, 5, 4, 4, 4, 4, 4, 4, 4, 1, 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:28:41,807 INFO L408 AbstractCegarLoop]: === Iteration 54 === [mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr31RequiresViolation, mainErr46RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr15RequiresViolation, mainErr49RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr17RequiresViolation, mainErr42RequiresViolation, mainErr30RequiresViolation, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr44RequiresViolation, mainErr10RequiresViolation, mainErr43RequiresViolation, mainErr4RequiresViolation, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr51AssertViolationMEMORY_FREE, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr48RequiresViolation, mainErr52EnsuresViolationMEMORY_LEAK, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr45RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr9RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr50AssertViolationMEMORY_FREE, mainErr8RequiresViolation, mainErr34RequiresViolation, mainErr47RequiresViolation, mainErr14RequiresViolation, mainErr40RequiresViolation]=== [2018-04-10 14:28:41,807 INFO L82 PathProgramCache]: Analyzing trace with hash -662667368, now seen corresponding path program 4 times [2018-04-10 14:28:41,807 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-04-10 14:28:41,807 INFO L68 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-04-10 14:28:41,807 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-10 14:28:41,807 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-04-10 14:28:41,808 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-10 14:28:41,814 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-10 14:28:41,815 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-10 14:28:42,225 INFO L134 CoverageAnalysis]: Checked inductivity of 66 backedges. 0 proven. 66 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-10 14:28:42,225 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-04-10 14:28:42,225 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 42 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 42 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-04-10 14:28:42,230 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-04-10 14:28:42,249 INFO L242 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-04-10 14:28:42,250 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-04-10 14:28:42,251 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-10 14:28:42,257 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 14:28:42,257 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 14:28:42,258 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:28:42,258 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-10 14:28:42,263 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-10 14:28:42,263 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:26, output treesize:24 [2018-04-10 14:28:42,283 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:28:42,284 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:28:42,284 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-10 14:28:42,285 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-10 14:28:42,291 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:28:42,291 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:35, output treesize:32 [2018-04-10 14:28:42,351 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 14:28:42,353 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 36 treesize of output 37 [2018-04-10 14:28:42,354 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-04-10 14:28:42,354 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-10 14:28:42,358 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-10 14:28:42,363 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-04-10 14:28:42,363 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:44, output treesize:36 [2018-04-10 14:28:42,386 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 14:28:42,386 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 14:28:42,387 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 14:28:42,387 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:28:42,387 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-10 14:28:42,396 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-10 14:28:42,396 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:47, output treesize:53 [2018-04-10 14:28:42,426 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 43 treesize of output 42 [2018-04-10 14:28:42,427 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 14 treesize of output 7 [2018-04-10 14:28:42,427 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-10 14:28:42,431 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-10 14:28:42,438 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:28:42,438 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:69, output treesize:54 [2018-04-10 14:28:42,534 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 14:28:42,534 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 14:28:42,538 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 81 treesize of output 81 [2018-04-10 14:28:42,539 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select 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:28:42,539 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-10 14:28:42,547 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-10 14:28:42,556 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:28:42,556 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:89, output treesize:69 [2018-04-10 14:28:42,603 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 14:28:42,604 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 14:28:42,604 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 14:28:42,605 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 14:28:42,605 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:28:42,605 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-10 14:28:42,621 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:28:42,621 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:80, output treesize:106 [2018-04-10 14:28:42,663 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 14:28:42,667 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 5 disjoint index pairs (out of 3 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 100 treesize of output 90 [2018-04-10 14:28:42,669 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 7 [2018-04-10 14:28:42,669 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-10 14:28:42,678 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-10 14:28:42,690 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-04-10 14:28:42,691 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:117, output treesize:107 [2018-04-10 14:28:42,814 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 14:28:42,815 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 14:28:42,815 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 14:28:42,822 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 137 [2018-04-10 14:28:42,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:28:42,824 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-10 14:28:42,838 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-10 14:28:42,852 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:28:42,852 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:170, output treesize:142 [2018-04-10 14:28:42,908 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 51 treesize of output 146 [2018-04-10 14:28:42,908 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-10 14:28:42,929 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:28:42,929 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:151, output treesize:150 [2018-04-10 14:28:43,003 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 20 [2018-04-10 14:28:43,005 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 19 [2018-04-10 14:28:43,005 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-10 14:28:43,007 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-10 14:28:43,033 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 14:28:43,041 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 164 treesize of output 129 [2018-04-10 14:28:43,044 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 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 7 [2018-04-10 14:28:43,044 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-04-10 14:28:43,058 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-10 14:28:43,075 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 2 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2018-04-10 14:28:43,075 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 5 variables, input treesize:169, output treesize:163 [2018-04-10 14:28:43,280 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 5 select indices, 5 select index equivalence classes, 6 disjoint index pairs (out of 10 index pairs), introduced 8 new quantified variables, introduced 12 case distinctions, treesize of input 230 treesize of output 194 [2018-04-10 14:28:43,280 WARN L130 XnfTransformerHelper]: expecting exponential blowup for input size 8 [2018-04-10 14:28:43,324 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. Received shutdown request... [2018-04-10 14:29:11,590 INFO L175 TraceCheckSpWp]: Timeout while computing interpolants [2018-04-10 14:29:11,590 WARN L519 AbstractCegarLoop]: Verification canceled [2018-04-10 14:29:11,594 WARN L197 ceAbstractionStarter]: Timeout [2018-04-10 14:29:11,594 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 10.04 02:29:11 BoogieIcfgContainer [2018-04-10 14:29:11,594 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-04-10 14:29:11,595 INFO L168 Benchmark]: Toolchain (without parser) took 191543.92 ms. Allocated memory was 396.9 MB in the beginning and 796.4 MB in the end (delta: 399.5 MB). Free memory was 333.7 MB in the beginning and 697.7 MB in the end (delta: -363.9 MB). Peak memory consumption was 385.9 MB. Max. memory is 5.3 GB. [2018-04-10 14:29:11,596 INFO L168 Benchmark]: CDTParser took 0.15 ms. Allocated memory is still 396.9 MB. Free memory is still 358.8 MB. There was no memory consumed. Max. memory is 5.3 GB. [2018-04-10 14:29:11,596 INFO L168 Benchmark]: CACSL2BoogieTranslator took 274.71 ms. Allocated memory is still 396.9 MB. Free memory was 332.4 MB in the beginning and 304.6 MB in the end (delta: 27.8 MB). Peak memory consumption was 27.8 MB. Max. memory is 5.3 GB. [2018-04-10 14:29:11,596 INFO L168 Benchmark]: Boogie Preprocessor took 45.07 ms. Allocated memory is still 396.9 MB. Free memory was 304.6 MB in the beginning and 302.0 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:29:11,596 INFO L168 Benchmark]: RCFGBuilder took 511.67 ms. Allocated memory was 396.9 MB in the beginning and 601.4 MB in the end (delta: 204.5 MB). Free memory was 302.0 MB in the beginning and 521.4 MB in the end (delta: -219.4 MB). Peak memory consumption was 23.5 MB. Max. memory is 5.3 GB. [2018-04-10 14:29:11,597 INFO L168 Benchmark]: TraceAbstraction took 190709.54 ms. Allocated memory was 601.4 MB in the beginning and 796.4 MB in the end (delta: 195.0 MB). Free memory was 521.4 MB in the beginning and 697.7 MB in the end (delta: -176.3 MB). Peak memory consumption was 369.1 MB. Max. memory is 5.3 GB. [2018-04-10 14:29:11,598 INFO L344 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.15 ms. Allocated memory is still 396.9 MB. Free memory is still 358.8 MB. There was no memory consumed. Max. memory is 5.3 GB. * CACSL2BoogieTranslator took 274.71 ms. Allocated memory is still 396.9 MB. Free memory was 332.4 MB in the beginning and 304.6 MB in the end (delta: 27.8 MB). Peak memory consumption was 27.8 MB. Max. memory is 5.3 GB. * Boogie Preprocessor took 45.07 ms. Allocated memory is still 396.9 MB. Free memory was 304.6 MB in the beginning and 302.0 MB in the end (delta: 2.6 MB). Peak memory consumption was 2.6 MB. Max. memory is 5.3 GB. * RCFGBuilder took 511.67 ms. Allocated memory was 396.9 MB in the beginning and 601.4 MB in the end (delta: 204.5 MB). Free memory was 302.0 MB in the beginning and 521.4 MB in the end (delta: -219.4 MB). Peak memory consumption was 23.5 MB. Max. memory is 5.3 GB. * TraceAbstraction took 190709.54 ms. Allocated memory was 601.4 MB in the beginning and 796.4 MB in the end (delta: 195.0 MB). Free memory was 521.4 MB in the beginning and 697.7 MB in the end (delta: -176.3 MB). Peak memory consumption was 369.1 MB. Max. memory is 5.3 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - TimeoutResultAtElement [Line: 1006]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 1006). Cancelled while BasicCegarLoop was analyzing trace of length 64 with TraceHistMax 5, 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 2119. - TimeoutResultAtElement [Line: 1004]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 1004). Cancelled while BasicCegarLoop was analyzing trace of length 64 with TraceHistMax 5, 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 2119. - TimeoutResultAtElement [Line: 1006]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 1006). Cancelled while BasicCegarLoop was analyzing trace of length 64 with TraceHistMax 5, 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 2119. - TimeoutResultAtElement [Line: 1034]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 1034). Cancelled while BasicCegarLoop was analyzing trace of length 64 with TraceHistMax 5, 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 2119. - TimeoutResultAtElement [Line: 985]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 985). Cancelled while BasicCegarLoop was analyzing trace of length 64 with TraceHistMax 5, 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 2119. - TimeoutResultAtElement [Line: 1009]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 1009). Cancelled while BasicCegarLoop was analyzing trace of length 64 with TraceHistMax 5, 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 2119. - TimeoutResultAtElement [Line: 1041]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 1041). Cancelled while BasicCegarLoop was analyzing trace of length 64 with TraceHistMax 5, 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 2119. - TimeoutResultAtElement [Line: 1009]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 1009). Cancelled while BasicCegarLoop was analyzing trace of length 64 with TraceHistMax 5, 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 2119. - TimeoutResultAtElement [Line: 986]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 986). Cancelled while BasicCegarLoop was analyzing trace of length 64 with TraceHistMax 5, 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 2119. - TimeoutResultAtElement [Line: 998]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 998). Cancelled while BasicCegarLoop was analyzing trace of length 64 with TraceHistMax 5, 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 2119. - TimeoutResultAtElement [Line: 1049]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 1049). Cancelled while BasicCegarLoop was analyzing trace of length 64 with TraceHistMax 5, 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 2119. - TimeoutResultAtElement [Line: 995]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 995). Cancelled while BasicCegarLoop was analyzing trace of length 64 with TraceHistMax 5, 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 2119. - TimeoutResultAtElement [Line: 991]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 991). Cancelled while BasicCegarLoop was analyzing trace of length 64 with TraceHistMax 5, 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 2119. - TimeoutResultAtElement [Line: 1018]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 1018). Cancelled while BasicCegarLoop was analyzing trace of length 64 with TraceHistMax 5, 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 2119. - TimeoutResultAtElement [Line: 1002]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 1002). Cancelled while BasicCegarLoop was analyzing trace of length 64 with TraceHistMax 5, 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 2119. - TimeoutResultAtElement [Line: 1038]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 1038). Cancelled while BasicCegarLoop was analyzing trace of length 64 with TraceHistMax 5, 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 2119. - TimeoutResultAtElement [Line: 1009]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 1009). Cancelled while BasicCegarLoop was analyzing trace of length 64 with TraceHistMax 5, 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 2119. - TimeoutResultAtElement [Line: 991]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 991). Cancelled while BasicCegarLoop was analyzing trace of length 64 with TraceHistMax 5, 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 2119. - TimeoutResultAtElement [Line: 1006]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 1006). Cancelled while BasicCegarLoop was analyzing trace of length 64 with TraceHistMax 5, 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 2119. - TimeoutResultAtElement [Line: 1039]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 1039). Cancelled while BasicCegarLoop was analyzing trace of length 64 with TraceHistMax 5, 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 2119. - TimeoutResultAtElement [Line: 991]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 991). Cancelled while BasicCegarLoop was analyzing trace of length 64 with TraceHistMax 5, 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 2119. - TimeoutResultAtElement [Line: 1038]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 1038). Cancelled while BasicCegarLoop was analyzing trace of length 64 with TraceHistMax 5, 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 2119. - TimeoutResultAtElement [Line: 991]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 991). Cancelled while BasicCegarLoop was analyzing trace of length 64 with TraceHistMax 5, 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 2119. - TimeoutResultAtElement [Line: 1031]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 1031). Cancelled while BasicCegarLoop was analyzing trace of length 64 with TraceHistMax 5, 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 2119. - TimeoutResultAtElement [Line: 991]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 991). Cancelled while BasicCegarLoop was analyzing trace of length 64 with TraceHistMax 5, 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 2119. - TimeoutResultAtElement [Line: 995]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 995). Cancelled while BasicCegarLoop was analyzing trace of length 64 with TraceHistMax 5, 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 2119. - TimeoutResultAtElement [Line: 1031]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 1031). Cancelled while BasicCegarLoop was analyzing trace of length 64 with TraceHistMax 5, 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 2119. - TimeoutResultAtElement [Line: 1050]: Timeout (TraceAbstraction) Unable to prove that free always succeeds (line 1050). Cancelled while BasicCegarLoop was analyzing trace of length 64 with TraceHistMax 5, 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 2119. - TimeoutResultAtElement [Line: 1009]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 1009). Cancelled while BasicCegarLoop was analyzing trace of length 64 with TraceHistMax 5, 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 2119. - TimeoutResultAtElement [Line: 1016]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 1016). Cancelled while BasicCegarLoop was analyzing trace of length 64 with TraceHistMax 5, 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 2119. - TimeoutResultAtElement [Line: 1006]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 1006). Cancelled while BasicCegarLoop was analyzing trace of length 64 with TraceHistMax 5, 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 2119. - TimeoutResultAtElement [Line: 1034]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 1034). Cancelled while BasicCegarLoop was analyzing trace of length 64 with TraceHistMax 5, 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 2119. - TimeoutResultAtElement [Line: 1049]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 1049). Cancelled while BasicCegarLoop was analyzing trace of length 64 with TraceHistMax 5, 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 2119. - TimeoutResultAtElement [Line: 981]: Timeout (TraceAbstraction) Unable to prove that all allocated memory was freed (line 981). Cancelled while BasicCegarLoop was analyzing trace of length 64 with TraceHistMax 5, 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 2119. - TimeoutResultAtElement [Line: 1034]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 1034). Cancelled while BasicCegarLoop was analyzing trace of length 64 with TraceHistMax 5, 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 2119. - TimeoutResultAtElement [Line: 1002]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 1002). Cancelled while BasicCegarLoop was analyzing trace of length 64 with TraceHistMax 5, 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 2119. - TimeoutResultAtElement [Line: 1006]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 1006). Cancelled while BasicCegarLoop was analyzing trace of length 64 with TraceHistMax 5, 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 2119. - TimeoutResultAtElement [Line: 986]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 986). Cancelled while BasicCegarLoop was analyzing trace of length 64 with TraceHistMax 5, 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 2119. - TimeoutResultAtElement [Line: 1039]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 1039). Cancelled while BasicCegarLoop was analyzing trace of length 64 with TraceHistMax 5, 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 2119. - TimeoutResultAtElement [Line: 1004]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 1004). Cancelled while BasicCegarLoop was analyzing trace of length 64 with TraceHistMax 5, 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 2119. - TimeoutResultAtElement [Line: 1006]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 1006). Cancelled while BasicCegarLoop was analyzing trace of length 64 with TraceHistMax 5, 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 2119. - TimeoutResultAtElement [Line: 1016]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 1016). Cancelled while BasicCegarLoop was analyzing trace of length 64 with TraceHistMax 5, 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 2119. - TimeoutResultAtElement [Line: 1006]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 1006). Cancelled while BasicCegarLoop was analyzing trace of length 64 with TraceHistMax 5, 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 2119. - TimeoutResultAtElement [Line: 985]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 985). Cancelled while BasicCegarLoop was analyzing trace of length 64 with TraceHistMax 5, 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 2119. - TimeoutResultAtElement [Line: 991]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 991). Cancelled while BasicCegarLoop was analyzing trace of length 64 with TraceHistMax 5, 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 2119. - TimeoutResultAtElement [Line: 991]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 991). Cancelled while BasicCegarLoop was analyzing trace of length 64 with TraceHistMax 5, 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 2119. - TimeoutResultAtElement [Line: 1006]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 1006). Cancelled while BasicCegarLoop was analyzing trace of length 64 with TraceHistMax 5, 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 2119. - TimeoutResultAtElement [Line: 1050]: Timeout (TraceAbstraction) Unable to prove that free always succeeds (line 1050). Cancelled while BasicCegarLoop was analyzing trace of length 64 with TraceHistMax 5, 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 2119. - TimeoutResultAtElement [Line: 991]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 991). Cancelled while BasicCegarLoop was analyzing trace of length 64 with TraceHistMax 5, 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 2119. - TimeoutResultAtElement [Line: 1018]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 1018). Cancelled while BasicCegarLoop was analyzing trace of length 64 with TraceHistMax 5, 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 2119. - TimeoutResultAtElement [Line: 1041]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 1041). Cancelled while BasicCegarLoop was analyzing trace of length 64 with TraceHistMax 5, 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 2119. - TimeoutResultAtElement [Line: 998]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 998). Cancelled while BasicCegarLoop was analyzing trace of length 64 with TraceHistMax 5, 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 2119. - TimeoutResultAtElement [Line: 1034]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 1034). Cancelled while BasicCegarLoop was analyzing trace of length 64 with TraceHistMax 5, 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 2119. - StatisticsResult: Ultimate Automizer benchmark data CFG has 3 procedures, 136 locations, 53 error locations. TIMEOUT Result, 190.6s OverallTime, 54 OverallIterations, 5 TraceHistogramMax, 79.6s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 5400 SDtfs, 31310 SDslu, 52504 SDs, 0 SdLazy, 78046 SolverSat, 4828 SolverUnsat, 55 SolverUnknown, 0 SolverNotchecked, 35.9s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 3825 GetRequests, 1616 SyntacticMatches, 135 SemanticMatches, 2074 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 31500 ImplicationChecksByTransitivity, 68.5s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=574occurred in iteration=52, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s AbstIntTime, 0 AbstIntIterations, 0 AbstIntStrong, NaN AbsIntWeakeningRatio, NaN AbsIntAvgWeakeningVarsNumRemoved, NaN AbsIntAvgWeakenedConjuncts, 0.0s DumpTime, AutomataMinimizationStatistics: 0.1s AutomataMinimizationTime, 53 MinimizatonAttempts, 4963 StatesRemovedByMinimization, 52 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.2s SsaConstructionTime, 1.0s SatisfiabilityAnalysisTime, 78.1s InterpolantComputationTime, 4436 NumberOfCodeBlocks, 4426 NumberOfCodeBlocksAsserted, 123 NumberOfCheckSat, 4343 ConstructedInterpolants, 682 QuantifiedInterpolants, 7116075 SizeOfPredicates, 692 NumberOfNonLiveVariables, 8348 ConjunctsInSsa, 1850 ConjunctsInUnsatCore, 93 InterpolantComputations, 14 PerfectInterpolantSequences, 80/1346 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-reverse_simple_true-unreach-call_true-valid-memsafety.i_svcomp-DerefFreeMemtrack-32bit-Automizer_Camel.epf_AutomizerC.xml/Csv-Benchmark-0-2018-04-10_14-29-11-604.csv Written .csv to /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/sll-reverse_simple_true-unreach-call_true-valid-memsafety.i_svcomp-DerefFreeMemtrack-32bit-Automizer_Camel.epf_AutomizerC.xml/Csv-TraceAbstractionBenchmarks-0-2018-04-10_14-29-11-604.csv Completed graceful shutdown