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-sorted_true-unreach-call_true-valid-memsafety.i -------------------------------------------------------------------------------- This is Ultimate 0.1.23-408c70d-m [2018-04-12 18:06:11,794 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-04-12 18:06:11,795 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-04-12 18:06:11,807 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-04-12 18:06:11,808 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-04-12 18:06:11,808 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-04-12 18:06:11,809 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-04-12 18:06:11,811 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-04-12 18:06:11,812 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-04-12 18:06:11,813 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-04-12 18:06:11,813 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-04-12 18:06:11,814 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-04-12 18:06:11,814 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-04-12 18:06:11,815 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-04-12 18:06:11,816 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-04-12 18:06:11,818 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-04-12 18:06:11,819 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-04-12 18:06:11,821 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-04-12 18:06:11,822 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-04-12 18:06:11,823 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-04-12 18:06:11,824 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-04-12 18:06:11,824 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-04-12 18:06:11,825 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-04-12 18:06:11,825 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-04-12 18:06:11,826 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-04-12 18:06:11,827 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-04-12 18:06:11,827 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-04-12 18:06:11,828 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-04-12 18:06:11,828 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-04-12 18:06:11,828 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-04-12 18:06:11,829 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-04-12 18:06:11,829 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-12 18:06:11,838 INFO L110 SettingsManager]: Loading preferences was successful [2018-04-12 18:06:11,838 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-04-12 18:06:11,839 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-04-12 18:06:11,839 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-04-12 18:06:11,840 INFO L133 SettingsManager]: * Use SBE=true [2018-04-12 18:06:11,840 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-04-12 18:06:11,840 INFO L133 SettingsManager]: * sizeof long=4 [2018-04-12 18:06:11,840 INFO L133 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2018-04-12 18:06:11,840 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-04-12 18:06:11,840 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-04-12 18:06:11,840 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-04-12 18:06:11,841 INFO L133 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2018-04-12 18:06:11,841 INFO L133 SettingsManager]: * Bitprecise bitfields=true [2018-04-12 18:06:11,841 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-04-12 18:06:11,841 INFO L133 SettingsManager]: * sizeof long double=12 [2018-04-12 18:06:11,841 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-04-12 18:06:11,841 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-04-12 18:06:11,841 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-04-12 18:06:11,842 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-04-12 18:06:11,842 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-04-12 18:06:11,842 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-04-12 18:06:11,842 INFO L133 SettingsManager]: * Interpolant automaton=TWOTRACK [2018-04-12 18:06:11,842 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-04-12 18:06:11,842 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Bitprecise bitfields -> false [2018-04-12 18:06:11,870 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-04-12 18:06:11,879 INFO L266 ainManager$Toolchain]: [Toolchain 1]: Parser(s) successfully (re)initialized [2018-04-12 18:06:11,887 INFO L222 ainManager$Toolchain]: [Toolchain 1]: Toolchain data selected. [2018-04-12 18:06:11,888 INFO L271 PluginConnector]: Initializing CDTParser... [2018-04-12 18:06:11,888 INFO L276 PluginConnector]: CDTParser initialized [2018-04-12 18:06:11,888 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/forester-heap/dll-sorted_true-unreach-call_true-valid-memsafety.i [2018-04-12 18:06:12,233 INFO L225 CDTParser]: Created temporary CDT project at /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/data/FLAG88418a08b [2018-04-12 18:06:12,381 INFO L287 CDTParser]: IsIndexed: true [2018-04-12 18:06:12,382 INFO L288 CDTParser]: Found 1 translation units. [2018-04-12 18:06:12,382 INFO L168 CDTParser]: Scanning dll-sorted_true-unreach-call_true-valid-memsafety.i [2018-04-12 18:06:12,389 INFO L210 ultiparseSymbolTable]: Include resolver: [2018-04-12 18:06:12,389 INFO L215 ultiparseSymbolTable]: [2018-04-12 18:06:12,389 INFO L218 ultiparseSymbolTable]: Function table: [2018-04-12 18:06:12,390 INFO L221 ultiparseSymbolTable]: Function definition of null ('main') in dll-sorted_true-unreach-call_true-valid-memsafety.i [2018-04-12 18:06:12,390 INFO L227 ultiparseSymbolTable]: Global variable table: [2018-04-12 18:06:12,390 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fdll_sorted_true_unreach_call_true_valid_memsafety_i____time_t in dll-sorted_true-unreach-call_true-valid-memsafety.i [2018-04-12 18:06:12,390 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fdll_sorted_true_unreach_call_true_valid_memsafety_i____timer_t in dll-sorted_true-unreach-call_true-valid-memsafety.i [2018-04-12 18:06:12,390 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fdll_sorted_true_unreach_call_true_valid_memsafety_i____intptr_t in dll-sorted_true-unreach-call_true-valid-memsafety.i [2018-04-12 18:06:12,390 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fdll_sorted_true_unreach_call_true_valid_memsafety_i__pthread_mutexattr_t in dll-sorted_true-unreach-call_true-valid-memsafety.i [2018-04-12 18:06:12,390 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fdll_sorted_true_unreach_call_true_valid_memsafety_i__size_t in dll-sorted_true-unreach-call_true-valid-memsafety.i [2018-04-12 18:06:12,390 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fdll_sorted_true_unreach_call_true_valid_memsafety_i__idtype_t in dll-sorted_true-unreach-call_true-valid-memsafety.i [2018-04-12 18:06:12,390 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fdll_sorted_true_unreach_call_true_valid_memsafety_i____fsfilcnt_t in dll-sorted_true-unreach-call_true-valid-memsafety.i [2018-04-12 18:06:12,390 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fdll_sorted_true_unreach_call_true_valid_memsafety_i__int8_t in dll-sorted_true-unreach-call_true-valid-memsafety.i [2018-04-12 18:06:12,391 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fdll_sorted_true_unreach_call_true_valid_memsafety_i____ssize_t in dll-sorted_true-unreach-call_true-valid-memsafety.i [2018-04-12 18:06:12,391 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fdll_sorted_true_unreach_call_true_valid_memsafety_i__pid_t in dll-sorted_true-unreach-call_true-valid-memsafety.i [2018-04-12 18:06:12,391 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fdll_sorted_true_unreach_call_true_valid_memsafety_i__int32_t in dll-sorted_true-unreach-call_true-valid-memsafety.i [2018-04-12 18:06:12,391 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fdll_sorted_true_unreach_call_true_valid_memsafety_i____socklen_t in dll-sorted_true-unreach-call_true-valid-memsafety.i [2018-04-12 18:06:12,391 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fdll_sorted_true_unreach_call_true_valid_memsafety_i__ino_t in dll-sorted_true-unreach-call_true-valid-memsafety.i [2018-04-12 18:06:12,391 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fdll_sorted_true_unreach_call_true_valid_memsafety_i____u_short in dll-sorted_true-unreach-call_true-valid-memsafety.i [2018-04-12 18:06:12,391 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fdll_sorted_true_unreach_call_true_valid_memsafety_i__key_t in dll-sorted_true-unreach-call_true-valid-memsafety.i [2018-04-12 18:06:12,391 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fdll_sorted_true_unreach_call_true_valid_memsafety_i____blkcnt64_t in dll-sorted_true-unreach-call_true-valid-memsafety.i [2018-04-12 18:06:12,391 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fdll_sorted_true_unreach_call_true_valid_memsafety_i__mode_t in dll-sorted_true-unreach-call_true-valid-memsafety.i [2018-04-12 18:06:12,391 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fdll_sorted_true_unreach_call_true_valid_memsafety_i__ldiv_t in dll-sorted_true-unreach-call_true-valid-memsafety.i [2018-04-12 18:06:12,391 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fdll_sorted_true_unreach_call_true_valid_memsafety_i____fsfilcnt64_t in dll-sorted_true-unreach-call_true-valid-memsafety.i [2018-04-12 18:06:12,391 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fdll_sorted_true_unreach_call_true_valid_memsafety_i__fsfilcnt_t in dll-sorted_true-unreach-call_true-valid-memsafety.i [2018-04-12 18:06:12,391 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fdll_sorted_true_unreach_call_true_valid_memsafety_i__pthread_mutex_t in dll-sorted_true-unreach-call_true-valid-memsafety.i [2018-04-12 18:06:12,392 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fdll_sorted_true_unreach_call_true_valid_memsafety_i____rlim_t in dll-sorted_true-unreach-call_true-valid-memsafety.i [2018-04-12 18:06:12,392 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fdll_sorted_true_unreach_call_true_valid_memsafety_i__time_t in dll-sorted_true-unreach-call_true-valid-memsafety.i [2018-04-12 18:06:12,392 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fdll_sorted_true_unreach_call_true_valid_memsafety_i__div_t in dll-sorted_true-unreach-call_true-valid-memsafety.i [2018-04-12 18:06:12,392 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fdll_sorted_true_unreach_call_true_valid_memsafety_i__off_t in dll-sorted_true-unreach-call_true-valid-memsafety.i [2018-04-12 18:06:12,392 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fdll_sorted_true_unreach_call_true_valid_memsafety_i__gid_t in dll-sorted_true-unreach-call_true-valid-memsafety.i [2018-04-12 18:06:12,392 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fdll_sorted_true_unreach_call_true_valid_memsafety_i__caddr_t in dll-sorted_true-unreach-call_true-valid-memsafety.i [2018-04-12 18:06:12,392 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fdll_sorted_true_unreach_call_true_valid_memsafety_i__u_short in dll-sorted_true-unreach-call_true-valid-memsafety.i [2018-04-12 18:06:12,392 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fdll_sorted_true_unreach_call_true_valid_memsafety_i__pthread_rwlock_t in dll-sorted_true-unreach-call_true-valid-memsafety.i [2018-04-12 18:06:12,392 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fdll_sorted_true_unreach_call_true_valid_memsafety_i____mode_t in dll-sorted_true-unreach-call_true-valid-memsafety.i [2018-04-12 18:06:12,392 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fdll_sorted_true_unreach_call_true_valid_memsafety_i__blksize_t in dll-sorted_true-unreach-call_true-valid-memsafety.i [2018-04-12 18:06:12,392 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fdll_sorted_true_unreach_call_true_valid_memsafety_i__pthread_once_t in dll-sorted_true-unreach-call_true-valid-memsafety.i [2018-04-12 18:06:12,392 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fdll_sorted_true_unreach_call_true_valid_memsafety_i____uint32_t in dll-sorted_true-unreach-call_true-valid-memsafety.i [2018-04-12 18:06:12,392 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fdll_sorted_true_unreach_call_true_valid_memsafety_i____caddr_t in dll-sorted_true-unreach-call_true-valid-memsafety.i [2018-04-12 18:06:12,392 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fdll_sorted_true_unreach_call_true_valid_memsafety_i____dev_t in dll-sorted_true-unreach-call_true-valid-memsafety.i [2018-04-12 18:06:12,392 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fdll_sorted_true_unreach_call_true_valid_memsafety_i____fsblkcnt_t in dll-sorted_true-unreach-call_true-valid-memsafety.i [2018-04-12 18:06:12,392 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fdll_sorted_true_unreach_call_true_valid_memsafety_i__u_quad_t in dll-sorted_true-unreach-call_true-valid-memsafety.i [2018-04-12 18:06:12,393 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fdll_sorted_true_unreach_call_true_valid_memsafety_i__pthread_key_t in dll-sorted_true-unreach-call_true-valid-memsafety.i [2018-04-12 18:06:12,393 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fdll_sorted_true_unreach_call_true_valid_memsafety_i__fd_set in dll-sorted_true-unreach-call_true-valid-memsafety.i [2018-04-12 18:06:12,393 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fdll_sorted_true_unreach_call_true_valid_memsafety_i__pthread_barrierattr_t in dll-sorted_true-unreach-call_true-valid-memsafety.i [2018-04-12 18:06:12,393 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fdll_sorted_true_unreach_call_true_valid_memsafety_i__register_t in dll-sorted_true-unreach-call_true-valid-memsafety.i [2018-04-12 18:06:12,393 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fdll_sorted_true_unreach_call_true_valid_memsafety_i____int64_t in dll-sorted_true-unreach-call_true-valid-memsafety.i [2018-04-12 18:06:12,393 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fdll_sorted_true_unreach_call_true_valid_memsafety_i____useconds_t in dll-sorted_true-unreach-call_true-valid-memsafety.i [2018-04-12 18:06:12,393 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fdll_sorted_true_unreach_call_true_valid_memsafety_i____uint8_t in dll-sorted_true-unreach-call_true-valid-memsafety.i [2018-04-12 18:06:12,393 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fdll_sorted_true_unreach_call_true_valid_memsafety_i____daddr_t in dll-sorted_true-unreach-call_true-valid-memsafety.i [2018-04-12 18:06:12,393 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fdll_sorted_true_unreach_call_true_valid_memsafety_i____key_t in dll-sorted_true-unreach-call_true-valid-memsafety.i [2018-04-12 18:06:12,393 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fdll_sorted_true_unreach_call_true_valid_memsafety_i____int8_t in dll-sorted_true-unreach-call_true-valid-memsafety.i [2018-04-12 18:06:12,394 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fdll_sorted_true_unreach_call_true_valid_memsafety_i__loff_t in dll-sorted_true-unreach-call_true-valid-memsafety.i [2018-04-12 18:06:12,394 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fdll_sorted_true_unreach_call_true_valid_memsafety_i__u_int64_t in dll-sorted_true-unreach-call_true-valid-memsafety.i [2018-04-12 18:06:12,394 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fdll_sorted_true_unreach_call_true_valid_memsafety_i__daddr_t in dll-sorted_true-unreach-call_true-valid-memsafety.i [2018-04-12 18:06:12,394 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fdll_sorted_true_unreach_call_true_valid_memsafety_i__int64_t in dll-sorted_true-unreach-call_true-valid-memsafety.i [2018-04-12 18:06:12,394 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fdll_sorted_true_unreach_call_true_valid_memsafety_i____uint16_t in dll-sorted_true-unreach-call_true-valid-memsafety.i [2018-04-12 18:06:12,394 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fdll_sorted_true_unreach_call_true_valid_memsafety_i__fsid_t in dll-sorted_true-unreach-call_true-valid-memsafety.i [2018-04-12 18:06:12,394 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fdll_sorted_true_unreach_call_true_valid_memsafety_i____rlim64_t in dll-sorted_true-unreach-call_true-valid-memsafety.i [2018-04-12 18:06:12,394 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fdll_sorted_true_unreach_call_true_valid_memsafety_i____qaddr_t in dll-sorted_true-unreach-call_true-valid-memsafety.i [2018-04-12 18:06:12,394 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fdll_sorted_true_unreach_call_true_valid_memsafety_i____clock_t in dll-sorted_true-unreach-call_true-valid-memsafety.i [2018-04-12 18:06:12,394 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fdll_sorted_true_unreach_call_true_valid_memsafety_i____blksize_t in dll-sorted_true-unreach-call_true-valid-memsafety.i [2018-04-12 18:06:12,395 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fdll_sorted_true_unreach_call_true_valid_memsafety_i__pthread_condattr_t in dll-sorted_true-unreach-call_true-valid-memsafety.i [2018-04-12 18:06:12,395 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fdll_sorted_true_unreach_call_true_valid_memsafety_i____u_quad_t in dll-sorted_true-unreach-call_true-valid-memsafety.i [2018-04-12 18:06:12,395 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fdll_sorted_true_unreach_call_true_valid_memsafety_i__pthread_barrier_t in dll-sorted_true-unreach-call_true-valid-memsafety.i [2018-04-12 18:06:12,395 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fdll_sorted_true_unreach_call_true_valid_memsafety_i____pid_t in dll-sorted_true-unreach-call_true-valid-memsafety.i [2018-04-12 18:06:12,395 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fdll_sorted_true_unreach_call_true_valid_memsafety_i____syscall_slong_t in dll-sorted_true-unreach-call_true-valid-memsafety.i [2018-04-12 18:06:12,395 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fdll_sorted_true_unreach_call_true_valid_memsafety_i____ino_t in dll-sorted_true-unreach-call_true-valid-memsafety.i [2018-04-12 18:06:12,395 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fdll_sorted_true_unreach_call_true_valid_memsafety_i__ushort in dll-sorted_true-unreach-call_true-valid-memsafety.i [2018-04-12 18:06:12,395 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fdll_sorted_true_unreach_call_true_valid_memsafety_i____fsid_t in dll-sorted_true-unreach-call_true-valid-memsafety.i [2018-04-12 18:06:12,395 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fdll_sorted_true_unreach_call_true_valid_memsafety_i____loff_t in dll-sorted_true-unreach-call_true-valid-memsafety.i [2018-04-12 18:06:12,395 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fdll_sorted_true_unreach_call_true_valid_memsafety_i____ino64_t in dll-sorted_true-unreach-call_true-valid-memsafety.i [2018-04-12 18:06:12,395 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fdll_sorted_true_unreach_call_true_valid_memsafety_i____quad_t in dll-sorted_true-unreach-call_true-valid-memsafety.i [2018-04-12 18:06:12,396 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fdll_sorted_true_unreach_call_true_valid_memsafety_i__clock_t in dll-sorted_true-unreach-call_true-valid-memsafety.i [2018-04-12 18:06:12,396 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fdll_sorted_true_unreach_call_true_valid_memsafety_i__suseconds_t in dll-sorted_true-unreach-call_true-valid-memsafety.i [2018-04-12 18:06:12,396 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fdll_sorted_true_unreach_call_true_valid_memsafety_i__pthread_rwlockattr_t in dll-sorted_true-unreach-call_true-valid-memsafety.i [2018-04-12 18:06:12,396 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fdll_sorted_true_unreach_call_true_valid_memsafety_i__u_long in dll-sorted_true-unreach-call_true-valid-memsafety.i [2018-04-12 18:06:12,396 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fdll_sorted_true_unreach_call_true_valid_memsafety_i__fd_mask in dll-sorted_true-unreach-call_true-valid-memsafety.i [2018-04-12 18:06:12,396 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fdll_sorted_true_unreach_call_true_valid_memsafety_i____off_t in dll-sorted_true-unreach-call_true-valid-memsafety.i [2018-04-12 18:06:12,396 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fdll_sorted_true_unreach_call_true_valid_memsafety_i__ulong in dll-sorted_true-unreach-call_true-valid-memsafety.i [2018-04-12 18:06:12,396 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fdll_sorted_true_unreach_call_true_valid_memsafety_i__SLL in dll-sorted_true-unreach-call_true-valid-memsafety.i [2018-04-12 18:06:12,396 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fdll_sorted_true_unreach_call_true_valid_memsafety_i__u_int16_t in dll-sorted_true-unreach-call_true-valid-memsafety.i [2018-04-12 18:06:12,396 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fdll_sorted_true_unreach_call_true_valid_memsafety_i__blkcnt_t in dll-sorted_true-unreach-call_true-valid-memsafety.i [2018-04-12 18:06:12,396 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fdll_sorted_true_unreach_call_true_valid_memsafety_i____u_int in dll-sorted_true-unreach-call_true-valid-memsafety.i [2018-04-12 18:06:12,396 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fdll_sorted_true_unreach_call_true_valid_memsafety_i__u_char in dll-sorted_true-unreach-call_true-valid-memsafety.i [2018-04-12 18:06:12,397 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fdll_sorted_true_unreach_call_true_valid_memsafety_i____clockid_t in dll-sorted_true-unreach-call_true-valid-memsafety.i [2018-04-12 18:06:12,397 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fdll_sorted_true_unreach_call_true_valid_memsafety_i__quad_t in dll-sorted_true-unreach-call_true-valid-memsafety.i [2018-04-12 18:06:12,397 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fdll_sorted_true_unreach_call_true_valid_memsafety_i__pthread_cond_t in dll-sorted_true-unreach-call_true-valid-memsafety.i [2018-04-12 18:06:12,397 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fdll_sorted_true_unreach_call_true_valid_memsafety_i____sigset_t in dll-sorted_true-unreach-call_true-valid-memsafety.i [2018-04-12 18:06:12,397 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fdll_sorted_true_unreach_call_true_valid_memsafety_i__sigset_t in dll-sorted_true-unreach-call_true-valid-memsafety.i [2018-04-12 18:06:12,397 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fdll_sorted_true_unreach_call_true_valid_memsafety_i____blkcnt_t in dll-sorted_true-unreach-call_true-valid-memsafety.i [2018-04-12 18:06:12,397 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fdll_sorted_true_unreach_call_true_valid_memsafety_i__id_t in dll-sorted_true-unreach-call_true-valid-memsafety.i [2018-04-12 18:06:12,397 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fdll_sorted_true_unreach_call_true_valid_memsafety_i__pthread_spinlock_t in dll-sorted_true-unreach-call_true-valid-memsafety.i [2018-04-12 18:06:12,397 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fdll_sorted_true_unreach_call_true_valid_memsafety_i____u_long in dll-sorted_true-unreach-call_true-valid-memsafety.i [2018-04-12 18:06:12,397 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fdll_sorted_true_unreach_call_true_valid_memsafety_i__dev_t in dll-sorted_true-unreach-call_true-valid-memsafety.i [2018-04-12 18:06:12,397 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fdll_sorted_true_unreach_call_true_valid_memsafety_i____int16_t in dll-sorted_true-unreach-call_true-valid-memsafety.i [2018-04-12 18:06:12,397 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fdll_sorted_true_unreach_call_true_valid_memsafety_i____off64_t in dll-sorted_true-unreach-call_true-valid-memsafety.i [2018-04-12 18:06:12,397 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fdll_sorted_true_unreach_call_true_valid_memsafety_i____sig_atomic_t in dll-sorted_true-unreach-call_true-valid-memsafety.i [2018-04-12 18:06:12,397 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fdll_sorted_true_unreach_call_true_valid_memsafety_i__pthread_attr_t in dll-sorted_true-unreach-call_true-valid-memsafety.i [2018-04-12 18:06:12,397 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fdll_sorted_true_unreach_call_true_valid_memsafety_i____uid_t in dll-sorted_true-unreach-call_true-valid-memsafety.i [2018-04-12 18:06:12,398 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fdll_sorted_true_unreach_call_true_valid_memsafety_i__int16_t in dll-sorted_true-unreach-call_true-valid-memsafety.i [2018-04-12 18:06:12,398 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fdll_sorted_true_unreach_call_true_valid_memsafety_i____fd_mask in dll-sorted_true-unreach-call_true-valid-memsafety.i [2018-04-12 18:06:12,398 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fdll_sorted_true_unreach_call_true_valid_memsafety_i____u_char in dll-sorted_true-unreach-call_true-valid-memsafety.i [2018-04-12 18:06:12,398 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fdll_sorted_true_unreach_call_true_valid_memsafety_i____fsblkcnt64_t in dll-sorted_true-unreach-call_true-valid-memsafety.i [2018-04-12 18:06:12,398 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fdll_sorted_true_unreach_call_true_valid_memsafety_i__wchar_t in dll-sorted_true-unreach-call_true-valid-memsafety.i [2018-04-12 18:06:12,398 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fdll_sorted_true_unreach_call_true_valid_memsafety_i__uid_t in dll-sorted_true-unreach-call_true-valid-memsafety.i [2018-04-12 18:06:12,398 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fdll_sorted_true_unreach_call_true_valid_memsafety_i__uint in dll-sorted_true-unreach-call_true-valid-memsafety.i [2018-04-12 18:06:12,398 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fdll_sorted_true_unreach_call_true_valid_memsafety_i__nlink_t in dll-sorted_true-unreach-call_true-valid-memsafety.i [2018-04-12 18:06:12,398 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fdll_sorted_true_unreach_call_true_valid_memsafety_i__lldiv_t in dll-sorted_true-unreach-call_true-valid-memsafety.i [2018-04-12 18:06:12,398 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fdll_sorted_true_unreach_call_true_valid_memsafety_i__ssize_t in dll-sorted_true-unreach-call_true-valid-memsafety.i [2018-04-12 18:06:12,398 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fdll_sorted_true_unreach_call_true_valid_memsafety_i____fsword_t in dll-sorted_true-unreach-call_true-valid-memsafety.i [2018-04-12 18:06:12,398 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fdll_sorted_true_unreach_call_true_valid_memsafety_i____uint64_t in dll-sorted_true-unreach-call_true-valid-memsafety.i [2018-04-12 18:06:12,398 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fdll_sorted_true_unreach_call_true_valid_memsafety_i____suseconds_t in dll-sorted_true-unreach-call_true-valid-memsafety.i [2018-04-12 18:06:12,398 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fdll_sorted_true_unreach_call_true_valid_memsafety_i____nlink_t in dll-sorted_true-unreach-call_true-valid-memsafety.i [2018-04-12 18:06:12,398 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fdll_sorted_true_unreach_call_true_valid_memsafety_i____pthread_slist_t in dll-sorted_true-unreach-call_true-valid-memsafety.i [2018-04-12 18:06:12,398 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fdll_sorted_true_unreach_call_true_valid_memsafety_i____int32_t in dll-sorted_true-unreach-call_true-valid-memsafety.i [2018-04-12 18:06:12,398 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fdll_sorted_true_unreach_call_true_valid_memsafety_i__u_int8_t in dll-sorted_true-unreach-call_true-valid-memsafety.i [2018-04-12 18:06:12,398 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fdll_sorted_true_unreach_call_true_valid_memsafety_i__timer_t in dll-sorted_true-unreach-call_true-valid-memsafety.i [2018-04-12 18:06:12,398 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fdll_sorted_true_unreach_call_true_valid_memsafety_i__clockid_t in dll-sorted_true-unreach-call_true-valid-memsafety.i [2018-04-12 18:06:12,398 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fdll_sorted_true_unreach_call_true_valid_memsafety_i__u_int32_t in dll-sorted_true-unreach-call_true-valid-memsafety.i [2018-04-12 18:06:12,399 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fdll_sorted_true_unreach_call_true_valid_memsafety_i____id_t in dll-sorted_true-unreach-call_true-valid-memsafety.i [2018-04-12 18:06:12,399 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fdll_sorted_true_unreach_call_true_valid_memsafety_i__pthread_t in dll-sorted_true-unreach-call_true-valid-memsafety.i [2018-04-12 18:06:12,399 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fdll_sorted_true_unreach_call_true_valid_memsafety_i__u_int in dll-sorted_true-unreach-call_true-valid-memsafety.i [2018-04-12 18:06:12,399 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fdll_sorted_true_unreach_call_true_valid_memsafety_i____syscall_ulong_t in dll-sorted_true-unreach-call_true-valid-memsafety.i [2018-04-12 18:06:12,399 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fdll_sorted_true_unreach_call_true_valid_memsafety_i____gid_t in dll-sorted_true-unreach-call_true-valid-memsafety.i [2018-04-12 18:06:12,399 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fdll_sorted_true_unreach_call_true_valid_memsafety_i__fsblkcnt_t in dll-sorted_true-unreach-call_true-valid-memsafety.i [2018-04-12 18:06:12,411 INFO L330 CDTParser]: Deleted temporary CDT project at /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/data/FLAG88418a08b [2018-04-12 18:06:12,413 INFO L304 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-04-12 18:06:12,414 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2018-04-12 18:06:12,415 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-04-12 18:06:12,415 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-04-12 18:06:12,418 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-04-12 18:06:12,419 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 12.04 06:06:12" (1/1) ... [2018-04-12 18:06:12,420 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@60c8c63d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.04 06:06:12, skipping insertion in model container [2018-04-12 18:06:12,421 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 12.04 06:06:12" (1/1) ... [2018-04-12 18:06:12,431 INFO L167 Dispatcher]: Using SV-COMP mode [2018-04-12 18:06:12,458 INFO L167 Dispatcher]: Using SV-COMP mode [2018-04-12 18:06:12,612 INFO L175 PostProcessor]: Settings: Checked method=main [2018-04-12 18:06:12,653 INFO L175 PostProcessor]: Settings: Checked method=main [2018-04-12 18:06:12,658 INFO L100 SccComputation]: Graph consists of 0 InCaSumBalls and 115 non ball SCCs. Number of states in SCCs 115. [2018-04-12 18:06:12,695 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.04 06:06:12 WrapperNode [2018-04-12 18:06:12,695 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-04-12 18:06:12,696 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-04-12 18:06:12,696 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-04-12 18:06:12,696 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-04-12 18:06:12,707 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.04 06:06:12" (1/1) ... [2018-04-12 18:06:12,707 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.04 06:06:12" (1/1) ... [2018-04-12 18:06:12,719 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.04 06:06:12" (1/1) ... [2018-04-12 18:06:12,719 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.04 06:06:12" (1/1) ... [2018-04-12 18:06:12,728 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.04 06:06:12" (1/1) ... [2018-04-12 18:06:12,734 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.04 06:06:12" (1/1) ... [2018-04-12 18:06:12,736 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.04 06:06:12" (1/1) ... [2018-04-12 18:06:12,740 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-04-12 18:06:12,740 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-04-12 18:06:12,740 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-04-12 18:06:12,740 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-04-12 18:06:12,741 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.04 06:06:12" (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-12 18:06:12,830 INFO L136 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-04-12 18:06:12,830 INFO L136 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-04-12 18:06:12,830 INFO L136 BoogieDeclarations]: Found implementation of procedure main [2018-04-12 18:06:12,830 INFO L128 BoogieDeclarations]: Found specification of procedure __ctype_get_mb_cur_max [2018-04-12 18:06:12,830 INFO L128 BoogieDeclarations]: Found specification of procedure atof [2018-04-12 18:06:12,830 INFO L128 BoogieDeclarations]: Found specification of procedure atoi [2018-04-12 18:06:12,830 INFO L128 BoogieDeclarations]: Found specification of procedure atol [2018-04-12 18:06:12,830 INFO L128 BoogieDeclarations]: Found specification of procedure atoll [2018-04-12 18:06:12,831 INFO L128 BoogieDeclarations]: Found specification of procedure strtod [2018-04-12 18:06:12,831 INFO L128 BoogieDeclarations]: Found specification of procedure strtof [2018-04-12 18:06:12,831 INFO L128 BoogieDeclarations]: Found specification of procedure strtold [2018-04-12 18:06:12,831 INFO L128 BoogieDeclarations]: Found specification of procedure strtol [2018-04-12 18:06:12,831 INFO L128 BoogieDeclarations]: Found specification of procedure strtoul [2018-04-12 18:06:12,831 INFO L128 BoogieDeclarations]: Found specification of procedure strtoq [2018-04-12 18:06:12,831 INFO L128 BoogieDeclarations]: Found specification of procedure strtouq [2018-04-12 18:06:12,831 INFO L128 BoogieDeclarations]: Found specification of procedure strtoll [2018-04-12 18:06:12,831 INFO L128 BoogieDeclarations]: Found specification of procedure strtoull [2018-04-12 18:06:12,831 INFO L128 BoogieDeclarations]: Found specification of procedure l64a [2018-04-12 18:06:12,831 INFO L128 BoogieDeclarations]: Found specification of procedure a64l [2018-04-12 18:06:12,832 INFO L128 BoogieDeclarations]: Found specification of procedure select [2018-04-12 18:06:12,832 INFO L128 BoogieDeclarations]: Found specification of procedure pselect [2018-04-12 18:06:12,832 INFO L128 BoogieDeclarations]: Found specification of procedure gnu_dev_major [2018-04-12 18:06:12,832 INFO L128 BoogieDeclarations]: Found specification of procedure gnu_dev_minor [2018-04-12 18:06:12,832 INFO L128 BoogieDeclarations]: Found specification of procedure gnu_dev_makedev [2018-04-12 18:06:12,832 INFO L128 BoogieDeclarations]: Found specification of procedure random [2018-04-12 18:06:12,832 INFO L128 BoogieDeclarations]: Found specification of procedure srandom [2018-04-12 18:06:12,832 INFO L128 BoogieDeclarations]: Found specification of procedure initstate [2018-04-12 18:06:12,832 INFO L128 BoogieDeclarations]: Found specification of procedure setstate [2018-04-12 18:06:12,832 INFO L128 BoogieDeclarations]: Found specification of procedure random_r [2018-04-12 18:06:12,832 INFO L128 BoogieDeclarations]: Found specification of procedure srandom_r [2018-04-12 18:06:12,833 INFO L128 BoogieDeclarations]: Found specification of procedure initstate_r [2018-04-12 18:06:12,833 INFO L128 BoogieDeclarations]: Found specification of procedure setstate_r [2018-04-12 18:06:12,833 INFO L128 BoogieDeclarations]: Found specification of procedure rand [2018-04-12 18:06:12,833 INFO L128 BoogieDeclarations]: Found specification of procedure srand [2018-04-12 18:06:12,833 INFO L128 BoogieDeclarations]: Found specification of procedure rand_r [2018-04-12 18:06:12,833 INFO L128 BoogieDeclarations]: Found specification of procedure drand48 [2018-04-12 18:06:12,833 INFO L128 BoogieDeclarations]: Found specification of procedure erand48 [2018-04-12 18:06:12,833 INFO L128 BoogieDeclarations]: Found specification of procedure lrand48 [2018-04-12 18:06:12,833 INFO L128 BoogieDeclarations]: Found specification of procedure nrand48 [2018-04-12 18:06:12,834 INFO L128 BoogieDeclarations]: Found specification of procedure mrand48 [2018-04-12 18:06:12,834 INFO L128 BoogieDeclarations]: Found specification of procedure jrand48 [2018-04-12 18:06:12,834 INFO L128 BoogieDeclarations]: Found specification of procedure srand48 [2018-04-12 18:06:12,834 INFO L128 BoogieDeclarations]: Found specification of procedure seed48 [2018-04-12 18:06:12,834 INFO L128 BoogieDeclarations]: Found specification of procedure lcong48 [2018-04-12 18:06:12,834 INFO L128 BoogieDeclarations]: Found specification of procedure drand48_r [2018-04-12 18:06:12,834 INFO L128 BoogieDeclarations]: Found specification of procedure erand48_r [2018-04-12 18:06:12,834 INFO L128 BoogieDeclarations]: Found specification of procedure lrand48_r [2018-04-12 18:06:12,834 INFO L128 BoogieDeclarations]: Found specification of procedure nrand48_r [2018-04-12 18:06:12,834 INFO L128 BoogieDeclarations]: Found specification of procedure mrand48_r [2018-04-12 18:06:12,835 INFO L128 BoogieDeclarations]: Found specification of procedure jrand48_r [2018-04-12 18:06:12,835 INFO L128 BoogieDeclarations]: Found specification of procedure srand48_r [2018-04-12 18:06:12,835 INFO L128 BoogieDeclarations]: Found specification of procedure seed48_r [2018-04-12 18:06:12,835 INFO L128 BoogieDeclarations]: Found specification of procedure lcong48_r [2018-04-12 18:06:12,835 INFO L128 BoogieDeclarations]: Found specification of procedure malloc [2018-04-12 18:06:12,835 INFO L128 BoogieDeclarations]: Found specification of procedure calloc [2018-04-12 18:06:12,835 INFO L128 BoogieDeclarations]: Found specification of procedure realloc [2018-04-12 18:06:12,835 INFO L128 BoogieDeclarations]: Found specification of procedure free [2018-04-12 18:06:12,835 INFO L128 BoogieDeclarations]: Found specification of procedure cfree [2018-04-12 18:06:12,836 INFO L128 BoogieDeclarations]: Found specification of procedure alloca [2018-04-12 18:06:12,836 INFO L128 BoogieDeclarations]: Found specification of procedure valloc [2018-04-12 18:06:12,836 INFO L128 BoogieDeclarations]: Found specification of procedure posix_memalign [2018-04-12 18:06:12,836 INFO L128 BoogieDeclarations]: Found specification of procedure aligned_alloc [2018-04-12 18:06:12,836 INFO L128 BoogieDeclarations]: Found specification of procedure abort [2018-04-12 18:06:12,836 INFO L128 BoogieDeclarations]: Found specification of procedure atexit [2018-04-12 18:06:12,836 INFO L128 BoogieDeclarations]: Found specification of procedure at_quick_exit [2018-04-12 18:06:12,836 INFO L128 BoogieDeclarations]: Found specification of procedure on_exit [2018-04-12 18:06:12,836 INFO L128 BoogieDeclarations]: Found specification of procedure exit [2018-04-12 18:06:12,836 INFO L128 BoogieDeclarations]: Found specification of procedure quick_exit [2018-04-12 18:06:12,837 INFO L128 BoogieDeclarations]: Found specification of procedure _Exit [2018-04-12 18:06:12,837 INFO L128 BoogieDeclarations]: Found specification of procedure getenv [2018-04-12 18:06:12,837 INFO L128 BoogieDeclarations]: Found specification of procedure putenv [2018-04-12 18:06:12,837 INFO L128 BoogieDeclarations]: Found specification of procedure setenv [2018-04-12 18:06:12,837 INFO L128 BoogieDeclarations]: Found specification of procedure unsetenv [2018-04-12 18:06:12,837 INFO L128 BoogieDeclarations]: Found specification of procedure clearenv [2018-04-12 18:06:12,837 INFO L128 BoogieDeclarations]: Found specification of procedure mktemp [2018-04-12 18:06:12,837 INFO L128 BoogieDeclarations]: Found specification of procedure mkstemp [2018-04-12 18:06:12,837 INFO L128 BoogieDeclarations]: Found specification of procedure mkstemps [2018-04-12 18:06:12,837 INFO L128 BoogieDeclarations]: Found specification of procedure mkdtemp [2018-04-12 18:06:12,837 INFO L128 BoogieDeclarations]: Found specification of procedure system [2018-04-12 18:06:12,837 INFO L128 BoogieDeclarations]: Found specification of procedure realpath [2018-04-12 18:06:12,837 INFO L128 BoogieDeclarations]: Found specification of procedure bsearch [2018-04-12 18:06:12,837 INFO L128 BoogieDeclarations]: Found specification of procedure qsort [2018-04-12 18:06:12,837 INFO L128 BoogieDeclarations]: Found specification of procedure abs [2018-04-12 18:06:12,837 INFO L128 BoogieDeclarations]: Found specification of procedure labs [2018-04-12 18:06:12,837 INFO L128 BoogieDeclarations]: Found specification of procedure llabs [2018-04-12 18:06:12,837 INFO L128 BoogieDeclarations]: Found specification of procedure div [2018-04-12 18:06:12,838 INFO L128 BoogieDeclarations]: Found specification of procedure ldiv [2018-04-12 18:06:12,838 INFO L128 BoogieDeclarations]: Found specification of procedure lldiv [2018-04-12 18:06:12,838 INFO L128 BoogieDeclarations]: Found specification of procedure ecvt [2018-04-12 18:06:12,838 INFO L128 BoogieDeclarations]: Found specification of procedure fcvt [2018-04-12 18:06:12,838 INFO L128 BoogieDeclarations]: Found specification of procedure gcvt [2018-04-12 18:06:12,838 INFO L128 BoogieDeclarations]: Found specification of procedure qecvt [2018-04-12 18:06:12,838 INFO L128 BoogieDeclarations]: Found specification of procedure qfcvt [2018-04-12 18:06:12,838 INFO L128 BoogieDeclarations]: Found specification of procedure qgcvt [2018-04-12 18:06:12,838 INFO L128 BoogieDeclarations]: Found specification of procedure ecvt_r [2018-04-12 18:06:12,838 INFO L128 BoogieDeclarations]: Found specification of procedure fcvt_r [2018-04-12 18:06:12,838 INFO L128 BoogieDeclarations]: Found specification of procedure qecvt_r [2018-04-12 18:06:12,838 INFO L128 BoogieDeclarations]: Found specification of procedure qfcvt_r [2018-04-12 18:06:12,838 INFO L128 BoogieDeclarations]: Found specification of procedure mblen [2018-04-12 18:06:12,838 INFO L128 BoogieDeclarations]: Found specification of procedure mbtowc [2018-04-12 18:06:12,839 INFO L128 BoogieDeclarations]: Found specification of procedure wctomb [2018-04-12 18:06:12,839 INFO L128 BoogieDeclarations]: Found specification of procedure mbstowcs [2018-04-12 18:06:12,839 INFO L128 BoogieDeclarations]: Found specification of procedure wcstombs [2018-04-12 18:06:12,839 INFO L128 BoogieDeclarations]: Found specification of procedure rpmatch [2018-04-12 18:06:12,839 INFO L128 BoogieDeclarations]: Found specification of procedure getsubopt [2018-04-12 18:06:12,839 INFO L128 BoogieDeclarations]: Found specification of procedure getloadavg [2018-04-12 18:06:12,839 INFO L128 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2018-04-12 18:06:12,839 INFO L128 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2018-04-12 18:06:12,839 INFO L128 BoogieDeclarations]: Found specification of procedure main [2018-04-12 18:06:12,839 INFO L128 BoogieDeclarations]: Found specification of procedure #Ultimate.alloc [2018-04-12 18:06:12,840 INFO L128 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2018-04-12 18:06:12,840 INFO L128 BoogieDeclarations]: Found specification of procedure write~int [2018-04-12 18:06:12,840 INFO L128 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2018-04-12 18:06:12,840 INFO L128 BoogieDeclarations]: Found specification of procedure read~int [2018-04-12 18:06:12,840 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2018-04-12 18:06:12,840 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-04-12 18:06:12,840 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-04-12 18:06:12,840 INFO L128 BoogieDeclarations]: Found specification of procedure write~unchecked~int [2018-04-12 18:06:13,304 INFO L259 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-04-12 18:06:13,305 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.04 06:06:13 BoogieIcfgContainer [2018-04-12 18:06:13,305 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-04-12 18:06:13,306 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-04-12 18:06:13,306 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-04-12 18:06:13,309 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-04-12 18:06:13,309 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 12.04 06:06:12" (1/3) ... [2018-04-12 18:06:13,309 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1a45f62e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 12.04 06:06:13, skipping insertion in model container [2018-04-12 18:06:13,310 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.04 06:06:12" (2/3) ... [2018-04-12 18:06:13,310 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1a45f62e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 12.04 06:06:13, skipping insertion in model container [2018-04-12 18:06:13,310 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.04 06:06:13" (3/3) ... [2018-04-12 18:06:13,311 INFO L107 eAbstractionObserver]: Analyzing ICFG dll-sorted_true-unreach-call_true-valid-memsafety.i [2018-04-12 18:06:13,319 INFO L131 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-04-12 18:06:13,327 INFO L143 ceAbstractionStarter]: Appying trace abstraction to program that has 73 error locations. [2018-04-12 18:06:13,356 INFO L128 ementStrategyFactory]: Using default assertion order modulation [2018-04-12 18:06:13,357 INFO L369 AbstractCegarLoop]: Interprodecural is true [2018-04-12 18:06:13,357 INFO L370 AbstractCegarLoop]: Hoare is false [2018-04-12 18:06:13,357 INFO L371 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-04-12 18:06:13,357 INFO L372 AbstractCegarLoop]: Backedges is TWOTRACK [2018-04-12 18:06:13,357 INFO L373 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-04-12 18:06:13,357 INFO L374 AbstractCegarLoop]: Difference is false [2018-04-12 18:06:13,357 INFO L375 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-04-12 18:06:13,357 INFO L380 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-04-12 18:06:13,358 INFO L87 2NestedWordAutomaton]: Mode: main mode - execution starts in main procedure [2018-04-12 18:06:13,368 INFO L276 IsEmpty]: Start isEmpty. Operand 185 states. [2018-04-12 18:06:13,373 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2018-04-12 18:06:13,373 INFO L347 BasicCegarLoop]: Found error trace [2018-04-12 18:06:13,373 INFO L355 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2018-04-12 18:06:13,373 INFO L408 AbstractCegarLoop]: === Iteration 1 === [mainErr51RequiresViolation, mainErr69RequiresViolation, mainErr26RequiresViolation, mainErr54RequiresViolation, mainErr66RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr31RequiresViolation, mainErr46RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr58RequiresViolation, mainErr62RequiresViolation, mainErr15RequiresViolation, mainErr49RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr55RequiresViolation, mainErr65RequiresViolation, mainErr17RequiresViolation, mainErr42RequiresViolation, mainErr71AssertViolationMEMORY_FREE, mainErr30RequiresViolation, mainErr11RequiresViolation, mainErr57RequiresViolation, mainErr63RequiresViolation, mainErr24RequiresViolation, mainErr44RequiresViolation, mainErr10RequiresViolation, mainErr43RequiresViolation, mainErr4RequiresViolation, mainErr50RequiresViolation, mainErr72EnsuresViolationMEMORY_LEAK, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr61RequiresViolation, mainErr59RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr70AssertViolationMEMORY_FREE, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr56RequiresViolation, mainErr64RequiresViolation, mainErr48RequiresViolation, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr52RequiresViolation, mainErr68RequiresViolation, mainErr45RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr60RequiresViolation, mainErr9RequiresViolation, mainErr67RequiresViolation, mainErr53RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr34RequiresViolation, mainErr47RequiresViolation, mainErr14RequiresViolation, mainErr40RequiresViolation]=== [2018-04-12 18:06:13,376 INFO L82 PathProgramCache]: Analyzing trace with hash 1591934807, now seen corresponding path program 1 times [2018-04-12 18:06:13,377 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-04-12 18:06:13,377 INFO L68 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-04-12 18:06:13,413 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-12 18:06:13,413 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-12 18:06:13,413 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-12 18:06:13,438 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-12 18:06:13,445 WARN L250 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-12 18:06:13,481 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-12 18:06:13,483 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-04-12 18:06:13,483 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-04-12 18:06:13,484 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-04-12 18:06:13,493 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-04-12 18:06:13,494 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-04-12 18:06:13,496 INFO L87 Difference]: Start difference. First operand 185 states. Second operand 4 states. [2018-04-12 18:06:13,688 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-12 18:06:13,688 INFO L93 Difference]: Finished difference Result 197 states and 209 transitions. [2018-04-12 18:06:13,689 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-04-12 18:06:13,690 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 8 [2018-04-12 18:06:13,690 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-12 18:06:13,698 INFO L225 Difference]: With dead ends: 197 [2018-04-12 18:06:13,698 INFO L226 Difference]: Without dead ends: 193 [2018-04-12 18:06:13,699 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-12 18:06:13,711 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 193 states. [2018-04-12 18:06:13,726 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 193 to 179. [2018-04-12 18:06:13,727 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 179 states. [2018-04-12 18:06:13,729 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 179 states to 179 states and 190 transitions. [2018-04-12 18:06:13,730 INFO L78 Accepts]: Start accepts. Automaton has 179 states and 190 transitions. Word has length 8 [2018-04-12 18:06:13,730 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-12 18:06:13,730 INFO L459 AbstractCegarLoop]: Abstraction has 179 states and 190 transitions. [2018-04-12 18:06:13,730 INFO L460 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-04-12 18:06:13,730 INFO L276 IsEmpty]: Start isEmpty. Operand 179 states and 190 transitions. [2018-04-12 18:06:13,731 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2018-04-12 18:06:13,731 INFO L347 BasicCegarLoop]: Found error trace [2018-04-12 18:06:13,731 INFO L355 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2018-04-12 18:06:13,731 INFO L408 AbstractCegarLoop]: === Iteration 2 === [mainErr51RequiresViolation, mainErr69RequiresViolation, mainErr26RequiresViolation, mainErr54RequiresViolation, mainErr66RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr31RequiresViolation, mainErr46RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr58RequiresViolation, mainErr62RequiresViolation, mainErr15RequiresViolation, mainErr49RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr55RequiresViolation, mainErr65RequiresViolation, mainErr17RequiresViolation, mainErr42RequiresViolation, mainErr71AssertViolationMEMORY_FREE, mainErr30RequiresViolation, mainErr11RequiresViolation, mainErr57RequiresViolation, mainErr63RequiresViolation, mainErr24RequiresViolation, mainErr44RequiresViolation, mainErr10RequiresViolation, mainErr43RequiresViolation, mainErr4RequiresViolation, mainErr50RequiresViolation, mainErr72EnsuresViolationMEMORY_LEAK, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr61RequiresViolation, mainErr59RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr70AssertViolationMEMORY_FREE, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr56RequiresViolation, mainErr64RequiresViolation, mainErr48RequiresViolation, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr52RequiresViolation, mainErr68RequiresViolation, mainErr45RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr60RequiresViolation, mainErr9RequiresViolation, mainErr67RequiresViolation, mainErr53RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr34RequiresViolation, mainErr47RequiresViolation, mainErr14RequiresViolation, mainErr40RequiresViolation]=== [2018-04-12 18:06:13,731 INFO L82 PathProgramCache]: Analyzing trace with hash 1591934808, now seen corresponding path program 1 times [2018-04-12 18:06:13,731 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-04-12 18:06:13,731 INFO L68 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-04-12 18:06:13,733 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-12 18:06:13,733 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-12 18:06:13,733 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-12 18:06:13,744 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-12 18:06:13,745 WARN L250 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-12 18:06:13,774 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-12 18:06:13,774 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-04-12 18:06:13,775 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-04-12 18:06:13,776 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-04-12 18:06:13,776 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-04-12 18:06:13,776 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-04-12 18:06:13,776 INFO L87 Difference]: Start difference. First operand 179 states and 190 transitions. Second operand 4 states. [2018-04-12 18:06:13,883 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-12 18:06:13,883 INFO L93 Difference]: Finished difference Result 181 states and 192 transitions. [2018-04-12 18:06:13,883 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-04-12 18:06:13,883 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 8 [2018-04-12 18:06:13,884 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-12 18:06:13,885 INFO L225 Difference]: With dead ends: 181 [2018-04-12 18:06:13,885 INFO L226 Difference]: Without dead ends: 181 [2018-04-12 18:06:13,885 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-12 18:06:13,886 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 181 states. [2018-04-12 18:06:13,891 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 181 to 176. [2018-04-12 18:06:13,891 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 176 states. [2018-04-12 18:06:13,892 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 176 states to 176 states and 187 transitions. [2018-04-12 18:06:13,892 INFO L78 Accepts]: Start accepts. Automaton has 176 states and 187 transitions. Word has length 8 [2018-04-12 18:06:13,893 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-12 18:06:13,893 INFO L459 AbstractCegarLoop]: Abstraction has 176 states and 187 transitions. [2018-04-12 18:06:13,893 INFO L460 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-04-12 18:06:13,893 INFO L276 IsEmpty]: Start isEmpty. Operand 176 states and 187 transitions. [2018-04-12 18:06:13,893 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2018-04-12 18:06:13,893 INFO L347 BasicCegarLoop]: Found error trace [2018-04-12 18:06:13,893 INFO L355 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-12 18:06:13,894 INFO L408 AbstractCegarLoop]: === Iteration 3 === [mainErr51RequiresViolation, mainErr69RequiresViolation, mainErr26RequiresViolation, mainErr54RequiresViolation, mainErr66RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr31RequiresViolation, mainErr46RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr58RequiresViolation, mainErr62RequiresViolation, mainErr15RequiresViolation, mainErr49RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr55RequiresViolation, mainErr65RequiresViolation, mainErr17RequiresViolation, mainErr42RequiresViolation, mainErr71AssertViolationMEMORY_FREE, mainErr30RequiresViolation, mainErr11RequiresViolation, mainErr57RequiresViolation, mainErr63RequiresViolation, mainErr24RequiresViolation, mainErr44RequiresViolation, mainErr10RequiresViolation, mainErr43RequiresViolation, mainErr4RequiresViolation, mainErr50RequiresViolation, mainErr72EnsuresViolationMEMORY_LEAK, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr61RequiresViolation, mainErr59RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr70AssertViolationMEMORY_FREE, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr56RequiresViolation, mainErr64RequiresViolation, mainErr48RequiresViolation, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr52RequiresViolation, mainErr68RequiresViolation, mainErr45RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr60RequiresViolation, mainErr9RequiresViolation, mainErr67RequiresViolation, mainErr53RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr34RequiresViolation, mainErr47RequiresViolation, mainErr14RequiresViolation, mainErr40RequiresViolation]=== [2018-04-12 18:06:13,894 INFO L82 PathProgramCache]: Analyzing trace with hash 1438606308, now seen corresponding path program 1 times [2018-04-12 18:06:13,894 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-04-12 18:06:13,894 INFO L68 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-04-12 18:06:13,895 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-12 18:06:13,895 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-12 18:06:13,896 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-12 18:06:13,914 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-12 18:06:13,915 WARN L250 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-12 18:06:13,950 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-12 18:06:13,951 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-04-12 18:06:13,951 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-04-12 18:06:13,951 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-04-12 18:06:13,951 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-04-12 18:06:13,951 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-04-12 18:06:13,952 INFO L87 Difference]: Start difference. First operand 176 states and 187 transitions. Second operand 4 states. [2018-04-12 18:06:14,070 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-12 18:06:14,070 INFO L93 Difference]: Finished difference Result 186 states and 200 transitions. [2018-04-12 18:06:14,070 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-04-12 18:06:14,070 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 16 [2018-04-12 18:06:14,070 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-12 18:06:14,071 INFO L225 Difference]: With dead ends: 186 [2018-04-12 18:06:14,071 INFO L226 Difference]: Without dead ends: 186 [2018-04-12 18:06:14,071 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-12 18:06:14,072 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 186 states. [2018-04-12 18:06:14,075 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 186 to 175. [2018-04-12 18:06:14,075 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 175 states. [2018-04-12 18:06:14,076 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 175 states to 175 states and 196 transitions. [2018-04-12 18:06:14,076 INFO L78 Accepts]: Start accepts. Automaton has 175 states and 196 transitions. Word has length 16 [2018-04-12 18:06:14,076 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-12 18:06:14,076 INFO L459 AbstractCegarLoop]: Abstraction has 175 states and 196 transitions. [2018-04-12 18:06:14,076 INFO L460 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-04-12 18:06:14,076 INFO L276 IsEmpty]: Start isEmpty. Operand 175 states and 196 transitions. [2018-04-12 18:06:14,076 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2018-04-12 18:06:14,076 INFO L347 BasicCegarLoop]: Found error trace [2018-04-12 18:06:14,076 INFO L355 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-12 18:06:14,076 INFO L408 AbstractCegarLoop]: === Iteration 4 === [mainErr51RequiresViolation, mainErr69RequiresViolation, mainErr26RequiresViolation, mainErr54RequiresViolation, mainErr66RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr31RequiresViolation, mainErr46RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr58RequiresViolation, mainErr62RequiresViolation, mainErr15RequiresViolation, mainErr49RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr55RequiresViolation, mainErr65RequiresViolation, mainErr17RequiresViolation, mainErr42RequiresViolation, mainErr71AssertViolationMEMORY_FREE, mainErr30RequiresViolation, mainErr11RequiresViolation, mainErr57RequiresViolation, mainErr63RequiresViolation, mainErr24RequiresViolation, mainErr44RequiresViolation, mainErr10RequiresViolation, mainErr43RequiresViolation, mainErr4RequiresViolation, mainErr50RequiresViolation, mainErr72EnsuresViolationMEMORY_LEAK, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr61RequiresViolation, mainErr59RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr70AssertViolationMEMORY_FREE, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr56RequiresViolation, mainErr64RequiresViolation, mainErr48RequiresViolation, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr52RequiresViolation, mainErr68RequiresViolation, mainErr45RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr60RequiresViolation, mainErr9RequiresViolation, mainErr67RequiresViolation, mainErr53RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr34RequiresViolation, mainErr47RequiresViolation, mainErr14RequiresViolation, mainErr40RequiresViolation]=== [2018-04-12 18:06:14,077 INFO L82 PathProgramCache]: Analyzing trace with hash 1438606309, now seen corresponding path program 1 times [2018-04-12 18:06:14,077 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-04-12 18:06:14,077 INFO L68 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-04-12 18:06:14,077 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-12 18:06:14,078 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-12 18:06:14,078 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-12 18:06:14,086 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-12 18:06:14,086 WARN L250 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-12 18:06:14,133 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-12 18:06:14,133 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-04-12 18:06:14,133 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-04-12 18:06:14,133 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-04-12 18:06:14,133 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-04-12 18:06:14,134 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-04-12 18:06:14,134 INFO L87 Difference]: Start difference. First operand 175 states and 196 transitions. Second operand 5 states. [2018-04-12 18:06:14,320 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-12 18:06:14,320 INFO L93 Difference]: Finished difference Result 267 states and 291 transitions. [2018-04-12 18:06:14,321 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-04-12 18:06:14,321 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 16 [2018-04-12 18:06:14,321 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-12 18:06:14,321 INFO L225 Difference]: With dead ends: 267 [2018-04-12 18:06:14,322 INFO L226 Difference]: Without dead ends: 267 [2018-04-12 18:06:14,322 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-12 18:06:14,322 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 267 states. [2018-04-12 18:06:14,328 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 267 to 236. [2018-04-12 18:06:14,328 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 236 states. [2018-04-12 18:06:14,329 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 236 states to 236 states and 275 transitions. [2018-04-12 18:06:14,330 INFO L78 Accepts]: Start accepts. Automaton has 236 states and 275 transitions. Word has length 16 [2018-04-12 18:06:14,330 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-12 18:06:14,330 INFO L459 AbstractCegarLoop]: Abstraction has 236 states and 275 transitions. [2018-04-12 18:06:14,330 INFO L460 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-04-12 18:06:14,330 INFO L276 IsEmpty]: Start isEmpty. Operand 236 states and 275 transitions. [2018-04-12 18:06:14,330 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2018-04-12 18:06:14,330 INFO L347 BasicCegarLoop]: Found error trace [2018-04-12 18:06:14,331 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-12 18:06:14,331 INFO L408 AbstractCegarLoop]: === Iteration 5 === [mainErr51RequiresViolation, mainErr69RequiresViolation, mainErr26RequiresViolation, mainErr54RequiresViolation, mainErr66RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr31RequiresViolation, mainErr46RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr58RequiresViolation, mainErr62RequiresViolation, mainErr15RequiresViolation, mainErr49RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr55RequiresViolation, mainErr65RequiresViolation, mainErr17RequiresViolation, mainErr42RequiresViolation, mainErr71AssertViolationMEMORY_FREE, mainErr30RequiresViolation, mainErr11RequiresViolation, mainErr57RequiresViolation, mainErr63RequiresViolation, mainErr24RequiresViolation, mainErr44RequiresViolation, mainErr10RequiresViolation, mainErr43RequiresViolation, mainErr4RequiresViolation, mainErr50RequiresViolation, mainErr72EnsuresViolationMEMORY_LEAK, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr61RequiresViolation, mainErr59RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr70AssertViolationMEMORY_FREE, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr56RequiresViolation, mainErr64RequiresViolation, mainErr48RequiresViolation, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr52RequiresViolation, mainErr68RequiresViolation, mainErr45RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr60RequiresViolation, mainErr9RequiresViolation, mainErr67RequiresViolation, mainErr53RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr34RequiresViolation, mainErr47RequiresViolation, mainErr14RequiresViolation, mainErr40RequiresViolation]=== [2018-04-12 18:06:14,331 INFO L82 PathProgramCache]: Analyzing trace with hash -478807353, now seen corresponding path program 1 times [2018-04-12 18:06:14,331 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-04-12 18:06:14,331 INFO L68 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-04-12 18:06:14,332 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-12 18:06:14,332 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-12 18:06:14,333 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-12 18:06:14,342 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-12 18:06:14,343 WARN L250 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-12 18:06:14,363 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-12 18:06:14,364 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-04-12 18:06:14,364 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-04-12 18:06:14,364 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-04-12 18:06:14,364 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-04-12 18:06:14,364 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-04-12 18:06:14,364 INFO L87 Difference]: Start difference. First operand 236 states and 275 transitions. Second operand 5 states. [2018-04-12 18:06:14,539 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-12 18:06:14,539 INFO L93 Difference]: Finished difference Result 416 states and 486 transitions. [2018-04-12 18:06:14,539 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-04-12 18:06:14,539 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 18 [2018-04-12 18:06:14,539 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-12 18:06:14,541 INFO L225 Difference]: With dead ends: 416 [2018-04-12 18:06:14,542 INFO L226 Difference]: Without dead ends: 416 [2018-04-12 18:06:14,542 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-12 18:06:14,542 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 416 states. [2018-04-12 18:06:14,549 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 416 to 235. [2018-04-12 18:06:14,549 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 235 states. [2018-04-12 18:06:14,550 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 235 states to 235 states and 273 transitions. [2018-04-12 18:06:14,550 INFO L78 Accepts]: Start accepts. Automaton has 235 states and 273 transitions. Word has length 18 [2018-04-12 18:06:14,550 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-12 18:06:14,551 INFO L459 AbstractCegarLoop]: Abstraction has 235 states and 273 transitions. [2018-04-12 18:06:14,551 INFO L460 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-04-12 18:06:14,551 INFO L276 IsEmpty]: Start isEmpty. Operand 235 states and 273 transitions. [2018-04-12 18:06:14,551 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2018-04-12 18:06:14,551 INFO L347 BasicCegarLoop]: Found error trace [2018-04-12 18:06:14,551 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-12 18:06:14,551 INFO L408 AbstractCegarLoop]: === Iteration 6 === [mainErr51RequiresViolation, mainErr69RequiresViolation, mainErr26RequiresViolation, mainErr54RequiresViolation, mainErr66RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr31RequiresViolation, mainErr46RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr58RequiresViolation, mainErr62RequiresViolation, mainErr15RequiresViolation, mainErr49RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr55RequiresViolation, mainErr65RequiresViolation, mainErr17RequiresViolation, mainErr42RequiresViolation, mainErr71AssertViolationMEMORY_FREE, mainErr30RequiresViolation, mainErr11RequiresViolation, mainErr57RequiresViolation, mainErr63RequiresViolation, mainErr24RequiresViolation, mainErr44RequiresViolation, mainErr10RequiresViolation, mainErr43RequiresViolation, mainErr4RequiresViolation, mainErr50RequiresViolation, mainErr72EnsuresViolationMEMORY_LEAK, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr61RequiresViolation, mainErr59RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr70AssertViolationMEMORY_FREE, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr56RequiresViolation, mainErr64RequiresViolation, mainErr48RequiresViolation, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr52RequiresViolation, mainErr68RequiresViolation, mainErr45RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr60RequiresViolation, mainErr9RequiresViolation, mainErr67RequiresViolation, mainErr53RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr34RequiresViolation, mainErr47RequiresViolation, mainErr14RequiresViolation, mainErr40RequiresViolation]=== [2018-04-12 18:06:14,552 INFO L82 PathProgramCache]: Analyzing trace with hash -478807352, now seen corresponding path program 1 times [2018-04-12 18:06:14,552 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-04-12 18:06:14,552 INFO L68 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-04-12 18:06:14,553 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-12 18:06:14,553 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-12 18:06:14,553 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-12 18:06:14,563 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-12 18:06:14,564 WARN L250 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-12 18:06:14,591 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-12 18:06:14,591 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-04-12 18:06:14,591 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-04-12 18:06:14,591 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-04-12 18:06:14,592 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-04-12 18:06:14,592 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-04-12 18:06:14,592 INFO L87 Difference]: Start difference. First operand 235 states and 273 transitions. Second operand 5 states. [2018-04-12 18:06:14,806 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-12 18:06:14,807 INFO L93 Difference]: Finished difference Result 425 states and 495 transitions. [2018-04-12 18:06:14,807 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-04-12 18:06:14,807 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 18 [2018-04-12 18:06:14,807 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-12 18:06:14,808 INFO L225 Difference]: With dead ends: 425 [2018-04-12 18:06:14,808 INFO L226 Difference]: Without dead ends: 425 [2018-04-12 18:06:14,809 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-12 18:06:14,809 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 425 states. [2018-04-12 18:06:14,813 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 425 to 234. [2018-04-12 18:06:14,813 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 234 states. [2018-04-12 18:06:14,814 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 234 states to 234 states and 271 transitions. [2018-04-12 18:06:14,814 INFO L78 Accepts]: Start accepts. Automaton has 234 states and 271 transitions. Word has length 18 [2018-04-12 18:06:14,814 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-12 18:06:14,814 INFO L459 AbstractCegarLoop]: Abstraction has 234 states and 271 transitions. [2018-04-12 18:06:14,814 INFO L460 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-04-12 18:06:14,814 INFO L276 IsEmpty]: Start isEmpty. Operand 234 states and 271 transitions. [2018-04-12 18:06:14,815 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2018-04-12 18:06:14,815 INFO L347 BasicCegarLoop]: Found error trace [2018-04-12 18:06:14,815 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-12 18:06:14,815 INFO L408 AbstractCegarLoop]: === Iteration 7 === [mainErr51RequiresViolation, mainErr69RequiresViolation, mainErr26RequiresViolation, mainErr54RequiresViolation, mainErr66RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr31RequiresViolation, mainErr46RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr58RequiresViolation, mainErr62RequiresViolation, mainErr15RequiresViolation, mainErr49RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr55RequiresViolation, mainErr65RequiresViolation, mainErr17RequiresViolation, mainErr42RequiresViolation, mainErr71AssertViolationMEMORY_FREE, mainErr30RequiresViolation, mainErr11RequiresViolation, mainErr57RequiresViolation, mainErr63RequiresViolation, mainErr24RequiresViolation, mainErr44RequiresViolation, mainErr10RequiresViolation, mainErr43RequiresViolation, mainErr4RequiresViolation, mainErr50RequiresViolation, mainErr72EnsuresViolationMEMORY_LEAK, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr61RequiresViolation, mainErr59RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr70AssertViolationMEMORY_FREE, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr56RequiresViolation, mainErr64RequiresViolation, mainErr48RequiresViolation, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr52RequiresViolation, mainErr68RequiresViolation, mainErr45RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr60RequiresViolation, mainErr9RequiresViolation, mainErr67RequiresViolation, mainErr53RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr34RequiresViolation, mainErr47RequiresViolation, mainErr14RequiresViolation, mainErr40RequiresViolation]=== [2018-04-12 18:06:14,816 INFO L82 PathProgramCache]: Analyzing trace with hash -287335223, now seen corresponding path program 1 times [2018-04-12 18:06:14,816 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-04-12 18:06:14,816 INFO L68 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-04-12 18:06:14,817 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-12 18:06:14,817 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-12 18:06:14,817 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-12 18:06:14,829 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-12 18:06:14,830 WARN L250 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-12 18:06:14,891 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-12 18:06:14,891 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-04-12 18:06:14,892 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2018-04-12 18:06:14,892 INFO L442 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-04-12 18:06:14,892 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-04-12 18:06:14,892 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2018-04-12 18:06:14,892 INFO L87 Difference]: Start difference. First operand 234 states and 271 transitions. Second operand 9 states. [2018-04-12 18:06:15,297 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-12 18:06:15,298 INFO L93 Difference]: Finished difference Result 240 states and 274 transitions. [2018-04-12 18:06:15,298 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-04-12 18:06:15,298 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2018-04-12 18:06:15,298 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-12 18:06:15,299 INFO L225 Difference]: With dead ends: 240 [2018-04-12 18:06:15,299 INFO L226 Difference]: Without dead ends: 240 [2018-04-12 18:06:15,299 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 1 SyntacticMatches, 2 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=58, Invalid=124, Unknown=0, NotChecked=0, Total=182 [2018-04-12 18:06:15,299 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 240 states. [2018-04-12 18:06:15,301 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 240 to 233. [2018-04-12 18:06:15,301 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 233 states. [2018-04-12 18:06:15,302 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 233 states to 233 states and 270 transitions. [2018-04-12 18:06:15,302 INFO L78 Accepts]: Start accepts. Automaton has 233 states and 270 transitions. Word has length 22 [2018-04-12 18:06:15,302 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-12 18:06:15,302 INFO L459 AbstractCegarLoop]: Abstraction has 233 states and 270 transitions. [2018-04-12 18:06:15,302 INFO L460 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-04-12 18:06:15,302 INFO L276 IsEmpty]: Start isEmpty. Operand 233 states and 270 transitions. [2018-04-12 18:06:15,303 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2018-04-12 18:06:15,303 INFO L347 BasicCegarLoop]: Found error trace [2018-04-12 18:06:15,303 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-12 18:06:15,303 INFO L408 AbstractCegarLoop]: === Iteration 8 === [mainErr51RequiresViolation, mainErr69RequiresViolation, mainErr26RequiresViolation, mainErr54RequiresViolation, mainErr66RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr31RequiresViolation, mainErr46RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr58RequiresViolation, mainErr62RequiresViolation, mainErr15RequiresViolation, mainErr49RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr55RequiresViolation, mainErr65RequiresViolation, mainErr17RequiresViolation, mainErr42RequiresViolation, mainErr71AssertViolationMEMORY_FREE, mainErr30RequiresViolation, mainErr11RequiresViolation, mainErr57RequiresViolation, mainErr63RequiresViolation, mainErr24RequiresViolation, mainErr44RequiresViolation, mainErr10RequiresViolation, mainErr43RequiresViolation, mainErr4RequiresViolation, mainErr50RequiresViolation, mainErr72EnsuresViolationMEMORY_LEAK, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr61RequiresViolation, mainErr59RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr70AssertViolationMEMORY_FREE, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr56RequiresViolation, mainErr64RequiresViolation, mainErr48RequiresViolation, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr52RequiresViolation, mainErr68RequiresViolation, mainErr45RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr60RequiresViolation, mainErr9RequiresViolation, mainErr67RequiresViolation, mainErr53RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr34RequiresViolation, mainErr47RequiresViolation, mainErr14RequiresViolation, mainErr40RequiresViolation]=== [2018-04-12 18:06:15,303 INFO L82 PathProgramCache]: Analyzing trace with hash -287335222, now seen corresponding path program 1 times [2018-04-12 18:06:15,303 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-04-12 18:06:15,303 INFO L68 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-04-12 18:06:15,304 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-12 18:06:15,304 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-12 18:06:15,304 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-12 18:06:15,315 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-12 18:06:15,316 WARN L250 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-12 18:06:15,403 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-12 18:06:15,403 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-04-12 18:06:15,403 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2018-04-12 18:06:15,404 INFO L442 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-04-12 18:06:15,404 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-04-12 18:06:15,404 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=71, Unknown=0, NotChecked=0, Total=90 [2018-04-12 18:06:15,404 INFO L87 Difference]: Start difference. First operand 233 states and 270 transitions. Second operand 10 states. [2018-04-12 18:06:15,869 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-12 18:06:15,869 INFO L93 Difference]: Finished difference Result 236 states and 270 transitions. [2018-04-12 18:06:15,870 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2018-04-12 18:06:15,870 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 22 [2018-04-12 18:06:15,870 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-12 18:06:15,871 INFO L225 Difference]: With dead ends: 236 [2018-04-12 18:06:15,871 INFO L226 Difference]: Without dead ends: 236 [2018-04-12 18:06:15,871 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 20 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=129, Invalid=291, Unknown=0, NotChecked=0, Total=420 [2018-04-12 18:06:15,872 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 236 states. [2018-04-12 18:06:15,874 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 236 to 218. [2018-04-12 18:06:15,874 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 218 states. [2018-04-12 18:06:15,874 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 218 states to 218 states and 254 transitions. [2018-04-12 18:06:15,875 INFO L78 Accepts]: Start accepts. Automaton has 218 states and 254 transitions. Word has length 22 [2018-04-12 18:06:15,875 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-12 18:06:15,875 INFO L459 AbstractCegarLoop]: Abstraction has 218 states and 254 transitions. [2018-04-12 18:06:15,875 INFO L460 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-04-12 18:06:15,875 INFO L276 IsEmpty]: Start isEmpty. Operand 218 states and 254 transitions. [2018-04-12 18:06:15,875 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2018-04-12 18:06:15,875 INFO L347 BasicCegarLoop]: Found error trace [2018-04-12 18:06:15,876 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] [2018-04-12 18:06:15,876 INFO L408 AbstractCegarLoop]: === Iteration 9 === [mainErr51RequiresViolation, mainErr69RequiresViolation, mainErr26RequiresViolation, mainErr54RequiresViolation, mainErr66RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr31RequiresViolation, mainErr46RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr58RequiresViolation, mainErr62RequiresViolation, mainErr15RequiresViolation, mainErr49RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr55RequiresViolation, mainErr65RequiresViolation, mainErr17RequiresViolation, mainErr42RequiresViolation, mainErr71AssertViolationMEMORY_FREE, mainErr30RequiresViolation, mainErr11RequiresViolation, mainErr57RequiresViolation, mainErr63RequiresViolation, mainErr24RequiresViolation, mainErr44RequiresViolation, mainErr10RequiresViolation, mainErr43RequiresViolation, mainErr4RequiresViolation, mainErr50RequiresViolation, mainErr72EnsuresViolationMEMORY_LEAK, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr61RequiresViolation, mainErr59RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr70AssertViolationMEMORY_FREE, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr56RequiresViolation, mainErr64RequiresViolation, mainErr48RequiresViolation, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr52RequiresViolation, mainErr68RequiresViolation, mainErr45RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr60RequiresViolation, mainErr9RequiresViolation, mainErr67RequiresViolation, mainErr53RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr34RequiresViolation, mainErr47RequiresViolation, mainErr14RequiresViolation, mainErr40RequiresViolation]=== [2018-04-12 18:06:15,876 INFO L82 PathProgramCache]: Analyzing trace with hash 1793562549, now seen corresponding path program 1 times [2018-04-12 18:06:15,876 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-04-12 18:06:15,876 INFO L68 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-04-12 18:06:15,877 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-12 18:06:15,877 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-12 18:06:15,877 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-12 18:06:15,883 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-12 18:06:15,884 WARN L250 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-12 18:06:15,894 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-12 18:06:15,894 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-04-12 18:06:15,894 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-04-12 18:06:15,894 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-04-12 18:06:15,894 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-04-12 18:06:15,894 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-04-12 18:06:15,894 INFO L87 Difference]: Start difference. First operand 218 states and 254 transitions. Second operand 3 states. [2018-04-12 18:06:15,902 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-12 18:06:15,902 INFO L93 Difference]: Finished difference Result 259 states and 298 transitions. [2018-04-12 18:06:15,902 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-04-12 18:06:15,902 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 25 [2018-04-12 18:06:15,903 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-12 18:06:15,903 INFO L225 Difference]: With dead ends: 259 [2018-04-12 18:06:15,903 INFO L226 Difference]: Without dead ends: 259 [2018-04-12 18:06:15,903 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-04-12 18:06:15,904 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 259 states. [2018-04-12 18:06:15,905 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 259 to 232. [2018-04-12 18:06:15,905 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 232 states. [2018-04-12 18:06:15,906 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 232 states to 232 states and 269 transitions. [2018-04-12 18:06:15,906 INFO L78 Accepts]: Start accepts. Automaton has 232 states and 269 transitions. Word has length 25 [2018-04-12 18:06:15,906 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-12 18:06:15,906 INFO L459 AbstractCegarLoop]: Abstraction has 232 states and 269 transitions. [2018-04-12 18:06:15,906 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-04-12 18:06:15,906 INFO L276 IsEmpty]: Start isEmpty. Operand 232 states and 269 transitions. [2018-04-12 18:06:15,906 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2018-04-12 18:06:15,907 INFO L347 BasicCegarLoop]: Found error trace [2018-04-12 18:06:15,907 INFO L355 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-12 18:06:15,907 INFO L408 AbstractCegarLoop]: === Iteration 10 === [mainErr51RequiresViolation, mainErr69RequiresViolation, mainErr26RequiresViolation, mainErr54RequiresViolation, mainErr66RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr31RequiresViolation, mainErr46RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr58RequiresViolation, mainErr62RequiresViolation, mainErr15RequiresViolation, mainErr49RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr55RequiresViolation, mainErr65RequiresViolation, mainErr17RequiresViolation, mainErr42RequiresViolation, mainErr71AssertViolationMEMORY_FREE, mainErr30RequiresViolation, mainErr11RequiresViolation, mainErr57RequiresViolation, mainErr63RequiresViolation, mainErr24RequiresViolation, mainErr44RequiresViolation, mainErr10RequiresViolation, mainErr43RequiresViolation, mainErr4RequiresViolation, mainErr50RequiresViolation, mainErr72EnsuresViolationMEMORY_LEAK, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr61RequiresViolation, mainErr59RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr70AssertViolationMEMORY_FREE, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr56RequiresViolation, mainErr64RequiresViolation, mainErr48RequiresViolation, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr52RequiresViolation, mainErr68RequiresViolation, mainErr45RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr60RequiresViolation, mainErr9RequiresViolation, mainErr67RequiresViolation, mainErr53RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr34RequiresViolation, mainErr47RequiresViolation, mainErr14RequiresViolation, mainErr40RequiresViolation]=== [2018-04-12 18:06:15,907 INFO L82 PathProgramCache]: Analyzing trace with hash -2135914195, now seen corresponding path program 1 times [2018-04-12 18:06:15,907 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-04-12 18:06:15,907 INFO L68 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-04-12 18:06:15,908 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-12 18:06:15,908 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-12 18:06:15,908 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-12 18:06:15,921 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-12 18:06:15,921 WARN L250 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-12 18:06:16,190 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-12 18:06:16,190 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-04-12 18:06:16,190 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-12 18:06:16,199 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-12 18:06:16,224 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-12 18:06:16,231 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-12 18:06:16,297 INFO L700 Elim1Store]: detected not equals via solver [2018-04-12 18:06:16,297 INFO L700 Elim1Store]: detected not equals via solver [2018-04-12 18:06:16,300 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-12 18:06:16,301 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-12 18:06:16,306 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-12 18:06:16,306 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:23, output treesize:21 [2018-04-12 18:06:16,347 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-12 18:06:16,349 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-12 18:06:16,349 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-12 18:06:16,351 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-12 18:06:16,356 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-12 18:06:16,357 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:32, output treesize:29 [2018-04-12 18:06:16,408 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 39 treesize of output 43 [2018-04-12 18:06:16,414 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 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-12 18:06:16,415 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-12 18:06:16,419 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-12 18:06:16,427 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-12 18:06:16,427 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:50, output treesize:42 [2018-04-12 18:06:16,530 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-12 18:06:16,546 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-12 18:06:16,547 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 2 xjuncts. [2018-04-12 18:06:16,565 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-04-12 18:06:16,578 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-12 18:06:16,578 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:55, output treesize:84 [2018-04-12 18:06:30,637 WARN L148 SmtUtils]: Spent 14034ms on a formula simplification that was a NOOP. DAG size: 33 [2018-04-12 18:06:44,696 WARN L148 SmtUtils]: Spent 14019ms on a formula simplification that was a NOOP. DAG size: 33 [2018-04-12 18:06:44,730 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 43 treesize of output 31 [2018-04-12 18:06:44,740 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 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-12 18:06:44,740 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-12 18:06:44,745 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 1 [2018-04-12 18:06:44,745 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-04-12 18:06:44,748 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-12 18:06:44,761 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 54 treesize of output 36 [2018-04-12 18:06:44,763 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-12 18:06:44,764 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2018-04-12 18:06:44,776 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 1 case distinctions, treesize of input 13 treesize of output 10 [2018-04-12 18:06:44,776 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 2 xjuncts. [2018-04-12 18:06:44,782 INFO L267 ElimStorePlain]: Start of recursive call 5: 2 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-04-12 18:06:44,796 INFO L267 ElimStorePlain]: Start of recursive call 1: 7 dim-0 vars, 2 dim-2 vars, End of recursive call: 2 dim-0 vars, and 3 xjuncts. [2018-04-12 18:06:44,796 INFO L202 ElimStorePlain]: Needed 7 recursive calls to eliminate 9 variables, input treesize:98, output treesize:46 [2018-04-12 18:06:44,835 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-12 18:06:44,861 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-04-12 18:06:44,861 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [21, 12] total 32 [2018-04-12 18:06:44,861 INFO L442 AbstractCegarLoop]: Interpolant automaton has 33 states [2018-04-12 18:06:44,861 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 33 interpolants. [2018-04-12 18:06:44,862 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=117, Invalid=939, Unknown=0, NotChecked=0, Total=1056 [2018-04-12 18:06:44,862 INFO L87 Difference]: Start difference. First operand 232 states and 269 transitions. Second operand 33 states. [2018-04-12 18:07:21,654 WARN L151 SmtUtils]: Spent 36137ms on a formula simplification. DAG size of input: 78 DAG size of output 63 [2018-04-12 18:07:43,795 WARN L151 SmtUtils]: Spent 22056ms on a formula simplification. DAG size of input: 85 DAG size of output 43 [2018-04-12 18:08:08,043 WARN L151 SmtUtils]: Spent 22080ms on a formula simplification. DAG size of input: 95 DAG size of output 45 [2018-04-12 18:08:30,167 WARN L151 SmtUtils]: Spent 22070ms on a formula simplification. DAG size of input: 102 DAG size of output 47 [2018-04-12 18:08:52,320 WARN L151 SmtUtils]: Spent 22075ms on a formula simplification. DAG size of input: 109 DAG size of output 50 [2018-04-12 18:09:16,529 WARN L151 SmtUtils]: Spent 24071ms on a formula simplification. DAG size of input: 61 DAG size of output 52 [2018-04-12 18:09:40,690 WARN L151 SmtUtils]: Spent 24073ms on a formula simplification. DAG size of input: 68 DAG size of output 59 [2018-04-12 18:10:04,804 WARN L151 SmtUtils]: Spent 24064ms on a formula simplification. DAG size of input: 73 DAG size of output 56 [2018-04-12 18:10:28,928 WARN L151 SmtUtils]: Spent 24064ms on a formula simplification. DAG size of input: 68 DAG size of output 55 [2018-04-12 18:10:53,057 WARN L151 SmtUtils]: Spent 24042ms on a formula simplification. DAG size of input: 48 DAG size of output 39 [2018-04-12 18:11:17,254 WARN L151 SmtUtils]: Spent 24049ms on a formula simplification. DAG size of input: 56 DAG size of output 47 [2018-04-12 18:11:41,404 WARN L151 SmtUtils]: Spent 24046ms on a formula simplification. DAG size of input: 61 DAG size of output 44 [2018-04-12 18:12:05,532 WARN L151 SmtUtils]: Spent 24050ms on a formula simplification. DAG size of input: 58 DAG size of output 42 [2018-04-12 18:12:06,316 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-12 18:12:06,316 INFO L93 Difference]: Finished difference Result 471 states and 520 transitions. [2018-04-12 18:12:06,316 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 47 states. [2018-04-12 18:12:06,316 INFO L78 Accepts]: Start accepts. Automaton has 33 states. Word has length 40 [2018-04-12 18:12:06,316 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-12 18:12:06,318 INFO L225 Difference]: With dead ends: 471 [2018-04-12 18:12:06,318 INFO L226 Difference]: Without dead ends: 471 [2018-04-12 18:12:06,320 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 105 GetRequests, 31 SyntacticMatches, 0 SemanticMatches, 74 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1525 ImplicationChecksByTransitivity, 346.8s TimeCoverageRelationStatistics Valid=1012, Invalid=4688, Unknown=0, NotChecked=0, Total=5700 [2018-04-12 18:12:06,321 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 471 states. [2018-04-12 18:12:06,325 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 471 to 261. [2018-04-12 18:12:06,325 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 261 states. [2018-04-12 18:12:06,326 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 261 states to 261 states and 301 transitions. [2018-04-12 18:12:06,327 INFO L78 Accepts]: Start accepts. Automaton has 261 states and 301 transitions. Word has length 40 [2018-04-12 18:12:06,327 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-12 18:12:06,327 INFO L459 AbstractCegarLoop]: Abstraction has 261 states and 301 transitions. [2018-04-12 18:12:06,327 INFO L460 AbstractCegarLoop]: Interpolant automaton has 33 states. [2018-04-12 18:12:06,327 INFO L276 IsEmpty]: Start isEmpty. Operand 261 states and 301 transitions. [2018-04-12 18:12:06,328 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2018-04-12 18:12:06,328 INFO L347 BasicCegarLoop]: Found error trace [2018-04-12 18:12:06,328 INFO L355 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-12 18:12:06,328 INFO L408 AbstractCegarLoop]: === Iteration 11 === [mainErr51RequiresViolation, mainErr69RequiresViolation, mainErr26RequiresViolation, mainErr54RequiresViolation, mainErr66RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr31RequiresViolation, mainErr46RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr58RequiresViolation, mainErr62RequiresViolation, mainErr15RequiresViolation, mainErr49RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr55RequiresViolation, mainErr65RequiresViolation, mainErr17RequiresViolation, mainErr42RequiresViolation, mainErr71AssertViolationMEMORY_FREE, mainErr30RequiresViolation, mainErr11RequiresViolation, mainErr57RequiresViolation, mainErr63RequiresViolation, mainErr24RequiresViolation, mainErr44RequiresViolation, mainErr10RequiresViolation, mainErr43RequiresViolation, mainErr4RequiresViolation, mainErr50RequiresViolation, mainErr72EnsuresViolationMEMORY_LEAK, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr61RequiresViolation, mainErr59RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr70AssertViolationMEMORY_FREE, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr56RequiresViolation, mainErr64RequiresViolation, mainErr48RequiresViolation, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr52RequiresViolation, mainErr68RequiresViolation, mainErr45RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr60RequiresViolation, mainErr9RequiresViolation, mainErr67RequiresViolation, mainErr53RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr34RequiresViolation, mainErr47RequiresViolation, mainErr14RequiresViolation, mainErr40RequiresViolation]=== [2018-04-12 18:12:06,328 INFO L82 PathProgramCache]: Analyzing trace with hash -2135914194, now seen corresponding path program 1 times [2018-04-12 18:12:06,328 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-04-12 18:12:06,329 INFO L68 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-04-12 18:12:06,330 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-12 18:12:06,330 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-12 18:12:06,330 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-12 18:12:06,344 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-12 18:12:06,345 WARN L250 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-12 18:12:06,599 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-12 18:12:06,599 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-04-12 18:12:06,599 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-12 18:12:06,608 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-12 18:12:06,630 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-12 18:12:06,634 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-12 18:12:06,671 INFO L700 Elim1Store]: detected not equals via solver [2018-04-12 18:12:06,683 INFO L700 Elim1Store]: detected not equals via solver [2018-04-12 18:12:06,684 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 4 [2018-04-12 18:12:06,684 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-12 18:12:06,692 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-12 18:12:06,692 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-12 18:12:06,698 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-12 18:12:06,698 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:26, output treesize:19 [2018-04-12 18:12:06,719 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 8 [2018-04-12 18:12:06,732 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-04-12 18:12:06,732 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-12 18:12:06,734 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-12 18:12:06,743 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-12 18:12:06,744 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select 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-12 18:12:06,745 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-04-12 18:12:06,746 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-12 18:12:06,752 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-12 18:12:06,752 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 3 variables, input treesize:38, output treesize:31 [2018-04-12 18:12:06,801 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 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-12 18:12:06,803 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 13 [2018-04-12 18:12:06,803 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-12 18:12:06,809 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-12 18:12:06,822 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 30 [2018-04-12 18:12:06,824 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 13 [2018-04-12 18:12:06,824 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-04-12 18:12:06,828 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-12 18:12:06,835 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-12 18:12:06,835 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 3 variables, input treesize:73, output treesize:57 [2018-04-12 18:12:06,970 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 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-12 18:12:06,977 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-12 18:12:06,977 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 2 xjuncts. [2018-04-12 18:12:06,993 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-04-12 18:12:07,043 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-12 18:12:07,046 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-12 18:12:07,046 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-04-12 18:12:07,053 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-12 18:12:07,072 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-12 18:12:07,083 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-12 18:12:07,083 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 2 xjuncts. [2018-04-12 18:12:07,095 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-04-12 18:12:07,113 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-12 18:12:07,114 INFO L202 ElimStorePlain]: Needed 7 recursive calls to eliminate 4 variables, input treesize:89, output treesize:125 [2018-04-12 18:12:21,177 WARN L148 SmtUtils]: Spent 14021ms on a formula simplification that was a NOOP. DAG size: 45 [2018-04-12 18:12:35,248 WARN L148 SmtUtils]: Spent 14021ms on a formula simplification that was a NOOP. DAG size: 45 [2018-04-12 18:12:35,260 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 65 treesize of output 55 [2018-04-12 18:12:35,262 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 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-12 18:12:35,262 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-12 18:12:35,280 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 1 [2018-04-12 18:12:35,281 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-04-12 18:12:35,287 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-12 18:12:35,307 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 87 treesize of output 65 [2018-04-12 18:12:35,309 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 39 treesize of output 26 [2018-04-12 18:12:35,309 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2018-04-12 18:12:35,323 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 1 case distinctions, treesize of input 13 treesize of output 10 [2018-04-12 18:12:35,323 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 2 xjuncts. [2018-04-12 18:12:35,348 INFO L267 ElimStorePlain]: Start of recursive call 5: 2 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-04-12 18:12:35,372 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 46 treesize of output 38 [2018-04-12 18:12:35,373 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 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-12 18:12:35,374 INFO L267 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 1 xjuncts. [2018-04-12 18:12:35,380 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 6 [2018-04-12 18:12:35,380 INFO L267 ElimStorePlain]: Start of recursive call 10: End of recursive call: and 1 xjuncts. [2018-04-12 18:12:35,384 INFO L267 ElimStorePlain]: Start of recursive call 8: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-12 18:12:35,386 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 43 treesize of output 35 [2018-04-12 18:12:35,390 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 1 case distinctions, treesize of input 13 treesize of output 10 [2018-04-12 18:12:35,391 INFO L267 ElimStorePlain]: Start of recursive call 12: End of recursive call: and 2 xjuncts. [2018-04-12 18:12:35,398 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select 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-12 18:12:35,398 INFO L267 ElimStorePlain]: Start of recursive call 13: End of recursive call: and 1 xjuncts. [2018-04-12 18:12:35,406 INFO L267 ElimStorePlain]: Start of recursive call 11: 2 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-04-12 18:12:35,423 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 29 [2018-04-12 18:12:35,425 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 10 [2018-04-12 18:12:35,425 INFO L267 ElimStorePlain]: Start of recursive call 15: End of recursive call: and 1 xjuncts. [2018-04-12 18:12:35,429 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 1 [2018-04-12 18:12:35,429 INFO L267 ElimStorePlain]: Start of recursive call 16: End of recursive call: and 1 xjuncts. [2018-04-12 18:12:35,431 INFO L267 ElimStorePlain]: Start of recursive call 14: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-12 18:12:35,442 INFO L267 ElimStorePlain]: Start of recursive call 1: 7 dim-0 vars, 4 dim-2 vars, End of recursive call: and 2 xjuncts. [2018-04-12 18:12:35,443 INFO L202 ElimStorePlain]: Needed 16 recursive calls to eliminate 11 variables, input treesize:153, output treesize:23 [2018-04-12 18:12:35,484 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-12 18:12:35,501 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-04-12 18:12:35,501 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [19, 12] total 30 [2018-04-12 18:12:35,501 INFO L442 AbstractCegarLoop]: Interpolant automaton has 31 states [2018-04-12 18:12:35,501 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 31 interpolants. [2018-04-12 18:12:35,502 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=112, Invalid=818, Unknown=0, NotChecked=0, Total=930 [2018-04-12 18:12:35,502 INFO L87 Difference]: Start difference. First operand 261 states and 301 transitions. Second operand 31 states. [2018-04-12 18:13:00,166 WARN L151 SmtUtils]: Spent 24110ms on a formula simplification. DAG size of input: 77 DAG size of output 75 [2018-04-12 18:13:28,302 WARN L151 SmtUtils]: Spent 28066ms on a formula simplification. DAG size of input: 95 DAG size of output 57 [2018-04-12 18:13:56,486 WARN L151 SmtUtils]: Spent 28091ms on a formula simplification. DAG size of input: 103 DAG size of output 63 [2018-04-12 18:14:24,647 WARN L151 SmtUtils]: Spent 28095ms on a formula simplification. DAG size of input: 108 DAG size of output 68 [2018-04-12 18:14:52,812 WARN L151 SmtUtils]: Spent 28077ms on a formula simplification. DAG size of input: 62 DAG size of output 61 [2018-04-12 18:15:20,997 WARN L151 SmtUtils]: Spent 28105ms on a formula simplification. DAG size of input: 73 DAG size of output 72 [2018-04-12 18:15:49,132 WARN L151 SmtUtils]: Spent 28078ms on a formula simplification. DAG size of input: 69 DAG size of output 68 [2018-04-12 18:16:03,448 WARN L148 SmtUtils]: Spent 14048ms on a formula simplification that was a NOOP. DAG size: 53 [2018-04-12 18:16:17,649 WARN L148 SmtUtils]: Spent 14029ms on a formula simplification that was a NOOP. DAG size: 65 [2018-04-12 18:16:31,763 WARN L148 SmtUtils]: Spent 14026ms on a formula simplification that was a NOOP. DAG size: 61 [2018-04-12 18:16:32,474 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-12 18:16:32,475 INFO L93 Difference]: Finished difference Result 464 states and 513 transitions. [2018-04-12 18:16:32,475 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 40 states. [2018-04-12 18:16:32,475 INFO L78 Accepts]: Start accepts. Automaton has 31 states. Word has length 40 [2018-04-12 18:16:32,475 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-12 18:16:32,476 INFO L225 Difference]: With dead ends: 464 [2018-04-12 18:16:32,476 INFO L226 Difference]: Without dead ends: 464 [2018-04-12 18:16:32,477 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 97 GetRequests, 31 SyntacticMatches, 0 SemanticMatches, 66 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1211 ImplicationChecksByTransitivity, 264.3s TimeCoverageRelationStatistics Valid=857, Invalid=3699, Unknown=0, NotChecked=0, Total=4556 [2018-04-12 18:16:32,477 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 464 states. [2018-04-12 18:16:32,479 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 464 to 261. [2018-04-12 18:16:32,479 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 261 states. [2018-04-12 18:16:32,480 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 261 states to 261 states and 300 transitions. [2018-04-12 18:16:32,480 INFO L78 Accepts]: Start accepts. Automaton has 261 states and 300 transitions. Word has length 40 [2018-04-12 18:16:32,480 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-12 18:16:32,480 INFO L459 AbstractCegarLoop]: Abstraction has 261 states and 300 transitions. [2018-04-12 18:16:32,480 INFO L460 AbstractCegarLoop]: Interpolant automaton has 31 states. [2018-04-12 18:16:32,480 INFO L276 IsEmpty]: Start isEmpty. Operand 261 states and 300 transitions. [2018-04-12 18:16:32,481 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2018-04-12 18:16:32,481 INFO L347 BasicCegarLoop]: Found error trace [2018-04-12 18:16:32,481 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] [2018-04-12 18:16:32,481 INFO L408 AbstractCegarLoop]: === Iteration 12 === [mainErr51RequiresViolation, mainErr69RequiresViolation, mainErr26RequiresViolation, mainErr54RequiresViolation, mainErr66RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr31RequiresViolation, mainErr46RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr58RequiresViolation, mainErr62RequiresViolation, mainErr15RequiresViolation, mainErr49RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr55RequiresViolation, mainErr65RequiresViolation, mainErr17RequiresViolation, mainErr42RequiresViolation, mainErr71AssertViolationMEMORY_FREE, mainErr30RequiresViolation, mainErr11RequiresViolation, mainErr57RequiresViolation, mainErr63RequiresViolation, mainErr24RequiresViolation, mainErr44RequiresViolation, mainErr10RequiresViolation, mainErr43RequiresViolation, mainErr4RequiresViolation, mainErr50RequiresViolation, mainErr72EnsuresViolationMEMORY_LEAK, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr61RequiresViolation, mainErr59RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr70AssertViolationMEMORY_FREE, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr56RequiresViolation, mainErr64RequiresViolation, mainErr48RequiresViolation, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr52RequiresViolation, mainErr68RequiresViolation, mainErr45RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr60RequiresViolation, mainErr9RequiresViolation, mainErr67RequiresViolation, mainErr53RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr34RequiresViolation, mainErr47RequiresViolation, mainErr14RequiresViolation, mainErr40RequiresViolation]=== [2018-04-12 18:16:32,481 INFO L82 PathProgramCache]: Analyzing trace with hash -808260317, now seen corresponding path program 1 times [2018-04-12 18:16:32,481 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-04-12 18:16:32,481 INFO L68 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-04-12 18:16:32,482 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-12 18:16:32,482 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-12 18:16:32,482 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-12 18:16:32,487 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-12 18:16:32,487 WARN L250 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-12 18:16:32,499 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-12 18:16:32,500 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-04-12 18:16:32,500 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-04-12 18:16:32,500 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-04-12 18:16:32,500 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-04-12 18:16:32,500 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-04-12 18:16:32,500 INFO L87 Difference]: Start difference. First operand 261 states and 300 transitions. Second operand 3 states. [2018-04-12 18:16:32,505 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-12 18:16:32,505 INFO L93 Difference]: Finished difference Result 263 states and 302 transitions. [2018-04-12 18:16:32,505 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-04-12 18:16:32,505 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 43 [2018-04-12 18:16:32,506 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-12 18:16:32,506 INFO L225 Difference]: With dead ends: 263 [2018-04-12 18:16:32,506 INFO L226 Difference]: Without dead ends: 263 [2018-04-12 18:16:32,507 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-04-12 18:16:32,507 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 263 states. [2018-04-12 18:16:32,509 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 263 to 263. [2018-04-12 18:16:32,509 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 263 states. [2018-04-12 18:16:32,509 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 263 states to 263 states and 302 transitions. [2018-04-12 18:16:32,510 INFO L78 Accepts]: Start accepts. Automaton has 263 states and 302 transitions. Word has length 43 [2018-04-12 18:16:32,510 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-12 18:16:32,510 INFO L459 AbstractCegarLoop]: Abstraction has 263 states and 302 transitions. [2018-04-12 18:16:32,510 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-04-12 18:16:32,510 INFO L276 IsEmpty]: Start isEmpty. Operand 263 states and 302 transitions. [2018-04-12 18:16:32,511 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2018-04-12 18:16:32,511 INFO L347 BasicCegarLoop]: Found error trace [2018-04-12 18:16:32,511 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] [2018-04-12 18:16:32,511 INFO L408 AbstractCegarLoop]: === Iteration 13 === [mainErr51RequiresViolation, mainErr69RequiresViolation, mainErr26RequiresViolation, mainErr54RequiresViolation, mainErr66RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr31RequiresViolation, mainErr46RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr58RequiresViolation, mainErr62RequiresViolation, mainErr15RequiresViolation, mainErr49RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr55RequiresViolation, mainErr65RequiresViolation, mainErr17RequiresViolation, mainErr42RequiresViolation, mainErr71AssertViolationMEMORY_FREE, mainErr30RequiresViolation, mainErr11RequiresViolation, mainErr57RequiresViolation, mainErr63RequiresViolation, mainErr24RequiresViolation, mainErr44RequiresViolation, mainErr10RequiresViolation, mainErr43RequiresViolation, mainErr4RequiresViolation, mainErr50RequiresViolation, mainErr72EnsuresViolationMEMORY_LEAK, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr61RequiresViolation, mainErr59RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr70AssertViolationMEMORY_FREE, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr56RequiresViolation, mainErr64RequiresViolation, mainErr48RequiresViolation, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr52RequiresViolation, mainErr68RequiresViolation, mainErr45RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr60RequiresViolation, mainErr9RequiresViolation, mainErr67RequiresViolation, mainErr53RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr34RequiresViolation, mainErr47RequiresViolation, mainErr14RequiresViolation, mainErr40RequiresViolation]=== [2018-04-12 18:16:32,511 INFO L82 PathProgramCache]: Analyzing trace with hash 1074525530, now seen corresponding path program 1 times [2018-04-12 18:16:32,511 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-04-12 18:16:32,511 INFO L68 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-04-12 18:16:32,512 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-12 18:16:32,512 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-12 18:16:32,512 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-12 18:16:32,520 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-12 18:16:32,520 WARN L250 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-12 18:16:32,556 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-12 18:16:32,556 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-04-12 18:16:32,557 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-04-12 18:16:32,557 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-04-12 18:16:32,557 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-04-12 18:16:32,557 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-04-12 18:16:32,557 INFO L87 Difference]: Start difference. First operand 263 states and 302 transitions. Second operand 6 states. [2018-04-12 18:16:32,792 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-12 18:16:32,792 INFO L93 Difference]: Finished difference Result 297 states and 343 transitions. [2018-04-12 18:16:32,792 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-04-12 18:16:32,792 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 46 [2018-04-12 18:16:32,792 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-12 18:16:32,793 INFO L225 Difference]: With dead ends: 297 [2018-04-12 18:16:32,793 INFO L226 Difference]: Without dead ends: 297 [2018-04-12 18:16:32,794 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=30, Invalid=60, Unknown=0, NotChecked=0, Total=90 [2018-04-12 18:16:32,794 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 297 states. [2018-04-12 18:16:32,797 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 297 to 262. [2018-04-12 18:16:32,797 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 262 states. [2018-04-12 18:16:32,798 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 262 states to 262 states and 301 transitions. [2018-04-12 18:16:32,798 INFO L78 Accepts]: Start accepts. Automaton has 262 states and 301 transitions. Word has length 46 [2018-04-12 18:16:32,799 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-12 18:16:32,799 INFO L459 AbstractCegarLoop]: Abstraction has 262 states and 301 transitions. [2018-04-12 18:16:32,799 INFO L460 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-04-12 18:16:32,799 INFO L276 IsEmpty]: Start isEmpty. Operand 262 states and 301 transitions. [2018-04-12 18:16:32,799 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2018-04-12 18:16:32,799 INFO L347 BasicCegarLoop]: Found error trace [2018-04-12 18:16:32,800 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] [2018-04-12 18:16:32,800 INFO L408 AbstractCegarLoop]: === Iteration 14 === [mainErr51RequiresViolation, mainErr69RequiresViolation, mainErr26RequiresViolation, mainErr54RequiresViolation, mainErr66RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr31RequiresViolation, mainErr46RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr58RequiresViolation, mainErr62RequiresViolation, mainErr15RequiresViolation, mainErr49RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr55RequiresViolation, mainErr65RequiresViolation, mainErr17RequiresViolation, mainErr42RequiresViolation, mainErr71AssertViolationMEMORY_FREE, mainErr30RequiresViolation, mainErr11RequiresViolation, mainErr57RequiresViolation, mainErr63RequiresViolation, mainErr24RequiresViolation, mainErr44RequiresViolation, mainErr10RequiresViolation, mainErr43RequiresViolation, mainErr4RequiresViolation, mainErr50RequiresViolation, mainErr72EnsuresViolationMEMORY_LEAK, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr61RequiresViolation, mainErr59RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr70AssertViolationMEMORY_FREE, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr56RequiresViolation, mainErr64RequiresViolation, mainErr48RequiresViolation, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr52RequiresViolation, mainErr68RequiresViolation, mainErr45RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr60RequiresViolation, mainErr9RequiresViolation, mainErr67RequiresViolation, mainErr53RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr34RequiresViolation, mainErr47RequiresViolation, mainErr14RequiresViolation, mainErr40RequiresViolation]=== [2018-04-12 18:16:32,800 INFO L82 PathProgramCache]: Analyzing trace with hash 1074525531, now seen corresponding path program 1 times [2018-04-12 18:16:32,800 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-04-12 18:16:32,800 INFO L68 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-04-12 18:16:32,801 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-12 18:16:32,801 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-12 18:16:32,801 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-12 18:16:32,814 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-12 18:16:32,815 WARN L250 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-12 18:16:33,151 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-12 18:16:33,151 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-04-12 18:16:33,151 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-12 18:16:33,157 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-12 18:16:33,180 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-12 18:16:33,182 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-12 18:16:33,212 INFO L700 Elim1Store]: detected not equals via solver [2018-04-12 18:16:33,213 INFO L700 Elim1Store]: detected not equals via solver [2018-04-12 18:16:33,213 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-12 18:16:33,213 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-12 18:16:33,217 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-12 18:16:33,217 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:20, output treesize:14 [2018-04-12 18:16:33,236 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-12 18:16:33,237 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-12 18:16:33,238 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-12 18:16:33,239 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-12 18:16:33,246 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 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-12 18:16:33,247 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-04-12 18:16:33,247 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-04-12 18:16:33,249 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-12 18:16:33,254 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-12 18:16:33,254 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 3 variables, input treesize:33, output treesize:22 [2018-04-12 18:16:33,294 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 51 treesize of output 55 [2018-04-12 18:16:33,296 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select 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-12 18:16:33,296 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-12 18:16:33,308 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-12 18:16:33,317 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 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-12 18:16:33,318 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 13 [2018-04-12 18:16:33,318 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-04-12 18:16:33,322 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-12 18:16:33,327 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-12 18:16:33,327 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 3 variables, input treesize:64, output treesize:48 [2018-04-12 18:16:33,353 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 42 treesize of output 30 [2018-04-12 18:16:33,354 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 14 [2018-04-12 18:16:33,355 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-12 18:16:33,358 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 1 [2018-04-12 18:16:33,358 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-04-12 18:16:33,360 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-12 18:16:33,363 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-12 18:16:33,363 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 2 variables, input treesize:49, output treesize:21 [2018-04-12 18:16:33,400 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 27 [2018-04-12 18:16:33,408 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-12 18:16:33,408 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 2 xjuncts. [2018-04-12 18:16:33,416 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-04-12 18:16:33,425 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-12 18:16:33,425 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:32, output treesize:50 [2018-04-12 18:16:39,538 WARN L148 SmtUtils]: Spent 6048ms on a formula simplification that was a NOOP. DAG size: 34 [2018-04-12 18:16:45,631 WARN L148 SmtUtils]: Spent 6025ms on a formula simplification that was a NOOP. DAG size: 34 [2018-04-12 18:16:55,701 WARN L148 SmtUtils]: Spent 10029ms on a formula simplification that was a NOOP. DAG size: 41 [2018-04-12 18:17:03,785 WARN L148 SmtUtils]: Spent 8046ms on a formula simplification that was a NOOP. DAG size: 42 [2018-04-12 18:17:03,790 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 78 treesize of output 74 [2018-04-12 18:17:03,792 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 37 treesize of output 17 [2018-04-12 18:17:03,792 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-12 18:17:03,797 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-12 18:17:03,813 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 55 treesize of output 41 [2018-04-12 18:17:03,815 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select 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 11 [2018-04-12 18:17:03,816 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-04-12 18:17:03,823 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select 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-12 18:17:03,823 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2018-04-12 18:17:03,828 INFO L267 ElimStorePlain]: Start of recursive call 4: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-12 18:17:03,846 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 50 treesize of output 46 [2018-04-12 18:17:03,849 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 15 [2018-04-12 18:17:03,849 INFO L267 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 1 xjuncts. [2018-04-12 18:17:03,864 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 1 [2018-04-12 18:17:03,864 INFO L267 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 1 xjuncts. [2018-04-12 18:17:03,869 INFO L267 ElimStorePlain]: Start of recursive call 7: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-12 18:17:03,878 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 22 [2018-04-12 18:17:03,879 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select 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 7 [2018-04-12 18:17:03,879 INFO L267 ElimStorePlain]: Start of recursive call 11: End of recursive call: and 1 xjuncts. [2018-04-12 18:17:03,882 INFO L267 ElimStorePlain]: Start of recursive call 10: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-12 18:17:03,890 INFO L267 ElimStorePlain]: Start of recursive call 1: 8 dim-0 vars, 4 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-04-12 18:17:03,890 INFO L202 ElimStorePlain]: Needed 11 recursive calls to eliminate 12 variables, input treesize:129, output treesize:11 [2018-04-12 18:17:03,934 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-12 18:17:03,954 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-04-12 18:17:03,954 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [22, 15] total 36 [2018-04-12 18:17:03,954 INFO L442 AbstractCegarLoop]: Interpolant automaton has 37 states [2018-04-12 18:17:03,954 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 37 interpolants. [2018-04-12 18:17:03,955 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=120, Invalid=1212, Unknown=0, NotChecked=0, Total=1332 [2018-04-12 18:17:03,955 INFO L87 Difference]: Start difference. First operand 262 states and 301 transitions. Second operand 37 states. [2018-04-12 18:17:08,827 WARN L151 SmtUtils]: Spent 4167ms on a formula simplification. DAG size of input: 86 DAG size of output 34 [2018-04-12 18:17:11,481 WARN L151 SmtUtils]: Spent 2112ms on a formula simplification. DAG size of input: 105 DAG size of output 56 [2018-04-12 18:17:13,468 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-12 18:17:13,468 INFO L93 Difference]: Finished difference Result 451 states and 495 transitions. [2018-04-12 18:17:13,468 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 37 states. [2018-04-12 18:17:13,468 INFO L78 Accepts]: Start accepts. Automaton has 37 states. Word has length 46 [2018-04-12 18:17:13,469 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-12 18:17:13,469 INFO L225 Difference]: With dead ends: 451 [2018-04-12 18:17:13,469 INFO L226 Difference]: Without dead ends: 451 [2018-04-12 18:17:13,470 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 102 GetRequests, 34 SyntacticMatches, 0 SemanticMatches, 68 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1259 ImplicationChecksByTransitivity, 38.6s TimeCoverageRelationStatistics Valid=885, Invalid=3945, Unknown=0, NotChecked=0, Total=4830 [2018-04-12 18:17:13,470 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 451 states. [2018-04-12 18:17:13,473 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 451 to 266. [2018-04-12 18:17:13,473 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 266 states. [2018-04-12 18:17:13,473 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 266 states to 266 states and 306 transitions. [2018-04-12 18:17:13,473 INFO L78 Accepts]: Start accepts. Automaton has 266 states and 306 transitions. Word has length 46 [2018-04-12 18:17:13,474 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-12 18:17:13,474 INFO L459 AbstractCegarLoop]: Abstraction has 266 states and 306 transitions. [2018-04-12 18:17:13,474 INFO L460 AbstractCegarLoop]: Interpolant automaton has 37 states. [2018-04-12 18:17:13,474 INFO L276 IsEmpty]: Start isEmpty. Operand 266 states and 306 transitions. [2018-04-12 18:17:13,474 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2018-04-12 18:17:13,474 INFO L347 BasicCegarLoop]: Found error trace [2018-04-12 18:17:13,474 INFO L355 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-12 18:17:13,474 INFO L408 AbstractCegarLoop]: === Iteration 15 === [mainErr51RequiresViolation, mainErr69RequiresViolation, mainErr26RequiresViolation, mainErr54RequiresViolation, mainErr66RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr31RequiresViolation, mainErr46RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr58RequiresViolation, mainErr62RequiresViolation, mainErr15RequiresViolation, mainErr49RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr55RequiresViolation, mainErr65RequiresViolation, mainErr17RequiresViolation, mainErr42RequiresViolation, mainErr71AssertViolationMEMORY_FREE, mainErr30RequiresViolation, mainErr11RequiresViolation, mainErr57RequiresViolation, mainErr63RequiresViolation, mainErr24RequiresViolation, mainErr44RequiresViolation, mainErr10RequiresViolation, mainErr43RequiresViolation, mainErr4RequiresViolation, mainErr50RequiresViolation, mainErr72EnsuresViolationMEMORY_LEAK, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr61RequiresViolation, mainErr59RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr70AssertViolationMEMORY_FREE, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr56RequiresViolation, mainErr64RequiresViolation, mainErr48RequiresViolation, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr52RequiresViolation, mainErr68RequiresViolation, mainErr45RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr60RequiresViolation, mainErr9RequiresViolation, mainErr67RequiresViolation, mainErr53RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr34RequiresViolation, mainErr47RequiresViolation, mainErr14RequiresViolation, mainErr40RequiresViolation]=== [2018-04-12 18:17:13,474 INFO L82 PathProgramCache]: Analyzing trace with hash 222607969, now seen corresponding path program 1 times [2018-04-12 18:17:13,474 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-04-12 18:17:13,475 INFO L68 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-04-12 18:17:13,475 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-12 18:17:13,475 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-12 18:17:13,475 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-12 18:17:13,480 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-12 18:17:13,481 WARN L250 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-12 18:17:13,531 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2018-04-12 18:17:13,531 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-04-12 18:17:13,531 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-04-12 18:17:13,532 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-04-12 18:17:13,532 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-04-12 18:17:13,532 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2018-04-12 18:17:13,532 INFO L87 Difference]: Start difference. First operand 266 states and 306 transitions. Second operand 7 states. [2018-04-12 18:17:13,718 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-12 18:17:13,718 INFO L93 Difference]: Finished difference Result 295 states and 341 transitions. [2018-04-12 18:17:13,718 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-04-12 18:17:13,718 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 47 [2018-04-12 18:17:13,719 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-12 18:17:13,719 INFO L225 Difference]: With dead ends: 295 [2018-04-12 18:17:13,720 INFO L226 Difference]: Without dead ends: 295 [2018-04-12 18:17:13,720 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=34, Invalid=76, Unknown=0, NotChecked=0, Total=110 [2018-04-12 18:17:13,720 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 295 states. [2018-04-12 18:17:13,723 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 295 to 276. [2018-04-12 18:17:13,723 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 276 states. [2018-04-12 18:17:13,724 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 276 states to 276 states and 317 transitions. [2018-04-12 18:17:13,724 INFO L78 Accepts]: Start accepts. Automaton has 276 states and 317 transitions. Word has length 47 [2018-04-12 18:17:13,724 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-12 18:17:13,725 INFO L459 AbstractCegarLoop]: Abstraction has 276 states and 317 transitions. [2018-04-12 18:17:13,725 INFO L460 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-04-12 18:17:13,725 INFO L276 IsEmpty]: Start isEmpty. Operand 276 states and 317 transitions. [2018-04-12 18:17:13,725 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2018-04-12 18:17:13,725 INFO L347 BasicCegarLoop]: Found error trace [2018-04-12 18:17:13,725 INFO L355 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-12 18:17:13,726 INFO L408 AbstractCegarLoop]: === Iteration 16 === [mainErr51RequiresViolation, mainErr69RequiresViolation, mainErr26RequiresViolation, mainErr54RequiresViolation, mainErr66RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr31RequiresViolation, mainErr46RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr58RequiresViolation, mainErr62RequiresViolation, mainErr15RequiresViolation, mainErr49RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr55RequiresViolation, mainErr65RequiresViolation, mainErr17RequiresViolation, mainErr42RequiresViolation, mainErr71AssertViolationMEMORY_FREE, mainErr30RequiresViolation, mainErr11RequiresViolation, mainErr57RequiresViolation, mainErr63RequiresViolation, mainErr24RequiresViolation, mainErr44RequiresViolation, mainErr10RequiresViolation, mainErr43RequiresViolation, mainErr4RequiresViolation, mainErr50RequiresViolation, mainErr72EnsuresViolationMEMORY_LEAK, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr61RequiresViolation, mainErr59RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr70AssertViolationMEMORY_FREE, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr56RequiresViolation, mainErr64RequiresViolation, mainErr48RequiresViolation, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr52RequiresViolation, mainErr68RequiresViolation, mainErr45RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr60RequiresViolation, mainErr9RequiresViolation, mainErr67RequiresViolation, mainErr53RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr34RequiresViolation, mainErr47RequiresViolation, mainErr14RequiresViolation, mainErr40RequiresViolation]=== [2018-04-12 18:17:13,726 INFO L82 PathProgramCache]: Analyzing trace with hash 224455011, now seen corresponding path program 1 times [2018-04-12 18:17:13,726 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-04-12 18:17:13,726 INFO L68 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-04-12 18:17:13,727 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-12 18:17:13,727 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-12 18:17:13,727 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-12 18:17:13,735 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-12 18:17:13,736 WARN L250 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-12 18:17:13,752 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2018-04-12 18:17:13,752 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-04-12 18:17:13,752 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-04-12 18:17:13,753 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-04-12 18:17:13,753 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-04-12 18:17:13,753 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-04-12 18:17:13,753 INFO L87 Difference]: Start difference. First operand 276 states and 317 transitions. Second operand 4 states. [2018-04-12 18:17:13,821 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-12 18:17:13,822 INFO L93 Difference]: Finished difference Result 273 states and 310 transitions. [2018-04-12 18:17:13,822 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-04-12 18:17:13,822 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 47 [2018-04-12 18:17:13,822 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-12 18:17:13,823 INFO L225 Difference]: With dead ends: 273 [2018-04-12 18:17:13,823 INFO L226 Difference]: Without dead ends: 273 [2018-04-12 18:17:13,823 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-12 18:17:13,824 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 273 states. [2018-04-12 18:17:13,826 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 273 to 272. [2018-04-12 18:17:13,826 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 272 states. [2018-04-12 18:17:13,827 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 272 states to 272 states and 309 transitions. [2018-04-12 18:17:13,827 INFO L78 Accepts]: Start accepts. Automaton has 272 states and 309 transitions. Word has length 47 [2018-04-12 18:17:13,827 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-12 18:17:13,827 INFO L459 AbstractCegarLoop]: Abstraction has 272 states and 309 transitions. [2018-04-12 18:17:13,827 INFO L460 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-04-12 18:17:13,827 INFO L276 IsEmpty]: Start isEmpty. Operand 272 states and 309 transitions. [2018-04-12 18:17:13,828 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2018-04-12 18:17:13,828 INFO L347 BasicCegarLoop]: Found error trace [2018-04-12 18:17:13,828 INFO L355 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-12 18:17:13,828 INFO L408 AbstractCegarLoop]: === Iteration 17 === [mainErr51RequiresViolation, mainErr69RequiresViolation, mainErr26RequiresViolation, mainErr54RequiresViolation, mainErr66RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr31RequiresViolation, mainErr46RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr58RequiresViolation, mainErr62RequiresViolation, mainErr15RequiresViolation, mainErr49RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr55RequiresViolation, mainErr65RequiresViolation, mainErr17RequiresViolation, mainErr42RequiresViolation, mainErr71AssertViolationMEMORY_FREE, mainErr30RequiresViolation, mainErr11RequiresViolation, mainErr57RequiresViolation, mainErr63RequiresViolation, mainErr24RequiresViolation, mainErr44RequiresViolation, mainErr10RequiresViolation, mainErr43RequiresViolation, mainErr4RequiresViolation, mainErr50RequiresViolation, mainErr72EnsuresViolationMEMORY_LEAK, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr61RequiresViolation, mainErr59RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr70AssertViolationMEMORY_FREE, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr56RequiresViolation, mainErr64RequiresViolation, mainErr48RequiresViolation, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr52RequiresViolation, mainErr68RequiresViolation, mainErr45RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr60RequiresViolation, mainErr9RequiresViolation, mainErr67RequiresViolation, mainErr53RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr34RequiresViolation, mainErr47RequiresViolation, mainErr14RequiresViolation, mainErr40RequiresViolation]=== [2018-04-12 18:17:13,828 INFO L82 PathProgramCache]: Analyzing trace with hash 224455012, now seen corresponding path program 1 times [2018-04-12 18:17:13,828 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-04-12 18:17:13,828 INFO L68 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-04-12 18:17:13,829 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-12 18:17:13,829 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-12 18:17:13,829 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-12 18:17:13,836 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-12 18:17:13,837 WARN L250 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-12 18:17:13,863 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2018-04-12 18:17:13,864 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-04-12 18:17:13,864 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-04-12 18:17:13,864 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-04-12 18:17:13,864 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-04-12 18:17:13,864 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-04-12 18:17:13,864 INFO L87 Difference]: Start difference. First operand 272 states and 309 transitions. Second operand 4 states. [2018-04-12 18:17:13,926 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-12 18:17:13,926 INFO L93 Difference]: Finished difference Result 268 states and 301 transitions. [2018-04-12 18:17:13,926 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-04-12 18:17:13,926 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 47 [2018-04-12 18:17:13,926 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-12 18:17:13,927 INFO L225 Difference]: With dead ends: 268 [2018-04-12 18:17:13,927 INFO L226 Difference]: Without dead ends: 268 [2018-04-12 18:17:13,927 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-12 18:17:13,927 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 268 states. [2018-04-12 18:17:13,930 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 268 to 268. [2018-04-12 18:17:13,930 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 268 states. [2018-04-12 18:17:13,931 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 268 states to 268 states and 301 transitions. [2018-04-12 18:17:13,931 INFO L78 Accepts]: Start accepts. Automaton has 268 states and 301 transitions. Word has length 47 [2018-04-12 18:17:13,931 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-12 18:17:13,931 INFO L459 AbstractCegarLoop]: Abstraction has 268 states and 301 transitions. [2018-04-12 18:17:13,931 INFO L460 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-04-12 18:17:13,932 INFO L276 IsEmpty]: Start isEmpty. Operand 268 states and 301 transitions. [2018-04-12 18:17:13,932 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2018-04-12 18:17:13,932 INFO L347 BasicCegarLoop]: Found error trace [2018-04-12 18:17:13,932 INFO L355 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-12 18:17:13,932 INFO L408 AbstractCegarLoop]: === Iteration 18 === [mainErr51RequiresViolation, mainErr69RequiresViolation, mainErr26RequiresViolation, mainErr54RequiresViolation, mainErr66RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr31RequiresViolation, mainErr46RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr58RequiresViolation, mainErr62RequiresViolation, mainErr15RequiresViolation, mainErr49RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr55RequiresViolation, mainErr65RequiresViolation, mainErr17RequiresViolation, mainErr42RequiresViolation, mainErr71AssertViolationMEMORY_FREE, mainErr30RequiresViolation, mainErr11RequiresViolation, mainErr57RequiresViolation, mainErr63RequiresViolation, mainErr24RequiresViolation, mainErr44RequiresViolation, mainErr10RequiresViolation, mainErr43RequiresViolation, mainErr4RequiresViolation, mainErr50RequiresViolation, mainErr72EnsuresViolationMEMORY_LEAK, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr61RequiresViolation, mainErr59RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr70AssertViolationMEMORY_FREE, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr56RequiresViolation, mainErr64RequiresViolation, mainErr48RequiresViolation, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr52RequiresViolation, mainErr68RequiresViolation, mainErr45RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr60RequiresViolation, mainErr9RequiresViolation, mainErr67RequiresViolation, mainErr53RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr34RequiresViolation, mainErr47RequiresViolation, mainErr14RequiresViolation, mainErr40RequiresViolation]=== [2018-04-12 18:17:13,933 INFO L82 PathProgramCache]: Analyzing trace with hash -1004839968, now seen corresponding path program 1 times [2018-04-12 18:17:13,933 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-04-12 18:17:13,933 INFO L68 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-04-12 18:17:13,934 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-12 18:17:13,934 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-12 18:17:13,934 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-12 18:17:13,946 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-12 18:17:13,947 WARN L250 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-12 18:17:14,365 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 6 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-12 18:17:14,365 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-04-12 18:17:14,366 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-12 18:17:14,371 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-12 18:17:14,390 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-12 18:17:14,393 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-12 18:17:14,400 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select 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-12 18:17:14,400 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-12 18:17:14,402 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-12 18:17:14,403 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2018-04-12 18:17:14,508 INFO L700 Elim1Store]: detected not equals via solver [2018-04-12 18:17:14,509 INFO L700 Elim1Store]: detected not equals via solver [2018-04-12 18:17:14,509 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-12 18:17:14,509 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-12 18:17:14,517 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 15 [2018-04-12 18:17:14,517 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-12 18:17:14,523 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-04-12 18:17:14,523 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:31, output treesize:24 [2018-04-12 18:17:14,660 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 47 treesize of output 61 [2018-04-12 18:17:14,662 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 48 treesize of output 47 [2018-04-12 18:17:14,663 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-12 18:17:14,676 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-12 18:17:14,692 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 3 new quantified variables, introduced 3 case distinctions, treesize of input 39 treesize of output 48 [2018-04-12 18:17:14,698 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 33 treesize of output 39 [2018-04-12 18:17:14,699 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 2 xjuncts. [2018-04-12 18:17:14,713 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 31 [2018-04-12 18:17:14,713 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2018-04-12 18:17:14,720 INFO L267 ElimStorePlain]: Start of recursive call 4: 2 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-04-12 18:17:14,729 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-2 vars, End of recursive call: 2 dim-0 vars, and 2 xjuncts. [2018-04-12 18:17:14,730 INFO L202 ElimStorePlain]: Needed 6 recursive calls to eliminate 3 variables, input treesize:64, output treesize:85 [2018-04-12 18:17:15,187 WARN L151 SmtUtils]: Spent 159ms on a formula simplification. DAG size of input: 50 DAG size of output 45 [2018-04-12 18:17:15,416 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 80 treesize of output 88 [2018-04-12 18:17:15,417 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 2 xjuncts. [2018-04-12 18:17:15,461 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 80 treesize of output 88 [2018-04-12 18:17:15,461 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 2 xjuncts. [2018-04-12 18:17:15,504 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-1 vars, End of recursive call: and 4 xjuncts. [2018-04-12 18:17:15,504 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:161, output treesize:235 [2018-04-12 18:17:15,719 WARN L307 Elim1Store]: Array PQE input equivalent to false [2018-04-12 18:17:15,719 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-12 18:17:15,756 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 87 treesize of output 75 [2018-04-12 18:17:15,757 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2018-04-12 18:17:15,758 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-04-12 18:17:15,769 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 16 [2018-04-12 18:17:15,769 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-04-12 18:17:15,778 INFO L267 ElimStorePlain]: Start of recursive call 3: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-12 18:17:15,801 INFO L700 Elim1Store]: detected not equals via solver [2018-04-12 18:17:15,803 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 86 treesize of output 74 [2018-04-12 18:17:15,804 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2018-04-12 18:17:15,805 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2018-04-12 18:17:15,816 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 15 [2018-04-12 18:17:15,816 INFO L267 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 1 xjuncts. [2018-04-12 18:17:15,824 INFO L267 ElimStorePlain]: Start of recursive call 6: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-12 18:17:15,843 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 3 dim-2 vars, End of recursive call: 2 dim-0 vars, and 2 xjuncts. [2018-04-12 18:17:15,843 INFO L202 ElimStorePlain]: Needed 8 recursive calls to eliminate 6 variables, input treesize:260, output treesize:106 [2018-04-12 18:17:16,021 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 2 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-12 18:17:16,038 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-04-12 18:17:16,038 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [22, 20] total 40 [2018-04-12 18:17:16,038 INFO L442 AbstractCegarLoop]: Interpolant automaton has 40 states [2018-04-12 18:17:16,039 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 40 interpolants. [2018-04-12 18:17:16,039 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=136, Invalid=1409, Unknown=15, NotChecked=0, Total=1560 [2018-04-12 18:17:16,039 INFO L87 Difference]: Start difference. First operand 268 states and 301 transitions. Second operand 40 states. [2018-04-12 18:17:17,383 WARN L151 SmtUtils]: Spent 143ms on a formula simplification. DAG size of input: 122 DAG size of output 70 [2018-04-12 18:17:17,539 WARN L151 SmtUtils]: Spent 102ms on a formula simplification. DAG size of input: 132 DAG size of output 53 [2018-04-12 18:17:17,806 WARN L151 SmtUtils]: Spent 106ms on a formula simplification. DAG size of input: 136 DAG size of output 57 [2018-04-12 18:17:18,076 WARN L151 SmtUtils]: Spent 120ms on a formula simplification. DAG size of input: 143 DAG size of output 59 [2018-04-12 18:17:18,217 WARN L151 SmtUtils]: Spent 104ms on a formula simplification. DAG size of input: 137 DAG size of output 58 [2018-04-12 18:17:18,481 WARN L151 SmtUtils]: Spent 104ms on a formula simplification. DAG size of input: 175 DAG size of output 110 [2018-04-12 18:17:18,835 WARN L151 SmtUtils]: Spent 111ms on a formula simplification. DAG size of input: 143 DAG size of output 103 [2018-04-12 18:17:19,018 WARN L151 SmtUtils]: Spent 127ms on a formula simplification. DAG size of input: 148 DAG size of output 106 [2018-04-12 18:17:20,794 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-12 18:17:20,794 INFO L93 Difference]: Finished difference Result 428 states and 468 transitions. [2018-04-12 18:17:20,794 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 44 states. [2018-04-12 18:17:20,794 INFO L78 Accepts]: Start accepts. Automaton has 40 states. Word has length 50 [2018-04-12 18:17:20,794 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-12 18:17:20,795 INFO L225 Difference]: With dead ends: 428 [2018-04-12 18:17:20,795 INFO L226 Difference]: Without dead ends: 428 [2018-04-12 18:17:20,796 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 114 GetRequests, 33 SyntacticMatches, 2 SemanticMatches, 79 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1808 ImplicationChecksByTransitivity, 4.5s TimeCoverageRelationStatistics Valid=1187, Invalid=5270, Unknown=23, NotChecked=0, Total=6480 [2018-04-12 18:17:20,797 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 428 states. [2018-04-12 18:17:20,799 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 428 to 272. [2018-04-12 18:17:20,799 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 272 states. [2018-04-12 18:17:20,799 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 272 states to 272 states and 305 transitions. [2018-04-12 18:17:20,800 INFO L78 Accepts]: Start accepts. Automaton has 272 states and 305 transitions. Word has length 50 [2018-04-12 18:17:20,800 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-12 18:17:20,800 INFO L459 AbstractCegarLoop]: Abstraction has 272 states and 305 transitions. [2018-04-12 18:17:20,800 INFO L460 AbstractCegarLoop]: Interpolant automaton has 40 states. [2018-04-12 18:17:20,800 INFO L276 IsEmpty]: Start isEmpty. Operand 272 states and 305 transitions. [2018-04-12 18:17:20,800 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2018-04-12 18:17:20,800 INFO L347 BasicCegarLoop]: Found error trace [2018-04-12 18:17:20,800 INFO L355 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-12 18:17:20,800 INFO L408 AbstractCegarLoop]: === Iteration 19 === [mainErr51RequiresViolation, mainErr69RequiresViolation, mainErr26RequiresViolation, mainErr54RequiresViolation, mainErr66RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr31RequiresViolation, mainErr46RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr58RequiresViolation, mainErr62RequiresViolation, mainErr15RequiresViolation, mainErr49RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr55RequiresViolation, mainErr65RequiresViolation, mainErr17RequiresViolation, mainErr42RequiresViolation, mainErr71AssertViolationMEMORY_FREE, mainErr30RequiresViolation, mainErr11RequiresViolation, mainErr57RequiresViolation, mainErr63RequiresViolation, mainErr24RequiresViolation, mainErr44RequiresViolation, mainErr10RequiresViolation, mainErr43RequiresViolation, mainErr4RequiresViolation, mainErr50RequiresViolation, mainErr72EnsuresViolationMEMORY_LEAK, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr61RequiresViolation, mainErr59RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr70AssertViolationMEMORY_FREE, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr56RequiresViolation, mainErr64RequiresViolation, mainErr48RequiresViolation, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr52RequiresViolation, mainErr68RequiresViolation, mainErr45RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr60RequiresViolation, mainErr9RequiresViolation, mainErr67RequiresViolation, mainErr53RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr34RequiresViolation, mainErr47RequiresViolation, mainErr14RequiresViolation, mainErr40RequiresViolation]=== [2018-04-12 18:17:20,800 INFO L82 PathProgramCache]: Analyzing trace with hash 1801987223, now seen corresponding path program 1 times [2018-04-12 18:17:20,800 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-04-12 18:17:20,801 INFO L68 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-04-12 18:17:20,801 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-12 18:17:20,801 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-12 18:17:20,801 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-12 18:17:20,808 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-12 18:17:20,809 WARN L250 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-12 18:17:20,837 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2018-04-12 18:17:20,837 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-04-12 18:17:20,838 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-04-12 18:17:20,838 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-04-12 18:17:20,838 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-04-12 18:17:20,838 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-04-12 18:17:20,838 INFO L87 Difference]: Start difference. First operand 272 states and 305 transitions. Second operand 6 states. [2018-04-12 18:17:21,019 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-12 18:17:21,019 INFO L93 Difference]: Finished difference Result 302 states and 336 transitions. [2018-04-12 18:17:21,020 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-04-12 18:17:21,020 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 51 [2018-04-12 18:17:21,020 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-12 18:17:21,020 INFO L225 Difference]: With dead ends: 302 [2018-04-12 18:17:21,020 INFO L226 Difference]: Without dead ends: 302 [2018-04-12 18:17:21,021 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=30, Invalid=60, Unknown=0, NotChecked=0, Total=90 [2018-04-12 18:17:21,021 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 302 states. [2018-04-12 18:17:21,023 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 302 to 281. [2018-04-12 18:17:21,023 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 281 states. [2018-04-12 18:17:21,023 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 281 states to 281 states and 319 transitions. [2018-04-12 18:17:21,023 INFO L78 Accepts]: Start accepts. Automaton has 281 states and 319 transitions. Word has length 51 [2018-04-12 18:17:21,024 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-12 18:17:21,024 INFO L459 AbstractCegarLoop]: Abstraction has 281 states and 319 transitions. [2018-04-12 18:17:21,024 INFO L460 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-04-12 18:17:21,024 INFO L276 IsEmpty]: Start isEmpty. Operand 281 states and 319 transitions. [2018-04-12 18:17:21,024 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2018-04-12 18:17:21,024 INFO L347 BasicCegarLoop]: Found error trace [2018-04-12 18:17:21,024 INFO L355 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-12 18:17:21,024 INFO L408 AbstractCegarLoop]: === Iteration 20 === [mainErr51RequiresViolation, mainErr69RequiresViolation, mainErr26RequiresViolation, mainErr54RequiresViolation, mainErr66RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr31RequiresViolation, mainErr46RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr58RequiresViolation, mainErr62RequiresViolation, mainErr15RequiresViolation, mainErr49RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr55RequiresViolation, mainErr65RequiresViolation, mainErr17RequiresViolation, mainErr42RequiresViolation, mainErr71AssertViolationMEMORY_FREE, mainErr30RequiresViolation, mainErr11RequiresViolation, mainErr57RequiresViolation, mainErr63RequiresViolation, mainErr24RequiresViolation, mainErr44RequiresViolation, mainErr10RequiresViolation, mainErr43RequiresViolation, mainErr4RequiresViolation, mainErr50RequiresViolation, mainErr72EnsuresViolationMEMORY_LEAK, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr61RequiresViolation, mainErr59RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr70AssertViolationMEMORY_FREE, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr56RequiresViolation, mainErr64RequiresViolation, mainErr48RequiresViolation, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr52RequiresViolation, mainErr68RequiresViolation, mainErr45RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr60RequiresViolation, mainErr9RequiresViolation, mainErr67RequiresViolation, mainErr53RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr34RequiresViolation, mainErr47RequiresViolation, mainErr14RequiresViolation, mainErr40RequiresViolation]=== [2018-04-12 18:17:21,024 INFO L82 PathProgramCache]: Analyzing trace with hash 1801987224, now seen corresponding path program 1 times [2018-04-12 18:17:21,024 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-04-12 18:17:21,024 INFO L68 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-04-12 18:17:21,025 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-12 18:17:21,025 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-12 18:17:21,025 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-12 18:17:21,032 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-12 18:17:21,032 WARN L250 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-12 18:17:21,258 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-12 18:17:21,258 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-04-12 18:17:21,258 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-12 18:17:21,266 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-12 18:17:21,283 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-12 18:17:21,285 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-12 18:17:21,336 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 19 [2018-04-12 18:17:21,337 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 11 [2018-04-12 18:17:21,337 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-12 18:17:21,338 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-12 18:17:21,343 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 22 [2018-04-12 18:17:21,344 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 13 [2018-04-12 18:17:21,344 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-04-12 18:17:21,346 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-12 18:17:21,349 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-12 18:17:21,349 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 4 variables, input treesize:39, output treesize:13 [2018-04-12 18:17:21,377 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2018-04-12 18:17:21,395 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-04-12 18:17:21,396 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [20] total 24 [2018-04-12 18:17:21,396 INFO L442 AbstractCegarLoop]: Interpolant automaton has 25 states [2018-04-12 18:17:21,396 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2018-04-12 18:17:21,396 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=82, Invalid=518, Unknown=0, NotChecked=0, Total=600 [2018-04-12 18:17:21,396 INFO L87 Difference]: Start difference. First operand 281 states and 319 transitions. Second operand 25 states. [2018-04-12 18:17:23,484 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-12 18:17:23,484 INFO L93 Difference]: Finished difference Result 420 states and 459 transitions. [2018-04-12 18:17:23,484 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 46 states. [2018-04-12 18:17:23,485 INFO L78 Accepts]: Start accepts. Automaton has 25 states. Word has length 51 [2018-04-12 18:17:23,485 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-12 18:17:23,485 INFO L225 Difference]: With dead ends: 420 [2018-04-12 18:17:23,486 INFO L226 Difference]: Without dead ends: 420 [2018-04-12 18:17:23,486 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 127 GetRequests, 60 SyntacticMatches, 2 SemanticMatches, 65 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1115 ImplicationChecksByTransitivity, 1.5s TimeCoverageRelationStatistics Valid=865, Invalid=3557, Unknown=0, NotChecked=0, Total=4422 [2018-04-12 18:17:23,487 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 420 states. [2018-04-12 18:17:23,489 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 420 to 292. [2018-04-12 18:17:23,489 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 292 states. [2018-04-12 18:17:23,489 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 292 states to 292 states and 328 transitions. [2018-04-12 18:17:23,489 INFO L78 Accepts]: Start accepts. Automaton has 292 states and 328 transitions. Word has length 51 [2018-04-12 18:17:23,489 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-12 18:17:23,489 INFO L459 AbstractCegarLoop]: Abstraction has 292 states and 328 transitions. [2018-04-12 18:17:23,489 INFO L460 AbstractCegarLoop]: Interpolant automaton has 25 states. [2018-04-12 18:17:23,489 INFO L276 IsEmpty]: Start isEmpty. Operand 292 states and 328 transitions. [2018-04-12 18:17:23,490 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2018-04-12 18:17:23,490 INFO L347 BasicCegarLoop]: Found error trace [2018-04-12 18:17:23,490 INFO L355 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-12 18:17:23,490 INFO L408 AbstractCegarLoop]: === Iteration 21 === [mainErr51RequiresViolation, mainErr69RequiresViolation, mainErr26RequiresViolation, mainErr54RequiresViolation, mainErr66RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr31RequiresViolation, mainErr46RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr58RequiresViolation, mainErr62RequiresViolation, mainErr15RequiresViolation, mainErr49RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr55RequiresViolation, mainErr65RequiresViolation, mainErr17RequiresViolation, mainErr42RequiresViolation, mainErr71AssertViolationMEMORY_FREE, mainErr30RequiresViolation, mainErr11RequiresViolation, mainErr57RequiresViolation, mainErr63RequiresViolation, mainErr24RequiresViolation, mainErr44RequiresViolation, mainErr10RequiresViolation, mainErr43RequiresViolation, mainErr4RequiresViolation, mainErr50RequiresViolation, mainErr72EnsuresViolationMEMORY_LEAK, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr61RequiresViolation, mainErr59RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr70AssertViolationMEMORY_FREE, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr56RequiresViolation, mainErr64RequiresViolation, mainErr48RequiresViolation, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr52RequiresViolation, mainErr68RequiresViolation, mainErr45RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr60RequiresViolation, mainErr9RequiresViolation, mainErr67RequiresViolation, mainErr53RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr34RequiresViolation, mainErr47RequiresViolation, mainErr14RequiresViolation, mainErr40RequiresViolation]=== [2018-04-12 18:17:23,490 INFO L82 PathProgramCache]: Analyzing trace with hash 2133118707, now seen corresponding path program 1 times [2018-04-12 18:17:23,490 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-04-12 18:17:23,490 INFO L68 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-04-12 18:17:23,491 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-12 18:17:23,491 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-12 18:17:23,491 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-12 18:17:23,501 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-12 18:17:23,502 WARN L250 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-12 18:17:23,643 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-12 18:17:23,644 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-04-12 18:17:23,644 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-12 18:17:23,651 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-12 18:17:23,667 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-12 18:17:23,669 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-12 18:17:23,723 INFO L700 Elim1Store]: detected not equals via solver [2018-04-12 18:17:23,723 INFO L700 Elim1Store]: detected not equals via solver [2018-04-12 18:17:23,724 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-12 18:17:23,724 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-12 18:17:23,727 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-12 18:17:23,727 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:25, output treesize:19 [2018-04-12 18:17:23,741 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 20 [2018-04-12 18:17:23,743 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 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-12 18:17:23,743 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-12 18:17:23,746 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-12 18:17:23,756 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 20 [2018-04-12 18:17:23,758 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select 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-12 18:17:23,758 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-04-12 18:17:23,761 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-12 18:17:23,767 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-04-12 18:17:23,767 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 2 variables, input treesize:41, output treesize:33 [2018-04-12 18:17:23,791 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 27 [2018-04-12 18:17:23,793 INFO L700 Elim1Store]: detected not equals via solver [2018-04-12 18:17:23,794 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 23 [2018-04-12 18:17:23,794 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-12 18:17:23,799 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-12 18:17:23,810 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 33 [2018-04-12 18:17:23,812 INFO L700 Elim1Store]: detected not equals via solver [2018-04-12 18:17:23,812 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 23 [2018-04-12 18:17:23,813 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-04-12 18:17:23,818 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-12 18:17:23,824 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2018-04-12 18:17:23,824 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 4 variables, input treesize:59, output treesize:57 [2018-04-12 18:17:23,849 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 94 treesize of output 77 [2018-04-12 18:17:23,850 INFO L700 Elim1Store]: detected not equals via solver [2018-04-12 18:17:23,851 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 48 treesize of output 37 [2018-04-12 18:17:23,852 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-12 18:17:23,862 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 3 [2018-04-12 18:17:23,862 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-04-12 18:17:23,868 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-12 18:17:23,876 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 34 treesize of output 28 [2018-04-12 18:17:23,884 INFO L700 Elim1Store]: detected not equals via solver [2018-04-12 18:17:23,885 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 17 [2018-04-12 18:17:23,886 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-12 18:17:23,891 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 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-12 18:17:23,892 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2018-04-12 18:17:23,894 INFO L267 ElimStorePlain]: Start of recursive call 5: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-12 18:17:23,898 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-12 18:17:23,898 INFO L202 ElimStorePlain]: Needed 7 recursive calls to eliminate 4 variables, input treesize:101, output treesize:7 [2018-04-12 18:17:23,914 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-12 18:17:23,932 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-04-12 18:17:23,932 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 13] total 22 [2018-04-12 18:17:23,932 INFO L442 AbstractCegarLoop]: Interpolant automaton has 22 states [2018-04-12 18:17:23,933 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2018-04-12 18:17:23,933 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=70, Invalid=392, Unknown=0, NotChecked=0, Total=462 [2018-04-12 18:17:23,933 INFO L87 Difference]: Start difference. First operand 292 states and 328 transitions. Second operand 22 states. [2018-04-12 18:17:24,928 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-12 18:17:24,928 INFO L93 Difference]: Finished difference Result 350 states and 380 transitions. [2018-04-12 18:17:24,928 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2018-04-12 18:17:24,928 INFO L78 Accepts]: Start accepts. Automaton has 22 states. Word has length 53 [2018-04-12 18:17:24,928 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-12 18:17:24,929 INFO L225 Difference]: With dead ends: 350 [2018-04-12 18:17:24,929 INFO L226 Difference]: Without dead ends: 350 [2018-04-12 18:17:24,929 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 92 GetRequests, 46 SyntacticMatches, 3 SemanticMatches, 43 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 432 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=434, Invalid=1543, Unknown=3, NotChecked=0, Total=1980 [2018-04-12 18:17:24,930 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 350 states. [2018-04-12 18:17:24,932 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 350 to 306. [2018-04-12 18:17:24,932 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 306 states. [2018-04-12 18:17:24,932 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 306 states to 306 states and 341 transitions. [2018-04-12 18:17:24,933 INFO L78 Accepts]: Start accepts. Automaton has 306 states and 341 transitions. Word has length 53 [2018-04-12 18:17:24,933 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-12 18:17:24,933 INFO L459 AbstractCegarLoop]: Abstraction has 306 states and 341 transitions. [2018-04-12 18:17:24,933 INFO L460 AbstractCegarLoop]: Interpolant automaton has 22 states. [2018-04-12 18:17:24,933 INFO L276 IsEmpty]: Start isEmpty. Operand 306 states and 341 transitions. [2018-04-12 18:17:24,933 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2018-04-12 18:17:24,934 INFO L347 BasicCegarLoop]: Found error trace [2018-04-12 18:17:24,934 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] [2018-04-12 18:17:24,934 INFO L408 AbstractCegarLoop]: === Iteration 22 === [mainErr51RequiresViolation, mainErr69RequiresViolation, mainErr26RequiresViolation, mainErr54RequiresViolation, mainErr66RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr31RequiresViolation, mainErr46RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr58RequiresViolation, mainErr62RequiresViolation, mainErr15RequiresViolation, mainErr49RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr55RequiresViolation, mainErr65RequiresViolation, mainErr17RequiresViolation, mainErr42RequiresViolation, mainErr71AssertViolationMEMORY_FREE, mainErr30RequiresViolation, mainErr11RequiresViolation, mainErr57RequiresViolation, mainErr63RequiresViolation, mainErr24RequiresViolation, mainErr44RequiresViolation, mainErr10RequiresViolation, mainErr43RequiresViolation, mainErr4RequiresViolation, mainErr50RequiresViolation, mainErr72EnsuresViolationMEMORY_LEAK, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr61RequiresViolation, mainErr59RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr70AssertViolationMEMORY_FREE, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr56RequiresViolation, mainErr64RequiresViolation, mainErr48RequiresViolation, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr52RequiresViolation, mainErr68RequiresViolation, mainErr45RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr60RequiresViolation, mainErr9RequiresViolation, mainErr67RequiresViolation, mainErr53RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr34RequiresViolation, mainErr47RequiresViolation, mainErr14RequiresViolation, mainErr40RequiresViolation]=== [2018-04-12 18:17:24,934 INFO L82 PathProgramCache]: Analyzing trace with hash -1401734189, now seen corresponding path program 1 times [2018-04-12 18:17:24,934 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-04-12 18:17:24,934 INFO L68 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-04-12 18:17:24,935 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-12 18:17:24,935 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-12 18:17:24,935 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-12 18:17:24,949 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-12 18:17:24,950 WARN L250 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-12 18:17:25,399 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 0 proven. 20 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-12 18:17:25,399 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-04-12 18:17:25,399 INFO L213 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 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-12 18:17:25,405 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-12 18:17:25,420 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-12 18:17:25,422 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-12 18:17:25,446 INFO L700 Elim1Store]: detected not equals via solver [2018-04-12 18:17:25,446 INFO L700 Elim1Store]: detected not equals via solver [2018-04-12 18:17:25,446 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-12 18:17:25,447 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-12 18:17:25,449 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-12 18:17:25,449 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:17, output treesize:11 [2018-04-12 18:17:25,461 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-12 18:17:25,463 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-12 18:17:25,464 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-12 18:17:25,465 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-12 18:17:25,470 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-12 18:17:25,470 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:27, output treesize:20 [2018-04-12 18:17:25,509 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-12 18:17:25,511 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select 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-12 18:17:25,511 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-12 18:17:25,514 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-12 18:17:25,520 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-12 18:17:25,520 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:41, output treesize:33 [2018-04-12 18:17:25,591 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-12 18:17:25,599 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-12 18:17:25,599 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 2 xjuncts. [2018-04-12 18:17:25,609 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-04-12 18:17:25,624 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-12 18:17:25,624 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:50, output treesize:68 [2018-04-12 18:17:25,661 INFO L700 Elim1Store]: detected not equals via solver [2018-04-12 18:17:25,662 INFO L700 Elim1Store]: detected not equals via solver [2018-04-12 18:17:25,662 INFO L700 Elim1Store]: detected not equals via solver [2018-04-12 18:17:25,663 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-12 18:17:25,663 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-12 18:17:25,667 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-12 18:17:25,668 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:34, output treesize:27 [2018-04-12 18:17:25,692 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 26 treesize of output 25 [2018-04-12 18:17:25,694 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-12 18:17:25,694 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-12 18:17:25,697 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-12 18:17:25,703 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-12 18:17:25,703 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:43, output treesize:33 [2018-04-12 18:17:25,746 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 45 treesize of output 45 [2018-04-12 18:17:25,747 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 13 [2018-04-12 18:17:25,747 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-12 18:17:25,751 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-12 18:17:25,756 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-12 18:17:25,756 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:54, output treesize:46 [2018-04-12 18:17:25,879 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 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-12 18:17:25,885 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-12 18:17:25,885 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 2 xjuncts. [2018-04-12 18:17:25,895 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-04-12 18:17:25,909 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-12 18:17:25,909 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:94, output treesize:146 [2018-04-12 18:17:33,950 WARN L148 SmtUtils]: Spent 8013ms on a formula simplification that was a NOOP. DAG size: 46 [2018-04-12 18:17:42,018 WARN L148 SmtUtils]: Spent 8014ms on a formula simplification that was a NOOP. DAG size: 46 [2018-04-12 18:17:42,038 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 70 treesize of output 45 [2018-04-12 18:17:42,040 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-12 18:17:42,040 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-12 18:17:42,047 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 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-12 18:17:42,047 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-04-12 18:17:42,050 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 1 [2018-04-12 18:17:42,050 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-04-12 18:17:42,052 INFO L267 ElimStorePlain]: Start of recursive call 2: 3 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-12 18:17:42,063 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 89 treesize of output 52 [2018-04-12 18:17:42,097 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 35 [2018-04-12 18:17:42,097 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2018-04-12 18:17:42,107 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 1 case distinctions, treesize of input 40 treesize of output 26 [2018-04-12 18:17:42,108 INFO L267 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 2 xjuncts. [2018-04-12 18:17:42,120 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 21 [2018-04-12 18:17:42,121 INFO L267 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 1 xjuncts. [2018-04-12 18:17:42,122 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 24 [2018-04-12 18:17:42,122 INFO L267 ElimStorePlain]: Start of recursive call 10: End of recursive call: and 1 xjuncts. [2018-04-12 18:17:42,129 INFO L267 ElimStorePlain]: Start of recursive call 6: 3 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-04-12 18:17:42,147 INFO L267 ElimStorePlain]: Start of recursive call 1: 9 dim-0 vars, 2 dim-2 vars, End of recursive call: and 2 xjuncts. [2018-04-12 18:17:42,147 INFO L202 ElimStorePlain]: Needed 10 recursive calls to eliminate 11 variables, input treesize:160, output treesize:15 [2018-04-12 18:17:42,168 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 0 proven. 20 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-12 18:17:42,185 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-04-12 18:17:42,185 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [19, 19] total 36 [2018-04-12 18:17:42,186 INFO L442 AbstractCegarLoop]: Interpolant automaton has 37 states [2018-04-12 18:17:42,186 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 37 interpolants. [2018-04-12 18:17:42,186 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=147, Invalid=1185, Unknown=0, NotChecked=0, Total=1332 [2018-04-12 18:17:42,186 INFO L87 Difference]: Start difference. First operand 306 states and 341 transitions. Second operand 37 states. [2018-04-12 18:17:59,254 WARN L151 SmtUtils]: Spent 16038ms on a formula simplification. DAG size of input: 62 DAG size of output 62 [2018-04-12 18:18:15,482 WARN L151 SmtUtils]: Spent 16059ms on a formula simplification. DAG size of input: 111 DAG size of output 62 [2018-04-12 18:18:31,779 WARN L151 SmtUtils]: Spent 16057ms on a formula simplification. DAG size of input: 114 DAG size of output 65 [2018-04-12 18:18:39,950 WARN L148 SmtUtils]: Spent 8018ms on a formula simplification that was a NOOP. DAG size: 59 [2018-04-12 18:18:48,169 WARN L148 SmtUtils]: Spent 8019ms on a formula simplification that was a NOOP. DAG size: 62 [2018-04-12 18:18:48,705 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-12 18:18:48,705 INFO L93 Difference]: Finished difference Result 519 states and 568 transitions. [2018-04-12 18:18:48,705 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 34 states. [2018-04-12 18:18:48,705 INFO L78 Accepts]: Start accepts. Automaton has 37 states. Word has length 55 [2018-04-12 18:18:48,706 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-12 18:18:48,706 INFO L225 Difference]: With dead ends: 519 [2018-04-12 18:18:48,706 INFO L226 Difference]: Without dead ends: 519 [2018-04-12 18:18:48,707 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 108 GetRequests, 40 SyntacticMatches, 2 SemanticMatches, 66 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1167 ImplicationChecksByTransitivity, 82.0s TimeCoverageRelationStatistics Valid=755, Invalid=3801, Unknown=0, NotChecked=0, Total=4556 [2018-04-12 18:18:48,707 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 519 states. [2018-04-12 18:18:48,710 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 519 to 347. [2018-04-12 18:18:48,710 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 347 states. [2018-04-12 18:18:48,710 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 347 states to 347 states and 387 transitions. [2018-04-12 18:18:48,711 INFO L78 Accepts]: Start accepts. Automaton has 347 states and 387 transitions. Word has length 55 [2018-04-12 18:18:48,711 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-12 18:18:48,711 INFO L459 AbstractCegarLoop]: Abstraction has 347 states and 387 transitions. [2018-04-12 18:18:48,711 INFO L460 AbstractCegarLoop]: Interpolant automaton has 37 states. [2018-04-12 18:18:48,711 INFO L276 IsEmpty]: Start isEmpty. Operand 347 states and 387 transitions. [2018-04-12 18:18:48,711 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2018-04-12 18:18:48,711 INFO L347 BasicCegarLoop]: Found error trace [2018-04-12 18:18:48,712 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] [2018-04-12 18:18:48,712 INFO L408 AbstractCegarLoop]: === Iteration 23 === [mainErr51RequiresViolation, mainErr69RequiresViolation, mainErr26RequiresViolation, mainErr54RequiresViolation, mainErr66RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr31RequiresViolation, mainErr46RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr58RequiresViolation, mainErr62RequiresViolation, mainErr15RequiresViolation, mainErr49RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr55RequiresViolation, mainErr65RequiresViolation, mainErr17RequiresViolation, mainErr42RequiresViolation, mainErr71AssertViolationMEMORY_FREE, mainErr30RequiresViolation, mainErr11RequiresViolation, mainErr57RequiresViolation, mainErr63RequiresViolation, mainErr24RequiresViolation, mainErr44RequiresViolation, mainErr10RequiresViolation, mainErr43RequiresViolation, mainErr4RequiresViolation, mainErr50RequiresViolation, mainErr72EnsuresViolationMEMORY_LEAK, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr61RequiresViolation, mainErr59RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr70AssertViolationMEMORY_FREE, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr56RequiresViolation, mainErr64RequiresViolation, mainErr48RequiresViolation, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr52RequiresViolation, mainErr68RequiresViolation, mainErr45RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr60RequiresViolation, mainErr9RequiresViolation, mainErr67RequiresViolation, mainErr53RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr34RequiresViolation, mainErr47RequiresViolation, mainErr14RequiresViolation, mainErr40RequiresViolation]=== [2018-04-12 18:18:48,712 INFO L82 PathProgramCache]: Analyzing trace with hash -1401734188, now seen corresponding path program 1 times [2018-04-12 18:18:48,712 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-04-12 18:18:48,712 INFO L68 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-04-12 18:18:48,713 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-12 18:18:48,713 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-12 18:18:48,713 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-12 18:18:48,726 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-12 18:18:48,726 WARN L250 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-12 18:18:49,023 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 0 proven. 20 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-12 18:18:49,023 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-04-12 18:18:49,023 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-12 18:18:49,028 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-12 18:18:49,044 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-12 18:18:49,046 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-12 18:18:49,050 INFO L700 Elim1Store]: detected not equals via solver [2018-04-12 18:18:49,051 INFO L700 Elim1Store]: detected not equals via solver [2018-04-12 18:18:49,051 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-12 18:18:49,051 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-12 18:18:49,054 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-12 18:18:49,054 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:20, output treesize:14 [2018-04-12 18:18:49,073 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-12 18:18:49,074 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-12 18:18:49,075 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-12 18:18:49,076 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-12 18:18:49,083 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-12 18:18:49,084 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-04-12 18:18:49,084 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-04-12 18:18:49,085 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-12 18:18:49,090 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-12 18:18:49,090 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 3 variables, input treesize:38, output treesize:27 [2018-04-12 18:18:49,126 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-12 18:18:49,128 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 13 [2018-04-12 18:18:49,128 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-12 18:18:49,132 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-12 18:18:49,141 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-12 18:18:49,142 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select 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-12 18:18:49,142 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-04-12 18:18:49,145 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-12 18:18:49,151 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-12 18:18:49,152 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 3 variables, input treesize:69, output treesize:53 [2018-04-12 18:18:49,238 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-12 18:18:49,245 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-12 18:18:49,246 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 2 xjuncts. [2018-04-12 18:18:49,264 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-04-12 18:18:49,288 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 60 [2018-04-12 18:18:49,295 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-12 18:18:49,295 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 2 xjuncts. [2018-04-12 18:18:49,307 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-04-12 18:18:49,311 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 55 treesize of output 50 [2018-04-12 18:18:49,313 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 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-12 18:18:49,313 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2018-04-12 18:18:49,318 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-12 18:18:49,341 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-2 vars, End of recursive call: 1 dim-0 vars, and 2 xjuncts. [2018-04-12 18:18:49,341 INFO L202 ElimStorePlain]: Needed 7 recursive calls to eliminate 3 variables, input treesize:84, output treesize:129 [2018-04-12 18:18:49,412 INFO L700 Elim1Store]: detected not equals via solver [2018-04-12 18:18:49,413 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 21 [2018-04-12 18:18:49,413 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-12 18:18:49,426 INFO L700 Elim1Store]: detected not equals via solver [2018-04-12 18:18:49,426 INFO L700 Elim1Store]: detected not equals via solver [2018-04-12 18:18:49,427 INFO L700 Elim1Store]: detected not equals via solver [2018-04-12 18:18:49,427 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-12 18:18:49,428 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-12 18:18:49,437 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-12 18:18:49,437 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:68, output treesize:64 [2018-04-12 18:18:49,470 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-12 18:18:49,472 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-12 18:18:49,472 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-12 18:18:49,475 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-12 18:18:49,489 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 48 treesize of output 47 [2018-04-12 18:18:49,492 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-12 18:18:49,492 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-04-12 18:18:49,496 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-12 18:18:49,506 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-12 18:18:49,506 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 4 variables, input treesize:86, output treesize:58 [2018-04-12 18:18:49,568 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 30 [2018-04-12 18:18:49,570 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select 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-12 18:18:49,570 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-12 18:18:49,573 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-12 18:18:49,590 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 78 treesize of output 78 [2018-04-12 18:18:49,592 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-12 18:18:49,592 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-04-12 18:18:49,601 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-12 18:18:49,611 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-12 18:18:49,611 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 3 variables, input treesize:100, output treesize:84 [2018-04-12 18:18:49,718 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-12 18:18:49,725 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-12 18:18:49,725 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 2 xjuncts. [2018-04-12 18:18:49,735 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-04-12 18:18:49,766 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-12 18:18:49,768 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-12 18:18:49,768 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-04-12 18:18:49,778 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-12 18:18:49,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 148 treesize of output 113 [2018-04-12 18:18:49,793 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 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-12 18:18:49,794 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 2 xjuncts. [2018-04-12 18:18:49,812 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-04-12 18:18:49,844 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-12 18:18:49,845 INFO L202 ElimStorePlain]: Needed 7 recursive calls to eliminate 5 variables, input treesize:163, output treesize:245 [2018-04-12 18:18:57,909 WARN L148 SmtUtils]: Spent 8018ms on a formula simplification that was a NOOP. DAG size: 67 [2018-04-12 18:19:05,992 WARN L148 SmtUtils]: Spent 8018ms on a formula simplification that was a NOOP. DAG size: 67 [2018-04-12 18:19:06,021 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 153 treesize of output 98 [2018-04-12 18:19:06,027 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-12 18:19:06,027 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 2 xjuncts. [2018-04-12 18:19:06,045 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 42 treesize of output 32 [2018-04-12 18:19:06,046 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-04-12 18:19:06,064 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 33 treesize of output 22 [2018-04-12 18:19:06,064 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-04-12 18:19:06,066 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 19 [2018-04-12 18:19:06,066 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2018-04-12 18:19:06,088 INFO L267 ElimStorePlain]: Start of recursive call 2: 3 dim-1 vars, End of recursive call: 2 dim-0 vars, and 2 xjuncts. [2018-04-12 18:19:06,134 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 64 treesize of output 56 [2018-04-12 18:19:06,136 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 3 [2018-04-12 18:19:06,136 INFO L267 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 1 xjuncts. [2018-04-12 18:19:06,147 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 6 [2018-04-12 18:19:06,147 INFO L267 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 1 xjuncts. [2018-04-12 18:19:06,154 INFO L267 ElimStorePlain]: Start of recursive call 7: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-12 18:19:06,156 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 61 treesize of output 57 [2018-04-12 18:19:06,157 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 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-12 18:19:06,157 INFO L267 ElimStorePlain]: Start of recursive call 11: End of recursive call: and 1 xjuncts. [2018-04-12 18:19:06,171 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 1 case distinctions, treesize of input 13 treesize of output 10 [2018-04-12 18:19:06,171 INFO L267 ElimStorePlain]: Start of recursive call 12: End of recursive call: and 2 xjuncts. [2018-04-12 18:19:06,180 INFO L267 ElimStorePlain]: Start of recursive call 10: 2 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-04-12 18:19:06,231 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 119 treesize of output 82 [2018-04-12 18:19:06,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, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 1 [2018-04-12 18:19:06,233 INFO L267 ElimStorePlain]: Start of recursive call 14: End of recursive call: and 1 xjuncts. [2018-04-12 18:19:06,248 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 25 [2018-04-12 18:19:06,249 INFO L267 ElimStorePlain]: Start of recursive call 15: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-04-12 18:19:06,259 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-12 18:19:06,260 INFO L267 ElimStorePlain]: Start of recursive call 16: End of recursive call: and 1 xjuncts. [2018-04-12 18:19:06,269 INFO L267 ElimStorePlain]: Start of recursive call 13: 3 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-04-12 18:19:06,312 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 51 treesize of output 45 [2018-04-12 18:19:06,314 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 1 [2018-04-12 18:19:06,314 INFO L267 ElimStorePlain]: Start of recursive call 18: End of recursive call: and 1 xjuncts. [2018-04-12 18:19:06,322 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select 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-12 18:19:06,322 INFO L267 ElimStorePlain]: Start of recursive call 19: End of recursive call: and 1 xjuncts. [2018-04-12 18:19:06,328 INFO L267 ElimStorePlain]: Start of recursive call 17: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-12 18:19:06,363 INFO L267 ElimStorePlain]: Start of recursive call 1: 9 dim-0 vars, 4 dim-2 vars, End of recursive call: 3 dim-0 vars, and 3 xjuncts. [2018-04-12 18:19:06,363 INFO L202 ElimStorePlain]: Needed 19 recursive calls to eliminate 13 variables, input treesize:273, output treesize:58 [2018-04-12 18:19:06,453 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 0 proven. 20 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-12 18:19:06,470 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-04-12 18:19:06,470 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [19, 20] total 36 [2018-04-12 18:19:06,470 INFO L442 AbstractCegarLoop]: Interpolant automaton has 37 states [2018-04-12 18:19:06,471 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 37 interpolants. [2018-04-12 18:19:06,471 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=131, Invalid=1201, Unknown=0, NotChecked=0, Total=1332 [2018-04-12 18:19:06,471 INFO L87 Difference]: Start difference. First operand 347 states and 387 transitions. Second operand 37 states. [2018-04-12 18:19:23,541 WARN L151 SmtUtils]: Spent 16043ms on a formula simplification. DAG size of input: 76 DAG size of output 76 [2018-04-12 18:19:37,801 WARN L151 SmtUtils]: Spent 14049ms on a formula simplification. DAG size of input: 127 DAG size of output 79 [2018-04-12 18:19:52,103 WARN L151 SmtUtils]: Spent 14055ms on a formula simplification. DAG size of input: 140 DAG size of output 84 [2018-04-12 18:20:08,357 WARN L151 SmtUtils]: Spent 16045ms on a formula simplification. DAG size of input: 73 DAG size of output 73 [2018-04-12 18:20:09,168 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-12 18:20:09,168 INFO L93 Difference]: Finished difference Result 518 states and 567 transitions. [2018-04-12 18:20:09,168 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 31 states. [2018-04-12 18:20:09,169 INFO L78 Accepts]: Start accepts. Automaton has 37 states. Word has length 55 [2018-04-12 18:20:09,169 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-12 18:20:09,169 INFO L225 Difference]: With dead ends: 518 [2018-04-12 18:20:09,170 INFO L226 Difference]: Without dead ends: 518 [2018-04-12 18:20:09,170 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 100 GetRequests, 38 SyntacticMatches, 2 SemanticMatches, 60 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 874 ImplicationChecksByTransitivity, 77.9s TimeCoverageRelationStatistics Valid=491, Invalid=3291, Unknown=0, NotChecked=0, Total=3782 [2018-04-12 18:20:09,170 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 518 states. [2018-04-12 18:20:09,172 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 518 to 347. [2018-04-12 18:20:09,172 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 347 states. [2018-04-12 18:20:09,173 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 347 states to 347 states and 386 transitions. [2018-04-12 18:20:09,173 INFO L78 Accepts]: Start accepts. Automaton has 347 states and 386 transitions. Word has length 55 [2018-04-12 18:20:09,173 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-12 18:20:09,173 INFO L459 AbstractCegarLoop]: Abstraction has 347 states and 386 transitions. [2018-04-12 18:20:09,173 INFO L460 AbstractCegarLoop]: Interpolant automaton has 37 states. [2018-04-12 18:20:09,173 INFO L276 IsEmpty]: Start isEmpty. Operand 347 states and 386 transitions. [2018-04-12 18:20:09,174 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2018-04-12 18:20:09,174 INFO L347 BasicCegarLoop]: Found error trace [2018-04-12 18:20:09,174 INFO L355 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-12 18:20:09,174 INFO L408 AbstractCegarLoop]: === Iteration 24 === [mainErr51RequiresViolation, mainErr69RequiresViolation, mainErr26RequiresViolation, mainErr54RequiresViolation, mainErr66RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr31RequiresViolation, mainErr46RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr58RequiresViolation, mainErr62RequiresViolation, mainErr15RequiresViolation, mainErr49RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr55RequiresViolation, mainErr65RequiresViolation, mainErr17RequiresViolation, mainErr42RequiresViolation, mainErr71AssertViolationMEMORY_FREE, mainErr30RequiresViolation, mainErr11RequiresViolation, mainErr57RequiresViolation, mainErr63RequiresViolation, mainErr24RequiresViolation, mainErr44RequiresViolation, mainErr10RequiresViolation, mainErr43RequiresViolation, mainErr4RequiresViolation, mainErr50RequiresViolation, mainErr72EnsuresViolationMEMORY_LEAK, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr61RequiresViolation, mainErr59RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr70AssertViolationMEMORY_FREE, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr56RequiresViolation, mainErr64RequiresViolation, mainErr48RequiresViolation, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr52RequiresViolation, mainErr68RequiresViolation, mainErr45RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr60RequiresViolation, mainErr9RequiresViolation, mainErr67RequiresViolation, mainErr53RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr34RequiresViolation, mainErr47RequiresViolation, mainErr14RequiresViolation, mainErr40RequiresViolation]=== [2018-04-12 18:20:09,174 INFO L82 PathProgramCache]: Analyzing trace with hash -1257449240, now seen corresponding path program 1 times [2018-04-12 18:20:09,174 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-04-12 18:20:09,174 INFO L68 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-04-12 18:20:09,175 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-12 18:20:09,175 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-12 18:20:09,175 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-12 18:20:09,182 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-12 18:20:09,182 WARN L250 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-12 18:20:09,279 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-12 18:20:09,279 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-04-12 18:20:09,280 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-12 18:20:09,285 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-12 18:20:09,304 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-12 18:20:09,306 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-12 18:20:09,348 INFO L700 Elim1Store]: detected not equals via solver [2018-04-12 18:20:09,348 INFO L700 Elim1Store]: detected not equals via solver [2018-04-12 18:20:09,349 INFO L700 Elim1Store]: detected not equals via solver [2018-04-12 18:20:09,349 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 38 [2018-04-12 18:20:09,350 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-12 18:20:09,356 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-12 18:20:09,356 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:26, output treesize:32 [2018-04-12 18:20:09,391 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-12 18:20:09,392 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-04-12 18:20:09,392 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-12 18:20:09,396 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-12 18:20:09,403 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-04-12 18:20:09,403 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:43, output treesize:39 [2018-04-12 18:20:09,446 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 38 treesize of output 37 [2018-04-12 18:20:09,449 INFO L700 Elim1Store]: detected not equals via solver [2018-04-12 18:20:09,450 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 23 [2018-04-12 18:20:09,451 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-12 18:20:09,458 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-12 18:20:09,467 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2018-04-12 18:20:09,468 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:52, output treesize:48 [2018-04-12 18:20:09,496 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 71 treesize of output 48 [2018-04-12 18:20:09,497 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-12 18:20:09,498 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-12 18:20:09,504 INFO L700 Elim1Store]: detected not equals via solver [2018-04-12 18:20:09,505 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 16 [2018-04-12 18:20:09,505 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-04-12 18:20:09,510 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-12 18:20:09,515 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-12 18:20:09,515 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 4 variables, input treesize:76, output treesize:24 [2018-04-12 18:20:09,559 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-12 18:20:09,577 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-04-12 18:20:09,577 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 11] total 22 [2018-04-12 18:20:09,578 INFO L442 AbstractCegarLoop]: Interpolant automaton has 23 states [2018-04-12 18:20:09,578 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2018-04-12 18:20:09,578 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=89, Invalid=417, Unknown=0, NotChecked=0, Total=506 [2018-04-12 18:20:09,578 INFO L87 Difference]: Start difference. First operand 347 states and 386 transitions. Second operand 23 states. [2018-04-12 18:20:10,627 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-12 18:20:10,627 INFO L93 Difference]: Finished difference Result 410 states and 446 transitions. [2018-04-12 18:20:10,627 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2018-04-12 18:20:10,627 INFO L78 Accepts]: Start accepts. Automaton has 23 states. Word has length 56 [2018-04-12 18:20:10,628 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-12 18:20:10,628 INFO L225 Difference]: With dead ends: 410 [2018-04-12 18:20:10,628 INFO L226 Difference]: Without dead ends: 410 [2018-04-12 18:20:10,629 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 96 GetRequests, 49 SyntacticMatches, 1 SemanticMatches, 46 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 512 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=515, Invalid=1741, Unknown=0, NotChecked=0, Total=2256 [2018-04-12 18:20:10,629 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 410 states. [2018-04-12 18:20:10,631 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 410 to 357. [2018-04-12 18:20:10,631 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 357 states. [2018-04-12 18:20:10,631 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 357 states to 357 states and 399 transitions. [2018-04-12 18:20:10,631 INFO L78 Accepts]: Start accepts. Automaton has 357 states and 399 transitions. Word has length 56 [2018-04-12 18:20:10,631 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-12 18:20:10,631 INFO L459 AbstractCegarLoop]: Abstraction has 357 states and 399 transitions. [2018-04-12 18:20:10,631 INFO L460 AbstractCegarLoop]: Interpolant automaton has 23 states. [2018-04-12 18:20:10,631 INFO L276 IsEmpty]: Start isEmpty. Operand 357 states and 399 transitions. [2018-04-12 18:20:10,632 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2018-04-12 18:20:10,632 INFO L347 BasicCegarLoop]: Found error trace [2018-04-12 18:20:10,632 INFO L355 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-12 18:20:10,632 INFO L408 AbstractCegarLoop]: === Iteration 25 === [mainErr51RequiresViolation, mainErr69RequiresViolation, mainErr26RequiresViolation, mainErr54RequiresViolation, mainErr66RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr31RequiresViolation, mainErr46RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr58RequiresViolation, mainErr62RequiresViolation, mainErr15RequiresViolation, mainErr49RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr55RequiresViolation, mainErr65RequiresViolation, mainErr17RequiresViolation, mainErr42RequiresViolation, mainErr71AssertViolationMEMORY_FREE, mainErr30RequiresViolation, mainErr11RequiresViolation, mainErr57RequiresViolation, mainErr63RequiresViolation, mainErr24RequiresViolation, mainErr44RequiresViolation, mainErr10RequiresViolation, mainErr43RequiresViolation, mainErr4RequiresViolation, mainErr50RequiresViolation, mainErr72EnsuresViolationMEMORY_LEAK, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr61RequiresViolation, mainErr59RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr70AssertViolationMEMORY_FREE, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr56RequiresViolation, mainErr64RequiresViolation, mainErr48RequiresViolation, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr52RequiresViolation, mainErr68RequiresViolation, mainErr45RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr60RequiresViolation, mainErr9RequiresViolation, mainErr67RequiresViolation, mainErr53RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr34RequiresViolation, mainErr47RequiresViolation, mainErr14RequiresViolation, mainErr40RequiresViolation]=== [2018-04-12 18:20:10,632 INFO L82 PathProgramCache]: Analyzing trace with hash -1257449239, now seen corresponding path program 1 times [2018-04-12 18:20:10,632 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-04-12 18:20:10,632 INFO L68 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-04-12 18:20:10,633 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-12 18:20:10,634 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-12 18:20:10,634 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-12 18:20:10,646 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-12 18:20:10,647 WARN L250 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-12 18:20:11,051 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-12 18:20:11,052 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-04-12 18:20:11,052 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-12 18:20:11,059 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-12 18:20:11,079 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-12 18:20:11,082 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-12 18:20:11,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-12 18:20:11,120 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-12 18:20:11,128 INFO L700 Elim1Store]: detected not equals via solver [2018-04-12 18:20:11,128 INFO L700 Elim1Store]: detected not equals via solver [2018-04-12 18:20:11,129 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 4 [2018-04-12 18:20:11,129 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-12 18:20:11,133 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-12 18:20:11,134 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:26, output treesize:19 [2018-04-12 18:20:11,154 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-12 18:20:11,161 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-12 18:20:11,161 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-12 18:20:11,163 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-12 18:20:11,172 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-12 18:20:11,173 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select 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-12 18:20:11,173 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-04-12 18:20:11,175 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-12 18:20:11,181 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-12 18:20:11,181 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 3 variables, input treesize:43, output treesize:36 [2018-04-12 18:20:11,226 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-12 18:20:11,227 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select 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-12 18:20:11,227 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-12 18:20:11,232 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-12 18:20:11,244 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-12 18:20:11,245 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 13 [2018-04-12 18:20:11,245 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-04-12 18:20:11,249 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-12 18:20:11,256 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-12 18:20:11,256 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 3 variables, input treesize:78, output treesize:62 [2018-04-12 18:20:11,345 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 82 treesize of output 72 [2018-04-12 18:20:11,351 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-12 18:20:11,351 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 2 xjuncts. [2018-04-12 18:20:11,362 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-04-12 18:20:11,385 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 81 treesize of output 68 [2018-04-12 18:20:11,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 2 case distinctions, treesize of input 20 treesize of output 31 [2018-04-12 18:20:11,391 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 2 xjuncts. [2018-04-12 18:20:11,402 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-04-12 18:20:11,405 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-12 18:20:11,407 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-12 18:20:11,407 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2018-04-12 18:20:11,413 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-12 18:20:11,435 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-12 18:20:11,435 INFO L202 ElimStorePlain]: Needed 7 recursive calls to eliminate 4 variables, input treesize:94, output treesize:135 [2018-04-12 18:20:27,494 WARN L148 SmtUtils]: Spent 16030ms on a formula simplification that was a NOOP. DAG size: 49 [2018-04-12 18:20:43,557 WARN L148 SmtUtils]: Spent 16027ms on a formula simplification that was a NOOP. DAG size: 49 [2018-04-12 18:20:43,575 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 67 treesize of output 66 [2018-04-12 18:20:43,575 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-12 18:20:43,601 INFO L700 Elim1Store]: detected not equals via solver [2018-04-12 18:20:43,602 INFO L700 Elim1Store]: detected not equals via solver [2018-04-12 18:20:43,602 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 89 treesize of output 83 [2018-04-12 18:20:43,602 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-12 18:20:43,621 INFO L700 Elim1Store]: detected not equals via solver [2018-04-12 18:20:43,622 INFO L700 Elim1Store]: detected not equals via solver [2018-04-12 18:20:43,622 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 66 treesize of output 60 [2018-04-12 18:20:43,622 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-04-12 18:20:43,643 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 83 treesize of output 82 [2018-04-12 18:20:43,644 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-04-12 18:20:43,662 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 4 dim-1 vars, End of recursive call: 3 dim-0 vars, and 2 xjuncts. [2018-04-12 18:20:43,662 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 7 variables, input treesize:157, output treesize:143 Received shutdown request... [2018-04-12 18:20:45,706 INFO L175 TraceCheckSpWp]: Timeout while computing interpolants [2018-04-12 18:20:45,706 WARN L519 AbstractCegarLoop]: Verification canceled [2018-04-12 18:20:45,710 WARN L197 ceAbstractionStarter]: Timeout [2018-04-12 18:20:45,710 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 12.04 06:20:45 BoogieIcfgContainer [2018-04-12 18:20:45,710 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-04-12 18:20:45,711 INFO L168 Benchmark]: Toolchain (without parser) took 873297.12 ms. Allocated memory was 403.2 MB in the beginning and 575.7 MB in the end (delta: 172.5 MB). Free memory was 339.3 MB in the beginning and 496.7 MB in the end (delta: -157.5 MB). Peak memory consumption was 15.0 MB. Max. memory is 5.3 GB. [2018-04-12 18:20:45,712 INFO L168 Benchmark]: CDTParser took 0.08 ms. Allocated memory is still 403.2 MB. Free memory is still 363.7 MB. There was no memory consumed. Max. memory is 5.3 GB. [2018-04-12 18:20:45,712 INFO L168 Benchmark]: CACSL2BoogieTranslator took 280.85 ms. Allocated memory is still 403.2 MB. Free memory was 337.9 MB in the beginning and 310.1 MB in the end (delta: 27.9 MB). Peak memory consumption was 27.9 MB. Max. memory is 5.3 GB. [2018-04-12 18:20:45,712 INFO L168 Benchmark]: Boogie Preprocessor took 44.15 ms. Allocated memory is still 403.2 MB. Free memory was 310.1 MB in the beginning and 307.4 MB in the end (delta: 2.6 MB). Peak memory consumption was 2.6 MB. Max. memory is 5.3 GB. [2018-04-12 18:20:45,712 INFO L168 Benchmark]: RCFGBuilder took 564.88 ms. Allocated memory was 403.2 MB in the beginning and 613.4 MB in the end (delta: 210.2 MB). Free memory was 307.4 MB in the beginning and 522.6 MB in the end (delta: -215.1 MB). Peak memory consumption was 23.4 MB. Max. memory is 5.3 GB. [2018-04-12 18:20:45,712 INFO L168 Benchmark]: TraceAbstraction took 872404.51 ms. Allocated memory was 613.4 MB in the beginning and 575.7 MB in the end (delta: -37.7 MB). Free memory was 522.6 MB in the beginning and 496.7 MB in the end (delta: 25.8 MB). There was no memory consumed. Max. memory is 5.3 GB. [2018-04-12 18:20:45,713 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.08 ms. Allocated memory is still 403.2 MB. Free memory is still 363.7 MB. There was no memory consumed. Max. memory is 5.3 GB. * CACSL2BoogieTranslator took 280.85 ms. Allocated memory is still 403.2 MB. Free memory was 337.9 MB in the beginning and 310.1 MB in the end (delta: 27.9 MB). Peak memory consumption was 27.9 MB. Max. memory is 5.3 GB. * Boogie Preprocessor took 44.15 ms. Allocated memory is still 403.2 MB. Free memory was 310.1 MB in the beginning and 307.4 MB in the end (delta: 2.6 MB). Peak memory consumption was 2.6 MB. Max. memory is 5.3 GB. * RCFGBuilder took 564.88 ms. Allocated memory was 403.2 MB in the beginning and 613.4 MB in the end (delta: 210.2 MB). Free memory was 307.4 MB in the beginning and 522.6 MB in the end (delta: -215.1 MB). Peak memory consumption was 23.4 MB. Max. memory is 5.3 GB. * TraceAbstraction took 872404.51 ms. Allocated memory was 613.4 MB in the beginning and 575.7 MB in the end (delta: -37.7 MB). Free memory was 522.6 MB in the beginning and 496.7 MB in the end (delta: 25.8 MB). There was no memory consumed. Max. memory is 5.3 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - TimeoutResultAtElement [Line: 1041]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 1041). Cancelled while BasicCegarLoop was analyzing trace of length 57 with TraceHistMax 2, while TraceCheckSpWp was constructing forward predicates, while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 50. - TimeoutResultAtElement [Line: 1067]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 1067). Cancelled while BasicCegarLoop was analyzing trace of length 57 with TraceHistMax 2, while TraceCheckSpWp was constructing forward predicates, while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 50. - TimeoutResultAtElement [Line: 1021]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 1021). Cancelled while BasicCegarLoop was analyzing trace of length 57 with TraceHistMax 2, while TraceCheckSpWp was constructing forward predicates, while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 50. - TimeoutResultAtElement [Line: 1048]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 1048). Cancelled while BasicCegarLoop was analyzing trace of length 57 with TraceHistMax 2, while TraceCheckSpWp was constructing forward predicates, while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 50. - TimeoutResultAtElement [Line: 1060]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 1060). Cancelled while BasicCegarLoop was analyzing trace of length 57 with TraceHistMax 2, while TraceCheckSpWp was constructing forward predicates, while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 50. - TimeoutResultAtElement [Line: 1011]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 1011). Cancelled while BasicCegarLoop was analyzing trace of length 57 with TraceHistMax 2, while TraceCheckSpWp was constructing forward predicates, while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 50. - TimeoutResultAtElement [Line: 1019]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 1019). Cancelled while BasicCegarLoop was analyzing trace of length 57 with TraceHistMax 2, while TraceCheckSpWp was constructing forward predicates, while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 50. - TimeoutResultAtElement [Line: 1033]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 1033). Cancelled while BasicCegarLoop was analyzing trace of length 57 with TraceHistMax 2, while TraceCheckSpWp was constructing forward predicates, while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 50. - TimeoutResultAtElement [Line: 987]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 987). Cancelled while BasicCegarLoop was analyzing trace of length 57 with TraceHistMax 2, while TraceCheckSpWp was constructing forward predicates, while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 50. - TimeoutResultAtElement [Line: 1026]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 1026). Cancelled while BasicCegarLoop was analyzing trace of length 57 with TraceHistMax 2, while TraceCheckSpWp was constructing forward predicates, while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 50. - TimeoutResultAtElement [Line: 1040]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 1040). Cancelled while BasicCegarLoop was analyzing trace of length 57 with TraceHistMax 2, while TraceCheckSpWp was constructing forward predicates, while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 50. - TimeoutResultAtElement [Line: 1024]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 1024). Cancelled while BasicCegarLoop was analyzing trace of length 57 with TraceHistMax 2, while TraceCheckSpWp was constructing forward predicates, while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 50. - TimeoutResultAtElement [Line: 988]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 988). Cancelled while BasicCegarLoop was analyzing trace of length 57 with TraceHistMax 2, while TraceCheckSpWp was constructing forward predicates, while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 50. - TimeoutResultAtElement [Line: 1051]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 1051). Cancelled while BasicCegarLoop was analyzing trace of length 57 with TraceHistMax 2, while TraceCheckSpWp was constructing forward predicates, while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 50. - TimeoutResultAtElement [Line: 1057]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 1057). Cancelled while BasicCegarLoop was analyzing trace of length 57 with TraceHistMax 2, while TraceCheckSpWp was constructing forward predicates, while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 50. - TimeoutResultAtElement [Line: 1001]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 1001). Cancelled while BasicCegarLoop was analyzing trace of length 57 with TraceHistMax 2, while TraceCheckSpWp was constructing forward predicates, while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 50. - TimeoutResultAtElement [Line: 1041]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 1041). Cancelled while BasicCegarLoop was analyzing trace of length 57 with TraceHistMax 2, while TraceCheckSpWp was constructing forward predicates, while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 50. - TimeoutResultAtElement [Line: 1000]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 1000). Cancelled while BasicCegarLoop was analyzing trace of length 57 with TraceHistMax 2, while TraceCheckSpWp was constructing forward predicates, while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 50. - TimeoutResultAtElement [Line: 998]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 998). Cancelled while BasicCegarLoop was analyzing trace of length 57 with TraceHistMax 2, while TraceCheckSpWp was constructing forward predicates, while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 50. - TimeoutResultAtElement [Line: 1031]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 1031). Cancelled while BasicCegarLoop was analyzing trace of length 57 with TraceHistMax 2, while TraceCheckSpWp was constructing forward predicates, while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 50. - TimeoutResultAtElement [Line: 1048]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 1048). Cancelled while BasicCegarLoop was analyzing trace of length 57 with TraceHistMax 2, while TraceCheckSpWp was constructing forward predicates, while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 50. - TimeoutResultAtElement [Line: 1058]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 1058). Cancelled while BasicCegarLoop was analyzing trace of length 57 with TraceHistMax 2, while TraceCheckSpWp was constructing forward predicates, while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 50. - TimeoutResultAtElement [Line: 1009]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 1009). Cancelled while BasicCegarLoop was analyzing trace of length 57 with TraceHistMax 2, while TraceCheckSpWp was constructing forward predicates, while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 50. - TimeoutResultAtElement [Line: 1036]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 1036). Cancelled while BasicCegarLoop was analyzing trace of length 57 with TraceHistMax 2, while TraceCheckSpWp was constructing forward predicates, while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 50. - TimeoutResultAtElement [Line: 1068]: Timeout (TraceAbstraction) Unable to prove that free always succeeds (line 1068). Cancelled while BasicCegarLoop was analyzing trace of length 57 with TraceHistMax 2, while TraceCheckSpWp was constructing forward predicates, while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 50. - TimeoutResultAtElement [Line: 1026]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 1026). Cancelled while BasicCegarLoop was analyzing trace of length 57 with TraceHistMax 2, while TraceCheckSpWp was constructing forward predicates, while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 50. - TimeoutResultAtElement [Line: 999]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 999). Cancelled while BasicCegarLoop was analyzing trace of length 57 with TraceHistMax 2, while TraceCheckSpWp was constructing forward predicates, while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 50. - TimeoutResultAtElement [Line: 1050]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 1050). Cancelled while BasicCegarLoop was analyzing trace of length 57 with TraceHistMax 2, while TraceCheckSpWp was constructing forward predicates, while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 50. - TimeoutResultAtElement [Line: 1057]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 1057). Cancelled while BasicCegarLoop was analyzing trace of length 57 with TraceHistMax 2, while TraceCheckSpWp was constructing forward predicates, while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 50. - TimeoutResultAtElement [Line: 1019]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 1019). Cancelled while BasicCegarLoop was analyzing trace of length 57 with TraceHistMax 2, while TraceCheckSpWp was constructing forward predicates, while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 50. - TimeoutResultAtElement [Line: 1040]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 1040). Cancelled while BasicCegarLoop was analyzing trace of length 57 with TraceHistMax 2, while TraceCheckSpWp was constructing forward predicates, while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 50. - TimeoutResultAtElement [Line: 999]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 999). Cancelled while BasicCegarLoop was analyzing trace of length 57 with TraceHistMax 2, while TraceCheckSpWp was constructing forward predicates, while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 50. - TimeoutResultAtElement [Line: 1036]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 1036). Cancelled while BasicCegarLoop was analyzing trace of length 57 with TraceHistMax 2, while TraceCheckSpWp was constructing forward predicates, while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 50. - TimeoutResultAtElement [Line: 989]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 989). Cancelled while BasicCegarLoop was analyzing trace of length 57 with TraceHistMax 2, while TraceCheckSpWp was constructing forward predicates, while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 50. - TimeoutResultAtElement [Line: 1041]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 1041). Cancelled while BasicCegarLoop was analyzing trace of length 57 with TraceHistMax 2, while TraceCheckSpWp was constructing forward predicates, while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 50. - TimeoutResultAtElement [Line: 983]: Timeout (TraceAbstraction) Unable to prove that all allocated memory was freed (line 983). Cancelled while BasicCegarLoop was analyzing trace of length 57 with TraceHistMax 2, while TraceCheckSpWp was constructing forward predicates, while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 50. - TimeoutResultAtElement [Line: 1032]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 1032). Cancelled while BasicCegarLoop was analyzing trace of length 57 with TraceHistMax 2, while TraceCheckSpWp was constructing forward predicates, while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 50. - TimeoutResultAtElement [Line: 989]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 989). Cancelled while BasicCegarLoop was analyzing trace of length 57 with TraceHistMax 2, while TraceCheckSpWp was constructing forward predicates, while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 50. - TimeoutResultAtElement [Line: 1000]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 1000). Cancelled while BasicCegarLoop was analyzing trace of length 57 with TraceHistMax 2, while TraceCheckSpWp was constructing forward predicates, while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 50. - TimeoutResultAtElement [Line: 1032]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 1032). Cancelled while BasicCegarLoop was analyzing trace of length 57 with TraceHistMax 2, while TraceCheckSpWp was constructing forward predicates, while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 50. - TimeoutResultAtElement [Line: 1053]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 1053). Cancelled while BasicCegarLoop was analyzing trace of length 57 with TraceHistMax 2, while TraceCheckSpWp was constructing forward predicates, while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 50. - TimeoutResultAtElement [Line: 1051]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 1051). Cancelled while BasicCegarLoop was analyzing trace of length 57 with TraceHistMax 2, while TraceCheckSpWp was constructing forward predicates, while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 50. - TimeoutResultAtElement [Line: 1024]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 1024). Cancelled while BasicCegarLoop was analyzing trace of length 57 with TraceHistMax 2, while TraceCheckSpWp was constructing forward predicates, while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 50. - TimeoutResultAtElement [Line: 1027]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 1027). Cancelled while BasicCegarLoop was analyzing trace of length 57 with TraceHistMax 2, while TraceCheckSpWp was constructing forward predicates, while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 50. - TimeoutResultAtElement [Line: 1068]: Timeout (TraceAbstraction) Unable to prove that free always succeeds (line 1068). Cancelled while BasicCegarLoop was analyzing trace of length 57 with TraceHistMax 2, while TraceCheckSpWp was constructing forward predicates, while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 50. - TimeoutResultAtElement [Line: 1019]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 1019). Cancelled while BasicCegarLoop was analyzing trace of length 57 with TraceHistMax 2, while TraceCheckSpWp was constructing forward predicates, while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 50. - TimeoutResultAtElement [Line: 1034]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 1034). Cancelled while BasicCegarLoop was analyzing trace of length 57 with TraceHistMax 2, while TraceCheckSpWp was constructing forward predicates, while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 50. - TimeoutResultAtElement [Line: 1050]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 1050). Cancelled while BasicCegarLoop was analyzing trace of length 57 with TraceHistMax 2, while TraceCheckSpWp was constructing forward predicates, while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 50. - TimeoutResultAtElement [Line: 1058]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 1058). Cancelled while BasicCegarLoop was analyzing trace of length 57 with TraceHistMax 2, while TraceCheckSpWp was constructing forward predicates, while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 50. - TimeoutResultAtElement [Line: 1041]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 1041). Cancelled while BasicCegarLoop was analyzing trace of length 57 with TraceHistMax 2, while TraceCheckSpWp was constructing forward predicates, while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 50. - TimeoutResultAtElement [Line: 1033]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 1033). Cancelled while BasicCegarLoop was analyzing trace of length 57 with TraceHistMax 2, while TraceCheckSpWp was constructing forward predicates, while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 50. - TimeoutResultAtElement [Line: 1009]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 1009). Cancelled while BasicCegarLoop was analyzing trace of length 57 with TraceHistMax 2, while TraceCheckSpWp was constructing forward predicates, while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 50. - TimeoutResultAtElement [Line: 1019]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 1019). Cancelled while BasicCegarLoop was analyzing trace of length 57 with TraceHistMax 2, while TraceCheckSpWp was constructing forward predicates, while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 50. - TimeoutResultAtElement [Line: 988]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 988). Cancelled while BasicCegarLoop was analyzing trace of length 57 with TraceHistMax 2, while TraceCheckSpWp was constructing forward predicates, while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 50. - TimeoutResultAtElement [Line: 1042]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 1042). Cancelled while BasicCegarLoop was analyzing trace of length 57 with TraceHistMax 2, while TraceCheckSpWp was constructing forward predicates, while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 50. - TimeoutResultAtElement [Line: 1067]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 1067). Cancelled while BasicCegarLoop was analyzing trace of length 57 with TraceHistMax 2, while TraceCheckSpWp was constructing forward predicates, while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 50. - TimeoutResultAtElement [Line: 1040]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 1040). Cancelled while BasicCegarLoop was analyzing trace of length 57 with TraceHistMax 2, while TraceCheckSpWp was constructing forward predicates, while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 50. - TimeoutResultAtElement [Line: 1011]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 1011). Cancelled while BasicCegarLoop was analyzing trace of length 57 with TraceHistMax 2, while TraceCheckSpWp was constructing forward predicates, while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 50. - TimeoutResultAtElement [Line: 1019]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 1019). Cancelled while BasicCegarLoop was analyzing trace of length 57 with TraceHistMax 2, while TraceCheckSpWp was constructing forward predicates, while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 50. - TimeoutResultAtElement [Line: 1027]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 1027). Cancelled while BasicCegarLoop was analyzing trace of length 57 with TraceHistMax 2, while TraceCheckSpWp was constructing forward predicates, while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 50. - TimeoutResultAtElement [Line: 1021]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 1021). Cancelled while BasicCegarLoop was analyzing trace of length 57 with TraceHistMax 2, while TraceCheckSpWp was constructing forward predicates, while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 50. - TimeoutResultAtElement [Line: 987]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 987). Cancelled while BasicCegarLoop was analyzing trace of length 57 with TraceHistMax 2, while TraceCheckSpWp was constructing forward predicates, while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 50. - TimeoutResultAtElement [Line: 1053]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 1053). Cancelled while BasicCegarLoop was analyzing trace of length 57 with TraceHistMax 2, while TraceCheckSpWp was constructing forward predicates, while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 50. - TimeoutResultAtElement [Line: 999]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 999). Cancelled while BasicCegarLoop was analyzing trace of length 57 with TraceHistMax 2, while TraceCheckSpWp was constructing forward predicates, while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 50. - TimeoutResultAtElement [Line: 1060]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 1060). Cancelled while BasicCegarLoop was analyzing trace of length 57 with TraceHistMax 2, while TraceCheckSpWp was constructing forward predicates, while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 50. - TimeoutResultAtElement [Line: 1042]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 1042). Cancelled while BasicCegarLoop was analyzing trace of length 57 with TraceHistMax 2, while TraceCheckSpWp was constructing forward predicates, while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 50. - TimeoutResultAtElement [Line: 998]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 998). Cancelled while BasicCegarLoop was analyzing trace of length 57 with TraceHistMax 2, while TraceCheckSpWp was constructing forward predicates, while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 50. - TimeoutResultAtElement [Line: 1019]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 1019). Cancelled while BasicCegarLoop was analyzing trace of length 57 with TraceHistMax 2, while TraceCheckSpWp was constructing forward predicates, while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 50. - TimeoutResultAtElement [Line: 999]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 999). Cancelled while BasicCegarLoop was analyzing trace of length 57 with TraceHistMax 2, while TraceCheckSpWp was constructing forward predicates, while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 50. - TimeoutResultAtElement [Line: 1031]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 1031). Cancelled while BasicCegarLoop was analyzing trace of length 57 with TraceHistMax 2, while TraceCheckSpWp was constructing forward predicates, while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 50. - TimeoutResultAtElement [Line: 1040]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 1040). Cancelled while BasicCegarLoop was analyzing trace of length 57 with TraceHistMax 2, while TraceCheckSpWp was constructing forward predicates, while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 50. - TimeoutResultAtElement [Line: 1001]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 1001). Cancelled while BasicCegarLoop was analyzing trace of length 57 with TraceHistMax 2, while TraceCheckSpWp was constructing forward predicates, while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 50. - TimeoutResultAtElement [Line: 1034]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 1034). Cancelled while BasicCegarLoop was analyzing trace of length 57 with TraceHistMax 2, while TraceCheckSpWp was constructing forward predicates, while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 50. - StatisticsResult: Ultimate Automizer benchmark data CFG has 3 procedures, 185 locations, 73 error locations. TIMEOUT Result, 872.3s OverallTime, 25 OverallIterations, 3 TraceHistogramMax, 708.7s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 2939 SDtfs, 17211 SDslu, 17320 SDs, 0 SdLazy, 23275 SolverSat, 2186 SolverUnsat, 64 SolverUnknown, 0 SolverNotchecked, 13.1s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 1054 GetRequests, 383 SyntacticMatches, 15 SemanticMatches, 656 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9941 ImplicationChecksByTransitivity, 817.7s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=357occurred in iteration=24, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s AbstIntTime, 0 AbstIntIterations, 0 AbstIntStrong, NaN AbsIntWeakeningRatio, NaN AbsIntAvgWeakeningVarsNumRemoved, NaN AbsIntAvgWeakenedConjuncts, 0.0s DumpTime, AutomataMinimizationStatistics: 0.1s AutomataMinimizationTime, 24 MinimizatonAttempts, 1883 StatesRemovedByMinimization, 22 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.3s SatisfiabilityAnalysisTime, 127.5s InterpolantComputationTime, 1326 NumberOfCodeBlocks, 1326 NumberOfCodeBlocksAsserted, 33 NumberOfCheckSat, 1293 ConstructedInterpolants, 154 QuantifiedInterpolants, 1378394 SizeOfPredicates, 131 NumberOfNonLiveVariables, 1785 ConjunctsInSsa, 316 ConjunctsInUnsatCore, 33 InterpolantComputations, 16 PerfectInterpolantSequences, 33/160 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate could not prove your program: Timeout Written .csv to /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/dll-sorted_true-unreach-call_true-valid-memsafety.i_svcomp-DerefFreeMemtrack-32bit-Automizer_Camel.epf_AutomizerC.xml/Csv-Benchmark-0-2018-04-12_18-20-45-719.csv Written .csv to /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/dll-sorted_true-unreach-call_true-valid-memsafety.i_svcomp-DerefFreeMemtrack-32bit-Automizer_Camel.epf_AutomizerC.xml/Csv-TraceAbstractionBenchmarks-0-2018-04-12_18-20-45-719.csv Completed graceful shutdown