java -Xmx6000000000 -jar ./plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data ./data --generate-csv --csv-dir ../../../releaseScripts/default/UAutomizer-linux/csv --cacsl2boogietranslator.bitprecise.bitfields false -tc ../../../trunk/examples/toolchains/AutomizerC.xml -s ../../../trunk/examples/settings/cade18-smtinterpol/svcomp-DerefFreeMemtrack-32bit-Automizer_Camel.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-11 12:42:47,796 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-04-11 12:42:47,797 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-04-11 12:42:47,809 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-04-11 12:42:47,809 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-04-11 12:42:47,810 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-04-11 12:42:47,811 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-04-11 12:42:47,812 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-04-11 12:42:47,814 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-04-11 12:42:47,814 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-04-11 12:42:47,815 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-04-11 12:42:47,815 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-04-11 12:42:47,816 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-04-11 12:42:47,817 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-04-11 12:42:47,817 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-04-11 12:42:47,819 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-04-11 12:42:47,820 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-04-11 12:42:47,822 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-04-11 12:42:47,823 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-04-11 12:42:47,823 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-04-11 12:42:47,825 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-04-11 12:42:47,825 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-04-11 12:42:47,826 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-04-11 12:42:47,826 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-04-11 12:42:47,827 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-04-11 12:42:47,828 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-04-11 12:42:47,828 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-04-11 12:42:47,829 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-04-11 12:42:47,829 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-04-11 12:42:47,829 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-04-11 12:42:47,830 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-04-11 12:42:47,830 INFO L98 SettingsManager]: Beginning loading settings from /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/cade18-smtinterpol/svcomp-DerefFreeMemtrack-32bit-Automizer_Camel.epf [2018-04-11 12:42:47,850 INFO L110 SettingsManager]: Loading preferences was successful [2018-04-11 12:42:47,851 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-04-11 12:42:47,852 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-04-11 12:42:47,852 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-04-11 12:42:47,852 INFO L133 SettingsManager]: * Use SBE=true [2018-04-11 12:42:47,852 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-04-11 12:42:47,852 INFO L133 SettingsManager]: * sizeof long=4 [2018-04-11 12:42:47,852 INFO L133 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2018-04-11 12:42:47,852 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-04-11 12:42:47,852 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-04-11 12:42:47,852 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-04-11 12:42:47,852 INFO L133 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2018-04-11 12:42:47,853 INFO L133 SettingsManager]: * Bitprecise bitfields=true [2018-04-11 12:42:47,853 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-04-11 12:42:47,853 INFO L133 SettingsManager]: * sizeof long double=12 [2018-04-11 12:42:47,853 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-04-11 12:42:47,853 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-04-11 12:42:47,853 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-04-11 12:42:47,853 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-04-11 12:42:47,853 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-04-11 12:42:47,853 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-04-11 12:42:47,854 INFO L133 SettingsManager]: * Interpolant automaton=TWOTRACK [2018-04-11 12:42:47,854 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-04-11 12:42:47,854 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Bitprecise bitfields -> false [2018-04-11 12:42:47,880 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-04-11 12:42:47,888 INFO L266 ainManager$Toolchain]: [Toolchain 1]: Parser(s) successfully (re)initialized [2018-04-11 12:42:47,890 INFO L222 ainManager$Toolchain]: [Toolchain 1]: Toolchain data selected. [2018-04-11 12:42:47,891 INFO L271 PluginConnector]: Initializing CDTParser... [2018-04-11 12:42:47,892 INFO L276 PluginConnector]: CDTParser initialized [2018-04-11 12:42:47,892 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-11 12:42:48,165 INFO L225 CDTParser]: Created temporary CDT project at /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/data/FLAGbaccd9c30 [2018-04-11 12:42:48,356 INFO L287 CDTParser]: IsIndexed: true [2018-04-11 12:42:48,356 INFO L288 CDTParser]: Found 1 translation units. [2018-04-11 12:42:48,356 INFO L168 CDTParser]: Scanning dll-rb-cnstr_1_false-unreach-call_false-valid-deref.i [2018-04-11 12:42:48,364 INFO L210 ultiparseSymbolTable]: Include resolver: [2018-04-11 12:42:48,364 INFO L215 ultiparseSymbolTable]: [2018-04-11 12:42:48,365 INFO L218 ultiparseSymbolTable]: Function table: [2018-04-11 12:42:48,365 INFO L221 ultiparseSymbolTable]: Function definition of null ('main') in dll-rb-cnstr_1_false-unreach-call_false-valid-deref.i [2018-04-11 12:42:48,365 INFO L227 ultiparseSymbolTable]: Global variable table: [2018-04-11 12:42:48,365 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-11 12:42:48,365 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-11 12:42:48,365 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-11 12:42:48,365 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-11 12:42:48,365 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-11 12:42:48,365 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-11 12:42:48,366 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-11 12:42:48,366 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-11 12:42:48,366 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-11 12:42:48,366 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-11 12:42:48,366 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-11 12:42:48,366 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-11 12:42:48,366 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-11 12:42:48,366 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-11 12:42:48,366 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-11 12:42:48,366 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-11 12:42:48,366 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-11 12:42:48,366 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-11 12:42:48,367 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-11 12:42:48,367 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-11 12:42:48,367 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-11 12:42:48,367 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-11 12:42:48,367 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-11 12:42:48,367 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-11 12:42:48,367 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-11 12:42:48,367 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-11 12:42:48,367 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-11 12:42:48,367 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-11 12:42:48,367 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-11 12:42:48,367 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-11 12:42:48,367 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-11 12:42:48,367 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-11 12:42:48,367 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-11 12:42:48,368 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-11 12:42:48,368 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-11 12:42:48,368 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-11 12:42:48,368 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-11 12:42:48,368 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-11 12:42:48,368 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-11 12:42:48,368 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-11 12:42:48,368 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-11 12:42:48,368 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-11 12:42:48,368 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-11 12:42:48,368 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-11 12:42:48,368 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-11 12:42:48,368 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-11 12:42:48,368 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-11 12:42:48,368 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-11 12:42:48,368 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-11 12:42:48,368 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-11 12:42:48,368 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-11 12:42:48,369 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-11 12:42:48,369 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-11 12:42:48,369 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-11 12:42:48,369 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-11 12:42:48,369 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-11 12:42:48,369 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-11 12:42:48,369 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-11 12:42:48,369 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-11 12:42:48,369 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-11 12:42:48,369 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-11 12:42:48,369 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-11 12:42:48,369 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-11 12:42:48,369 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-11 12:42:48,369 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-11 12:42:48,369 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-11 12:42:48,369 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-11 12:42:48,369 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-11 12:42:48,369 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-11 12:42:48,370 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-11 12:42:48,370 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-11 12:42:48,370 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-11 12:42:48,370 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-11 12:42:48,370 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-11 12:42:48,370 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-11 12:42:48,370 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-11 12:42:48,370 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-11 12:42:48,370 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-11 12:42:48,370 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-11 12:42:48,370 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-11 12:42:48,370 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-11 12:42:48,370 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-11 12:42:48,370 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-11 12:42:48,371 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-11 12:42:48,371 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-11 12:42:48,371 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-11 12:42:48,371 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-11 12:42:48,371 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-11 12:42:48,371 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-11 12:42:48,371 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-11 12:42:48,371 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-11 12:42:48,371 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-11 12:42:48,371 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-11 12:42:48,372 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-11 12:42:48,372 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-11 12:42:48,372 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-11 12:42:48,372 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-11 12:42:48,372 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-11 12:42:48,372 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-11 12:42:48,372 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-11 12:42:48,372 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-11 12:42:48,372 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-11 12:42:48,372 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-11 12:42:48,372 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-11 12:42:48,373 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-11 12:42:48,373 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-11 12:42:48,373 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-11 12:42:48,373 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-11 12:42:48,373 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-11 12:42:48,373 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-11 12:42:48,373 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-11 12:42:48,373 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-11 12:42:48,373 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-11 12:42:48,373 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-11 12:42:48,373 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-11 12:42:48,374 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-11 12:42:48,374 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-11 12:42:48,374 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-11 12:42:48,374 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-11 12:42:48,374 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-11 12:42:48,374 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-11 12:42:48,374 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-11 12:42:48,388 INFO L330 CDTParser]: Deleted temporary CDT project at /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/data/FLAGbaccd9c30 [2018-04-11 12:42:48,391 INFO L304 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-04-11 12:42:48,393 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2018-04-11 12:42:48,393 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-04-11 12:42:48,393 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-04-11 12:42:48,398 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-04-11 12:42:48,399 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 11.04 12:42:48" (1/1) ... [2018-04-11 12:42:48,401 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@1718b6fa and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.04 12:42:48, skipping insertion in model container [2018-04-11 12:42:48,401 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 11.04 12:42:48" (1/1) ... [2018-04-11 12:42:48,412 INFO L167 Dispatcher]: Using SV-COMP mode [2018-04-11 12:42:48,437 INFO L167 Dispatcher]: Using SV-COMP mode [2018-04-11 12:42:48,569 INFO L175 PostProcessor]: Settings: Checked method=main [2018-04-11 12:42:48,607 INFO L175 PostProcessor]: Settings: Checked method=main [2018-04-11 12:42:48,613 INFO L100 SccComputation]: Graph consists of 0 InCaSumBalls and 115 non ball SCCs. Number of states in SCCs 115. [2018-04-11 12:42:48,649 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.04 12:42:48 WrapperNode [2018-04-11 12:42:48,649 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-04-11 12:42:48,650 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-04-11 12:42:48,650 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-04-11 12:42:48,650 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-04-11 12:42:48,658 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.04 12:42:48" (1/1) ... [2018-04-11 12:42:48,658 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.04 12:42:48" (1/1) ... [2018-04-11 12:42:48,670 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.04 12:42:48" (1/1) ... [2018-04-11 12:42:48,670 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.04 12:42:48" (1/1) ... [2018-04-11 12:42:48,680 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.04 12:42:48" (1/1) ... [2018-04-11 12:42:48,686 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.04 12:42:48" (1/1) ... [2018-04-11 12:42:48,688 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.04 12:42:48" (1/1) ... [2018-04-11 12:42:48,692 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-04-11 12:42:48,693 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-04-11 12:42:48,693 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-04-11 12:42:48,693 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-04-11 12:42:48,694 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.04 12:42:48" (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-11 12:42:48,783 INFO L136 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-04-11 12:42:48,783 INFO L136 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-04-11 12:42:48,783 INFO L136 BoogieDeclarations]: Found implementation of procedure main [2018-04-11 12:42:48,783 INFO L128 BoogieDeclarations]: Found specification of procedure __ctype_get_mb_cur_max [2018-04-11 12:42:48,783 INFO L128 BoogieDeclarations]: Found specification of procedure atof [2018-04-11 12:42:48,783 INFO L128 BoogieDeclarations]: Found specification of procedure atoi [2018-04-11 12:42:48,783 INFO L128 BoogieDeclarations]: Found specification of procedure atol [2018-04-11 12:42:48,784 INFO L128 BoogieDeclarations]: Found specification of procedure atoll [2018-04-11 12:42:48,784 INFO L128 BoogieDeclarations]: Found specification of procedure strtod [2018-04-11 12:42:48,784 INFO L128 BoogieDeclarations]: Found specification of procedure strtof [2018-04-11 12:42:48,784 INFO L128 BoogieDeclarations]: Found specification of procedure strtold [2018-04-11 12:42:48,784 INFO L128 BoogieDeclarations]: Found specification of procedure strtol [2018-04-11 12:42:48,784 INFO L128 BoogieDeclarations]: Found specification of procedure strtoul [2018-04-11 12:42:48,784 INFO L128 BoogieDeclarations]: Found specification of procedure strtoq [2018-04-11 12:42:48,784 INFO L128 BoogieDeclarations]: Found specification of procedure strtouq [2018-04-11 12:42:48,784 INFO L128 BoogieDeclarations]: Found specification of procedure strtoll [2018-04-11 12:42:48,784 INFO L128 BoogieDeclarations]: Found specification of procedure strtoull [2018-04-11 12:42:48,784 INFO L128 BoogieDeclarations]: Found specification of procedure l64a [2018-04-11 12:42:48,785 INFO L128 BoogieDeclarations]: Found specification of procedure a64l [2018-04-11 12:42:48,785 INFO L128 BoogieDeclarations]: Found specification of procedure select [2018-04-11 12:42:48,785 INFO L128 BoogieDeclarations]: Found specification of procedure pselect [2018-04-11 12:42:48,785 INFO L128 BoogieDeclarations]: Found specification of procedure gnu_dev_major [2018-04-11 12:42:48,785 INFO L128 BoogieDeclarations]: Found specification of procedure gnu_dev_minor [2018-04-11 12:42:48,785 INFO L128 BoogieDeclarations]: Found specification of procedure gnu_dev_makedev [2018-04-11 12:42:48,785 INFO L128 BoogieDeclarations]: Found specification of procedure random [2018-04-11 12:42:48,785 INFO L128 BoogieDeclarations]: Found specification of procedure srandom [2018-04-11 12:42:48,785 INFO L128 BoogieDeclarations]: Found specification of procedure initstate [2018-04-11 12:42:48,786 INFO L128 BoogieDeclarations]: Found specification of procedure setstate [2018-04-11 12:42:48,786 INFO L128 BoogieDeclarations]: Found specification of procedure random_r [2018-04-11 12:42:48,786 INFO L128 BoogieDeclarations]: Found specification of procedure srandom_r [2018-04-11 12:42:48,786 INFO L128 BoogieDeclarations]: Found specification of procedure initstate_r [2018-04-11 12:42:48,786 INFO L128 BoogieDeclarations]: Found specification of procedure setstate_r [2018-04-11 12:42:48,786 INFO L128 BoogieDeclarations]: Found specification of procedure rand [2018-04-11 12:42:48,786 INFO L128 BoogieDeclarations]: Found specification of procedure srand [2018-04-11 12:42:48,786 INFO L128 BoogieDeclarations]: Found specification of procedure rand_r [2018-04-11 12:42:48,786 INFO L128 BoogieDeclarations]: Found specification of procedure drand48 [2018-04-11 12:42:48,787 INFO L128 BoogieDeclarations]: Found specification of procedure erand48 [2018-04-11 12:42:48,787 INFO L128 BoogieDeclarations]: Found specification of procedure lrand48 [2018-04-11 12:42:48,787 INFO L128 BoogieDeclarations]: Found specification of procedure nrand48 [2018-04-11 12:42:48,787 INFO L128 BoogieDeclarations]: Found specification of procedure mrand48 [2018-04-11 12:42:48,787 INFO L128 BoogieDeclarations]: Found specification of procedure jrand48 [2018-04-11 12:42:48,787 INFO L128 BoogieDeclarations]: Found specification of procedure srand48 [2018-04-11 12:42:48,787 INFO L128 BoogieDeclarations]: Found specification of procedure seed48 [2018-04-11 12:42:48,787 INFO L128 BoogieDeclarations]: Found specification of procedure lcong48 [2018-04-11 12:42:48,787 INFO L128 BoogieDeclarations]: Found specification of procedure drand48_r [2018-04-11 12:42:48,788 INFO L128 BoogieDeclarations]: Found specification of procedure erand48_r [2018-04-11 12:42:48,788 INFO L128 BoogieDeclarations]: Found specification of procedure lrand48_r [2018-04-11 12:42:48,788 INFO L128 BoogieDeclarations]: Found specification of procedure nrand48_r [2018-04-11 12:42:48,788 INFO L128 BoogieDeclarations]: Found specification of procedure mrand48_r [2018-04-11 12:42:48,788 INFO L128 BoogieDeclarations]: Found specification of procedure jrand48_r [2018-04-11 12:42:48,788 INFO L128 BoogieDeclarations]: Found specification of procedure srand48_r [2018-04-11 12:42:48,788 INFO L128 BoogieDeclarations]: Found specification of procedure seed48_r [2018-04-11 12:42:48,788 INFO L128 BoogieDeclarations]: Found specification of procedure lcong48_r [2018-04-11 12:42:48,788 INFO L128 BoogieDeclarations]: Found specification of procedure malloc [2018-04-11 12:42:48,788 INFO L128 BoogieDeclarations]: Found specification of procedure calloc [2018-04-11 12:42:48,789 INFO L128 BoogieDeclarations]: Found specification of procedure realloc [2018-04-11 12:42:48,789 INFO L128 BoogieDeclarations]: Found specification of procedure free [2018-04-11 12:42:48,789 INFO L128 BoogieDeclarations]: Found specification of procedure cfree [2018-04-11 12:42:48,789 INFO L128 BoogieDeclarations]: Found specification of procedure alloca [2018-04-11 12:42:48,789 INFO L128 BoogieDeclarations]: Found specification of procedure valloc [2018-04-11 12:42:48,789 INFO L128 BoogieDeclarations]: Found specification of procedure posix_memalign [2018-04-11 12:42:48,789 INFO L128 BoogieDeclarations]: Found specification of procedure aligned_alloc [2018-04-11 12:42:48,789 INFO L128 BoogieDeclarations]: Found specification of procedure abort [2018-04-11 12:42:48,789 INFO L128 BoogieDeclarations]: Found specification of procedure atexit [2018-04-11 12:42:48,789 INFO L128 BoogieDeclarations]: Found specification of procedure at_quick_exit [2018-04-11 12:42:48,790 INFO L128 BoogieDeclarations]: Found specification of procedure on_exit [2018-04-11 12:42:48,790 INFO L128 BoogieDeclarations]: Found specification of procedure exit [2018-04-11 12:42:48,790 INFO L128 BoogieDeclarations]: Found specification of procedure quick_exit [2018-04-11 12:42:48,790 INFO L128 BoogieDeclarations]: Found specification of procedure _Exit [2018-04-11 12:42:48,790 INFO L128 BoogieDeclarations]: Found specification of procedure getenv [2018-04-11 12:42:48,790 INFO L128 BoogieDeclarations]: Found specification of procedure putenv [2018-04-11 12:42:48,790 INFO L128 BoogieDeclarations]: Found specification of procedure setenv [2018-04-11 12:42:48,790 INFO L128 BoogieDeclarations]: Found specification of procedure unsetenv [2018-04-11 12:42:48,790 INFO L128 BoogieDeclarations]: Found specification of procedure clearenv [2018-04-11 12:42:48,790 INFO L128 BoogieDeclarations]: Found specification of procedure mktemp [2018-04-11 12:42:48,791 INFO L128 BoogieDeclarations]: Found specification of procedure mkstemp [2018-04-11 12:42:48,791 INFO L128 BoogieDeclarations]: Found specification of procedure mkstemps [2018-04-11 12:42:48,791 INFO L128 BoogieDeclarations]: Found specification of procedure mkdtemp [2018-04-11 12:42:48,791 INFO L128 BoogieDeclarations]: Found specification of procedure system [2018-04-11 12:42:48,791 INFO L128 BoogieDeclarations]: Found specification of procedure realpath [2018-04-11 12:42:48,791 INFO L128 BoogieDeclarations]: Found specification of procedure bsearch [2018-04-11 12:42:48,791 INFO L128 BoogieDeclarations]: Found specification of procedure qsort [2018-04-11 12:42:48,791 INFO L128 BoogieDeclarations]: Found specification of procedure abs [2018-04-11 12:42:48,791 INFO L128 BoogieDeclarations]: Found specification of procedure labs [2018-04-11 12:42:48,791 INFO L128 BoogieDeclarations]: Found specification of procedure llabs [2018-04-11 12:42:48,792 INFO L128 BoogieDeclarations]: Found specification of procedure div [2018-04-11 12:42:48,792 INFO L128 BoogieDeclarations]: Found specification of procedure ldiv [2018-04-11 12:42:48,792 INFO L128 BoogieDeclarations]: Found specification of procedure lldiv [2018-04-11 12:42:48,792 INFO L128 BoogieDeclarations]: Found specification of procedure ecvt [2018-04-11 12:42:48,792 INFO L128 BoogieDeclarations]: Found specification of procedure fcvt [2018-04-11 12:42:48,792 INFO L128 BoogieDeclarations]: Found specification of procedure gcvt [2018-04-11 12:42:48,792 INFO L128 BoogieDeclarations]: Found specification of procedure qecvt [2018-04-11 12:42:48,792 INFO L128 BoogieDeclarations]: Found specification of procedure qfcvt [2018-04-11 12:42:48,792 INFO L128 BoogieDeclarations]: Found specification of procedure qgcvt [2018-04-11 12:42:48,792 INFO L128 BoogieDeclarations]: Found specification of procedure ecvt_r [2018-04-11 12:42:48,792 INFO L128 BoogieDeclarations]: Found specification of procedure fcvt_r [2018-04-11 12:42:48,793 INFO L128 BoogieDeclarations]: Found specification of procedure qecvt_r [2018-04-11 12:42:48,793 INFO L128 BoogieDeclarations]: Found specification of procedure qfcvt_r [2018-04-11 12:42:48,793 INFO L128 BoogieDeclarations]: Found specification of procedure mblen [2018-04-11 12:42:48,793 INFO L128 BoogieDeclarations]: Found specification of procedure mbtowc [2018-04-11 12:42:48,793 INFO L128 BoogieDeclarations]: Found specification of procedure wctomb [2018-04-11 12:42:48,793 INFO L128 BoogieDeclarations]: Found specification of procedure mbstowcs [2018-04-11 12:42:48,793 INFO L128 BoogieDeclarations]: Found specification of procedure wcstombs [2018-04-11 12:42:48,793 INFO L128 BoogieDeclarations]: Found specification of procedure rpmatch [2018-04-11 12:42:48,793 INFO L128 BoogieDeclarations]: Found specification of procedure getsubopt [2018-04-11 12:42:48,793 INFO L128 BoogieDeclarations]: Found specification of procedure getloadavg [2018-04-11 12:42:48,794 INFO L128 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2018-04-11 12:42:48,794 INFO L128 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2018-04-11 12:42:48,794 INFO L128 BoogieDeclarations]: Found specification of procedure main [2018-04-11 12:42:48,794 INFO L128 BoogieDeclarations]: Found specification of procedure #Ultimate.alloc [2018-04-11 12:42:48,794 INFO L128 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2018-04-11 12:42:48,794 INFO L128 BoogieDeclarations]: Found specification of procedure write~int [2018-04-11 12:42:48,794 INFO L128 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2018-04-11 12:42:48,794 INFO L128 BoogieDeclarations]: Found specification of procedure read~int [2018-04-11 12:42:48,794 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2018-04-11 12:42:48,794 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-04-11 12:42:48,795 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-04-11 12:42:48,795 INFO L128 BoogieDeclarations]: Found specification of procedure write~unchecked~int [2018-04-11 12:42:49,201 INFO L259 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-04-11 12:42:49,202 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.04 12:42:49 BoogieIcfgContainer [2018-04-11 12:42:49,202 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-04-11 12:42:49,202 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-04-11 12:42:49,202 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-04-11 12:42:49,204 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-04-11 12:42:49,204 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 11.04 12:42:48" (1/3) ... [2018-04-11 12:42:49,205 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2c265d93 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 11.04 12:42:49, skipping insertion in model container [2018-04-11 12:42:49,205 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.04 12:42:48" (2/3) ... [2018-04-11 12:42:49,205 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2c265d93 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 11.04 12:42:49, skipping insertion in model container [2018-04-11 12:42:49,205 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.04 12:42:49" (3/3) ... [2018-04-11 12:42:49,207 INFO L107 eAbstractionObserver]: Analyzing ICFG dll-rb-cnstr_1_false-unreach-call_false-valid-deref.i [2018-04-11 12:42:49,215 INFO L131 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-04-11 12:42:49,220 INFO L143 ceAbstractionStarter]: Appying trace abstraction to program that has 59 error locations. [2018-04-11 12:42:49,248 INFO L128 ementStrategyFactory]: Using default assertion order modulation [2018-04-11 12:42:49,249 INFO L369 AbstractCegarLoop]: Interprodecural is true [2018-04-11 12:42:49,249 INFO L370 AbstractCegarLoop]: Hoare is false [2018-04-11 12:42:49,249 INFO L371 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-04-11 12:42:49,249 INFO L372 AbstractCegarLoop]: Backedges is TWOTRACK [2018-04-11 12:42:49,249 INFO L373 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-04-11 12:42:49,249 INFO L374 AbstractCegarLoop]: Difference is false [2018-04-11 12:42:49,249 INFO L375 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-04-11 12:42:49,249 INFO L380 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-04-11 12:42:49,250 INFO L87 2NestedWordAutomaton]: Mode: main mode - execution starts in main procedure [2018-04-11 12:42:49,259 INFO L276 IsEmpty]: Start isEmpty. Operand 141 states. [2018-04-11 12:42:49,264 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2018-04-11 12:42:49,264 INFO L347 BasicCegarLoop]: Found error trace [2018-04-11 12:42:49,265 INFO L355 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2018-04-11 12:42:49,265 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-11 12:42:49,268 INFO L82 PathProgramCache]: Analyzing trace with hash -1080483552, now seen corresponding path program 1 times [2018-04-11 12:42:49,269 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-04-11 12:42:49,269 INFO L68 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-04-11 12:42:49,306 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 12:42:49,306 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-11 12:42:49,307 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 12:42:49,336 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-11 12:42:49,341 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-11 12:42:49,379 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-11 12:42:49,381 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-04-11 12:42:49,382 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-04-11 12:42:49,383 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-04-11 12:42:49,395 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-04-11 12:42:49,396 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-04-11 12:42:49,398 INFO L87 Difference]: Start difference. First operand 141 states. Second operand 4 states. [2018-04-11 12:42:49,572 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-11 12:42:49,572 INFO L93 Difference]: Finished difference Result 157 states and 164 transitions. [2018-04-11 12:42:49,572 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-04-11 12:42:49,573 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 8 [2018-04-11 12:42:49,573 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-11 12:42:49,581 INFO L225 Difference]: With dead ends: 157 [2018-04-11 12:42:49,581 INFO L226 Difference]: Without dead ends: 153 [2018-04-11 12:42:49,582 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-11 12:42:49,597 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 153 states. [2018-04-11 12:42:49,614 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 153 to 134. [2018-04-11 12:42:49,615 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 134 states. [2018-04-11 12:42:49,617 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 134 states to 134 states and 141 transitions. [2018-04-11 12:42:49,618 INFO L78 Accepts]: Start accepts. Automaton has 134 states and 141 transitions. Word has length 8 [2018-04-11 12:42:49,619 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-11 12:42:49,619 INFO L459 AbstractCegarLoop]: Abstraction has 134 states and 141 transitions. [2018-04-11 12:42:49,619 INFO L460 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-04-11 12:42:49,619 INFO L276 IsEmpty]: Start isEmpty. Operand 134 states and 141 transitions. [2018-04-11 12:42:49,619 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2018-04-11 12:42:49,619 INFO L347 BasicCegarLoop]: Found error trace [2018-04-11 12:42:49,619 INFO L355 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2018-04-11 12:42:49,620 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-11 12:42:49,620 INFO L82 PathProgramCache]: Analyzing trace with hash -1080483551, now seen corresponding path program 1 times [2018-04-11 12:42:49,620 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-04-11 12:42:49,620 INFO L68 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-04-11 12:42:49,621 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 12:42:49,622 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-11 12:42:49,622 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 12:42:49,633 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-11 12:42:49,634 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-11 12:42:49,680 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-11 12:42:49,681 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-04-11 12:42:49,681 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-04-11 12:42:49,682 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-04-11 12:42:49,682 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-04-11 12:42:49,682 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-04-11 12:42:49,683 INFO L87 Difference]: Start difference. First operand 134 states and 141 transitions. Second operand 4 states. [2018-04-11 12:42:49,813 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-11 12:42:49,813 INFO L93 Difference]: Finished difference Result 150 states and 156 transitions. [2018-04-11 12:42:49,813 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-04-11 12:42:49,813 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 8 [2018-04-11 12:42:49,813 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-11 12:42:49,815 INFO L225 Difference]: With dead ends: 150 [2018-04-11 12:42:49,815 INFO L226 Difference]: Without dead ends: 150 [2018-04-11 12:42:49,816 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-11 12:42:49,816 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 150 states. [2018-04-11 12:42:49,822 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 150 to 138. [2018-04-11 12:42:49,822 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 138 states. [2018-04-11 12:42:49,824 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 138 states to 138 states and 145 transitions. [2018-04-11 12:42:49,825 INFO L78 Accepts]: Start accepts. Automaton has 138 states and 145 transitions. Word has length 8 [2018-04-11 12:42:49,825 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-11 12:42:49,825 INFO L459 AbstractCegarLoop]: Abstraction has 138 states and 145 transitions. [2018-04-11 12:42:49,825 INFO L460 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-04-11 12:42:49,825 INFO L276 IsEmpty]: Start isEmpty. Operand 138 states and 145 transitions. [2018-04-11 12:42:49,826 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2018-04-11 12:42:49,826 INFO L347 BasicCegarLoop]: Found error trace [2018-04-11 12:42:49,826 INFO L355 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-11 12:42:49,826 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-11 12:42:49,826 INFO L82 PathProgramCache]: Analyzing trace with hash -595612499, now seen corresponding path program 1 times [2018-04-11 12:42:49,826 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-04-11 12:42:49,826 INFO L68 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-04-11 12:42:49,828 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 12:42:49,828 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-11 12:42:49,829 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 12:42:49,845 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-11 12:42:49,846 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-11 12:42:49,892 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-11 12:42:49,892 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-04-11 12:42:49,892 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-04-11 12:42:49,893 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-04-11 12:42:49,893 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-04-11 12:42:49,893 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-04-11 12:42:49,893 INFO L87 Difference]: Start difference. First operand 138 states and 145 transitions. Second operand 4 states. [2018-04-11 12:42:49,998 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-11 12:42:49,998 INFO L93 Difference]: Finished difference Result 146 states and 154 transitions. [2018-04-11 12:42:49,998 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-04-11 12:42:49,998 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 16 [2018-04-11 12:42:49,999 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-11 12:42:49,999 INFO L225 Difference]: With dead ends: 146 [2018-04-11 12:42:49,999 INFO L226 Difference]: Without dead ends: 146 [2018-04-11 12:42:49,999 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-04-11 12:42:50,000 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 146 states. [2018-04-11 12:42:50,003 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 146 to 130. [2018-04-11 12:42:50,003 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 130 states. [2018-04-11 12:42:50,004 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 130 states to 130 states and 140 transitions. [2018-04-11 12:42:50,004 INFO L78 Accepts]: Start accepts. Automaton has 130 states and 140 transitions. Word has length 16 [2018-04-11 12:42:50,004 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-11 12:42:50,004 INFO L459 AbstractCegarLoop]: Abstraction has 130 states and 140 transitions. [2018-04-11 12:42:50,004 INFO L460 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-04-11 12:42:50,004 INFO L276 IsEmpty]: Start isEmpty. Operand 130 states and 140 transitions. [2018-04-11 12:42:50,005 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2018-04-11 12:42:50,005 INFO L347 BasicCegarLoop]: Found error trace [2018-04-11 12:42:50,005 INFO L355 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-11 12:42:50,005 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-11 12:42:50,005 INFO L82 PathProgramCache]: Analyzing trace with hash -595612498, now seen corresponding path program 1 times [2018-04-11 12:42:50,005 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-04-11 12:42:50,005 INFO L68 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-04-11 12:42:50,006 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 12:42:50,006 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-11 12:42:50,013 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 12:42:50,026 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-11 12:42:50,027 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-11 12:42:50,074 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-11 12:42:50,074 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-04-11 12:42:50,074 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-04-11 12:42:50,075 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-04-11 12:42:50,075 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-04-11 12:42:50,075 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-04-11 12:42:50,075 INFO L87 Difference]: Start difference. First operand 130 states and 140 transitions. Second operand 5 states. [2018-04-11 12:42:50,233 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-11 12:42:50,233 INFO L93 Difference]: Finished difference Result 174 states and 185 transitions. [2018-04-11 12:42:50,234 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-04-11 12:42:50,234 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 16 [2018-04-11 12:42:50,234 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-11 12:42:50,235 INFO L225 Difference]: With dead ends: 174 [2018-04-11 12:42:50,235 INFO L226 Difference]: Without dead ends: 174 [2018-04-11 12:42:50,235 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2018-04-11 12:42:50,235 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 174 states. [2018-04-11 12:42:50,240 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 174 to 145. [2018-04-11 12:42:50,241 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 145 states. [2018-04-11 12:42:50,242 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 145 states to 145 states and 158 transitions. [2018-04-11 12:42:50,242 INFO L78 Accepts]: Start accepts. Automaton has 145 states and 158 transitions. Word has length 16 [2018-04-11 12:42:50,242 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-11 12:42:50,242 INFO L459 AbstractCegarLoop]: Abstraction has 145 states and 158 transitions. [2018-04-11 12:42:50,242 INFO L460 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-04-11 12:42:50,242 INFO L276 IsEmpty]: Start isEmpty. Operand 145 states and 158 transitions. [2018-04-11 12:42:50,243 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2018-04-11 12:42:50,243 INFO L347 BasicCegarLoop]: Found error trace [2018-04-11 12:42:50,243 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-11 12:42:50,243 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-11 12:42:50,243 INFO L82 PathProgramCache]: Analyzing trace with hash -1152961200, now seen corresponding path program 1 times [2018-04-11 12:42:50,243 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-04-11 12:42:50,244 INFO L68 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-04-11 12:42:50,245 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 12:42:50,245 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-11 12:42:50,245 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 12:42:50,256 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-11 12:42:50,257 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-11 12:42:50,288 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-11 12:42:50,288 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-04-11 12:42:50,288 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-04-11 12:42:50,288 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-04-11 12:42:50,288 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-04-11 12:42:50,288 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-04-11 12:42:50,288 INFO L87 Difference]: Start difference. First operand 145 states and 158 transitions. Second operand 5 states. [2018-04-11 12:42:50,436 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-11 12:42:50,436 INFO L93 Difference]: Finished difference Result 203 states and 221 transitions. [2018-04-11 12:42:50,436 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-04-11 12:42:50,436 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 18 [2018-04-11 12:42:50,436 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-11 12:42:50,437 INFO L225 Difference]: With dead ends: 203 [2018-04-11 12:42:50,437 INFO L226 Difference]: Without dead ends: 203 [2018-04-11 12:42:50,437 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-11 12:42:50,437 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 203 states. [2018-04-11 12:42:50,441 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 203 to 144. [2018-04-11 12:42:50,441 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 144 states. [2018-04-11 12:42:50,442 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 144 states to 144 states and 156 transitions. [2018-04-11 12:42:50,442 INFO L78 Accepts]: Start accepts. Automaton has 144 states and 156 transitions. Word has length 18 [2018-04-11 12:42:50,442 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-11 12:42:50,442 INFO L459 AbstractCegarLoop]: Abstraction has 144 states and 156 transitions. [2018-04-11 12:42:50,442 INFO L460 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-04-11 12:42:50,442 INFO L276 IsEmpty]: Start isEmpty. Operand 144 states and 156 transitions. [2018-04-11 12:42:50,442 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2018-04-11 12:42:50,442 INFO L347 BasicCegarLoop]: Found error trace [2018-04-11 12:42:50,443 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-11 12:42:50,443 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-11 12:42:50,443 INFO L82 PathProgramCache]: Analyzing trace with hash -1152961199, now seen corresponding path program 1 times [2018-04-11 12:42:50,443 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-04-11 12:42:50,443 INFO L68 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-04-11 12:42:50,444 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 12:42:50,444 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-11 12:42:50,444 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 12:42:50,450 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-11 12:42:50,451 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-11 12:42:50,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-11 12:42:50,486 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-04-11 12:42:50,486 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-04-11 12:42:50,486 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-04-11 12:42:50,486 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-04-11 12:42:50,486 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-04-11 12:42:50,486 INFO L87 Difference]: Start difference. First operand 144 states and 156 transitions. Second operand 5 states. [2018-04-11 12:42:50,644 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-11 12:42:50,644 INFO L93 Difference]: Finished difference Result 227 states and 246 transitions. [2018-04-11 12:42:50,644 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-04-11 12:42:50,644 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 18 [2018-04-11 12:42:50,644 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-11 12:42:50,645 INFO L225 Difference]: With dead ends: 227 [2018-04-11 12:42:50,645 INFO L226 Difference]: Without dead ends: 227 [2018-04-11 12:42:50,645 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-11 12:42:50,645 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 227 states. [2018-04-11 12:42:50,648 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 227 to 143. [2018-04-11 12:42:50,648 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 143 states. [2018-04-11 12:42:50,649 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 143 states to 143 states and 154 transitions. [2018-04-11 12:42:50,649 INFO L78 Accepts]: Start accepts. Automaton has 143 states and 154 transitions. Word has length 18 [2018-04-11 12:42:50,649 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-11 12:42:50,649 INFO L459 AbstractCegarLoop]: Abstraction has 143 states and 154 transitions. [2018-04-11 12:42:50,649 INFO L460 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-04-11 12:42:50,649 INFO L276 IsEmpty]: Start isEmpty. Operand 143 states and 154 transitions. [2018-04-11 12:42:50,650 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2018-04-11 12:42:50,650 INFO L347 BasicCegarLoop]: Found error trace [2018-04-11 12:42:50,650 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-11 12:42:50,655 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-11 12:42:50,655 INFO L82 PathProgramCache]: Analyzing trace with hash -1358009646, now seen corresponding path program 1 times [2018-04-11 12:42:50,655 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-04-11 12:42:50,655 INFO L68 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-04-11 12:42:50,656 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 12:42:50,656 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-11 12:42:50,657 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 12:42:50,667 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-11 12:42:50,668 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-11 12:42:50,727 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-11 12:42:50,728 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-04-11 12:42:50,728 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2018-04-11 12:42:50,728 INFO L442 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-04-11 12:42:50,728 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-04-11 12:42:50,728 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2018-04-11 12:42:50,729 INFO L87 Difference]: Start difference. First operand 143 states and 154 transitions. Second operand 9 states. [2018-04-11 12:42:50,981 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-11 12:42:50,981 INFO L93 Difference]: Finished difference Result 157 states and 167 transitions. [2018-04-11 12:42:50,981 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-04-11 12:42:50,981 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2018-04-11 12:42:50,982 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-11 12:42:50,982 INFO L225 Difference]: With dead ends: 157 [2018-04-11 12:42:50,982 INFO L226 Difference]: Without dead ends: 157 [2018-04-11 12:42:50,982 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=58, Invalid=124, Unknown=0, NotChecked=0, Total=182 [2018-04-11 12:42:50,982 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 157 states. [2018-04-11 12:42:50,984 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 157 to 142. [2018-04-11 12:42:50,984 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 142 states. [2018-04-11 12:42:50,985 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 142 states to 142 states and 153 transitions. [2018-04-11 12:42:50,985 INFO L78 Accepts]: Start accepts. Automaton has 142 states and 153 transitions. Word has length 22 [2018-04-11 12:42:50,985 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-11 12:42:50,985 INFO L459 AbstractCegarLoop]: Abstraction has 142 states and 153 transitions. [2018-04-11 12:42:50,985 INFO L460 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-04-11 12:42:50,985 INFO L276 IsEmpty]: Start isEmpty. Operand 142 states and 153 transitions. [2018-04-11 12:42:50,985 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2018-04-11 12:42:50,985 INFO L347 BasicCegarLoop]: Found error trace [2018-04-11 12:42:50,985 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-11 12:42:50,985 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-11 12:42:50,986 INFO L82 PathProgramCache]: Analyzing trace with hash -1358009645, now seen corresponding path program 1 times [2018-04-11 12:42:50,986 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-04-11 12:42:50,986 INFO L68 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-04-11 12:42:50,987 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 12:42:50,987 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-11 12:42:50,987 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 12:42:50,993 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-11 12:42:50,994 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-11 12:42:51,072 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-11 12:42:51,073 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-04-11 12:42:51,073 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2018-04-11 12:42:51,073 INFO L442 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-04-11 12:42:51,073 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-04-11 12:42:51,073 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=71, Unknown=0, NotChecked=0, Total=90 [2018-04-11 12:42:51,074 INFO L87 Difference]: Start difference. First operand 142 states and 153 transitions. Second operand 10 states. [2018-04-11 12:42:51,472 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-11 12:42:51,472 INFO L93 Difference]: Finished difference Result 162 states and 173 transitions. [2018-04-11 12:42:51,472 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2018-04-11 12:42:51,473 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 22 [2018-04-11 12:42:51,473 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-11 12:42:51,474 INFO L225 Difference]: With dead ends: 162 [2018-04-11 12:42:51,474 INFO L226 Difference]: Without dead ends: 162 [2018-04-11 12:42:51,474 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 20 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=129, Invalid=291, Unknown=0, NotChecked=0, Total=420 [2018-04-11 12:42:51,474 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 162 states. [2018-04-11 12:42:51,476 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 162 to 136. [2018-04-11 12:42:51,477 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 136 states. [2018-04-11 12:42:51,477 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 136 states to 136 states and 147 transitions. [2018-04-11 12:42:51,477 INFO L78 Accepts]: Start accepts. Automaton has 136 states and 147 transitions. Word has length 22 [2018-04-11 12:42:51,477 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-11 12:42:51,478 INFO L459 AbstractCegarLoop]: Abstraction has 136 states and 147 transitions. [2018-04-11 12:42:51,478 INFO L460 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-04-11 12:42:51,478 INFO L276 IsEmpty]: Start isEmpty. Operand 136 states and 147 transitions. [2018-04-11 12:42:51,478 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2018-04-11 12:42:51,478 INFO L347 BasicCegarLoop]: Found error trace [2018-04-11 12:42:51,478 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-11 12:42:51,479 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-11 12:42:51,479 INFO L82 PathProgramCache]: Analyzing trace with hash -582468992, now seen corresponding path program 1 times [2018-04-11 12:42:51,479 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-04-11 12:42:51,479 INFO L68 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-04-11 12:42:51,480 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 12:42:51,480 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-11 12:42:51,480 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 12:42:51,486 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-11 12:42:51,487 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-11 12:42:51,515 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-11 12:42:51,515 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-04-11 12:42:51,515 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-04-11 12:42:51,515 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-04-11 12:42:51,515 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-04-11 12:42:51,515 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-04-11 12:42:51,515 INFO L87 Difference]: Start difference. First operand 136 states and 147 transitions. Second operand 5 states. [2018-04-11 12:42:51,589 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-11 12:42:51,590 INFO L93 Difference]: Finished difference Result 158 states and 168 transitions. [2018-04-11 12:42:51,590 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-04-11 12:42:51,590 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 28 [2018-04-11 12:42:51,590 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-11 12:42:51,591 INFO L225 Difference]: With dead ends: 158 [2018-04-11 12:42:51,591 INFO L226 Difference]: Without dead ends: 158 [2018-04-11 12:42:51,591 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-11 12:42:51,592 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 158 states. [2018-04-11 12:42:51,594 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 158 to 136. [2018-04-11 12:42:51,594 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 136 states. [2018-04-11 12:42:51,594 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 136 states to 136 states and 145 transitions. [2018-04-11 12:42:51,595 INFO L78 Accepts]: Start accepts. Automaton has 136 states and 145 transitions. Word has length 28 [2018-04-11 12:42:51,595 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-11 12:42:51,595 INFO L459 AbstractCegarLoop]: Abstraction has 136 states and 145 transitions. [2018-04-11 12:42:51,595 INFO L460 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-04-11 12:42:51,595 INFO L276 IsEmpty]: Start isEmpty. Operand 136 states and 145 transitions. [2018-04-11 12:42:51,596 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2018-04-11 12:42:51,596 INFO L347 BasicCegarLoop]: Found error trace [2018-04-11 12:42:51,596 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-11 12:42:51,596 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-11 12:42:51,596 INFO L82 PathProgramCache]: Analyzing trace with hash -863319961, now seen corresponding path program 1 times [2018-04-11 12:42:51,596 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-04-11 12:42:51,597 INFO L68 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-04-11 12:42:51,598 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 12:42:51,598 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-11 12:42:51,598 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 12:42:51,605 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-11 12:42:51,606 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-11 12:42:51,688 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-11 12:42:51,688 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-04-11 12:42:51,688 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-04-11 12:42:51,688 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-04-11 12:42:51,688 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-04-11 12:42:51,688 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-04-11 12:42:51,689 INFO L87 Difference]: Start difference. First operand 136 states and 145 transitions. Second operand 5 states. [2018-04-11 12:42:51,864 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-11 12:42:51,864 INFO L93 Difference]: Finished difference Result 147 states and 156 transitions. [2018-04-11 12:42:51,864 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-04-11 12:42:51,864 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 29 [2018-04-11 12:42:51,864 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-11 12:42:51,865 INFO L225 Difference]: With dead ends: 147 [2018-04-11 12:42:51,865 INFO L226 Difference]: Without dead ends: 147 [2018-04-11 12:42:51,865 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-11 12:42:51,865 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 147 states. [2018-04-11 12:42:51,867 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 147 to 135. [2018-04-11 12:42:51,867 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 135 states. [2018-04-11 12:42:51,867 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 135 states to 135 states and 143 transitions. [2018-04-11 12:42:51,867 INFO L78 Accepts]: Start accepts. Automaton has 135 states and 143 transitions. Word has length 29 [2018-04-11 12:42:51,867 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-11 12:42:51,867 INFO L459 AbstractCegarLoop]: Abstraction has 135 states and 143 transitions. [2018-04-11 12:42:51,867 INFO L460 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-04-11 12:42:51,867 INFO L276 IsEmpty]: Start isEmpty. Operand 135 states and 143 transitions. [2018-04-11 12:42:51,868 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2018-04-11 12:42:51,868 INFO L347 BasicCegarLoop]: Found error trace [2018-04-11 12:42:51,868 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-11 12:42:51,868 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-11 12:42:51,868 INFO L82 PathProgramCache]: Analyzing trace with hash 759542753, now seen corresponding path program 1 times [2018-04-11 12:42:51,868 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-04-11 12:42:51,869 INFO L68 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-04-11 12:42:51,870 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 12:42:51,870 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-11 12:42:51,870 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 12:42:51,881 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-11 12:42:51,881 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-11 12:42:51,912 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-11 12:42:51,912 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-04-11 12:42:51,912 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-04-11 12:42:51,912 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-04-11 12:42:51,912 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-04-11 12:42:51,912 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-04-11 12:42:51,913 INFO L87 Difference]: Start difference. First operand 135 states and 143 transitions. Second operand 5 states. [2018-04-11 12:42:52,136 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-11 12:42:52,136 INFO L93 Difference]: Finished difference Result 233 states and 248 transitions. [2018-04-11 12:42:52,136 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-04-11 12:42:52,136 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 29 [2018-04-11 12:42:52,137 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-11 12:42:52,137 INFO L225 Difference]: With dead ends: 233 [2018-04-11 12:42:52,137 INFO L226 Difference]: Without dead ends: 233 [2018-04-11 12:42:52,138 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-11 12:42:52,138 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 233 states. [2018-04-11 12:42:52,140 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 233 to 134. [2018-04-11 12:42:52,140 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 134 states. [2018-04-11 12:42:52,141 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 134 states to 134 states and 142 transitions. [2018-04-11 12:42:52,141 INFO L78 Accepts]: Start accepts. Automaton has 134 states and 142 transitions. Word has length 29 [2018-04-11 12:42:52,141 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-11 12:42:52,141 INFO L459 AbstractCegarLoop]: Abstraction has 134 states and 142 transitions. [2018-04-11 12:42:52,141 INFO L460 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-04-11 12:42:52,141 INFO L276 IsEmpty]: Start isEmpty. Operand 134 states and 142 transitions. [2018-04-11 12:42:52,142 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2018-04-11 12:42:52,142 INFO L347 BasicCegarLoop]: Found error trace [2018-04-11 12:42:52,142 INFO L355 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-11 12:42:52,142 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-11 12:42:52,143 INFO L82 PathProgramCache]: Analyzing trace with hash 759542752, now seen corresponding path program 1 times [2018-04-11 12:42:52,143 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-04-11 12:42:52,143 INFO L68 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-04-11 12:42:52,144 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 12:42:52,144 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-11 12:42:52,144 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 12:42:52,153 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-11 12:42:52,154 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-11 12:42:52,183 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-11 12:42:52,183 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-04-11 12:42:52,183 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-04-11 12:42:52,183 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-04-11 12:42:52,184 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-04-11 12:42:52,184 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-04-11 12:42:52,184 INFO L87 Difference]: Start difference. First operand 134 states and 142 transitions. Second operand 5 states. [2018-04-11 12:42:52,357 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-11 12:42:52,357 INFO L93 Difference]: Finished difference Result 204 states and 218 transitions. [2018-04-11 12:42:52,358 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-04-11 12:42:52,358 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 29 [2018-04-11 12:42:52,358 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-11 12:42:52,358 INFO L225 Difference]: With dead ends: 204 [2018-04-11 12:42:52,358 INFO L226 Difference]: Without dead ends: 204 [2018-04-11 12:42:52,359 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-11 12:42:52,359 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 204 states. [2018-04-11 12:42:52,360 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 204 to 133. [2018-04-11 12:42:52,360 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 133 states. [2018-04-11 12:42:52,360 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 133 states to 133 states and 141 transitions. [2018-04-11 12:42:52,361 INFO L78 Accepts]: Start accepts. Automaton has 133 states and 141 transitions. Word has length 29 [2018-04-11 12:42:52,361 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-11 12:42:52,361 INFO L459 AbstractCegarLoop]: Abstraction has 133 states and 141 transitions. [2018-04-11 12:42:52,361 INFO L460 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-04-11 12:42:52,361 INFO L276 IsEmpty]: Start isEmpty. Operand 133 states and 141 transitions. [2018-04-11 12:42:52,361 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2018-04-11 12:42:52,361 INFO L347 BasicCegarLoop]: Found error trace [2018-04-11 12:42:52,361 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-11 12:42:52,361 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-11 12:42:52,361 INFO L82 PathProgramCache]: Analyzing trace with hash -375834398, now seen corresponding path program 1 times [2018-04-11 12:42:52,361 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-04-11 12:42:52,362 INFO L68 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-04-11 12:42:52,362 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 12:42:52,362 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-11 12:42:52,362 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 12:42:52,370 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-11 12:42:52,370 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-11 12:42:52,413 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-11 12:42:52,413 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-04-11 12:42:52,413 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-04-11 12:42:52,413 INFO L442 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-04-11 12:42:52,413 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-04-11 12:42:52,413 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2018-04-11 12:42:52,413 INFO L87 Difference]: Start difference. First operand 133 states and 141 transitions. Second operand 8 states. [2018-04-11 12:42:52,683 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-11 12:42:52,683 INFO L93 Difference]: Finished difference Result 139 states and 147 transitions. [2018-04-11 12:42:52,683 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-04-11 12:42:52,683 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 33 [2018-04-11 12:42:52,684 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-11 12:42:52,684 INFO L225 Difference]: With dead ends: 139 [2018-04-11 12:42:52,684 INFO L226 Difference]: Without dead ends: 139 [2018-04-11 12:42:52,685 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=44, Invalid=88, Unknown=0, NotChecked=0, Total=132 [2018-04-11 12:42:52,685 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 139 states. [2018-04-11 12:42:52,687 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 139 to 132. [2018-04-11 12:42:52,687 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 132 states. [2018-04-11 12:42:52,688 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 132 states to 132 states and 140 transitions. [2018-04-11 12:42:52,688 INFO L78 Accepts]: Start accepts. Automaton has 132 states and 140 transitions. Word has length 33 [2018-04-11 12:42:52,688 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-11 12:42:52,688 INFO L459 AbstractCegarLoop]: Abstraction has 132 states and 140 transitions. [2018-04-11 12:42:52,688 INFO L460 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-04-11 12:42:52,688 INFO L276 IsEmpty]: Start isEmpty. Operand 132 states and 140 transitions. [2018-04-11 12:42:52,689 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2018-04-11 12:42:52,689 INFO L347 BasicCegarLoop]: Found error trace [2018-04-11 12:42:52,689 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-11 12:42:52,689 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-11 12:42:52,689 INFO L82 PathProgramCache]: Analyzing trace with hash -375834397, now seen corresponding path program 1 times [2018-04-11 12:42:52,689 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-04-11 12:42:52,689 INFO L68 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-04-11 12:42:52,691 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 12:42:52,691 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-11 12:42:52,691 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 12:42:52,703 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-11 12:42:52,704 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-11 12:42:52,799 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-11 12:42:52,799 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-04-11 12:42:52,799 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2018-04-11 12:42:52,800 INFO L442 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-04-11 12:42:52,800 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-04-11 12:42:52,800 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2018-04-11 12:42:52,800 INFO L87 Difference]: Start difference. First operand 132 states and 140 transitions. Second operand 9 states. [2018-04-11 12:42:53,033 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-11 12:42:53,033 INFO L93 Difference]: Finished difference Result 136 states and 144 transitions. [2018-04-11 12:42:53,033 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-04-11 12:42:53,033 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 33 [2018-04-11 12:42:53,034 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-11 12:42:53,034 INFO L225 Difference]: With dead ends: 136 [2018-04-11 12:42:53,034 INFO L226 Difference]: Without dead ends: 136 [2018-04-11 12:42:53,034 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=50, Invalid=132, Unknown=0, NotChecked=0, Total=182 [2018-04-11 12:42:53,035 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 136 states. [2018-04-11 12:42:53,036 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 136 to 118. [2018-04-11 12:42:53,036 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 118 states. [2018-04-11 12:42:53,037 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 118 states to 118 states and 125 transitions. [2018-04-11 12:42:53,037 INFO L78 Accepts]: Start accepts. Automaton has 118 states and 125 transitions. Word has length 33 [2018-04-11 12:42:53,037 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-11 12:42:53,037 INFO L459 AbstractCegarLoop]: Abstraction has 118 states and 125 transitions. [2018-04-11 12:42:53,037 INFO L460 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-04-11 12:42:53,037 INFO L276 IsEmpty]: Start isEmpty. Operand 118 states and 125 transitions. [2018-04-11 12:42:53,038 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2018-04-11 12:42:53,038 INFO L347 BasicCegarLoop]: Found error trace [2018-04-11 12:42:53,038 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-11 12:42:53,038 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-11 12:42:53,038 INFO L82 PathProgramCache]: Analyzing trace with hash -736807832, now seen corresponding path program 1 times [2018-04-11 12:42:53,038 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-04-11 12:42:53,039 INFO L68 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-04-11 12:42:53,040 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 12:42:53,040 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-11 12:42:53,040 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 12:42:53,046 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-11 12:42:53,047 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-11 12:42:53,095 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-11 12:42:53,095 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-04-11 12:42:53,095 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-04-11 12:42:53,095 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-04-11 12:42:53,096 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-04-11 12:42:53,096 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-04-11 12:42:53,096 INFO L87 Difference]: Start difference. First operand 118 states and 125 transitions. Second operand 5 states. [2018-04-11 12:42:53,173 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-11 12:42:53,174 INFO L93 Difference]: Finished difference Result 138 states and 145 transitions. [2018-04-11 12:42:53,174 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-04-11 12:42:53,174 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 35 [2018-04-11 12:42:53,174 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-11 12:42:53,174 INFO L225 Difference]: With dead ends: 138 [2018-04-11 12:42:53,174 INFO L226 Difference]: Without dead ends: 123 [2018-04-11 12:42:53,175 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 3 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-11 12:42:53,175 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 123 states. [2018-04-11 12:42:53,176 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 123 to 121. [2018-04-11 12:42:53,177 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 121 states. [2018-04-11 12:42:53,177 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 121 states to 121 states and 128 transitions. [2018-04-11 12:42:53,177 INFO L78 Accepts]: Start accepts. Automaton has 121 states and 128 transitions. Word has length 35 [2018-04-11 12:42:53,177 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-11 12:42:53,178 INFO L459 AbstractCegarLoop]: Abstraction has 121 states and 128 transitions. [2018-04-11 12:42:53,178 INFO L460 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-04-11 12:42:53,178 INFO L276 IsEmpty]: Start isEmpty. Operand 121 states and 128 transitions. [2018-04-11 12:42:53,178 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2018-04-11 12:42:53,178 INFO L347 BasicCegarLoop]: Found error trace [2018-04-11 12:42:53,179 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-11 12:42:53,179 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-11 12:42:53,179 INFO L82 PathProgramCache]: Analyzing trace with hash -799952616, now seen corresponding path program 1 times [2018-04-11 12:42:53,179 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-04-11 12:42:53,179 INFO L68 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-04-11 12:42:53,180 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 12:42:53,180 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-11 12:42:53,180 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 12:42:53,190 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-11 12:42:53,191 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-11 12:42:53,406 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-11 12:42:53,407 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-04-11 12:42:53,407 INFO L213 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-04-11 12:42:53,414 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-11 12:42:53,444 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-11 12:42:53,452 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-11 12:42:53,533 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 12:42:53,534 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 12:42:53,542 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-11 12:42:53,543 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-11 12:42:53,549 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 12:42:53,549 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:23, output treesize:21 [2018-04-11 12:42:53,573 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 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-11 12:42:53,576 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-11 12:42:53,576 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 12:42:53,578 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 12:42:53,588 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-11 12:42:53,588 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:32, output treesize:29 [2018-04-11 12:42:53,638 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 12:42:53,641 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-11 12:42:53,643 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 13 [2018-04-11 12:42:53,644 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 12:42:53,648 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 12:42:53,655 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-11 12:42:53,655 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:50, output treesize:42 [2018-04-11 12:42:53,765 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 50 treesize of output 40 [2018-04-11 12:42:53,774 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 2 case distinctions, treesize of input 20 treesize of output 31 [2018-04-11 12:42:53,775 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 2 xjuncts. [2018-04-11 12:42:53,786 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-04-11 12:42:53,803 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-11 12:42:53,803 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:55, output treesize:82 [2018-04-11 12:42:53,924 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 24 [2018-04-11 12:42:53,926 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-11 12:42:53,927 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 12:42:53,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 5 treesize of output 1 [2018-04-11 12:42:53,930 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-04-11 12:42:53,932 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 12:42:53,935 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-11 12:42:53,935 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 4 variables, input treesize:41, output treesize:15 [2018-04-11 12:42:53,983 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-11 12:42:54,000 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-04-11 12:42:54,001 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 13] total 28 [2018-04-11 12:42:54,001 INFO L442 AbstractCegarLoop]: Interpolant automaton has 29 states [2018-04-11 12:42:54,001 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2018-04-11 12:42:54,001 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=124, Invalid=688, Unknown=0, NotChecked=0, Total=812 [2018-04-11 12:42:54,002 INFO L87 Difference]: Start difference. First operand 121 states and 128 transitions. Second operand 29 states. [2018-04-11 12:42:55,265 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-11 12:42:55,265 INFO L93 Difference]: Finished difference Result 241 states and 255 transitions. [2018-04-11 12:42:55,265 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 35 states. [2018-04-11 12:42:55,265 INFO L78 Accepts]: Start accepts. Automaton has 29 states. Word has length 49 [2018-04-11 12:42:55,266 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-11 12:42:55,266 INFO L225 Difference]: With dead ends: 241 [2018-04-11 12:42:55,266 INFO L226 Difference]: Without dead ends: 241 [2018-04-11 12:42:55,267 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 97 GetRequests, 38 SyntacticMatches, 0 SemanticMatches, 59 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 994 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=786, Invalid=2874, Unknown=0, NotChecked=0, Total=3660 [2018-04-11 12:42:55,267 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 241 states. [2018-04-11 12:42:55,270 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 241 to 156. [2018-04-11 12:42:55,270 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 156 states. [2018-04-11 12:42:55,270 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 156 states to 156 states and 167 transitions. [2018-04-11 12:42:55,271 INFO L78 Accepts]: Start accepts. Automaton has 156 states and 167 transitions. Word has length 49 [2018-04-11 12:42:55,271 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-11 12:42:55,271 INFO L459 AbstractCegarLoop]: Abstraction has 156 states and 167 transitions. [2018-04-11 12:42:55,271 INFO L460 AbstractCegarLoop]: Interpolant automaton has 29 states. [2018-04-11 12:42:55,271 INFO L276 IsEmpty]: Start isEmpty. Operand 156 states and 167 transitions. [2018-04-11 12:42:55,271 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2018-04-11 12:42:55,272 INFO L347 BasicCegarLoop]: Found error trace [2018-04-11 12:42:55,272 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-11 12:42:55,272 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-11 12:42:55,272 INFO L82 PathProgramCache]: Analyzing trace with hash -799952615, now seen corresponding path program 1 times [2018-04-11 12:42:55,272 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-04-11 12:42:55,272 INFO L68 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-04-11 12:42:55,273 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 12:42:55,273 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-11 12:42:55,273 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 12:42:55,284 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-11 12:42:55,285 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-11 12:42:55,552 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-11 12:42:55,560 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-04-11 12:42:55,560 INFO L213 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-04-11 12:42:55,565 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-11 12:42:55,580 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-11 12:42:55,583 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-11 12:42:55,612 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 12:42:55,612 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 12:42:55,613 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-11 12:42:55,613 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-11 12:42:55,618 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 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-11 12:42:55,618 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 12:42:55,622 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 12:42:55,622 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:26, output treesize:19 [2018-04-11 12:42:55,640 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 8 [2018-04-11 12:42:55,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, 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-11 12:42:55,642 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 12:42:55,644 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 12:42:55,655 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-11 12:42:55,657 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select 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-11 12:42:55,657 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-04-11 12:42:55,658 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 12:42:55,665 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-11 12:42:55,665 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 3 variables, input treesize:38, output treesize:31 [2018-04-11 12:42:55,703 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 12:42:55,705 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 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-11 12:42:55,707 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 13 [2018-04-11 12:42:55,707 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 12:42:55,713 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 12:42:55,728 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 12:42:55,731 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-11 12:42:55,735 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select 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-11 12:42:55,735 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-04-11 12:42:55,738 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 12:42:55,745 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-11 12:42:55,746 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 3 variables, input treesize:73, output treesize:57 [2018-04-11 12:42:55,912 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-11 12:42:55,924 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 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-11 12:42:55,925 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 2 xjuncts. [2018-04-11 12:42:55,940 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-04-11 12:42:55,969 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 60 [2018-04-11 12:42:55,971 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 17 [2018-04-11 12:42:55,972 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-04-11 12:42:55,977 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 12:42:55,980 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-11 12:42:55,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-11 12:42:55,987 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 2 xjuncts. [2018-04-11 12:42:55,997 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-04-11 12:42:56,015 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-11 12:42:56,015 INFO L202 ElimStorePlain]: Needed 7 recursive calls to eliminate 4 variables, input treesize:89, output treesize:121 [2018-04-11 12:42:56,125 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 47 treesize of output 33 [2018-04-11 12:42:56,127 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 17 [2018-04-11 12:42:56,127 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 12:42:56,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 5 treesize of output 1 [2018-04-11 12:42:56,133 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-04-11 12:42:56,136 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 12:42:56,142 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-11 12:42:56,143 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select 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-11 12:42:56,144 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2018-04-11 12:42:56,147 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 1 [2018-04-11 12:42:56,147 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2018-04-11 12:42:56,148 INFO L267 ElimStorePlain]: Start of recursive call 5: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 12:42:56,150 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-11 12:42:56,150 INFO L202 ElimStorePlain]: Needed 7 recursive calls to eliminate 5 variables, input treesize:61, output treesize:9 [2018-04-11 12:42:56,177 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-11 12:42:56,195 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-04-11 12:42:56,195 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 13] total 27 [2018-04-11 12:42:56,196 INFO L442 AbstractCegarLoop]: Interpolant automaton has 28 states [2018-04-11 12:42:56,196 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. [2018-04-11 12:42:56,196 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=90, Invalid=666, Unknown=0, NotChecked=0, Total=756 [2018-04-11 12:42:56,196 INFO L87 Difference]: Start difference. First operand 156 states and 167 transitions. Second operand 28 states. [2018-04-11 12:42:57,447 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-11 12:42:57,447 INFO L93 Difference]: Finished difference Result 247 states and 264 transitions. [2018-04-11 12:42:57,447 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2018-04-11 12:42:57,447 INFO L78 Accepts]: Start accepts. Automaton has 28 states. Word has length 49 [2018-04-11 12:42:57,448 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-11 12:42:57,448 INFO L225 Difference]: With dead ends: 247 [2018-04-11 12:42:57,448 INFO L226 Difference]: Without dead ends: 247 [2018-04-11 12:42:57,449 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 93 GetRequests, 39 SyntacticMatches, 1 SemanticMatches, 53 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 748 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=570, Invalid=2400, Unknown=0, NotChecked=0, Total=2970 [2018-04-11 12:42:57,450 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 247 states. [2018-04-11 12:42:57,452 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 247 to 158. [2018-04-11 12:42:57,452 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 158 states. [2018-04-11 12:42:57,453 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 158 states to 158 states and 169 transitions. [2018-04-11 12:42:57,453 INFO L78 Accepts]: Start accepts. Automaton has 158 states and 169 transitions. Word has length 49 [2018-04-11 12:42:57,453 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-11 12:42:57,453 INFO L459 AbstractCegarLoop]: Abstraction has 158 states and 169 transitions. [2018-04-11 12:42:57,453 INFO L460 AbstractCegarLoop]: Interpolant automaton has 28 states. [2018-04-11 12:42:57,453 INFO L276 IsEmpty]: Start isEmpty. Operand 158 states and 169 transitions. [2018-04-11 12:42:57,454 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2018-04-11 12:42:57,454 INFO L347 BasicCegarLoop]: Found error trace [2018-04-11 12:42:57,454 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-11 12:42:57,454 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-11 12:42:57,454 INFO L82 PathProgramCache]: Analyzing trace with hash -7091430, now seen corresponding path program 1 times [2018-04-11 12:42:57,454 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-04-11 12:42:57,454 INFO L68 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-04-11 12:42:57,455 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 12:42:57,455 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-11 12:42:57,456 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 12:42:57,468 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-11 12:42:57,469 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-11 12:42:58,035 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-11 12:42:58,036 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-04-11 12:42:58,036 INFO L213 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-04-11 12:42:58,041 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-11 12:42:58,069 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-11 12:42:58,072 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-11 12:42:58,108 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 12:42:58,109 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 12:42:58,109 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-11 12:42:58,109 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-11 12:42:58,114 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 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-11 12:42:58,115 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 12:42:58,119 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 12:42:58,119 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:26, output treesize:19 [2018-04-11 12:42:58,138 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-11 12:42:58,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 8 treesize of output 7 [2018-04-11 12:42:58,140 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 12:42:58,141 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 12:42:58,148 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-11 12:42:58,149 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 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-11 12:42:58,149 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-04-11 12:42:58,151 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 12:42:58,156 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-11 12:42:58,156 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 3 variables, input treesize:38, output treesize:31 [2018-04-11 12:42:58,203 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 12:42:58,205 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-11 12:42:58,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 14 treesize of output 13 [2018-04-11 12:42:58,207 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 12:42:58,211 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 12:42:58,220 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 12:42:58,222 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 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-11 12:42:58,228 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 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-11 12:42:58,228 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-04-11 12:42:58,233 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 12:42:58,242 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-11 12:42:58,242 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 3 variables, input treesize:73, output treesize:57 [2018-04-11 12:42:58,328 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 32 treesize of output 38 [2018-04-11 12:42:58,334 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-11 12:42:58,335 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 2 xjuncts. [2018-04-11 12:42:58,344 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-04-11 12:42:58,363 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 80 treesize of output 75 [2018-04-11 12:42:58,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-11 12:42:58,370 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 2 xjuncts. [2018-04-11 12:42:58,384 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-04-11 12:42:58,389 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 72 treesize of output 67 [2018-04-11 12:42:58,391 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 13 [2018-04-11 12:42:58,392 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2018-04-11 12:42:58,398 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 12:42:58,424 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-11 12:42:58,424 INFO L202 ElimStorePlain]: Needed 7 recursive calls to eliminate 3 variables, input treesize:83, output treesize:129 [2018-04-11 12:42:58,472 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 21 treesize of output 3 [2018-04-11 12:42:58,472 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-11 12:42:58,482 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 14 [2018-04-11 12:42:58,483 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select 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-11 12:42:58,483 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-04-11 12:42:58,484 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 12:42:58,490 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-04-11 12:42:58,490 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 3 variables, input treesize:82, output treesize:57 [2018-04-11 12:42:58,586 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-11 12:42:58,588 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 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-11 12:42:58,588 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 12:42:58,593 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 21 [2018-04-11 12:42:58,594 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-04-11 12:42:58,597 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 12:42:58,604 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-11 12:42:58,606 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select 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-11 12:42:58,606 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2018-04-11 12:42:58,610 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select 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-11 12:42:58,610 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2018-04-11 12:42:58,611 INFO L267 ElimStorePlain]: Start of recursive call 5: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 12:42:58,615 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-11 12:42:58,616 INFO L202 ElimStorePlain]: Needed 7 recursive calls to eliminate 5 variables, input treesize:71, output treesize:19 [2018-04-11 12:42:58,672 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 15 [2018-04-11 12:42:58,676 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 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-11 12:42:58,677 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 2 xjuncts. [2018-04-11 12:42:58,679 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-04-11 12:42:58,685 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 2 xjuncts. [2018-04-11 12:42:58,685 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:28, output treesize:21 [2018-04-11 12:42:58,747 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-11 12:42:58,765 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-04-11 12:42:58,765 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [23, 17] total 39 [2018-04-11 12:42:58,765 INFO L442 AbstractCegarLoop]: Interpolant automaton has 39 states [2018-04-11 12:42:58,765 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 39 interpolants. [2018-04-11 12:42:58,765 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=119, Invalid=1362, Unknown=1, NotChecked=0, Total=1482 [2018-04-11 12:42:58,765 INFO L87 Difference]: Start difference. First operand 158 states and 169 transitions. Second operand 39 states. [2018-04-11 12:43:01,183 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-11 12:43:01,183 INFO L93 Difference]: Finished difference Result 245 states and 261 transitions. [2018-04-11 12:43:01,201 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 31 states. [2018-04-11 12:43:01,201 INFO L78 Accepts]: Start accepts. Automaton has 39 states. Word has length 53 [2018-04-11 12:43:01,201 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-11 12:43:01,202 INFO L225 Difference]: With dead ends: 245 [2018-04-11 12:43:01,202 INFO L226 Difference]: Without dead ends: 245 [2018-04-11 12:43:01,203 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 105 GetRequests, 39 SyntacticMatches, 2 SemanticMatches, 64 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1006 ImplicationChecksByTransitivity, 2.0s TimeCoverageRelationStatistics Valid=594, Invalid=3694, Unknown=2, NotChecked=0, Total=4290 [2018-04-11 12:43:01,203 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 245 states. [2018-04-11 12:43:01,204 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 245 to 155. [2018-04-11 12:43:01,204 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 155 states. [2018-04-11 12:43:01,205 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 155 states to 155 states and 165 transitions. [2018-04-11 12:43:01,205 INFO L78 Accepts]: Start accepts. Automaton has 155 states and 165 transitions. Word has length 53 [2018-04-11 12:43:01,205 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-11 12:43:01,205 INFO L459 AbstractCegarLoop]: Abstraction has 155 states and 165 transitions. [2018-04-11 12:43:01,205 INFO L460 AbstractCegarLoop]: Interpolant automaton has 39 states. [2018-04-11 12:43:01,205 INFO L276 IsEmpty]: Start isEmpty. Operand 155 states and 165 transitions. [2018-04-11 12:43:01,206 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2018-04-11 12:43:01,206 INFO L347 BasicCegarLoop]: Found error trace [2018-04-11 12:43:01,206 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-11 12:43:01,206 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-11 12:43:01,206 INFO L82 PathProgramCache]: Analyzing trace with hash -698335515, now seen corresponding path program 1 times [2018-04-11 12:43:01,206 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-04-11 12:43:01,206 INFO L68 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-04-11 12:43:01,207 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 12:43:01,207 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-11 12:43:01,207 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 12:43:01,216 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-11 12:43:01,216 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-11 12:43:01,427 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-11 12:43:01,427 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-04-11 12:43:01,428 INFO L213 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-04-11 12:43:01,433 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-11 12:43:01,455 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-11 12:43:01,457 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-11 12:43:01,463 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 12:43:01,464 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 12:43:01,465 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 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-11 12:43:01,465 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-11 12:43:01,468 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 12:43:01,468 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:17, output treesize:11 [2018-04-11 12:43:01,473 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-11 12:43:01,475 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-11 12:43:01,475 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 12:43:01,476 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 12:43:01,481 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-11 12:43:01,482 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:27, output treesize:20 [2018-04-11 12:43:01,507 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 26 [2018-04-11 12:43:01,510 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select 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-11 12:43:01,510 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 12:43:01,522 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 12:43:01,530 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-11 12:43:01,530 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:41, output treesize:33 [2018-04-11 12:43:01,597 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 40 treesize of output 35 [2018-04-11 12:43:01,622 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 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-11 12:43:01,622 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 2 xjuncts. [2018-04-11 12:43:01,632 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-04-11 12:43:01,647 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 2 xjuncts. [2018-04-11 12:43:01,647 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:50, output treesize:76 [2018-04-11 12:43:01,708 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 12:43:01,708 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 12:43:01,709 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 12:43:01,710 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 12:43:01,711 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 13 [2018-04-11 12:43:01,711 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-11 12:43:01,717 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 12:43:01,717 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:38, output treesize:31 [2018-04-11 12:43:01,826 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 12:43:01,873 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 34 treesize of output 33 [2018-04-11 12:43:01,877 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-11 12:43:01,877 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 12:43:01,883 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 12:43:01,891 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-11 12:43:01,891 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:47, output treesize:37 [2018-04-11 12:43:01,951 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 12:43:01,955 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 53 treesize of output 53 [2018-04-11 12:43:01,958 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-11 12:43:01,958 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 12:43:01,964 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 12:43:01,970 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-11 12:43:01,970 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:58, output treesize:50 [2018-04-11 12:43:02,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, 3 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 94 treesize of output 71 [2018-04-11 12:43:02,054 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-11 12:43:02,054 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 2 xjuncts. [2018-04-11 12:43:02,065 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-04-11 12:43:02,084 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-11 12:43:02,084 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:94, output treesize:144 [2018-04-11 12:43:02,217 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 68 treesize of output 43 [2018-04-11 12:43:02,223 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select 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-11 12:43:02,223 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 12:43:02,229 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11 [2018-04-11 12:43:02,229 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-04-11 12:43:02,233 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-11 12:43:02,233 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-04-11 12:43:02,235 INFO L267 ElimStorePlain]: Start of recursive call 2: 3 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 12:43:02,237 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-11 12:43:02,237 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 5 variables, input treesize:68, output treesize:5 [2018-04-11 12:43:02,255 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-11 12:43:02,273 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-04-11 12:43:02,273 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [19, 20] total 31 [2018-04-11 12:43:02,273 INFO L442 AbstractCegarLoop]: Interpolant automaton has 32 states [2018-04-11 12:43:02,273 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 32 interpolants. [2018-04-11 12:43:02,274 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=126, Invalid=866, Unknown=0, NotChecked=0, Total=992 [2018-04-11 12:43:02,274 INFO L87 Difference]: Start difference. First operand 155 states and 165 transitions. Second operand 32 states. [2018-04-11 12:43:03,604 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-11 12:43:03,604 INFO L93 Difference]: Finished difference Result 313 states and 332 transitions. [2018-04-11 12:43:03,604 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 36 states. [2018-04-11 12:43:03,604 INFO L78 Accepts]: Start accepts. Automaton has 32 states. Word has length 58 [2018-04-11 12:43:03,604 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-11 12:43:03,605 INFO L225 Difference]: With dead ends: 313 [2018-04-11 12:43:03,605 INFO L226 Difference]: Without dead ends: 313 [2018-04-11 12:43:03,606 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 105 GetRequests, 41 SyntacticMatches, 6 SemanticMatches, 58 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1010 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=502, Invalid=3038, Unknown=0, NotChecked=0, Total=3540 [2018-04-11 12:43:03,606 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 313 states. [2018-04-11 12:43:03,607 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 313 to 189. [2018-04-11 12:43:03,607 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 189 states. [2018-04-11 12:43:03,608 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 189 states to 189 states and 202 transitions. [2018-04-11 12:43:03,608 INFO L78 Accepts]: Start accepts. Automaton has 189 states and 202 transitions. Word has length 58 [2018-04-11 12:43:03,608 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-11 12:43:03,608 INFO L459 AbstractCegarLoop]: Abstraction has 189 states and 202 transitions. [2018-04-11 12:43:03,608 INFO L460 AbstractCegarLoop]: Interpolant automaton has 32 states. [2018-04-11 12:43:03,608 INFO L276 IsEmpty]: Start isEmpty. Operand 189 states and 202 transitions. [2018-04-11 12:43:03,609 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2018-04-11 12:43:03,609 INFO L347 BasicCegarLoop]: Found error trace [2018-04-11 12:43:03,609 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-11 12:43:03,609 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-11 12:43:03,609 INFO L82 PathProgramCache]: Analyzing trace with hash -698335514, now seen corresponding path program 1 times [2018-04-11 12:43:03,609 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-04-11 12:43:03,609 INFO L68 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-04-11 12:43:03,610 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 12:43:03,610 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-11 12:43:03,610 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 12:43:03,620 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-11 12:43:03,621 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-11 12:43:03,894 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-11 12:43:03,895 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-04-11 12:43:03,895 INFO L213 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-04-11 12:43:03,900 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-11 12:43:03,922 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-11 12:43:03,924 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-11 12:43:03,929 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 12:43:03,930 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 12:43:03,930 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-11 12:43:03,930 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-11 12:43:03,933 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 12:43:03,933 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:20, output treesize:14 [2018-04-11 12:43:03,948 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 8 [2018-04-11 12:43:03,949 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-11 12:43:03,950 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 12:43:03,951 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 12:43:03,957 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-11 12:43:03,958 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select 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-11 12:43:03,958 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-04-11 12:43:03,960 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 12:43:03,965 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-11 12:43:03,966 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 3 variables, input treesize:38, output treesize:27 [2018-04-11 12:43:04,009 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 12:43:04,012 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 51 treesize of output 55 [2018-04-11 12:43:04,013 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 13 [2018-04-11 12:43:04,013 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 12:43:04,017 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 12:43:04,027 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 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-11 12:43:04,035 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 13 [2018-04-11 12:43:04,036 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-04-11 12:43:04,039 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 12:43:04,045 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-11 12:43:04,045 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 3 variables, input treesize:69, output treesize:53 [2018-04-11 12:43:04,123 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-11 12:43:04,131 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-11 12:43:04,131 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 2 xjuncts. [2018-04-11 12:43:04,141 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-04-11 12:43:04,165 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 59 treesize of output 58 [2018-04-11 12:43:04,167 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 17 [2018-04-11 12:43:04,167 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-04-11 12:43:04,174 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 12:43:04,179 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 63 treesize of output 68 [2018-04-11 12:43:04,185 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-11 12:43:04,186 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 2 xjuncts. [2018-04-11 12:43:04,197 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-04-11 12:43:04,227 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-11 12:43:04,228 INFO L202 ElimStorePlain]: Needed 7 recursive calls to eliminate 3 variables, input treesize:84, output treesize:137 [2018-04-11 12:43:04,340 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 12:43:04,341 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 21 [2018-04-11 12:43:04,342 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-11 12:43:04,376 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 12:43:04,377 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 12:43:04,378 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 12:43:04,379 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 12:43:04,379 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 13 [2018-04-11 12:43:04,380 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 12:43:04,395 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 12:43:04,395 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:72, output treesize:68 [2018-04-11 12:43:04,437 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 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-11 12:43:04,441 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 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-11 12:43:04,442 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 12:43:04,446 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 12:43:04,460 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 12:43:04,469 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 56 treesize of output 55 [2018-04-11 12:43:04,471 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-11 12:43:04,472 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-04-11 12:43:04,486 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 12:43:04,497 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-11 12:43:04,497 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 4 variables, input treesize:90, output treesize:62 [2018-04-11 12:43:04,563 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-11 12:43:04,574 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 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-11 12:43:04,574 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 12:43:04,590 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 12:43:04,606 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 12:43:04,611 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 86 treesize of output 86 [2018-04-11 12:43:04,613 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 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-11 12:43:04,613 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-04-11 12:43:04,623 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 12:43:04,635 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-11 12:43:04,635 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 3 variables, input treesize:104, output treesize:88 [2018-04-11 12:43:04,743 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 52 treesize of output 43 [2018-04-11 12:43:04,750 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-11 12:43:04,751 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 2 xjuncts. [2018-04-11 12:43:04,760 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-04-11 12:43:04,785 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 136 treesize of output 105 [2018-04-11 12:43:04,788 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-11 12:43:04,788 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-04-11 12:43:04,798 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 12:43:04,804 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 148 treesize of output 113 [2018-04-11 12:43:04,811 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 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-11 12:43:04,811 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 2 xjuncts. [2018-04-11 12:43:04,829 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-04-11 12:43:04,874 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-11 12:43:04,874 INFO L202 ElimStorePlain]: Needed 7 recursive calls to eliminate 5 variables, input treesize:163, output treesize:241 [2018-04-11 12:43:05,041 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 98 treesize of output 61 [2018-04-11 12:43:05,052 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 23 [2018-04-11 12:43:05,053 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-11 12:43:05,065 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select 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-11 12:43:05,065 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-04-11 12:43:05,076 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 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-11 12:43:05,076 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-04-11 12:43:05,087 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-11 12:43:05,101 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-11 12:43:05,103 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 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-11 12:43:05,103 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2018-04-11 12:43:05,108 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 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-11 12:43:05,108 INFO L267 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 1 xjuncts. [2018-04-11 12:43:05,109 INFO L267 ElimStorePlain]: Start of recursive call 6: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 12:43:05,118 INFO L267 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 2 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-04-11 12:43:05,118 INFO L202 ElimStorePlain]: Needed 8 recursive calls to eliminate 6 variables, input treesize:115, output treesize:18 [2018-04-11 12:43:05,232 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-11 12:43:05,262 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-04-11 12:43:05,262 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [19, 21] total 37 [2018-04-11 12:43:05,262 INFO L442 AbstractCegarLoop]: Interpolant automaton has 38 states [2018-04-11 12:43:05,262 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 38 interpolants. [2018-04-11 12:43:05,262 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=120, Invalid=1286, Unknown=0, NotChecked=0, Total=1406 [2018-04-11 12:43:05,262 INFO L87 Difference]: Start difference. First operand 189 states and 202 transitions. Second operand 38 states. [2018-04-11 12:43:07,772 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-11 12:43:07,772 INFO L93 Difference]: Finished difference Result 321 states and 344 transitions. [2018-04-11 12:43:07,772 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 34 states. [2018-04-11 12:43:07,772 INFO L78 Accepts]: Start accepts. Automaton has 38 states. Word has length 58 [2018-04-11 12:43:07,772 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-11 12:43:07,774 INFO L225 Difference]: With dead ends: 321 [2018-04-11 12:43:07,774 INFO L226 Difference]: Without dead ends: 321 [2018-04-11 12:43:07,775 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 106 GetRequests, 40 SyntacticMatches, 2 SemanticMatches, 64 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 968 ImplicationChecksByTransitivity, 1.9s TimeCoverageRelationStatistics Valid=488, Invalid=3802, Unknown=0, NotChecked=0, Total=4290 [2018-04-11 12:43:07,775 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 321 states. [2018-04-11 12:43:07,778 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 321 to 191. [2018-04-11 12:43:07,778 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 191 states. [2018-04-11 12:43:07,778 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 191 states to 191 states and 204 transitions. [2018-04-11 12:43:07,779 INFO L78 Accepts]: Start accepts. Automaton has 191 states and 204 transitions. Word has length 58 [2018-04-11 12:43:07,779 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-11 12:43:07,779 INFO L459 AbstractCegarLoop]: Abstraction has 191 states and 204 transitions. [2018-04-11 12:43:07,779 INFO L460 AbstractCegarLoop]: Interpolant automaton has 38 states. [2018-04-11 12:43:07,779 INFO L276 IsEmpty]: Start isEmpty. Operand 191 states and 204 transitions. [2018-04-11 12:43:07,780 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2018-04-11 12:43:07,780 INFO L347 BasicCegarLoop]: Found error trace [2018-04-11 12:43:07,780 INFO L355 BasicCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-11 12:43:07,780 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-11 12:43:07,780 INFO L82 PathProgramCache]: Analyzing trace with hash -611631047, now seen corresponding path program 1 times [2018-04-11 12:43:07,780 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-04-11 12:43:07,780 INFO L68 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-04-11 12:43:07,781 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 12:43:07,781 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-11 12:43:07,781 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 12:43:07,789 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-11 12:43:07,790 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-11 12:43:07,828 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2018-04-11 12:43:07,828 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-04-11 12:43:07,828 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-04-11 12:43:07,829 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-04-11 12:43:07,829 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-04-11 12:43:07,829 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-04-11 12:43:07,829 INFO L87 Difference]: Start difference. First operand 191 states and 204 transitions. Second operand 6 states. [2018-04-11 12:43:07,936 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-11 12:43:07,937 INFO L93 Difference]: Finished difference Result 155 states and 162 transitions. [2018-04-11 12:43:07,937 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-04-11 12:43:07,937 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 58 [2018-04-11 12:43:07,937 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-11 12:43:07,937 INFO L225 Difference]: With dead ends: 155 [2018-04-11 12:43:07,937 INFO L226 Difference]: Without dead ends: 155 [2018-04-11 12:43:07,938 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-11 12:43:07,938 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 155 states. [2018-04-11 12:43:07,939 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 155 to 147. [2018-04-11 12:43:07,939 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 147 states. [2018-04-11 12:43:07,939 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 147 states to 147 states and 155 transitions. [2018-04-11 12:43:07,939 INFO L78 Accepts]: Start accepts. Automaton has 147 states and 155 transitions. Word has length 58 [2018-04-11 12:43:07,940 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-11 12:43:07,940 INFO L459 AbstractCegarLoop]: Abstraction has 147 states and 155 transitions. [2018-04-11 12:43:07,940 INFO L460 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-04-11 12:43:07,940 INFO L276 IsEmpty]: Start isEmpty. Operand 147 states and 155 transitions. [2018-04-11 12:43:07,940 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2018-04-11 12:43:07,940 INFO L347 BasicCegarLoop]: Found error trace [2018-04-11 12:43:07,940 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-11 12:43:07,940 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-11 12:43:07,940 INFO L82 PathProgramCache]: Analyzing trace with hash -1513085733, now seen corresponding path program 2 times [2018-04-11 12:43:07,940 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-04-11 12:43:07,940 INFO L68 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-04-11 12:43:07,941 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 12:43:07,941 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-11 12:43:07,942 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 12:43:07,952 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-11 12:43:07,953 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-11 12:43:08,123 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-11 12:43:08,123 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-04-11 12:43:08,123 INFO L213 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-04-11 12:43:08,128 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-04-11 12:43:08,154 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-04-11 12:43:08,154 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-04-11 12:43:08,157 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-11 12:43:08,196 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 12:43:08,197 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 12:43:08,197 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-11 12:43:08,197 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-11 12:43:08,200 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 12:43:08,200 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:20, output treesize:14 [2018-04-11 12:43:08,213 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-11 12:43:08,214 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 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-11 12:43:08,215 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 12:43:08,216 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 12:43:08,221 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-11 12:43:08,221 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:25, output treesize:18 [2018-04-11 12:43:08,278 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 12:43:08,280 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 34 [2018-04-11 12:43:08,282 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select 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-11 12:43:08,282 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 12:43:08,286 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 12:43:08,292 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-11 12:43:08,292 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:39, output treesize:31 [2018-04-11 12:43:08,407 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 68 treesize of output 58 [2018-04-11 12:43:08,415 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-11 12:43:08,416 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 2 xjuncts. [2018-04-11 12:43:08,426 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-04-11 12:43:08,447 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 60 treesize of output 53 [2018-04-11 12:43:08,448 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 15 [2018-04-11 12:43:08,448 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-04-11 12:43:08,453 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 12:43:08,457 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 56 treesize of output 49 [2018-04-11 12:43:08,459 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 15 [2018-04-11 12:43:08,460 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2018-04-11 12:43:08,464 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 12:43:08,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-11 12:43:08,479 INFO L202 ElimStorePlain]: Needed 7 recursive calls to eliminate 3 variables, input treesize:71, output treesize:98 [2018-04-11 12:43:08,629 INFO L682 Elim1Store]: detected equality via solver [2018-04-11 12:43:08,630 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 69 treesize of output 69 [2018-04-11 12:43:08,632 INFO L682 Elim1Store]: detected equality via solver [2018-04-11 12:43:08,632 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 46 treesize of output 30 [2018-04-11 12:43:08,633 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-11 12:43:08,638 INFO L682 Elim1Store]: detected equality via solver [2018-04-11 12:43:08,638 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 15 [2018-04-11 12:43:08,639 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-04-11 12:43:08,642 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-11 12:43:08,648 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 19 [2018-04-11 12:43:08,649 INFO L682 Elim1Store]: detected equality via solver [2018-04-11 12:43:08,649 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 14 [2018-04-11 12:43:08,650 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-11 12:43:08,654 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select 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-11 12:43:08,654 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2018-04-11 12:43:08,655 INFO L267 ElimStorePlain]: Start of recursive call 5: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 12:43:08,658 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-11 12:43:08,658 INFO L202 ElimStorePlain]: Needed 7 recursive calls to eliminate 4 variables, input treesize:75, output treesize:7 [2018-04-11 12:43:08,669 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-11 12:43:08,686 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-04-11 12:43:08,686 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 18] total 29 [2018-04-11 12:43:08,686 INFO L442 AbstractCegarLoop]: Interpolant automaton has 29 states [2018-04-11 12:43:08,686 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2018-04-11 12:43:08,687 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=84, Invalid=725, Unknown=3, NotChecked=0, Total=812 [2018-04-11 12:43:08,687 INFO L87 Difference]: Start difference. First operand 147 states and 155 transitions. Second operand 29 states. [2018-04-11 12:43:09,301 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-11 12:43:09,301 INFO L93 Difference]: Finished difference Result 167 states and 174 transitions. [2018-04-11 12:43:09,301 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2018-04-11 12:43:09,301 INFO L78 Accepts]: Start accepts. Automaton has 29 states. Word has length 59 [2018-04-11 12:43:09,301 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-11 12:43:09,302 INFO L225 Difference]: With dead ends: 167 [2018-04-11 12:43:09,302 INFO L226 Difference]: Without dead ends: 142 [2018-04-11 12:43:09,302 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 91 GetRequests, 46 SyntacticMatches, 1 SemanticMatches, 44 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 349 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=326, Invalid=1741, Unknown=3, NotChecked=0, Total=2070 [2018-04-11 12:43:09,302 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 142 states. [2018-04-11 12:43:09,304 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 142 to 129. [2018-04-11 12:43:09,304 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 129 states. [2018-04-11 12:43:09,304 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 129 states to 129 states and 136 transitions. [2018-04-11 12:43:09,304 INFO L78 Accepts]: Start accepts. Automaton has 129 states and 136 transitions. Word has length 59 [2018-04-11 12:43:09,304 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-11 12:43:09,304 INFO L459 AbstractCegarLoop]: Abstraction has 129 states and 136 transitions. [2018-04-11 12:43:09,304 INFO L460 AbstractCegarLoop]: Interpolant automaton has 29 states. [2018-04-11 12:43:09,304 INFO L276 IsEmpty]: Start isEmpty. Operand 129 states and 136 transitions. [2018-04-11 12:43:09,304 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 63 [2018-04-11 12:43:09,304 INFO L347 BasicCegarLoop]: Found error trace [2018-04-11 12:43:09,305 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-11 12:43:09,305 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-11 12:43:09,305 INFO L82 PathProgramCache]: Analyzing trace with hash 484223591, now seen corresponding path program 1 times [2018-04-11 12:43:09,305 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-04-11 12:43:09,305 INFO L68 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-04-11 12:43:09,305 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 12:43:09,306 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-04-11 12:43:09,306 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 12:43:09,313 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-11 12:43:09,314 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-11 12:43:09,585 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-11 12:43:09,585 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-04-11 12:43:09,586 INFO L213 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-04-11 12:43:09,591 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-11 12:43:09,611 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-11 12:43:09,614 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-11 12:43:09,619 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 12:43:09,619 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 12:43:09,620 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-11 12:43:09,620 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-11 12:43:09,623 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 12:43:09,623 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:20, output treesize:14 [2018-04-11 12:43:09,638 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-11 12:43:09,640 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-11 12:43:09,640 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 12:43:09,641 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 12:43:09,648 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 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-11 12:43:09,649 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-04-11 12:43:09,649 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-04-11 12:43:09,650 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 12:43:09,655 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-11 12:43:09,655 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 3 variables, input treesize:38, output treesize:27 [2018-04-11 12:43:09,696 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 12:43:09,699 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 51 treesize of output 55 [2018-04-11 12:43:09,700 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 13 [2018-04-11 12:43:09,700 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 12:43:09,705 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 12:43:09,715 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-11 12:43:09,716 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 13 [2018-04-11 12:43:09,716 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-04-11 12:43:09,720 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 12:43:09,726 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-11 12:43:09,726 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 3 variables, input treesize:69, output treesize:53 [2018-04-11 12:43:09,826 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 49 [2018-04-11 12:43:09,834 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 2 case distinctions, treesize of input 20 treesize of output 39 [2018-04-11 12:43:09,835 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 2 xjuncts. [2018-04-11 12:43:09,846 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-04-11 12:43:09,869 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 78 treesize of output 69 [2018-04-11 12:43:09,871 INFO L682 Elim1Store]: detected equality via solver [2018-04-11 12:43:09,872 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 17 [2018-04-11 12:43:09,872 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-04-11 12:43:09,879 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 12:43:09,885 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 82 treesize of output 73 [2018-04-11 12:43:09,895 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 31 [2018-04-11 12:43:09,895 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 2 xjuncts. [2018-04-11 12:43:09,922 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-04-11 12:43:09,948 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-11 12:43:09,948 INFO L202 ElimStorePlain]: Needed 7 recursive calls to eliminate 3 variables, input treesize:88, output treesize:155 [2018-04-11 12:43:10,025 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 12:43:10,026 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 12:43:10,026 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 12:43:10,027 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 12:43:10,027 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-11 12:43:10,028 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-11 12:43:10,040 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 12:43:10,040 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:77, output treesize:83 [2018-04-11 12:43:10,076 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 12:43:10,078 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 62 treesize of output 61 [2018-04-11 12:43:10,080 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 26 [2018-04-11 12:43:10,080 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 12:43:10,086 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 12:43:10,101 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 52 treesize of output 58 [2018-04-11 12:43:10,103 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 30 [2018-04-11 12:43:10,104 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-04-11 12:43:10,108 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 12:43:10,117 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-11 12:43:10,117 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 4 variables, input treesize:105, output treesize:81 [2018-04-11 12:43:10,181 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 12:43:10,182 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 12:43:10,182 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 12:43:10,187 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 104 treesize of output 120 [2018-04-11 12:43:10,188 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 13 [2018-04-11 12:43:10,189 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 12:43:10,198 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 12:43:10,212 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 49 treesize of output 50 [2018-04-11 12:43:10,214 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 13 [2018-04-11 12:43:10,214 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-04-11 12:43:10,219 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 12:43:10,229 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-11 12:43:10,229 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 3 variables, input treesize:123, output treesize:99 [2018-04-11 12:43:10,352 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 191 treesize of output 144 [2018-04-11 12:43:10,372 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 32 treesize of output 51 [2018-04-11 12:43:10,372 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 2 xjuncts. [2018-04-11 12:43:10,388 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-04-11 12:43:10,420 INFO L682 Elim1Store]: detected equality via solver [2018-04-11 12:43:10,421 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 162 treesize of output 141 [2018-04-11 12:43:10,423 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 37 treesize of output 32 [2018-04-11 12:43:10,423 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-04-11 12:43:10,435 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 12:43:10,440 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 182 treesize of output 156 [2018-04-11 12:43:10,442 INFO L682 Elim1Store]: detected equality via solver [2018-04-11 12:43:10,442 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 32 treesize of output 48 [2018-04-11 12:43:10,442 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2018-04-11 12:43:10,452 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 12:43:10,480 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-11 12:43:10,480 INFO L202 ElimStorePlain]: Needed 7 recursive calls to eliminate 4 variables, input treesize:203, output treesize:289 [2018-04-11 12:43:10,590 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 106 treesize of output 93 [2018-04-11 12:43:10,591 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select 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-11 12:43:10,592 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 12:43:10,599 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 75 treesize of output 60 [2018-04-11 12:43:10,600 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-04-11 12:43:10,606 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 12:43:10,616 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-11 12:43:10,616 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 4 variables, input treesize:135, output treesize:89 [2018-04-11 12:43:10,682 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 85 treesize of output 50 [2018-04-11 12:43:10,683 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-11 12:43:10,684 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-11 12:43:10,689 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 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-11 12:43:10,690 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-04-11 12:43:10,695 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select 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-11 12:43:10,695 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-04-11 12:43:10,698 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-11 12:43:10,702 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-11 12:43:10,702 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 4 variables, input treesize:90, output treesize:28 [2018-04-11 12:43:10,775 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-11 12:43:10,793 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-04-11 12:43:10,793 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [20, 22] total 39 [2018-04-11 12:43:10,793 INFO L442 AbstractCegarLoop]: Interpolant automaton has 40 states [2018-04-11 12:43:10,793 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 40 interpolants. [2018-04-11 12:43:10,793 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=174, Invalid=1386, Unknown=0, NotChecked=0, Total=1560 [2018-04-11 12:43:10,794 INFO L87 Difference]: Start difference. First operand 129 states and 136 transitions. Second operand 40 states. [2018-04-11 12:43:12,282 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-11 12:43:12,282 INFO L93 Difference]: Finished difference Result 179 states and 186 transitions. [2018-04-11 12:43:12,282 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 32 states. [2018-04-11 12:43:12,282 INFO L78 Accepts]: Start accepts. Automaton has 40 states. Word has length 62 [2018-04-11 12:43:12,283 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-11 12:43:12,283 INFO L225 Difference]: With dead ends: 179 [2018-04-11 12:43:12,283 INFO L226 Difference]: Without dead ends: 179 [2018-04-11 12:43:12,284 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 108 GetRequests, 44 SyntacticMatches, 2 SemanticMatches, 62 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1091 ImplicationChecksByTransitivity, 1.6s TimeCoverageRelationStatistics Valid=508, Invalid=3524, Unknown=0, NotChecked=0, Total=4032 [2018-04-11 12:43:12,285 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 179 states. [2018-04-11 12:43:12,286 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 179 to 131. [2018-04-11 12:43:12,286 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 131 states. [2018-04-11 12:43:12,287 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 131 states to 131 states and 139 transitions. [2018-04-11 12:43:12,287 INFO L78 Accepts]: Start accepts. Automaton has 131 states and 139 transitions. Word has length 62 [2018-04-11 12:43:12,287 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-11 12:43:12,287 INFO L459 AbstractCegarLoop]: Abstraction has 131 states and 139 transitions. [2018-04-11 12:43:12,287 INFO L460 AbstractCegarLoop]: Interpolant automaton has 40 states. [2018-04-11 12:43:12,287 INFO L276 IsEmpty]: Start isEmpty. Operand 131 states and 139 transitions. [2018-04-11 12:43:12,288 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 63 [2018-04-11 12:43:12,288 INFO L347 BasicCegarLoop]: Found error trace [2018-04-11 12:43:12,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-11 12:43:12,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-11 12:43:12,288 INFO L82 PathProgramCache]: Analyzing trace with hash 484223592, now seen corresponding path program 1 times [2018-04-11 12:43:12,289 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-04-11 12:43:12,289 INFO L68 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-04-11 12:43:12,290 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 12:43:12,290 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-11 12:43:12,290 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 12:43:12,306 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-11 12:43:12,306 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-11 12:43:12,774 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-11 12:43:12,774 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-04-11 12:43:12,774 INFO L213 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-04-11 12:43:12,779 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-11 12:43:12,810 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-11 12:43:12,812 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-11 12:43:12,818 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 12:43:12,819 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 12:43:12,819 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-11 12:43:12,819 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-11 12:43:12,821 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 12:43:12,822 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:17, output treesize:11 [2018-04-11 12:43:12,826 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-11 12:43:12,827 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 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-11 12:43:12,828 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 12:43:12,829 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 12:43:12,837 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-11 12:43:12,847 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select 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-11 12:43:12,847 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-04-11 12:43:12,848 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 12:43:12,853 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-11 12:43:12,853 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 4 variables, input treesize:38, output treesize:20 [2018-04-11 12:43:12,862 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 14 [2018-04-11 12:43:12,863 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select 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-11 12:43:12,863 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 12:43:12,864 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 12:43:12,873 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 43 treesize of output 39 [2018-04-11 12:43:12,874 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select 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-11 12:43:12,874 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-04-11 12:43:12,878 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 12:43:12,884 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-11 12:43:12,885 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 3 variables, input treesize:62, output treesize:46 [2018-04-11 12:43:12,964 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 32 treesize of output 38 [2018-04-11 12:43:12,970 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 2 case distinctions, treesize of input 20 treesize of output 39 [2018-04-11 12:43:12,971 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 2 xjuncts. [2018-04-11 12:43:12,979 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-04-11 12:43:12,999 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-11 12:43:13,001 INFO L682 Elim1Store]: detected equality via solver [2018-04-11 12:43:13,002 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 17 [2018-04-11 12:43:13,002 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-04-11 12:43:13,009 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 12:43:13,013 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 75 treesize of output 70 [2018-04-11 12:43:13,020 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 31 [2018-04-11 12:43:13,020 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 2 xjuncts. [2018-04-11 12:43:13,032 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-04-11 12:43:13,056 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-11 12:43:13,056 INFO L202 ElimStorePlain]: Needed 7 recursive calls to eliminate 3 variables, input treesize:81, output treesize:141 [2018-04-11 12:43:13,119 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-04-11 12:43:13,119 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-11 12:43:13,130 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 12:43:13,131 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 12:43:13,131 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 12:43:13,132 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 12:43:13,132 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 13 [2018-04-11 12:43:13,132 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 12:43:13,141 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 12:43:13,141 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:73, output treesize:65 [2018-04-11 12:43:13,171 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 12:43:13,174 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 53 treesize of output 52 [2018-04-11 12:43:13,177 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 19 [2018-04-11 12:43:13,177 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 12:43:13,183 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 12:43:13,194 INFO L682 Elim1Store]: detected equality via solver [2018-04-11 12:43:13,196 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 45 treesize of output 56 [2018-04-11 12:43:13,197 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 23 [2018-04-11 12:43:13,197 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-04-11 12:43:13,201 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 12:43:13,207 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-11 12:43:13,208 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 3 variables, input treesize:84, output treesize:75 [2018-04-11 12:43:13,258 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 12:43:13,258 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 12:43:13,259 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 12:43:13,263 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 110 treesize of output 126 [2018-04-11 12:43:13,265 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-11 12:43:13,265 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 12:43:13,280 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 12:43:13,292 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 12:43:13,297 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 69 treesize of output 90 [2018-04-11 12:43:13,299 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select 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-11 12:43:13,299 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-04-11 12:43:13,307 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 12:43:13,316 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-11 12:43:13,316 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 3 variables, input treesize:117, output treesize:97 [2018-04-11 12:43:13,467 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 197 treesize of output 150 [2018-04-11 12:43:13,475 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 32 treesize of output 51 [2018-04-11 12:43:13,475 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 2 xjuncts. [2018-04-11 12:43:13,492 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-04-11 12:43:13,527 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 161 treesize of output 135 [2018-04-11 12:43:13,530 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 25 [2018-04-11 12:43:13,530 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-04-11 12:43:13,539 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 12:43:13,545 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 181 treesize of output 155 [2018-04-11 12:43:13,552 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 32 treesize of output 51 [2018-04-11 12:43:13,553 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 2 xjuncts. [2018-04-11 12:43:13,568 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-04-11 12:43:13,595 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-11 12:43:13,595 INFO L202 ElimStorePlain]: Needed 7 recursive calls to eliminate 4 variables, input treesize:197, output treesize:281 [2018-04-11 12:43:13,789 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 145 treesize of output 98 [2018-04-11 12:43:13,790 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 56 treesize of output 23 [2018-04-11 12:43:13,791 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 12:43:13,799 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select 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-11 12:43:13,799 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-04-11 12:43:13,806 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 39 treesize of output 31 [2018-04-11 12:43:13,806 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-11 12:43:13,812 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-11 12:43:13,821 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 30 treesize of output 32 [2018-04-11 12:43:13,822 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 1 [2018-04-11 12:43:13,822 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2018-04-11 12:43:13,826 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 3 [2018-04-11 12:43:13,827 INFO L267 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 1 xjuncts. [2018-04-11 12:43:13,828 INFO L267 ElimStorePlain]: Start of recursive call 6: 3 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 12:43:13,832 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-11 12:43:13,833 INFO L202 ElimStorePlain]: Needed 8 recursive calls to eliminate 5 variables, input treesize:145, output treesize:9 [2018-04-11 12:43:13,873 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-11 12:43:13,890 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-04-11 12:43:13,891 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [21, 22] total 35 [2018-04-11 12:43:13,891 INFO L442 AbstractCegarLoop]: Interpolant automaton has 36 states [2018-04-11 12:43:13,891 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 36 interpolants. [2018-04-11 12:43:13,891 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=117, Invalid=1143, Unknown=0, NotChecked=0, Total=1260 [2018-04-11 12:43:13,891 INFO L87 Difference]: Start difference. First operand 131 states and 139 transitions. Second operand 36 states. [2018-04-11 12:43:15,383 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-11 12:43:15,384 INFO L93 Difference]: Finished difference Result 177 states and 186 transitions. [2018-04-11 12:43:15,384 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2018-04-11 12:43:15,384 INFO L78 Accepts]: Start accepts. Automaton has 36 states. Word has length 62 [2018-04-11 12:43:15,384 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-11 12:43:15,385 INFO L225 Difference]: With dead ends: 177 [2018-04-11 12:43:15,385 INFO L226 Difference]: Without dead ends: 177 [2018-04-11 12:43:15,385 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 107 GetRequests, 44 SyntacticMatches, 7 SemanticMatches, 56 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 870 ImplicationChecksByTransitivity, 1.5s TimeCoverageRelationStatistics Valid=334, Invalid=2972, Unknown=0, NotChecked=0, Total=3306 [2018-04-11 12:43:15,385 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 177 states. [2018-04-11 12:43:15,386 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 177 to 131. [2018-04-11 12:43:15,387 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 131 states. [2018-04-11 12:43:15,387 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 131 states to 131 states and 138 transitions. [2018-04-11 12:43:15,387 INFO L78 Accepts]: Start accepts. Automaton has 131 states and 138 transitions. Word has length 62 [2018-04-11 12:43:15,387 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-11 12:43:15,387 INFO L459 AbstractCegarLoop]: Abstraction has 131 states and 138 transitions. [2018-04-11 12:43:15,387 INFO L460 AbstractCegarLoop]: Interpolant automaton has 36 states. [2018-04-11 12:43:15,387 INFO L276 IsEmpty]: Start isEmpty. Operand 131 states and 138 transitions. [2018-04-11 12:43:15,387 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2018-04-11 12:43:15,388 INFO L347 BasicCegarLoop]: Found error trace [2018-04-11 12:43:15,388 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-11 12:43:15,388 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-11 12:43:15,388 INFO L82 PathProgramCache]: Analyzing trace with hash -1042400824, now seen corresponding path program 3 times [2018-04-11 12:43:15,388 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-04-11 12:43:15,388 INFO L68 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-04-11 12:43:15,389 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 12:43:15,389 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-11 12:43:15,389 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 12:43:15,398 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-11 12:43:15,399 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-11 12:43:15,748 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-11 12:43:15,748 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-04-11 12:43:15,748 INFO L213 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 10 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 10 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-04-11 12:43:15,753 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-04-11 12:43:15,787 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2018-04-11 12:43:15,787 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-04-11 12:43:15,789 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-11 12:43:15,798 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 12:43:15,799 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 12:43:15,799 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 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-11 12:43:15,799 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-11 12:43:15,803 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 12:43:15,803 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:20, output treesize:14 [2018-04-11 12:43:15,824 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-11 12:43:15,835 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 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-11 12:43:15,835 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 12:43:15,836 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 12:43:15,842 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-11 12:43:15,842 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:30, output treesize:23 [2018-04-11 12:43:15,881 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 12:43:15,883 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 34 [2018-04-11 12:43:15,884 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select 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-11 12:43:15,884 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 12:43:15,887 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 12:43:15,892 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-11 12:43:15,892 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:44, output treesize:36 [2018-04-11 12:43:15,966 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 40 treesize of output 35 [2018-04-11 12:43:15,971 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-11 12:43:15,971 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 2 xjuncts. [2018-04-11 12:43:15,979 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-04-11 12:43:15,992 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-11 12:43:15,992 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:53, output treesize:82 [2018-04-11 12:43:16,034 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 12:43:16,035 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 12:43:16,035 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 12:43:16,036 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 12:43:16,036 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 13 [2018-04-11 12:43:16,036 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-11 12:43:16,042 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 12:43:16,042 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:41, output treesize:34 [2018-04-11 12:43:16,066 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 12:43:16,069 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 34 treesize of output 33 [2018-04-11 12:43:16,070 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 7 [2018-04-11 12:43:16,070 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 12:43:16,074 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 12:43:16,080 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-11 12:43:16,080 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:45, output treesize:35 [2018-04-11 12:43:16,132 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 12:43:16,136 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 53 treesize of output 53 [2018-04-11 12:43:16,137 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 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-11 12:43:16,137 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 12:43:16,142 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 12:43:16,148 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-11 12:43:16,148 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:56, output treesize:48 [2018-04-11 12:43:16,263 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 94 treesize of output 71 [2018-04-11 12:43:16,270 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-11 12:43:16,271 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 2 xjuncts. [2018-04-11 12:43:16,281 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-04-11 12:43:16,299 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-11 12:43:16,299 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:97, output treesize:150 [2018-04-11 12:43:16,425 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 5 new quantified variables, introduced 0 case distinctions, treesize of input 68 treesize of output 48 [2018-04-11 12:43:16,426 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 1 [2018-04-11 12:43:16,426 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 12:43:16,430 INFO L682 Elim1Store]: detected equality via solver [2018-04-11 12:43:16,431 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 19 [2018-04-11 12:43:16,431 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-04-11 12:43:16,435 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2018-04-11 12:43:16,435 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-04-11 12:43:16,437 INFO L267 ElimStorePlain]: Start of recursive call 2: 3 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 12:43:16,439 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-11 12:43:16,439 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 5 variables, input treesize:74, output treesize:5 [2018-04-11 12:43:16,462 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-11 12:43:16,480 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-04-11 12:43:16,481 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [22, 23] total 38 [2018-04-11 12:43:16,481 INFO L442 AbstractCegarLoop]: Interpolant automaton has 39 states [2018-04-11 12:43:16,481 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 39 interpolants. [2018-04-11 12:43:16,481 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=151, Invalid=1331, Unknown=0, NotChecked=0, Total=1482 [2018-04-11 12:43:16,481 INFO L87 Difference]: Start difference. First operand 131 states and 138 transitions. Second operand 39 states. [2018-04-11 12:43:18,212 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-11 12:43:18,212 INFO L93 Difference]: Finished difference Result 216 states and 225 transitions. [2018-04-11 12:43:18,212 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 31 states. [2018-04-11 12:43:18,212 INFO L78 Accepts]: Start accepts. Automaton has 39 states. Word has length 63 [2018-04-11 12:43:18,212 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-11 12:43:18,213 INFO L225 Difference]: With dead ends: 216 [2018-04-11 12:43:18,213 INFO L226 Difference]: Without dead ends: 216 [2018-04-11 12:43:18,214 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 112 GetRequests, 43 SyntacticMatches, 4 SemanticMatches, 65 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 878 ImplicationChecksByTransitivity, 1.6s TimeCoverageRelationStatistics Valid=662, Invalid=3760, Unknown=0, NotChecked=0, Total=4422 [2018-04-11 12:43:18,214 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 216 states. [2018-04-11 12:43:18,215 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 216 to 166. [2018-04-11 12:43:18,215 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 166 states. [2018-04-11 12:43:18,215 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 166 states to 166 states and 176 transitions. [2018-04-11 12:43:18,216 INFO L78 Accepts]: Start accepts. Automaton has 166 states and 176 transitions. Word has length 63 [2018-04-11 12:43:18,216 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-11 12:43:18,216 INFO L459 AbstractCegarLoop]: Abstraction has 166 states and 176 transitions. [2018-04-11 12:43:18,216 INFO L460 AbstractCegarLoop]: Interpolant automaton has 39 states. [2018-04-11 12:43:18,216 INFO L276 IsEmpty]: Start isEmpty. Operand 166 states and 176 transitions. [2018-04-11 12:43:18,216 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2018-04-11 12:43:18,216 INFO L347 BasicCegarLoop]: Found error trace [2018-04-11 12:43:18,216 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-11 12:43:18,216 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-11 12:43:18,216 INFO L82 PathProgramCache]: Analyzing trace with hash -1042400823, now seen corresponding path program 2 times [2018-04-11 12:43:18,216 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-04-11 12:43:18,217 INFO L68 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-04-11 12:43:18,217 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 12:43:18,217 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-04-11 12:43:18,217 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 12:43:18,225 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-11 12:43:18,225 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-11 12:43:18,666 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-11 12:43:18,666 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-04-11 12:43:18,666 INFO L213 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 11 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 11 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-04-11 12:43:18,671 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-04-11 12:43:18,696 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-04-11 12:43:18,696 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-04-11 12:43:18,698 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-11 12:43:18,781 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 12:43:18,781 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 12:43:18,781 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 21 [2018-04-11 12:43:18,782 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-11 12:43:18,788 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 12:43:18,788 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:33, output treesize:31 [2018-04-11 12:43:18,812 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-11 12:43:18,813 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-04-11 12:43:18,813 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 12:43:18,814 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 12:43:18,824 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-11 12:43:18,825 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-11 12:43:18,825 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-04-11 12:43:18,826 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 12:43:18,833 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-11 12:43:18,834 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 3 variables, input treesize:50, output treesize:43 [2018-04-11 12:43:18,892 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 12:43:18,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, 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-11 12:43:18,896 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select 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-11 12:43:18,897 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 12:43:18,900 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 12:43:18,912 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 12:43:18,914 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-11 12:43:18,915 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select 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-11 12:43:18,916 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-04-11 12:43:18,920 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 12:43:18,930 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-11 12:43:18,930 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 3 variables, input treesize:85, output treesize:69 [2018-04-11 12:43:19,063 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 62 treesize of output 57 [2018-04-11 12:43:19,074 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 12:43:19,079 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 2 case distinctions, treesize of input 16 treesize of output 35 [2018-04-11 12:43:19,079 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 2 xjuncts. [2018-04-11 12:43:19,095 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-04-11 12:43:19,123 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 12:43:19,124 INFO L682 Elim1Store]: detected equality via solver [2018-04-11 12:43:19,125 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 75 treesize of output 79 [2018-04-11 12:43:19,127 INFO L682 Elim1Store]: detected equality via solver [2018-04-11 12:43:19,127 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 24 [2018-04-11 12:43:19,127 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-04-11 12:43:19,135 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 12:43:19,137 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 12:43:19,141 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 75 treesize of output 92 [2018-04-11 12:43:19,143 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 12:43:19,143 INFO L682 Elim1Store]: detected equality via solver [2018-04-11 12:43:19,144 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 54 [2018-04-11 12:43:19,144 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2018-04-11 12:43:19,154 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 12:43:19,176 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-11 12:43:19,177 INFO L202 ElimStorePlain]: Needed 7 recursive calls to eliminate 3 variables, input treesize:102, output treesize:185 [2018-04-11 12:43:19,272 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 12:43:19,273 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 21 [2018-04-11 12:43:19,273 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-11 12:43:19,287 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 12:43:19,287 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 12:43:19,288 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 12:43:19,288 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 12:43:19,289 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 5 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 21 [2018-04-11 12:43:19,289 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 12:43:19,301 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 12:43:19,301 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:90, output treesize:86 [2018-04-11 12:43:19,345 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 12:43:19,347 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 12:43:19,347 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 64 treesize of output 72 [2018-04-11 12:43:19,349 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 34 [2018-04-11 12:43:19,349 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 12:43:19,357 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 12:43:19,369 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 12:43:19,370 INFO L682 Elim1Store]: detected equality via solver [2018-04-11 12:43:19,371 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 52 treesize of output 63 [2018-04-11 12:43:19,373 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 30 [2018-04-11 12:43:19,373 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-04-11 12:43:19,378 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 12:43:19,388 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-11 12:43:19,388 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 3 variables, input treesize:105, output treesize:96 [2018-04-11 12:43:19,456 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 12:43:19,457 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 12:43:19,458 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 12:43:19,459 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 12:43:19,462 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 5 disjoint index pairs (out of 3 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 117 treesize of output 141 [2018-04-11 12:43:19,464 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 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-11 12:43:19,464 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 12:43:19,477 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 12:43:19,491 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 12:43:19,492 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 12:43:19,496 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 5 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 80 treesize of output 101 [2018-04-11 12:43:19,498 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select 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-11 12:43:19,498 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-04-11 12:43:19,507 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 12:43:19,520 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-11 12:43:19,520 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 3 variables, input treesize:138, output treesize:114 [2018-04-11 12:43:19,662 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 12:43:19,663 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 12:43:19,668 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 5 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 204 treesize of output 173 [2018-04-11 12:43:19,675 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 2 case distinctions, treesize of input 32 treesize of output 51 [2018-04-11 12:43:19,675 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 2 xjuncts. [2018-04-11 12:43:19,694 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-04-11 12:43:19,731 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 12:43:19,733 INFO L682 Elim1Store]: detected equality via solver [2018-04-11 12:43:19,735 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 175 treesize of output 162 [2018-04-11 12:43:19,737 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 37 treesize of output 32 [2018-04-11 12:43:19,737 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-04-11 12:43:19,747 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 12:43:19,749 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 12:43:19,753 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 195 treesize of output 177 [2018-04-11 12:43:19,756 INFO L682 Elim1Store]: detected equality via solver [2018-04-11 12:43:19,756 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 48 [2018-04-11 12:43:19,756 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2018-04-11 12:43:19,773 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 12:43:19,807 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-11 12:43:19,808 INFO L202 ElimStorePlain]: Needed 7 recursive calls to eliminate 4 variables, input treesize:218, output treesize:319 [2018-04-11 12:43:19,993 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 12:43:19,993 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 12:43:19,996 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 5 disjoint index pairs (out of 3 index pairs), introduced 5 new quantified variables, introduced 0 case distinctions, treesize of input 129 treesize of output 107 [2018-04-11 12:43:19,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, 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-11 12:43:19,998 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 12:43:20,007 INFO L682 Elim1Store]: detected equality via solver [2018-04-11 12:43:20,008 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 50 treesize of output 40 [2018-04-11 12:43:20,008 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-04-11 12:43:20,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 45 treesize of output 21 [2018-04-11 12:43:20,016 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-11 12:43:20,023 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-11 12:43:20,036 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 44 treesize of output 44 [2018-04-11 12:43:20,038 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 5 [2018-04-11 12:43:20,038 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2018-04-11 12:43:20,044 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select 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-11 12:43:20,044 INFO L267 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 1 xjuncts. [2018-04-11 12:43:20,048 INFO L682 Elim1Store]: detected equality via solver [2018-04-11 12:43:20,048 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 20 treesize of output 14 [2018-04-11 12:43:20,048 INFO L267 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 1 xjuncts. [2018-04-11 12:43:20,051 INFO L267 ElimStorePlain]: Start of recursive call 6: 3 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 12:43:20,058 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-11 12:43:20,058 INFO L202 ElimStorePlain]: Needed 9 recursive calls to eliminate 5 variables, input treesize:153, output treesize:20 [2018-04-11 12:43:20,139 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-11 12:43:20,156 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-04-11 12:43:20,156 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [20, 24] total 43 [2018-04-11 12:43:20,156 INFO L442 AbstractCegarLoop]: Interpolant automaton has 44 states [2018-04-11 12:43:20,156 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 44 interpolants. [2018-04-11 12:43:20,157 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=212, Invalid=1680, Unknown=0, NotChecked=0, Total=1892 [2018-04-11 12:43:20,157 INFO L87 Difference]: Start difference. First operand 166 states and 176 transitions. Second operand 44 states. [2018-04-11 12:43:22,055 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-11 12:43:22,055 INFO L93 Difference]: Finished difference Result 214 states and 226 transitions. [2018-04-11 12:43:22,056 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 33 states. [2018-04-11 12:43:22,056 INFO L78 Accepts]: Start accepts. Automaton has 44 states. Word has length 63 [2018-04-11 12:43:22,056 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-11 12:43:22,056 INFO L225 Difference]: With dead ends: 214 [2018-04-11 12:43:22,056 INFO L226 Difference]: Without dead ends: 214 [2018-04-11 12:43:22,057 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 114 GetRequests, 42 SyntacticMatches, 0 SemanticMatches, 72 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1347 ImplicationChecksByTransitivity, 2.3s TimeCoverageRelationStatistics Valid=735, Invalid=4667, Unknown=0, NotChecked=0, Total=5402 [2018-04-11 12:43:22,057 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 214 states. [2018-04-11 12:43:22,058 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 214 to 168. [2018-04-11 12:43:22,059 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 168 states. [2018-04-11 12:43:22,059 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 168 states to 168 states and 178 transitions. [2018-04-11 12:43:22,059 INFO L78 Accepts]: Start accepts. Automaton has 168 states and 178 transitions. Word has length 63 [2018-04-11 12:43:22,059 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-11 12:43:22,059 INFO L459 AbstractCegarLoop]: Abstraction has 168 states and 178 transitions. [2018-04-11 12:43:22,059 INFO L460 AbstractCegarLoop]: Interpolant automaton has 44 states. [2018-04-11 12:43:22,059 INFO L276 IsEmpty]: Start isEmpty. Operand 168 states and 178 transitions. [2018-04-11 12:43:22,059 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2018-04-11 12:43:22,060 INFO L347 BasicCegarLoop]: Found error trace [2018-04-11 12:43:22,060 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-11 12:43:22,060 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-11 12:43:22,060 INFO L82 PathProgramCache]: Analyzing trace with hash -1290037367, now seen corresponding path program 1 times [2018-04-11 12:43:22,060 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-04-11 12:43:22,060 INFO L68 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-04-11 12:43:22,061 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 12:43:22,061 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-04-11 12:43:22,061 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 12:43:22,071 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-04-11 12:43:22,086 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-04-11 12:43:22,101 INFO L421 BasicCegarLoop]: Counterexample might be feasible [2018-04-11 12:43:22,133 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 11.04 12:43:22 BoogieIcfgContainer [2018-04-11 12:43:22,133 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-04-11 12:43:22,133 INFO L168 Benchmark]: Toolchain (without parser) took 33741.42 ms. Allocated memory was 401.1 MB in the beginning and 1.1 GB in the end (delta: 692.6 MB). Free memory was 333.9 MB in the beginning and 730.1 MB in the end (delta: -396.2 MB). Peak memory consumption was 296.4 MB. Max. memory is 5.3 GB. [2018-04-11 12:43:22,134 INFO L168 Benchmark]: CDTParser took 0.13 ms. Allocated memory is still 401.1 MB. Free memory is still 359.6 MB. There was no memory consumed. Max. memory is 5.3 GB. [2018-04-11 12:43:22,134 INFO L168 Benchmark]: CACSL2BoogieTranslator took 256.15 ms. Allocated memory is still 401.1 MB. Free memory was 333.9 MB in the beginning and 304.8 MB in the end (delta: 29.1 MB). Peak memory consumption was 29.1 MB. Max. memory is 5.3 GB. [2018-04-11 12:43:22,134 INFO L168 Benchmark]: Boogie Preprocessor took 42.59 ms. Allocated memory is still 401.1 MB. Free memory was 304.8 MB in the beginning and 302.1 MB in the end (delta: 2.6 MB). Peak memory consumption was 2.6 MB. Max. memory is 5.3 GB. [2018-04-11 12:43:22,135 INFO L168 Benchmark]: RCFGBuilder took 509.32 ms. Allocated memory was 401.1 MB in the beginning and 612.4 MB in the end (delta: 211.3 MB). Free memory was 302.1 MB in the beginning and 530.0 MB in the end (delta: -227.8 MB). Peak memory consumption was 23.0 MB. Max. memory is 5.3 GB. [2018-04-11 12:43:22,135 INFO L168 Benchmark]: TraceAbstraction took 32930.36 ms. Allocated memory was 612.4 MB in the beginning and 1.1 GB in the end (delta: 481.3 MB). Free memory was 530.0 MB in the beginning and 730.1 MB in the end (delta: -200.1 MB). Peak memory consumption was 281.2 MB. Max. memory is 5.3 GB. [2018-04-11 12:43:22,136 INFO L344 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.13 ms. Allocated memory is still 401.1 MB. Free memory is still 359.6 MB. There was no memory consumed. Max. memory is 5.3 GB. * CACSL2BoogieTranslator took 256.15 ms. Allocated memory is still 401.1 MB. Free memory was 333.9 MB in the beginning and 304.8 MB in the end (delta: 29.1 MB). Peak memory consumption was 29.1 MB. Max. memory is 5.3 GB. * Boogie Preprocessor took 42.59 ms. Allocated memory is still 401.1 MB. Free memory was 304.8 MB in the beginning and 302.1 MB in the end (delta: 2.6 MB). Peak memory consumption was 2.6 MB. Max. memory is 5.3 GB. * RCFGBuilder took 509.32 ms. Allocated memory was 401.1 MB in the beginning and 612.4 MB in the end (delta: 211.3 MB). Free memory was 302.1 MB in the beginning and 530.0 MB in the end (delta: -227.8 MB). Peak memory consumption was 23.0 MB. Max. memory is 5.3 GB. * TraceAbstraction took 32930.36 ms. Allocated memory was 612.4 MB in the beginning and 1.1 GB in the end (delta: 481.3 MB). Free memory was 530.0 MB in the beginning and 730.1 MB in the end (delta: -200.1 MB). Peak memory consumption was 281.2 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))={16:0}, malloc(sizeof(SLL))={14:0}] [L1005] FCALL end->next = malloc(sizeof(SLL)) VAL [end={16:0}, list={16:0}, malloc(sizeof(SLL))={16:0}, malloc(sizeof(SLL))={14:0}] [L1006] EXPR, FCALL end->next VAL [end={16:0}, end->next={14:0}, list={16:0}, malloc(sizeof(SLL))={16:0}, malloc(sizeof(SLL))={14:0}] [L1006] FCALL end->next->prev = end VAL [end={16:0}, end->next={14:0}, list={16:0}, malloc(sizeof(SLL))={16:0}, malloc(sizeof(SLL))={14:0}] [L1007] EXPR, FCALL end->next VAL [end={16:0}, end->next={14:0}, list={16:0}, malloc(sizeof(SLL))={16:0}, malloc(sizeof(SLL))={14:0}] [L1007] end = end->next [L1008] FCALL end->next = ((void*)0) VAL [end={14:0}, list={16:0}, malloc(sizeof(SLL))={16:0}, malloc(sizeof(SLL))={14:0}] [L1010] COND FALSE !(__VERIFIER_nondet_int()) [L1016] FCALL end->colour = RED VAL [end={14:0}, list={16:0}, malloc(sizeof(SLL))={16:0}, malloc(sizeof(SLL))={14:0}] [L1017] EXPR, FCALL malloc(sizeof(SLL)) VAL [end={14:0}, list={16:0}, malloc(sizeof(SLL))={16:0}, malloc(sizeof(SLL))={14:0}, malloc(sizeof(SLL))={15:0}] [L1017] FCALL end->next = malloc(sizeof(SLL)) VAL [end={14:0}, list={16:0}, malloc(sizeof(SLL))={16:0}, malloc(sizeof(SLL))={14:0}, malloc(sizeof(SLL))={15:0}] [L1018] EXPR, FCALL end->next VAL [end={14:0}, end->next={15:0}, list={16:0}, malloc(sizeof(SLL))={16:0}, malloc(sizeof(SLL))={14:0}, malloc(sizeof(SLL))={15:0}] [L1018] FCALL end->next->prev = end VAL [end={14:0}, end->next={15:0}, list={16:0}, malloc(sizeof(SLL))={16:0}, malloc(sizeof(SLL))={14:0}, malloc(sizeof(SLL))={15:0}] [L1019] EXPR, FCALL end->next VAL [end={14:0}, end->next={15:0}, list={16:0}, malloc(sizeof(SLL))={16:0}, malloc(sizeof(SLL))={14:0}, malloc(sizeof(SLL))={15:0}] [L1019] end = end->next [L1020] FCALL end->next = ((void*)0) VAL [end={15:0}, list={16:0}, malloc(sizeof(SLL))={16:0}, malloc(sizeof(SLL))={14:0}, malloc(sizeof(SLL))={15:0}] [L1021] FCALL end->colour = BLACK VAL [end={15:0}, list={16:0}, malloc(sizeof(SLL))={16:0}, malloc(sizeof(SLL))={14:0}, malloc(sizeof(SLL))={15:0}] [L1002] COND FALSE !(__VERIFIER_nondet_int()) [L1025] end = ((void*)0) [L1026] end = list VAL [end={16:0}, list={16:0}, malloc(sizeof(SLL))={16:0}, malloc(sizeof(SLL))={14:0}, malloc(sizeof(SLL))={15:0}] [L1029] COND FALSE !(!(((void*)0) != end)) VAL [end={16:0}, list={16:0}, malloc(sizeof(SLL))={16:0}, malloc(sizeof(SLL))={14:0}, malloc(sizeof(SLL))={15:0}] [L1029] COND FALSE !(0) VAL [end={16:0}, list={16:0}, malloc(sizeof(SLL))={16:0}, malloc(sizeof(SLL))={14:0}, malloc(sizeof(SLL))={15:0}] [L1030] EXPR, FCALL end->colour VAL [end={16:0}, end->colour=1, list={16:0}, malloc(sizeof(SLL))={16:0}, malloc(sizeof(SLL))={14:0}, malloc(sizeof(SLL))={15:0}] [L1030] COND FALSE !(!(BLACK == end->colour)) [L1030] COND FALSE !(0) VAL [end={16:0}, list={16:0}, malloc(sizeof(SLL))={16:0}, malloc(sizeof(SLL))={14:0}, malloc(sizeof(SLL))={15:0}] [L1032] COND TRUE ((void*)0) != end VAL [end={16:0}, list={16:0}, malloc(sizeof(SLL))={16:0}, malloc(sizeof(SLL))={14:0}, malloc(sizeof(SLL))={15:0}] [L1034] EXPR, FCALL end->colour VAL [end={16:0}, end->colour=1, list={16:0}, malloc(sizeof(SLL))={16:0}, malloc(sizeof(SLL))={14:0}, malloc(sizeof(SLL))={15: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))={16:0}, malloc(sizeof(SLL))={14:0}, malloc(sizeof(SLL))={15:0}] [L1040] COND FALSE !(!(end->next)) [L1040] COND FALSE !(0) VAL [end={16:0}, list={16:0}, malloc(sizeof(SLL))={16:0}, malloc(sizeof(SLL))={14:0}, malloc(sizeof(SLL))={15:0}] [L1041] EXPR, FCALL end->next VAL [end={16:0}, end->next={14:0}, list={16:0}, malloc(sizeof(SLL))={16:0}, malloc(sizeof(SLL))={14:0}, malloc(sizeof(SLL))={15:0}] [L1041] end = end->next [L1032] COND TRUE ((void*)0) != end VAL [end={14:0}, list={16:0}, malloc(sizeof(SLL))={16:0}, malloc(sizeof(SLL))={14:0}, malloc(sizeof(SLL))={15:0}] [L1034] EXPR, FCALL end->colour VAL [end={14:0}, end->colour=0, list={16:0}, malloc(sizeof(SLL))={16:0}, malloc(sizeof(SLL))={14:0}, malloc(sizeof(SLL))={15: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))={16:0}, malloc(sizeof(SLL))={14:0}, malloc(sizeof(SLL))={15:0}] [L1036] end = end->next [L1037] EXPR, FCALL end->next VAL [end={15:0}, end->next={0:0}, list={16:0}, malloc(sizeof(SLL))={16:0}, malloc(sizeof(SLL))={14:0}, malloc(sizeof(SLL))={15: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, 32.8s OverallTime, 27 OverallIterations, 3 TraceHistogramMax, 18.9s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 2050 SDtfs, 8711 SDslu, 11873 SDs, 0 SdLazy, 19788 SolverSat, 1418 SolverUnsat, 3 SolverUnknown, 0 SolverNotchecked, 8.6s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 1178 GetRequests, 439 SyntacticMatches, 31 SemanticMatches, 708 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9301 ImplicationChecksByTransitivity, 16.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=191occurred in iteration=20, 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.0s AutomataMinimizationTime, 26 MinimizatonAttempts, 1220 StatesRemovedByMinimization, 26 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.4s SatisfiabilityAnalysisTime, 12.7s InterpolantComputationTime, 1619 NumberOfCodeBlocks, 1619 NumberOfCodeBlocksAsserted, 41 NumberOfCheckSat, 1518 ConstructedInterpolants, 297 QuantifiedInterpolants, 2351231 SizeOfPredicates, 190 NumberOfNonLiveVariables, 2196 ConjunctsInSsa, 507 ConjunctsInUnsatCore, 36 InterpolantComputations, 16 PerfectInterpolantSequences, 26/228 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_Camel.epf_AutomizerC.xml/Csv-Benchmark-0-2018-04-11_12-43-22-141.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_Camel.epf_AutomizerC.xml/Csv-TraceAbstractionBenchmarks-0-2018-04-11_12-43-22-141.csv Received shutdown request...