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_SmtInterpol_NoArray.epf -i ../../../trunk/examples/svcomp/forester-heap/dll-rb-cnstr_1_false-unreach-call_false-valid-deref.i -------------------------------------------------------------------------------- This is Ultimate 0.1.23-666feb3-m [2018-04-10 16:51:19,372 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-04-10 16:51:19,373 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-04-10 16:51:19,386 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-04-10 16:51:19,386 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-04-10 16:51:19,387 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-04-10 16:51:19,387 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-04-10 16:51:19,389 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-04-10 16:51:19,390 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-04-10 16:51:19,391 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-04-10 16:51:19,392 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-04-10 16:51:19,392 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-04-10 16:51:19,393 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-04-10 16:51:19,393 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-04-10 16:51:19,394 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-04-10 16:51:19,395 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-04-10 16:51:19,397 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-04-10 16:51:19,398 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-04-10 16:51:19,399 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-04-10 16:51:19,400 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-04-10 16:51:19,402 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-04-10 16:51:19,402 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-04-10 16:51:19,402 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-04-10 16:51:19,403 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-04-10 16:51:19,404 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-04-10 16:51:19,405 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-04-10 16:51:19,405 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-04-10 16:51:19,406 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-04-10 16:51:19,406 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-04-10 16:51:19,406 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-04-10 16:51:19,407 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-04-10 16:51:19,407 INFO L98 SettingsManager]: Beginning loading settings from /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/cade18-smtinterpol/svcomp-DerefFreeMemtrack-32bit-Automizer_SmtInterpol_NoArray.epf [2018-04-10 16:51:19,424 INFO L110 SettingsManager]: Loading preferences was successful [2018-04-10 16:51:19,424 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-04-10 16:51:19,425 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-04-10 16:51:19,425 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-04-10 16:51:19,425 INFO L133 SettingsManager]: * Use SBE=true [2018-04-10 16:51:19,425 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-04-10 16:51:19,426 INFO L133 SettingsManager]: * sizeof long=4 [2018-04-10 16:51:19,426 INFO L133 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2018-04-10 16:51:19,426 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-04-10 16:51:19,426 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-04-10 16:51:19,426 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-04-10 16:51:19,426 INFO L133 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2018-04-10 16:51:19,426 INFO L133 SettingsManager]: * Bitprecise bitfields=true [2018-04-10 16:51:19,426 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-04-10 16:51:19,426 INFO L133 SettingsManager]: * sizeof long double=12 [2018-04-10 16:51:19,426 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-04-10 16:51:19,427 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-04-10 16:51:19,427 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-04-10 16:51:19,427 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-04-10 16:51:19,427 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-04-10 16:51:19,427 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-04-10 16:51:19,427 INFO L133 SettingsManager]: * Interpolant automaton=TWOTRACK [2018-04-10 16:51:19,427 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-04-10 16:51:19,427 INFO L133 SettingsManager]: * Trace refinement strategy=SMTINTERPOL [2018-04-10 16:51:19,454 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-04-10 16:51:19,463 INFO L266 ainManager$Toolchain]: [Toolchain 1]: Parser(s) successfully (re)initialized [2018-04-10 16:51:19,467 INFO L222 ainManager$Toolchain]: [Toolchain 1]: Toolchain data selected. [2018-04-10 16:51:19,468 INFO L271 PluginConnector]: Initializing CDTParser... [2018-04-10 16:51:19,468 INFO L276 PluginConnector]: CDTParser initialized [2018-04-10 16:51:19,469 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/forester-heap/dll-rb-cnstr_1_false-unreach-call_false-valid-deref.i [2018-04-10 16:51:19,801 INFO L225 CDTParser]: Created temporary CDT project at /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/data/FLAGeb13720ee [2018-04-10 16:51:19,928 INFO L287 CDTParser]: IsIndexed: true [2018-04-10 16:51:19,928 INFO L288 CDTParser]: Found 1 translation units. [2018-04-10 16:51:19,929 INFO L168 CDTParser]: Scanning dll-rb-cnstr_1_false-unreach-call_false-valid-deref.i [2018-04-10 16:51:19,937 INFO L210 ultiparseSymbolTable]: Include resolver: [2018-04-10 16:51:19,938 INFO L215 ultiparseSymbolTable]: [2018-04-10 16:51:19,938 INFO L218 ultiparseSymbolTable]: Function table: [2018-04-10 16:51:19,938 INFO L221 ultiparseSymbolTable]: Function definition of null ('main') in dll-rb-cnstr_1_false-unreach-call_false-valid-deref.i [2018-04-10 16:51:19,938 INFO L227 ultiparseSymbolTable]: Global variable table: [2018-04-10 16:51:19,938 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fdll_rb_cnstr___false_unreach_call_false_valid_deref_i____fsfilcnt64_t in dll-rb-cnstr_1_false-unreach-call_false-valid-deref.i [2018-04-10 16:51:19,938 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fdll_rb_cnstr___false_unreach_call_false_valid_deref_i__ino_t in dll-rb-cnstr_1_false-unreach-call_false-valid-deref.i [2018-04-10 16:51:19,938 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fdll_rb_cnstr___false_unreach_call_false_valid_deref_i____blkcnt64_t in dll-rb-cnstr_1_false-unreach-call_false-valid-deref.i [2018-04-10 16:51:19,939 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fdll_rb_cnstr___false_unreach_call_false_valid_deref_i__ldiv_t in dll-rb-cnstr_1_false-unreach-call_false-valid-deref.i [2018-04-10 16:51:19,939 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fdll_rb_cnstr___false_unreach_call_false_valid_deref_i____socklen_t in dll-rb-cnstr_1_false-unreach-call_false-valid-deref.i [2018-04-10 16:51:19,939 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fdll_rb_cnstr___false_unreach_call_false_valid_deref_i__fsfilcnt_t in dll-rb-cnstr_1_false-unreach-call_false-valid-deref.i [2018-04-10 16:51:19,939 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fdll_rb_cnstr___false_unreach_call_false_valid_deref_i__pid_t in dll-rb-cnstr_1_false-unreach-call_false-valid-deref.i [2018-04-10 16:51:19,939 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fdll_rb_cnstr___false_unreach_call_false_valid_deref_i__int32_t in dll-rb-cnstr_1_false-unreach-call_false-valid-deref.i [2018-04-10 16:51:19,939 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fdll_rb_cnstr___false_unreach_call_false_valid_deref_i____mode_t in dll-rb-cnstr_1_false-unreach-call_false-valid-deref.i [2018-04-10 16:51:19,939 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fdll_rb_cnstr___false_unreach_call_false_valid_deref_i__Colour in dll-rb-cnstr_1_false-unreach-call_false-valid-deref.i [2018-04-10 16:51:19,939 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fdll_rb_cnstr___false_unreach_call_false_valid_deref_i__gid_t in dll-rb-cnstr_1_false-unreach-call_false-valid-deref.i [2018-04-10 16:51:19,939 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fdll_rb_cnstr___false_unreach_call_false_valid_deref_i____fsblkcnt64_t in dll-rb-cnstr_1_false-unreach-call_false-valid-deref.i [2018-04-10 16:51:19,939 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fdll_rb_cnstr___false_unreach_call_false_valid_deref_i__u_short in dll-rb-cnstr_1_false-unreach-call_false-valid-deref.i [2018-04-10 16:51:19,940 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fdll_rb_cnstr___false_unreach_call_false_valid_deref_i____time_t in dll-rb-cnstr_1_false-unreach-call_false-valid-deref.i [2018-04-10 16:51:19,940 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fdll_rb_cnstr___false_unreach_call_false_valid_deref_i__int8_t in dll-rb-cnstr_1_false-unreach-call_false-valid-deref.i [2018-04-10 16:51:19,940 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fdll_rb_cnstr___false_unreach_call_false_valid_deref_i__u_int64_t in dll-rb-cnstr_1_false-unreach-call_false-valid-deref.i [2018-04-10 16:51:19,940 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fdll_rb_cnstr___false_unreach_call_false_valid_deref_i__key_t in dll-rb-cnstr_1_false-unreach-call_false-valid-deref.i [2018-04-10 16:51:19,940 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fdll_rb_cnstr___false_unreach_call_false_valid_deref_i____fsword_t in dll-rb-cnstr_1_false-unreach-call_false-valid-deref.i [2018-04-10 16:51:19,940 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fdll_rb_cnstr___false_unreach_call_false_valid_deref_i__ssize_t in dll-rb-cnstr_1_false-unreach-call_false-valid-deref.i [2018-04-10 16:51:19,940 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fdll_rb_cnstr___false_unreach_call_false_valid_deref_i____u_short in dll-rb-cnstr_1_false-unreach-call_false-valid-deref.i [2018-04-10 16:51:19,940 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fdll_rb_cnstr___false_unreach_call_false_valid_deref_i____fsfilcnt_t in dll-rb-cnstr_1_false-unreach-call_false-valid-deref.i [2018-04-10 16:51:19,940 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fdll_rb_cnstr___false_unreach_call_false_valid_deref_i__pthread_mutexattr_t in dll-rb-cnstr_1_false-unreach-call_false-valid-deref.i [2018-04-10 16:51:19,940 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fdll_rb_cnstr___false_unreach_call_false_valid_deref_i__u_int in dll-rb-cnstr_1_false-unreach-call_false-valid-deref.i [2018-04-10 16:51:19,940 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fdll_rb_cnstr___false_unreach_call_false_valid_deref_i____uint64_t in dll-rb-cnstr_1_false-unreach-call_false-valid-deref.i [2018-04-10 16:51:19,941 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fdll_rb_cnstr___false_unreach_call_false_valid_deref_i____timer_t in dll-rb-cnstr_1_false-unreach-call_false-valid-deref.i [2018-04-10 16:51:19,941 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fdll_rb_cnstr___false_unreach_call_false_valid_deref_i__idtype_t in dll-rb-cnstr_1_false-unreach-call_false-valid-deref.i [2018-04-10 16:51:19,941 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fdll_rb_cnstr___false_unreach_call_false_valid_deref_i__mode_t in dll-rb-cnstr_1_false-unreach-call_false-valid-deref.i [2018-04-10 16:51:19,941 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fdll_rb_cnstr___false_unreach_call_false_valid_deref_i____sig_atomic_t in dll-rb-cnstr_1_false-unreach-call_false-valid-deref.i [2018-04-10 16:51:19,941 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fdll_rb_cnstr___false_unreach_call_false_valid_deref_i____int32_t in dll-rb-cnstr_1_false-unreach-call_false-valid-deref.i [2018-04-10 16:51:19,941 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fdll_rb_cnstr___false_unreach_call_false_valid_deref_i____nlink_t in dll-rb-cnstr_1_false-unreach-call_false-valid-deref.i [2018-04-10 16:51:19,941 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fdll_rb_cnstr___false_unreach_call_false_valid_deref_i__pthread_t in dll-rb-cnstr_1_false-unreach-call_false-valid-deref.i [2018-04-10 16:51:19,941 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fdll_rb_cnstr___false_unreach_call_false_valid_deref_i____ssize_t in dll-rb-cnstr_1_false-unreach-call_false-valid-deref.i [2018-04-10 16:51:19,941 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fdll_rb_cnstr___false_unreach_call_false_valid_deref_i____fd_mask in dll-rb-cnstr_1_false-unreach-call_false-valid-deref.i [2018-04-10 16:51:19,941 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fdll_rb_cnstr___false_unreach_call_false_valid_deref_i__timer_t in dll-rb-cnstr_1_false-unreach-call_false-valid-deref.i [2018-04-10 16:51:19,942 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fdll_rb_cnstr___false_unreach_call_false_valid_deref_i____pthread_slist_t in dll-rb-cnstr_1_false-unreach-call_false-valid-deref.i [2018-04-10 16:51:19,942 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fdll_rb_cnstr___false_unreach_call_false_valid_deref_i____int8_t in dll-rb-cnstr_1_false-unreach-call_false-valid-deref.i [2018-04-10 16:51:19,942 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fdll_rb_cnstr___false_unreach_call_false_valid_deref_i__loff_t in dll-rb-cnstr_1_false-unreach-call_false-valid-deref.i [2018-04-10 16:51:19,942 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fdll_rb_cnstr___false_unreach_call_false_valid_deref_i__id_t in dll-rb-cnstr_1_false-unreach-call_false-valid-deref.i [2018-04-10 16:51:19,942 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fdll_rb_cnstr___false_unreach_call_false_valid_deref_i__uint in dll-rb-cnstr_1_false-unreach-call_false-valid-deref.i [2018-04-10 16:51:19,942 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fdll_rb_cnstr___false_unreach_call_false_valid_deref_i__pthread_condattr_t in dll-rb-cnstr_1_false-unreach-call_false-valid-deref.i [2018-04-10 16:51:19,942 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fdll_rb_cnstr___false_unreach_call_false_valid_deref_i____rlim64_t in dll-rb-cnstr_1_false-unreach-call_false-valid-deref.i [2018-04-10 16:51:19,942 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fdll_rb_cnstr___false_unreach_call_false_valid_deref_i__dev_t in dll-rb-cnstr_1_false-unreach-call_false-valid-deref.i [2018-04-10 16:51:19,942 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fdll_rb_cnstr___false_unreach_call_false_valid_deref_i____qaddr_t in dll-rb-cnstr_1_false-unreach-call_false-valid-deref.i [2018-04-10 16:51:19,943 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fdll_rb_cnstr___false_unreach_call_false_valid_deref_i____blksize_t in dll-rb-cnstr_1_false-unreach-call_false-valid-deref.i [2018-04-10 16:51:19,943 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fdll_rb_cnstr___false_unreach_call_false_valid_deref_i____useconds_t in dll-rb-cnstr_1_false-unreach-call_false-valid-deref.i [2018-04-10 16:51:19,943 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fdll_rb_cnstr___false_unreach_call_false_valid_deref_i____daddr_t in dll-rb-cnstr_1_false-unreach-call_false-valid-deref.i [2018-04-10 16:51:19,943 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fdll_rb_cnstr___false_unreach_call_false_valid_deref_i____key_t in dll-rb-cnstr_1_false-unreach-call_false-valid-deref.i [2018-04-10 16:51:19,943 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fdll_rb_cnstr___false_unreach_call_false_valid_deref_i____int64_t in dll-rb-cnstr_1_false-unreach-call_false-valid-deref.i [2018-04-10 16:51:19,943 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fdll_rb_cnstr___false_unreach_call_false_valid_deref_i__nlink_t in dll-rb-cnstr_1_false-unreach-call_false-valid-deref.i [2018-04-10 16:51:19,943 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fdll_rb_cnstr___false_unreach_call_false_valid_deref_i____uid_t in dll-rb-cnstr_1_false-unreach-call_false-valid-deref.i [2018-04-10 16:51:19,943 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fdll_rb_cnstr___false_unreach_call_false_valid_deref_i__u_quad_t in dll-rb-cnstr_1_false-unreach-call_false-valid-deref.i [2018-04-10 16:51:19,943 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fdll_rb_cnstr___false_unreach_call_false_valid_deref_i____uint8_t in dll-rb-cnstr_1_false-unreach-call_false-valid-deref.i [2018-04-10 16:51:19,943 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fdll_rb_cnstr___false_unreach_call_false_valid_deref_i__pthread_mutex_t in dll-rb-cnstr_1_false-unreach-call_false-valid-deref.i [2018-04-10 16:51:19,944 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fdll_rb_cnstr___false_unreach_call_false_valid_deref_i____blkcnt_t in dll-rb-cnstr_1_false-unreach-call_false-valid-deref.i [2018-04-10 16:51:19,944 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fdll_rb_cnstr___false_unreach_call_false_valid_deref_i__sigset_t in dll-rb-cnstr_1_false-unreach-call_false-valid-deref.i [2018-04-10 16:51:19,944 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fdll_rb_cnstr___false_unreach_call_false_valid_deref_i____fsblkcnt_t in dll-rb-cnstr_1_false-unreach-call_false-valid-deref.i [2018-04-10 16:51:19,944 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fdll_rb_cnstr___false_unreach_call_false_valid_deref_i__register_t in dll-rb-cnstr_1_false-unreach-call_false-valid-deref.i [2018-04-10 16:51:19,944 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fdll_rb_cnstr___false_unreach_call_false_valid_deref_i__pthread_barrierattr_t in dll-rb-cnstr_1_false-unreach-call_false-valid-deref.i [2018-04-10 16:51:19,944 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fdll_rb_cnstr___false_unreach_call_false_valid_deref_i____syscall_slong_t in dll-rb-cnstr_1_false-unreach-call_false-valid-deref.i [2018-04-10 16:51:19,944 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fdll_rb_cnstr___false_unreach_call_false_valid_deref_i__time_t in dll-rb-cnstr_1_false-unreach-call_false-valid-deref.i [2018-04-10 16:51:19,944 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fdll_rb_cnstr___false_unreach_call_false_valid_deref_i__pthread_rwlock_t in dll-rb-cnstr_1_false-unreach-call_false-valid-deref.i [2018-04-10 16:51:19,944 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fdll_rb_cnstr___false_unreach_call_false_valid_deref_i____u_int in dll-rb-cnstr_1_false-unreach-call_false-valid-deref.i [2018-04-10 16:51:19,945 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fdll_rb_cnstr___false_unreach_call_false_valid_deref_i__pthread_key_t in dll-rb-cnstr_1_false-unreach-call_false-valid-deref.i [2018-04-10 16:51:19,945 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fdll_rb_cnstr___false_unreach_call_false_valid_deref_i__clock_t in dll-rb-cnstr_1_false-unreach-call_false-valid-deref.i [2018-04-10 16:51:19,945 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fdll_rb_cnstr___false_unreach_call_false_valid_deref_i__pthread_rwlockattr_t in dll-rb-cnstr_1_false-unreach-call_false-valid-deref.i [2018-04-10 16:51:19,945 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fdll_rb_cnstr___false_unreach_call_false_valid_deref_i____int16_t in dll-rb-cnstr_1_false-unreach-call_false-valid-deref.i [2018-04-10 16:51:19,945 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fdll_rb_cnstr___false_unreach_call_false_valid_deref_i____uint16_t in dll-rb-cnstr_1_false-unreach-call_false-valid-deref.i [2018-04-10 16:51:19,945 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fdll_rb_cnstr___false_unreach_call_false_valid_deref_i____gid_t in dll-rb-cnstr_1_false-unreach-call_false-valid-deref.i [2018-04-10 16:51:19,945 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fdll_rb_cnstr___false_unreach_call_false_valid_deref_i____off_t in dll-rb-cnstr_1_false-unreach-call_false-valid-deref.i [2018-04-10 16:51:19,945 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fdll_rb_cnstr___false_unreach_call_false_valid_deref_i____ino64_t in dll-rb-cnstr_1_false-unreach-call_false-valid-deref.i [2018-04-10 16:51:19,945 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fdll_rb_cnstr___false_unreach_call_false_valid_deref_i__u_long in dll-rb-cnstr_1_false-unreach-call_false-valid-deref.i [2018-04-10 16:51:19,945 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fdll_rb_cnstr___false_unreach_call_false_valid_deref_i__pthread_barrier_t in dll-rb-cnstr_1_false-unreach-call_false-valid-deref.i [2018-04-10 16:51:19,946 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fdll_rb_cnstr___false_unreach_call_false_valid_deref_i____u_quad_t in dll-rb-cnstr_1_false-unreach-call_false-valid-deref.i [2018-04-10 16:51:19,946 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fdll_rb_cnstr___false_unreach_call_false_valid_deref_i__ulong in dll-rb-cnstr_1_false-unreach-call_false-valid-deref.i [2018-04-10 16:51:19,946 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fdll_rb_cnstr___false_unreach_call_false_valid_deref_i____ino_t in dll-rb-cnstr_1_false-unreach-call_false-valid-deref.i [2018-04-10 16:51:19,946 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fdll_rb_cnstr___false_unreach_call_false_valid_deref_i____fsid_t in dll-rb-cnstr_1_false-unreach-call_false-valid-deref.i [2018-04-10 16:51:19,946 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fdll_rb_cnstr___false_unreach_call_false_valid_deref_i____pid_t in dll-rb-cnstr_1_false-unreach-call_false-valid-deref.i [2018-04-10 16:51:19,946 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fdll_rb_cnstr___false_unreach_call_false_valid_deref_i__ushort in dll-rb-cnstr_1_false-unreach-call_false-valid-deref.i [2018-04-10 16:51:19,946 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fdll_rb_cnstr___false_unreach_call_false_valid_deref_i____quad_t in dll-rb-cnstr_1_false-unreach-call_false-valid-deref.i [2018-04-10 16:51:19,946 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fdll_rb_cnstr___false_unreach_call_false_valid_deref_i____loff_t in dll-rb-cnstr_1_false-unreach-call_false-valid-deref.i [2018-04-10 16:51:19,946 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fdll_rb_cnstr___false_unreach_call_false_valid_deref_i__suseconds_t in dll-rb-cnstr_1_false-unreach-call_false-valid-deref.i [2018-04-10 16:51:19,946 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fdll_rb_cnstr___false_unreach_call_false_valid_deref_i__int64_t in dll-rb-cnstr_1_false-unreach-call_false-valid-deref.i [2018-04-10 16:51:19,946 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fdll_rb_cnstr___false_unreach_call_false_valid_deref_i__fd_mask in dll-rb-cnstr_1_false-unreach-call_false-valid-deref.i [2018-04-10 16:51:19,947 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fdll_rb_cnstr___false_unreach_call_false_valid_deref_i____caddr_t in dll-rb-cnstr_1_false-unreach-call_false-valid-deref.i [2018-04-10 16:51:19,947 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fdll_rb_cnstr___false_unreach_call_false_valid_deref_i__clockid_t in dll-rb-cnstr_1_false-unreach-call_false-valid-deref.i [2018-04-10 16:51:19,947 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fdll_rb_cnstr___false_unreach_call_false_valid_deref_i____dev_t in dll-rb-cnstr_1_false-unreach-call_false-valid-deref.i [2018-04-10 16:51:19,947 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fdll_rb_cnstr___false_unreach_call_false_valid_deref_i____syscall_ulong_t in dll-rb-cnstr_1_false-unreach-call_false-valid-deref.i [2018-04-10 16:51:19,947 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fdll_rb_cnstr___false_unreach_call_false_valid_deref_i____clock_t in dll-rb-cnstr_1_false-unreach-call_false-valid-deref.i [2018-04-10 16:51:19,947 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fdll_rb_cnstr___false_unreach_call_false_valid_deref_i__fsid_t in dll-rb-cnstr_1_false-unreach-call_false-valid-deref.i [2018-04-10 16:51:19,947 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fdll_rb_cnstr___false_unreach_call_false_valid_deref_i__daddr_t in dll-rb-cnstr_1_false-unreach-call_false-valid-deref.i [2018-04-10 16:51:19,947 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fdll_rb_cnstr___false_unreach_call_false_valid_deref_i__u_int32_t in dll-rb-cnstr_1_false-unreach-call_false-valid-deref.i [2018-04-10 16:51:19,947 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fdll_rb_cnstr___false_unreach_call_false_valid_deref_i____uint32_t in dll-rb-cnstr_1_false-unreach-call_false-valid-deref.i [2018-04-10 16:51:19,947 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fdll_rb_cnstr___false_unreach_call_false_valid_deref_i__u_int8_t in dll-rb-cnstr_1_false-unreach-call_false-valid-deref.i [2018-04-10 16:51:19,948 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fdll_rb_cnstr___false_unreach_call_false_valid_deref_i__lldiv_t in dll-rb-cnstr_1_false-unreach-call_false-valid-deref.i [2018-04-10 16:51:19,948 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fdll_rb_cnstr___false_unreach_call_false_valid_deref_i__uid_t in dll-rb-cnstr_1_false-unreach-call_false-valid-deref.i [2018-04-10 16:51:19,948 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fdll_rb_cnstr___false_unreach_call_false_valid_deref_i____id_t in dll-rb-cnstr_1_false-unreach-call_false-valid-deref.i [2018-04-10 16:51:19,948 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fdll_rb_cnstr___false_unreach_call_false_valid_deref_i__fsblkcnt_t in dll-rb-cnstr_1_false-unreach-call_false-valid-deref.i [2018-04-10 16:51:19,948 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fdll_rb_cnstr___false_unreach_call_false_valid_deref_i__fd_set in dll-rb-cnstr_1_false-unreach-call_false-valid-deref.i [2018-04-10 16:51:19,948 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fdll_rb_cnstr___false_unreach_call_false_valid_deref_i__blksize_t in dll-rb-cnstr_1_false-unreach-call_false-valid-deref.i [2018-04-10 16:51:19,948 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fdll_rb_cnstr___false_unreach_call_false_valid_deref_i__wchar_t in dll-rb-cnstr_1_false-unreach-call_false-valid-deref.i [2018-04-10 16:51:19,948 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fdll_rb_cnstr___false_unreach_call_false_valid_deref_i____u_char in dll-rb-cnstr_1_false-unreach-call_false-valid-deref.i [2018-04-10 16:51:19,948 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fdll_rb_cnstr___false_unreach_call_false_valid_deref_i__SLL in dll-rb-cnstr_1_false-unreach-call_false-valid-deref.i [2018-04-10 16:51:19,948 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fdll_rb_cnstr___false_unreach_call_false_valid_deref_i__caddr_t in dll-rb-cnstr_1_false-unreach-call_false-valid-deref.i [2018-04-10 16:51:19,948 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fdll_rb_cnstr___false_unreach_call_false_valid_deref_i____off64_t in dll-rb-cnstr_1_false-unreach-call_false-valid-deref.i [2018-04-10 16:51:19,949 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fdll_rb_cnstr___false_unreach_call_false_valid_deref_i____suseconds_t in dll-rb-cnstr_1_false-unreach-call_false-valid-deref.i [2018-04-10 16:51:19,949 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fdll_rb_cnstr___false_unreach_call_false_valid_deref_i____sigset_t in dll-rb-cnstr_1_false-unreach-call_false-valid-deref.i [2018-04-10 16:51:19,949 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fdll_rb_cnstr___false_unreach_call_false_valid_deref_i__pthread_once_t in dll-rb-cnstr_1_false-unreach-call_false-valid-deref.i [2018-04-10 16:51:19,949 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fdll_rb_cnstr___false_unreach_call_false_valid_deref_i__pthread_attr_t in dll-rb-cnstr_1_false-unreach-call_false-valid-deref.i [2018-04-10 16:51:19,949 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fdll_rb_cnstr___false_unreach_call_false_valid_deref_i__pthread_spinlock_t in dll-rb-cnstr_1_false-unreach-call_false-valid-deref.i [2018-04-10 16:51:19,949 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fdll_rb_cnstr___false_unreach_call_false_valid_deref_i____rlim_t in dll-rb-cnstr_1_false-unreach-call_false-valid-deref.i [2018-04-10 16:51:19,949 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fdll_rb_cnstr___false_unreach_call_false_valid_deref_i____clockid_t in dll-rb-cnstr_1_false-unreach-call_false-valid-deref.i [2018-04-10 16:51:19,949 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fdll_rb_cnstr___false_unreach_call_false_valid_deref_i__u_char in dll-rb-cnstr_1_false-unreach-call_false-valid-deref.i [2018-04-10 16:51:19,949 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fdll_rb_cnstr___false_unreach_call_false_valid_deref_i____u_long in dll-rb-cnstr_1_false-unreach-call_false-valid-deref.i [2018-04-10 16:51:19,949 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fdll_rb_cnstr___false_unreach_call_false_valid_deref_i__div_t in dll-rb-cnstr_1_false-unreach-call_false-valid-deref.i [2018-04-10 16:51:19,950 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fdll_rb_cnstr___false_unreach_call_false_valid_deref_i____intptr_t in dll-rb-cnstr_1_false-unreach-call_false-valid-deref.i [2018-04-10 16:51:19,950 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fdll_rb_cnstr___false_unreach_call_false_valid_deref_i__int16_t in dll-rb-cnstr_1_false-unreach-call_false-valid-deref.i [2018-04-10 16:51:19,950 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fdll_rb_cnstr___false_unreach_call_false_valid_deref_i__size_t in dll-rb-cnstr_1_false-unreach-call_false-valid-deref.i [2018-04-10 16:51:19,950 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fdll_rb_cnstr___false_unreach_call_false_valid_deref_i__off_t in dll-rb-cnstr_1_false-unreach-call_false-valid-deref.i [2018-04-10 16:51:19,950 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fdll_rb_cnstr___false_unreach_call_false_valid_deref_i__u_int16_t in dll-rb-cnstr_1_false-unreach-call_false-valid-deref.i [2018-04-10 16:51:19,950 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fdll_rb_cnstr___false_unreach_call_false_valid_deref_i__pthread_cond_t in dll-rb-cnstr_1_false-unreach-call_false-valid-deref.i [2018-04-10 16:51:19,950 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fdll_rb_cnstr___false_unreach_call_false_valid_deref_i__quad_t in dll-rb-cnstr_1_false-unreach-call_false-valid-deref.i [2018-04-10 16:51:19,950 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fdll_rb_cnstr___false_unreach_call_false_valid_deref_i__blkcnt_t in dll-rb-cnstr_1_false-unreach-call_false-valid-deref.i [2018-04-10 16:51:19,964 INFO L330 CDTParser]: Deleted temporary CDT project at /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/data/FLAGeb13720ee [2018-04-10 16:51:19,968 INFO L304 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-04-10 16:51:19,970 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2018-04-10 16:51:19,970 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-04-10 16:51:19,971 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-04-10 16:51:19,975 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-04-10 16:51:19,975 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.04 04:51:19" (1/1) ... [2018-04-10 16:51:19,977 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@4092609c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.04 04:51:19, skipping insertion in model container [2018-04-10 16:51:19,977 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.04 04:51:19" (1/1) ... [2018-04-10 16:51:19,988 INFO L167 Dispatcher]: Using SV-COMP mode [2018-04-10 16:51:20,017 INFO L167 Dispatcher]: Using SV-COMP mode [2018-04-10 16:51:20,156 INFO L175 PostProcessor]: Settings: Checked method=main [2018-04-10 16:51:20,192 INFO L175 PostProcessor]: Settings: Checked method=main [2018-04-10 16:51:20,199 INFO L100 SccComputation]: Graph consists of 0 InCaSumBalls and 115 non ball SCCs. Number of states in SCCs 115. [2018-04-10 16:51:20,237 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.04 04:51:20 WrapperNode [2018-04-10 16:51:20,238 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-04-10 16:51:20,238 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-04-10 16:51:20,238 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-04-10 16:51:20,239 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-04-10 16:51:20,251 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.04 04:51:20" (1/1) ... [2018-04-10 16:51:20,251 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.04 04:51:20" (1/1) ... [2018-04-10 16:51:20,263 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.04 04:51:20" (1/1) ... [2018-04-10 16:51:20,264 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.04 04:51:20" (1/1) ... [2018-04-10 16:51:20,273 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.04 04:51:20" (1/1) ... [2018-04-10 16:51:20,278 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.04 04:51:20" (1/1) ... [2018-04-10 16:51:20,281 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.04 04:51:20" (1/1) ... [2018-04-10 16:51:20,284 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-04-10 16:51:20,285 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-04-10 16:51:20,285 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-04-10 16:51:20,285 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-04-10 16:51:20,286 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.04 04:51:20" (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 16:51:20,370 INFO L136 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-04-10 16:51:20,370 INFO L136 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-04-10 16:51:20,370 INFO L136 BoogieDeclarations]: Found implementation of procedure main [2018-04-10 16:51:20,370 INFO L128 BoogieDeclarations]: Found specification of procedure __ctype_get_mb_cur_max [2018-04-10 16:51:20,371 INFO L128 BoogieDeclarations]: Found specification of procedure atof [2018-04-10 16:51:20,371 INFO L128 BoogieDeclarations]: Found specification of procedure atoi [2018-04-10 16:51:20,371 INFO L128 BoogieDeclarations]: Found specification of procedure atol [2018-04-10 16:51:20,371 INFO L128 BoogieDeclarations]: Found specification of procedure atoll [2018-04-10 16:51:20,371 INFO L128 BoogieDeclarations]: Found specification of procedure strtod [2018-04-10 16:51:20,371 INFO L128 BoogieDeclarations]: Found specification of procedure strtof [2018-04-10 16:51:20,371 INFO L128 BoogieDeclarations]: Found specification of procedure strtold [2018-04-10 16:51:20,371 INFO L128 BoogieDeclarations]: Found specification of procedure strtol [2018-04-10 16:51:20,371 INFO L128 BoogieDeclarations]: Found specification of procedure strtoul [2018-04-10 16:51:20,371 INFO L128 BoogieDeclarations]: Found specification of procedure strtoq [2018-04-10 16:51:20,371 INFO L128 BoogieDeclarations]: Found specification of procedure strtouq [2018-04-10 16:51:20,371 INFO L128 BoogieDeclarations]: Found specification of procedure strtoll [2018-04-10 16:51:20,371 INFO L128 BoogieDeclarations]: Found specification of procedure strtoull [2018-04-10 16:51:20,371 INFO L128 BoogieDeclarations]: Found specification of procedure l64a [2018-04-10 16:51:20,371 INFO L128 BoogieDeclarations]: Found specification of procedure a64l [2018-04-10 16:51:20,371 INFO L128 BoogieDeclarations]: Found specification of procedure select [2018-04-10 16:51:20,371 INFO L128 BoogieDeclarations]: Found specification of procedure pselect [2018-04-10 16:51:20,371 INFO L128 BoogieDeclarations]: Found specification of procedure gnu_dev_major [2018-04-10 16:51:20,372 INFO L128 BoogieDeclarations]: Found specification of procedure gnu_dev_minor [2018-04-10 16:51:20,372 INFO L128 BoogieDeclarations]: Found specification of procedure gnu_dev_makedev [2018-04-10 16:51:20,372 INFO L128 BoogieDeclarations]: Found specification of procedure random [2018-04-10 16:51:20,372 INFO L128 BoogieDeclarations]: Found specification of procedure srandom [2018-04-10 16:51:20,372 INFO L128 BoogieDeclarations]: Found specification of procedure initstate [2018-04-10 16:51:20,372 INFO L128 BoogieDeclarations]: Found specification of procedure setstate [2018-04-10 16:51:20,372 INFO L128 BoogieDeclarations]: Found specification of procedure random_r [2018-04-10 16:51:20,372 INFO L128 BoogieDeclarations]: Found specification of procedure srandom_r [2018-04-10 16:51:20,372 INFO L128 BoogieDeclarations]: Found specification of procedure initstate_r [2018-04-10 16:51:20,372 INFO L128 BoogieDeclarations]: Found specification of procedure setstate_r [2018-04-10 16:51:20,372 INFO L128 BoogieDeclarations]: Found specification of procedure rand [2018-04-10 16:51:20,372 INFO L128 BoogieDeclarations]: Found specification of procedure srand [2018-04-10 16:51:20,372 INFO L128 BoogieDeclarations]: Found specification of procedure rand_r [2018-04-10 16:51:20,372 INFO L128 BoogieDeclarations]: Found specification of procedure drand48 [2018-04-10 16:51:20,372 INFO L128 BoogieDeclarations]: Found specification of procedure erand48 [2018-04-10 16:51:20,372 INFO L128 BoogieDeclarations]: Found specification of procedure lrand48 [2018-04-10 16:51:20,372 INFO L128 BoogieDeclarations]: Found specification of procedure nrand48 [2018-04-10 16:51:20,372 INFO L128 BoogieDeclarations]: Found specification of procedure mrand48 [2018-04-10 16:51:20,373 INFO L128 BoogieDeclarations]: Found specification of procedure jrand48 [2018-04-10 16:51:20,373 INFO L128 BoogieDeclarations]: Found specification of procedure srand48 [2018-04-10 16:51:20,373 INFO L128 BoogieDeclarations]: Found specification of procedure seed48 [2018-04-10 16:51:20,373 INFO L128 BoogieDeclarations]: Found specification of procedure lcong48 [2018-04-10 16:51:20,373 INFO L128 BoogieDeclarations]: Found specification of procedure drand48_r [2018-04-10 16:51:20,373 INFO L128 BoogieDeclarations]: Found specification of procedure erand48_r [2018-04-10 16:51:20,373 INFO L128 BoogieDeclarations]: Found specification of procedure lrand48_r [2018-04-10 16:51:20,373 INFO L128 BoogieDeclarations]: Found specification of procedure nrand48_r [2018-04-10 16:51:20,373 INFO L128 BoogieDeclarations]: Found specification of procedure mrand48_r [2018-04-10 16:51:20,373 INFO L128 BoogieDeclarations]: Found specification of procedure jrand48_r [2018-04-10 16:51:20,373 INFO L128 BoogieDeclarations]: Found specification of procedure srand48_r [2018-04-10 16:51:20,373 INFO L128 BoogieDeclarations]: Found specification of procedure seed48_r [2018-04-10 16:51:20,373 INFO L128 BoogieDeclarations]: Found specification of procedure lcong48_r [2018-04-10 16:51:20,373 INFO L128 BoogieDeclarations]: Found specification of procedure malloc [2018-04-10 16:51:20,373 INFO L128 BoogieDeclarations]: Found specification of procedure calloc [2018-04-10 16:51:20,373 INFO L128 BoogieDeclarations]: Found specification of procedure realloc [2018-04-10 16:51:20,373 INFO L128 BoogieDeclarations]: Found specification of procedure free [2018-04-10 16:51:20,373 INFO L128 BoogieDeclarations]: Found specification of procedure cfree [2018-04-10 16:51:20,374 INFO L128 BoogieDeclarations]: Found specification of procedure alloca [2018-04-10 16:51:20,374 INFO L128 BoogieDeclarations]: Found specification of procedure valloc [2018-04-10 16:51:20,374 INFO L128 BoogieDeclarations]: Found specification of procedure posix_memalign [2018-04-10 16:51:20,374 INFO L128 BoogieDeclarations]: Found specification of procedure aligned_alloc [2018-04-10 16:51:20,374 INFO L128 BoogieDeclarations]: Found specification of procedure abort [2018-04-10 16:51:20,374 INFO L128 BoogieDeclarations]: Found specification of procedure atexit [2018-04-10 16:51:20,374 INFO L128 BoogieDeclarations]: Found specification of procedure at_quick_exit [2018-04-10 16:51:20,374 INFO L128 BoogieDeclarations]: Found specification of procedure on_exit [2018-04-10 16:51:20,374 INFO L128 BoogieDeclarations]: Found specification of procedure exit [2018-04-10 16:51:20,374 INFO L128 BoogieDeclarations]: Found specification of procedure quick_exit [2018-04-10 16:51:20,374 INFO L128 BoogieDeclarations]: Found specification of procedure _Exit [2018-04-10 16:51:20,374 INFO L128 BoogieDeclarations]: Found specification of procedure getenv [2018-04-10 16:51:20,374 INFO L128 BoogieDeclarations]: Found specification of procedure putenv [2018-04-10 16:51:20,374 INFO L128 BoogieDeclarations]: Found specification of procedure setenv [2018-04-10 16:51:20,374 INFO L128 BoogieDeclarations]: Found specification of procedure unsetenv [2018-04-10 16:51:20,374 INFO L128 BoogieDeclarations]: Found specification of procedure clearenv [2018-04-10 16:51:20,374 INFO L128 BoogieDeclarations]: Found specification of procedure mktemp [2018-04-10 16:51:20,374 INFO L128 BoogieDeclarations]: Found specification of procedure mkstemp [2018-04-10 16:51:20,374 INFO L128 BoogieDeclarations]: Found specification of procedure mkstemps [2018-04-10 16:51:20,375 INFO L128 BoogieDeclarations]: Found specification of procedure mkdtemp [2018-04-10 16:51:20,375 INFO L128 BoogieDeclarations]: Found specification of procedure system [2018-04-10 16:51:20,375 INFO L128 BoogieDeclarations]: Found specification of procedure realpath [2018-04-10 16:51:20,375 INFO L128 BoogieDeclarations]: Found specification of procedure bsearch [2018-04-10 16:51:20,375 INFO L128 BoogieDeclarations]: Found specification of procedure qsort [2018-04-10 16:51:20,375 INFO L128 BoogieDeclarations]: Found specification of procedure abs [2018-04-10 16:51:20,375 INFO L128 BoogieDeclarations]: Found specification of procedure labs [2018-04-10 16:51:20,375 INFO L128 BoogieDeclarations]: Found specification of procedure llabs [2018-04-10 16:51:20,375 INFO L128 BoogieDeclarations]: Found specification of procedure div [2018-04-10 16:51:20,375 INFO L128 BoogieDeclarations]: Found specification of procedure ldiv [2018-04-10 16:51:20,375 INFO L128 BoogieDeclarations]: Found specification of procedure lldiv [2018-04-10 16:51:20,375 INFO L128 BoogieDeclarations]: Found specification of procedure ecvt [2018-04-10 16:51:20,375 INFO L128 BoogieDeclarations]: Found specification of procedure fcvt [2018-04-10 16:51:20,375 INFO L128 BoogieDeclarations]: Found specification of procedure gcvt [2018-04-10 16:51:20,375 INFO L128 BoogieDeclarations]: Found specification of procedure qecvt [2018-04-10 16:51:20,375 INFO L128 BoogieDeclarations]: Found specification of procedure qfcvt [2018-04-10 16:51:20,375 INFO L128 BoogieDeclarations]: Found specification of procedure qgcvt [2018-04-10 16:51:20,375 INFO L128 BoogieDeclarations]: Found specification of procedure ecvt_r [2018-04-10 16:51:20,375 INFO L128 BoogieDeclarations]: Found specification of procedure fcvt_r [2018-04-10 16:51:20,376 INFO L128 BoogieDeclarations]: Found specification of procedure qecvt_r [2018-04-10 16:51:20,376 INFO L128 BoogieDeclarations]: Found specification of procedure qfcvt_r [2018-04-10 16:51:20,376 INFO L128 BoogieDeclarations]: Found specification of procedure mblen [2018-04-10 16:51:20,376 INFO L128 BoogieDeclarations]: Found specification of procedure mbtowc [2018-04-10 16:51:20,376 INFO L128 BoogieDeclarations]: Found specification of procedure wctomb [2018-04-10 16:51:20,376 INFO L128 BoogieDeclarations]: Found specification of procedure mbstowcs [2018-04-10 16:51:20,376 INFO L128 BoogieDeclarations]: Found specification of procedure wcstombs [2018-04-10 16:51:20,376 INFO L128 BoogieDeclarations]: Found specification of procedure rpmatch [2018-04-10 16:51:20,376 INFO L128 BoogieDeclarations]: Found specification of procedure getsubopt [2018-04-10 16:51:20,376 INFO L128 BoogieDeclarations]: Found specification of procedure getloadavg [2018-04-10 16:51:20,376 INFO L128 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2018-04-10 16:51:20,376 INFO L128 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2018-04-10 16:51:20,376 INFO L128 BoogieDeclarations]: Found specification of procedure main [2018-04-10 16:51:20,376 INFO L128 BoogieDeclarations]: Found specification of procedure #Ultimate.alloc [2018-04-10 16:51:20,376 INFO L128 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2018-04-10 16:51:20,376 INFO L128 BoogieDeclarations]: Found specification of procedure write~int [2018-04-10 16:51:20,376 INFO L128 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2018-04-10 16:51:20,376 INFO L128 BoogieDeclarations]: Found specification of procedure read~int [2018-04-10 16:51:20,376 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2018-04-10 16:51:20,377 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-04-10 16:51:20,377 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-04-10 16:51:20,377 INFO L128 BoogieDeclarations]: Found specification of procedure write~unchecked~int [2018-04-10 16:51:20,775 INFO L259 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-04-10 16:51:20,775 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.04 04:51:20 BoogieIcfgContainer [2018-04-10 16:51:20,775 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-04-10 16:51:20,776 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-04-10 16:51:20,776 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-04-10 16:51:20,778 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-04-10 16:51:20,778 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 10.04 04:51:19" (1/3) ... [2018-04-10 16:51:20,778 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4a7d2e08 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.04 04:51:20, skipping insertion in model container [2018-04-10 16:51:20,779 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.04 04:51:20" (2/3) ... [2018-04-10 16:51:20,779 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4a7d2e08 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.04 04:51:20, skipping insertion in model container [2018-04-10 16:51:20,779 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.04 04:51:20" (3/3) ... [2018-04-10 16:51:20,780 INFO L107 eAbstractionObserver]: Analyzing ICFG dll-rb-cnstr_1_false-unreach-call_false-valid-deref.i [2018-04-10 16:51:20,786 INFO L131 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-04-10 16:51:20,792 INFO L143 ceAbstractionStarter]: Appying trace abstraction to program that has 59 error locations. [2018-04-10 16:51:20,816 INFO L128 ementStrategyFactory]: Using default assertion order modulation [2018-04-10 16:51:20,816 INFO L369 AbstractCegarLoop]: Interprodecural is true [2018-04-10 16:51:20,816 INFO L370 AbstractCegarLoop]: Hoare is false [2018-04-10 16:51:20,816 INFO L371 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-04-10 16:51:20,816 INFO L372 AbstractCegarLoop]: Backedges is TWOTRACK [2018-04-10 16:51:20,816 INFO L373 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-04-10 16:51:20,816 INFO L374 AbstractCegarLoop]: Difference is false [2018-04-10 16:51:20,817 INFO L375 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-04-10 16:51:20,817 INFO L380 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-04-10 16:51:20,817 INFO L87 2NestedWordAutomaton]: Mode: main mode - execution starts in main procedure [2018-04-10 16:51:20,828 INFO L276 IsEmpty]: Start isEmpty. Operand 141 states. [2018-04-10 16:51:20,834 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2018-04-10 16:51:20,834 INFO L347 BasicCegarLoop]: Found error trace [2018-04-10 16:51:20,835 INFO L355 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2018-04-10 16:51:20,835 INFO L408 AbstractCegarLoop]: === Iteration 1 === [mainErr51RequiresViolation, mainErr26RequiresViolation, mainErr54RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr31RequiresViolation, mainErr46RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr52AssertViolationMEMORY_FREE, mainErr15RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr55RequiresViolation, mainErr17RequiresViolation, mainErr42RequiresViolation, mainErr49AssertViolationMEMORY_FREE, mainErr30RequiresViolation, mainErr56AssertViolationMEMORY_FREE, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr44RequiresViolation, mainErr10RequiresViolation, mainErr43RequiresViolation, mainErr4RequiresViolation, mainErr50RequiresViolation, mainErr58EnsuresViolationMEMORY_LEAK, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr48AssertViolationMEMORY_FREE, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr45RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr57AssertViolationMEMORY_FREE, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr9RequiresViolation, mainErr53AssertViolationMEMORY_FREE, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr34RequiresViolation, mainErr47RequiresViolation, mainErr14RequiresViolation, mainErr40RequiresViolation]=== [2018-04-10 16:51:20,838 INFO L82 PathProgramCache]: Analyzing trace with hash -1080483552, now seen corresponding path program 1 times [2018-04-10 16:51:20,839 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-04-10 16:51:20,840 INFO L68 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-04-10 16:51:20,874 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-10 16:51:20,874 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-10 16:51:20,874 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-10 16:51:20,895 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-10 16:51:20,901 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-10 16:51:20,943 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 16:51:20,945 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-04-10 16:51:20,945 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-04-10 16:51:20,947 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-04-10 16:51:20,955 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-04-10 16:51:20,956 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-04-10 16:51:20,958 INFO L87 Difference]: Start difference. First operand 141 states. Second operand 4 states. [2018-04-10 16:51:21,165 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-10 16:51:21,165 INFO L93 Difference]: Finished difference Result 157 states and 164 transitions. [2018-04-10 16:51:21,166 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-04-10 16:51:21,167 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 8 [2018-04-10 16:51:21,167 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-10 16:51:21,175 INFO L225 Difference]: With dead ends: 157 [2018-04-10 16:51:21,175 INFO L226 Difference]: Without dead ends: 153 [2018-04-10 16:51:21,177 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 16:51:21,188 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 153 states. [2018-04-10 16:51:21,202 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 153 to 134. [2018-04-10 16:51:21,203 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 134 states. [2018-04-10 16:51:21,205 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 134 states to 134 states and 141 transitions. [2018-04-10 16:51:21,206 INFO L78 Accepts]: Start accepts. Automaton has 134 states and 141 transitions. Word has length 8 [2018-04-10 16:51:21,206 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-10 16:51:21,206 INFO L459 AbstractCegarLoop]: Abstraction has 134 states and 141 transitions. [2018-04-10 16:51:21,206 INFO L460 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-04-10 16:51:21,207 INFO L276 IsEmpty]: Start isEmpty. Operand 134 states and 141 transitions. [2018-04-10 16:51:21,207 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2018-04-10 16:51:21,207 INFO L347 BasicCegarLoop]: Found error trace [2018-04-10 16:51:21,207 INFO L355 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2018-04-10 16:51:21,207 INFO L408 AbstractCegarLoop]: === Iteration 2 === [mainErr51RequiresViolation, mainErr26RequiresViolation, mainErr54RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr31RequiresViolation, mainErr46RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr52AssertViolationMEMORY_FREE, mainErr15RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr55RequiresViolation, mainErr17RequiresViolation, mainErr42RequiresViolation, mainErr49AssertViolationMEMORY_FREE, mainErr30RequiresViolation, mainErr56AssertViolationMEMORY_FREE, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr44RequiresViolation, mainErr10RequiresViolation, mainErr43RequiresViolation, mainErr4RequiresViolation, mainErr50RequiresViolation, mainErr58EnsuresViolationMEMORY_LEAK, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr48AssertViolationMEMORY_FREE, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr45RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr57AssertViolationMEMORY_FREE, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr9RequiresViolation, mainErr53AssertViolationMEMORY_FREE, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr34RequiresViolation, mainErr47RequiresViolation, mainErr14RequiresViolation, mainErr40RequiresViolation]=== [2018-04-10 16:51:21,207 INFO L82 PathProgramCache]: Analyzing trace with hash -1080483551, now seen corresponding path program 1 times [2018-04-10 16:51:21,207 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-04-10 16:51:21,207 INFO L68 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-04-10 16:51:21,209 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-10 16:51:21,209 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-10 16:51:21,209 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-10 16:51:21,220 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-10 16:51:21,221 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-10 16:51:21,258 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-10 16:51:21,258 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-04-10 16:51:21,258 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-04-10 16:51:21,259 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-04-10 16:51:21,259 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-04-10 16:51:21,260 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-04-10 16:51:21,260 INFO L87 Difference]: Start difference. First operand 134 states and 141 transitions. Second operand 4 states. [2018-04-10 16:51:21,365 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-10 16:51:21,365 INFO L93 Difference]: Finished difference Result 150 states and 156 transitions. [2018-04-10 16:51:21,365 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-04-10 16:51:21,365 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 8 [2018-04-10 16:51:21,365 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-10 16:51:21,367 INFO L225 Difference]: With dead ends: 150 [2018-04-10 16:51:21,367 INFO L226 Difference]: Without dead ends: 150 [2018-04-10 16:51:21,367 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 16:51:21,368 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 150 states. [2018-04-10 16:51:21,371 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 150 to 138. [2018-04-10 16:51:21,371 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 138 states. [2018-04-10 16:51:21,373 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 138 states to 138 states and 145 transitions. [2018-04-10 16:51:21,373 INFO L78 Accepts]: Start accepts. Automaton has 138 states and 145 transitions. Word has length 8 [2018-04-10 16:51:21,373 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-10 16:51:21,373 INFO L459 AbstractCegarLoop]: Abstraction has 138 states and 145 transitions. [2018-04-10 16:51:21,373 INFO L460 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-04-10 16:51:21,373 INFO L276 IsEmpty]: Start isEmpty. Operand 138 states and 145 transitions. [2018-04-10 16:51:21,374 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2018-04-10 16:51:21,374 INFO L347 BasicCegarLoop]: Found error trace [2018-04-10 16:51:21,374 INFO L355 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-10 16:51:21,374 INFO L408 AbstractCegarLoop]: === Iteration 3 === [mainErr51RequiresViolation, mainErr26RequiresViolation, mainErr54RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr31RequiresViolation, mainErr46RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr52AssertViolationMEMORY_FREE, mainErr15RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr55RequiresViolation, mainErr17RequiresViolation, mainErr42RequiresViolation, mainErr49AssertViolationMEMORY_FREE, mainErr30RequiresViolation, mainErr56AssertViolationMEMORY_FREE, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr44RequiresViolation, mainErr10RequiresViolation, mainErr43RequiresViolation, mainErr4RequiresViolation, mainErr50RequiresViolation, mainErr58EnsuresViolationMEMORY_LEAK, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr48AssertViolationMEMORY_FREE, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr45RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr57AssertViolationMEMORY_FREE, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr9RequiresViolation, mainErr53AssertViolationMEMORY_FREE, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr34RequiresViolation, mainErr47RequiresViolation, mainErr14RequiresViolation, mainErr40RequiresViolation]=== [2018-04-10 16:51:21,374 INFO L82 PathProgramCache]: Analyzing trace with hash -595612499, now seen corresponding path program 1 times [2018-04-10 16:51:21,374 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-04-10 16:51:21,374 INFO L68 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-04-10 16:51:21,375 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-10 16:51:21,375 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-10 16:51:21,375 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-10 16:51:21,396 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-10 16:51:21,398 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-10 16:51:21,404 INFO L431 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown lemma type! [2018-04-10 16:51:21,404 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-04-10 16:51:21,404 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-04-10 16:51:21,406 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-10 16:51:21,428 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-10 16:51:21,433 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-10 16:51:21,456 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select 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 16:51:21,457 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-10 16:51:21,458 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-10 16:51:21,458 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:6, output treesize:5 [2018-04-10 16:51:21,472 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 16:51:21,472 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 16:51:21,473 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 16:51:21,474 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-10 16:51:21,477 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 16:51:21,478 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:17, output treesize:15 [2018-04-10 16:51:21,487 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 16:51:21,488 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-04-10 16:51:21,488 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-04-10 16:51:21,488 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-04-10 16:51:21,488 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-04-10 16:51:21,488 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2018-04-10 16:51:21,488 INFO L87 Difference]: Start difference. First operand 138 states and 145 transitions. Second operand 6 states. [2018-04-10 16:51:21,710 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-10 16:51:21,710 INFO L93 Difference]: Finished difference Result 150 states and 158 transitions. [2018-04-10 16:51:21,711 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-04-10 16:51:21,711 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 16 [2018-04-10 16:51:21,711 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-10 16:51:21,712 INFO L225 Difference]: With dead ends: 150 [2018-04-10 16:51:21,712 INFO L226 Difference]: Without dead ends: 150 [2018-04-10 16:51:21,712 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 11 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=28, Invalid=44, Unknown=0, NotChecked=0, Total=72 [2018-04-10 16:51:21,712 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 150 states. [2018-04-10 16:51:21,716 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 150 to 130. [2018-04-10 16:51:21,716 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 130 states. [2018-04-10 16:51:21,717 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 130 states to 130 states and 140 transitions. [2018-04-10 16:51:21,717 INFO L78 Accepts]: Start accepts. Automaton has 130 states and 140 transitions. Word has length 16 [2018-04-10 16:51:21,717 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-10 16:51:21,717 INFO L459 AbstractCegarLoop]: Abstraction has 130 states and 140 transitions. [2018-04-10 16:51:21,717 INFO L460 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-04-10 16:51:21,717 INFO L276 IsEmpty]: Start isEmpty. Operand 130 states and 140 transitions. [2018-04-10 16:51:21,718 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2018-04-10 16:51:21,718 INFO L347 BasicCegarLoop]: Found error trace [2018-04-10 16:51:21,718 INFO L355 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-10 16:51:21,718 INFO L408 AbstractCegarLoop]: === Iteration 4 === [mainErr51RequiresViolation, mainErr26RequiresViolation, mainErr54RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr31RequiresViolation, mainErr46RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr52AssertViolationMEMORY_FREE, mainErr15RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr55RequiresViolation, mainErr17RequiresViolation, mainErr42RequiresViolation, mainErr49AssertViolationMEMORY_FREE, mainErr30RequiresViolation, mainErr56AssertViolationMEMORY_FREE, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr44RequiresViolation, mainErr10RequiresViolation, mainErr43RequiresViolation, mainErr4RequiresViolation, mainErr50RequiresViolation, mainErr58EnsuresViolationMEMORY_LEAK, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr48AssertViolationMEMORY_FREE, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr45RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr57AssertViolationMEMORY_FREE, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr9RequiresViolation, mainErr53AssertViolationMEMORY_FREE, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr34RequiresViolation, mainErr47RequiresViolation, mainErr14RequiresViolation, mainErr40RequiresViolation]=== [2018-04-10 16:51:21,718 INFO L82 PathProgramCache]: Analyzing trace with hash -595612498, now seen corresponding path program 1 times [2018-04-10 16:51:21,718 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-04-10 16:51:21,718 INFO L68 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-04-10 16:51:21,719 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-10 16:51:21,719 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-10 16:51:21,719 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-10 16:51:21,729 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-10 16:51:21,730 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-10 16:51:21,732 INFO L431 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown lemma type! [2018-04-10 16:51:21,732 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-04-10 16:51:21,732 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-04-10 16:51:21,733 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-10 16:51:21,754 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-10 16:51:21,757 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-10 16:51:21,764 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select 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 16:51:21,764 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-10 16:51:21,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 6 treesize of output 5 [2018-04-10 16:51:21,771 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-10 16:51:21,777 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-10 16:51:21,777 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:16, output treesize:14 [2018-04-10 16:51:21,808 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 16:51:21,809 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 16:51:21,810 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 16:51:21,810 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-10 16:51:21,815 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 15 [2018-04-10 16:51:21,816 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-10 16:51:21,821 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 16:51:21,821 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:28, output treesize:21 [2018-04-10 16:51:21,830 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 16:51:21,831 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-04-10 16:51:21,831 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-04-10 16:51:21,831 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-04-10 16:51:21,831 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-04-10 16:51:21,831 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2018-04-10 16:51:21,831 INFO L87 Difference]: Start difference. First operand 130 states and 140 transitions. Second operand 7 states. [2018-04-10 16:51:22,141 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-10 16:51:22,142 INFO L93 Difference]: Finished difference Result 169 states and 180 transitions. [2018-04-10 16:51:22,142 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-04-10 16:51:22,142 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 16 [2018-04-10 16:51:22,142 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-10 16:51:22,143 INFO L225 Difference]: With dead ends: 169 [2018-04-10 16:51:22,143 INFO L226 Difference]: Without dead ends: 169 [2018-04-10 16:51:22,144 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 10 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=40, Invalid=70, Unknown=0, NotChecked=0, Total=110 [2018-04-10 16:51:22,144 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 169 states. [2018-04-10 16:51:22,149 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 169 to 145. [2018-04-10 16:51:22,149 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 145 states. [2018-04-10 16:51:22,150 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 145 states to 145 states and 158 transitions. [2018-04-10 16:51:22,150 INFO L78 Accepts]: Start accepts. Automaton has 145 states and 158 transitions. Word has length 16 [2018-04-10 16:51:22,151 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-10 16:51:22,151 INFO L459 AbstractCegarLoop]: Abstraction has 145 states and 158 transitions. [2018-04-10 16:51:22,151 INFO L460 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-04-10 16:51:22,151 INFO L276 IsEmpty]: Start isEmpty. Operand 145 states and 158 transitions. [2018-04-10 16:51:22,151 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2018-04-10 16:51:22,151 INFO L347 BasicCegarLoop]: Found error trace [2018-04-10 16:51:22,152 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 16:51:22,154 INFO L408 AbstractCegarLoop]: === Iteration 5 === [mainErr51RequiresViolation, mainErr26RequiresViolation, mainErr54RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr31RequiresViolation, mainErr46RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr52AssertViolationMEMORY_FREE, mainErr15RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr55RequiresViolation, mainErr17RequiresViolation, mainErr42RequiresViolation, mainErr49AssertViolationMEMORY_FREE, mainErr30RequiresViolation, mainErr56AssertViolationMEMORY_FREE, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr44RequiresViolation, mainErr10RequiresViolation, mainErr43RequiresViolation, mainErr4RequiresViolation, mainErr50RequiresViolation, mainErr58EnsuresViolationMEMORY_LEAK, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr48AssertViolationMEMORY_FREE, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr45RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr57AssertViolationMEMORY_FREE, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr9RequiresViolation, mainErr53AssertViolationMEMORY_FREE, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr34RequiresViolation, mainErr47RequiresViolation, mainErr14RequiresViolation, mainErr40RequiresViolation]=== [2018-04-10 16:51:22,154 INFO L82 PathProgramCache]: Analyzing trace with hash -1152961200, now seen corresponding path program 1 times [2018-04-10 16:51:22,154 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-04-10 16:51:22,154 INFO L68 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-04-10 16:51:22,156 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-10 16:51:22,156 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-10 16:51:22,156 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-10 16:51:22,167 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-10 16:51:22,169 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-10 16:51:22,196 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 16:51:22,196 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-04-10 16:51:22,196 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-04-10 16:51:22,197 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-04-10 16:51:22,197 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-04-10 16:51:22,197 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-04-10 16:51:22,197 INFO L87 Difference]: Start difference. First operand 145 states and 158 transitions. Second operand 5 states. [2018-04-10 16:51:22,330 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-10 16:51:22,330 INFO L93 Difference]: Finished difference Result 203 states and 221 transitions. [2018-04-10 16:51:22,330 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-04-10 16:51:22,330 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 18 [2018-04-10 16:51:22,331 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-10 16:51:22,331 INFO L225 Difference]: With dead ends: 203 [2018-04-10 16:51:22,331 INFO L226 Difference]: Without dead ends: 203 [2018-04-10 16:51:22,331 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2018-04-10 16:51:22,332 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 203 states. [2018-04-10 16:51:22,334 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 203 to 144. [2018-04-10 16:51:22,335 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 144 states. [2018-04-10 16:51:22,339 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 144 states to 144 states and 156 transitions. [2018-04-10 16:51:22,339 INFO L78 Accepts]: Start accepts. Automaton has 144 states and 156 transitions. Word has length 18 [2018-04-10 16:51:22,339 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-10 16:51:22,339 INFO L459 AbstractCegarLoop]: Abstraction has 144 states and 156 transitions. [2018-04-10 16:51:22,339 INFO L460 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-04-10 16:51:22,339 INFO L276 IsEmpty]: Start isEmpty. Operand 144 states and 156 transitions. [2018-04-10 16:51:22,340 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2018-04-10 16:51:22,340 INFO L347 BasicCegarLoop]: Found error trace [2018-04-10 16:51:22,340 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 16:51:22,340 INFO L408 AbstractCegarLoop]: === Iteration 6 === [mainErr51RequiresViolation, mainErr26RequiresViolation, mainErr54RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr31RequiresViolation, mainErr46RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr52AssertViolationMEMORY_FREE, mainErr15RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr55RequiresViolation, mainErr17RequiresViolation, mainErr42RequiresViolation, mainErr49AssertViolationMEMORY_FREE, mainErr30RequiresViolation, mainErr56AssertViolationMEMORY_FREE, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr44RequiresViolation, mainErr10RequiresViolation, mainErr43RequiresViolation, mainErr4RequiresViolation, mainErr50RequiresViolation, mainErr58EnsuresViolationMEMORY_LEAK, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr48AssertViolationMEMORY_FREE, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr45RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr57AssertViolationMEMORY_FREE, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr9RequiresViolation, mainErr53AssertViolationMEMORY_FREE, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr34RequiresViolation, mainErr47RequiresViolation, mainErr14RequiresViolation, mainErr40RequiresViolation]=== [2018-04-10 16:51:22,340 INFO L82 PathProgramCache]: Analyzing trace with hash -1152961199, now seen corresponding path program 1 times [2018-04-10 16:51:22,340 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-04-10 16:51:22,341 INFO L68 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-04-10 16:51:22,342 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-10 16:51:22,342 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-10 16:51:22,342 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-10 16:51:22,352 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-10 16:51:22,353 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-10 16:51:22,395 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 16:51:22,396 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-04-10 16:51:22,396 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-04-10 16:51:22,396 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-04-10 16:51:22,396 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-04-10 16:51:22,396 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-04-10 16:51:22,397 INFO L87 Difference]: Start difference. First operand 144 states and 156 transitions. Second operand 5 states. [2018-04-10 16:51:22,540 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-10 16:51:22,540 INFO L93 Difference]: Finished difference Result 227 states and 246 transitions. [2018-04-10 16:51:22,541 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-04-10 16:51:22,541 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 18 [2018-04-10 16:51:22,541 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-10 16:51:22,541 INFO L225 Difference]: With dead ends: 227 [2018-04-10 16:51:22,541 INFO L226 Difference]: Without dead ends: 227 [2018-04-10 16:51:22,542 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2018-04-10 16:51:22,542 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 227 states. [2018-04-10 16:51:22,544 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 227 to 143. [2018-04-10 16:51:22,544 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 143 states. [2018-04-10 16:51:22,545 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 143 states to 143 states and 154 transitions. [2018-04-10 16:51:22,545 INFO L78 Accepts]: Start accepts. Automaton has 143 states and 154 transitions. Word has length 18 [2018-04-10 16:51:22,545 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-10 16:51:22,545 INFO L459 AbstractCegarLoop]: Abstraction has 143 states and 154 transitions. [2018-04-10 16:51:22,545 INFO L460 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-04-10 16:51:22,545 INFO L276 IsEmpty]: Start isEmpty. Operand 143 states and 154 transitions. [2018-04-10 16:51:22,546 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2018-04-10 16:51:22,546 INFO L347 BasicCegarLoop]: Found error trace [2018-04-10 16:51:22,546 INFO L355 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-10 16:51:22,546 INFO L408 AbstractCegarLoop]: === Iteration 7 === [mainErr51RequiresViolation, mainErr26RequiresViolation, mainErr54RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr31RequiresViolation, mainErr46RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr52AssertViolationMEMORY_FREE, mainErr15RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr55RequiresViolation, mainErr17RequiresViolation, mainErr42RequiresViolation, mainErr49AssertViolationMEMORY_FREE, mainErr30RequiresViolation, mainErr56AssertViolationMEMORY_FREE, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr44RequiresViolation, mainErr10RequiresViolation, mainErr43RequiresViolation, mainErr4RequiresViolation, mainErr50RequiresViolation, mainErr58EnsuresViolationMEMORY_LEAK, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr48AssertViolationMEMORY_FREE, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr45RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr57AssertViolationMEMORY_FREE, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr9RequiresViolation, mainErr53AssertViolationMEMORY_FREE, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr34RequiresViolation, mainErr47RequiresViolation, mainErr14RequiresViolation, mainErr40RequiresViolation]=== [2018-04-10 16:51:22,546 INFO L82 PathProgramCache]: Analyzing trace with hash -1358009646, now seen corresponding path program 1 times [2018-04-10 16:51:22,546 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-04-10 16:51:22,546 INFO L68 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-04-10 16:51:22,547 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-10 16:51:22,547 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-10 16:51:22,547 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-10 16:51:22,554 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-10 16:51:22,555 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-10 16:51:22,558 INFO L431 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown lemma type! [2018-04-10 16:51:22,558 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-04-10 16:51:22,558 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-04-10 16:51:22,559 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-10 16:51:22,589 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-10 16:51:22,592 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-10 16:51:22,605 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select 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 16:51:22,606 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-10 16:51:22,608 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-10 16:51:22,609 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:13, output treesize:12 [2018-04-10 16:51:22,618 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 16:51:22,619 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select 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 16:51:22,620 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-10 16:51:22,621 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-10 16:51:22,628 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 16:51:22,630 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select 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 16:51:22,630 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-04-10 16:51:22,636 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-10 16:51:22,642 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 16:51:22,642 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 4 variables, input treesize:34, output treesize:20 [2018-04-10 16:51:22,651 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 16:51:22,652 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable 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 16:51:22,653 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-10 16:51:22,654 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-10 16:51:22,657 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-04-10 16:51:22,657 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:27, output treesize:16 [2018-04-10 16:51:22,677 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 23 treesize of output 35 [2018-04-10 16:51:22,680 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 23 [2018-04-10 16:51:22,680 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-10 16:51:22,691 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-10 16:51:22,695 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 16:51:22,696 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:29, output treesize:25 [2018-04-10 16:51:22,713 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 29 treesize of output 28 [2018-04-10 16:51:22,716 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 14 [2018-04-10 16:51:22,716 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-10 16:51:22,722 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 14 treesize of output 10 [2018-04-10 16:51:22,722 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-04-10 16:51:22,725 INFO L267 ElimStorePlain]: Start of recursive call 2: 3 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-10 16:51:22,728 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 16:51:22,728 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 4 variables, input treesize:35, output treesize:5 [2018-04-10 16:51:22,739 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 16:51:22,739 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-04-10 16:51:22,739 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2018-04-10 16:51:22,739 INFO L442 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-04-10 16:51:22,739 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-04-10 16:51:22,739 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=87, Unknown=0, NotChecked=0, Total=110 [2018-04-10 16:51:22,740 INFO L87 Difference]: Start difference. First operand 143 states and 154 transitions. Second operand 11 states. [2018-04-10 16:51:23,130 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-10 16:51:23,130 INFO L93 Difference]: Finished difference Result 176 states and 188 transitions. [2018-04-10 16:51:23,130 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2018-04-10 16:51:23,131 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 22 [2018-04-10 16:51:23,131 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-10 16:51:23,131 INFO L225 Difference]: With dead ends: 176 [2018-04-10 16:51:23,131 INFO L226 Difference]: Without dead ends: 176 [2018-04-10 16:51:23,132 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 34 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 92 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=170, Invalid=382, Unknown=0, NotChecked=0, Total=552 [2018-04-10 16:51:23,132 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 176 states. [2018-04-10 16:51:23,134 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 176 to 145. [2018-04-10 16:51:23,134 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 145 states. [2018-04-10 16:51:23,135 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 145 states to 145 states and 157 transitions. [2018-04-10 16:51:23,135 INFO L78 Accepts]: Start accepts. Automaton has 145 states and 157 transitions. Word has length 22 [2018-04-10 16:51:23,135 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-10 16:51:23,135 INFO L459 AbstractCegarLoop]: Abstraction has 145 states and 157 transitions. [2018-04-10 16:51:23,136 INFO L460 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-04-10 16:51:23,136 INFO L276 IsEmpty]: Start isEmpty. Operand 145 states and 157 transitions. [2018-04-10 16:51:23,136 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2018-04-10 16:51:23,136 INFO L347 BasicCegarLoop]: Found error trace [2018-04-10 16:51:23,136 INFO L355 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-10 16:51:23,136 INFO L408 AbstractCegarLoop]: === Iteration 8 === [mainErr51RequiresViolation, mainErr26RequiresViolation, mainErr54RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr31RequiresViolation, mainErr46RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr52AssertViolationMEMORY_FREE, mainErr15RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr55RequiresViolation, mainErr17RequiresViolation, mainErr42RequiresViolation, mainErr49AssertViolationMEMORY_FREE, mainErr30RequiresViolation, mainErr56AssertViolationMEMORY_FREE, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr44RequiresViolation, mainErr10RequiresViolation, mainErr43RequiresViolation, mainErr4RequiresViolation, mainErr50RequiresViolation, mainErr58EnsuresViolationMEMORY_LEAK, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr48AssertViolationMEMORY_FREE, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr45RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr57AssertViolationMEMORY_FREE, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr9RequiresViolation, mainErr53AssertViolationMEMORY_FREE, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr34RequiresViolation, mainErr47RequiresViolation, mainErr14RequiresViolation, mainErr40RequiresViolation]=== [2018-04-10 16:51:23,137 INFO L82 PathProgramCache]: Analyzing trace with hash -1358009645, now seen corresponding path program 1 times [2018-04-10 16:51:23,137 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-04-10 16:51:23,137 INFO L68 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-04-10 16:51:23,138 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-10 16:51:23,138 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-10 16:51:23,138 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-10 16:51:23,147 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-10 16:51:23,148 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-10 16:51:23,153 INFO L431 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown lemma type! [2018-04-10 16:51:23,153 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-04-10 16:51:23,153 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-04-10 16:51:23,154 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-10 16:51:23,181 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-10 16:51:23,184 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-10 16:51:23,207 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select 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 16:51:23,207 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-10 16:51:23,208 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-10 16:51:23,209 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:6, output treesize:5 [2018-04-10 16:51:23,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 6 treesize of output 5 [2018-04-10 16:51:23,218 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-10 16:51:23,224 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 16:51:23,224 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 16:51:23,225 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 16:51:23,225 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-10 16:51:23,228 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-10 16:51:23,228 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:20, output treesize:13 [2018-04-10 16:51:23,238 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 16:51:23,239 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 16:51:23,239 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-10 16:51:23,240 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-10 16:51:23,246 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 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 16:51:23,247 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select 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 16:51:23,247 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-04-10 16:51:23,248 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-10 16:51:23,252 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 16:51:23,252 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 3 variables, input treesize:32, output treesize:25 [2018-04-10 16:51:23,271 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 60 treesize of output 56 [2018-04-10 16:51:23,273 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 13 [2018-04-10 16:51:23,273 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-10 16:51:23,278 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-10 16:51:23,290 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 30 [2018-04-10 16:51:23,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 14 treesize of output 13 [2018-04-10 16:51:23,293 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-04-10 16:51:23,296 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-10 16:51:23,300 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 16:51:23,301 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 3 variables, input treesize:67, output treesize:51 [2018-04-10 16:51:23,317 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 51 treesize of output 37 [2018-04-10 16:51:23,319 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select 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 16:51:23,319 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-10 16:51:23,326 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 19 [2018-04-10 16:51:23,326 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-04-10 16:51:23,331 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-10 16:51:23,338 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 22 [2018-04-10 16:51:23,340 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select 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 16:51:23,340 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2018-04-10 16:51:23,344 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 1 [2018-04-10 16:51:23,345 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2018-04-10 16:51:23,346 INFO L267 ElimStorePlain]: Start of recursive call 5: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-10 16:51:23,348 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 16:51:23,348 INFO L202 ElimStorePlain]: Needed 7 recursive calls to eliminate 5 variables, input treesize:65, output treesize:9 [2018-04-10 16:51:23,368 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 16:51:23,369 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-04-10 16:51:23,369 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2018-04-10 16:51:23,369 INFO L442 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-04-10 16:51:23,369 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-04-10 16:51:23,369 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=89, Unknown=0, NotChecked=0, Total=110 [2018-04-10 16:51:23,369 INFO L87 Difference]: Start difference. First operand 145 states and 157 transitions. Second operand 11 states. [2018-04-10 16:51:23,964 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-10 16:51:23,965 INFO L93 Difference]: Finished difference Result 169 states and 180 transitions. [2018-04-10 16:51:23,965 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2018-04-10 16:51:23,965 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 22 [2018-04-10 16:51:23,965 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-10 16:51:23,966 INFO L225 Difference]: With dead ends: 169 [2018-04-10 16:51:23,966 INFO L226 Difference]: Without dead ends: 169 [2018-04-10 16:51:23,966 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 37 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 56 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=224, Invalid=478, Unknown=0, NotChecked=0, Total=702 [2018-04-10 16:51:23,966 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 169 states. [2018-04-10 16:51:23,969 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 169 to 148. [2018-04-10 16:51:23,969 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 148 states. [2018-04-10 16:51:23,969 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 148 states to 148 states and 160 transitions. [2018-04-10 16:51:23,970 INFO L78 Accepts]: Start accepts. Automaton has 148 states and 160 transitions. Word has length 22 [2018-04-10 16:51:23,970 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-10 16:51:23,970 INFO L459 AbstractCegarLoop]: Abstraction has 148 states and 160 transitions. [2018-04-10 16:51:23,970 INFO L460 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-04-10 16:51:23,970 INFO L276 IsEmpty]: Start isEmpty. Operand 148 states and 160 transitions. [2018-04-10 16:51:23,970 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2018-04-10 16:51:23,971 INFO L347 BasicCegarLoop]: Found error trace [2018-04-10 16:51:23,971 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] [2018-04-10 16:51:23,971 INFO L408 AbstractCegarLoop]: === Iteration 9 === [mainErr51RequiresViolation, mainErr26RequiresViolation, mainErr54RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr31RequiresViolation, mainErr46RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr52AssertViolationMEMORY_FREE, mainErr15RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr55RequiresViolation, mainErr17RequiresViolation, mainErr42RequiresViolation, mainErr49AssertViolationMEMORY_FREE, mainErr30RequiresViolation, mainErr56AssertViolationMEMORY_FREE, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr44RequiresViolation, mainErr10RequiresViolation, mainErr43RequiresViolation, mainErr4RequiresViolation, mainErr50RequiresViolation, mainErr58EnsuresViolationMEMORY_LEAK, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr48AssertViolationMEMORY_FREE, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr45RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr57AssertViolationMEMORY_FREE, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr9RequiresViolation, mainErr53AssertViolationMEMORY_FREE, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr34RequiresViolation, mainErr47RequiresViolation, mainErr14RequiresViolation, mainErr40RequiresViolation]=== [2018-04-10 16:51:23,971 INFO L82 PathProgramCache]: Analyzing trace with hash -582468992, now seen corresponding path program 1 times [2018-04-10 16:51:23,971 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-04-10 16:51:23,971 INFO L68 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-04-10 16:51:23,972 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-10 16:51:23,973 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-10 16:51:23,973 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-10 16:51:23,978 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-10 16:51:23,979 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-10 16:51:24,003 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 16:51:24,004 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-04-10 16:51:24,004 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-04-10 16:51:24,004 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-04-10 16:51:24,004 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-04-10 16:51:24,004 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-04-10 16:51:24,004 INFO L87 Difference]: Start difference. First operand 148 states and 160 transitions. Second operand 5 states. [2018-04-10 16:51:24,112 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-10 16:51:24,112 INFO L93 Difference]: Finished difference Result 160 states and 170 transitions. [2018-04-10 16:51:24,113 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-04-10 16:51:24,113 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 28 [2018-04-10 16:51:24,113 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-10 16:51:24,114 INFO L225 Difference]: With dead ends: 160 [2018-04-10 16:51:24,114 INFO L226 Difference]: Without dead ends: 160 [2018-04-10 16:51:24,114 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 1 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 16:51:24,114 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 160 states. [2018-04-10 16:51:24,116 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 160 to 148. [2018-04-10 16:51:24,117 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 148 states. [2018-04-10 16:51:24,117 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 148 states to 148 states and 158 transitions. [2018-04-10 16:51:24,117 INFO L78 Accepts]: Start accepts. Automaton has 148 states and 158 transitions. Word has length 28 [2018-04-10 16:51:24,118 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-10 16:51:24,118 INFO L459 AbstractCegarLoop]: Abstraction has 148 states and 158 transitions. [2018-04-10 16:51:24,118 INFO L460 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-04-10 16:51:24,118 INFO L276 IsEmpty]: Start isEmpty. Operand 148 states and 158 transitions. [2018-04-10 16:51:24,119 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2018-04-10 16:51:24,119 INFO L347 BasicCegarLoop]: Found error trace [2018-04-10 16:51:24,119 INFO L355 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-10 16:51:24,119 INFO L408 AbstractCegarLoop]: === Iteration 10 === [mainErr51RequiresViolation, mainErr26RequiresViolation, mainErr54RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr31RequiresViolation, mainErr46RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr52AssertViolationMEMORY_FREE, mainErr15RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr55RequiresViolation, mainErr17RequiresViolation, mainErr42RequiresViolation, mainErr49AssertViolationMEMORY_FREE, mainErr30RequiresViolation, mainErr56AssertViolationMEMORY_FREE, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr44RequiresViolation, mainErr10RequiresViolation, mainErr43RequiresViolation, mainErr4RequiresViolation, mainErr50RequiresViolation, mainErr58EnsuresViolationMEMORY_LEAK, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr48AssertViolationMEMORY_FREE, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr45RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr57AssertViolationMEMORY_FREE, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr9RequiresViolation, mainErr53AssertViolationMEMORY_FREE, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr34RequiresViolation, mainErr47RequiresViolation, mainErr14RequiresViolation, mainErr40RequiresViolation]=== [2018-04-10 16:51:24,119 INFO L82 PathProgramCache]: Analyzing trace with hash -863319961, now seen corresponding path program 1 times [2018-04-10 16:51:24,119 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-04-10 16:51:24,119 INFO L68 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-04-10 16:51:24,120 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-10 16:51:24,121 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-10 16:51:24,121 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-10 16:51:24,126 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-10 16:51:24,126 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-10 16:51:24,198 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 16:51:24,199 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-04-10 16:51:24,199 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-04-10 16:51:24,199 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-04-10 16:51:24,199 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-04-10 16:51:24,199 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-04-10 16:51:24,199 INFO L87 Difference]: Start difference. First operand 148 states and 158 transitions. Second operand 5 states. [2018-04-10 16:51:24,310 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-10 16:51:24,310 INFO L93 Difference]: Finished difference Result 149 states and 158 transitions. [2018-04-10 16:51:24,310 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-04-10 16:51:24,311 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 29 [2018-04-10 16:51:24,311 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-10 16:51:24,311 INFO L225 Difference]: With dead ends: 149 [2018-04-10 16:51:24,311 INFO L226 Difference]: Without dead ends: 149 [2018-04-10 16:51:24,311 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 0 SyntacticMatches, 2 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2018-04-10 16:51:24,311 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 149 states. [2018-04-10 16:51:24,313 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 149 to 147. [2018-04-10 16:51:24,313 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 147 states. [2018-04-10 16:51:24,313 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 147 states to 147 states and 156 transitions. [2018-04-10 16:51:24,313 INFO L78 Accepts]: Start accepts. Automaton has 147 states and 156 transitions. Word has length 29 [2018-04-10 16:51:24,313 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-10 16:51:24,313 INFO L459 AbstractCegarLoop]: Abstraction has 147 states and 156 transitions. [2018-04-10 16:51:24,313 INFO L460 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-04-10 16:51:24,313 INFO L276 IsEmpty]: Start isEmpty. Operand 147 states and 156 transitions. [2018-04-10 16:51:24,314 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2018-04-10 16:51:24,314 INFO L347 BasicCegarLoop]: Found error trace [2018-04-10 16:51:24,314 INFO L355 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-10 16:51:24,314 INFO L408 AbstractCegarLoop]: === Iteration 11 === [mainErr51RequiresViolation, mainErr26RequiresViolation, mainErr54RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr31RequiresViolation, mainErr46RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr52AssertViolationMEMORY_FREE, mainErr15RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr55RequiresViolation, mainErr17RequiresViolation, mainErr42RequiresViolation, mainErr49AssertViolationMEMORY_FREE, mainErr30RequiresViolation, mainErr56AssertViolationMEMORY_FREE, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr44RequiresViolation, mainErr10RequiresViolation, mainErr43RequiresViolation, mainErr4RequiresViolation, mainErr50RequiresViolation, mainErr58EnsuresViolationMEMORY_LEAK, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr48AssertViolationMEMORY_FREE, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr45RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr57AssertViolationMEMORY_FREE, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr9RequiresViolation, mainErr53AssertViolationMEMORY_FREE, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr34RequiresViolation, mainErr47RequiresViolation, mainErr14RequiresViolation, mainErr40RequiresViolation]=== [2018-04-10 16:51:24,314 INFO L82 PathProgramCache]: Analyzing trace with hash 759542753, now seen corresponding path program 1 times [2018-04-10 16:51:24,314 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-04-10 16:51:24,315 INFO L68 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-04-10 16:51:24,315 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-10 16:51:24,316 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-10 16:51:24,316 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-10 16:51:24,323 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-10 16:51:24,324 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-10 16:51:24,370 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 16:51:24,370 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-04-10 16:51:24,370 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-04-10 16:51:24,371 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-04-10 16:51:24,371 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-04-10 16:51:24,371 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-04-10 16:51:24,371 INFO L87 Difference]: Start difference. First operand 147 states and 156 transitions. Second operand 5 states. [2018-04-10 16:51:24,541 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-10 16:51:24,541 INFO L93 Difference]: Finished difference Result 246 states and 262 transitions. [2018-04-10 16:51:24,541 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-04-10 16:51:24,542 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 29 [2018-04-10 16:51:24,542 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-10 16:51:24,542 INFO L225 Difference]: With dead ends: 246 [2018-04-10 16:51:24,542 INFO L226 Difference]: Without dead ends: 246 [2018-04-10 16:51:24,543 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2018-04-10 16:51:24,543 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 246 states. [2018-04-10 16:51:24,553 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 246 to 146. [2018-04-10 16:51:24,554 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 146 states. [2018-04-10 16:51:24,555 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 146 states to 146 states and 155 transitions. [2018-04-10 16:51:24,555 INFO L78 Accepts]: Start accepts. Automaton has 146 states and 155 transitions. Word has length 29 [2018-04-10 16:51:24,555 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-10 16:51:24,555 INFO L459 AbstractCegarLoop]: Abstraction has 146 states and 155 transitions. [2018-04-10 16:51:24,555 INFO L460 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-04-10 16:51:24,555 INFO L276 IsEmpty]: Start isEmpty. Operand 146 states and 155 transitions. [2018-04-10 16:51:24,556 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2018-04-10 16:51:24,556 INFO L347 BasicCegarLoop]: Found error trace [2018-04-10 16:51:24,556 INFO L355 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-10 16:51:24,556 INFO L408 AbstractCegarLoop]: === Iteration 12 === [mainErr51RequiresViolation, mainErr26RequiresViolation, mainErr54RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr31RequiresViolation, mainErr46RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr52AssertViolationMEMORY_FREE, mainErr15RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr55RequiresViolation, mainErr17RequiresViolation, mainErr42RequiresViolation, mainErr49AssertViolationMEMORY_FREE, mainErr30RequiresViolation, mainErr56AssertViolationMEMORY_FREE, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr44RequiresViolation, mainErr10RequiresViolation, mainErr43RequiresViolation, mainErr4RequiresViolation, mainErr50RequiresViolation, mainErr58EnsuresViolationMEMORY_LEAK, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr48AssertViolationMEMORY_FREE, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr45RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr57AssertViolationMEMORY_FREE, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr9RequiresViolation, mainErr53AssertViolationMEMORY_FREE, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr34RequiresViolation, mainErr47RequiresViolation, mainErr14RequiresViolation, mainErr40RequiresViolation]=== [2018-04-10 16:51:24,557 INFO L82 PathProgramCache]: Analyzing trace with hash 759542752, now seen corresponding path program 1 times [2018-04-10 16:51:24,557 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-04-10 16:51:24,557 INFO L68 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-04-10 16:51:24,558 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-10 16:51:24,558 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-10 16:51:24,558 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-10 16:51:24,567 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-10 16:51:24,568 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-10 16:51:24,596 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 16:51:24,596 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-04-10 16:51:24,596 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-04-10 16:51:24,597 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-04-10 16:51:24,597 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-04-10 16:51:24,597 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-04-10 16:51:24,597 INFO L87 Difference]: Start difference. First operand 146 states and 155 transitions. Second operand 5 states. [2018-04-10 16:51:24,776 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-10 16:51:24,776 INFO L93 Difference]: Finished difference Result 217 states and 232 transitions. [2018-04-10 16:51:24,776 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-04-10 16:51:24,776 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 29 [2018-04-10 16:51:24,776 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-10 16:51:24,777 INFO L225 Difference]: With dead ends: 217 [2018-04-10 16:51:24,777 INFO L226 Difference]: Without dead ends: 217 [2018-04-10 16:51:24,778 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2018-04-10 16:51:24,778 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 217 states. [2018-04-10 16:51:24,780 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 217 to 145. [2018-04-10 16:51:24,781 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 145 states. [2018-04-10 16:51:24,781 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 145 states to 145 states and 154 transitions. [2018-04-10 16:51:24,781 INFO L78 Accepts]: Start accepts. Automaton has 145 states and 154 transitions. Word has length 29 [2018-04-10 16:51:24,782 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-10 16:51:24,782 INFO L459 AbstractCegarLoop]: Abstraction has 145 states and 154 transitions. [2018-04-10 16:51:24,782 INFO L460 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-04-10 16:51:24,782 INFO L276 IsEmpty]: Start isEmpty. Operand 145 states and 154 transitions. [2018-04-10 16:51:24,782 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2018-04-10 16:51:24,782 INFO L347 BasicCegarLoop]: Found error trace [2018-04-10 16:51:24,783 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] [2018-04-10 16:51:24,783 INFO L408 AbstractCegarLoop]: === Iteration 13 === [mainErr51RequiresViolation, mainErr26RequiresViolation, mainErr54RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr31RequiresViolation, mainErr46RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr52AssertViolationMEMORY_FREE, mainErr15RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr55RequiresViolation, mainErr17RequiresViolation, mainErr42RequiresViolation, mainErr49AssertViolationMEMORY_FREE, mainErr30RequiresViolation, mainErr56AssertViolationMEMORY_FREE, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr44RequiresViolation, mainErr10RequiresViolation, mainErr43RequiresViolation, mainErr4RequiresViolation, mainErr50RequiresViolation, mainErr58EnsuresViolationMEMORY_LEAK, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr48AssertViolationMEMORY_FREE, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr45RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr57AssertViolationMEMORY_FREE, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr9RequiresViolation, mainErr53AssertViolationMEMORY_FREE, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr34RequiresViolation, mainErr47RequiresViolation, mainErr14RequiresViolation, mainErr40RequiresViolation]=== [2018-04-10 16:51:24,783 INFO L82 PathProgramCache]: Analyzing trace with hash -375834398, now seen corresponding path program 1 times [2018-04-10 16:51:24,783 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-04-10 16:51:24,783 INFO L68 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-04-10 16:51:24,784 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-10 16:51:24,784 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-10 16:51:24,784 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-10 16:51:24,795 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-10 16:51:24,796 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-10 16:51:24,800 INFO L431 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown lemma type! [2018-04-10 16:51:24,800 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-04-10 16:51:24,800 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-04-10 16:51:24,801 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-10 16:51:24,838 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-10 16:51:24,841 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-10 16:51:24,850 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 16:51:24,851 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 16:51:24,851 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 24 [2018-04-10 16:51:24,852 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-10 16:51:24,857 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-10 16:51:24,857 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:17, output treesize:15 [2018-04-10 16:51:24,868 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 16:51:24,871 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 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 16:51:24,871 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-10 16:51:24,872 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-10 16:51:24,878 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 16:51:24,878 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:26, output treesize:23 [2018-04-10 16:51:24,902 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 16:51:24,904 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 13 [2018-04-10 16:51:24,905 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-10 16:51:24,908 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-10 16:51:24,914 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 16:51:24,914 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:44, output treesize:36 [2018-04-10 16:51:24,937 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 38 treesize of output 26 [2018-04-10 16:51:24,940 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 1 [2018-04-10 16:51:24,940 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-10 16:51:24,946 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 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 16:51:24,946 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-04-10 16:51:24,948 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-10 16:51:24,952 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 16:51:24,952 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 4 variables, input treesize:43, output treesize:15 [2018-04-10 16:51:24,978 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 16:51:24,978 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-04-10 16:51:24,978 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2018-04-10 16:51:24,978 INFO L442 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-04-10 16:51:24,979 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-04-10 16:51:24,979 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=46, Unknown=0, NotChecked=0, Total=72 [2018-04-10 16:51:24,979 INFO L87 Difference]: Start difference. First operand 145 states and 154 transitions. Second operand 9 states. [2018-04-10 16:51:25,216 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-10 16:51:25,216 INFO L93 Difference]: Finished difference Result 147 states and 155 transitions. [2018-04-10 16:51:25,216 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-04-10 16:51:25,216 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 33 [2018-04-10 16:51:25,217 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-10 16:51:25,217 INFO L225 Difference]: With dead ends: 147 [2018-04-10 16:51:25,217 INFO L226 Difference]: Without dead ends: 147 [2018-04-10 16:51:25,217 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 37 GetRequests, 25 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=69, Invalid=113, Unknown=0, NotChecked=0, Total=182 [2018-04-10 16:51:25,217 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 147 states. [2018-04-10 16:51:25,219 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 147 to 144. [2018-04-10 16:51:25,219 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 144 states. [2018-04-10 16:51:25,219 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 144 states to 144 states and 153 transitions. [2018-04-10 16:51:25,219 INFO L78 Accepts]: Start accepts. Automaton has 144 states and 153 transitions. Word has length 33 [2018-04-10 16:51:25,219 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-10 16:51:25,219 INFO L459 AbstractCegarLoop]: Abstraction has 144 states and 153 transitions. [2018-04-10 16:51:25,219 INFO L460 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-04-10 16:51:25,219 INFO L276 IsEmpty]: Start isEmpty. Operand 144 states and 153 transitions. [2018-04-10 16:51:25,220 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2018-04-10 16:51:25,220 INFO L347 BasicCegarLoop]: Found error trace [2018-04-10 16:51:25,220 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] [2018-04-10 16:51:25,220 INFO L408 AbstractCegarLoop]: === Iteration 14 === [mainErr51RequiresViolation, mainErr26RequiresViolation, mainErr54RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr31RequiresViolation, mainErr46RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr52AssertViolationMEMORY_FREE, mainErr15RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr55RequiresViolation, mainErr17RequiresViolation, mainErr42RequiresViolation, mainErr49AssertViolationMEMORY_FREE, mainErr30RequiresViolation, mainErr56AssertViolationMEMORY_FREE, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr44RequiresViolation, mainErr10RequiresViolation, mainErr43RequiresViolation, mainErr4RequiresViolation, mainErr50RequiresViolation, mainErr58EnsuresViolationMEMORY_LEAK, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr48AssertViolationMEMORY_FREE, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr45RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr57AssertViolationMEMORY_FREE, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr9RequiresViolation, mainErr53AssertViolationMEMORY_FREE, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr34RequiresViolation, mainErr47RequiresViolation, mainErr14RequiresViolation, mainErr40RequiresViolation]=== [2018-04-10 16:51:25,220 INFO L82 PathProgramCache]: Analyzing trace with hash -375834397, now seen corresponding path program 1 times [2018-04-10 16:51:25,220 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-04-10 16:51:25,220 INFO L68 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-04-10 16:51:25,221 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-10 16:51:25,221 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-10 16:51:25,221 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-10 16:51:25,231 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-10 16:51:25,232 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-10 16:51:25,239 INFO L431 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown lemma type! [2018-04-10 16:51:25,239 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-04-10 16:51:25,239 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-04-10 16:51:25,240 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-10 16:51:25,278 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-10 16:51:25,281 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-10 16:51:25,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 6 treesize of output 5 [2018-04-10 16:51:25,288 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-10 16:51:25,295 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 16:51:25,296 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 16:51:25,297 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 15 [2018-04-10 16:51:25,297 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-10 16:51:25,301 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-10 16:51:25,302 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:20, output treesize:13 [2018-04-10 16:51:25,313 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 16:51:25,320 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-04-10 16:51:25,320 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-10 16:51:25,322 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-10 16:51:25,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 16:51:25,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, 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 16:51:25,332 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-04-10 16:51:25,334 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-10 16:51:25,339 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 16:51:25,340 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 3 variables, input treesize:32, output treesize:25 [2018-04-10 16:51:25,364 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 30 [2018-04-10 16:51:25,367 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 13 [2018-04-10 16:51:25,368 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-10 16:51:25,372 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-10 16:51:25,385 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 52 treesize of output 48 [2018-04-10 16:51:25,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, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 13 [2018-04-10 16:51:25,388 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-04-10 16:51:25,394 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-10 16:51:25,402 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 16:51:25,403 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 3 variables, input treesize:67, output treesize:51 [2018-04-10 16:51:25,423 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 51 treesize of output 37 [2018-04-10 16:51:25,425 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 19 [2018-04-10 16:51:25,426 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-10 16:51:25,433 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 1 [2018-04-10 16:51:25,433 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-04-10 16:51:25,437 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-10 16:51:25,446 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 22 [2018-04-10 16:51:25,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 7 treesize of output 1 [2018-04-10 16:51:25,449 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2018-04-10 16:51:25,454 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select 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 16:51:25,454 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2018-04-10 16:51:25,455 INFO L267 ElimStorePlain]: Start of recursive call 5: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-10 16:51:25,459 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 16:51:25,459 INFO L202 ElimStorePlain]: Needed 7 recursive calls to eliminate 5 variables, input treesize:65, output treesize:9 [2018-04-10 16:51:25,486 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-10 16:51:25,486 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-04-10 16:51:25,486 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2018-04-10 16:51:25,487 INFO L442 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-04-10 16:51:25,487 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-04-10 16:51:25,487 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2018-04-10 16:51:25,487 INFO L87 Difference]: Start difference. First operand 144 states and 153 transitions. Second operand 9 states. [2018-04-10 16:51:25,788 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-10 16:51:25,788 INFO L93 Difference]: Finished difference Result 143 states and 151 transitions. [2018-04-10 16:51:25,788 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-04-10 16:51:25,789 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 33 [2018-04-10 16:51:25,789 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-10 16:51:25,789 INFO L225 Difference]: With dead ends: 143 [2018-04-10 16:51:25,801 INFO L226 Difference]: Without dead ends: 143 [2018-04-10 16:51:25,801 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 40 GetRequests, 26 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 18 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=68, Invalid=172, Unknown=0, NotChecked=0, Total=240 [2018-04-10 16:51:25,802 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 143 states. [2018-04-10 16:51:25,803 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 143 to 130. [2018-04-10 16:51:25,804 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 130 states. [2018-04-10 16:51:25,804 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 130 states to 130 states and 138 transitions. [2018-04-10 16:51:25,804 INFO L78 Accepts]: Start accepts. Automaton has 130 states and 138 transitions. Word has length 33 [2018-04-10 16:51:25,804 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-10 16:51:25,804 INFO L459 AbstractCegarLoop]: Abstraction has 130 states and 138 transitions. [2018-04-10 16:51:25,805 INFO L460 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-04-10 16:51:25,805 INFO L276 IsEmpty]: Start isEmpty. Operand 130 states and 138 transitions. [2018-04-10 16:51:25,805 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2018-04-10 16:51:25,805 INFO L347 BasicCegarLoop]: Found error trace [2018-04-10 16:51:25,805 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] [2018-04-10 16:51:25,805 INFO L408 AbstractCegarLoop]: === Iteration 15 === [mainErr51RequiresViolation, mainErr26RequiresViolation, mainErr54RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr31RequiresViolation, mainErr46RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr52AssertViolationMEMORY_FREE, mainErr15RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr55RequiresViolation, mainErr17RequiresViolation, mainErr42RequiresViolation, mainErr49AssertViolationMEMORY_FREE, mainErr30RequiresViolation, mainErr56AssertViolationMEMORY_FREE, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr44RequiresViolation, mainErr10RequiresViolation, mainErr43RequiresViolation, mainErr4RequiresViolation, mainErr50RequiresViolation, mainErr58EnsuresViolationMEMORY_LEAK, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr48AssertViolationMEMORY_FREE, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr45RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr57AssertViolationMEMORY_FREE, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr9RequiresViolation, mainErr53AssertViolationMEMORY_FREE, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr34RequiresViolation, mainErr47RequiresViolation, mainErr14RequiresViolation, mainErr40RequiresViolation]=== [2018-04-10 16:51:25,805 INFO L82 PathProgramCache]: Analyzing trace with hash -736807832, now seen corresponding path program 1 times [2018-04-10 16:51:25,806 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-04-10 16:51:25,806 INFO L68 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-04-10 16:51:25,807 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-10 16:51:25,807 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-10 16:51:25,807 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-10 16:51:25,812 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-10 16:51:25,813 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-10 16:51:25,815 INFO L431 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown lemma type! [2018-04-10 16:51:25,815 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-04-10 16:51:25,815 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-04-10 16:51:25,816 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-10 16:51:25,829 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-10 16:51:25,831 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-10 16:51:25,841 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 16:51:25,843 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select 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 16:51:25,843 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-10 16:51:25,844 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-10 16:51:25,852 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 16:51:25,855 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-04-10 16:51:25,855 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-04-10 16:51:25,857 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-10 16:51:25,862 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-04-10 16:51:25,862 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 2 variables, input treesize:29, output treesize:21 [2018-04-10 16:51:25,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, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 16 [2018-04-10 16:51:25,883 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 16:51:25,884 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 16:51:25,885 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-10 16:51:25,890 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-10 16:51:25,903 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 16 [2018-04-10 16:51:25,905 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 16:51:25,905 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 16:51:25,905 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-04-10 16:51:25,911 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-10 16:51:25,920 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-04-10 16:51:25,920 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 2 variables, input treesize:47, output treesize:39 [2018-04-10 16:51:25,983 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 24 treesize of output 18 [2018-04-10 16:51:25,988 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 16:51:25,988 INFO L682 Elim1Store]: detected equality via solver [2018-04-10 16:51:25,989 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 18 treesize of output 13 [2018-04-10 16:51:25,989 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-10 16:51:25,993 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-10 16:51:26,005 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 24 treesize of output 18 [2018-04-10 16:51:26,007 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 16:51:26,008 INFO L682 Elim1Store]: detected equality via solver [2018-04-10 16:51:26,008 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 18 treesize of output 13 [2018-04-10 16:51:26,009 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-04-10 16:51:26,012 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-10 16:51:26,019 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 16:51:26,019 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 5 variables, input treesize:59, output treesize:7 [2018-04-10 16:51:26,043 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-10 16:51:26,044 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-04-10 16:51:26,044 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10] total 10 [2018-04-10 16:51:26,044 INFO L442 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-04-10 16:51:26,044 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-04-10 16:51:26,044 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=69, Unknown=0, NotChecked=0, Total=90 [2018-04-10 16:51:26,044 INFO L87 Difference]: Start difference. First operand 130 states and 138 transitions. Second operand 10 states. [2018-04-10 16:51:26,408 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-10 16:51:26,408 INFO L93 Difference]: Finished difference Result 169 states and 178 transitions. [2018-04-10 16:51:26,408 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-04-10 16:51:26,408 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 35 [2018-04-10 16:51:26,408 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-10 16:51:26,409 INFO L225 Difference]: With dead ends: 169 [2018-04-10 16:51:26,409 INFO L226 Difference]: Without dead ends: 169 [2018-04-10 16:51:26,409 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 41 GetRequests, 26 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 24 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=80, Invalid=192, Unknown=0, NotChecked=0, Total=272 [2018-04-10 16:51:26,410 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 169 states. [2018-04-10 16:51:26,412 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 169 to 150. [2018-04-10 16:51:26,412 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 150 states. [2018-04-10 16:51:26,412 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 150 states to 150 states and 158 transitions. [2018-04-10 16:51:26,412 INFO L78 Accepts]: Start accepts. Automaton has 150 states and 158 transitions. Word has length 35 [2018-04-10 16:51:26,413 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-10 16:51:26,413 INFO L459 AbstractCegarLoop]: Abstraction has 150 states and 158 transitions. [2018-04-10 16:51:26,413 INFO L460 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-04-10 16:51:26,413 INFO L276 IsEmpty]: Start isEmpty. Operand 150 states and 158 transitions. [2018-04-10 16:51:26,413 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2018-04-10 16:51:26,413 INFO L347 BasicCegarLoop]: Found error trace [2018-04-10 16:51:26,413 INFO L355 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-10 16:51:26,413 INFO L408 AbstractCegarLoop]: === Iteration 16 === [mainErr51RequiresViolation, mainErr26RequiresViolation, mainErr54RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr31RequiresViolation, mainErr46RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr52AssertViolationMEMORY_FREE, mainErr15RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr55RequiresViolation, mainErr17RequiresViolation, mainErr42RequiresViolation, mainErr49AssertViolationMEMORY_FREE, mainErr30RequiresViolation, mainErr56AssertViolationMEMORY_FREE, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr44RequiresViolation, mainErr10RequiresViolation, mainErr43RequiresViolation, mainErr4RequiresViolation, mainErr50RequiresViolation, mainErr58EnsuresViolationMEMORY_LEAK, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr48AssertViolationMEMORY_FREE, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr45RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr57AssertViolationMEMORY_FREE, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr9RequiresViolation, mainErr53AssertViolationMEMORY_FREE, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr34RequiresViolation, mainErr47RequiresViolation, mainErr14RequiresViolation, mainErr40RequiresViolation]=== [2018-04-10 16:51:26,414 INFO L82 PathProgramCache]: Analyzing trace with hash 1289031714, now seen corresponding path program 1 times [2018-04-10 16:51:26,414 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-04-10 16:51:26,414 INFO L68 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-04-10 16:51:26,416 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-10 16:51:26,416 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-10 16:51:26,416 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-10 16:51:26,427 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-10 16:51:26,428 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-10 16:51:26,432 INFO L431 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown lemma type! [2018-04-10 16:51:26,432 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-04-10 16:51:26,432 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-04-10 16:51:26,433 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-10 16:51:26,464 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-10 16:51:26,467 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-10 16:51:26,487 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 16:51:26,488 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 16:51:26,506 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 16:51:26,506 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-10 16:51:26,511 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-10 16:51:26,511 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:17, output treesize:15 [2018-04-10 16:51:26,521 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 16:51:26,523 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 16:51:26,523 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-10 16:51:26,525 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-10 16:51:26,530 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 16:51:26,530 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:26, output treesize:23 [2018-04-10 16:51:26,555 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 16:51:26,558 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 13 [2018-04-10 16:51:26,559 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-10 16:51:26,564 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-10 16:51:26,571 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 16:51:26,571 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:44, output treesize:36 [2018-04-10 16:51:26,592 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 38 treesize of output 26 [2018-04-10 16:51:26,594 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 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 16:51:26,595 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-10 16:51:26,602 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select 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 16:51:26,602 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-04-10 16:51:26,605 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-10 16:51:26,609 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 16:51:26,610 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 4 variables, input treesize:43, output treesize:15 [2018-04-10 16:51:26,632 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 11 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-10 16:51:26,632 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-04-10 16:51:26,632 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2018-04-10 16:51:26,632 INFO L442 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-04-10 16:51:26,633 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-04-10 16:51:26,633 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=46, Unknown=0, NotChecked=0, Total=72 [2018-04-10 16:51:26,633 INFO L87 Difference]: Start difference. First operand 150 states and 158 transitions. Second operand 9 states. [2018-04-10 16:51:26,875 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-10 16:51:26,875 INFO L93 Difference]: Finished difference Result 160 states and 169 transitions. [2018-04-10 16:51:26,876 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-04-10 16:51:26,876 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 36 [2018-04-10 16:51:26,876 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-10 16:51:26,876 INFO L225 Difference]: With dead ends: 160 [2018-04-10 16:51:26,876 INFO L226 Difference]: Without dead ends: 160 [2018-04-10 16:51:26,877 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 40 GetRequests, 28 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=69, Invalid=113, Unknown=0, NotChecked=0, Total=182 [2018-04-10 16:51:26,877 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 160 states. [2018-04-10 16:51:26,878 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 160 to 141. [2018-04-10 16:51:26,878 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 141 states. [2018-04-10 16:51:26,878 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 141 states to 141 states and 149 transitions. [2018-04-10 16:51:26,878 INFO L78 Accepts]: Start accepts. Automaton has 141 states and 149 transitions. Word has length 36 [2018-04-10 16:51:26,878 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-10 16:51:26,879 INFO L459 AbstractCegarLoop]: Abstraction has 141 states and 149 transitions. [2018-04-10 16:51:26,879 INFO L460 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-04-10 16:51:26,879 INFO L276 IsEmpty]: Start isEmpty. Operand 141 states and 149 transitions. [2018-04-10 16:51:26,879 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2018-04-10 16:51:26,879 INFO L347 BasicCegarLoop]: Found error trace [2018-04-10 16:51:26,879 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 16:51:26,879 INFO L408 AbstractCegarLoop]: === Iteration 17 === [mainErr51RequiresViolation, mainErr26RequiresViolation, mainErr54RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr31RequiresViolation, mainErr46RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr52AssertViolationMEMORY_FREE, mainErr15RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr55RequiresViolation, mainErr17RequiresViolation, mainErr42RequiresViolation, mainErr49AssertViolationMEMORY_FREE, mainErr30RequiresViolation, mainErr56AssertViolationMEMORY_FREE, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr44RequiresViolation, mainErr10RequiresViolation, mainErr43RequiresViolation, mainErr4RequiresViolation, mainErr50RequiresViolation, mainErr58EnsuresViolationMEMORY_LEAK, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr48AssertViolationMEMORY_FREE, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr45RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr57AssertViolationMEMORY_FREE, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr9RequiresViolation, mainErr53AssertViolationMEMORY_FREE, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr34RequiresViolation, mainErr47RequiresViolation, mainErr14RequiresViolation, mainErr40RequiresViolation]=== [2018-04-10 16:51:26,879 INFO L82 PathProgramCache]: Analyzing trace with hash 1325299433, now seen corresponding path program 1 times [2018-04-10 16:51:26,880 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-04-10 16:51:26,880 INFO L68 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-04-10 16:51:26,880 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-10 16:51:26,880 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-10 16:51:26,880 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-10 16:51:26,884 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-10 16:51:26,884 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-10 16:51:26,914 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 16:51:26,914 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-04-10 16:51:26,914 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-04-10 16:51:26,914 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-04-10 16:51:26,915 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-04-10 16:51:26,915 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-04-10 16:51:26,915 INFO L87 Difference]: Start difference. First operand 141 states and 149 transitions. Second operand 6 states. [2018-04-10 16:51:27,022 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-10 16:51:27,022 INFO L93 Difference]: Finished difference Result 105 states and 108 transitions. [2018-04-10 16:51:27,022 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-04-10 16:51:27,022 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 44 [2018-04-10 16:51:27,022 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-10 16:51:27,023 INFO L225 Difference]: With dead ends: 105 [2018-04-10 16:51:27,023 INFO L226 Difference]: Without dead ends: 85 [2018-04-10 16:51:27,023 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=28, Invalid=62, Unknown=0, NotChecked=0, Total=90 [2018-04-10 16:51:27,023 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 85 states. [2018-04-10 16:51:27,024 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 85 to 79. [2018-04-10 16:51:27,024 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 79 states. [2018-04-10 16:51:27,025 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 79 states to 79 states and 83 transitions. [2018-04-10 16:51:27,025 INFO L78 Accepts]: Start accepts. Automaton has 79 states and 83 transitions. Word has length 44 [2018-04-10 16:51:27,025 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-10 16:51:27,025 INFO L459 AbstractCegarLoop]: Abstraction has 79 states and 83 transitions. [2018-04-10 16:51:27,025 INFO L460 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-04-10 16:51:27,025 INFO L276 IsEmpty]: Start isEmpty. Operand 79 states and 83 transitions. [2018-04-10 16:51:27,025 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2018-04-10 16:51:27,025 INFO L347 BasicCegarLoop]: Found error trace [2018-04-10 16:51:27,025 INFO L355 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-10 16:51:27,026 INFO L408 AbstractCegarLoop]: === Iteration 18 === [mainErr51RequiresViolation, mainErr26RequiresViolation, mainErr54RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr31RequiresViolation, mainErr46RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr52AssertViolationMEMORY_FREE, mainErr15RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr55RequiresViolation, mainErr17RequiresViolation, mainErr42RequiresViolation, mainErr49AssertViolationMEMORY_FREE, mainErr30RequiresViolation, mainErr56AssertViolationMEMORY_FREE, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr44RequiresViolation, mainErr10RequiresViolation, mainErr43RequiresViolation, mainErr4RequiresViolation, mainErr50RequiresViolation, mainErr58EnsuresViolationMEMORY_LEAK, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr48AssertViolationMEMORY_FREE, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr45RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr57AssertViolationMEMORY_FREE, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr9RequiresViolation, mainErr53AssertViolationMEMORY_FREE, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr34RequiresViolation, mainErr47RequiresViolation, mainErr14RequiresViolation, mainErr40RequiresViolation]=== [2018-04-10 16:51:27,026 INFO L82 PathProgramCache]: Analyzing trace with hash -799952616, now seen corresponding path program 1 times [2018-04-10 16:51:27,026 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-04-10 16:51:27,026 INFO L68 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-04-10 16:51:27,026 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-10 16:51:27,027 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-10 16:51:27,027 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-10 16:51:27,034 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-10 16:51:27,035 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-10 16:51:27,047 INFO L431 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown lemma type! [2018-04-10 16:51:27,047 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-04-10 16:51:27,047 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-04-10 16:51:27,048 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-10 16:51:27,076 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-10 16:51:27,080 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-10 16:51:27,085 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select 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 16:51:27,085 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-10 16:51:27,089 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-10 16:51:27,089 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2018-04-10 16:51:27,141 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 11 [2018-04-10 16:51:27,141 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-10 16:51:27,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 6 treesize of output 5 [2018-04-10 16:51:27,151 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-10 16:51:27,157 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-10 16:51:27,157 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:30, output treesize:28 [2018-04-10 16:51:27,169 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 8 [2018-04-10 16:51:27,171 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select 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 16:51:27,171 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-10 16:51:27,172 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-10 16:51:27,183 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 8 [2018-04-10 16:51:27,185 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-04-10 16:51:27,185 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-04-10 16:51:27,189 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-10 16:51:27,199 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 16:51:27,200 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 4 variables, input treesize:53, output treesize:43 [2018-04-10 16:51:27,243 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 16:51:27,248 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2018-04-10 16:51:27,248 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-10 16:51:27,249 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-10 16:51:27,258 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 16:51:27,258 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:50, output treesize:39 [2018-04-10 16:51:27,284 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 32 treesize of output 42 [2018-04-10 16:51:27,295 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 16:51:27,296 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 37 [2018-04-10 16:51:27,297 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-10 16:51:27,311 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 28 [2018-04-10 16:51:27,311 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-04-10 16:51:27,317 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-10 16:51:27,325 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 16:51:27,325 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 4 variables, input treesize:49, output treesize:45 [2018-04-10 16:51:27,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, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 7 case distinctions, treesize of input 39 treesize of output 64 [2018-04-10 16:51:27,388 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 41 treesize of output 48 [2018-04-10 16:51:27,388 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 2 xjuncts. [2018-04-10 16:51:27,465 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 39 treesize of output 45 [2018-04-10 16:51:27,466 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 16:51:27,525 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 16:51:27,535 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 4 case distinctions, treesize of input 36 treesize of output 56 [2018-04-10 16:51:27,536 INFO L267 ElimStorePlain]: Start of recursive call 5: 2 dim-0 vars, End of recursive call: 2 dim-0 vars, and 4 xjuncts. [2018-04-10 16:51:27,603 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 35 [2018-04-10 16:51:27,603 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2018-04-10 16:51:27,643 INFO L267 ElimStorePlain]: Start of recursive call 2: 4 dim-1 vars, End of recursive call: 2 dim-0 vars, and 5 xjuncts. [2018-04-10 16:51:27,689 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 8 [2018-04-10 16:51:27,691 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-04-10 16:51:27,692 INFO L267 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 1 xjuncts. [2018-04-10 16:51:27,693 INFO L267 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-10 16:51:27,741 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 2 dim-2 vars, End of recursive call: 12 dim-0 vars, and 5 xjuncts. [2018-04-10 16:51:27,741 INFO L202 ElimStorePlain]: Needed 8 recursive calls to eliminate 5 variables, input treesize:70, output treesize:296 [2018-04-10 16:51:27,881 WARN L151 SmtUtils]: Spent 119ms on a formula simplification. DAG size of input: 112 DAG size of output 92 [2018-04-10 16:51:27,893 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 62 treesize of output 48 [2018-04-10 16:51:27,893 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-10 16:51:27,940 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 16:51:27,941 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 16:51:27,942 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 16:51:27,943 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 57 treesize of output 57 [2018-04-10 16:51:27,943 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-10 16:51:27,995 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 1 new quantified variables, introduced 2 case distinctions, treesize of input 69 treesize of output 79 [2018-04-10 16:51:27,996 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 2 xjuncts. [2018-04-10 16:51:28,066 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 51 treesize of output 41 [2018-04-10 16:51:28,067 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-04-10 16:51:28,132 INFO L267 ElimStorePlain]: Start of recursive call 1: 15 dim-0 vars, 4 dim-1 vars, End of recursive call: 20 dim-0 vars, and 5 xjuncts. [2018-04-10 16:51:28,132 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 19 variables, input treesize:247, output treesize:252 [2018-04-10 16:51:28,539 WARN L148 SmtUtils]: Spent 235ms on a formula simplification that was a NOOP. DAG size: 139 [2018-04-10 16:51:28,862 WARN L148 SmtUtils]: Spent 177ms on a formula simplification that was a NOOP. DAG size: 140 [2018-04-10 16:51:28,899 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 83 treesize of output 68 [2018-04-10 16:51:28,901 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 19 [2018-04-10 16:51:28,902 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 16:51:28,925 INFO L682 Elim1Store]: detected equality via solver [2018-04-10 16:51:28,926 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 16:51:28,926 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-04-10 16:51:28,940 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 16:51:29,040 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 4 new quantified variables, introduced 3 case distinctions, treesize of input 77 treesize of output 88 [2018-04-10 16:51:29,051 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select 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 16:51:29,051 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2018-04-10 16:51:29,214 INFO L682 Elim1Store]: detected equality via solver [2018-04-10 16:51:29,215 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 16:51:29,216 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 64 treesize of output 58 [2018-04-10 16:51:29,217 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 16:51:29,368 INFO L682 Elim1Store]: detected equality via solver [2018-04-10 16:51:29,368 INFO L682 Elim1Store]: detected equality via solver [2018-04-10 16:51:29,369 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 16:51:29,371 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 1 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 57 treesize of output 59 [2018-04-10 16:51:29,372 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 16:51:29,540 INFO L682 Elim1Store]: detected equality via solver [2018-04-10 16:51:29,540 INFO L682 Elim1Store]: detected equality via solver [2018-04-10 16:51:29,541 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 16:51:29,543 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 1 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 61 treesize of output 63 [2018-04-10 16:51:29,543 INFO L267 ElimStorePlain]: Start of recursive call 9: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-04-10 16:51:29,692 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 69 treesize of output 61 [2018-04-10 16:51:29,693 INFO L267 ElimStorePlain]: Start of recursive call 10: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-04-10 16:51:29,817 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 77 treesize of output 72 [2018-04-10 16:51:29,817 INFO L267 ElimStorePlain]: Start of recursive call 11: End of recursive call: and 1 xjuncts. [2018-04-10 16:51:29,936 INFO L682 Elim1Store]: detected equality via solver [2018-04-10 16:51:29,936 INFO L682 Elim1Store]: detected equality via solver [2018-04-10 16:51:29,937 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 16:51:29,939 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 2 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 65 treesize of output 63 [2018-04-10 16:51:29,939 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 16:51:30,067 INFO L682 Elim1Store]: detected equality via solver [2018-04-10 16:51:30,067 INFO L682 Elim1Store]: detected equality via solver [2018-04-10 16:51:30,068 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 61 treesize of output 61 [2018-04-10 16:51:30,068 INFO L267 ElimStorePlain]: Start of recursive call 13: End of recursive call: and 1 xjuncts. [2018-04-10 16:51:30,184 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 72 treesize of output 60 [2018-04-10 16:51:30,185 INFO L267 ElimStorePlain]: Start of recursive call 14: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-04-10 16:51:30,341 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 16:51:30,342 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 73 treesize of output 62 [2018-04-10 16:51:30,343 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 16:51:30,471 INFO L682 Elim1Store]: detected equality via solver [2018-04-10 16:51:30,472 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 56 treesize of output 52 [2018-04-10 16:51:30,472 INFO L267 ElimStorePlain]: Start of recursive call 16: End of recursive call: and 1 xjuncts. [2018-04-10 16:51:30,599 INFO L682 Elim1Store]: detected equality via solver [2018-04-10 16:51:30,599 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 60 treesize of output 56 [2018-04-10 16:51:30,600 INFO L267 ElimStorePlain]: Start of recursive call 17: End of recursive call: and 1 xjuncts. [2018-04-10 16:51:30,708 INFO L682 Elim1Store]: detected equality via solver [2018-04-10 16:51:30,708 INFO L682 Elim1Store]: detected equality via solver [2018-04-10 16:51:30,708 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 16:51:30,710 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 2 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 65 treesize of output 63 [2018-04-10 16:51:30,711 INFO L267 ElimStorePlain]: Start of recursive call 18: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-04-10 16:51:30,807 INFO L267 ElimStorePlain]: Start of recursive call 5: 13 dim-1 vars, End of recursive call: 8 dim-0 vars, and 8 xjuncts. [2018-04-10 16:51:30,976 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 98 treesize of output 88 [2018-04-10 16:51:30,978 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select 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 16:51:30,978 INFO L267 ElimStorePlain]: Start of recursive call 20: End of recursive call: and 1 xjuncts. [2018-04-10 16:51:30,991 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select 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 16:51:30,991 INFO L267 ElimStorePlain]: Start of recursive call 21: End of recursive call: and 1 xjuncts. [2018-04-10 16:51:31,002 INFO L267 ElimStorePlain]: Start of recursive call 19: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-10 16:51:31,177 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 42 treesize of output 38 [2018-04-10 16:51:31,178 INFO L682 Elim1Store]: detected equality via solver [2018-04-10 16:51:31,178 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 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 16:51:31,179 INFO L267 ElimStorePlain]: Start of recursive call 23: End of recursive call: and 1 xjuncts. [2018-04-10 16:51:31,186 INFO L267 ElimStorePlain]: Start of recursive call 22: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-10 16:51:31,356 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 65 treesize of output 61 [2018-04-10 16:51:31,357 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select 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 16:51:31,357 INFO L267 ElimStorePlain]: Start of recursive call 25: End of recursive call: and 1 xjuncts. [2018-04-10 16:51:31,368 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select 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 16:51:31,369 INFO L267 ElimStorePlain]: Start of recursive call 26: End of recursive call: and 1 xjuncts. [2018-04-10 16:51:31,377 INFO L267 ElimStorePlain]: Start of recursive call 24: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-10 16:51:31,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 58 treesize of output 52 [2018-04-10 16:51:31,547 INFO L682 Elim1Store]: detected equality via solver [2018-04-10 16:51:31,547 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 16:51:31,549 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 13 [2018-04-10 16:51:31,549 INFO L267 ElimStorePlain]: Start of recursive call 28: End of recursive call: and 1 xjuncts. [2018-04-10 16:51:31,557 INFO L267 ElimStorePlain]: Start of recursive call 27: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-10 16:51:31,720 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 51 treesize of output 43 [2018-04-10 16:51:31,722 INFO L682 Elim1Store]: detected equality via solver [2018-04-10 16:51:31,722 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 16:51:31,723 INFO L267 ElimStorePlain]: Start of recursive call 30: End of recursive call: and 1 xjuncts. [2018-04-10 16:51:31,730 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select 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 16:51:31,730 INFO L267 ElimStorePlain]: Start of recursive call 31: End of recursive call: and 1 xjuncts. [2018-04-10 16:51:31,735 INFO L267 ElimStorePlain]: Start of recursive call 29: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-10 16:51:31,896 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 46 treesize of output 50 [2018-04-10 16:51:31,898 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 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 41 [2018-04-10 16:51:31,898 INFO L267 ElimStorePlain]: Start of recursive call 33: End of recursive call: and 1 xjuncts. [2018-04-10 16:51:31,930 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 36 [2018-04-10 16:51:31,930 INFO L267 ElimStorePlain]: Start of recursive call 34: End of recursive call: and 1 xjuncts. [2018-04-10 16:51:31,954 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 42 treesize of output 35 [2018-04-10 16:51:31,955 INFO L267 ElimStorePlain]: Start of recursive call 35: End of recursive call: and 1 xjuncts. [2018-04-10 16:51:31,980 INFO L267 ElimStorePlain]: Start of recursive call 32: 3 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-04-10 16:51:31,981 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 46 treesize of output 42 [2018-04-10 16:51:31,983 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select 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 16:51:31,983 INFO L267 ElimStorePlain]: Start of recursive call 37: End of recursive call: and 1 xjuncts. [2018-04-10 16:51:31,995 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select 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 16:51:31,995 INFO L267 ElimStorePlain]: Start of recursive call 38: End of recursive call: and 1 xjuncts. [2018-04-10 16:51:32,004 INFO L267 ElimStorePlain]: Start of recursive call 36: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-10 16:51:32,006 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 46 treesize of output 42 [2018-04-10 16:51:32,008 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 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 16:51:32,008 INFO L267 ElimStorePlain]: Start of recursive call 40: End of recursive call: and 1 xjuncts. [2018-04-10 16:51:32,023 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 1 [2018-04-10 16:51:32,023 INFO L267 ElimStorePlain]: Start of recursive call 41: End of recursive call: and 1 xjuncts. [2018-04-10 16:51:32,034 INFO L267 ElimStorePlain]: Start of recursive call 39: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-10 16:51:32,039 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 42 treesize of output 46 [2018-04-10 16:51:32,041 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 42 treesize of output 37 [2018-04-10 16:51:32,042 INFO L267 ElimStorePlain]: Start of recursive call 43: End of recursive call: and 1 xjuncts. [2018-04-10 16:51:32,068 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 37 treesize of output 32 [2018-04-10 16:51:32,068 INFO L267 ElimStorePlain]: Start of recursive call 44: End of recursive call: and 1 xjuncts. [2018-04-10 16:51:32,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 38 treesize of output 31 [2018-04-10 16:51:32,089 INFO L267 ElimStorePlain]: Start of recursive call 45: End of recursive call: and 1 xjuncts. [2018-04-10 16:51:32,109 INFO L267 ElimStorePlain]: Start of recursive call 42: 3 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-04-10 16:51:32,113 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 38 treesize of output 42 [2018-04-10 16:51:32,114 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 38 treesize of output 33 [2018-04-10 16:51:32,115 INFO L267 ElimStorePlain]: Start of recursive call 47: End of recursive call: and 1 xjuncts. [2018-04-10 16:51:32,134 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 28 [2018-04-10 16:51:32,135 INFO L267 ElimStorePlain]: Start of recursive call 48: End of recursive call: and 1 xjuncts. [2018-04-10 16:51:32,154 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 34 treesize of output 27 [2018-04-10 16:51:32,154 INFO L267 ElimStorePlain]: Start of recursive call 49: End of recursive call: and 1 xjuncts. [2018-04-10 16:51:32,172 INFO L267 ElimStorePlain]: Start of recursive call 46: 3 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-04-10 16:51:32,176 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 42 treesize of output 46 [2018-04-10 16:51:32,177 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 42 treesize of output 37 [2018-04-10 16:51:32,178 INFO L267 ElimStorePlain]: Start of recursive call 51: End of recursive call: and 1 xjuncts. [2018-04-10 16:51:32,203 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 37 treesize of output 32 [2018-04-10 16:51:32,203 INFO L267 ElimStorePlain]: Start of recursive call 52: End of recursive call: and 1 xjuncts. [2018-04-10 16:51:32,224 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 38 treesize of output 31 [2018-04-10 16:51:32,224 INFO L267 ElimStorePlain]: Start of recursive call 53: End of recursive call: and 1 xjuncts. [2018-04-10 16:51:32,242 INFO L267 ElimStorePlain]: Start of recursive call 50: 3 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-04-10 16:51:32,244 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 42 treesize of output 38 [2018-04-10 16:51:32,245 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 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 16:51:32,246 INFO L267 ElimStorePlain]: Start of recursive call 55: End of recursive call: and 1 xjuncts. [2018-04-10 16:51:32,254 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select 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 16:51:32,255 INFO L267 ElimStorePlain]: Start of recursive call 56: End of recursive call: and 1 xjuncts. [2018-04-10 16:51:32,260 INFO L267 ElimStorePlain]: Start of recursive call 54: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-10 16:51:32,262 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 50 treesize of output 46 [2018-04-10 16:51:32,264 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 1 [2018-04-10 16:51:32,264 INFO L267 ElimStorePlain]: Start of recursive call 58: End of recursive call: and 1 xjuncts. [2018-04-10 16:51:32,275 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select 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 16:51:32,276 INFO L267 ElimStorePlain]: Start of recursive call 59: End of recursive call: and 1 xjuncts. [2018-04-10 16:51:32,302 INFO L267 ElimStorePlain]: Start of recursive call 57: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-10 16:51:32,446 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 4 new quantified variables, introduced 2 case distinctions, treesize of input 78 treesize of output 73 [2018-04-10 16:51:32,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, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 62 treesize of output 54 [2018-04-10 16:51:32,449 INFO L267 ElimStorePlain]: Start of recursive call 61: End of recursive call: and 1 xjuncts. [2018-04-10 16:51:32,495 INFO L682 Elim1Store]: detected equality via solver [2018-04-10 16:51:32,495 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 46 treesize of output 40 [2018-04-10 16:51:32,495 INFO L267 ElimStorePlain]: Start of recursive call 62: End of recursive call: and 1 xjuncts. [2018-04-10 16:51:32,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 54 treesize of output 49 [2018-04-10 16:51:32,554 INFO L267 ElimStorePlain]: Start of recursive call 63: End of recursive call: and 1 xjuncts. [2018-04-10 16:51:32,609 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 55 [2018-04-10 16:51:32,610 INFO L267 ElimStorePlain]: Start of recursive call 64: End of recursive call: and 2 xjuncts. [2018-04-10 16:51:32,673 INFO L682 Elim1Store]: detected equality via solver [2018-04-10 16:51:32,674 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 16:51:32,675 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 49 treesize of output 45 [2018-04-10 16:51:32,675 INFO L267 ElimStorePlain]: Start of recursive call 65: End of recursive call: and 1 xjuncts. [2018-04-10 16:51:32,728 INFO L682 Elim1Store]: detected equality via solver [2018-04-10 16:51:32,729 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 16:51:32,737 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 3 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 3 case distinctions, treesize of input 50 treesize of output 59 [2018-04-10 16:51:32,738 INFO L267 ElimStorePlain]: Start of recursive call 66: End of recursive call: and 4 xjuncts. [2018-04-10 16:51:32,840 INFO L682 Elim1Store]: detected equality via solver [2018-04-10 16:51:32,840 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 43 treesize of output 37 [2018-04-10 16:51:32,840 INFO L267 ElimStorePlain]: Start of recursive call 67: End of recursive call: and 1 xjuncts. [2018-04-10 16:51:32,870 INFO L267 ElimStorePlain]: Start of recursive call 60: 8 dim-1 vars, End of recursive call: and 3 xjuncts. [2018-04-10 16:51:33,022 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 35 treesize of output 31 [2018-04-10 16:51:33,023 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 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 16:51:33,023 INFO L267 ElimStorePlain]: Start of recursive call 69: End of recursive call: and 1 xjuncts. [2018-04-10 16:51:33,029 INFO L267 ElimStorePlain]: Start of recursive call 68: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-10 16:51:33,177 INFO L267 ElimStorePlain]: Start of recursive call 1: 27 dim-0 vars, 10 dim-2 vars, End of recursive call: 2 dim-0 vars, and 5 xjuncts. [2018-04-10 16:51:33,178 INFO L202 ElimStorePlain]: Needed 69 recursive calls to eliminate 37 variables, input treesize:382, output treesize:51 [2018-04-10 16:51:33,273 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 16:51:33,273 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-04-10 16:51:33,273 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [15] total 15 [2018-04-10 16:51:33,274 INFO L442 AbstractCegarLoop]: Interpolant automaton has 16 states [2018-04-10 16:51:33,274 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2018-04-10 16:51:33,274 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=39, Invalid=201, Unknown=0, NotChecked=0, Total=240 [2018-04-10 16:51:33,274 INFO L87 Difference]: Start difference. First operand 79 states and 83 transitions. Second operand 16 states. [2018-04-10 16:51:33,762 WARN L151 SmtUtils]: Spent 111ms on a formula simplification. DAG size of input: 100 DAG size of output 86 [2018-04-10 16:51:41,291 WARN L151 SmtUtils]: Spent 7484ms on a formula simplification. DAG size of input: 182 DAG size of output 133 [2018-04-10 16:51:41,778 WARN L151 SmtUtils]: Spent 353ms on a formula simplification. DAG size of input: 218 DAG size of output 149 [2018-04-10 16:51:42,153 WARN L151 SmtUtils]: Spent 242ms on a formula simplification. DAG size of input: 220 DAG size of output 143 [2018-04-10 16:51:42,526 WARN L151 SmtUtils]: Spent 262ms on a formula simplification. DAG size of input: 228 DAG size of output 151 [2018-04-10 16:51:42,713 WARN L151 SmtUtils]: Spent 148ms on a formula simplification. DAG size of input: 155 DAG size of output 149 [2018-04-10 16:51:42,906 WARN L151 SmtUtils]: Spent 151ms on a formula simplification. DAG size of input: 151 DAG size of output 141 [2018-04-10 16:51:47,192 WARN L151 SmtUtils]: Spent 4221ms on a formula simplification. DAG size of input: 149 DAG size of output 147 [2018-04-10 16:51:47,304 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-10 16:51:47,304 INFO L93 Difference]: Finished difference Result 147 states and 153 transitions. [2018-04-10 16:51:47,305 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2018-04-10 16:51:47,305 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 49 [2018-04-10 16:51:47,305 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-10 16:51:47,305 INFO L225 Difference]: With dead ends: 147 [2018-04-10 16:51:47,305 INFO L226 Difference]: Without dead ends: 147 [2018-04-10 16:51:47,306 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 66 GetRequests, 34 SyntacticMatches, 0 SemanticMatches, 32 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 203 ImplicationChecksByTransitivity, 14.4s TimeCoverageRelationStatistics Valid=244, Invalid=877, Unknown=1, NotChecked=0, Total=1122 [2018-04-10 16:51:47,306 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 147 states. [2018-04-10 16:51:47,307 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 147 to 114. [2018-04-10 16:51:47,307 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 114 states. [2018-04-10 16:51:47,307 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 114 states to 114 states and 121 transitions. [2018-04-10 16:51:47,308 INFO L78 Accepts]: Start accepts. Automaton has 114 states and 121 transitions. Word has length 49 [2018-04-10 16:51:47,308 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-10 16:51:47,308 INFO L459 AbstractCegarLoop]: Abstraction has 114 states and 121 transitions. [2018-04-10 16:51:47,308 INFO L460 AbstractCegarLoop]: Interpolant automaton has 16 states. [2018-04-10 16:51:47,308 INFO L276 IsEmpty]: Start isEmpty. Operand 114 states and 121 transitions. [2018-04-10 16:51:47,308 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2018-04-10 16:51:47,308 INFO L347 BasicCegarLoop]: Found error trace [2018-04-10 16:51:47,309 INFO L355 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-10 16:51:47,309 INFO L408 AbstractCegarLoop]: === Iteration 19 === [mainErr51RequiresViolation, mainErr26RequiresViolation, mainErr54RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr31RequiresViolation, mainErr46RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr52AssertViolationMEMORY_FREE, mainErr15RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr55RequiresViolation, mainErr17RequiresViolation, mainErr42RequiresViolation, mainErr49AssertViolationMEMORY_FREE, mainErr30RequiresViolation, mainErr56AssertViolationMEMORY_FREE, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr44RequiresViolation, mainErr10RequiresViolation, mainErr43RequiresViolation, mainErr4RequiresViolation, mainErr50RequiresViolation, mainErr58EnsuresViolationMEMORY_LEAK, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr48AssertViolationMEMORY_FREE, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr45RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr57AssertViolationMEMORY_FREE, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr9RequiresViolation, mainErr53AssertViolationMEMORY_FREE, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr34RequiresViolation, mainErr47RequiresViolation, mainErr14RequiresViolation, mainErr40RequiresViolation]=== [2018-04-10 16:51:47,309 INFO L82 PathProgramCache]: Analyzing trace with hash -799952615, now seen corresponding path program 1 times [2018-04-10 16:51:47,309 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-04-10 16:51:47,309 INFO L68 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-04-10 16:51:47,310 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-10 16:51:47,310 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-10 16:51:47,310 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-10 16:51:47,319 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-10 16:51:47,320 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-10 16:51:47,325 INFO L431 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown lemma type! [2018-04-10 16:51:47,326 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-04-10 16:51:47,326 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-04-10 16:51:47,326 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-10 16:51:47,353 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-10 16:51:47,356 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-10 16:51:47,374 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select 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 16:51:47,374 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-10 16:51:47,377 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-10 16:51:47,377 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2018-04-10 16:51:47,396 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 16:51:47,397 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 16:51:47,398 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 16:51:47,398 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-10 16:51:47,407 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 16:51:47,407 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-10 16:51:47,419 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-10 16:51:47,419 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:29, output treesize:22 [2018-04-10 16:51:47,435 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 8 [2018-04-10 16:51:47,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, 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 16:51:47,438 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-10 16:51:47,440 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-10 16:51:47,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 11 treesize of output 8 [2018-04-10 16:51:47,453 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 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 16:51:47,453 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-04-10 16:51:47,454 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-10 16:51:47,463 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 16:51:47,463 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 3 variables, input treesize:44, output treesize:37 [2018-04-10 16:51:47,494 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 30 [2018-04-10 16:51:47,496 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 13 [2018-04-10 16:51:47,496 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-10 16:51:47,500 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-10 16:51:47,513 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 52 treesize of output 56 [2018-04-10 16:51:47,515 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 13 [2018-04-10 16:51:47,515 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-04-10 16:51:47,519 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-10 16:51:47,528 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 16:51:47,528 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 3 variables, input treesize:79, output treesize:63 [2018-04-10 16:51:47,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, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 82 treesize of output 72 [2018-04-10 16:51:47,588 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 2 case distinctions, treesize of input 20 treesize of output 31 [2018-04-10 16:51:47,588 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 2 xjuncts. [2018-04-10 16:51:47,600 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-04-10 16:51:47,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, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 81 treesize of output 68 [2018-04-10 16:51:47,632 INFO L682 Elim1Store]: detected equality via solver [2018-04-10 16:51:47,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, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 28 [2018-04-10 16:51:47,632 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-04-10 16:51:47,640 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-10 16:51:47,643 INFO L682 Elim1Store]: detected equality via solver [2018-04-10 16:51:47,644 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 73 treesize of output 65 [2018-04-10 16:51:47,652 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 20 [2018-04-10 16:51:47,652 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2018-04-10 16:51:47,660 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-10 16:51:47,683 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 2 dim-2 vars, End of recursive call: 5 dim-0 vars, and 2 xjuncts. [2018-04-10 16:51:47,684 INFO L202 ElimStorePlain]: Needed 7 recursive calls to eliminate 5 variables, input treesize:98, output treesize:139 [2018-04-10 16:51:47,764 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 16:51:47,766 INFO L682 Elim1Store]: detected equality via solver [2018-04-10 16:51:47,766 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 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 16:51:47,766 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-10 16:51:47,774 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select 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 16:51:47,774 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-04-10 16:51:47,778 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-10 16:51:47,790 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 16:51:47,792 INFO L682 Elim1Store]: detected equality via solver [2018-04-10 16:51:47,793 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 16:51:47,793 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2018-04-10 16:51:47,798 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select 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 16:51:47,798 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2018-04-10 16:51:47,799 INFO L267 ElimStorePlain]: Start of recursive call 5: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-10 16:51:47,807 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 16:51:47,807 INFO L202 ElimStorePlain]: Needed 7 recursive calls to eliminate 6 variables, input treesize:73, output treesize:9 [2018-04-10 16:51:47,846 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 16:51:47,846 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-04-10 16:51:47,846 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [15] total 15 [2018-04-10 16:51:47,847 INFO L442 AbstractCegarLoop]: Interpolant automaton has 16 states [2018-04-10 16:51:47,847 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2018-04-10 16:51:47,847 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=207, Unknown=0, NotChecked=0, Total=240 [2018-04-10 16:51:47,847 INFO L87 Difference]: Start difference. First operand 114 states and 121 transitions. Second operand 16 states. [2018-04-10 16:51:48,497 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-10 16:51:48,497 INFO L93 Difference]: Finished difference Result 153 states and 162 transitions. [2018-04-10 16:51:48,497 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2018-04-10 16:51:48,497 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 49 [2018-04-10 16:51:48,497 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-10 16:51:48,498 INFO L225 Difference]: With dead ends: 153 [2018-04-10 16:51:48,498 INFO L226 Difference]: Without dead ends: 153 [2018-04-10 16:51:48,498 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 61 GetRequests, 34 SyntacticMatches, 0 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 93 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=160, Invalid=652, Unknown=0, NotChecked=0, Total=812 [2018-04-10 16:51:48,498 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 153 states. [2018-04-10 16:51:48,500 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 153 to 116. [2018-04-10 16:51:48,500 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 116 states. [2018-04-10 16:51:48,500 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 116 states to 116 states and 123 transitions. [2018-04-10 16:51:48,500 INFO L78 Accepts]: Start accepts. Automaton has 116 states and 123 transitions. Word has length 49 [2018-04-10 16:51:48,500 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-10 16:51:48,500 INFO L459 AbstractCegarLoop]: Abstraction has 116 states and 123 transitions. [2018-04-10 16:51:48,500 INFO L460 AbstractCegarLoop]: Interpolant automaton has 16 states. [2018-04-10 16:51:48,500 INFO L276 IsEmpty]: Start isEmpty. Operand 116 states and 123 transitions. [2018-04-10 16:51:48,500 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2018-04-10 16:51:48,501 INFO L347 BasicCegarLoop]: Found error trace [2018-04-10 16:51:48,501 INFO L355 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-10 16:51:48,501 INFO L408 AbstractCegarLoop]: === Iteration 20 === [mainErr51RequiresViolation, mainErr26RequiresViolation, mainErr54RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr31RequiresViolation, mainErr46RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr52AssertViolationMEMORY_FREE, mainErr15RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr55RequiresViolation, mainErr17RequiresViolation, mainErr42RequiresViolation, mainErr49AssertViolationMEMORY_FREE, mainErr30RequiresViolation, mainErr56AssertViolationMEMORY_FREE, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr44RequiresViolation, mainErr10RequiresViolation, mainErr43RequiresViolation, mainErr4RequiresViolation, mainErr50RequiresViolation, mainErr58EnsuresViolationMEMORY_LEAK, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr48AssertViolationMEMORY_FREE, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr45RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr57AssertViolationMEMORY_FREE, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr9RequiresViolation, mainErr53AssertViolationMEMORY_FREE, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr34RequiresViolation, mainErr47RequiresViolation, mainErr14RequiresViolation, mainErr40RequiresViolation]=== [2018-04-10 16:51:48,501 INFO L82 PathProgramCache]: Analyzing trace with hash -7091430, now seen corresponding path program 1 times [2018-04-10 16:51:48,501 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-04-10 16:51:48,501 INFO L68 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-04-10 16:51:48,502 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-10 16:51:48,502 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-10 16:51:48,502 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-10 16:51:48,509 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-10 16:51:48,510 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-10 16:51:48,533 INFO L431 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown lemma type! [2018-04-10 16:51:48,534 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-04-10 16:51:48,534 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-04-10 16:51:48,534 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-10 16:51:48,555 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-10 16:51:48,558 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-10 16:51:48,599 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-04-10 16:51:48,599 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-10 16:51:48,604 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select 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 16:51:48,604 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-10 16:51:48,607 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-10 16:51:48,607 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:16, output treesize:14 [2018-04-10 16:51:48,618 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 10 [2018-04-10 16:51:48,619 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 9 [2018-04-10 16:51:48,619 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-10 16:51:48,620 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-10 16:51:48,624 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-04-10 16:51:48,624 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:27, output treesize:23 [2018-04-10 16:51:48,663 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 16:51:48,663 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 16:51:48,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, 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 16:51:48,664 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-10 16:51:48,680 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 15 [2018-04-10 16:51:48,680 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-10 16:51:48,692 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-10 16:51:48,692 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:43, output treesize:36 [2018-04-10 16:51:48,715 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 16:51:48,717 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-04-10 16:51:48,718 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-10 16:51:48,720 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-10 16:51:48,741 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 16:51:48,743 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 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 16:51:48,743 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-04-10 16:51:48,745 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-10 16:51:48,762 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 16:51:48,763 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 4 variables, input treesize:61, output treesize:51 [2018-04-10 16:51:48,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 29 treesize of output 30 [2018-04-10 16:51:48,804 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 13 [2018-04-10 16:51:48,804 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-10 16:51:48,807 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-10 16:51:48,823 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 52 treesize of output 56 [2018-04-10 16:51:48,826 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 13 [2018-04-10 16:51:48,826 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-04-10 16:51:48,831 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-10 16:51:48,842 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 16:51:48,842 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 3 variables, input treesize:93, output treesize:77 [2018-04-10 16:51:48,908 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 39 treesize of output 45 [2018-04-10 16:51:48,911 INFO L682 Elim1Store]: detected equality via solver [2018-04-10 16:51:48,912 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 28 [2018-04-10 16:51:48,912 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-10 16:51:48,921 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-10 16:51:48,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, 1 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 73 treesize of output 68 [2018-04-10 16:51:48,953 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 16 treesize of output 23 [2018-04-10 16:51:48,953 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 2 xjuncts. [2018-04-10 16:51:48,967 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-04-10 16:51:49,009 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 16:51:49,009 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 4 variables, input treesize:113, output treesize:189 [2018-04-10 16:51:49,061 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 32 [2018-04-10 16:51:49,062 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 13 [2018-04-10 16:51:49,062 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-10 16:51:49,065 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-10 16:51:49,080 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 16:51:49,080 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:101, output treesize:93 [2018-04-10 16:51:49,157 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 22 treesize of output 12 [2018-04-10 16:51:49,157 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-10 16:51:49,180 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 16:51:49,181 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:109, output treesize:88 [2018-04-10 16:51:49,269 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 51 treesize of output 42 [2018-04-10 16:51:49,271 INFO L682 Elim1Store]: detected equality via solver [2018-04-10 16:51:49,271 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 32 treesize of output 24 [2018-04-10 16:51:49,272 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-10 16:51:49,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 1 [2018-04-10 16:51:49,280 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-04-10 16:51:49,283 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-10 16:51:49,296 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 25 [2018-04-10 16:51:49,298 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 1 [2018-04-10 16:51:49,298 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2018-04-10 16:51:49,303 INFO L682 Elim1Store]: detected equality via solver [2018-04-10 16:51:49,303 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 16 treesize of output 10 [2018-04-10 16:51:49,303 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2018-04-10 16:51:49,306 INFO L267 ElimStorePlain]: Start of recursive call 5: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-10 16:51:49,314 INFO L267 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 2 dim-2 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2018-04-10 16:51:49,314 INFO L202 ElimStorePlain]: Needed 7 recursive calls to eliminate 6 variables, input treesize:93, output treesize:38 [2018-04-10 16:51:49,389 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 26 [2018-04-10 16:51:49,391 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select 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 16:51:49,391 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-10 16:51:49,397 INFO L682 Elim1Store]: detected equality via solver [2018-04-10 16:51:49,397 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 16:51:49,397 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-04-10 16:51:49,399 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-10 16:51:49,406 INFO L267 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-04-10 16:51:49,406 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 5 variables, input treesize:47, output treesize:10 [2018-04-10 16:51:49,445 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-10 16:51:49,445 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-04-10 16:51:49,445 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [20] total 20 [2018-04-10 16:51:49,445 INFO L442 AbstractCegarLoop]: Interpolant automaton has 20 states [2018-04-10 16:51:49,446 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2018-04-10 16:51:49,446 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=333, Unknown=0, NotChecked=0, Total=380 [2018-04-10 16:51:49,446 INFO L87 Difference]: Start difference. First operand 116 states and 123 transitions. Second operand 20 states. [2018-04-10 16:51:50,957 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-10 16:51:50,957 INFO L93 Difference]: Finished difference Result 219 states and 231 transitions. [2018-04-10 16:51:50,957 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2018-04-10 16:51:50,957 INFO L78 Accepts]: Start accepts. Automaton has 20 states. Word has length 53 [2018-04-10 16:51:50,958 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-10 16:51:50,958 INFO L225 Difference]: With dead ends: 219 [2018-04-10 16:51:50,958 INFO L226 Difference]: Without dead ends: 219 [2018-04-10 16:51:50,959 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 72 GetRequests, 32 SyntacticMatches, 2 SemanticMatches, 38 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 210 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=293, Invalid=1267, Unknown=0, NotChecked=0, Total=1560 [2018-04-10 16:51:50,959 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 219 states. [2018-04-10 16:51:50,961 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 219 to 111. [2018-04-10 16:51:50,961 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 111 states. [2018-04-10 16:51:50,961 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 111 states to 111 states and 117 transitions. [2018-04-10 16:51:50,961 INFO L78 Accepts]: Start accepts. Automaton has 111 states and 117 transitions. Word has length 53 [2018-04-10 16:51:50,962 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-10 16:51:50,962 INFO L459 AbstractCegarLoop]: Abstraction has 111 states and 117 transitions. [2018-04-10 16:51:50,962 INFO L460 AbstractCegarLoop]: Interpolant automaton has 20 states. [2018-04-10 16:51:50,962 INFO L276 IsEmpty]: Start isEmpty. Operand 111 states and 117 transitions. [2018-04-10 16:51:50,962 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2018-04-10 16:51:50,962 INFO L347 BasicCegarLoop]: Found error trace [2018-04-10 16:51:50,962 INFO L355 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-10 16:51:50,963 INFO L408 AbstractCegarLoop]: === Iteration 21 === [mainErr51RequiresViolation, mainErr26RequiresViolation, mainErr54RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr31RequiresViolation, mainErr46RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr52AssertViolationMEMORY_FREE, mainErr15RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr55RequiresViolation, mainErr17RequiresViolation, mainErr42RequiresViolation, mainErr49AssertViolationMEMORY_FREE, mainErr30RequiresViolation, mainErr56AssertViolationMEMORY_FREE, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr44RequiresViolation, mainErr10RequiresViolation, mainErr43RequiresViolation, mainErr4RequiresViolation, mainErr50RequiresViolation, mainErr58EnsuresViolationMEMORY_LEAK, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr48AssertViolationMEMORY_FREE, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr45RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr57AssertViolationMEMORY_FREE, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr9RequiresViolation, mainErr53AssertViolationMEMORY_FREE, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr34RequiresViolation, mainErr47RequiresViolation, mainErr14RequiresViolation, mainErr40RequiresViolation]=== [2018-04-10 16:51:50,963 INFO L82 PathProgramCache]: Analyzing trace with hash -698335515, now seen corresponding path program 1 times [2018-04-10 16:51:50,963 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-04-10 16:51:50,963 INFO L68 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-04-10 16:51:50,964 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-10 16:51:50,964 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-10 16:51:50,965 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-10 16:51:50,975 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-10 16:51:50,976 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-10 16:51:50,982 INFO L431 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown lemma type! [2018-04-10 16:51:50,982 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-04-10 16:51:50,982 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-04-10 16:51:50,983 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-10 16:51:51,022 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-10 16:51:51,026 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-10 16:51:51,054 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-04-10 16:51:51,054 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-10 16:51:51,062 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select 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 16:51:51,062 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-10 16:51:51,068 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-10 16:51:51,069 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:22, output treesize:20 [2018-04-10 16:51:51,081 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 16:51:51,082 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select 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 16:51:51,082 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-10 16:51:51,084 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-10 16:51:51,096 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 16:51:51,096 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:39, output treesize:36 [2018-04-10 16:51:51,137 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 40 treesize of output 47 [2018-04-10 16:51:51,139 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 40 [2018-04-10 16:51:51,139 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-10 16:51:51,150 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-10 16:51:51,157 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 16:51:51,157 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:57, output treesize:49 [2018-04-10 16:51:51,220 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 50 treesize of output 52 [2018-04-10 16:51:51,229 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 2 case distinctions, treesize of input 45 treesize of output 52 [2018-04-10 16:51:51,230 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 2 xjuncts. [2018-04-10 16:51:51,261 INFO L682 Elim1Store]: detected equality via solver [2018-04-10 16:51:51,291 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 4 case distinctions, treesize of input 31 treesize of output 42 [2018-04-10 16:51:51,292 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 4 xjuncts. [2018-04-10 16:51:51,329 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: and 5 xjuncts. [2018-04-10 16:51:51,368 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: 4 dim-0 vars, and 4 xjuncts. [2018-04-10 16:51:51,368 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 3 variables, input treesize:72, output treesize:181 [2018-04-10 16:51:51,494 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 16:51:51,495 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 16:51:51,496 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 16:51:51,496 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 64 treesize of output 80 [2018-04-10 16:51:51,497 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-10 16:51:51,525 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 70 treesize of output 57 [2018-04-10 16:51:51,525 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-10 16:51:51,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 41 treesize of output 36 [2018-04-10 16:51:51,549 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-04-10 16:51:51,573 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 16:51:51,573 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 16:51:51,574 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 36 treesize of output 40 [2018-04-10 16:51:51,574 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-04-10 16:51:51,597 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 16:51:51,597 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 5 variables, input treesize:106, output treesize:92 [2018-04-10 16:51:51,636 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 45 treesize of output 40 [2018-04-10 16:51:51,638 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 16:51:51,638 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-10 16:51:51,645 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-10 16:51:51,675 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 16:51:51,681 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 64 treesize of output 81 [2018-04-10 16:51:51,684 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 72 treesize of output 65 [2018-04-10 16:51:51,684 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-04-10 16:51:51,723 INFO L682 Elim1Store]: detected equality via solver [2018-04-10 16:51:51,723 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 16:51:51,724 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 51 treesize of output 50 [2018-04-10 16:51:51,724 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2018-04-10 16:51:51,753 INFO L267 ElimStorePlain]: Start of recursive call 4: 2 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-04-10 16:51:51,785 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 16:51:51,785 INFO L202 ElimStorePlain]: Needed 6 recursive calls to eliminate 5 variables, input treesize:119, output treesize:132 [2018-04-10 16:51:51,886 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 16:51:51,887 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 13 [2018-04-10 16:51:51,887 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-10 16:51:51,893 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-10 16:51:51,918 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 16:51:51,921 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 16:51:51,922 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 79 treesize of output 87 [2018-04-10 16:51:51,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, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 13 [2018-04-10 16:51:51,924 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-04-10 16:51:51,941 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-10 16:51:51,965 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 2 dim-2 vars, End of recursive call: 3 dim-0 vars, and 2 xjuncts. [2018-04-10 16:51:51,965 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 5 variables, input treesize:136, output treesize:120 [2018-04-10 16:51:52,093 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 16:51:52,095 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 16:51:52,099 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 119 treesize of output 108 [2018-04-10 16:51:52,112 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 28 treesize of output 43 [2018-04-10 16:51:52,112 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 2 xjuncts. [2018-04-10 16:51:52,134 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-04-10 16:51:52,185 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 64 treesize of output 54 [2018-04-10 16:51:52,199 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 2 case distinctions, treesize of input 20 treesize of output 31 [2018-04-10 16:51:52,199 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 2 xjuncts. [2018-04-10 16:51:52,213 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-04-10 16:51:52,273 INFO L267 ElimStorePlain]: Start of recursive call 1: 7 dim-0 vars, 2 dim-2 vars, End of recursive call: 12 dim-0 vars, and 4 xjuncts. [2018-04-10 16:51:52,273 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 9 variables, input treesize:184, output treesize:297 [2018-04-10 16:52:08,725 WARN L148 SmtUtils]: Spent 16035ms on a formula simplification that was a NOOP. DAG size: 100 [2018-04-10 16:52:24,833 WARN L148 SmtUtils]: Spent 16033ms on a formula simplification that was a NOOP. DAG size: 100 [2018-04-10 16:52:44,980 WARN L148 SmtUtils]: Spent 20051ms on a formula simplification that was a NOOP. DAG size: 101 [2018-04-10 16:52:44,990 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 16:52:44,992 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 16:52:44,993 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 117 treesize of output 91 [2018-04-10 16:52:44,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, 0 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 1 case distinctions, treesize of input 15 treesize of output 12 [2018-04-10 16:52:44,999 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 2 xjuncts. [2018-04-10 16:52:45,016 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 16:52:45,016 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 16:52:45,032 INFO L682 Elim1Store]: detected equality via solver [2018-04-10 16:52:45,033 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 30 treesize of output 20 [2018-04-10 16:52:45,033 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-04-10 16:52:45,034 INFO L682 Elim1Store]: detected equality via solver [2018-04-10 16:52:45,034 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 23 [2018-04-10 16:52:45,034 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2018-04-10 16:52:45,053 INFO L267 ElimStorePlain]: Start of recursive call 2: 3 dim-1 vars, End of recursive call: 2 dim-0 vars, and 2 xjuncts. [2018-04-10 16:52:45,129 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 16:52:45,130 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 16:52:45,131 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 98 treesize of output 84 [2018-04-10 16:52:45,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 7 treesize of output 1 [2018-04-10 16:52:45,133 INFO L267 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 1 xjuncts. [2018-04-10 16:52:45,148 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 16:52:45,148 INFO L267 ElimStorePlain]: Start of recursive call 9: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-04-10 16:52:45,161 INFO L682 Elim1Store]: detected equality via solver [2018-04-10 16:52:45,162 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 17 [2018-04-10 16:52:45,162 INFO L267 ElimStorePlain]: Start of recursive call 10: End of recursive call: and 1 xjuncts. [2018-04-10 16:52:45,173 INFO L267 ElimStorePlain]: Start of recursive call 7: 3 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-04-10 16:52:45,236 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 55 treesize of output 48 [2018-04-10 16:52:45,237 INFO L682 Elim1Store]: detected equality via solver [2018-04-10 16:52:45,238 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 16:52:45,238 INFO L267 ElimStorePlain]: Start of recursive call 12: End of recursive call: and 1 xjuncts. [2018-04-10 16:52:45,244 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select 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 16:52:45,245 INFO L267 ElimStorePlain]: Start of recursive call 13: End of recursive call: and 1 xjuncts. [2018-04-10 16:52:45,249 INFO L267 ElimStorePlain]: Start of recursive call 11: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-10 16:52:45,301 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 66 treesize of output 53 [2018-04-10 16:52:45,302 INFO L682 Elim1Store]: detected equality via solver [2018-04-10 16:52:45,302 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 16:52:45,302 INFO L267 ElimStorePlain]: Start of recursive call 15: End of recursive call: and 1 xjuncts. [2018-04-10 16:52:45,313 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 1 case distinctions, treesize of input 13 treesize of output 10 [2018-04-10 16:52:45,313 INFO L267 ElimStorePlain]: Start of recursive call 16: End of recursive call: and 2 xjuncts. [2018-04-10 16:52:45,319 INFO L267 ElimStorePlain]: Start of recursive call 14: 2 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-04-10 16:52:45,376 INFO L267 ElimStorePlain]: Start of recursive call 1: 20 dim-0 vars, 4 dim-2 vars, End of recursive call: 8 dim-0 vars, and 6 xjuncts. [2018-04-10 16:52:45,377 INFO L202 ElimStorePlain]: Needed 16 recursive calls to eliminate 24 variables, input treesize:337, output treesize:133 [2018-04-10 16:52:45,507 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 16:52:45,507 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-04-10 16:52:45,507 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [23] total 23 [2018-04-10 16:52:45,507 INFO L442 AbstractCegarLoop]: Interpolant automaton has 24 states [2018-04-10 16:52:45,507 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2018-04-10 16:52:45,507 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=78, Invalid=474, Unknown=0, NotChecked=0, Total=552 [2018-04-10 16:52:45,508 INFO L87 Difference]: Start difference. First operand 111 states and 117 transitions. Second operand 24 states. [2018-04-10 16:53:18,876 WARN L151 SmtUtils]: Spent 32096ms on a formula simplification. DAG size of input: 113 DAG size of output 106 [2018-04-10 16:53:43,079 WARN L151 SmtUtils]: Spent 24110ms on a formula simplification. DAG size of input: 190 DAG size of output 108 [2018-04-10 16:53:57,392 WARN L151 SmtUtils]: Spent 14096ms on a formula simplification. DAG size of input: 200 DAG size of output 111 [2018-04-10 16:53:57,617 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-10 16:53:57,618 INFO L93 Difference]: Finished difference Result 190 states and 198 transitions. [2018-04-10 16:53:57,618 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2018-04-10 16:53:57,618 INFO L78 Accepts]: Start accepts. Automaton has 24 states. Word has length 58 [2018-04-10 16:53:57,618 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-10 16:53:57,618 INFO L225 Difference]: With dead ends: 190 [2018-04-10 16:53:57,618 INFO L226 Difference]: Without dead ends: 190 [2018-04-10 16:53:57,619 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 81 GetRequests, 35 SyntacticMatches, 0 SemanticMatches, 46 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 492 ImplicationChecksByTransitivity, 124.5s TimeCoverageRelationStatistics Valid=319, Invalid=1937, Unknown=0, NotChecked=0, Total=2256 [2018-04-10 16:53:57,619 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 190 states. [2018-04-10 16:53:57,620 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 190 to 145. [2018-04-10 16:53:57,620 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 145 states. [2018-04-10 16:53:57,621 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 145 states to 145 states and 153 transitions. [2018-04-10 16:53:57,621 INFO L78 Accepts]: Start accepts. Automaton has 145 states and 153 transitions. Word has length 58 [2018-04-10 16:53:57,621 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-10 16:53:57,621 INFO L459 AbstractCegarLoop]: Abstraction has 145 states and 153 transitions. [2018-04-10 16:53:57,621 INFO L460 AbstractCegarLoop]: Interpolant automaton has 24 states. [2018-04-10 16:53:57,621 INFO L276 IsEmpty]: Start isEmpty. Operand 145 states and 153 transitions. [2018-04-10 16:53:57,621 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2018-04-10 16:53:57,621 INFO L347 BasicCegarLoop]: Found error trace [2018-04-10 16:53:57,622 INFO L355 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-10 16:53:57,622 INFO L408 AbstractCegarLoop]: === Iteration 22 === [mainErr51RequiresViolation, mainErr26RequiresViolation, mainErr54RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr31RequiresViolation, mainErr46RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr52AssertViolationMEMORY_FREE, mainErr15RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr55RequiresViolation, mainErr17RequiresViolation, mainErr42RequiresViolation, mainErr49AssertViolationMEMORY_FREE, mainErr30RequiresViolation, mainErr56AssertViolationMEMORY_FREE, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr44RequiresViolation, mainErr10RequiresViolation, mainErr43RequiresViolation, mainErr4RequiresViolation, mainErr50RequiresViolation, mainErr58EnsuresViolationMEMORY_LEAK, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr48AssertViolationMEMORY_FREE, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr45RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr57AssertViolationMEMORY_FREE, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr9RequiresViolation, mainErr53AssertViolationMEMORY_FREE, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr34RequiresViolation, mainErr47RequiresViolation, mainErr14RequiresViolation, mainErr40RequiresViolation]=== [2018-04-10 16:53:57,622 INFO L82 PathProgramCache]: Analyzing trace with hash -698335514, now seen corresponding path program 1 times [2018-04-10 16:53:57,622 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-04-10 16:53:57,622 INFO L68 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-04-10 16:53:57,623 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-10 16:53:57,623 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-10 16:53:57,623 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-10 16:53:57,634 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-10 16:53:57,635 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-10 16:53:57,641 INFO L431 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown lemma type! [2018-04-10 16:53:57,641 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-04-10 16:53:57,641 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-04-10 16:53:57,642 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-10 16:53:57,692 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-10 16:53:57,696 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-10 16:53:57,709 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select 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 16:53:57,709 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-10 16:53:57,712 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-10 16:53:57,713 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2018-04-10 16:53:57,732 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 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 16:53:57,732 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-10 16:53:57,746 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 16:53:57,747 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 16:53:57,748 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 24 [2018-04-10 16:53:57,748 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-10 16:53:57,760 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-10 16:53:57,761 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:39, output treesize:36 [2018-04-10 16:53:57,782 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 16:53:57,783 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-04-10 16:53:57,784 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-10 16:53:57,785 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-10 16:53:57,800 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 16:53:57,802 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 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 16:53:57,802 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-04-10 16:53:57,803 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-10 16:53:57,816 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 16:53:57,817 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 3 variables, input treesize:58, output treesize:59 [2018-04-10 16:53:57,864 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 77 treesize of output 81 [2018-04-10 16:53:57,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, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 13 [2018-04-10 16:53:57,866 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-10 16:53:57,875 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-10 16:53:57,895 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 37 [2018-04-10 16:53:57,897 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 13 [2018-04-10 16:53:57,897 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-04-10 16:53:57,901 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-10 16:53:57,917 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 16:53:57,917 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 3 variables, input treesize:108, output treesize:92 [2018-04-10 16:53:57,978 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 46 treesize of output 52 [2018-04-10 16:53:57,981 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 16:53:57,981 INFO L682 Elim1Store]: detected equality via solver [2018-04-10 16:53:57,981 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 44 [2018-04-10 16:53:57,982 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-10 16:53:57,990 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-10 16:53:58,014 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 16:53:58,015 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 90 treesize of output 94 [2018-04-10 16:53:58,017 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 16:53:58,018 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 25 treesize of output 31 [2018-04-10 16:53:58,019 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-04-10 16:53:58,030 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-10 16:53:58,055 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 16:53:58,055 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 4 variables, input treesize:128, output treesize:112 [2018-04-10 16:53:58,080 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 16:53:58,081 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 23 [2018-04-10 16:53:58,081 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-10 16:53:58,104 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 16:53:58,105 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 16:53:58,105 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 16:53:58,106 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 16:53:58,106 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 5 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 28 [2018-04-10 16:53:58,107 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-10 16:53:58,127 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2018-04-10 16:53:58,127 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:126, output treesize:118 [2018-04-10 16:53:58,153 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 16:53:58,154 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 16:53:58,156 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 16:53:58,156 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 4 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 84 treesize of output 96 [2018-04-10 16:53:58,159 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 16:53:58,171 INFO L477 Elim1Store]: Elim1 applied some preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 2 new quantified variables, introduced 4 case distinctions, treesize of input 36 treesize of output 58 [2018-04-10 16:53:58,172 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 16:53:58,194 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-10 16:53:58,219 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 16:53:58,222 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 57 treesize of output 75 [2018-04-10 16:53:58,225 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 16:53:58,225 INFO L682 Elim1Store]: detected equality via solver [2018-04-10 16:53:58,227 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 25 treesize of output 34 [2018-04-10 16:53:58,227 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-04-10 16:53:58,236 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-10 16:53:58,257 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 16:53:58,257 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 6 variables, input treesize:140, output treesize:138 [2018-04-10 16:53:58,309 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 16:53:58,315 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 85 treesize of output 118 [2018-04-10 16:53:58,317 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 13 [2018-04-10 16:53:58,317 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-10 16:53:58,328 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-10 16:53:58,353 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 16:53:58,356 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 16:53:58,358 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 160 treesize of output 176 [2018-04-10 16:53:58,360 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 13 [2018-04-10 16:53:58,360 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-04-10 16:53:58,379 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-10 16:53:58,409 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 16:53:58,410 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 5 variables, input treesize:180, output treesize:164 [2018-04-10 16:53:58,507 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 16:53:58,513 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 131 treesize of output 166 [2018-04-10 16:53:58,516 INFO L682 Elim1Store]: detected equality via solver [2018-04-10 16:53:58,516 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 36 [2018-04-10 16:53:58,516 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-10 16:53:58,530 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-10 16:53:58,565 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 16:53:58,570 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 16:53:58,571 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 16:53:58,574 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 238 treesize of output 212 [2018-04-10 16:53:58,579 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 16:53:58,585 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 67 [2018-04-10 16:53:58,585 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 2 xjuncts. [2018-04-10 16:53:58,620 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-04-10 16:53:58,677 INFO L267 ElimStorePlain]: Start of recursive call 1: 5 dim-0 vars, 2 dim-2 vars, End of recursive call: 9 dim-0 vars, and 2 xjuncts. [2018-04-10 16:53:58,678 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 7 variables, input treesize:265, output treesize:389 [2018-04-10 16:53:58,904 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 16:53:58,904 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 16:53:58,905 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 16:53:58,906 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 16:53:58,906 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 16:53:58,907 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 5 new quantified variables, introduced 0 case distinctions, treesize of input 167 treesize of output 147 [2018-04-10 16:53:58,912 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 16:53:58,913 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-10 16:53:58,932 INFO L682 Elim1Store]: detected equality via solver [2018-04-10 16:53:58,933 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 62 treesize of output 46 [2018-04-10 16:53:58,933 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-04-10 16:53:58,951 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 69 treesize of output 48 [2018-04-10 16:53:58,952 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 16:53:58,968 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 16:53:58,993 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 59 treesize of output 55 [2018-04-10 16:53:58,995 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 16:53:58,996 INFO L682 Elim1Store]: detected equality via solver [2018-04-10 16:53:58,996 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 13 [2018-04-10 16:53:58,996 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2018-04-10 16:53:59,007 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 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 16:53:59,007 INFO L267 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 1 xjuncts. [2018-04-10 16:53:59,013 INFO L682 Elim1Store]: detected equality via solver [2018-04-10 16:53:59,013 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 13 [2018-04-10 16:53:59,013 INFO L267 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 1 xjuncts. [2018-04-10 16:53:59,017 INFO L267 ElimStorePlain]: Start of recursive call 6: 3 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-10 16:53:59,031 INFO L267 ElimStorePlain]: Start of recursive call 1: 6 dim-0 vars, 2 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-04-10 16:53:59,031 INFO L202 ElimStorePlain]: Needed 9 recursive calls to eliminate 8 variables, input treesize:192, output treesize:25 [2018-04-10 16:53:59,108 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 16:53:59,108 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-04-10 16:53:59,108 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [23] total 23 [2018-04-10 16:53:59,108 INFO L442 AbstractCegarLoop]: Interpolant automaton has 24 states [2018-04-10 16:53:59,108 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2018-04-10 16:53:59,108 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=69, Invalid=483, Unknown=0, NotChecked=0, Total=552 [2018-04-10 16:53:59,108 INFO L87 Difference]: Start difference. First operand 145 states and 153 transitions. Second operand 24 states. [2018-04-10 16:54:00,736 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-10 16:54:00,736 INFO L93 Difference]: Finished difference Result 197 states and 207 transitions. [2018-04-10 16:54:00,737 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2018-04-10 16:54:00,737 INFO L78 Accepts]: Start accepts. Automaton has 24 states. Word has length 58 [2018-04-10 16:54:00,737 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-10 16:54:00,738 INFO L225 Difference]: With dead ends: 197 [2018-04-10 16:54:00,738 INFO L226 Difference]: Without dead ends: 197 [2018-04-10 16:54:00,738 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 83 GetRequests, 35 SyntacticMatches, 0 SemanticMatches, 48 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 569 ImplicationChecksByTransitivity, 1.5s TimeCoverageRelationStatistics Valid=343, Invalid=2107, Unknown=0, NotChecked=0, Total=2450 [2018-04-10 16:54:00,738 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 197 states. [2018-04-10 16:54:00,739 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 197 to 147. [2018-04-10 16:54:00,739 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 147 states. [2018-04-10 16:54:00,740 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 147 states to 147 states and 155 transitions. [2018-04-10 16:54:00,740 INFO L78 Accepts]: Start accepts. Automaton has 147 states and 155 transitions. Word has length 58 [2018-04-10 16:54:00,740 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-10 16:54:00,740 INFO L459 AbstractCegarLoop]: Abstraction has 147 states and 155 transitions. [2018-04-10 16:54:00,740 INFO L460 AbstractCegarLoop]: Interpolant automaton has 24 states. [2018-04-10 16:54:00,740 INFO L276 IsEmpty]: Start isEmpty. Operand 147 states and 155 transitions. [2018-04-10 16:54:00,740 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2018-04-10 16:54:00,740 INFO L347 BasicCegarLoop]: Found error trace [2018-04-10 16:54:00,740 INFO L355 BasicCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-10 16:54:00,741 INFO L408 AbstractCegarLoop]: === Iteration 23 === [mainErr51RequiresViolation, mainErr26RequiresViolation, mainErr54RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr31RequiresViolation, mainErr46RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr52AssertViolationMEMORY_FREE, mainErr15RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr55RequiresViolation, mainErr17RequiresViolation, mainErr42RequiresViolation, mainErr49AssertViolationMEMORY_FREE, mainErr30RequiresViolation, mainErr56AssertViolationMEMORY_FREE, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr44RequiresViolation, mainErr10RequiresViolation, mainErr43RequiresViolation, mainErr4RequiresViolation, mainErr50RequiresViolation, mainErr58EnsuresViolationMEMORY_LEAK, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr48AssertViolationMEMORY_FREE, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr45RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr57AssertViolationMEMORY_FREE, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr9RequiresViolation, mainErr53AssertViolationMEMORY_FREE, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr34RequiresViolation, mainErr47RequiresViolation, mainErr14RequiresViolation, mainErr40RequiresViolation]=== [2018-04-10 16:54:00,741 INFO L82 PathProgramCache]: Analyzing trace with hash -1513085733, now seen corresponding path program 2 times [2018-04-10 16:54:00,741 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-04-10 16:54:00,741 INFO L68 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-04-10 16:54:00,741 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-10 16:54:00,741 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-10 16:54:00,741 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-10 16:54:00,746 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-10 16:54:00,746 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-10 16:54:00,753 INFO L431 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown lemma type! [2018-04-10 16:54:00,753 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-04-10 16:54:00,753 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-04-10 16:54:00,754 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-04-10 16:54:00,778 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-04-10 16:54:00,779 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-04-10 16:54:00,781 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-10 16:54:00,791 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-04-10 16:54:00,791 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-10 16:54:00,794 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-10 16:54:00,795 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2018-04-10 16:54:00,814 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-04-10 16:54:00,814 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-10 16:54:00,825 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 16:54:00,826 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 16:54:00,826 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 12 [2018-04-10 16:54:00,827 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-10 16:54:00,835 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-10 16:54:00,835 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:29, output treesize:22 [2018-04-10 16:54:00,850 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 16:54:00,851 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 16:54:00,851 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-10 16:54:00,853 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-10 16:54:00,863 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 16:54:00,864 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 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 16:54:00,865 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-04-10 16:54:00,866 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-10 16:54:00,874 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 16:54:00,874 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 3 variables, input treesize:44, output treesize:37 [2018-04-10 16:54:00,902 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 60 treesize of output 64 [2018-04-10 16:54:00,904 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 13 [2018-04-10 16:54:00,904 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-10 16:54:00,908 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-10 16:54:00,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, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 30 [2018-04-10 16:54:00,921 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 13 [2018-04-10 16:54:00,921 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-04-10 16:54:00,923 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-10 16:54:00,931 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 16:54:00,931 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 3 variables, input treesize:79, output treesize:63 [2018-04-10 16:54:00,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, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 82 treesize of output 72 [2018-04-10 16:54:00,986 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 2 case distinctions, treesize of input 20 treesize of output 31 [2018-04-10 16:54:00,987 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 2 xjuncts. [2018-04-10 16:54:00,999 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-04-10 16:54:01,028 INFO L682 Elim1Store]: detected equality via solver [2018-04-10 16:54:01,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, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 80 treesize of output 72 [2018-04-10 16:54:01,031 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 20 [2018-04-10 16:54:01,031 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-04-10 16:54:01,039 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-10 16:54:01,042 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 88 treesize of output 75 [2018-04-10 16:54:01,044 INFO L682 Elim1Store]: detected equality via solver [2018-04-10 16:54:01,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, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 28 [2018-04-10 16:54:01,045 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2018-04-10 16:54:01,054 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-10 16:54:01,080 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 2 dim-2 vars, End of recursive call: 5 dim-0 vars, and 2 xjuncts. [2018-04-10 16:54:01,080 INFO L202 ElimStorePlain]: Needed 7 recursive calls to eliminate 5 variables, input treesize:108, output treesize:159 [2018-04-10 16:54:01,189 INFO L682 Elim1Store]: detected equality via solver [2018-04-10 16:54:01,190 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 11 [2018-04-10 16:54:01,190 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-10 16:54:01,213 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2018-04-10 16:54:01,213 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:84, output treesize:64 [2018-04-10 16:54:01,242 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 61 treesize of output 48 [2018-04-10 16:54:01,244 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 29 treesize of output 23 [2018-04-10 16:54:01,244 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 16:54:01,250 INFO L682 Elim1Store]: detected equality via solver [2018-04-10 16:54:01,250 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 16:54:01,250 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-04-10 16:54:01,255 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 16:54:01,265 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 27 [2018-04-10 16:54:01,267 INFO L682 Elim1Store]: detected equality via solver [2018-04-10 16:54:01,267 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 18 treesize of output 15 [2018-04-10 16:54:01,267 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 16:54:01,273 INFO L682 Elim1Store]: detected equality via solver [2018-04-10 16:54:01,273 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 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 16:54:01,273 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2018-04-10 16:54:01,276 INFO L267 ElimStorePlain]: Start of recursive call 5: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-10 16:54:01,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 16:54:01,282 INFO L202 ElimStorePlain]: Needed 7 recursive calls to eliminate 5 variables, input treesize:91, output treesize:7 [2018-04-10 16:54:01,309 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 9 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-10 16:54:01,309 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-04-10 16:54:01,309 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [17] total 17 [2018-04-10 16:54:01,309 INFO L442 AbstractCegarLoop]: Interpolant automaton has 17 states [2018-04-10 16:54:01,309 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2018-04-10 16:54:01,309 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=237, Unknown=0, NotChecked=0, Total=272 [2018-04-10 16:54:01,309 INFO L87 Difference]: Start difference. First operand 147 states and 155 transitions. Second operand 17 states. [2018-04-10 16:54:02,285 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-10 16:54:02,285 INFO L93 Difference]: Finished difference Result 162 states and 169 transitions. [2018-04-10 16:54:02,285 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2018-04-10 16:54:02,285 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 59 [2018-04-10 16:54:02,285 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-10 16:54:02,286 INFO L225 Difference]: With dead ends: 162 [2018-04-10 16:54:02,286 INFO L226 Difference]: Without dead ends: 137 [2018-04-10 16:54:02,286 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 71 GetRequests, 43 SyntacticMatches, 0 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 86 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=162, Invalid=708, Unknown=0, NotChecked=0, Total=870 [2018-04-10 16:54:02,286 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 137 states. [2018-04-10 16:54:02,287 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 137 to 129. [2018-04-10 16:54:02,287 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 129 states. [2018-04-10 16:54:02,287 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 129 states to 129 states and 136 transitions. [2018-04-10 16:54:02,287 INFO L78 Accepts]: Start accepts. Automaton has 129 states and 136 transitions. Word has length 59 [2018-04-10 16:54:02,288 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-10 16:54:02,288 INFO L459 AbstractCegarLoop]: Abstraction has 129 states and 136 transitions. [2018-04-10 16:54:02,288 INFO L460 AbstractCegarLoop]: Interpolant automaton has 17 states. [2018-04-10 16:54:02,288 INFO L276 IsEmpty]: Start isEmpty. Operand 129 states and 136 transitions. [2018-04-10 16:54:02,288 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 63 [2018-04-10 16:54:02,288 INFO L347 BasicCegarLoop]: Found error trace [2018-04-10 16:54:02,288 INFO L355 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-10 16:54:02,288 INFO L408 AbstractCegarLoop]: === Iteration 24 === [mainErr51RequiresViolation, mainErr26RequiresViolation, mainErr54RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr31RequiresViolation, mainErr46RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr52AssertViolationMEMORY_FREE, mainErr15RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr55RequiresViolation, mainErr17RequiresViolation, mainErr42RequiresViolation, mainErr49AssertViolationMEMORY_FREE, mainErr30RequiresViolation, mainErr56AssertViolationMEMORY_FREE, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr44RequiresViolation, mainErr10RequiresViolation, mainErr43RequiresViolation, mainErr4RequiresViolation, mainErr50RequiresViolation, mainErr58EnsuresViolationMEMORY_LEAK, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr48AssertViolationMEMORY_FREE, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr45RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr57AssertViolationMEMORY_FREE, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr9RequiresViolation, mainErr53AssertViolationMEMORY_FREE, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr34RequiresViolation, mainErr47RequiresViolation, mainErr14RequiresViolation, mainErr40RequiresViolation]=== [2018-04-10 16:54:02,288 INFO L82 PathProgramCache]: Analyzing trace with hash 484223591, now seen corresponding path program 1 times [2018-04-10 16:54:02,288 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-04-10 16:54:02,288 INFO L68 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-04-10 16:54:02,289 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-10 16:54:02,289 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-04-10 16:54:02,289 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-10 16:54:02,300 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-10 16:54:02,301 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-10 16:54:02,305 INFO L431 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown lemma type! [2018-04-10 16:54:02,306 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-04-10 16:54:02,306 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-04-10 16:54:02,306 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-10 16:54:02,373 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-10 16:54:02,377 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-10 16:54:02,379 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select 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 16:54:02,379 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-10 16:54:02,382 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-10 16:54:02,382 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2018-04-10 16:54:02,401 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select 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 16:54:02,401 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-10 16:54:02,413 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 16:54:02,414 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 16:54:02,414 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 12 [2018-04-10 16:54:02,415 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-10 16:54:02,423 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-10 16:54:02,423 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:29, output treesize:22 [2018-04-10 16:54:02,435 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 8 [2018-04-10 16:54:02,436 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-04-10 16:54:02,436 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-10 16:54:02,438 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-10 16:54:02,451 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 16:54:02,452 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 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 16:54:02,453 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-04-10 16:54:02,454 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-10 16:54:02,464 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 16:54:02,465 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 4 variables, input treesize:52, output treesize:42 [2018-04-10 16:54:02,480 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 16:54:02,483 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable 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 16:54:02,483 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-10 16:54:02,484 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-10 16:54:02,493 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-04-10 16:54:02,493 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:56, output treesize:45 [2018-04-10 16:54:02,513 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 39 treesize of output 43 [2018-04-10 16:54:02,516 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 13 [2018-04-10 16:54:02,516 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-10 16:54:02,520 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-10 16:54:02,531 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 16:54:02,531 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:59, output treesize:51 [2018-04-10 16:54:02,582 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 49 treesize of output 44 [2018-04-10 16:54:02,590 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 2 case distinctions, treesize of input 16 treesize of output 23 [2018-04-10 16:54:02,590 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 2 xjuncts. [2018-04-10 16:54:02,602 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-04-10 16:54:02,627 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 16:54:02,627 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:74, output treesize:124 [2018-04-10 16:54:02,742 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 16:54:02,743 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 16:54:02,744 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 16:54:02,744 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 16:54:02,745 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 51 [2018-04-10 16:54:02,745 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-10 16:54:02,771 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 23 treesize of output 37 [2018-04-10 16:54:02,771 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-10 16:54:02,795 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2018-04-10 16:54:02,795 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:90, output treesize:105 [2018-04-10 16:54:02,836 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 16:54:02,838 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 16:54:02,839 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 4 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 83 treesize of output 87 [2018-04-10 16:54:02,841 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 16:54:02,843 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 39 treesize of output 42 [2018-04-10 16:54:02,843 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-10 16:54:02,856 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-10 16:54:02,877 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 16:54:02,877 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:121, output treesize:102 [2018-04-10 16:54:02,945 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 16:54:02,946 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 16:54:02,950 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 103 treesize of output 111 [2018-04-10 16:54:02,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, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 13 [2018-04-10 16:54:02,952 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-10 16:54:02,966 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-10 16:54:02,987 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 16:54:02,987 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:123, output treesize:115 [2018-04-10 16:54:03,122 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 16:54:03,125 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 16:54:03,127 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 160 treesize of output 137 [2018-04-10 16:54:03,135 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 28 treesize of output 43 [2018-04-10 16:54:03,136 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 2 xjuncts. [2018-04-10 16:54:03,158 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-04-10 16:54:03,206 INFO L267 ElimStorePlain]: Start of recursive call 1: 5 dim-0 vars, 1 dim-2 vars, End of recursive call: 9 dim-0 vars, and 2 xjuncts. [2018-04-10 16:54:03,207 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 6 variables, input treesize:175, output treesize:306 [2018-04-10 16:54:03,451 INFO L682 Elim1Store]: detected equality via solver [2018-04-10 16:54:03,452 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 41 treesize of output 26 [2018-04-10 16:54:03,452 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-10 16:54:03,474 INFO L267 ElimStorePlain]: Start of recursive call 1: 6 dim-0 vars, 1 dim-1 vars, End of recursive call: 5 dim-0 vars, and 1 xjuncts. [2018-04-10 16:54:03,474 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 7 variables, input treesize:159, output treesize:119 [2018-04-10 16:54:03,529 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 16:54:03,530 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 16:54:03,532 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 5 new quantified variables, introduced 0 case distinctions, treesize of input 105 treesize of output 75 [2018-04-10 16:54:03,533 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 1 [2018-04-10 16:54:03,533 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-10 16:54:03,542 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 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 16:54:03,542 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 16:54:03,550 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 16:54:03,551 INFO L682 Elim1Store]: detected equality via solver [2018-04-10 16:54:03,551 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 34 [2018-04-10 16:54:03,551 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-04-10 16:54:03,558 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 16:54:03,569 INFO L267 ElimStorePlain]: Start of recursive call 1: 6 dim-0 vars, 1 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2018-04-10 16:54:03,569 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 7 variables, input treesize:126, output treesize:28 [2018-04-10 16:54:03,642 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 6 refuted. 1 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-10 16:54:03,642 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-04-10 16:54:03,643 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [26] total 26 [2018-04-10 16:54:03,643 INFO L442 AbstractCegarLoop]: Interpolant automaton has 27 states [2018-04-10 16:54:03,643 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. [2018-04-10 16:54:03,643 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=89, Invalid=612, Unknown=1, NotChecked=0, Total=702 [2018-04-10 16:54:03,643 INFO L87 Difference]: Start difference. First operand 129 states and 136 transitions. Second operand 27 states. [2018-04-10 16:54:05,391 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-10 16:54:05,391 INFO L93 Difference]: Finished difference Result 175 states and 183 transitions. [2018-04-10 16:54:05,391 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2018-04-10 16:54:05,392 INFO L78 Accepts]: Start accepts. Automaton has 27 states. Word has length 62 [2018-04-10 16:54:05,392 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-10 16:54:05,392 INFO L225 Difference]: With dead ends: 175 [2018-04-10 16:54:05,392 INFO L226 Difference]: Without dead ends: 175 [2018-04-10 16:54:05,393 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 87 GetRequests, 36 SyntacticMatches, 1 SemanticMatches, 50 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 597 ImplicationChecksByTransitivity, 1.6s TimeCoverageRelationStatistics Valid=354, Invalid=2295, Unknown=3, NotChecked=0, Total=2652 [2018-04-10 16:54:05,393 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 175 states. [2018-04-10 16:54:05,394 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 175 to 131. [2018-04-10 16:54:05,394 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 131 states. [2018-04-10 16:54:05,394 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 131 states to 131 states and 139 transitions. [2018-04-10 16:54:05,394 INFO L78 Accepts]: Start accepts. Automaton has 131 states and 139 transitions. Word has length 62 [2018-04-10 16:54:05,394 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-10 16:54:05,394 INFO L459 AbstractCegarLoop]: Abstraction has 131 states and 139 transitions. [2018-04-10 16:54:05,394 INFO L460 AbstractCegarLoop]: Interpolant automaton has 27 states. [2018-04-10 16:54:05,394 INFO L276 IsEmpty]: Start isEmpty. Operand 131 states and 139 transitions. [2018-04-10 16:54:05,395 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 63 [2018-04-10 16:54:05,395 INFO L347 BasicCegarLoop]: Found error trace [2018-04-10 16:54:05,395 INFO L355 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-10 16:54:05,395 INFO L408 AbstractCegarLoop]: === Iteration 25 === [mainErr51RequiresViolation, mainErr26RequiresViolation, mainErr54RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr31RequiresViolation, mainErr46RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr52AssertViolationMEMORY_FREE, mainErr15RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr55RequiresViolation, mainErr17RequiresViolation, mainErr42RequiresViolation, mainErr49AssertViolationMEMORY_FREE, mainErr30RequiresViolation, mainErr56AssertViolationMEMORY_FREE, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr44RequiresViolation, mainErr10RequiresViolation, mainErr43RequiresViolation, mainErr4RequiresViolation, mainErr50RequiresViolation, mainErr58EnsuresViolationMEMORY_LEAK, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr48AssertViolationMEMORY_FREE, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr45RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr57AssertViolationMEMORY_FREE, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr9RequiresViolation, mainErr53AssertViolationMEMORY_FREE, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr34RequiresViolation, mainErr47RequiresViolation, mainErr14RequiresViolation, mainErr40RequiresViolation]=== [2018-04-10 16:54:05,395 INFO L82 PathProgramCache]: Analyzing trace with hash 484223592, now seen corresponding path program 1 times [2018-04-10 16:54:05,395 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-04-10 16:54:05,395 INFO L68 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-04-10 16:54:05,396 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-10 16:54:05,396 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-10 16:54:05,396 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-10 16:54:05,415 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-10 16:54:05,416 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-10 16:54:05,424 INFO L431 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown lemma type! [2018-04-10 16:54:05,424 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-04-10 16:54:05,424 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-04-10 16:54:05,425 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-10 16:54:05,485 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-10 16:54:05,490 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-10 16:54:05,493 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select 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 16:54:05,493 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-10 16:54:05,497 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-10 16:54:05,497 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2018-04-10 16:54:05,525 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 16:54:05,526 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 16:54:05,526 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 12 [2018-04-10 16:54:05,527 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-10 16:54:05,532 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-10 16:54:05,533 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:23, output treesize:17 [2018-04-10 16:54:05,545 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 16:54:05,547 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select 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 16:54:05,547 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-10 16:54:05,549 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-10 16:54:05,562 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 16:54:05,564 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 16:54:05,564 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-04-10 16:54:05,566 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-10 16:54:05,576 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 16:54:05,576 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 3 variables, input treesize:44, output treesize:33 [2018-04-10 16:54:05,614 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 30 [2018-04-10 16:54:05,616 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 13 [2018-04-10 16:54:05,616 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-10 16:54:05,621 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-10 16:54:05,640 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 43 treesize of output 47 [2018-04-10 16:54:05,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 14 treesize of output 13 [2018-04-10 16:54:05,642 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-04-10 16:54:05,649 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-10 16:54:05,663 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 16:54:05,663 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 3 variables, input treesize:75, output treesize:59 [2018-04-10 16:54:05,741 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 53 treesize of output 48 [2018-04-10 16:54:05,749 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 16 treesize of output 23 [2018-04-10 16:54:05,749 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 2 xjuncts. [2018-04-10 16:54:05,762 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-04-10 16:54:05,795 INFO L682 Elim1Store]: detected equality via solver [2018-04-10 16:54:05,797 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 66 treesize of output 70 [2018-04-10 16:54:05,799 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 20 [2018-04-10 16:54:05,799 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-04-10 16:54:05,808 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-10 16:54:05,814 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 70 treesize of output 81 [2018-04-10 16:54:05,816 INFO L682 Elim1Store]: detected equality via solver [2018-04-10 16:54:05,817 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 28 [2018-04-10 16:54:05,817 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2018-04-10 16:54:05,828 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-10 16:54:05,856 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 16:54:05,857 INFO L202 ElimStorePlain]: Needed 7 recursive calls to eliminate 4 variables, input treesize:100, output treesize:175 [2018-04-10 16:54:05,907 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 16:54:05,908 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 16:54:05,908 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 16:54:05,909 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 16:54:05,909 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 20 [2018-04-10 16:54:05,909 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-10 16:54:05,925 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 16:54:05,925 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-10 16:54:05,938 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 16:54:05,938 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:84, output treesize:72 [2018-04-10 16:54:05,960 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 16:54:05,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, 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 16:54:05,963 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 16 [2018-04-10 16:54:05,963 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-10 16:54:05,967 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-10 16:54:05,982 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 16:54:05,983 INFO L682 Elim1Store]: detected equality via solver [2018-04-10 16:54:05,985 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 37 treesize of output 43 [2018-04-10 16:54:05,986 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 16:54:05,986 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-04-10 16:54:05,990 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-10 16:54:06,001 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 16:54:06,001 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 4 variables, input treesize:91, output treesize:70 [2018-04-10 16:54:06,041 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 16:54:06,043 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 16:54:06,046 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 86 treesize of output 94 [2018-04-10 16:54:06,048 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 13 [2018-04-10 16:54:06,048 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-10 16:54:06,057 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-10 16:54:06,072 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 16:54:06,077 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 47 treesize of output 68 [2018-04-10 16:54:06,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 14 treesize of output 13 [2018-04-10 16:54:06,078 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-04-10 16:54:06,085 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-10 16:54:06,098 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 16:54:06,099 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 4 variables, input treesize:112, output treesize:96 [2018-04-10 16:54:06,172 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 16:54:06,174 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 16:54:06,178 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 158 treesize of output 131 [2018-04-10 16:54:06,187 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 28 treesize of output 43 [2018-04-10 16:54:06,187 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 2 xjuncts. [2018-04-10 16:54:06,211 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-04-10 16:54:06,248 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 16:54:06,251 INFO L682 Elim1Store]: detected equality via solver [2018-04-10 16:54:06,252 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 144 treesize of output 136 [2018-04-10 16:54:06,254 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 29 treesize of output 24 [2018-04-10 16:54:06,254 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-04-10 16:54:06,266 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-10 16:54:06,268 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 16:54:06,272 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 160 treesize of output 147 [2018-04-10 16:54:06,274 INFO L682 Elim1Store]: detected equality via solver [2018-04-10 16:54:06,274 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 36 [2018-04-10 16:54:06,275 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2018-04-10 16:54:06,288 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-10 16:54:06,325 INFO L267 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 2 dim-2 vars, End of recursive call: 6 dim-0 vars, and 2 xjuncts. [2018-04-10 16:54:06,326 INFO L202 ElimStorePlain]: Needed 7 recursive calls to eliminate 6 variables, input treesize:184, output treesize:273 [2018-04-10 16:54:06,402 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 12 [2018-04-10 16:54:06,402 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-10 16:54:06,414 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 16:54:06,414 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:117, output treesize:99 [2018-04-10 16:54:06,614 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 16:54:06,614 INFO L682 Elim1Store]: detected equality via solver [2018-04-10 16:54:06,615 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 16:54:06,619 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 16:54:06,619 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 4 disjoint index pairs (out of 6 index pairs), introduced 5 new quantified variables, introduced 0 case distinctions, treesize of input 105 treesize of output 94 [2018-04-10 16:54:06,623 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 1 [2018-04-10 16:54:06,623 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-10 16:54:06,641 INFO L682 Elim1Store]: detected equality via solver [2018-04-10 16:54:06,642 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 36 treesize of output 26 [2018-04-10 16:54:06,642 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-04-10 16:54:06,655 INFO L682 Elim1Store]: detected equality via solver [2018-04-10 16:54:06,655 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 26 [2018-04-10 16:54:06,656 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 16:54:06,664 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 16:54:06,683 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 36 treesize of output 38 [2018-04-10 16:54:06,684 INFO L682 Elim1Store]: detected equality via solver [2018-04-10 16:54:06,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, 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 16:54:06,685 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2018-04-10 16:54:06,703 INFO L682 Elim1Store]: detected equality via solver [2018-04-10 16:54:06,703 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 16:54:06,704 INFO L267 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 1 xjuncts. [2018-04-10 16:54:06,708 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select 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 16:54:06,708 INFO L267 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 1 xjuncts. [2018-04-10 16:54:06,711 INFO L267 ElimStorePlain]: Start of recursive call 6: 3 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-10 16:54:06,721 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 16:54:06,721 INFO L202 ElimStorePlain]: Needed 9 recursive calls to eliminate 7 variables, input treesize:134, output treesize:12 [2018-04-10 16:54:06,791 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-10 16:54:06,792 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-04-10 16:54:06,792 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [25] total 25 [2018-04-10 16:54:06,792 INFO L442 AbstractCegarLoop]: Interpolant automaton has 26 states [2018-04-10 16:54:06,792 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2018-04-10 16:54:06,792 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=65, Invalid=585, Unknown=0, NotChecked=0, Total=650 [2018-04-10 16:54:06,792 INFO L87 Difference]: Start difference. First operand 131 states and 139 transitions. Second operand 26 states. [2018-04-10 16:54:08,354 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-10 16:54:08,354 INFO L93 Difference]: Finished difference Result 167 states and 176 transitions. [2018-04-10 16:54:08,354 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2018-04-10 16:54:08,354 INFO L78 Accepts]: Start accepts. Automaton has 26 states. Word has length 62 [2018-04-10 16:54:08,354 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-10 16:54:08,355 INFO L225 Difference]: With dead ends: 167 [2018-04-10 16:54:08,355 INFO L226 Difference]: Without dead ends: 167 [2018-04-10 16:54:08,355 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 84 GetRequests, 37 SyntacticMatches, 0 SemanticMatches, 47 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 438 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=275, Invalid=2077, Unknown=0, NotChecked=0, Total=2352 [2018-04-10 16:54:08,355 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 167 states. [2018-04-10 16:54:08,356 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 167 to 131. [2018-04-10 16:54:08,356 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 131 states. [2018-04-10 16:54:08,356 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 131 states to 131 states and 138 transitions. [2018-04-10 16:54:08,356 INFO L78 Accepts]: Start accepts. Automaton has 131 states and 138 transitions. Word has length 62 [2018-04-10 16:54:08,357 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-10 16:54:08,357 INFO L459 AbstractCegarLoop]: Abstraction has 131 states and 138 transitions. [2018-04-10 16:54:08,357 INFO L460 AbstractCegarLoop]: Interpolant automaton has 26 states. [2018-04-10 16:54:08,357 INFO L276 IsEmpty]: Start isEmpty. Operand 131 states and 138 transitions. [2018-04-10 16:54:08,357 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2018-04-10 16:54:08,357 INFO L347 BasicCegarLoop]: Found error trace [2018-04-10 16:54:08,357 INFO L355 BasicCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-10 16:54:08,358 INFO L408 AbstractCegarLoop]: === Iteration 26 === [mainErr51RequiresViolation, mainErr26RequiresViolation, mainErr54RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr31RequiresViolation, mainErr46RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr52AssertViolationMEMORY_FREE, mainErr15RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr55RequiresViolation, mainErr17RequiresViolation, mainErr42RequiresViolation, mainErr49AssertViolationMEMORY_FREE, mainErr30RequiresViolation, mainErr56AssertViolationMEMORY_FREE, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr44RequiresViolation, mainErr10RequiresViolation, mainErr43RequiresViolation, mainErr4RequiresViolation, mainErr50RequiresViolation, mainErr58EnsuresViolationMEMORY_LEAK, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr48AssertViolationMEMORY_FREE, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr45RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr57AssertViolationMEMORY_FREE, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr9RequiresViolation, mainErr53AssertViolationMEMORY_FREE, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr34RequiresViolation, mainErr47RequiresViolation, mainErr14RequiresViolation, mainErr40RequiresViolation]=== [2018-04-10 16:54:08,358 INFO L82 PathProgramCache]: Analyzing trace with hash -1042400824, now seen corresponding path program 3 times [2018-04-10 16:54:08,358 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-04-10 16:54:08,358 INFO L68 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-04-10 16:54:08,358 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-10 16:54:08,358 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-10 16:54:08,359 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-10 16:54:08,373 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-10 16:54:08,374 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-10 16:54:08,380 INFO L431 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown lemma type! [2018-04-10 16:54:08,380 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-04-10 16:54:08,380 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-04-10 16:54:08,381 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-04-10 16:54:08,421 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2018-04-10 16:54:08,421 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-04-10 16:54:08,425 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-10 16:54:08,460 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 16:54:08,461 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 16:54:08,462 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 24 [2018-04-10 16:54:08,462 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-10 16:54:08,469 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-10 16:54:08,469 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:26, output treesize:24 [2018-04-10 16:54:08,483 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 8 [2018-04-10 16:54:08,485 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 16:54:08,485 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-10 16:54:08,486 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-10 16:54:08,494 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 16:54:08,495 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:35, output treesize:32 [2018-04-10 16:54:08,528 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 16:54:08,532 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 39 treesize of output 43 [2018-04-10 16:54:08,533 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 13 [2018-04-10 16:54:08,534 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-10 16:54:08,540 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-10 16:54:08,549 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 16:54:08,549 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:53, output treesize:45 [2018-04-10 16:54:08,603 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 49 treesize of output 44 [2018-04-10 16:54:08,612 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 16 treesize of output 23 [2018-04-10 16:54:08,612 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 2 xjuncts. [2018-04-10 16:54:08,623 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-04-10 16:54:08,638 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 16:54:08,638 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:62, output treesize:82 [2018-04-10 16:54:08,667 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 16:54:08,667 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 16:54:08,668 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 16:54:08,668 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 16:54:08,668 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 42 [2018-04-10 16:54:08,669 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-10 16:54:08,677 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-10 16:54:08,677 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:47, output treesize:53 [2018-04-10 16:54:08,694 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 16:54:08,695 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 43 treesize of output 42 [2018-04-10 16:54:08,697 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 16:54:08,697 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-10 16:54:08,701 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-10 16:54:08,708 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 16:54:08,708 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:64, output treesize:58 [2018-04-10 16:54:08,742 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 16:54:08,745 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 71 treesize of output 71 [2018-04-10 16:54:08,747 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 13 [2018-04-10 16:54:08,747 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-10 16:54:08,753 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-10 16:54:08,761 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 16:54:08,761 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:79, output treesize:71 [2018-04-10 16:54:08,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, 3 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 107 treesize of output 80 [2018-04-10 16:54:08,840 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 28 treesize of output 43 [2018-04-10 16:54:08,840 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 2 xjuncts. [2018-04-10 16:54:08,851 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-04-10 16:54:08,871 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-2 vars, End of recursive call: 5 dim-0 vars, and 2 xjuncts. [2018-04-10 16:54:08,871 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:115, output treesize:186 [2018-04-10 16:54:08,936 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 81 treesize of output 50 [2018-04-10 16:54:08,937 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 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 16:54:08,937 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 16:54:08,945 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 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 16:54:08,946 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-04-10 16:54:08,950 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 16:54:08,951 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-04-10 16:54:08,954 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 16:54:08,958 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 16:54:08,958 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 4 variables, input treesize:86, output treesize:28 [2018-04-10 16:54:09,002 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 0 proven. 23 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-10 16:54:09,003 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-04-10 16:54:09,003 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [22] total 22 [2018-04-10 16:54:09,003 INFO L442 AbstractCegarLoop]: Interpolant automaton has 23 states [2018-04-10 16:54:09,003 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2018-04-10 16:54:09,003 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=89, Invalid=417, Unknown=0, NotChecked=0, Total=506 [2018-04-10 16:54:09,003 INFO L87 Difference]: Start difference. First operand 131 states and 138 transitions. Second operand 23 states. [2018-04-10 16:54:09,992 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-10 16:54:09,992 INFO L93 Difference]: Finished difference Result 213 states and 223 transitions. [2018-04-10 16:54:09,992 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2018-04-10 16:54:09,992 INFO L78 Accepts]: Start accepts. Automaton has 23 states. Word has length 63 [2018-04-10 16:54:09,992 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-10 16:54:09,993 INFO L225 Difference]: With dead ends: 213 [2018-04-10 16:54:09,993 INFO L226 Difference]: Without dead ends: 213 [2018-04-10 16:54:09,994 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 86 GetRequests, 41 SyntacticMatches, 0 SemanticMatches, 45 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 425 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=364, Invalid=1798, Unknown=0, NotChecked=0, Total=2162 [2018-04-10 16:54:09,994 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 213 states. [2018-04-10 16:54:09,995 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 213 to 166. [2018-04-10 16:54:09,995 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 166 states. [2018-04-10 16:54:09,995 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 166 states to 166 states and 176 transitions. [2018-04-10 16:54:09,995 INFO L78 Accepts]: Start accepts. Automaton has 166 states and 176 transitions. Word has length 63 [2018-04-10 16:54:09,996 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-10 16:54:09,996 INFO L459 AbstractCegarLoop]: Abstraction has 166 states and 176 transitions. [2018-04-10 16:54:09,996 INFO L460 AbstractCegarLoop]: Interpolant automaton has 23 states. [2018-04-10 16:54:09,996 INFO L276 IsEmpty]: Start isEmpty. Operand 166 states and 176 transitions. [2018-04-10 16:54:09,996 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2018-04-10 16:54:09,996 INFO L347 BasicCegarLoop]: Found error trace [2018-04-10 16:54:09,996 INFO L355 BasicCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-10 16:54:09,997 INFO L408 AbstractCegarLoop]: === Iteration 27 === [mainErr51RequiresViolation, mainErr26RequiresViolation, mainErr54RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr31RequiresViolation, mainErr46RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr52AssertViolationMEMORY_FREE, mainErr15RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr55RequiresViolation, mainErr17RequiresViolation, mainErr42RequiresViolation, mainErr49AssertViolationMEMORY_FREE, mainErr30RequiresViolation, mainErr56AssertViolationMEMORY_FREE, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr44RequiresViolation, mainErr10RequiresViolation, mainErr43RequiresViolation, mainErr4RequiresViolation, mainErr50RequiresViolation, mainErr58EnsuresViolationMEMORY_LEAK, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr48AssertViolationMEMORY_FREE, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr45RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr57AssertViolationMEMORY_FREE, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr9RequiresViolation, mainErr53AssertViolationMEMORY_FREE, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr34RequiresViolation, mainErr47RequiresViolation, mainErr14RequiresViolation, mainErr40RequiresViolation]=== [2018-04-10 16:54:09,997 INFO L82 PathProgramCache]: Analyzing trace with hash -1042400823, now seen corresponding path program 2 times [2018-04-10 16:54:09,997 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-04-10 16:54:09,997 INFO L68 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-04-10 16:54:09,998 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-10 16:54:09,998 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-04-10 16:54:09,998 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-10 16:54:10,009 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-10 16:54:10,010 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-10 16:54:10,020 INFO L431 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown lemma type! [2018-04-10 16:54:10,021 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-04-10 16:54:10,021 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-04-10 16:54:10,022 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-04-10 16:54:10,056 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-04-10 16:54:10,056 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-04-10 16:54:10,060 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-10 16:54:10,068 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select 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 16:54:10,068 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-10 16:54:10,070 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-10 16:54:10,071 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2018-04-10 16:54:10,090 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select 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 16:54:10,091 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-10 16:54:10,103 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 16:54:10,103 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 16:54:10,104 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 24 [2018-04-10 16:54:10,104 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-10 16:54:10,114 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-10 16:54:10,115 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:35, output treesize:32 [2018-04-10 16:54:10,132 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 16:54:10,134 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select 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 16:54:10,134 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-10 16:54:10,136 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-10 16:54:10,150 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 16:54:10,152 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 16:54:10,152 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-04-10 16:54:10,154 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-10 16:54:10,165 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 16:54:10,165 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 3 variables, input treesize:51, output treesize:48 [2018-04-10 16:54:10,210 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 16:54:10,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, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 69 treesize of output 73 [2018-04-10 16:54:10,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 14 treesize of output 13 [2018-04-10 16:54:10,216 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-10 16:54:10,225 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-10 16:54:10,251 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 16:54:10,254 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 30 [2018-04-10 16:54:10,256 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 13 [2018-04-10 16:54:10,256 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-04-10 16:54:10,261 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-10 16:54:10,274 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 16:54:10,275 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 3 variables, input treesize:90, output treesize:74 [2018-04-10 16:54:10,361 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 66 [2018-04-10 16:54:10,370 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 2 case distinctions, treesize of input 16 treesize of output 23 [2018-04-10 16:54:10,370 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 2 xjuncts. [2018-04-10 16:54:10,386 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-04-10 16:54:10,420 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 81 treesize of output 86 [2018-04-10 16:54:10,423 INFO L682 Elim1Store]: detected equality via solver [2018-04-10 16:54:10,423 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 28 [2018-04-10 16:54:10,423 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-04-10 16:54:10,435 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-10 16:54:10,437 INFO L682 Elim1Store]: detected equality via solver [2018-04-10 16:54:10,439 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 77 treesize of output 81 [2018-04-10 16:54:10,441 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 20 [2018-04-10 16:54:10,441 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2018-04-10 16:54:10,451 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-10 16:54:10,479 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 16:54:10,480 INFO L202 ElimStorePlain]: Needed 7 recursive calls to eliminate 3 variables, input treesize:102, output treesize:163 [2018-04-10 16:54:10,526 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 16:54:10,527 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 23 [2018-04-10 16:54:10,527 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-10 16:54:10,542 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 16:54:10,542 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 16:54:10,543 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 16:54:10,543 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 28 [2018-04-10 16:54:10,544 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-10 16:54:10,554 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-10 16:54:10,554 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:78, output treesize:70 [2018-04-10 16:54:10,576 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 16:54:10,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, 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 16:54:10,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 14 treesize of output 7 [2018-04-10 16:54:10,581 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-10 16:54:10,589 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-10 16:54:10,606 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 16:54:10,609 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 16:54:10,609 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-04-10 16:54:10,613 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-10 16:54:10,621 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 16:54:10,621 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 4 variables, input treesize:92, output treesize:64 [2018-04-10 16:54:10,655 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 30 [2018-04-10 16:54:10,656 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 13 [2018-04-10 16:54:10,656 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-10 16:54:10,659 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-10 16:54:10,671 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 16:54:10,675 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 88 treesize of output 96 [2018-04-10 16:54:10,676 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 13 [2018-04-10 16:54:10,676 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-04-10 16:54:10,684 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-10 16:54:10,693 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 16:54:10,693 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 3 variables, input treesize:106, output treesize:90 [2018-04-10 16:54:10,764 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 52 treesize of output 43 [2018-04-10 16:54:10,795 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 24 treesize of output 39 [2018-04-10 16:54:10,795 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 2 xjuncts. [2018-04-10 16:54:10,805 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-04-10 16:54:10,830 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 134 treesize of output 103 [2018-04-10 16:54:10,832 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 21 [2018-04-10 16:54:10,833 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-04-10 16:54:10,842 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-10 16:54:10,847 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 146 treesize of output 111 [2018-04-10 16:54:10,854 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 28 treesize of output 43 [2018-04-10 16:54:10,854 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 2 xjuncts. [2018-04-10 16:54:10,870 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-04-10 16:54:10,907 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 2 dim-2 vars, End of recursive call: 5 dim-0 vars, and 2 xjuncts. [2018-04-10 16:54:10,907 INFO L202 ElimStorePlain]: Needed 7 recursive calls to eliminate 5 variables, input treesize:161, output treesize:237 [2018-04-10 16:54:10,980 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 96 treesize of output 59 [2018-04-10 16:54:10,982 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 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 16:54:10,982 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-10 16:54:10,991 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select 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 16:54:10,991 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-04-10 16:54:10,997 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 29 treesize of output 21 [2018-04-10 16:54:10,997 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 16:54:11,001 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 16:54:11,009 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 16:54:11,010 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 1 [2018-04-10 16:54:11,011 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2018-04-10 16:54: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, 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 16:54:11,014 INFO L267 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 1 xjuncts. [2018-04-10 16:54:11,015 INFO L267 ElimStorePlain]: Start of recursive call 6: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-10 16:54:11,019 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 16:54:11,019 INFO L202 ElimStorePlain]: Needed 8 recursive calls to eliminate 5 variables, input treesize:110, output treesize:18 [2018-04-10 16:54:11,075 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 0 proven. 23 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-10 16:54:11,075 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-04-10 16:54:11,076 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [21] total 21 [2018-04-10 16:54:11,076 INFO L442 AbstractCegarLoop]: Interpolant automaton has 22 states [2018-04-10 16:54:11,076 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2018-04-10 16:54:11,076 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=405, Unknown=0, NotChecked=0, Total=462 [2018-04-10 16:54:11,076 INFO L87 Difference]: Start difference. First operand 166 states and 176 transitions. Second operand 22 states. [2018-04-10 16:54:12,187 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-10 16:54:12,187 INFO L93 Difference]: Finished difference Result 210 states and 222 transitions. [2018-04-10 16:54:12,188 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2018-04-10 16:54:12,188 INFO L78 Accepts]: Start accepts. Automaton has 22 states. Word has length 63 [2018-04-10 16:54:12,188 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-10 16:54:12,188 INFO L225 Difference]: With dead ends: 210 [2018-04-10 16:54:12,188 INFO L226 Difference]: Without dead ends: 210 [2018-04-10 16:54:12,189 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 83 GetRequests, 41 SyntacticMatches, 1 SemanticMatches, 41 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 352 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=243, Invalid=1559, Unknown=4, NotChecked=0, Total=1806 [2018-04-10 16:54:12,189 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 210 states. [2018-04-10 16:54:12,190 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 210 to 168. [2018-04-10 16:54:12,190 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 168 states. [2018-04-10 16:54:12,191 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 168 states to 168 states and 178 transitions. [2018-04-10 16:54:12,191 INFO L78 Accepts]: Start accepts. Automaton has 168 states and 178 transitions. Word has length 63 [2018-04-10 16:54:12,191 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-10 16:54:12,191 INFO L459 AbstractCegarLoop]: Abstraction has 168 states and 178 transitions. [2018-04-10 16:54:12,191 INFO L460 AbstractCegarLoop]: Interpolant automaton has 22 states. [2018-04-10 16:54:12,191 INFO L276 IsEmpty]: Start isEmpty. Operand 168 states and 178 transitions. [2018-04-10 16:54:12,191 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2018-04-10 16:54:12,191 INFO L347 BasicCegarLoop]: Found error trace [2018-04-10 16:54:12,191 INFO L355 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-10 16:54:12,191 INFO L408 AbstractCegarLoop]: === Iteration 28 === [mainErr51RequiresViolation, mainErr26RequiresViolation, mainErr54RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr31RequiresViolation, mainErr46RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr52AssertViolationMEMORY_FREE, mainErr15RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr55RequiresViolation, mainErr17RequiresViolation, mainErr42RequiresViolation, mainErr49AssertViolationMEMORY_FREE, mainErr30RequiresViolation, mainErr56AssertViolationMEMORY_FREE, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr44RequiresViolation, mainErr10RequiresViolation, mainErr43RequiresViolation, mainErr4RequiresViolation, mainErr50RequiresViolation, mainErr58EnsuresViolationMEMORY_LEAK, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr48AssertViolationMEMORY_FREE, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr45RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr57AssertViolationMEMORY_FREE, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr9RequiresViolation, mainErr53AssertViolationMEMORY_FREE, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr34RequiresViolation, mainErr47RequiresViolation, mainErr14RequiresViolation, mainErr40RequiresViolation]=== [2018-04-10 16:54:12,192 INFO L82 PathProgramCache]: Analyzing trace with hash -1290037367, now seen corresponding path program 1 times [2018-04-10 16:54:12,192 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-04-10 16:54:12,192 INFO L68 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-04-10 16:54:12,192 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-10 16:54:12,192 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-04-10 16:54:12,192 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-10 16:54:12,206 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-04-10 16:54:12,224 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-04-10 16:54:12,248 INFO L421 BasicCegarLoop]: Counterexample might be feasible [2018-04-10 16:54:12,291 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 10.04 04:54:12 BoogieIcfgContainer [2018-04-10 16:54:12,291 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-04-10 16:54:12,292 INFO L168 Benchmark]: Toolchain (without parser) took 172323.56 ms. Allocated memory was 400.6 MB in the beginning and 795.3 MB in the end (delta: 394.8 MB). Free memory was 334.6 MB in the beginning and 700.7 MB in the end (delta: -366.1 MB). Peak memory consumption was 28.7 MB. Max. memory is 5.3 GB. [2018-04-10 16:54:12,294 INFO L168 Benchmark]: CDTParser took 0.22 ms. Allocated memory is still 400.6 MB. Free memory is still 361.2 MB. There was no memory consumed. Max. memory is 5.3 GB. [2018-04-10 16:54:12,294 INFO L168 Benchmark]: CACSL2BoogieTranslator took 267.56 ms. Allocated memory is still 400.6 MB. Free memory was 333.3 MB in the beginning and 306.8 MB in the end (delta: 26.5 MB). Peak memory consumption was 26.5 MB. Max. memory is 5.3 GB. [2018-04-10 16:54:12,294 INFO L168 Benchmark]: Boogie Preprocessor took 46.36 ms. Allocated memory is still 400.6 MB. Free memory was 305.5 MB in the beginning and 302.8 MB in the end (delta: 2.6 MB). Peak memory consumption was 2.6 MB. Max. memory is 5.3 GB. [2018-04-10 16:54:12,294 INFO L168 Benchmark]: RCFGBuilder took 490.53 ms. Allocated memory was 400.6 MB in the beginning and 607.6 MB in the end (delta: 207.1 MB). Free memory was 302.8 MB in the beginning and 527.4 MB in the end (delta: -224.6 MB). Peak memory consumption was 23.8 MB. Max. memory is 5.3 GB. [2018-04-10 16:54:12,297 INFO L168 Benchmark]: TraceAbstraction took 171515.54 ms. Allocated memory was 607.6 MB in the beginning and 795.3 MB in the end (delta: 187.7 MB). Free memory was 527.4 MB in the beginning and 700.7 MB in the end (delta: -173.3 MB). Peak memory consumption was 14.4 MB. Max. memory is 5.3 GB. [2018-04-10 16:54:12,298 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.22 ms. Allocated memory is still 400.6 MB. Free memory is still 361.2 MB. There was no memory consumed. Max. memory is 5.3 GB. * CACSL2BoogieTranslator took 267.56 ms. Allocated memory is still 400.6 MB. Free memory was 333.3 MB in the beginning and 306.8 MB in the end (delta: 26.5 MB). Peak memory consumption was 26.5 MB. Max. memory is 5.3 GB. * Boogie Preprocessor took 46.36 ms. Allocated memory is still 400.6 MB. Free memory was 305.5 MB in the beginning and 302.8 MB in the end (delta: 2.6 MB). Peak memory consumption was 2.6 MB. Max. memory is 5.3 GB. * RCFGBuilder took 490.53 ms. Allocated memory was 400.6 MB in the beginning and 607.6 MB in the end (delta: 207.1 MB). Free memory was 302.8 MB in the beginning and 527.4 MB in the end (delta: -224.6 MB). Peak memory consumption was 23.8 MB. Max. memory is 5.3 GB. * TraceAbstraction took 171515.54 ms. Allocated memory was 607.6 MB in the beginning and 795.3 MB in the end (delta: 187.7 MB). Free memory was 527.4 MB in the beginning and 700.7 MB in the end (delta: -173.3 MB). Peak memory consumption was 14.4 MB. Max. memory is 5.3 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - CounterExampleResult [Line: 1040]: pointer dereference may fail pointer dereference may fail We found a FailurePath: [L994] EXPR, FCALL malloc(sizeof(SLL)) VAL [malloc(sizeof(SLL))={16:0}] [L994] SLL* list = malloc(sizeof(SLL)); VAL [list={16:0}, malloc(sizeof(SLL))={16:0}] [L995] FCALL list->next = ((void*)0) VAL [list={16:0}, malloc(sizeof(SLL))={16:0}] [L996] FCALL list->prev = ((void*)0) VAL [list={16:0}, malloc(sizeof(SLL))={16:0}] [L997] FCALL list->colour = BLACK VAL [list={16:0}, malloc(sizeof(SLL))={16:0}] [L999] SLL* end = list; VAL [end={16:0}, list={16:0}, malloc(sizeof(SLL))={16:0}] [L1002] COND TRUE __VERIFIER_nondet_int() [L1005] EXPR, FCALL malloc(sizeof(SLL)) VAL [end={16:0}, list={16:0}, malloc(sizeof(SLL))={14:0}, malloc(sizeof(SLL))={16:0}] [L1005] FCALL end->next = malloc(sizeof(SLL)) VAL [end={16:0}, list={16:0}, malloc(sizeof(SLL))={14:0}, malloc(sizeof(SLL))={16:0}] [L1006] EXPR, FCALL end->next VAL [end={16:0}, end->next={14:0}, list={16:0}, malloc(sizeof(SLL))={14:0}, malloc(sizeof(SLL))={16:0}] [L1006] FCALL end->next->prev = end VAL [end={16:0}, end->next={14:0}, list={16:0}, malloc(sizeof(SLL))={14:0}, malloc(sizeof(SLL))={16:0}] [L1007] EXPR, FCALL end->next VAL [end={16:0}, end->next={14:0}, list={16:0}, malloc(sizeof(SLL))={14:0}, malloc(sizeof(SLL))={16:0}] [L1007] end = end->next [L1008] FCALL end->next = ((void*)0) VAL [end={14:0}, list={16:0}, malloc(sizeof(SLL))={14:0}, malloc(sizeof(SLL))={16:0}] [L1010] COND FALSE !(__VERIFIER_nondet_int()) [L1016] FCALL end->colour = RED VAL [end={14:0}, list={16:0}, malloc(sizeof(SLL))={14:0}, malloc(sizeof(SLL))={16:0}] [L1017] EXPR, FCALL malloc(sizeof(SLL)) VAL [end={14:0}, list={16:0}, malloc(sizeof(SLL))={15:0}, malloc(sizeof(SLL))={14:0}, malloc(sizeof(SLL))={16:0}] [L1017] FCALL end->next = malloc(sizeof(SLL)) VAL [end={14:0}, list={16:0}, malloc(sizeof(SLL))={15:0}, malloc(sizeof(SLL))={14:0}, malloc(sizeof(SLL))={16:0}] [L1018] EXPR, FCALL end->next VAL [end={14:0}, end->next={15:0}, list={16:0}, malloc(sizeof(SLL))={15:0}, malloc(sizeof(SLL))={14:0}, malloc(sizeof(SLL))={16:0}] [L1018] FCALL end->next->prev = end VAL [end={14:0}, end->next={15:0}, list={16:0}, malloc(sizeof(SLL))={15:0}, malloc(sizeof(SLL))={14:0}, malloc(sizeof(SLL))={16:0}] [L1019] EXPR, FCALL end->next VAL [end={14:0}, end->next={15:0}, list={16:0}, malloc(sizeof(SLL))={15:0}, malloc(sizeof(SLL))={14:0}, malloc(sizeof(SLL))={16:0}] [L1019] end = end->next [L1020] FCALL end->next = ((void*)0) VAL [end={15:0}, list={16:0}, malloc(sizeof(SLL))={15:0}, malloc(sizeof(SLL))={14:0}, malloc(sizeof(SLL))={16:0}] [L1021] FCALL end->colour = BLACK VAL [end={15:0}, list={16:0}, malloc(sizeof(SLL))={15:0}, malloc(sizeof(SLL))={14:0}, malloc(sizeof(SLL))={16:0}] [L1002] COND FALSE !(__VERIFIER_nondet_int()) [L1025] end = ((void*)0) [L1026] end = list VAL [end={16:0}, list={16:0}, malloc(sizeof(SLL))={15:0}, malloc(sizeof(SLL))={14:0}, malloc(sizeof(SLL))={16:0}] [L1029] COND FALSE !(!(((void*)0) != end)) VAL [end={16:0}, list={16:0}, malloc(sizeof(SLL))={15:0}, malloc(sizeof(SLL))={14:0}, malloc(sizeof(SLL))={16:0}] [L1029] COND FALSE !(0) VAL [end={16:0}, list={16:0}, malloc(sizeof(SLL))={15:0}, malloc(sizeof(SLL))={14:0}, malloc(sizeof(SLL))={16:0}] [L1030] EXPR, FCALL end->colour VAL [end={16:0}, end->colour=1, list={16:0}, malloc(sizeof(SLL))={15:0}, malloc(sizeof(SLL))={14:0}, malloc(sizeof(SLL))={16:0}] [L1030] COND FALSE !(!(BLACK == end->colour)) [L1030] COND FALSE !(0) VAL [end={16:0}, list={16:0}, malloc(sizeof(SLL))={15:0}, malloc(sizeof(SLL))={14:0}, malloc(sizeof(SLL))={16:0}] [L1032] COND TRUE ((void*)0) != end VAL [end={16:0}, list={16:0}, malloc(sizeof(SLL))={15:0}, malloc(sizeof(SLL))={14:0}, malloc(sizeof(SLL))={16:0}] [L1034] EXPR, FCALL end->colour VAL [end={16:0}, end->colour=1, list={16:0}, malloc(sizeof(SLL))={15:0}, malloc(sizeof(SLL))={14:0}, malloc(sizeof(SLL))={16:0}] [L1034] COND FALSE !(RED == end->colour) [L1040] EXPR, FCALL end->next VAL [end={16:0}, end->next={14:0}, list={16:0}, malloc(sizeof(SLL))={15:0}, malloc(sizeof(SLL))={14:0}, malloc(sizeof(SLL))={16:0}] [L1040] COND FALSE !(!(end->next)) [L1040] COND FALSE !(0) VAL [end={16:0}, list={16:0}, malloc(sizeof(SLL))={15:0}, malloc(sizeof(SLL))={14:0}, malloc(sizeof(SLL))={16:0}] [L1041] EXPR, FCALL end->next VAL [end={16:0}, end->next={14:0}, list={16:0}, malloc(sizeof(SLL))={15:0}, malloc(sizeof(SLL))={14:0}, malloc(sizeof(SLL))={16:0}] [L1041] end = end->next [L1032] COND TRUE ((void*)0) != end VAL [end={14:0}, list={16:0}, malloc(sizeof(SLL))={15:0}, malloc(sizeof(SLL))={14:0}, malloc(sizeof(SLL))={16:0}] [L1034] EXPR, FCALL end->colour VAL [end={14:0}, end->colour=0, list={16:0}, malloc(sizeof(SLL))={15:0}, malloc(sizeof(SLL))={14:0}, malloc(sizeof(SLL))={16:0}] [L1034] COND TRUE RED == end->colour [L1036] EXPR, FCALL end->next VAL [end={14:0}, end->next={15:0}, list={16:0}, malloc(sizeof(SLL))={15:0}, malloc(sizeof(SLL))={14:0}, malloc(sizeof(SLL))={16:0}] [L1036] end = end->next [L1037] EXPR, FCALL end->next VAL [end={15:0}, end->next={0:0}, list={16:0}, malloc(sizeof(SLL))={15:0}, malloc(sizeof(SLL))={14:0}, malloc(sizeof(SLL))={16:0}] [L1037] end = end->next [L1040] FCALL end->next - StatisticsResult: Ultimate Automizer benchmark data CFG has 3 procedures, 141 locations, 59 error locations. UNSAFE Result, 171.4s OverallTime, 28 OverallIterations, 3 TraceHistogramMax, 100.3s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 2029 SDtfs, 6998 SDslu, 8052 SDs, 0 SdLazy, 12372 SolverSat, 786 SolverUnsat, 8 SolverUnknown, 0 SolverNotchecked, 7.9s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 1098 GetRequests, 528 SyntacticMatches, 7 SemanticMatches, 563 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3691 ImplicationChecksByTransitivity, 149.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=168occurred in iteration=27, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s AbstIntTime, 0 AbstIntIterations, 0 AbstIntStrong, NaN AbsIntWeakeningRatio, NaN AbsIntAvgWeakeningVarsNumRemoved, NaN AbsIntAvgWeakenedConjuncts, 0.0s DumpTime, AutomataMinimizationStatistics: 0.1s AutomataMinimizationTime, 27 MinimizatonAttempts, 966 StatesRemovedByMinimization, 27 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.8s SatisfiabilityAnalysisTime, 69.8s InterpolantComputationTime, 1854 NumberOfCodeBlocks, 1854 NumberOfCodeBlocksAsserted, 50 NumberOfCheckSat, 973 ConstructedInterpolants, 391 QuantifiedInterpolants, 2671039 SizeOfPredicates, 262 NumberOfNonLiveVariables, 3174 ConjunctsInSsa, 667 ConjunctsInUnsatCore, 27 InterpolantComputations, 16 PerfectInterpolantSequences, 23/126 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be incorrect! Written .csv to /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/dll-rb-cnstr_1_false-unreach-call_false-valid-deref.i_svcomp-DerefFreeMemtrack-32bit-Automizer_SmtInterpol_NoArray.epf_AutomizerC.xml/Csv-Benchmark-0-2018-04-10_16-54-12-306.csv Written .csv to /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/dll-rb-cnstr_1_false-unreach-call_false-valid-deref.i_svcomp-DerefFreeMemtrack-32bit-Automizer_SmtInterpol_NoArray.epf_AutomizerC.xml/Csv-TraceAbstractionBenchmarks-0-2018-04-10_16-54-12-306.csv Received shutdown request...