java -Xmx6000000000 -jar ./plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data ./data --generate-csv --csv-dir ../../../releaseScripts/default/UAutomizer-linux/csv -tc ../../../trunk/examples/toolchains/AutomizerC.xml -s ../../../trunk/examples/settings/cade18-smtinterpol/svcomp-DerefFreeMemtrack-32bit-Automizer_SmtInterpol_NoArray.epf -i ../../../trunk/examples/svcomp/forester-heap/dll-queue_true-unreach-call_true-valid-memsafety.i -------------------------------------------------------------------------------- This is Ultimate 0.1.23-666feb3-m [2018-04-10 16:24:58,993 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-04-10 16:24:58,995 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-04-10 16:24:59,007 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-04-10 16:24:59,007 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-04-10 16:24:59,008 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-04-10 16:24:59,008 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-04-10 16:24:59,010 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-04-10 16:24:59,012 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-04-10 16:24:59,012 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-04-10 16:24:59,013 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-04-10 16:24:59,013 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-04-10 16:24:59,014 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-04-10 16:24:59,015 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-04-10 16:24:59,015 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-04-10 16:24:59,017 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-04-10 16:24:59,019 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-04-10 16:24:59,020 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-04-10 16:24:59,021 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-04-10 16:24:59,022 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-04-10 16:24:59,024 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-04-10 16:24:59,024 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-04-10 16:24:59,024 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-04-10 16:24:59,025 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-04-10 16:24:59,026 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-04-10 16:24:59,027 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-04-10 16:24:59,027 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-04-10 16:24:59,028 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-04-10 16:24:59,028 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-04-10 16:24:59,028 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-04-10 16:24:59,028 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-04-10 16:24:59,029 INFO L98 SettingsManager]: Beginning loading settings from /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/cade18-smtinterpol/svcomp-DerefFreeMemtrack-32bit-Automizer_SmtInterpol_NoArray.epf [2018-04-10 16:24:59,046 INFO L110 SettingsManager]: Loading preferences was successful [2018-04-10 16:24:59,046 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-04-10 16:24:59,047 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-04-10 16:24:59,047 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-04-10 16:24:59,048 INFO L133 SettingsManager]: * Use SBE=true [2018-04-10 16:24:59,048 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-04-10 16:24:59,048 INFO L133 SettingsManager]: * sizeof long=4 [2018-04-10 16:24:59,048 INFO L133 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2018-04-10 16:24:59,048 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-04-10 16:24:59,048 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-04-10 16:24:59,048 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-04-10 16:24:59,048 INFO L133 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2018-04-10 16:24:59,048 INFO L133 SettingsManager]: * Bitprecise bitfields=true [2018-04-10 16:24:59,048 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-04-10 16:24:59,049 INFO L133 SettingsManager]: * sizeof long double=12 [2018-04-10 16:24:59,049 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-04-10 16:24:59,049 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-04-10 16:24:59,049 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-04-10 16:24:59,049 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-04-10 16:24:59,049 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-04-10 16:24:59,049 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-04-10 16:24:59,049 INFO L133 SettingsManager]: * Interpolant automaton=TWOTRACK [2018-04-10 16:24:59,049 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-04-10 16:24:59,050 INFO L133 SettingsManager]: * Trace refinement strategy=SMTINTERPOL [2018-04-10 16:24:59,078 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-04-10 16:24:59,089 INFO L266 ainManager$Toolchain]: [Toolchain 1]: Parser(s) successfully (re)initialized [2018-04-10 16:24:59,092 INFO L222 ainManager$Toolchain]: [Toolchain 1]: Toolchain data selected. [2018-04-10 16:24:59,094 INFO L271 PluginConnector]: Initializing CDTParser... [2018-04-10 16:24:59,094 INFO L276 PluginConnector]: CDTParser initialized [2018-04-10 16:24:59,095 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/forester-heap/dll-queue_true-unreach-call_true-valid-memsafety.i [2018-04-10 16:24:59,382 INFO L225 CDTParser]: Created temporary CDT project at /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/data/FLAG67f446fed [2018-04-10 16:24:59,557 INFO L287 CDTParser]: IsIndexed: true [2018-04-10 16:24:59,557 INFO L288 CDTParser]: Found 1 translation units. [2018-04-10 16:24:59,558 INFO L168 CDTParser]: Scanning dll-queue_true-unreach-call_true-valid-memsafety.i [2018-04-10 16:24:59,564 INFO L210 ultiparseSymbolTable]: Include resolver: [2018-04-10 16:24:59,565 INFO L215 ultiparseSymbolTable]: [2018-04-10 16:24:59,565 INFO L218 ultiparseSymbolTable]: Function table: [2018-04-10 16:24:59,565 INFO L221 ultiparseSymbolTable]: Function definition of null ('main') in dll-queue_true-unreach-call_true-valid-memsafety.i [2018-04-10 16:24:59,565 INFO L227 ultiparseSymbolTable]: Global variable table: [2018-04-10 16:24:59,565 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fdll_queue_true_unreach_call_true_valid_memsafety_i__timer_t in dll-queue_true-unreach-call_true-valid-memsafety.i [2018-04-10 16:24:59,565 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fdll_queue_true_unreach_call_true_valid_memsafety_i____int8_t in dll-queue_true-unreach-call_true-valid-memsafety.i [2018-04-10 16:24:59,565 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fdll_queue_true_unreach_call_true_valid_memsafety_i____fsblkcnt64_t in dll-queue_true-unreach-call_true-valid-memsafety.i [2018-04-10 16:24:59,565 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fdll_queue_true_unreach_call_true_valid_memsafety_i____fsword_t in dll-queue_true-unreach-call_true-valid-memsafety.i [2018-04-10 16:24:59,565 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fdll_queue_true_unreach_call_true_valid_memsafety_i__ssize_t in dll-queue_true-unreach-call_true-valid-memsafety.i [2018-04-10 16:24:59,565 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fdll_queue_true_unreach_call_true_valid_memsafety_i__pthread_once_t in dll-queue_true-unreach-call_true-valid-memsafety.i [2018-04-10 16:24:59,566 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fdll_queue_true_unreach_call_true_valid_memsafety_i__u_short in dll-queue_true-unreach-call_true-valid-memsafety.i [2018-04-10 16:24:59,566 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fdll_queue_true_unreach_call_true_valid_memsafety_i__wchar_t in dll-queue_true-unreach-call_true-valid-memsafety.i [2018-04-10 16:24:59,566 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fdll_queue_true_unreach_call_true_valid_memsafety_i__int8_t in dll-queue_true-unreach-call_true-valid-memsafety.i [2018-04-10 16:24:59,566 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fdll_queue_true_unreach_call_true_valid_memsafety_i__ino_t in dll-queue_true-unreach-call_true-valid-memsafety.i [2018-04-10 16:24:59,566 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fdll_queue_true_unreach_call_true_valid_memsafety_i____intptr_t in dll-queue_true-unreach-call_true-valid-memsafety.i [2018-04-10 16:24:59,566 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fdll_queue_true_unreach_call_true_valid_memsafety_i__u_int64_t in dll-queue_true-unreach-call_true-valid-memsafety.i [2018-04-10 16:24:59,566 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fdll_queue_true_unreach_call_true_valid_memsafety_i__loff_t in dll-queue_true-unreach-call_true-valid-memsafety.i [2018-04-10 16:24:59,566 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fdll_queue_true_unreach_call_true_valid_memsafety_i____int64_t in dll-queue_true-unreach-call_true-valid-memsafety.i [2018-04-10 16:24:59,566 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fdll_queue_true_unreach_call_true_valid_memsafety_i__size_t in dll-queue_true-unreach-call_true-valid-memsafety.i [2018-04-10 16:24:59,566 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fdll_queue_true_unreach_call_true_valid_memsafety_i__ldiv_t in dll-queue_true-unreach-call_true-valid-memsafety.i [2018-04-10 16:24:59,566 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fdll_queue_true_unreach_call_true_valid_memsafety_i__off_t in dll-queue_true-unreach-call_true-valid-memsafety.i [2018-04-10 16:24:59,566 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fdll_queue_true_unreach_call_true_valid_memsafety_i____u_int in dll-queue_true-unreach-call_true-valid-memsafety.i [2018-04-10 16:24:59,566 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fdll_queue_true_unreach_call_true_valid_memsafety_i__pthread_mutex_t in dll-queue_true-unreach-call_true-valid-memsafety.i [2018-04-10 16:24:59,566 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fdll_queue_true_unreach_call_true_valid_memsafety_i____useconds_t in dll-queue_true-unreach-call_true-valid-memsafety.i [2018-04-10 16:24:59,566 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fdll_queue_true_unreach_call_true_valid_memsafety_i____fsfilcnt64_t in dll-queue_true-unreach-call_true-valid-memsafety.i [2018-04-10 16:24:59,566 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fdll_queue_true_unreach_call_true_valid_memsafety_i____socklen_t in dll-queue_true-unreach-call_true-valid-memsafety.i [2018-04-10 16:24:59,566 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fdll_queue_true_unreach_call_true_valid_memsafety_i__pthread_attr_t in dll-queue_true-unreach-call_true-valid-memsafety.i [2018-04-10 16:24:59,566 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fdll_queue_true_unreach_call_true_valid_memsafety_i__register_t in dll-queue_true-unreach-call_true-valid-memsafety.i [2018-04-10 16:24:59,567 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fdll_queue_true_unreach_call_true_valid_memsafety_i__quad_t in dll-queue_true-unreach-call_true-valid-memsafety.i [2018-04-10 16:24:59,567 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fdll_queue_true_unreach_call_true_valid_memsafety_i__caddr_t in dll-queue_true-unreach-call_true-valid-memsafety.i [2018-04-10 16:24:59,567 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fdll_queue_true_unreach_call_true_valid_memsafety_i__fsid_t in dll-queue_true-unreach-call_true-valid-memsafety.i [2018-04-10 16:24:59,567 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fdll_queue_true_unreach_call_true_valid_memsafety_i____clockid_t in dll-queue_true-unreach-call_true-valid-memsafety.i [2018-04-10 16:24:59,567 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fdll_queue_true_unreach_call_true_valid_memsafety_i__SLL in dll-queue_true-unreach-call_true-valid-memsafety.i [2018-04-10 16:24:59,567 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fdll_queue_true_unreach_call_true_valid_memsafety_i__div_t in dll-queue_true-unreach-call_true-valid-memsafety.i [2018-04-10 16:24:59,567 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fdll_queue_true_unreach_call_true_valid_memsafety_i____clock_t in dll-queue_true-unreach-call_true-valid-memsafety.i [2018-04-10 16:24:59,567 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fdll_queue_true_unreach_call_true_valid_memsafety_i____loff_t in dll-queue_true-unreach-call_true-valid-memsafety.i [2018-04-10 16:24:59,567 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fdll_queue_true_unreach_call_true_valid_memsafety_i__pthread_cond_t in dll-queue_true-unreach-call_true-valid-memsafety.i [2018-04-10 16:24:59,567 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fdll_queue_true_unreach_call_true_valid_memsafety_i____uint8_t in dll-queue_true-unreach-call_true-valid-memsafety.i [2018-04-10 16:24:59,567 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fdll_queue_true_unreach_call_true_valid_memsafety_i____key_t in dll-queue_true-unreach-call_true-valid-memsafety.i [2018-04-10 16:24:59,567 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fdll_queue_true_unreach_call_true_valid_memsafety_i__u_int16_t in dll-queue_true-unreach-call_true-valid-memsafety.i [2018-04-10 16:24:59,568 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fdll_queue_true_unreach_call_true_valid_memsafety_i__ushort in dll-queue_true-unreach-call_true-valid-memsafety.i [2018-04-10 16:24:59,568 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fdll_queue_true_unreach_call_true_valid_memsafety_i____ino_t in dll-queue_true-unreach-call_true-valid-memsafety.i [2018-04-10 16:24:59,568 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fdll_queue_true_unreach_call_true_valid_memsafety_i____time_t in dll-queue_true-unreach-call_true-valid-memsafety.i [2018-04-10 16:24:59,568 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fdll_queue_true_unreach_call_true_valid_memsafety_i____uint32_t in dll-queue_true-unreach-call_true-valid-memsafety.i [2018-04-10 16:24:59,568 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fdll_queue_true_unreach_call_true_valid_memsafety_i__pthread_condattr_t in dll-queue_true-unreach-call_true-valid-memsafety.i [2018-04-10 16:24:59,568 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fdll_queue_true_unreach_call_true_valid_memsafety_i__int64_t in dll-queue_true-unreach-call_true-valid-memsafety.i [2018-04-10 16:24:59,568 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fdll_queue_true_unreach_call_true_valid_memsafety_i____sigset_t in dll-queue_true-unreach-call_true-valid-memsafety.i [2018-04-10 16:24:59,568 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fdll_queue_true_unreach_call_true_valid_memsafety_i____rlim64_t in dll-queue_true-unreach-call_true-valid-memsafety.i [2018-04-10 16:24:59,568 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fdll_queue_true_unreach_call_true_valid_memsafety_i____fsfilcnt_t in dll-queue_true-unreach-call_true-valid-memsafety.i [2018-04-10 16:24:59,568 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fdll_queue_true_unreach_call_true_valid_memsafety_i__pthread_spinlock_t in dll-queue_true-unreach-call_true-valid-memsafety.i [2018-04-10 16:24:59,568 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fdll_queue_true_unreach_call_true_valid_memsafety_i____daddr_t in dll-queue_true-unreach-call_true-valid-memsafety.i [2018-04-10 16:24:59,569 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fdll_queue_true_unreach_call_true_valid_memsafety_i____mode_t in dll-queue_true-unreach-call_true-valid-memsafety.i [2018-04-10 16:24:59,569 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fdll_queue_true_unreach_call_true_valid_memsafety_i____fsid_t in dll-queue_true-unreach-call_true-valid-memsafety.i [2018-04-10 16:24:59,569 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fdll_queue_true_unreach_call_true_valid_memsafety_i____uint16_t in dll-queue_true-unreach-call_true-valid-memsafety.i [2018-04-10 16:24:59,569 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fdll_queue_true_unreach_call_true_valid_memsafety_i____dev_t in dll-queue_true-unreach-call_true-valid-memsafety.i [2018-04-10 16:24:59,569 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fdll_queue_true_unreach_call_true_valid_memsafety_i__fd_set in dll-queue_true-unreach-call_true-valid-memsafety.i [2018-04-10 16:24:59,569 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fdll_queue_true_unreach_call_true_valid_memsafety_i__pid_t in dll-queue_true-unreach-call_true-valid-memsafety.i [2018-04-10 16:24:59,569 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fdll_queue_true_unreach_call_true_valid_memsafety_i__u_long in dll-queue_true-unreach-call_true-valid-memsafety.i [2018-04-10 16:24:59,569 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fdll_queue_true_unreach_call_true_valid_memsafety_i__daddr_t in dll-queue_true-unreach-call_true-valid-memsafety.i [2018-04-10 16:24:59,569 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fdll_queue_true_unreach_call_true_valid_memsafety_i__gid_t in dll-queue_true-unreach-call_true-valid-memsafety.i [2018-04-10 16:24:59,570 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fdll_queue_true_unreach_call_true_valid_memsafety_i____caddr_t in dll-queue_true-unreach-call_true-valid-memsafety.i [2018-04-10 16:24:59,570 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fdll_queue_true_unreach_call_true_valid_memsafety_i____u_short in dll-queue_true-unreach-call_true-valid-memsafety.i [2018-04-10 16:24:59,570 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fdll_queue_true_unreach_call_true_valid_memsafety_i__clock_t in dll-queue_true-unreach-call_true-valid-memsafety.i [2018-04-10 16:24:59,570 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fdll_queue_true_unreach_call_true_valid_memsafety_i__mode_t in dll-queue_true-unreach-call_true-valid-memsafety.i [2018-04-10 16:24:59,570 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fdll_queue_true_unreach_call_true_valid_memsafety_i__suseconds_t in dll-queue_true-unreach-call_true-valid-memsafety.i [2018-04-10 16:24:59,570 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fdll_queue_true_unreach_call_true_valid_memsafety_i__sigset_t in dll-queue_true-unreach-call_true-valid-memsafety.i [2018-04-10 16:24:59,570 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fdll_queue_true_unreach_call_true_valid_memsafety_i__pthread_barrierattr_t in dll-queue_true-unreach-call_true-valid-memsafety.i [2018-04-10 16:24:59,570 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fdll_queue_true_unreach_call_true_valid_memsafety_i__blkcnt_t in dll-queue_true-unreach-call_true-valid-memsafety.i [2018-04-10 16:24:59,570 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fdll_queue_true_unreach_call_true_valid_memsafety_i__u_int32_t in dll-queue_true-unreach-call_true-valid-memsafety.i [2018-04-10 16:24:59,571 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fdll_queue_true_unreach_call_true_valid_memsafety_i____u_long in dll-queue_true-unreach-call_true-valid-memsafety.i [2018-04-10 16:24:59,571 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fdll_queue_true_unreach_call_true_valid_memsafety_i__u_char in dll-queue_true-unreach-call_true-valid-memsafety.i [2018-04-10 16:24:59,571 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fdll_queue_true_unreach_call_true_valid_memsafety_i__ulong in dll-queue_true-unreach-call_true-valid-memsafety.i [2018-04-10 16:24:59,571 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fdll_queue_true_unreach_call_true_valid_memsafety_i__u_quad_t in dll-queue_true-unreach-call_true-valid-memsafety.i [2018-04-10 16:24:59,571 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fdll_queue_true_unreach_call_true_valid_memsafety_i____int16_t in dll-queue_true-unreach-call_true-valid-memsafety.i [2018-04-10 16:24:59,571 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fdll_queue_true_unreach_call_true_valid_memsafety_i____blksize_t in dll-queue_true-unreach-call_true-valid-memsafety.i [2018-04-10 16:24:59,571 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fdll_queue_true_unreach_call_true_valid_memsafety_i__blksize_t in dll-queue_true-unreach-call_true-valid-memsafety.i [2018-04-10 16:24:59,571 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fdll_queue_true_unreach_call_true_valid_memsafety_i____qaddr_t in dll-queue_true-unreach-call_true-valid-memsafety.i [2018-04-10 16:24:59,571 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fdll_queue_true_unreach_call_true_valid_memsafety_i____quad_t in dll-queue_true-unreach-call_true-valid-memsafety.i [2018-04-10 16:24:59,571 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fdll_queue_true_unreach_call_true_valid_memsafety_i__int16_t in dll-queue_true-unreach-call_true-valid-memsafety.i [2018-04-10 16:24:59,571 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fdll_queue_true_unreach_call_true_valid_memsafety_i____fsblkcnt_t in dll-queue_true-unreach-call_true-valid-memsafety.i [2018-04-10 16:24:59,571 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fdll_queue_true_unreach_call_true_valid_memsafety_i____u_char in dll-queue_true-unreach-call_true-valid-memsafety.i [2018-04-10 16:24:59,572 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fdll_queue_true_unreach_call_true_valid_memsafety_i__pthread_key_t in dll-queue_true-unreach-call_true-valid-memsafety.i [2018-04-10 16:24:59,572 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fdll_queue_true_unreach_call_true_valid_memsafety_i____u_quad_t in dll-queue_true-unreach-call_true-valid-memsafety.i [2018-04-10 16:24:59,572 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fdll_queue_true_unreach_call_true_valid_memsafety_i____off64_t in dll-queue_true-unreach-call_true-valid-memsafety.i [2018-04-10 16:24:59,572 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fdll_queue_true_unreach_call_true_valid_memsafety_i__pthread_rwlock_t in dll-queue_true-unreach-call_true-valid-memsafety.i [2018-04-10 16:24:59,572 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fdll_queue_true_unreach_call_true_valid_memsafety_i____syscall_slong_t in dll-queue_true-unreach-call_true-valid-memsafety.i [2018-04-10 16:24:59,572 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fdll_queue_true_unreach_call_true_valid_memsafety_i__time_t in dll-queue_true-unreach-call_true-valid-memsafety.i [2018-04-10 16:24:59,572 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fdll_queue_true_unreach_call_true_valid_memsafety_i__pthread_barrier_t in dll-queue_true-unreach-call_true-valid-memsafety.i [2018-04-10 16:24:59,572 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fdll_queue_true_unreach_call_true_valid_memsafety_i__uid_t in dll-queue_true-unreach-call_true-valid-memsafety.i [2018-04-10 16:24:59,572 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fdll_queue_true_unreach_call_true_valid_memsafety_i__lldiv_t in dll-queue_true-unreach-call_true-valid-memsafety.i [2018-04-10 16:24:59,572 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fdll_queue_true_unreach_call_true_valid_memsafety_i____rlim_t in dll-queue_true-unreach-call_true-valid-memsafety.i [2018-04-10 16:24:59,573 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fdll_queue_true_unreach_call_true_valid_memsafety_i__clockid_t in dll-queue_true-unreach-call_true-valid-memsafety.i [2018-04-10 16:24:59,573 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fdll_queue_true_unreach_call_true_valid_memsafety_i____int32_t in dll-queue_true-unreach-call_true-valid-memsafety.i [2018-04-10 16:24:59,573 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fdll_queue_true_unreach_call_true_valid_memsafety_i____suseconds_t in dll-queue_true-unreach-call_true-valid-memsafety.i [2018-04-10 16:24:59,573 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fdll_queue_true_unreach_call_true_valid_memsafety_i____pthread_slist_t in dll-queue_true-unreach-call_true-valid-memsafety.i [2018-04-10 16:24:59,573 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fdll_queue_true_unreach_call_true_valid_memsafety_i____blkcnt_t in dll-queue_true-unreach-call_true-valid-memsafety.i [2018-04-10 16:24:59,573 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fdll_queue_true_unreach_call_true_valid_memsafety_i__dev_t in dll-queue_true-unreach-call_true-valid-memsafety.i [2018-04-10 16:24:59,573 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fdll_queue_true_unreach_call_true_valid_memsafety_i__pthread_mutexattr_t in dll-queue_true-unreach-call_true-valid-memsafety.i [2018-04-10 16:24:59,573 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fdll_queue_true_unreach_call_true_valid_memsafety_i____pid_t in dll-queue_true-unreach-call_true-valid-memsafety.i [2018-04-10 16:24:59,573 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fdll_queue_true_unreach_call_true_valid_memsafety_i____timer_t in dll-queue_true-unreach-call_true-valid-memsafety.i [2018-04-10 16:24:59,573 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fdll_queue_true_unreach_call_true_valid_memsafety_i__fsblkcnt_t in dll-queue_true-unreach-call_true-valid-memsafety.i [2018-04-10 16:24:59,573 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fdll_queue_true_unreach_call_true_valid_memsafety_i____gid_t in dll-queue_true-unreach-call_true-valid-memsafety.i [2018-04-10 16:24:59,574 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fdll_queue_true_unreach_call_true_valid_memsafety_i__id_t in dll-queue_true-unreach-call_true-valid-memsafety.i [2018-04-10 16:24:59,574 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fdll_queue_true_unreach_call_true_valid_memsafety_i__u_int in dll-queue_true-unreach-call_true-valid-memsafety.i [2018-04-10 16:24:59,574 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fdll_queue_true_unreach_call_true_valid_memsafety_i____ssize_t in dll-queue_true-unreach-call_true-valid-memsafety.i [2018-04-10 16:24:59,574 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fdll_queue_true_unreach_call_true_valid_memsafety_i__nlink_t in dll-queue_true-unreach-call_true-valid-memsafety.i [2018-04-10 16:24:59,574 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fdll_queue_true_unreach_call_true_valid_memsafety_i__pthread_t in dll-queue_true-unreach-call_true-valid-memsafety.i [2018-04-10 16:24:59,574 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fdll_queue_true_unreach_call_true_valid_memsafety_i____id_t in dll-queue_true-unreach-call_true-valid-memsafety.i [2018-04-10 16:24:59,574 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fdll_queue_true_unreach_call_true_valid_memsafety_i____fd_mask in dll-queue_true-unreach-call_true-valid-memsafety.i [2018-04-10 16:24:59,574 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fdll_queue_true_unreach_call_true_valid_memsafety_i____ino64_t in dll-queue_true-unreach-call_true-valid-memsafety.i [2018-04-10 16:24:59,574 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fdll_queue_true_unreach_call_true_valid_memsafety_i____off_t in dll-queue_true-unreach-call_true-valid-memsafety.i [2018-04-10 16:24:59,574 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fdll_queue_true_unreach_call_true_valid_memsafety_i__fsfilcnt_t in dll-queue_true-unreach-call_true-valid-memsafety.i [2018-04-10 16:24:59,575 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fdll_queue_true_unreach_call_true_valid_memsafety_i__uint in dll-queue_true-unreach-call_true-valid-memsafety.i [2018-04-10 16:24:59,575 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fdll_queue_true_unreach_call_true_valid_memsafety_i____syscall_ulong_t in dll-queue_true-unreach-call_true-valid-memsafety.i [2018-04-10 16:24:59,575 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fdll_queue_true_unreach_call_true_valid_memsafety_i__u_int8_t in dll-queue_true-unreach-call_true-valid-memsafety.i [2018-04-10 16:24:59,575 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fdll_queue_true_unreach_call_true_valid_memsafety_i____uid_t in dll-queue_true-unreach-call_true-valid-memsafety.i [2018-04-10 16:24:59,575 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fdll_queue_true_unreach_call_true_valid_memsafety_i____uint64_t in dll-queue_true-unreach-call_true-valid-memsafety.i [2018-04-10 16:24:59,575 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fdll_queue_true_unreach_call_true_valid_memsafety_i__pthread_rwlockattr_t in dll-queue_true-unreach-call_true-valid-memsafety.i [2018-04-10 16:24:59,575 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fdll_queue_true_unreach_call_true_valid_memsafety_i____blkcnt64_t in dll-queue_true-unreach-call_true-valid-memsafety.i [2018-04-10 16:24:59,575 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fdll_queue_true_unreach_call_true_valid_memsafety_i__fd_mask in dll-queue_true-unreach-call_true-valid-memsafety.i [2018-04-10 16:24:59,575 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fdll_queue_true_unreach_call_true_valid_memsafety_i____nlink_t in dll-queue_true-unreach-call_true-valid-memsafety.i [2018-04-10 16:24:59,575 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fdll_queue_true_unreach_call_true_valid_memsafety_i__key_t in dll-queue_true-unreach-call_true-valid-memsafety.i [2018-04-10 16:24:59,575 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fdll_queue_true_unreach_call_true_valid_memsafety_i____sig_atomic_t in dll-queue_true-unreach-call_true-valid-memsafety.i [2018-04-10 16:24:59,575 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fdll_queue_true_unreach_call_true_valid_memsafety_i__int32_t in dll-queue_true-unreach-call_true-valid-memsafety.i [2018-04-10 16:24:59,576 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fdll_queue_true_unreach_call_true_valid_memsafety_i__idtype_t in dll-queue_true-unreach-call_true-valid-memsafety.i [2018-04-10 16:24:59,591 INFO L330 CDTParser]: Deleted temporary CDT project at /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/data/FLAG67f446fed [2018-04-10 16:24:59,594 INFO L304 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-04-10 16:24:59,595 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2018-04-10 16:24:59,596 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-04-10 16:24:59,596 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-04-10 16:24:59,600 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-04-10 16:24:59,601 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.04 04:24:59" (1/1) ... [2018-04-10 16:24:59,603 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@5e3b12e7 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.04 04:24:59, skipping insertion in model container [2018-04-10 16:24:59,603 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.04 04:24:59" (1/1) ... [2018-04-10 16:24:59,614 INFO L167 Dispatcher]: Using SV-COMP mode [2018-04-10 16:24:59,642 INFO L167 Dispatcher]: Using SV-COMP mode [2018-04-10 16:24:59,782 INFO L175 PostProcessor]: Settings: Checked method=main [2018-04-10 16:24:59,821 INFO L175 PostProcessor]: Settings: Checked method=main [2018-04-10 16:24:59,827 INFO L100 SccComputation]: Graph consists of 0 InCaSumBalls and 115 non ball SCCs. Number of states in SCCs 115. [2018-04-10 16:24:59,865 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.04 04:24:59 WrapperNode [2018-04-10 16:24:59,866 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-04-10 16:24:59,866 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-04-10 16:24:59,866 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-04-10 16:24:59,866 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-04-10 16:24:59,875 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.04 04:24:59" (1/1) ... [2018-04-10 16:24:59,875 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.04 04:24:59" (1/1) ... [2018-04-10 16:24:59,888 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.04 04:24:59" (1/1) ... [2018-04-10 16:24:59,888 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.04 04:24:59" (1/1) ... [2018-04-10 16:24:59,898 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.04 04:24:59" (1/1) ... [2018-04-10 16:24:59,906 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.04 04:24:59" (1/1) ... [2018-04-10 16:24:59,908 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.04 04:24:59" (1/1) ... [2018-04-10 16:24:59,912 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-04-10 16:24:59,913 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-04-10 16:24:59,913 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-04-10 16:24:59,913 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-04-10 16:24:59,914 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.04 04:24:59" (1/1) ... No working directory specified, using /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-04-10 16:25:00,014 INFO L136 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-04-10 16:25:00,015 INFO L136 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-04-10 16:25:00,015 INFO L136 BoogieDeclarations]: Found implementation of procedure main [2018-04-10 16:25:00,015 INFO L128 BoogieDeclarations]: Found specification of procedure __ctype_get_mb_cur_max [2018-04-10 16:25:00,015 INFO L128 BoogieDeclarations]: Found specification of procedure atof [2018-04-10 16:25:00,015 INFO L128 BoogieDeclarations]: Found specification of procedure atoi [2018-04-10 16:25:00,015 INFO L128 BoogieDeclarations]: Found specification of procedure atol [2018-04-10 16:25:00,015 INFO L128 BoogieDeclarations]: Found specification of procedure atoll [2018-04-10 16:25:00,015 INFO L128 BoogieDeclarations]: Found specification of procedure strtod [2018-04-10 16:25:00,015 INFO L128 BoogieDeclarations]: Found specification of procedure strtof [2018-04-10 16:25:00,015 INFO L128 BoogieDeclarations]: Found specification of procedure strtold [2018-04-10 16:25:00,015 INFO L128 BoogieDeclarations]: Found specification of procedure strtol [2018-04-10 16:25:00,015 INFO L128 BoogieDeclarations]: Found specification of procedure strtoul [2018-04-10 16:25:00,015 INFO L128 BoogieDeclarations]: Found specification of procedure strtoq [2018-04-10 16:25:00,015 INFO L128 BoogieDeclarations]: Found specification of procedure strtouq [2018-04-10 16:25:00,016 INFO L128 BoogieDeclarations]: Found specification of procedure strtoll [2018-04-10 16:25:00,016 INFO L128 BoogieDeclarations]: Found specification of procedure strtoull [2018-04-10 16:25:00,016 INFO L128 BoogieDeclarations]: Found specification of procedure l64a [2018-04-10 16:25:00,016 INFO L128 BoogieDeclarations]: Found specification of procedure a64l [2018-04-10 16:25:00,016 INFO L128 BoogieDeclarations]: Found specification of procedure select [2018-04-10 16:25:00,016 INFO L128 BoogieDeclarations]: Found specification of procedure pselect [2018-04-10 16:25:00,016 INFO L128 BoogieDeclarations]: Found specification of procedure gnu_dev_major [2018-04-10 16:25:00,016 INFO L128 BoogieDeclarations]: Found specification of procedure gnu_dev_minor [2018-04-10 16:25:00,016 INFO L128 BoogieDeclarations]: Found specification of procedure gnu_dev_makedev [2018-04-10 16:25:00,017 INFO L128 BoogieDeclarations]: Found specification of procedure random [2018-04-10 16:25:00,017 INFO L128 BoogieDeclarations]: Found specification of procedure srandom [2018-04-10 16:25:00,017 INFO L128 BoogieDeclarations]: Found specification of procedure initstate [2018-04-10 16:25:00,017 INFO L128 BoogieDeclarations]: Found specification of procedure setstate [2018-04-10 16:25:00,017 INFO L128 BoogieDeclarations]: Found specification of procedure random_r [2018-04-10 16:25:00,017 INFO L128 BoogieDeclarations]: Found specification of procedure srandom_r [2018-04-10 16:25:00,017 INFO L128 BoogieDeclarations]: Found specification of procedure initstate_r [2018-04-10 16:25:00,017 INFO L128 BoogieDeclarations]: Found specification of procedure setstate_r [2018-04-10 16:25:00,017 INFO L128 BoogieDeclarations]: Found specification of procedure rand [2018-04-10 16:25:00,018 INFO L128 BoogieDeclarations]: Found specification of procedure srand [2018-04-10 16:25:00,018 INFO L128 BoogieDeclarations]: Found specification of procedure rand_r [2018-04-10 16:25:00,018 INFO L128 BoogieDeclarations]: Found specification of procedure drand48 [2018-04-10 16:25:00,018 INFO L128 BoogieDeclarations]: Found specification of procedure erand48 [2018-04-10 16:25:00,018 INFO L128 BoogieDeclarations]: Found specification of procedure lrand48 [2018-04-10 16:25:00,018 INFO L128 BoogieDeclarations]: Found specification of procedure nrand48 [2018-04-10 16:25:00,018 INFO L128 BoogieDeclarations]: Found specification of procedure mrand48 [2018-04-10 16:25:00,018 INFO L128 BoogieDeclarations]: Found specification of procedure jrand48 [2018-04-10 16:25:00,018 INFO L128 BoogieDeclarations]: Found specification of procedure srand48 [2018-04-10 16:25:00,019 INFO L128 BoogieDeclarations]: Found specification of procedure seed48 [2018-04-10 16:25:00,019 INFO L128 BoogieDeclarations]: Found specification of procedure lcong48 [2018-04-10 16:25:00,019 INFO L128 BoogieDeclarations]: Found specification of procedure drand48_r [2018-04-10 16:25:00,019 INFO L128 BoogieDeclarations]: Found specification of procedure erand48_r [2018-04-10 16:25:00,019 INFO L128 BoogieDeclarations]: Found specification of procedure lrand48_r [2018-04-10 16:25:00,019 INFO L128 BoogieDeclarations]: Found specification of procedure nrand48_r [2018-04-10 16:25:00,019 INFO L128 BoogieDeclarations]: Found specification of procedure mrand48_r [2018-04-10 16:25:00,019 INFO L128 BoogieDeclarations]: Found specification of procedure jrand48_r [2018-04-10 16:25:00,019 INFO L128 BoogieDeclarations]: Found specification of procedure srand48_r [2018-04-10 16:25:00,019 INFO L128 BoogieDeclarations]: Found specification of procedure seed48_r [2018-04-10 16:25:00,020 INFO L128 BoogieDeclarations]: Found specification of procedure lcong48_r [2018-04-10 16:25:00,020 INFO L128 BoogieDeclarations]: Found specification of procedure malloc [2018-04-10 16:25:00,020 INFO L128 BoogieDeclarations]: Found specification of procedure calloc [2018-04-10 16:25:00,020 INFO L128 BoogieDeclarations]: Found specification of procedure realloc [2018-04-10 16:25:00,020 INFO L128 BoogieDeclarations]: Found specification of procedure free [2018-04-10 16:25:00,021 INFO L128 BoogieDeclarations]: Found specification of procedure cfree [2018-04-10 16:25:00,021 INFO L128 BoogieDeclarations]: Found specification of procedure alloca [2018-04-10 16:25:00,021 INFO L128 BoogieDeclarations]: Found specification of procedure valloc [2018-04-10 16:25:00,021 INFO L128 BoogieDeclarations]: Found specification of procedure posix_memalign [2018-04-10 16:25:00,021 INFO L128 BoogieDeclarations]: Found specification of procedure aligned_alloc [2018-04-10 16:25:00,021 INFO L128 BoogieDeclarations]: Found specification of procedure abort [2018-04-10 16:25:00,021 INFO L128 BoogieDeclarations]: Found specification of procedure atexit [2018-04-10 16:25:00,021 INFO L128 BoogieDeclarations]: Found specification of procedure at_quick_exit [2018-04-10 16:25:00,021 INFO L128 BoogieDeclarations]: Found specification of procedure on_exit [2018-04-10 16:25:00,021 INFO L128 BoogieDeclarations]: Found specification of procedure exit [2018-04-10 16:25:00,022 INFO L128 BoogieDeclarations]: Found specification of procedure quick_exit [2018-04-10 16:25:00,022 INFO L128 BoogieDeclarations]: Found specification of procedure _Exit [2018-04-10 16:25:00,022 INFO L128 BoogieDeclarations]: Found specification of procedure getenv [2018-04-10 16:25:00,022 INFO L128 BoogieDeclarations]: Found specification of procedure putenv [2018-04-10 16:25:00,022 INFO L128 BoogieDeclarations]: Found specification of procedure setenv [2018-04-10 16:25:00,022 INFO L128 BoogieDeclarations]: Found specification of procedure unsetenv [2018-04-10 16:25:00,022 INFO L128 BoogieDeclarations]: Found specification of procedure clearenv [2018-04-10 16:25:00,022 INFO L128 BoogieDeclarations]: Found specification of procedure mktemp [2018-04-10 16:25:00,022 INFO L128 BoogieDeclarations]: Found specification of procedure mkstemp [2018-04-10 16:25:00,022 INFO L128 BoogieDeclarations]: Found specification of procedure mkstemps [2018-04-10 16:25:00,023 INFO L128 BoogieDeclarations]: Found specification of procedure mkdtemp [2018-04-10 16:25:00,023 INFO L128 BoogieDeclarations]: Found specification of procedure system [2018-04-10 16:25:00,023 INFO L128 BoogieDeclarations]: Found specification of procedure realpath [2018-04-10 16:25:00,023 INFO L128 BoogieDeclarations]: Found specification of procedure bsearch [2018-04-10 16:25:00,023 INFO L128 BoogieDeclarations]: Found specification of procedure qsort [2018-04-10 16:25:00,023 INFO L128 BoogieDeclarations]: Found specification of procedure abs [2018-04-10 16:25:00,023 INFO L128 BoogieDeclarations]: Found specification of procedure labs [2018-04-10 16:25:00,023 INFO L128 BoogieDeclarations]: Found specification of procedure llabs [2018-04-10 16:25:00,023 INFO L128 BoogieDeclarations]: Found specification of procedure div [2018-04-10 16:25:00,023 INFO L128 BoogieDeclarations]: Found specification of procedure ldiv [2018-04-10 16:25:00,024 INFO L128 BoogieDeclarations]: Found specification of procedure lldiv [2018-04-10 16:25:00,024 INFO L128 BoogieDeclarations]: Found specification of procedure ecvt [2018-04-10 16:25:00,024 INFO L128 BoogieDeclarations]: Found specification of procedure fcvt [2018-04-10 16:25:00,024 INFO L128 BoogieDeclarations]: Found specification of procedure gcvt [2018-04-10 16:25:00,024 INFO L128 BoogieDeclarations]: Found specification of procedure qecvt [2018-04-10 16:25:00,024 INFO L128 BoogieDeclarations]: Found specification of procedure qfcvt [2018-04-10 16:25:00,024 INFO L128 BoogieDeclarations]: Found specification of procedure qgcvt [2018-04-10 16:25:00,024 INFO L128 BoogieDeclarations]: Found specification of procedure ecvt_r [2018-04-10 16:25:00,024 INFO L128 BoogieDeclarations]: Found specification of procedure fcvt_r [2018-04-10 16:25:00,024 INFO L128 BoogieDeclarations]: Found specification of procedure qecvt_r [2018-04-10 16:25:00,024 INFO L128 BoogieDeclarations]: Found specification of procedure qfcvt_r [2018-04-10 16:25:00,025 INFO L128 BoogieDeclarations]: Found specification of procedure mblen [2018-04-10 16:25:00,025 INFO L128 BoogieDeclarations]: Found specification of procedure mbtowc [2018-04-10 16:25:00,025 INFO L128 BoogieDeclarations]: Found specification of procedure wctomb [2018-04-10 16:25:00,025 INFO L128 BoogieDeclarations]: Found specification of procedure mbstowcs [2018-04-10 16:25:00,025 INFO L128 BoogieDeclarations]: Found specification of procedure wcstombs [2018-04-10 16:25:00,025 INFO L128 BoogieDeclarations]: Found specification of procedure rpmatch [2018-04-10 16:25:00,025 INFO L128 BoogieDeclarations]: Found specification of procedure getsubopt [2018-04-10 16:25:00,025 INFO L128 BoogieDeclarations]: Found specification of procedure getloadavg [2018-04-10 16:25:00,025 INFO L128 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2018-04-10 16:25:00,025 INFO L128 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2018-04-10 16:25:00,026 INFO L128 BoogieDeclarations]: Found specification of procedure main [2018-04-10 16:25:00,026 INFO L128 BoogieDeclarations]: Found specification of procedure #Ultimate.alloc [2018-04-10 16:25:00,026 INFO L128 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2018-04-10 16:25:00,026 INFO L128 BoogieDeclarations]: Found specification of procedure write~int [2018-04-10 16:25:00,026 INFO L128 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2018-04-10 16:25:00,026 INFO L128 BoogieDeclarations]: Found specification of procedure read~int [2018-04-10 16:25:00,026 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2018-04-10 16:25:00,026 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-04-10 16:25:00,026 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-04-10 16:25:00,026 INFO L128 BoogieDeclarations]: Found specification of procedure write~unchecked~int [2018-04-10 16:25:00,499 INFO L259 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-04-10 16:25:00,499 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.04 04:25:00 BoogieIcfgContainer [2018-04-10 16:25:00,499 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-04-10 16:25:00,500 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-04-10 16:25:00,500 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-04-10 16:25:00,502 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-04-10 16:25:00,502 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 10.04 04:24:59" (1/3) ... [2018-04-10 16:25:00,503 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@16c56cf4 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.04 04:25:00, skipping insertion in model container [2018-04-10 16:25:00,503 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.04 04:24:59" (2/3) ... [2018-04-10 16:25:00,503 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@16c56cf4 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.04 04:25:00, skipping insertion in model container [2018-04-10 16:25:00,503 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.04 04:25:00" (3/3) ... [2018-04-10 16:25:00,504 INFO L107 eAbstractionObserver]: Analyzing ICFG dll-queue_true-unreach-call_true-valid-memsafety.i [2018-04-10 16:25:00,511 INFO L131 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-04-10 16:25:00,516 INFO L143 ceAbstractionStarter]: Appying trace abstraction to program that has 61 error locations. [2018-04-10 16:25:00,540 INFO L128 ementStrategyFactory]: Using default assertion order modulation [2018-04-10 16:25:00,540 INFO L369 AbstractCegarLoop]: Interprodecural is true [2018-04-10 16:25:00,540 INFO L370 AbstractCegarLoop]: Hoare is false [2018-04-10 16:25:00,540 INFO L371 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-04-10 16:25:00,540 INFO L372 AbstractCegarLoop]: Backedges is TWOTRACK [2018-04-10 16:25:00,540 INFO L373 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-04-10 16:25:00,540 INFO L374 AbstractCegarLoop]: Difference is false [2018-04-10 16:25:00,541 INFO L375 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-04-10 16:25:00,541 INFO L380 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-04-10 16:25:00,541 INFO L87 2NestedWordAutomaton]: Mode: main mode - execution starts in main procedure [2018-04-10 16:25:00,552 INFO L276 IsEmpty]: Start isEmpty. Operand 174 states. [2018-04-10 16:25:00,558 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2018-04-10 16:25:00,558 INFO L347 BasicCegarLoop]: Found error trace [2018-04-10 16:25:00,559 INFO L355 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2018-04-10 16:25:00,559 INFO L408 AbstractCegarLoop]: === Iteration 1 === [mainErr51RequiresViolation, mainErr26RequiresViolation, mainErr54RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr31RequiresViolation, mainErr46RequiresViolation, mainErr29RequiresViolation, mainErr58AssertViolationMEMORY_FREE, mainErr3RequiresViolation, mainErr60EnsuresViolationMEMORY_LEAK, mainErr15RequiresViolation, mainErr49RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr55RequiresViolation, mainErr17RequiresViolation, mainErr42RequiresViolation, mainErr30RequiresViolation, mainErr11RequiresViolation, mainErr57RequiresViolation, mainErr24RequiresViolation, mainErr44RequiresViolation, mainErr10RequiresViolation, mainErr43RequiresViolation, mainErr4RequiresViolation, mainErr50RequiresViolation, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr59AssertViolationMEMORY_FREE, mainErr36RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr56RequiresViolation, mainErr48RequiresViolation, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr52RequiresViolation, mainErr45RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr9RequiresViolation, mainErr53RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr34RequiresViolation, mainErr47RequiresViolation, mainErr14RequiresViolation, mainErr40RequiresViolation]=== [2018-04-10 16:25:00,562 INFO L82 PathProgramCache]: Analyzing trace with hash -1577217846, now seen corresponding path program 1 times [2018-04-10 16:25:00,563 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-04-10 16:25:00,563 INFO L68 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-04-10 16:25:00,596 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-10 16:25:00,596 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-10 16:25:00,596 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-10 16:25:00,618 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-10 16:25:00,624 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-10 16:25:00,661 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-10 16:25:00,663 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-04-10 16:25:00,663 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-04-10 16:25:00,664 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-04-10 16:25:00,672 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-04-10 16:25:00,672 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-04-10 16:25:00,673 INFO L87 Difference]: Start difference. First operand 174 states. Second operand 4 states. [2018-04-10 16:25:00,849 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-10 16:25:00,850 INFO L93 Difference]: Finished difference Result 177 states and 188 transitions. [2018-04-10 16:25:00,850 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-04-10 16:25:00,852 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 8 [2018-04-10 16:25:00,852 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-10 16:25:00,864 INFO L225 Difference]: With dead ends: 177 [2018-04-10 16:25:00,864 INFO L226 Difference]: Without dead ends: 173 [2018-04-10 16:25:00,866 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-04-10 16:25:00,883 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 173 states. [2018-04-10 16:25:00,903 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 173 to 163. [2018-04-10 16:25:00,904 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 163 states. [2018-04-10 16:25:00,907 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 163 states to 163 states and 175 transitions. [2018-04-10 16:25:00,908 INFO L78 Accepts]: Start accepts. Automaton has 163 states and 175 transitions. Word has length 8 [2018-04-10 16:25:00,908 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-10 16:25:00,908 INFO L459 AbstractCegarLoop]: Abstraction has 163 states and 175 transitions. [2018-04-10 16:25:00,908 INFO L460 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-04-10 16:25:00,908 INFO L276 IsEmpty]: Start isEmpty. Operand 163 states and 175 transitions. [2018-04-10 16:25:00,909 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2018-04-10 16:25:00,909 INFO L347 BasicCegarLoop]: Found error trace [2018-04-10 16:25:00,909 INFO L355 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2018-04-10 16:25:00,909 INFO L408 AbstractCegarLoop]: === Iteration 2 === [mainErr51RequiresViolation, mainErr26RequiresViolation, mainErr54RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr31RequiresViolation, mainErr46RequiresViolation, mainErr29RequiresViolation, mainErr58AssertViolationMEMORY_FREE, mainErr3RequiresViolation, mainErr60EnsuresViolationMEMORY_LEAK, mainErr15RequiresViolation, mainErr49RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr55RequiresViolation, mainErr17RequiresViolation, mainErr42RequiresViolation, mainErr30RequiresViolation, mainErr11RequiresViolation, mainErr57RequiresViolation, mainErr24RequiresViolation, mainErr44RequiresViolation, mainErr10RequiresViolation, mainErr43RequiresViolation, mainErr4RequiresViolation, mainErr50RequiresViolation, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr59AssertViolationMEMORY_FREE, mainErr36RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr56RequiresViolation, mainErr48RequiresViolation, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr52RequiresViolation, mainErr45RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr9RequiresViolation, mainErr53RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr34RequiresViolation, mainErr47RequiresViolation, mainErr14RequiresViolation, mainErr40RequiresViolation]=== [2018-04-10 16:25:00,909 INFO L82 PathProgramCache]: Analyzing trace with hash -1577217845, now seen corresponding path program 1 times [2018-04-10 16:25:00,909 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-04-10 16:25:00,909 INFO L68 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-04-10 16:25:00,910 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-10 16:25:00,911 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-10 16:25:00,911 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-10 16:25:00,922 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-10 16:25:00,924 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-10 16:25:00,964 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-10 16:25:00,965 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-04-10 16:25:00,965 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-04-10 16:25:00,966 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-04-10 16:25:00,967 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-04-10 16:25:00,967 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-04-10 16:25:00,967 INFO L87 Difference]: Start difference. First operand 163 states and 175 transitions. Second operand 4 states. [2018-04-10 16:25:01,061 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-10 16:25:01,061 INFO L93 Difference]: Finished difference Result 156 states and 166 transitions. [2018-04-10 16:25:01,062 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-04-10 16:25:01,062 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 8 [2018-04-10 16:25:01,062 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-10 16:25:01,063 INFO L225 Difference]: With dead ends: 156 [2018-04-10 16:25:01,063 INFO L226 Difference]: Without dead ends: 156 [2018-04-10 16:25:01,063 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-04-10 16:25:01,063 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 156 states. [2018-04-10 16:25:01,067 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 156 to 152. [2018-04-10 16:25:01,067 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 152 states. [2018-04-10 16:25:01,068 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 152 states to 152 states and 163 transitions. [2018-04-10 16:25:01,068 INFO L78 Accepts]: Start accepts. Automaton has 152 states and 163 transitions. Word has length 8 [2018-04-10 16:25:01,069 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-10 16:25:01,069 INFO L459 AbstractCegarLoop]: Abstraction has 152 states and 163 transitions. [2018-04-10 16:25:01,069 INFO L460 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-04-10 16:25:01,069 INFO L276 IsEmpty]: Start isEmpty. Operand 152 states and 163 transitions. [2018-04-10 16:25:01,069 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2018-04-10 16:25:01,069 INFO L347 BasicCegarLoop]: Found error trace [2018-04-10 16:25:01,069 INFO L355 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-10 16:25:01,069 INFO L408 AbstractCegarLoop]: === Iteration 3 === [mainErr51RequiresViolation, mainErr26RequiresViolation, mainErr54RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr31RequiresViolation, mainErr46RequiresViolation, mainErr29RequiresViolation, mainErr58AssertViolationMEMORY_FREE, mainErr3RequiresViolation, mainErr60EnsuresViolationMEMORY_LEAK, mainErr15RequiresViolation, mainErr49RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr55RequiresViolation, mainErr17RequiresViolation, mainErr42RequiresViolation, mainErr30RequiresViolation, mainErr11RequiresViolation, mainErr57RequiresViolation, mainErr24RequiresViolation, mainErr44RequiresViolation, mainErr10RequiresViolation, mainErr43RequiresViolation, mainErr4RequiresViolation, mainErr50RequiresViolation, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr59AssertViolationMEMORY_FREE, mainErr36RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr56RequiresViolation, mainErr48RequiresViolation, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr52RequiresViolation, mainErr45RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr9RequiresViolation, mainErr53RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr34RequiresViolation, mainErr47RequiresViolation, mainErr14RequiresViolation, mainErr40RequiresViolation]=== [2018-04-10 16:25:01,070 INFO L82 PathProgramCache]: Analyzing trace with hash 1014420055, now seen corresponding path program 1 times [2018-04-10 16:25:01,070 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-04-10 16:25:01,070 INFO L68 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-04-10 16:25:01,071 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-10 16:25:01,071 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-10 16:25:01,071 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-10 16:25:01,084 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-10 16:25:01,085 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-10 16:25:01,091 INFO L431 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown lemma type! [2018-04-10 16:25:01,091 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-04-10 16:25:01,091 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-04-10 16:25:01,092 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-10 16:25:01,123 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-10 16:25:01,131 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-10 16:25:01,165 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-04-10 16:25:01,166 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-10 16:25:01,175 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-10 16:25:01,175 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:6, output treesize:5 [2018-04-10 16:25:01,188 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 16:25:01,189 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 16:25:01,190 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 21 [2018-04-10 16:25:01,190 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-10 16:25:01,195 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-04-10 16:25:01,195 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:17, output treesize:15 [2018-04-10 16:25:01,206 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-10 16:25:01,206 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-04-10 16:25:01,206 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-04-10 16:25:01,206 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-04-10 16:25:01,206 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-04-10 16:25:01,206 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2018-04-10 16:25:01,207 INFO L87 Difference]: Start difference. First operand 152 states and 163 transitions. Second operand 6 states. [2018-04-10 16:25:01,399 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-10 16:25:01,399 INFO L93 Difference]: Finished difference Result 158 states and 168 transitions. [2018-04-10 16:25:01,399 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-04-10 16:25:01,399 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 16 [2018-04-10 16:25:01,400 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-10 16:25:01,400 INFO L225 Difference]: With dead ends: 158 [2018-04-10 16:25:01,401 INFO L226 Difference]: Without dead ends: 158 [2018-04-10 16:25:01,401 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 11 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=34, Invalid=56, Unknown=0, NotChecked=0, Total=90 [2018-04-10 16:25:01,401 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 158 states. [2018-04-10 16:25:01,406 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 158 to 152. [2018-04-10 16:25:01,407 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 152 states. [2018-04-10 16:25:01,408 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 152 states to 152 states and 165 transitions. [2018-04-10 16:25:01,408 INFO L78 Accepts]: Start accepts. Automaton has 152 states and 165 transitions. Word has length 16 [2018-04-10 16:25:01,408 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-10 16:25:01,408 INFO L459 AbstractCegarLoop]: Abstraction has 152 states and 165 transitions. [2018-04-10 16:25:01,408 INFO L460 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-04-10 16:25:01,408 INFO L276 IsEmpty]: Start isEmpty. Operand 152 states and 165 transitions. [2018-04-10 16:25:01,409 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2018-04-10 16:25:01,409 INFO L347 BasicCegarLoop]: Found error trace [2018-04-10 16:25:01,409 INFO L355 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-10 16:25:01,409 INFO L408 AbstractCegarLoop]: === Iteration 4 === [mainErr51RequiresViolation, mainErr26RequiresViolation, mainErr54RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr31RequiresViolation, mainErr46RequiresViolation, mainErr29RequiresViolation, mainErr58AssertViolationMEMORY_FREE, mainErr3RequiresViolation, mainErr60EnsuresViolationMEMORY_LEAK, mainErr15RequiresViolation, mainErr49RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr55RequiresViolation, mainErr17RequiresViolation, mainErr42RequiresViolation, mainErr30RequiresViolation, mainErr11RequiresViolation, mainErr57RequiresViolation, mainErr24RequiresViolation, mainErr44RequiresViolation, mainErr10RequiresViolation, mainErr43RequiresViolation, mainErr4RequiresViolation, mainErr50RequiresViolation, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr59AssertViolationMEMORY_FREE, mainErr36RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr56RequiresViolation, mainErr48RequiresViolation, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr52RequiresViolation, mainErr45RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr9RequiresViolation, mainErr53RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr34RequiresViolation, mainErr47RequiresViolation, mainErr14RequiresViolation, mainErr40RequiresViolation]=== [2018-04-10 16:25:01,409 INFO L82 PathProgramCache]: Analyzing trace with hash 1014420056, now seen corresponding path program 1 times [2018-04-10 16:25:01,409 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-04-10 16:25:01,409 INFO L68 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-04-10 16:25:01,411 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-10 16:25:01,411 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-10 16:25:01,411 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-10 16:25:01,422 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-10 16:25:01,423 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-10 16:25:01,426 INFO L431 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown lemma type! [2018-04-10 16:25:01,426 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-04-10 16:25:01,426 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-04-10 16:25:01,427 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-10 16:25:01,464 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-10 16:25:01,467 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-10 16:25:01,477 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-04-10 16:25:01,477 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-10 16:25:01,485 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-04-10 16:25:01,486 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-10 16:25:01,489 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-10 16:25:01,489 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:16, output treesize:14 [2018-04-10 16:25:01,540 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 16:25:01,540 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 15 [2018-04-10 16:25:01,541 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-10 16:25:01,567 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 16:25:01,568 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 16:25:01,569 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 4 [2018-04-10 16:25:01,569 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-10 16:25:01,584 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-04-10 16:25:01,584 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:28, output treesize:21 [2018-04-10 16:25:01,656 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-10 16:25:01,656 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-04-10 16:25:01,656 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-04-10 16:25:01,656 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-04-10 16:25:01,656 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-04-10 16:25:01,657 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2018-04-10 16:25:01,657 INFO L87 Difference]: Start difference. First operand 152 states and 165 transitions. Second operand 7 states. [2018-04-10 16:25:02,060 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-10 16:25:02,061 INFO L93 Difference]: Finished difference Result 234 states and 249 transitions. [2018-04-10 16:25:02,061 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-04-10 16:25:02,061 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 16 [2018-04-10 16:25:02,061 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-10 16:25:02,062 INFO L225 Difference]: With dead ends: 234 [2018-04-10 16:25:02,062 INFO L226 Difference]: Without dead ends: 234 [2018-04-10 16:25:02,062 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 10 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=46, Invalid=86, Unknown=0, NotChecked=0, Total=132 [2018-04-10 16:25:02,063 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 234 states. [2018-04-10 16:25:02,066 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 234 to 161. [2018-04-10 16:25:02,066 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 161 states. [2018-04-10 16:25:02,067 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 161 states to 161 states and 176 transitions. [2018-04-10 16:25:02,067 INFO L78 Accepts]: Start accepts. Automaton has 161 states and 176 transitions. Word has length 16 [2018-04-10 16:25:02,068 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-10 16:25:02,068 INFO L459 AbstractCegarLoop]: Abstraction has 161 states and 176 transitions. [2018-04-10 16:25:02,068 INFO L460 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-04-10 16:25:02,068 INFO L276 IsEmpty]: Start isEmpty. Operand 161 states and 176 transitions. [2018-04-10 16:25:02,068 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2018-04-10 16:25:02,068 INFO L347 BasicCegarLoop]: Found error trace [2018-04-10 16:25:02,068 INFO L355 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-10 16:25:02,074 INFO L408 AbstractCegarLoop]: === Iteration 5 === [mainErr51RequiresViolation, mainErr26RequiresViolation, mainErr54RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr31RequiresViolation, mainErr46RequiresViolation, mainErr29RequiresViolation, mainErr58AssertViolationMEMORY_FREE, mainErr3RequiresViolation, mainErr60EnsuresViolationMEMORY_LEAK, mainErr15RequiresViolation, mainErr49RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr55RequiresViolation, mainErr17RequiresViolation, mainErr42RequiresViolation, mainErr30RequiresViolation, mainErr11RequiresViolation, mainErr57RequiresViolation, mainErr24RequiresViolation, mainErr44RequiresViolation, mainErr10RequiresViolation, mainErr43RequiresViolation, mainErr4RequiresViolation, mainErr50RequiresViolation, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr59AssertViolationMEMORY_FREE, mainErr36RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr56RequiresViolation, mainErr48RequiresViolation, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr52RequiresViolation, mainErr45RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr9RequiresViolation, mainErr53RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr34RequiresViolation, mainErr47RequiresViolation, mainErr14RequiresViolation, mainErr40RequiresViolation]=== [2018-04-10 16:25:02,074 INFO L82 PathProgramCache]: Analyzing trace with hash -99903366, now seen corresponding path program 1 times [2018-04-10 16:25:02,074 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-04-10 16:25:02,074 INFO L68 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-04-10 16:25:02,075 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-10 16:25:02,076 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-10 16:25:02,076 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-10 16:25:02,083 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-10 16:25:02,083 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-10 16:25:02,125 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-10 16:25:02,125 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-04-10 16:25:02,125 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-04-10 16:25:02,126 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-04-10 16:25:02,126 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-04-10 16:25:02,126 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-04-10 16:25:02,126 INFO L87 Difference]: Start difference. First operand 161 states and 176 transitions. Second operand 5 states. [2018-04-10 16:25:02,361 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-10 16:25:02,362 INFO L93 Difference]: Finished difference Result 255 states and 276 transitions. [2018-04-10 16:25:02,362 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-04-10 16:25:02,362 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 18 [2018-04-10 16:25:02,367 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-10 16:25:02,368 INFO L225 Difference]: With dead ends: 255 [2018-04-10 16:25:02,368 INFO L226 Difference]: Without dead ends: 255 [2018-04-10 16:25:02,368 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2018-04-10 16:25:02,368 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 255 states. [2018-04-10 16:25:02,372 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 255 to 160. [2018-04-10 16:25:02,372 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 160 states. [2018-04-10 16:25:02,373 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 160 states to 160 states and 174 transitions. [2018-04-10 16:25:02,374 INFO L78 Accepts]: Start accepts. Automaton has 160 states and 174 transitions. Word has length 18 [2018-04-10 16:25:02,375 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-10 16:25:02,375 INFO L459 AbstractCegarLoop]: Abstraction has 160 states and 174 transitions. [2018-04-10 16:25:02,375 INFO L460 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-04-10 16:25:02,375 INFO L276 IsEmpty]: Start isEmpty. Operand 160 states and 174 transitions. [2018-04-10 16:25:02,375 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2018-04-10 16:25:02,376 INFO L347 BasicCegarLoop]: Found error trace [2018-04-10 16:25:02,376 INFO L355 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-10 16:25:02,376 INFO L408 AbstractCegarLoop]: === Iteration 6 === [mainErr51RequiresViolation, mainErr26RequiresViolation, mainErr54RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr31RequiresViolation, mainErr46RequiresViolation, mainErr29RequiresViolation, mainErr58AssertViolationMEMORY_FREE, mainErr3RequiresViolation, mainErr60EnsuresViolationMEMORY_LEAK, mainErr15RequiresViolation, mainErr49RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr55RequiresViolation, mainErr17RequiresViolation, mainErr42RequiresViolation, mainErr30RequiresViolation, mainErr11RequiresViolation, mainErr57RequiresViolation, mainErr24RequiresViolation, mainErr44RequiresViolation, mainErr10RequiresViolation, mainErr43RequiresViolation, mainErr4RequiresViolation, mainErr50RequiresViolation, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr59AssertViolationMEMORY_FREE, mainErr36RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr56RequiresViolation, mainErr48RequiresViolation, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr52RequiresViolation, mainErr45RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr9RequiresViolation, mainErr53RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr34RequiresViolation, mainErr47RequiresViolation, mainErr14RequiresViolation, mainErr40RequiresViolation]=== [2018-04-10 16:25:02,376 INFO L82 PathProgramCache]: Analyzing trace with hash -99903365, now seen corresponding path program 1 times [2018-04-10 16:25:02,376 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-04-10 16:25:02,376 INFO L68 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-04-10 16:25:02,378 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-10 16:25:02,378 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-10 16:25:02,378 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-10 16:25:02,390 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-10 16:25:02,391 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-10 16:25:02,441 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-10 16:25:02,441 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-04-10 16:25:02,441 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-04-10 16:25:02,442 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-04-10 16:25:02,442 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-04-10 16:25:02,442 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-04-10 16:25:02,442 INFO L87 Difference]: Start difference. First operand 160 states and 174 transitions. Second operand 5 states. [2018-04-10 16:25:02,608 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-10 16:25:02,608 INFO L93 Difference]: Finished difference Result 264 states and 285 transitions. [2018-04-10 16:25:02,609 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-04-10 16:25:02,609 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 18 [2018-04-10 16:25:02,609 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-10 16:25:02,610 INFO L225 Difference]: With dead ends: 264 [2018-04-10 16:25:02,610 INFO L226 Difference]: Without dead ends: 264 [2018-04-10 16:25:02,610 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2018-04-10 16:25:02,610 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 264 states. [2018-04-10 16:25:02,613 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 264 to 159. [2018-04-10 16:25:02,613 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 159 states. [2018-04-10 16:25:02,614 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 159 states to 159 states and 172 transitions. [2018-04-10 16:25:02,614 INFO L78 Accepts]: Start accepts. Automaton has 159 states and 172 transitions. Word has length 18 [2018-04-10 16:25:02,615 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-10 16:25:02,615 INFO L459 AbstractCegarLoop]: Abstraction has 159 states and 172 transitions. [2018-04-10 16:25:02,615 INFO L460 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-04-10 16:25:02,615 INFO L276 IsEmpty]: Start isEmpty. Operand 159 states and 172 transitions. [2018-04-10 16:25:02,615 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2018-04-10 16:25:02,615 INFO L347 BasicCegarLoop]: Found error trace [2018-04-10 16:25:02,615 INFO L355 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-10 16:25:02,616 INFO L408 AbstractCegarLoop]: === Iteration 7 === [mainErr51RequiresViolation, mainErr26RequiresViolation, mainErr54RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr31RequiresViolation, mainErr46RequiresViolation, mainErr29RequiresViolation, mainErr58AssertViolationMEMORY_FREE, mainErr3RequiresViolation, mainErr60EnsuresViolationMEMORY_LEAK, mainErr15RequiresViolation, mainErr49RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr55RequiresViolation, mainErr17RequiresViolation, mainErr42RequiresViolation, mainErr30RequiresViolation, mainErr11RequiresViolation, mainErr57RequiresViolation, mainErr24RequiresViolation, mainErr44RequiresViolation, mainErr10RequiresViolation, mainErr43RequiresViolation, mainErr4RequiresViolation, mainErr50RequiresViolation, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr59AssertViolationMEMORY_FREE, mainErr36RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr56RequiresViolation, mainErr48RequiresViolation, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr52RequiresViolation, mainErr45RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr9RequiresViolation, mainErr53RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr34RequiresViolation, mainErr47RequiresViolation, mainErr14RequiresViolation, mainErr40RequiresViolation]=== [2018-04-10 16:25:02,616 INFO L82 PathProgramCache]: Analyzing trace with hash 1631135996, now seen corresponding path program 1 times [2018-04-10 16:25:02,616 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-04-10 16:25:02,616 INFO L68 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-04-10 16:25:02,617 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-10 16:25:02,617 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-10 16:25:02,617 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-10 16:25:02,627 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-10 16:25:02,628 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-10 16:25:02,645 INFO L431 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown lemma type! [2018-04-10 16:25:02,645 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-04-10 16:25:02,645 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-04-10 16:25:02,646 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-10 16:25:02,681 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-10 16:25:02,684 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-10 16:25:02,700 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-04-10 16:25:02,700 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-10 16:25:02,704 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-10 16:25:02,704 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:13, output treesize:12 [2018-04-10 16:25:02,715 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 8 [2018-04-10 16:25:02,716 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-04-10 16:25:02,716 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-10 16:25:02,718 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-10 16:25:02,725 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 8 [2018-04-10 16:25:02,727 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-04-10 16:25:02,727 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-04-10 16:25:02,728 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-10 16:25:02,733 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-04-10 16:25:02,734 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 4 variables, input treesize:34, output treesize:20 [2018-04-10 16:25:02,743 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11 [2018-04-10 16:25:02,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 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2018-04-10 16:25:02,745 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-10 16:25:02,746 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-10 16:25:02,750 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-04-10 16:25:02,750 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:27, output treesize:16 [2018-04-10 16:25:02,771 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 23 treesize of output 35 [2018-04-10 16:25:02,774 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 23 [2018-04-10 16:25:02,774 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-10 16:25:02,783 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-10 16:25:02,787 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2018-04-10 16:25:02,788 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:29, output treesize:25 [2018-04-10 16:25:02,803 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 29 treesize of output 28 [2018-04-10 16:25:02,806 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 14 [2018-04-10 16:25:02,807 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-10 16:25:02,812 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 10 [2018-04-10 16:25:02,813 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-04-10 16:25:02,817 INFO L267 ElimStorePlain]: Start of recursive call 2: 3 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-10 16:25:02,821 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-04-10 16:25:02,821 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 4 variables, input treesize:35, output treesize:5 [2018-04-10 16:25:02,831 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-10 16:25:02,831 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-04-10 16:25:02,831 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2018-04-10 16:25:02,831 INFO L442 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-04-10 16:25:02,831 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-04-10 16:25:02,831 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=87, Unknown=0, NotChecked=0, Total=110 [2018-04-10 16:25:02,831 INFO L87 Difference]: Start difference. First operand 159 states and 172 transitions. Second operand 11 states. [2018-04-10 16:25:03,337 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-10 16:25:03,337 INFO L93 Difference]: Finished difference Result 232 states and 246 transitions. [2018-04-10 16:25:03,337 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2018-04-10 16:25:03,337 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 22 [2018-04-10 16:25:03,338 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-10 16:25:03,338 INFO L225 Difference]: With dead ends: 232 [2018-04-10 16:25:03,338 INFO L226 Difference]: Without dead ends: 232 [2018-04-10 16:25:03,339 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 31 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 46 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=131, Invalid=289, Unknown=0, NotChecked=0, Total=420 [2018-04-10 16:25:03,339 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 232 states. [2018-04-10 16:25:03,341 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 232 to 161. [2018-04-10 16:25:03,341 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 161 states. [2018-04-10 16:25:03,343 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 161 states to 161 states and 175 transitions. [2018-04-10 16:25:03,343 INFO L78 Accepts]: Start accepts. Automaton has 161 states and 175 transitions. Word has length 22 [2018-04-10 16:25:03,343 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-10 16:25:03,343 INFO L459 AbstractCegarLoop]: Abstraction has 161 states and 175 transitions. [2018-04-10 16:25:03,343 INFO L460 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-04-10 16:25:03,343 INFO L276 IsEmpty]: Start isEmpty. Operand 161 states and 175 transitions. [2018-04-10 16:25:03,343 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2018-04-10 16:25:03,344 INFO L347 BasicCegarLoop]: Found error trace [2018-04-10 16:25:03,344 INFO L355 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-10 16:25:03,344 INFO L408 AbstractCegarLoop]: === Iteration 8 === [mainErr51RequiresViolation, mainErr26RequiresViolation, mainErr54RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr31RequiresViolation, mainErr46RequiresViolation, mainErr29RequiresViolation, mainErr58AssertViolationMEMORY_FREE, mainErr3RequiresViolation, mainErr60EnsuresViolationMEMORY_LEAK, mainErr15RequiresViolation, mainErr49RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr55RequiresViolation, mainErr17RequiresViolation, mainErr42RequiresViolation, mainErr30RequiresViolation, mainErr11RequiresViolation, mainErr57RequiresViolation, mainErr24RequiresViolation, mainErr44RequiresViolation, mainErr10RequiresViolation, mainErr43RequiresViolation, mainErr4RequiresViolation, mainErr50RequiresViolation, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr59AssertViolationMEMORY_FREE, mainErr36RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr56RequiresViolation, mainErr48RequiresViolation, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr52RequiresViolation, mainErr45RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr9RequiresViolation, mainErr53RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr34RequiresViolation, mainErr47RequiresViolation, mainErr14RequiresViolation, mainErr40RequiresViolation]=== [2018-04-10 16:25:03,344 INFO L82 PathProgramCache]: Analyzing trace with hash 1631135997, now seen corresponding path program 1 times [2018-04-10 16:25:03,344 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-04-10 16:25:03,344 INFO L68 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-04-10 16:25:03,345 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-10 16:25:03,345 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-10 16:25:03,345 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-10 16:25:03,352 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-10 16:25:03,352 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-10 16:25:03,355 INFO L431 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown lemma type! [2018-04-10 16:25:03,355 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-04-10 16:25:03,356 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-04-10 16:25:03,356 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-10 16:25:03,375 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-10 16:25:03,377 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-10 16:25:03,381 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-04-10 16:25:03,381 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-10 16:25:03,382 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-10 16:25:03,382 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:6, output treesize:5 [2018-04-10 16:25:03,392 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 16:25:03,393 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 16:25:03,393 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 4 [2018-04-10 16:25:03,394 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-10 16:25:03,401 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-04-10 16:25:03,401 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-10 16:25:03,406 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-10 16:25:03,407 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:20, output treesize:13 [2018-04-10 16:25:03,417 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 8 [2018-04-10 16:25:03,418 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-04-10 16:25:03,419 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-10 16:25:03,420 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-10 16:25:03,425 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 8 [2018-04-10 16:25:03,427 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-04-10 16:25:03,427 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-04-10 16:25:03,428 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-10 16:25:03,433 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-04-10 16:25:03,433 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 3 variables, input treesize:32, output treesize:25 [2018-04-10 16:25:03,461 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 30 [2018-04-10 16:25:03,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, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 13 [2018-04-10 16:25:03,463 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-10 16:25:03,466 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-10 16:25:03,475 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 52 treesize of output 48 [2018-04-10 16:25:03,477 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 13 [2018-04-10 16:25:03,477 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-04-10 16:25:03,482 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-10 16:25:03,487 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-04-10 16:25:03,487 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 3 variables, input treesize:67, output treesize:51 [2018-04-10 16:25:03,508 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 51 treesize of output 37 [2018-04-10 16:25:03,512 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 19 [2018-04-10 16:25:03,512 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-10 16:25:03,518 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 1 [2018-04-10 16:25:03,518 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-04-10 16:25:03,521 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-10 16:25:03,531 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 22 [2018-04-10 16:25:03,533 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 3 [2018-04-10 16:25:03,534 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2018-04-10 16:25:03,538 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 1 [2018-04-10 16:25:03,538 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2018-04-10 16:25:03,539 INFO L267 ElimStorePlain]: Start of recursive call 5: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-10 16:25:03,542 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-04-10 16:25:03,542 INFO L202 ElimStorePlain]: Needed 7 recursive calls to eliminate 5 variables, input treesize:65, output treesize:9 [2018-04-10 16:25:03,562 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-10 16:25:03,562 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-04-10 16:25:03,562 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2018-04-10 16:25:03,562 INFO L442 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-04-10 16:25:03,562 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-04-10 16:25:03,562 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=89, Unknown=0, NotChecked=0, Total=110 [2018-04-10 16:25:03,563 INFO L87 Difference]: Start difference. First operand 161 states and 175 transitions. Second operand 11 states. [2018-04-10 16:25:04,048 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-10 16:25:04,048 INFO L93 Difference]: Finished difference Result 225 states and 239 transitions. [2018-04-10 16:25:04,049 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2018-04-10 16:25:04,049 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 22 [2018-04-10 16:25:04,049 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-10 16:25:04,049 INFO L225 Difference]: With dead ends: 225 [2018-04-10 16:25:04,049 INFO L226 Difference]: Without dead ends: 225 [2018-04-10 16:25:04,050 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 38 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 81 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=242, Invalid=514, Unknown=0, NotChecked=0, Total=756 [2018-04-10 16:25:04,050 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 225 states. [2018-04-10 16:25:04,051 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 225 to 154. [2018-04-10 16:25:04,051 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 154 states. [2018-04-10 16:25:04,052 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 154 states to 154 states and 167 transitions. [2018-04-10 16:25:04,052 INFO L78 Accepts]: Start accepts. Automaton has 154 states and 167 transitions. Word has length 22 [2018-04-10 16:25:04,052 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-10 16:25:04,052 INFO L459 AbstractCegarLoop]: Abstraction has 154 states and 167 transitions. [2018-04-10 16:25:04,052 INFO L460 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-04-10 16:25:04,052 INFO L276 IsEmpty]: Start isEmpty. Operand 154 states and 167 transitions. [2018-04-10 16:25:04,053 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2018-04-10 16:25:04,053 INFO L347 BasicCegarLoop]: Found error trace [2018-04-10 16:25:04,053 INFO L355 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-10 16:25:04,053 INFO L408 AbstractCegarLoop]: === Iteration 9 === [mainErr51RequiresViolation, mainErr26RequiresViolation, mainErr54RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr31RequiresViolation, mainErr46RequiresViolation, mainErr29RequiresViolation, mainErr58AssertViolationMEMORY_FREE, mainErr3RequiresViolation, mainErr60EnsuresViolationMEMORY_LEAK, mainErr15RequiresViolation, mainErr49RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr55RequiresViolation, mainErr17RequiresViolation, mainErr42RequiresViolation, mainErr30RequiresViolation, mainErr11RequiresViolation, mainErr57RequiresViolation, mainErr24RequiresViolation, mainErr44RequiresViolation, mainErr10RequiresViolation, mainErr43RequiresViolation, mainErr4RequiresViolation, mainErr50RequiresViolation, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr59AssertViolationMEMORY_FREE, mainErr36RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr56RequiresViolation, mainErr48RequiresViolation, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr52RequiresViolation, mainErr45RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr9RequiresViolation, mainErr53RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr34RequiresViolation, mainErr47RequiresViolation, mainErr14RequiresViolation, mainErr40RequiresViolation]=== [2018-04-10 16:25:04,053 INFO L82 PathProgramCache]: Analyzing trace with hash 382306449, now seen corresponding path program 1 times [2018-04-10 16:25:04,054 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-04-10 16:25:04,054 INFO L68 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-04-10 16:25:04,055 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-10 16:25:04,055 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-10 16:25:04,055 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-10 16:25:04,061 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-10 16:25:04,061 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-10 16:25:04,063 INFO L431 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown lemma type! [2018-04-10 16:25:04,063 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-04-10 16:25:04,063 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-04-10 16:25:04,064 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-10 16:25:04,073 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-10 16:25:04,075 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-10 16:25:04,098 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-10 16:25:04,099 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-04-10 16:25:04,099 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-04-10 16:25:04,099 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-04-10 16:25:04,099 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-04-10 16:25:04,099 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-04-10 16:25:04,099 INFO L87 Difference]: Start difference. First operand 154 states and 167 transitions. Second operand 4 states. [2018-04-10 16:25:04,125 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-10 16:25:04,125 INFO L93 Difference]: Finished difference Result 195 states and 211 transitions. [2018-04-10 16:25:04,126 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-04-10 16:25:04,126 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 29 [2018-04-10 16:25:04,126 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-10 16:25:04,127 INFO L225 Difference]: With dead ends: 195 [2018-04-10 16:25:04,127 INFO L226 Difference]: Without dead ends: 195 [2018-04-10 16:25:04,127 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 29 GetRequests, 26 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-04-10 16:25:04,127 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 195 states. [2018-04-10 16:25:04,130 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 195 to 173. [2018-04-10 16:25:04,130 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 173 states. [2018-04-10 16:25:04,130 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 173 states to 173 states and 190 transitions. [2018-04-10 16:25:04,131 INFO L78 Accepts]: Start accepts. Automaton has 173 states and 190 transitions. Word has length 29 [2018-04-10 16:25:04,131 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-10 16:25:04,131 INFO L459 AbstractCegarLoop]: Abstraction has 173 states and 190 transitions. [2018-04-10 16:25:04,132 INFO L460 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-04-10 16:25:04,132 INFO L276 IsEmpty]: Start isEmpty. Operand 173 states and 190 transitions. [2018-04-10 16:25:04,132 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2018-04-10 16:25:04,132 INFO L347 BasicCegarLoop]: Found error trace [2018-04-10 16:25:04,132 INFO L355 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-10 16:25:04,132 INFO L408 AbstractCegarLoop]: === Iteration 10 === [mainErr51RequiresViolation, mainErr26RequiresViolation, mainErr54RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr31RequiresViolation, mainErr46RequiresViolation, mainErr29RequiresViolation, mainErr58AssertViolationMEMORY_FREE, mainErr3RequiresViolation, mainErr60EnsuresViolationMEMORY_LEAK, mainErr15RequiresViolation, mainErr49RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr55RequiresViolation, mainErr17RequiresViolation, mainErr42RequiresViolation, mainErr30RequiresViolation, mainErr11RequiresViolation, mainErr57RequiresViolation, mainErr24RequiresViolation, mainErr44RequiresViolation, mainErr10RequiresViolation, mainErr43RequiresViolation, mainErr4RequiresViolation, mainErr50RequiresViolation, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr59AssertViolationMEMORY_FREE, mainErr36RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr56RequiresViolation, mainErr48RequiresViolation, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr52RequiresViolation, mainErr45RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr9RequiresViolation, mainErr53RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr34RequiresViolation, mainErr47RequiresViolation, mainErr14RequiresViolation, mainErr40RequiresViolation]=== [2018-04-10 16:25:04,133 INFO L82 PathProgramCache]: Analyzing trace with hash -1034202541, now seen corresponding path program 1 times [2018-04-10 16:25:04,133 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-04-10 16:25:04,133 INFO L68 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-04-10 16:25:04,134 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-10 16:25:04,134 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-10 16:25:04,134 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-10 16:25:04,146 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-10 16:25:04,147 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-10 16:25:04,148 INFO L431 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown lemma type! [2018-04-10 16:25:04,149 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-04-10 16:25:04,149 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-04-10 16:25:04,149 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-10 16:25:04,164 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-10 16:25:04,166 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-10 16:25:04,179 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-10 16:25:04,179 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-04-10 16:25:04,179 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-04-10 16:25:04,179 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-04-10 16:25:04,179 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-04-10 16:25:04,179 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-04-10 16:25:04,180 INFO L87 Difference]: Start difference. First operand 173 states and 190 transitions. Second operand 4 states. [2018-04-10 16:25:04,208 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-10 16:25:04,209 INFO L93 Difference]: Finished difference Result 177 states and 193 transitions. [2018-04-10 16:25:04,209 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-04-10 16:25:04,209 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 30 [2018-04-10 16:25:04,209 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-10 16:25:04,209 INFO L225 Difference]: With dead ends: 177 [2018-04-10 16:25:04,209 INFO L226 Difference]: Without dead ends: 177 [2018-04-10 16:25:04,210 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 29 GetRequests, 27 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-04-10 16:25:04,210 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 177 states. [2018-04-10 16:25:04,211 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 177 to 173. [2018-04-10 16:25:04,211 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 173 states. [2018-04-10 16:25:04,212 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 173 states to 173 states and 189 transitions. [2018-04-10 16:25:04,212 INFO L78 Accepts]: Start accepts. Automaton has 173 states and 189 transitions. Word has length 30 [2018-04-10 16:25:04,212 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-10 16:25:04,212 INFO L459 AbstractCegarLoop]: Abstraction has 173 states and 189 transitions. [2018-04-10 16:25:04,212 INFO L460 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-04-10 16:25:04,212 INFO L276 IsEmpty]: Start isEmpty. Operand 173 states and 189 transitions. [2018-04-10 16:25:04,213 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2018-04-10 16:25:04,213 INFO L347 BasicCegarLoop]: Found error trace [2018-04-10 16:25:04,213 INFO L355 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-10 16:25:04,213 INFO L408 AbstractCegarLoop]: === Iteration 11 === [mainErr51RequiresViolation, mainErr26RequiresViolation, mainErr54RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr31RequiresViolation, mainErr46RequiresViolation, mainErr29RequiresViolation, mainErr58AssertViolationMEMORY_FREE, mainErr3RequiresViolation, mainErr60EnsuresViolationMEMORY_LEAK, mainErr15RequiresViolation, mainErr49RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr55RequiresViolation, mainErr17RequiresViolation, mainErr42RequiresViolation, mainErr30RequiresViolation, mainErr11RequiresViolation, mainErr57RequiresViolation, mainErr24RequiresViolation, mainErr44RequiresViolation, mainErr10RequiresViolation, mainErr43RequiresViolation, mainErr4RequiresViolation, mainErr50RequiresViolation, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr59AssertViolationMEMORY_FREE, mainErr36RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr56RequiresViolation, mainErr48RequiresViolation, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr52RequiresViolation, mainErr45RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr9RequiresViolation, mainErr53RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr34RequiresViolation, mainErr47RequiresViolation, mainErr14RequiresViolation, mainErr40RequiresViolation]=== [2018-04-10 16:25:04,213 INFO L82 PathProgramCache]: Analyzing trace with hash -1970729022, now seen corresponding path program 1 times [2018-04-10 16:25:04,213 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-04-10 16:25:04,213 INFO L68 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-04-10 16:25:04,214 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-10 16:25:04,214 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-10 16:25:04,215 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-10 16:25:04,220 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-10 16:25:04,221 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-10 16:25:04,222 INFO L431 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown lemma type! [2018-04-10 16:25:04,223 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-04-10 16:25:04,223 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-04-10 16:25:04,224 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-10 16:25:04,233 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-10 16:25:04,235 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-10 16:25:04,241 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 8 [2018-04-10 16:25:04,243 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-04-10 16:25:04,243 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-10 16:25:04,244 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-10 16:25:04,249 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 8 [2018-04-10 16:25:04,250 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-04-10 16:25:04,251 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-04-10 16:25:04,252 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-10 16:25:04,255 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-04-10 16:25:04,255 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 2 variables, input treesize:23, output treesize:15 [2018-04-10 16:25:04,263 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 16 [2018-04-10 16:25:04,266 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 16:25:04,266 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 23 [2018-04-10 16:25:04,267 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-10 16:25:04,270 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-10 16:25:04,283 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 16 [2018-04-10 16:25:04,287 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 16:25:04,288 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 23 [2018-04-10 16:25:04,289 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-04-10 16:25:04,298 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-10 16:25:04,304 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-04-10 16:25:04,304 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 2 variables, input treesize:41, output treesize:33 [2018-04-10 16:25:04,318 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 18 [2018-04-10 16:25:04,321 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 16:25:04,322 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 10 [2018-04-10 16:25:04,322 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-10 16:25:04,325 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-10 16:25:04,332 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 18 [2018-04-10 16:25:04,335 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 16:25:04,335 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 10 [2018-04-10 16:25:04,336 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-04-10 16:25:04,340 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-10 16:25:04,343 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-04-10 16:25:04,343 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 4 variables, input treesize:47, output treesize:7 [2018-04-10 16:25:04,364 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-10 16:25:04,365 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-04-10 16:25:04,365 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-04-10 16:25:04,365 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-04-10 16:25:04,365 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-04-10 16:25:04,365 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2018-04-10 16:25:04,365 INFO L87 Difference]: Start difference. First operand 173 states and 189 transitions. Second operand 7 states. [2018-04-10 16:25:04,482 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-10 16:25:04,482 INFO L93 Difference]: Finished difference Result 172 states and 184 transitions. [2018-04-10 16:25:04,482 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-04-10 16:25:04,482 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 31 [2018-04-10 16:25:04,482 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-10 16:25:04,483 INFO L225 Difference]: With dead ends: 172 [2018-04-10 16:25:04,483 INFO L226 Difference]: Without dead ends: 172 [2018-04-10 16:25:04,483 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 33 GetRequests, 25 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=29, Invalid=61, Unknown=0, NotChecked=0, Total=90 [2018-04-10 16:25:04,483 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 172 states. [2018-04-10 16:25:04,485 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 172 to 167. [2018-04-10 16:25:04,485 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 167 states. [2018-04-10 16:25:04,486 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 167 states to 167 states and 179 transitions. [2018-04-10 16:25:04,486 INFO L78 Accepts]: Start accepts. Automaton has 167 states and 179 transitions. Word has length 31 [2018-04-10 16:25:04,486 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-10 16:25:04,486 INFO L459 AbstractCegarLoop]: Abstraction has 167 states and 179 transitions. [2018-04-10 16:25:04,487 INFO L460 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-04-10 16:25:04,487 INFO L276 IsEmpty]: Start isEmpty. Operand 167 states and 179 transitions. [2018-04-10 16:25:04,487 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2018-04-10 16:25:04,487 INFO L347 BasicCegarLoop]: Found error trace [2018-04-10 16:25:04,487 INFO L355 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-10 16:25:04,488 INFO L408 AbstractCegarLoop]: === Iteration 12 === [mainErr51RequiresViolation, mainErr26RequiresViolation, mainErr54RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr31RequiresViolation, mainErr46RequiresViolation, mainErr29RequiresViolation, mainErr58AssertViolationMEMORY_FREE, mainErr3RequiresViolation, mainErr60EnsuresViolationMEMORY_LEAK, mainErr15RequiresViolation, mainErr49RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr55RequiresViolation, mainErr17RequiresViolation, mainErr42RequiresViolation, mainErr30RequiresViolation, mainErr11RequiresViolation, mainErr57RequiresViolation, mainErr24RequiresViolation, mainErr44RequiresViolation, mainErr10RequiresViolation, mainErr43RequiresViolation, mainErr4RequiresViolation, mainErr50RequiresViolation, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr59AssertViolationMEMORY_FREE, mainErr36RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr56RequiresViolation, mainErr48RequiresViolation, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr52RequiresViolation, mainErr45RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr9RequiresViolation, mainErr53RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr34RequiresViolation, mainErr47RequiresViolation, mainErr14RequiresViolation, mainErr40RequiresViolation]=== [2018-04-10 16:25:04,488 INFO L82 PathProgramCache]: Analyzing trace with hash 1040476521, now seen corresponding path program 1 times [2018-04-10 16:25:04,488 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-04-10 16:25:04,488 INFO L68 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-04-10 16:25:04,489 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-10 16:25:04,489 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-10 16:25:04,489 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-10 16:25:04,494 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-10 16:25:04,495 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-10 16:25:04,546 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-10 16:25:04,547 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-04-10 16:25:04,547 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-04-10 16:25:04,547 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-10 16:25:04,555 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-10 16:25:04,557 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-10 16:25:04,568 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 8 [2018-04-10 16:25:04,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 8 treesize of output 7 [2018-04-10 16:25:04,570 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-10 16:25:04,571 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-10 16:25:04,576 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 8 [2018-04-10 16:25:04,577 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-04-10 16:25:04,577 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-04-10 16:25:04,578 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-10 16:25:04,580 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-04-10 16:25:04,581 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 2 variables, input treesize:23, output treesize:15 [2018-04-10 16:25:04,587 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 16 [2018-04-10 16:25:04,589 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 16:25:04,590 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 23 [2018-04-10 16:25:04,590 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-10 16:25:04,593 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-10 16:25:04,601 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 16 [2018-04-10 16:25:04,602 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 16:25:04,603 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 23 [2018-04-10 16:25:04,603 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-04-10 16:25:04,606 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-10 16:25:04,610 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-04-10 16:25:04,611 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 2 variables, input treesize:41, output treesize:33 [2018-04-10 16:25:04,624 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 18 [2018-04-10 16:25:04,626 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 16:25:04,626 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 10 [2018-04-10 16:25:04,626 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-10 16:25:04,629 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-10 16:25:04,643 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 18 [2018-04-10 16:25:04,645 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 16:25:04,645 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 10 [2018-04-10 16:25:04,645 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-04-10 16:25:04,648 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-10 16:25:04,650 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-04-10 16:25:04,650 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 4 variables, input treesize:47, output treesize:7 [2018-04-10 16:25:04,657 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-10 16:25:04,657 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-04-10 16:25:04,658 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 6] total 9 [2018-04-10 16:25:04,658 INFO L442 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-04-10 16:25:04,658 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-04-10 16:25:04,658 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72 [2018-04-10 16:25:04,658 INFO L87 Difference]: Start difference. First operand 167 states and 179 transitions. Second operand 9 states. [2018-04-10 16:25:04,832 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-10 16:25:04,832 INFO L93 Difference]: Finished difference Result 203 states and 219 transitions. [2018-04-10 16:25:04,832 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2018-04-10 16:25:04,832 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 36 [2018-04-10 16:25:04,832 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-10 16:25:04,833 INFO L225 Difference]: With dead ends: 203 [2018-04-10 16:25:04,833 INFO L226 Difference]: Without dead ends: 203 [2018-04-10 16:25:04,833 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 49 GetRequests, 34 SyntacticMatches, 2 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 19 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=54, Invalid=156, Unknown=0, NotChecked=0, Total=210 [2018-04-10 16:25:04,833 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 203 states. [2018-04-10 16:25:04,835 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 203 to 180. [2018-04-10 16:25:04,835 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 180 states. [2018-04-10 16:25:04,835 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 180 states to 180 states and 193 transitions. [2018-04-10 16:25:04,835 INFO L78 Accepts]: Start accepts. Automaton has 180 states and 193 transitions. Word has length 36 [2018-04-10 16:25:04,835 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-10 16:25:04,836 INFO L459 AbstractCegarLoop]: Abstraction has 180 states and 193 transitions. [2018-04-10 16:25:04,836 INFO L460 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-04-10 16:25:04,836 INFO L276 IsEmpty]: Start isEmpty. Operand 180 states and 193 transitions. [2018-04-10 16:25:04,836 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2018-04-10 16:25:04,836 INFO L347 BasicCegarLoop]: Found error trace [2018-04-10 16:25:04,836 INFO L355 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-10 16:25:04,836 INFO L408 AbstractCegarLoop]: === Iteration 13 === [mainErr51RequiresViolation, mainErr26RequiresViolation, mainErr54RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr31RequiresViolation, mainErr46RequiresViolation, mainErr29RequiresViolation, mainErr58AssertViolationMEMORY_FREE, mainErr3RequiresViolation, mainErr60EnsuresViolationMEMORY_LEAK, mainErr15RequiresViolation, mainErr49RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr55RequiresViolation, mainErr17RequiresViolation, mainErr42RequiresViolation, mainErr30RequiresViolation, mainErr11RequiresViolation, mainErr57RequiresViolation, mainErr24RequiresViolation, mainErr44RequiresViolation, mainErr10RequiresViolation, mainErr43RequiresViolation, mainErr4RequiresViolation, mainErr50RequiresViolation, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr59AssertViolationMEMORY_FREE, mainErr36RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr56RequiresViolation, mainErr48RequiresViolation, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr52RequiresViolation, mainErr45RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr9RequiresViolation, mainErr53RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr34RequiresViolation, mainErr47RequiresViolation, mainErr14RequiresViolation, mainErr40RequiresViolation]=== [2018-04-10 16:25:04,836 INFO L82 PathProgramCache]: Analyzing trace with hash -2104967361, now seen corresponding path program 1 times [2018-04-10 16:25:04,836 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-04-10 16:25:04,837 INFO L68 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-04-10 16:25:04,837 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-10 16:25:04,837 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-10 16:25:04,837 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-10 16:25:04,841 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-10 16:25:04,841 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-10 16:25:04,842 INFO L431 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown lemma type! [2018-04-10 16:25:04,842 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-04-10 16:25:04,843 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-04-10 16:25:04,843 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-10 16:25:04,855 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-10 16:25:04,857 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-10 16:25:04,915 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-10 16:25:04,915 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-04-10 16:25:04,915 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6] total 6 [2018-04-10 16:25:04,915 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-04-10 16:25:04,916 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-04-10 16:25:04,916 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=27, Unknown=3, NotChecked=0, Total=42 [2018-04-10 16:25:04,916 INFO L87 Difference]: Start difference. First operand 180 states and 193 transitions. Second operand 7 states. [2018-04-10 16:25:05,075 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-10 16:25:05,075 INFO L93 Difference]: Finished difference Result 192 states and 204 transitions. [2018-04-10 16:25:05,076 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-04-10 16:25:05,076 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 37 [2018-04-10 16:25:05,076 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-10 16:25:05,076 INFO L225 Difference]: With dead ends: 192 [2018-04-10 16:25:05,077 INFO L226 Difference]: Without dead ends: 169 [2018-04-10 16:25:05,077 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 39 GetRequests, 31 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=27, Invalid=60, Unknown=3, NotChecked=0, Total=90 [2018-04-10 16:25:05,077 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 169 states. [2018-04-10 16:25:05,079 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 169 to 169. [2018-04-10 16:25:05,079 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 169 states. [2018-04-10 16:25:05,080 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 169 states to 169 states and 181 transitions. [2018-04-10 16:25:05,080 INFO L78 Accepts]: Start accepts. Automaton has 169 states and 181 transitions. Word has length 37 [2018-04-10 16:25:05,080 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-10 16:25:05,080 INFO L459 AbstractCegarLoop]: Abstraction has 169 states and 181 transitions. [2018-04-10 16:25:05,080 INFO L460 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-04-10 16:25:05,080 INFO L276 IsEmpty]: Start isEmpty. Operand 169 states and 181 transitions. [2018-04-10 16:25:05,081 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2018-04-10 16:25:05,081 INFO L347 BasicCegarLoop]: Found error trace [2018-04-10 16:25:05,081 INFO L355 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-10 16:25:05,082 INFO L408 AbstractCegarLoop]: === Iteration 14 === [mainErr51RequiresViolation, mainErr26RequiresViolation, mainErr54RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr31RequiresViolation, mainErr46RequiresViolation, mainErr29RequiresViolation, mainErr58AssertViolationMEMORY_FREE, mainErr3RequiresViolation, mainErr60EnsuresViolationMEMORY_LEAK, mainErr15RequiresViolation, mainErr49RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr55RequiresViolation, mainErr17RequiresViolation, mainErr42RequiresViolation, mainErr30RequiresViolation, mainErr11RequiresViolation, mainErr57RequiresViolation, mainErr24RequiresViolation, mainErr44RequiresViolation, mainErr10RequiresViolation, mainErr43RequiresViolation, mainErr4RequiresViolation, mainErr50RequiresViolation, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr59AssertViolationMEMORY_FREE, mainErr36RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr56RequiresViolation, mainErr48RequiresViolation, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr52RequiresViolation, mainErr45RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr9RequiresViolation, mainErr53RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr34RequiresViolation, mainErr47RequiresViolation, mainErr14RequiresViolation, mainErr40RequiresViolation]=== [2018-04-10 16:25:05,082 INFO L82 PathProgramCache]: Analyzing trace with hash 557618967, now seen corresponding path program 1 times [2018-04-10 16:25:05,082 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-04-10 16:25:05,082 INFO L68 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-04-10 16:25:05,083 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-10 16:25:05,083 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-10 16:25:05,083 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-10 16:25:05,093 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-10 16:25:05,094 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-10 16:25:05,100 INFO L431 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown lemma type! [2018-04-10 16:25:05,100 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-04-10 16:25:05,100 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-04-10 16:25:05,101 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-10 16:25:05,148 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-10 16:25:05,152 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-10 16:25:05,174 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 16:25:05,175 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 16:25:05,175 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 24 [2018-04-10 16:25:05,176 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-10 16:25:05,180 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-10 16:25:05,180 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:17, output treesize:15 [2018-04-10 16:25:05,188 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 8 [2018-04-10 16:25:05,190 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-04-10 16:25:05,190 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-10 16:25:05,191 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-10 16:25:05,195 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-04-10 16:25:05,195 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:26, output treesize:23 [2018-04-10 16:25:05,209 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 39 treesize of output 35 [2018-04-10 16:25:05,211 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 13 [2018-04-10 16:25:05,211 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-10 16:25:05,215 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-10 16:25:05,219 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-04-10 16:25:05,219 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:44, output treesize:36 [2018-04-10 16:25:05,240 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 38 treesize of output 26 [2018-04-10 16:25:05,242 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 1 [2018-04-10 16:25:05,242 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-10 16:25:05,245 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 10 [2018-04-10 16:25:05,246 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-04-10 16:25:05,247 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-10 16:25:05,250 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-04-10 16:25:05,250 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 4 variables, input treesize:43, output treesize:15 [2018-04-10 16:25:05,263 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 11 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-10 16:25:05,264 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-04-10 16:25:05,264 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2018-04-10 16:25:05,264 INFO L442 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-04-10 16:25:05,264 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-04-10 16:25:05,264 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=46, Unknown=0, NotChecked=0, Total=72 [2018-04-10 16:25:05,264 INFO L87 Difference]: Start difference. First operand 169 states and 181 transitions. Second operand 9 states. [2018-04-10 16:25:05,464 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-10 16:25:05,464 INFO L93 Difference]: Finished difference Result 247 states and 262 transitions. [2018-04-10 16:25:05,464 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-04-10 16:25:05,465 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 42 [2018-04-10 16:25:05,465 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-10 16:25:05,465 INFO L225 Difference]: With dead ends: 247 [2018-04-10 16:25:05,465 INFO L226 Difference]: Without dead ends: 247 [2018-04-10 16:25:05,465 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 46 GetRequests, 34 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=69, Invalid=113, Unknown=0, NotChecked=0, Total=182 [2018-04-10 16:25:05,466 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 247 states. [2018-04-10 16:25:05,468 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 247 to 168. [2018-04-10 16:25:05,468 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 168 states. [2018-04-10 16:25:05,469 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 168 states to 168 states and 180 transitions. [2018-04-10 16:25:05,469 INFO L78 Accepts]: Start accepts. Automaton has 168 states and 180 transitions. Word has length 42 [2018-04-10 16:25:05,469 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-10 16:25:05,469 INFO L459 AbstractCegarLoop]: Abstraction has 168 states and 180 transitions. [2018-04-10 16:25:05,469 INFO L460 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-04-10 16:25:05,469 INFO L276 IsEmpty]: Start isEmpty. Operand 168 states and 180 transitions. [2018-04-10 16:25:05,470 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2018-04-10 16:25:05,470 INFO L347 BasicCegarLoop]: Found error trace [2018-04-10 16:25:05,470 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] [2018-04-10 16:25:05,470 INFO L408 AbstractCegarLoop]: === Iteration 15 === [mainErr51RequiresViolation, mainErr26RequiresViolation, mainErr54RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr31RequiresViolation, mainErr46RequiresViolation, mainErr29RequiresViolation, mainErr58AssertViolationMEMORY_FREE, mainErr3RequiresViolation, mainErr60EnsuresViolationMEMORY_LEAK, mainErr15RequiresViolation, mainErr49RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr55RequiresViolation, mainErr17RequiresViolation, mainErr42RequiresViolation, mainErr30RequiresViolation, mainErr11RequiresViolation, mainErr57RequiresViolation, mainErr24RequiresViolation, mainErr44RequiresViolation, mainErr10RequiresViolation, mainErr43RequiresViolation, mainErr4RequiresViolation, mainErr50RequiresViolation, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr59AssertViolationMEMORY_FREE, mainErr36RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr56RequiresViolation, mainErr48RequiresViolation, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr52RequiresViolation, mainErr45RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr9RequiresViolation, mainErr53RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr34RequiresViolation, mainErr47RequiresViolation, mainErr14RequiresViolation, mainErr40RequiresViolation]=== [2018-04-10 16:25:05,470 INFO L82 PathProgramCache]: Analyzing trace with hash -1821501930, now seen corresponding path program 1 times [2018-04-10 16:25:05,470 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-04-10 16:25:05,471 INFO L68 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-04-10 16:25:05,471 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-10 16:25:05,471 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-10 16:25:05,472 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-10 16:25:05,478 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-10 16:25:05,479 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-10 16:25:05,504 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-10 16:25:05,505 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-04-10 16:25:05,505 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-04-10 16:25:05,505 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-04-10 16:25:05,505 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-04-10 16:25:05,505 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-04-10 16:25:05,505 INFO L87 Difference]: Start difference. First operand 168 states and 180 transitions. Second operand 3 states. [2018-04-10 16:25:05,519 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-10 16:25:05,519 INFO L93 Difference]: Finished difference Result 248 states and 266 transitions. [2018-04-10 16:25:05,522 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-04-10 16:25:05,522 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 49 [2018-04-10 16:25:05,522 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-10 16:25:05,523 INFO L225 Difference]: With dead ends: 248 [2018-04-10 16:25:05,523 INFO L226 Difference]: Without dead ends: 248 [2018-04-10 16:25:05,523 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-10 16:25:05,523 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 248 states. [2018-04-10 16:25:05,526 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 248 to 193. [2018-04-10 16:25:05,526 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 193 states. [2018-04-10 16:25:05,526 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 193 states to 193 states and 206 transitions. [2018-04-10 16:25:05,526 INFO L78 Accepts]: Start accepts. Automaton has 193 states and 206 transitions. Word has length 49 [2018-04-10 16:25:05,526 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-10 16:25:05,526 INFO L459 AbstractCegarLoop]: Abstraction has 193 states and 206 transitions. [2018-04-10 16:25:05,526 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-04-10 16:25:05,526 INFO L276 IsEmpty]: Start isEmpty. Operand 193 states and 206 transitions. [2018-04-10 16:25:05,527 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2018-04-10 16:25:05,527 INFO L347 BasicCegarLoop]: Found error trace [2018-04-10 16:25:05,527 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-10 16:25:05,527 INFO L408 AbstractCegarLoop]: === Iteration 16 === [mainErr51RequiresViolation, mainErr26RequiresViolation, mainErr54RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr31RequiresViolation, mainErr46RequiresViolation, mainErr29RequiresViolation, mainErr58AssertViolationMEMORY_FREE, mainErr3RequiresViolation, mainErr60EnsuresViolationMEMORY_LEAK, mainErr15RequiresViolation, mainErr49RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr55RequiresViolation, mainErr17RequiresViolation, mainErr42RequiresViolation, mainErr30RequiresViolation, mainErr11RequiresViolation, mainErr57RequiresViolation, mainErr24RequiresViolation, mainErr44RequiresViolation, mainErr10RequiresViolation, mainErr43RequiresViolation, mainErr4RequiresViolation, mainErr50RequiresViolation, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr59AssertViolationMEMORY_FREE, mainErr36RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr56RequiresViolation, mainErr48RequiresViolation, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr52RequiresViolation, mainErr45RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr9RequiresViolation, mainErr53RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr34RequiresViolation, mainErr47RequiresViolation, mainErr14RequiresViolation, mainErr40RequiresViolation]=== [2018-04-10 16:25:05,527 INFO L82 PathProgramCache]: Analyzing trace with hash -114058552, now seen corresponding path program 1 times [2018-04-10 16:25:05,527 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-04-10 16:25:05,527 INFO L68 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-04-10 16:25:05,528 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-10 16:25:05,528 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-10 16:25:05,528 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-10 16:25:05,534 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-10 16:25:05,535 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-10 16:25:05,539 INFO L431 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown lemma type! [2018-04-10 16:25:05,539 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-04-10 16:25:05,539 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-04-10 16:25:05,539 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-10 16:25:05,556 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-10 16:25:05,560 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-10 16:25:05,581 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 16:25:05,582 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 16:25:05,583 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 24 [2018-04-10 16:25:05,583 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-10 16:25:05,589 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-10 16:25:05,589 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:29, output treesize:27 [2018-04-10 16:25:05,604 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 8 [2018-04-10 16:25:05,605 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-04-10 16:25:05,605 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-10 16:25:05,607 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-10 16:25:05,616 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 8 [2018-04-10 16:25:05,618 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-04-10 16:25:05,618 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-04-10 16:25:05,619 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-10 16:25:05,627 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-04-10 16:25:05,627 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 3 variables, input treesize:46, output treesize:39 [2018-04-10 16:25:05,641 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 14 [2018-04-10 16:25:05,643 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 3 [2018-04-10 16:25:05,643 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-10 16:25:05,645 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-10 16:25:05,652 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-04-10 16:25:05,652 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:46, output treesize:35 [2018-04-10 16:25:05,724 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 31 treesize of output 41 [2018-04-10 16:25:05,728 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 16:25:05,729 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 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 36 [2018-04-10 16:25:05,729 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-10 16:25:05,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, 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 27 [2018-04-10 16:25:05,747 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-04-10 16:25:05,755 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-10 16:25:05,765 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2018-04-10 16:25:05,766 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 3 variables, input treesize:48, output treesize:44 [2018-04-10 16:25:05,861 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 4 case distinctions, treesize of input 46 treesize of output 57 [2018-04-10 16:25:05,875 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 44 treesize of output 55 [2018-04-10 16:25:05,875 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 2 xjuncts. [2018-04-10 16:25:05,908 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 39 treesize of output 38 [2018-04-10 16:25:05,908 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-04-10 16:25:05,929 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-04-10 16:25:05,952 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-2 vars, End of recursive call: 4 dim-0 vars, and 2 xjuncts. [2018-04-10 16:25:05,952 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 4 variables, input treesize:57, output treesize:92 [2018-04-10 16:25:06,072 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 4 new quantified variables, introduced 2 case distinctions, treesize of input 80 treesize of output 63 [2018-04-10 16:25:06,079 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 44 treesize of output 33 [2018-04-10 16:25:06,080 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-04-10 16:25:06,113 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 52 treesize of output 40 [2018-04-10 16:25:06,114 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-04-10 16:25:06,143 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 40 treesize of output 35 [2018-04-10 16:25:06,144 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-04-10 16:25:06,180 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 48 treesize of output 41 [2018-04-10 16:25:06,181 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 2 xjuncts. [2018-04-10 16:25:06,218 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 35 treesize of output 26 [2018-04-10 16:25:06,218 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2018-04-10 16:25:06,254 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 37 treesize of output 28 [2018-04-10 16:25:06,254 INFO L267 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 1 xjuncts. [2018-04-10 16:25:06,255 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 22 [2018-04-10 16:25:06,256 INFO L267 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 1 xjuncts. [2018-04-10 16:25:06,295 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 40 treesize of output 42 [2018-04-10 16:25:06,296 INFO L267 ElimStorePlain]: Start of recursive call 10: 2 dim-0 vars, End of recursive call: 2 dim-0 vars, and 3 xjuncts. [2018-04-10 16:25:06,347 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable 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 27 treesize of output 22 [2018-04-10 16:25:06,348 INFO L267 ElimStorePlain]: Start of recursive call 11: End of recursive call: and 1 xjuncts. [2018-04-10 16:25:06,393 INFO L267 ElimStorePlain]: Start of recursive call 2: 8 dim-1 vars, End of recursive call: 5 dim-0 vars, and 7 xjuncts. [2018-04-10 16:25:06,450 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 34 [2018-04-10 16:25:06,452 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 1 [2018-04-10 16:25:06,453 INFO L267 ElimStorePlain]: Start of recursive call 13: End of recursive call: and 1 xjuncts. [2018-04-10 16:25:06,458 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 10 [2018-04-10 16:25:06,458 INFO L267 ElimStorePlain]: Start of recursive call 14: End of recursive call: and 1 xjuncts. [2018-04-10 16:25:06,462 INFO L267 ElimStorePlain]: Start of recursive call 12: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-10 16:25:06,513 INFO L267 ElimStorePlain]: Start of recursive call 1: 5 dim-0 vars, 2 dim-2 vars, End of recursive call: 6 dim-0 vars, and 7 xjuncts. [2018-04-10 16:25:06,513 INFO L202 ElimStorePlain]: Needed 14 recursive calls to eliminate 7 variables, input treesize:127, output treesize:109 [2018-04-10 16:25:06,577 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-10 16:25:06,577 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-04-10 16:25:06,577 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [14] total 14 [2018-04-10 16:25:06,578 INFO L442 AbstractCegarLoop]: Interpolant automaton has 15 states [2018-04-10 16:25:06,578 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2018-04-10 16:25:06,578 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=53, Invalid=157, Unknown=0, NotChecked=0, Total=210 [2018-04-10 16:25:06,578 INFO L87 Difference]: Start difference. First operand 193 states and 206 transitions. Second operand 15 states. [2018-04-10 16:25:07,232 WARN L151 SmtUtils]: Spent 368ms on a formula simplification. DAG size of input: 53 DAG size of output 46 [2018-04-10 16:25:07,695 WARN L151 SmtUtils]: Spent 341ms on a formula simplification. DAG size of input: 60 DAG size of output 49 [2018-04-10 16:25:08,047 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-10 16:25:08,048 INFO L93 Difference]: Finished difference Result 275 states and 296 transitions. [2018-04-10 16:25:08,048 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2018-04-10 16:25:08,048 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 56 [2018-04-10 16:25:08,048 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-10 16:25:08,049 INFO L225 Difference]: With dead ends: 275 [2018-04-10 16:25:08,049 INFO L226 Difference]: Without dead ends: 275 [2018-04-10 16:25:08,050 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 71 GetRequests, 42 SyntacticMatches, 0 SemanticMatches, 29 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 158 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=245, Invalid=685, Unknown=0, NotChecked=0, Total=930 [2018-04-10 16:25:08,050 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 275 states. [2018-04-10 16:25:08,053 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 275 to 226. [2018-04-10 16:25:08,053 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 226 states. [2018-04-10 16:25:08,054 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 226 states to 226 states and 244 transitions. [2018-04-10 16:25:08,054 INFO L78 Accepts]: Start accepts. Automaton has 226 states and 244 transitions. Word has length 56 [2018-04-10 16:25:08,055 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-10 16:25:08,055 INFO L459 AbstractCegarLoop]: Abstraction has 226 states and 244 transitions. [2018-04-10 16:25:08,055 INFO L460 AbstractCegarLoop]: Interpolant automaton has 15 states. [2018-04-10 16:25:08,055 INFO L276 IsEmpty]: Start isEmpty. Operand 226 states and 244 transitions. [2018-04-10 16:25:08,055 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2018-04-10 16:25:08,055 INFO L347 BasicCegarLoop]: Found error trace [2018-04-10 16:25:08,056 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-10 16:25:08,056 INFO L408 AbstractCegarLoop]: === Iteration 17 === [mainErr51RequiresViolation, mainErr26RequiresViolation, mainErr54RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr31RequiresViolation, mainErr46RequiresViolation, mainErr29RequiresViolation, mainErr58AssertViolationMEMORY_FREE, mainErr3RequiresViolation, mainErr60EnsuresViolationMEMORY_LEAK, mainErr15RequiresViolation, mainErr49RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr55RequiresViolation, mainErr17RequiresViolation, mainErr42RequiresViolation, mainErr30RequiresViolation, mainErr11RequiresViolation, mainErr57RequiresViolation, mainErr24RequiresViolation, mainErr44RequiresViolation, mainErr10RequiresViolation, mainErr43RequiresViolation, mainErr4RequiresViolation, mainErr50RequiresViolation, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr59AssertViolationMEMORY_FREE, mainErr36RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr56RequiresViolation, mainErr48RequiresViolation, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr52RequiresViolation, mainErr45RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr9RequiresViolation, mainErr53RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr34RequiresViolation, mainErr47RequiresViolation, mainErr14RequiresViolation, mainErr40RequiresViolation]=== [2018-04-10 16:25:08,056 INFO L82 PathProgramCache]: Analyzing trace with hash -114058551, now seen corresponding path program 1 times [2018-04-10 16:25:08,056 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-04-10 16:25:08,056 INFO L68 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-04-10 16:25:08,057 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-10 16:25:08,057 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-10 16:25:08,057 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-10 16:25:08,066 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-10 16:25:08,067 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-10 16:25:08,070 INFO L431 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown lemma type! [2018-04-10 16:25:08,070 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-04-10 16:25:08,071 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-04-10 16:25:08,071 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-10 16:25:08,100 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-10 16:25:08,104 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-10 16:25:08,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 6 treesize of output 5 [2018-04-10 16:25:08,142 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-10 16:25:08,153 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 16:25:08,154 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 16:25:08,154 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 15 [2018-04-10 16:25:08,155 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-10 16:25:08,164 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-10 16:25:08,164 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:32, output treesize:25 [2018-04-10 16:25:08,181 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 8 [2018-04-10 16:25:08,183 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-04-10 16:25:08,183 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-10 16:25:08,185 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-10 16:25:08,201 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 8 [2018-04-10 16:25:08,203 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-04-10 16:25:08,203 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-04-10 16:25:08,205 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-10 16:25:08,216 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-04-10 16:25:08,216 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 3 variables, input treesize:47, output treesize:37 [2018-04-10 16:25:08,259 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 16:25:08,265 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 60 treesize of output 59 [2018-04-10 16:25:08,268 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 13 [2018-04-10 16:25:08,268 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-10 16:25:08,278 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-10 16:25:08,299 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 30 [2018-04-10 16:25:08,301 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 13 [2018-04-10 16:25:08,301 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-04-10 16:25:08,307 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-10 16:25:08,321 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-04-10 16:25:08,322 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 3 variables, input treesize:79, output treesize:63 [2018-04-10 16:25:08,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 2 new quantified variables, introduced 0 case distinctions, treesize of input 82 treesize of output 72 [2018-04-10 16:25:08,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 20 treesize of output 31 [2018-04-10 16:25:08,409 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 2 xjuncts. [2018-04-10 16:25:08,422 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-04-10 16:25:08,450 INFO L682 Elim1Store]: detected equality via solver [2018-04-10 16:25:08,451 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 73 treesize of output 65 [2018-04-10 16:25:08,455 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 20 [2018-04-10 16:25:08,455 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-04-10 16:25:08,462 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-10 16:25:08,467 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 81 treesize of output 68 [2018-04-10 16:25:08,469 INFO L682 Elim1Store]: detected equality via solver [2018-04-10 16:25:08,470 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 28 [2018-04-10 16:25:08,470 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2018-04-10 16:25:08,478 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-10 16:25:08,501 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 2 dim-2 vars, End of recursive call: 5 dim-0 vars, and 2 xjuncts. [2018-04-10 16:25:08,501 INFO L202 ElimStorePlain]: Needed 7 recursive calls to eliminate 5 variables, input treesize:98, output treesize:143 [2018-04-10 16:25:14,538 WARN L148 SmtUtils]: Spent 6015ms on a formula simplification that was a NOOP. DAG size: 59 [2018-04-10 16:25:14,593 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 96 treesize of output 79 [2018-04-10 16:25:14,601 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 1 case distinctions, treesize of input 13 treesize of output 10 [2018-04-10 16:25:14,601 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 2 xjuncts. [2018-04-10 16:25:14,623 INFO L682 Elim1Store]: detected equality via solver [2018-04-10 16:25:14,624 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 39 treesize of output 29 [2018-04-10 16:25:14,624 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-04-10 16:25:14,640 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-04-10 16:25:14,710 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 52 treesize of output 44 [2018-04-10 16:25:14,712 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2018-04-10 16:25:14,713 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2018-04-10 16:25:14,729 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 1 [2018-04-10 16:25:14,729 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2018-04-10 16:25:14,738 INFO L267 ElimStorePlain]: Start of recursive call 5: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-10 16:25:14,741 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 47 [2018-04-10 16:25:14,744 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 6 [2018-04-10 16:25:14,744 INFO L267 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 1 xjuncts. [2018-04-10 16:25:14,758 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2018-04-10 16:25:14,759 INFO L267 ElimStorePlain]: Start of recursive call 10: End of recursive call: and 1 xjuncts. [2018-04-10 16:25:14,767 INFO L267 ElimStorePlain]: Start of recursive call 8: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-10 16:25:14,806 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 74 treesize of output 72 [2018-04-10 16:25:14,808 INFO L682 Elim1Store]: detected equality via solver [2018-04-10 16:25:14,808 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2018-04-10 16:25:14,808 INFO L267 ElimStorePlain]: Start of recursive call 12: End of recursive call: and 1 xjuncts. [2018-04-10 16:25:14,820 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 1 [2018-04-10 16:25:14,820 INFO L267 ElimStorePlain]: Start of recursive call 13: End of recursive call: and 1 xjuncts. [2018-04-10 16:25:14,828 INFO L267 ElimStorePlain]: Start of recursive call 11: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-10 16:25:14,882 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 50 treesize of output 43 [2018-04-10 16:25:14,896 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 1 [2018-04-10 16:25:14,896 INFO L267 ElimStorePlain]: Start of recursive call 15: End of recursive call: and 1 xjuncts. [2018-04-10 16:25:14,908 INFO L682 Elim1Store]: detected equality via solver [2018-04-10 16:25:14,909 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 13 [2018-04-10 16:25:14,909 INFO L267 ElimStorePlain]: Start of recursive call 16: End of recursive call: and 1 xjuncts. [2018-04-10 16:25:14,917 INFO L267 ElimStorePlain]: Start of recursive call 14: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-10 16:25:14,952 INFO L267 ElimStorePlain]: Start of recursive call 1: 9 dim-0 vars, 4 dim-2 vars, End of recursive call: and 2 xjuncts. [2018-04-10 16:25:14,952 INFO L202 ElimStorePlain]: Needed 16 recursive calls to eliminate 13 variables, input treesize:171, output treesize:23 [2018-04-10 16:25:14,994 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-10 16:25:14,995 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-04-10 16:25:14,995 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [14] total 14 [2018-04-10 16:25:14,995 INFO L442 AbstractCegarLoop]: Interpolant automaton has 15 states [2018-04-10 16:25:14,995 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2018-04-10 16:25:14,995 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=39, Invalid=171, Unknown=0, NotChecked=0, Total=210 [2018-04-10 16:25:14,995 INFO L87 Difference]: Start difference. First operand 226 states and 244 transitions. Second operand 15 states. [2018-04-10 16:25:21,349 WARN L151 SmtUtils]: Spent 6045ms on a formula simplification. DAG size of input: 67 DAG size of output 64 [2018-04-10 16:25:27,494 WARN L151 SmtUtils]: Spent 6040ms on a formula simplification. DAG size of input: 72 DAG size of output 69 [2018-04-10 16:25:33,559 WARN L151 SmtUtils]: Spent 6046ms on a formula simplification. DAG size of input: 71 DAG size of output 68 [2018-04-10 16:25:37,390 WARN L151 SmtUtils]: Spent 3803ms on a formula simplification. DAG size of input: 78 DAG size of output 68 [2018-04-10 16:25:37,623 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-10 16:25:37,623 INFO L93 Difference]: Finished difference Result 264 states and 285 transitions. [2018-04-10 16:25:37,623 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2018-04-10 16:25:37,624 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 56 [2018-04-10 16:25:37,624 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-10 16:25:37,624 INFO L225 Difference]: With dead ends: 264 [2018-04-10 16:25:37,624 INFO L226 Difference]: Without dead ends: 264 [2018-04-10 16:25:37,625 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 69 GetRequests, 42 SyntacticMatches, 0 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 93 ImplicationChecksByTransitivity, 28.4s TimeCoverageRelationStatistics Valid=188, Invalid=624, Unknown=0, NotChecked=0, Total=812 [2018-04-10 16:25:37,625 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 264 states. [2018-04-10 16:25:37,627 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 264 to 230. [2018-04-10 16:25:37,627 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 230 states. [2018-04-10 16:25:37,627 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 230 states to 230 states and 247 transitions. [2018-04-10 16:25:37,627 INFO L78 Accepts]: Start accepts. Automaton has 230 states and 247 transitions. Word has length 56 [2018-04-10 16:25:37,627 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-10 16:25:37,627 INFO L459 AbstractCegarLoop]: Abstraction has 230 states and 247 transitions. [2018-04-10 16:25:37,627 INFO L460 AbstractCegarLoop]: Interpolant automaton has 15 states. [2018-04-10 16:25:37,627 INFO L276 IsEmpty]: Start isEmpty. Operand 230 states and 247 transitions. [2018-04-10 16:25:37,628 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2018-04-10 16:25:37,628 INFO L347 BasicCegarLoop]: Found error trace [2018-04-10 16:25:37,628 INFO L355 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-10 16:25:37,628 INFO L408 AbstractCegarLoop]: === Iteration 18 === [mainErr51RequiresViolation, mainErr26RequiresViolation, mainErr54RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr31RequiresViolation, mainErr46RequiresViolation, mainErr29RequiresViolation, mainErr58AssertViolationMEMORY_FREE, mainErr3RequiresViolation, mainErr60EnsuresViolationMEMORY_LEAK, mainErr15RequiresViolation, mainErr49RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr55RequiresViolation, mainErr17RequiresViolation, mainErr42RequiresViolation, mainErr30RequiresViolation, mainErr11RequiresViolation, mainErr57RequiresViolation, mainErr24RequiresViolation, mainErr44RequiresViolation, mainErr10RequiresViolation, mainErr43RequiresViolation, mainErr4RequiresViolation, mainErr50RequiresViolation, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr59AssertViolationMEMORY_FREE, mainErr36RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr56RequiresViolation, mainErr48RequiresViolation, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr52RequiresViolation, mainErr45RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr9RequiresViolation, mainErr53RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr34RequiresViolation, mainErr47RequiresViolation, mainErr14RequiresViolation, mainErr40RequiresViolation]=== [2018-04-10 16:25:37,628 INFO L82 PathProgramCache]: Analyzing trace with hash -947949420, now seen corresponding path program 1 times [2018-04-10 16:25:37,628 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-04-10 16:25:37,628 INFO L68 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-04-10 16:25:37,629 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-10 16:25:37,629 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-10 16:25:37,629 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-10 16:25:37,636 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-10 16:25:37,637 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-10 16:25:37,639 INFO L431 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown lemma type! [2018-04-10 16:25:37,639 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-04-10 16:25:37,639 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-04-10 16:25:37,640 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-10 16:25:37,662 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-10 16:25:37,666 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-10 16:25:37,688 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 16:25:37,689 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 16:25:37,689 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 24 [2018-04-10 16:25:37,690 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-10 16:25:37,696 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-10 16:25:37,696 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:26, output treesize:24 [2018-04-10 16:25:37,707 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 8 [2018-04-10 16:25:37,709 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-04-10 16:25:37,709 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-10 16:25:37,710 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-10 16:25:37,728 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-04-10 16:25:37,728 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:40, output treesize:32 [2018-04-10 16:25:37,763 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 16:25:37,769 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 39 treesize of output 38 [2018-04-10 16:25:37,772 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 13 [2018-04-10 16:25:37,772 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-10 16:25:37,778 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-10 16:25:37,788 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-04-10 16:25:37,788 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:53, output treesize:45 [2018-04-10 16:25:37,847 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-10 16:25:37,855 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 2 case distinctions, treesize of input 20 treesize of output 31 [2018-04-10 16:25:37,855 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 2 xjuncts. [2018-04-10 16:25:37,865 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-04-10 16:25:37,880 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: 3 dim-0 vars, and 2 xjuncts. [2018-04-10 16:25:37,880 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:58, output treesize:90 [2018-04-10 16:25:53,946 WARN L148 SmtUtils]: Spent 16036ms on a formula simplification that was a NOOP. DAG size: 34 [2018-04-10 16:26:12,018 WARN L148 SmtUtils]: Spent 18031ms on a formula simplification that was a NOOP. DAG size: 36 [2018-04-10 16:26:32,133 WARN L148 SmtUtils]: Spent 20043ms on a formula simplification that was a NOOP. DAG size: 38 [2018-04-10 16:26:32,137 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 58 treesize of output 40 [2018-04-10 16:26:32,146 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 16:26:32,147 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 16:26:32,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, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 11 [2018-04-10 16:26:32,147 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-10 16:26:32,153 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 10 [2018-04-10 16:26:32,153 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-04-10 16:26:32,157 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-10 16:26:32,170 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 47 treesize of output 35 [2018-04-10 16:26:32,172 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 10 [2018-04-10 16:26:32,173 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2018-04-10 16:26:32,178 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 1 [2018-04-10 16:26:32,178 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2018-04-10 16:26:32,181 INFO L267 ElimStorePlain]: Start of recursive call 5: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-10 16:26:32,188 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-04-10 16:26:32,188 INFO L202 ElimStorePlain]: Needed 7 recursive calls to eliminate 5 variables, input treesize:106, output treesize:19 [2018-04-10 16:26:32,226 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 16:26:32,227 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 21 [2018-04-10 16:26:32,227 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-10 16:26:32,231 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-04-10 16:26:32,231 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:25, output treesize:15 [2018-04-10 16:26:32,275 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-10 16:26:32,276 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-04-10 16:26:32,276 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [17] total 17 [2018-04-10 16:26:32,276 INFO L442 AbstractCegarLoop]: Interpolant automaton has 18 states [2018-04-10 16:26:32,276 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2018-04-10 16:26:32,276 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=63, Invalid=243, Unknown=0, NotChecked=0, Total=306 [2018-04-10 16:26:32,276 INFO L87 Difference]: Start difference. First operand 230 states and 247 transitions. Second operand 18 states. [2018-04-10 16:26:48,567 WARN L148 SmtUtils]: Spent 16023ms on a formula simplification that was a NOOP. DAG size: 37 [2018-04-10 16:27:06,643 WARN L148 SmtUtils]: Spent 18028ms on a formula simplification that was a NOOP. DAG size: 39 [2018-04-10 16:27:42,864 WARN L151 SmtUtils]: Spent 36129ms on a formula simplification. DAG size of input: 49 DAG size of output 43 [2018-04-10 16:28:18,949 WARN L151 SmtUtils]: Spent 36068ms on a formula simplification. DAG size of input: 56 DAG size of output 48 [2018-04-10 16:28:19,232 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-10 16:28:19,232 INFO L93 Difference]: Finished difference Result 277 states and 298 transitions. [2018-04-10 16:28:19,232 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2018-04-10 16:28:19,232 INFO L78 Accepts]: Start accepts. Automaton has 18 states. Word has length 63 [2018-04-10 16:28:19,233 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-10 16:28:19,233 INFO L225 Difference]: With dead ends: 277 [2018-04-10 16:28:19,233 INFO L226 Difference]: Without dead ends: 277 [2018-04-10 16:28:19,234 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 79 GetRequests, 45 SyntacticMatches, 1 SemanticMatches, 33 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 224 ImplicationChecksByTransitivity, 160.8s TimeCoverageRelationStatistics Valid=239, Invalid=951, Unknown=0, NotChecked=0, Total=1190 [2018-04-10 16:28:19,234 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 277 states. [2018-04-10 16:28:19,235 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 277 to 256. [2018-04-10 16:28:19,236 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 256 states. [2018-04-10 16:28:19,236 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 256 states to 256 states and 283 transitions. [2018-04-10 16:28:19,236 INFO L78 Accepts]: Start accepts. Automaton has 256 states and 283 transitions. Word has length 63 [2018-04-10 16:28:19,236 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-10 16:28:19,236 INFO L459 AbstractCegarLoop]: Abstraction has 256 states and 283 transitions. [2018-04-10 16:28:19,236 INFO L460 AbstractCegarLoop]: Interpolant automaton has 18 states. [2018-04-10 16:28:19,236 INFO L276 IsEmpty]: Start isEmpty. Operand 256 states and 283 transitions. [2018-04-10 16:28:19,237 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2018-04-10 16:28:19,237 INFO L347 BasicCegarLoop]: Found error trace [2018-04-10 16:28:19,237 INFO L355 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-10 16:28:19,237 INFO L408 AbstractCegarLoop]: === Iteration 19 === [mainErr51RequiresViolation, mainErr26RequiresViolation, mainErr54RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr31RequiresViolation, mainErr46RequiresViolation, mainErr29RequiresViolation, mainErr58AssertViolationMEMORY_FREE, mainErr3RequiresViolation, mainErr60EnsuresViolationMEMORY_LEAK, mainErr15RequiresViolation, mainErr49RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr55RequiresViolation, mainErr17RequiresViolation, mainErr42RequiresViolation, mainErr30RequiresViolation, mainErr11RequiresViolation, mainErr57RequiresViolation, mainErr24RequiresViolation, mainErr44RequiresViolation, mainErr10RequiresViolation, mainErr43RequiresViolation, mainErr4RequiresViolation, mainErr50RequiresViolation, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr59AssertViolationMEMORY_FREE, mainErr36RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr56RequiresViolation, mainErr48RequiresViolation, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr52RequiresViolation, mainErr45RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr9RequiresViolation, mainErr53RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr34RequiresViolation, mainErr47RequiresViolation, mainErr14RequiresViolation, mainErr40RequiresViolation]=== [2018-04-10 16:28:19,237 INFO L82 PathProgramCache]: Analyzing trace with hash -947949419, now seen corresponding path program 1 times [2018-04-10 16:28:19,237 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-04-10 16:28:19,237 INFO L68 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-04-10 16:28:19,238 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-10 16:28:19,238 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-10 16:28:19,238 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-10 16:28:19,244 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-10 16:28:19,244 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-10 16:28:19,253 INFO L431 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown lemma type! [2018-04-10 16:28:19,253 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-04-10 16:28:19,253 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-04-10 16:28:19,254 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-10 16:28:19,282 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-10 16:28:19,286 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-10 16:28:19,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 6 treesize of output 5 [2018-04-10 16:28:19,319 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-10 16:28:19,327 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-10 16:28:19,327 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2018-04-10 16:28:19,361 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 16:28:19,361 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 15 [2018-04-10 16:28:19,362 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-10 16:28:19,441 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 16:28:19,442 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 16:28:19,443 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 12 [2018-04-10 16:28:19,444 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-10 16:28:19,456 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-10 16:28:19,457 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:34, output treesize:27 [2018-04-10 16:28:19,477 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 8 [2018-04-10 16:28:19,479 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-04-10 16:28:19,479 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-10 16:28:19,481 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-10 16:28:19,492 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 8 [2018-04-10 16:28:19,500 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-04-10 16:28:19,500 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-04-10 16:28:19,502 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-10 16:28:19,512 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-04-10 16:28:19,513 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 3 variables, input treesize:51, output treesize:44 [2018-04-10 16:28:19,564 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 16:28:19,569 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 36 treesize of output 40 [2018-04-10 16:28:19,571 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 13 [2018-04-10 16:28:19,571 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-10 16:28:19,576 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-10 16:28:19,590 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 16:28:19,596 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 52 treesize of output 51 [2018-04-10 16:28:19,597 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 13 [2018-04-10 16:28:19,598 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-04-10 16:28:19,604 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-10 16:28:19,617 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-04-10 16:28:19,617 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 3 variables, input treesize:93, output treesize:77 [2018-04-10 16:28:19,699 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 82 treesize of output 72 [2018-04-10 16:28:19,702 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 16:28:19,703 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 31 [2018-04-10 16:28:19,703 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-10 16:28:19,712 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-10 16:28:19,732 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 54 treesize of output 49 [2018-04-10 16:28:19,734 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 16:28:19,735 INFO L682 Elim1Store]: detected equality via solver [2018-04-10 16:28:19,735 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 44 [2018-04-10 16:28:19,735 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-04-10 16:28:19,746 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-10 16:28:19,760 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2018-04-10 16:28:19,760 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 4 variables, input treesize:119, output treesize:103 [2018-04-10 16:28:19,819 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable 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 1 [2018-04-10 16:28:19,819 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-10 16:28:19,842 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2018-04-10 16:28:19,842 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:108, output treesize:98 [2018-04-10 16:28:19,882 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 73 treesize of output 51 [2018-04-10 16:28:19,884 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-10 16:28:19,884 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-10 16:28:19,903 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 16:28:19,905 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 6 [2018-04-10 16:28:19,905 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-04-10 16:28:19,931 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-10 16:28:19,946 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 45 treesize of output 37 [2018-04-10 16:28:19,971 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 16:28:19,972 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 6 [2018-04-10 16:28:19,972 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2018-04-10 16:28:19,981 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 10 [2018-04-10 16:28:19,982 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2018-04-10 16:28:19,985 INFO L267 ElimStorePlain]: Start of recursive call 5: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-10 16:28:19,994 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 2 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-04-10 16:28:19,994 INFO L202 ElimStorePlain]: Needed 7 recursive calls to eliminate 5 variables, input treesize:109, output treesize:21 [2018-04-10 16:28:20,103 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-10 16:28:20,103 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-04-10 16:28:20,103 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [15] total 15 [2018-04-10 16:28:20,104 INFO L442 AbstractCegarLoop]: Interpolant automaton has 16 states [2018-04-10 16:28:20,104 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2018-04-10 16:28:20,104 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=61, Invalid=179, Unknown=0, NotChecked=0, Total=240 [2018-04-10 16:28:20,104 INFO L87 Difference]: Start difference. First operand 256 states and 283 transitions. Second operand 16 states. [2018-04-10 16:28:21,271 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-10 16:28:21,271 INFO L93 Difference]: Finished difference Result 278 states and 299 transitions. [2018-04-10 16:28:21,271 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2018-04-10 16:28:21,271 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 63 [2018-04-10 16:28:21,271 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-10 16:28:21,272 INFO L225 Difference]: With dead ends: 278 [2018-04-10 16:28:21,272 INFO L226 Difference]: Without dead ends: 278 [2018-04-10 16:28:21,272 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 79 GetRequests, 47 SyntacticMatches, 1 SemanticMatches, 31 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 171 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=289, Invalid=766, Unknown=1, NotChecked=0, Total=1056 [2018-04-10 16:28:21,272 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 278 states. [2018-04-10 16:28:21,274 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 278 to 256. [2018-04-10 16:28:21,275 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 256 states. [2018-04-10 16:28:21,275 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 256 states to 256 states and 282 transitions. [2018-04-10 16:28:21,275 INFO L78 Accepts]: Start accepts. Automaton has 256 states and 282 transitions. Word has length 63 [2018-04-10 16:28:21,276 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-10 16:28:21,276 INFO L459 AbstractCegarLoop]: Abstraction has 256 states and 282 transitions. [2018-04-10 16:28:21,276 INFO L460 AbstractCegarLoop]: Interpolant automaton has 16 states. [2018-04-10 16:28:21,276 INFO L276 IsEmpty]: Start isEmpty. Operand 256 states and 282 transitions. [2018-04-10 16:28:21,276 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2018-04-10 16:28:21,276 INFO L347 BasicCegarLoop]: Found error trace [2018-04-10 16:28:21,277 INFO L355 BasicCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-10 16:28:21,277 INFO L408 AbstractCegarLoop]: === Iteration 20 === [mainErr51RequiresViolation, mainErr26RequiresViolation, mainErr54RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr31RequiresViolation, mainErr46RequiresViolation, mainErr29RequiresViolation, mainErr58AssertViolationMEMORY_FREE, mainErr3RequiresViolation, mainErr60EnsuresViolationMEMORY_LEAK, mainErr15RequiresViolation, mainErr49RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr55RequiresViolation, mainErr17RequiresViolation, mainErr42RequiresViolation, mainErr30RequiresViolation, mainErr11RequiresViolation, mainErr57RequiresViolation, mainErr24RequiresViolation, mainErr44RequiresViolation, mainErr10RequiresViolation, mainErr43RequiresViolation, mainErr4RequiresViolation, mainErr50RequiresViolation, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr59AssertViolationMEMORY_FREE, mainErr36RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr56RequiresViolation, mainErr48RequiresViolation, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr52RequiresViolation, mainErr45RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr9RequiresViolation, mainErr53RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr34RequiresViolation, mainErr47RequiresViolation, mainErr14RequiresViolation, mainErr40RequiresViolation]=== [2018-04-10 16:28:21,277 INFO L82 PathProgramCache]: Analyzing trace with hash 678337908, now seen corresponding path program 1 times [2018-04-10 16:28:21,277 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-04-10 16:28:21,277 INFO L68 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-04-10 16:28:21,278 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-10 16:28:21,279 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-10 16:28:21,279 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-10 16:28:21,287 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-10 16:28:21,288 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-10 16:28:21,344 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2018-04-10 16:28:21,344 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-04-10 16:28:21,344 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-04-10 16:28:21,345 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-10 16:28:21,358 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-10 16:28:21,360 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-10 16:28:21,408 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 21 [2018-04-10 16:28:21,409 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 1 [2018-04-10 16:28:21,409 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-10 16:28:21,412 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-10 16:28:21,418 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 12 [2018-04-10 16:28:21,419 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 4 [2018-04-10 16:28:21,420 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-04-10 16:28:21,420 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-10 16:28:21,425 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 21 [2018-04-10 16:28:21,426 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 1 [2018-04-10 16:28:21,426 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2018-04-10 16:28:21,428 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-10 16:28:21,432 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 12 [2018-04-10 16:28:21,433 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 4 [2018-04-10 16:28:21,433 INFO L267 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 1 xjuncts. [2018-04-10 16:28:21,434 INFO L267 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-10 16:28:21,435 INFO L267 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 4 dim-2 vars, End of recursive call: and 2 xjuncts. [2018-04-10 16:28:21,436 INFO L202 ElimStorePlain]: Needed 9 recursive calls to eliminate 8 variables, input treesize:47, output treesize:9 [2018-04-10 16:28:21,443 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2018-04-10 16:28:21,443 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-04-10 16:28:21,444 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 8] total 9 [2018-04-10 16:28:21,444 INFO L442 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-04-10 16:28:21,444 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-04-10 16:28:21,444 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2018-04-10 16:28:21,444 INFO L87 Difference]: Start difference. First operand 256 states and 282 transitions. Second operand 9 states. [2018-04-10 16:28:21,681 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-10 16:28:21,681 INFO L93 Difference]: Finished difference Result 285 states and 312 transitions. [2018-04-10 16:28:21,681 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-04-10 16:28:21,681 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 64 [2018-04-10 16:28:21,682 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-10 16:28:21,682 INFO L225 Difference]: With dead ends: 285 [2018-04-10 16:28:21,682 INFO L226 Difference]: Without dead ends: 285 [2018-04-10 16:28:21,682 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 79 GetRequests, 60 SyntacticMatches, 3 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 31 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=67, Invalid=239, Unknown=0, NotChecked=0, Total=306 [2018-04-10 16:28:21,683 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 285 states. [2018-04-10 16:28:21,685 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 285 to 264. [2018-04-10 16:28:21,685 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 264 states. [2018-04-10 16:28:21,686 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 264 states to 264 states and 288 transitions. [2018-04-10 16:28:21,686 INFO L78 Accepts]: Start accepts. Automaton has 264 states and 288 transitions. Word has length 64 [2018-04-10 16:28:21,686 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-10 16:28:21,686 INFO L459 AbstractCegarLoop]: Abstraction has 264 states and 288 transitions. [2018-04-10 16:28:21,686 INFO L460 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-04-10 16:28:21,686 INFO L276 IsEmpty]: Start isEmpty. Operand 264 states and 288 transitions. [2018-04-10 16:28:21,687 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2018-04-10 16:28:21,687 INFO L347 BasicCegarLoop]: Found error trace [2018-04-10 16:28:21,687 INFO L355 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-10 16:28:21,687 INFO L408 AbstractCegarLoop]: === Iteration 21 === [mainErr51RequiresViolation, mainErr26RequiresViolation, mainErr54RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr31RequiresViolation, mainErr46RequiresViolation, mainErr29RequiresViolation, mainErr58AssertViolationMEMORY_FREE, mainErr3RequiresViolation, mainErr60EnsuresViolationMEMORY_LEAK, mainErr15RequiresViolation, mainErr49RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr55RequiresViolation, mainErr17RequiresViolation, mainErr42RequiresViolation, mainErr30RequiresViolation, mainErr11RequiresViolation, mainErr57RequiresViolation, mainErr24RequiresViolation, mainErr44RequiresViolation, mainErr10RequiresViolation, mainErr43RequiresViolation, mainErr4RequiresViolation, mainErr50RequiresViolation, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr59AssertViolationMEMORY_FREE, mainErr36RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr56RequiresViolation, mainErr48RequiresViolation, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr52RequiresViolation, mainErr45RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr9RequiresViolation, mainErr53RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr34RequiresViolation, mainErr47RequiresViolation, mainErr14RequiresViolation, mainErr40RequiresViolation]=== [2018-04-10 16:28:21,687 INFO L82 PathProgramCache]: Analyzing trace with hash -446313196, now seen corresponding path program 1 times [2018-04-10 16:28:21,687 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-04-10 16:28:21,687 INFO L68 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-04-10 16:28:21,688 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-10 16:28:21,688 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-10 16:28:21,688 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-10 16:28:21,696 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-10 16:28:21,697 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-10 16:28:21,708 INFO L431 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown lemma type! [2018-04-10 16:28:21,708 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-04-10 16:28:21,708 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-04-10 16:28:21,709 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-10 16:28:21,730 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-10 16:28:21,733 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-10 16:28:21,758 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 8 [2018-04-10 16:28:21,760 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-04-10 16:28:21,760 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-10 16:28:21,761 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-10 16:28:21,767 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-04-10 16:28:21,767 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:24, output treesize:17 [2018-04-10 16:28:21,801 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 2 new quantified variables, introduced 6 case distinctions, treesize of input 28 treesize of output 41 [2018-04-10 16:28:21,803 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 16:28:21,804 INFO L682 Elim1Store]: detected equality via solver [2018-04-10 16:28:21,804 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 27 treesize of output 43 [2018-04-10 16:28:21,804 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-10 16:28:21,820 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 24 [2018-04-10 16:28:21,820 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-04-10 16:28:21,826 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-10 16:28:21,832 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2018-04-10 16:28:21,832 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 3 variables, input treesize:37, output treesize:33 [2018-04-10 16:28:22,022 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 7 case distinctions, treesize of input 46 treesize of output 67 [2018-04-10 16:28:22,027 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 16:28:22,027 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 39 treesize of output 38 [2018-04-10 16:28:22,027 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-10 16:28:22,069 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 35 [2018-04-10 16:28:22,069 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-04-10 16:28:22,084 INFO L267 ElimStorePlain]: Start of recursive call 2: 4 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-10 16:28:22,099 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-2 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2018-04-10 16:28:22,099 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 4 variables, input treesize:49, output treesize:38 [2018-04-10 16:28:22,235 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 31 treesize of output 31 [2018-04-10 16:28:22,237 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable 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 27 treesize of output 18 [2018-04-10 16:28:22,237 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-10 16:28:22,247 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 11 [2018-04-10 16:28:22,248 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-04-10 16:28:22,256 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 16:28:22,257 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 13 [2018-04-10 16:28:22,258 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-04-10 16:28:22,263 INFO L267 ElimStorePlain]: Start of recursive call 2: 3 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-10 16:28:22,265 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-04-10 16:28:22,265 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 4 variables, input treesize:31, output treesize:3 [2018-04-10 16:28:22,289 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-10 16:28:22,289 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-04-10 16:28:22,289 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [15] total 15 [2018-04-10 16:28:22,290 INFO L442 AbstractCegarLoop]: Interpolant automaton has 16 states [2018-04-10 16:28:22,290 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2018-04-10 16:28:22,290 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=69, Invalid=171, Unknown=0, NotChecked=0, Total=240 [2018-04-10 16:28:22,290 INFO L87 Difference]: Start difference. First operand 264 states and 288 transitions. Second operand 16 states. [2018-04-10 16:28:22,892 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-10 16:28:22,892 INFO L93 Difference]: Finished difference Result 277 states and 297 transitions. [2018-04-10 16:28:22,893 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2018-04-10 16:28:22,893 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 65 [2018-04-10 16:28:22,893 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-10 16:28:22,894 INFO L225 Difference]: With dead ends: 277 [2018-04-10 16:28:22,894 INFO L226 Difference]: Without dead ends: 277 [2018-04-10 16:28:22,894 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 80 GetRequests, 50 SyntacticMatches, 0 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 231 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=305, Invalid=687, Unknown=0, NotChecked=0, Total=992 [2018-04-10 16:28:22,895 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 277 states. [2018-04-10 16:28:22,897 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 277 to 266. [2018-04-10 16:28:22,897 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 266 states. [2018-04-10 16:28:22,898 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 266 states to 266 states and 290 transitions. [2018-04-10 16:28:22,898 INFO L78 Accepts]: Start accepts. Automaton has 266 states and 290 transitions. Word has length 65 [2018-04-10 16:28:22,898 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-10 16:28:22,899 INFO L459 AbstractCegarLoop]: Abstraction has 266 states and 290 transitions. [2018-04-10 16:28:22,899 INFO L460 AbstractCegarLoop]: Interpolant automaton has 16 states. [2018-04-10 16:28:22,899 INFO L276 IsEmpty]: Start isEmpty. Operand 266 states and 290 transitions. [2018-04-10 16:28:22,899 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2018-04-10 16:28:22,899 INFO L347 BasicCegarLoop]: Found error trace [2018-04-10 16:28:22,900 INFO L355 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-10 16:28:22,900 INFO L408 AbstractCegarLoop]: === Iteration 22 === [mainErr51RequiresViolation, mainErr26RequiresViolation, mainErr54RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr31RequiresViolation, mainErr46RequiresViolation, mainErr29RequiresViolation, mainErr58AssertViolationMEMORY_FREE, mainErr3RequiresViolation, mainErr60EnsuresViolationMEMORY_LEAK, mainErr15RequiresViolation, mainErr49RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr55RequiresViolation, mainErr17RequiresViolation, mainErr42RequiresViolation, mainErr30RequiresViolation, mainErr11RequiresViolation, mainErr57RequiresViolation, mainErr24RequiresViolation, mainErr44RequiresViolation, mainErr10RequiresViolation, mainErr43RequiresViolation, mainErr4RequiresViolation, mainErr50RequiresViolation, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr59AssertViolationMEMORY_FREE, mainErr36RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr56RequiresViolation, mainErr48RequiresViolation, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr52RequiresViolation, mainErr45RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr9RequiresViolation, mainErr53RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr34RequiresViolation, mainErr47RequiresViolation, mainErr14RequiresViolation, mainErr40RequiresViolation]=== [2018-04-10 16:28:22,900 INFO L82 PathProgramCache]: Analyzing trace with hash -950806728, now seen corresponding path program 1 times [2018-04-10 16:28:22,900 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-04-10 16:28:22,900 INFO L68 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-04-10 16:28:22,901 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-10 16:28:22,901 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-10 16:28:22,901 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-10 16:28:22,909 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-10 16:28:22,910 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-10 16:28:23,010 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2018-04-10 16:28:23,011 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-04-10 16:28:23,011 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-04-10 16:28:23,011 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-04-10 16:28:23,011 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-04-10 16:28:23,011 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-04-10 16:28:23,011 INFO L87 Difference]: Start difference. First operand 266 states and 290 transitions. Second operand 4 states. [2018-04-10 16:28:23,073 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-10 16:28:23,073 INFO L93 Difference]: Finished difference Result 269 states and 292 transitions. [2018-04-10 16:28:23,074 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-04-10 16:28:23,074 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 66 [2018-04-10 16:28:23,074 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-10 16:28:23,075 INFO L225 Difference]: With dead ends: 269 [2018-04-10 16:28:23,075 INFO L226 Difference]: Without dead ends: 269 [2018-04-10 16:28:23,075 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-04-10 16:28:23,075 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 269 states. [2018-04-10 16:28:23,077 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 269 to 265. [2018-04-10 16:28:23,077 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 265 states. [2018-04-10 16:28:23,078 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 265 states to 265 states and 289 transitions. [2018-04-10 16:28:23,078 INFO L78 Accepts]: Start accepts. Automaton has 265 states and 289 transitions. Word has length 66 [2018-04-10 16:28:23,078 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-10 16:28:23,078 INFO L459 AbstractCegarLoop]: Abstraction has 265 states and 289 transitions. [2018-04-10 16:28:23,078 INFO L460 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-04-10 16:28:23,078 INFO L276 IsEmpty]: Start isEmpty. Operand 265 states and 289 transitions. [2018-04-10 16:28:23,083 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2018-04-10 16:28:23,083 INFO L347 BasicCegarLoop]: Found error trace [2018-04-10 16:28:23,083 INFO L355 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-10 16:28:23,083 INFO L408 AbstractCegarLoop]: === Iteration 23 === [mainErr51RequiresViolation, mainErr26RequiresViolation, mainErr54RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr31RequiresViolation, mainErr46RequiresViolation, mainErr29RequiresViolation, mainErr58AssertViolationMEMORY_FREE, mainErr3RequiresViolation, mainErr60EnsuresViolationMEMORY_LEAK, mainErr15RequiresViolation, mainErr49RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr55RequiresViolation, mainErr17RequiresViolation, mainErr42RequiresViolation, mainErr30RequiresViolation, mainErr11RequiresViolation, mainErr57RequiresViolation, mainErr24RequiresViolation, mainErr44RequiresViolation, mainErr10RequiresViolation, mainErr43RequiresViolation, mainErr4RequiresViolation, mainErr50RequiresViolation, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr59AssertViolationMEMORY_FREE, mainErr36RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr56RequiresViolation, mainErr48RequiresViolation, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr52RequiresViolation, mainErr45RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr9RequiresViolation, mainErr53RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr34RequiresViolation, mainErr47RequiresViolation, mainErr14RequiresViolation, mainErr40RequiresViolation]=== [2018-04-10 16:28:23,083 INFO L82 PathProgramCache]: Analyzing trace with hash -2055850988, now seen corresponding path program 1 times [2018-04-10 16:28:23,083 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-04-10 16:28:23,083 INFO L68 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-04-10 16:28:23,084 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-10 16:28:23,085 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-10 16:28:23,085 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-10 16:28:23,100 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-10 16:28:23,100 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-10 16:28:23,140 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 9 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-10 16:28:23,140 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-04-10 16:28:23,140 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-04-10 16:28:23,141 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-04-10 16:28:23,141 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-04-10 16:28:23,141 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-04-10 16:28:23,141 INFO L87 Difference]: Start difference. First operand 265 states and 289 transitions. Second operand 4 states. [2018-04-10 16:28:23,222 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-10 16:28:23,222 INFO L93 Difference]: Finished difference Result 300 states and 322 transitions. [2018-04-10 16:28:23,222 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-04-10 16:28:23,222 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 66 [2018-04-10 16:28:23,223 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-10 16:28:23,223 INFO L225 Difference]: With dead ends: 300 [2018-04-10 16:28:23,223 INFO L226 Difference]: Without dead ends: 300 [2018-04-10 16:28:23,223 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-04-10 16:28:23,224 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 300 states. [2018-04-10 16:28:23,225 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 300 to 274. [2018-04-10 16:28:23,225 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 274 states. [2018-04-10 16:28:23,226 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 274 states to 274 states and 299 transitions. [2018-04-10 16:28:23,226 INFO L78 Accepts]: Start accepts. Automaton has 274 states and 299 transitions. Word has length 66 [2018-04-10 16:28:23,226 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-10 16:28:23,226 INFO L459 AbstractCegarLoop]: Abstraction has 274 states and 299 transitions. [2018-04-10 16:28:23,226 INFO L460 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-04-10 16:28:23,226 INFO L276 IsEmpty]: Start isEmpty. Operand 274 states and 299 transitions. [2018-04-10 16:28:23,227 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2018-04-10 16:28:23,227 INFO L347 BasicCegarLoop]: Found error trace [2018-04-10 16:28:23,227 INFO L355 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-10 16:28:23,227 INFO L408 AbstractCegarLoop]: === Iteration 24 === [mainErr51RequiresViolation, mainErr26RequiresViolation, mainErr54RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr31RequiresViolation, mainErr46RequiresViolation, mainErr29RequiresViolation, mainErr58AssertViolationMEMORY_FREE, mainErr3RequiresViolation, mainErr60EnsuresViolationMEMORY_LEAK, mainErr15RequiresViolation, mainErr49RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr55RequiresViolation, mainErr17RequiresViolation, mainErr42RequiresViolation, mainErr30RequiresViolation, mainErr11RequiresViolation, mainErr57RequiresViolation, mainErr24RequiresViolation, mainErr44RequiresViolation, mainErr10RequiresViolation, mainErr43RequiresViolation, mainErr4RequiresViolation, mainErr50RequiresViolation, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr59AssertViolationMEMORY_FREE, mainErr36RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr56RequiresViolation, mainErr48RequiresViolation, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr52RequiresViolation, mainErr45RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr9RequiresViolation, mainErr53RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr34RequiresViolation, mainErr47RequiresViolation, mainErr14RequiresViolation, mainErr40RequiresViolation]=== [2018-04-10 16:28:23,227 INFO L82 PathProgramCache]: Analyzing trace with hash 1468045743, now seen corresponding path program 1 times [2018-04-10 16:28:23,227 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-04-10 16:28:23,227 INFO L68 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-04-10 16:28:23,228 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-10 16:28:23,228 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-10 16:28:23,228 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-10 16:28:23,237 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-10 16:28:23,238 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-10 16:28:23,256 INFO L431 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown lemma type! [2018-04-10 16:28:23,256 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-04-10 16:28:23,256 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-04-10 16:28:23,257 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-10 16:28:23,278 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-10 16:28:23,281 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-10 16:28:23,293 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 16:28:23,294 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 16:28:23,294 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 15 [2018-04-10 16:28:23,295 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-10 16:28:23,299 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-10 16:28:23,300 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:20, output treesize:14 [2018-04-10 16:28:23,311 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 8 [2018-04-10 16:28:23,313 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-04-10 16:28:23,313 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-10 16:28:23,315 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-10 16:28:23,326 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 8 [2018-04-10 16:28:23,328 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-04-10 16:28:23,328 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-04-10 16:28:23,330 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-10 16:28:23,338 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-04-10 16:28:23,339 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 4 variables, input treesize:36, output treesize:22 [2018-04-10 16:28:23,365 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 16:28:23,371 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 51 treesize of output 50 [2018-04-10 16:28:23,374 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 13 [2018-04-10 16:28:23,374 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-10 16:28:23,382 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-10 16:28:23,396 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 30 [2018-04-10 16:28:23,398 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 13 [2018-04-10 16:28:23,398 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-04-10 16:28:23,403 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-10 16:28:23,412 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-04-10 16:28:23,413 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 3 variables, input treesize:64, output treesize:48 [2018-04-10 16:28:23,476 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 73 treesize of output 63 [2018-04-10 16:28:23,486 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 2 case distinctions, treesize of input 20 treesize of output 31 [2018-04-10 16:28:23,487 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 2 xjuncts. [2018-04-10 16:28:23,500 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-04-10 16:28:23,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 1 new quantified variables, introduced 0 case distinctions, treesize of input 79 treesize of output 66 [2018-04-10 16:28:23,539 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 2 case distinctions, treesize of input 20 treesize of output 31 [2018-04-10 16:28:23,539 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 2 xjuncts. [2018-04-10 16:28:23,557 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-04-10 16:28:23,562 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 71 treesize of output 58 [2018-04-10 16:28:23,570 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-10 16:28:23,570 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2018-04-10 16:28:23,578 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-10 16:28:23,601 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-2 vars, End of recursive call: 3 dim-0 vars, and 2 xjuncts. [2018-04-10 16:28:23,602 INFO L202 ElimStorePlain]: Needed 7 recursive calls to eliminate 4 variables, input treesize:90, output treesize:131 [2018-04-10 16:28:23,719 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 57 treesize of output 44 [2018-04-10 16:28:23,721 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 21 [2018-04-10 16:28:23,721 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-04-10 16:28:23,728 INFO L682 Elim1Store]: detected equality via solver [2018-04-10 16:28:23,729 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-10 16:28:23,729 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-04-10 16:28:23,740 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-04-10 16:28:23,751 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 40 treesize of output 34 [2018-04-10 16:28:23,753 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 12 [2018-04-10 16:28:23,753 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2018-04-10 16:28:23,758 INFO L682 Elim1Store]: detected equality via solver [2018-04-10 16:28:23,758 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-10 16:28:23,759 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2018-04-10 16:28:23,762 INFO L267 ElimStorePlain]: Start of recursive call 5: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-10 16:28:23,766 INFO L267 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-04-10 16:28:23,767 INFO L202 ElimStorePlain]: Needed 7 recursive calls to eliminate 6 variables, input treesize:88, output treesize:7 [2018-04-10 16:28:23,819 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 4 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-10 16:28:23,819 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-04-10 16:28:23,820 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [16] total 16 [2018-04-10 16:28:23,820 INFO L442 AbstractCegarLoop]: Interpolant automaton has 16 states [2018-04-10 16:28:23,820 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2018-04-10 16:28:23,820 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=208, Unknown=0, NotChecked=0, Total=240 [2018-04-10 16:28:23,820 INFO L87 Difference]: Start difference. First operand 274 states and 299 transitions. Second operand 16 states. [2018-04-10 16:28:24,628 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-10 16:28:24,628 INFO L93 Difference]: Finished difference Result 270 states and 290 transitions. [2018-04-10 16:28:24,628 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2018-04-10 16:28:24,628 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 68 [2018-04-10 16:28:24,629 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-10 16:28:24,629 INFO L225 Difference]: With dead ends: 270 [2018-04-10 16:28:24,629 INFO L226 Difference]: Without dead ends: 270 [2018-04-10 16:28:24,629 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 81 GetRequests, 53 SyntacticMatches, 0 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 121 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=131, Invalid=739, Unknown=0, NotChecked=0, Total=870 [2018-04-10 16:28:24,630 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 270 states. [2018-04-10 16:28:24,632 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 270 to 266. [2018-04-10 16:28:24,632 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 266 states. [2018-04-10 16:28:24,632 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 266 states to 266 states and 286 transitions. [2018-04-10 16:28:24,632 INFO L78 Accepts]: Start accepts. Automaton has 266 states and 286 transitions. Word has length 68 [2018-04-10 16:28:24,632 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-10 16:28:24,632 INFO L459 AbstractCegarLoop]: Abstraction has 266 states and 286 transitions. [2018-04-10 16:28:24,632 INFO L460 AbstractCegarLoop]: Interpolant automaton has 16 states. [2018-04-10 16:28:24,633 INFO L276 IsEmpty]: Start isEmpty. Operand 266 states and 286 transitions. [2018-04-10 16:28:24,633 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 71 [2018-04-10 16:28:24,633 INFO L347 BasicCegarLoop]: Found error trace [2018-04-10 16:28:24,633 INFO L355 BasicCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-10 16:28:24,633 INFO L408 AbstractCegarLoop]: === Iteration 25 === [mainErr51RequiresViolation, mainErr26RequiresViolation, mainErr54RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr31RequiresViolation, mainErr46RequiresViolation, mainErr29RequiresViolation, mainErr58AssertViolationMEMORY_FREE, mainErr3RequiresViolation, mainErr60EnsuresViolationMEMORY_LEAK, mainErr15RequiresViolation, mainErr49RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr55RequiresViolation, mainErr17RequiresViolation, mainErr42RequiresViolation, mainErr30RequiresViolation, mainErr11RequiresViolation, mainErr57RequiresViolation, mainErr24RequiresViolation, mainErr44RequiresViolation, mainErr10RequiresViolation, mainErr43RequiresViolation, mainErr4RequiresViolation, mainErr50RequiresViolation, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr59AssertViolationMEMORY_FREE, mainErr36RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr56RequiresViolation, mainErr48RequiresViolation, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr52RequiresViolation, mainErr45RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr9RequiresViolation, mainErr53RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr34RequiresViolation, mainErr47RequiresViolation, mainErr14RequiresViolation, mainErr40RequiresViolation]=== [2018-04-10 16:28:24,633 INFO L82 PathProgramCache]: Analyzing trace with hash -1082274548, now seen corresponding path program 2 times [2018-04-10 16:28:24,633 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-04-10 16:28:24,633 INFO L68 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-04-10 16:28:24,634 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-10 16:28:24,634 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-10 16:28:24,634 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-10 16:28:24,643 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-10 16:28:24,643 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-10 16:28:24,659 INFO L431 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown lemma type! [2018-04-10 16:28:24,660 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-04-10 16:28:24,660 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-04-10 16:28:24,661 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-04-10 16:28:24,694 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-04-10 16:28:24,694 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-04-10 16:28:24,703 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-10 16:28:24,705 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-04-10 16:28:24,706 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-10 16:28:24,709 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-10 16:28:24,709 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2018-04-10 16:28:24,733 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 16:28:24,734 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 16:28:24,734 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 12 [2018-04-10 16:28:24,735 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-10 16:28:24,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, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-04-10 16:28:24,744 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-10 16:28:24,752 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-10 16:28:24,752 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:29, output treesize:22 [2018-04-10 16:28:24,764 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 8 [2018-04-10 16:28:24,765 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-04-10 16:28:24,765 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-10 16:28:24,766 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-10 16:28:24,774 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 8 [2018-04-10 16:28:24,775 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-04-10 16:28:24,775 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-04-10 16:28:24,776 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-10 16:28:24,782 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-04-10 16:28:24,782 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 3 variables, input treesize:41, output treesize:34 [2018-04-10 16:28:24,793 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 14 [2018-04-10 16:28:24,794 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 3 [2018-04-10 16:28:24,794 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-10 16:28:24,796 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-10 16:28:24,801 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-04-10 16:28:24,802 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:48, output treesize:37 [2018-04-10 16:28:24,814 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 16:28:24,817 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 37 treesize of output 36 [2018-04-10 16:28:24,819 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 11 [2018-04-10 16:28:24,819 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-10 16:28:24,823 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-10 16:28:24,831 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-04-10 16:28:24,831 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:46, output treesize:38 [2018-04-10 16:28:24,892 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 16:28:24,892 INFO L682 Elim1Store]: detected equality via solver [2018-04-10 16:28:24,899 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 2 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 55 treesize of output 42 [2018-04-10 16:28:24,910 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 14 treesize of output 19 [2018-04-10 16:28:24,910 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 2 xjuncts. [2018-04-10 16:28:24,921 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-04-10 16:28:24,939 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 8 [2018-04-10 16:28:24,940 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-04-10 16:28:24,940 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-04-10 16:28:24,941 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-10 16:28:24,957 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 2 xjuncts. [2018-04-10 16:28:24,957 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 2 variables, input treesize:72, output treesize:93 [2018-04-10 16:28:25,016 WARN L307 Elim1Store]: Array PQE input equivalent to false [2018-04-10 16:28:25,016 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-10 16:28:25,026 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 3 [2018-04-10 16:28:25,026 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-10 16:28:25,033 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-04-10 16:28:25,033 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:121, output treesize:51 [2018-04-10 16:28:25,169 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 64 treesize of output 45 [2018-04-10 16:28:25,171 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 16:28:25,177 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 2 case distinctions, treesize of input 16 treesize of output 21 [2018-04-10 16:28:25,178 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 4 xjuncts. [2018-04-10 16:28:25,193 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 19 [2018-04-10 16:28:25,194 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-04-10 16:28:25,215 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: 3 dim-0 vars, and 3 xjuncts. [2018-04-10 16:28:25,254 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-10 16:28:25,259 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 1 case distinctions, treesize of input 11 treesize of output 8 [2018-04-10 16:28:25,259 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 2 xjuncts. [2018-04-10 16:28:25,265 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-04-10 16:28:25,266 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-10 16:28:25,268 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 11 treesize of output 4 [2018-04-10 16:28:25,268 INFO L267 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 1 xjuncts. [2018-04-10 16:28:25,271 INFO L267 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-10 16:28:25,272 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 27 treesize of output 23 [2018-04-10 16:28:25,274 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 4 [2018-04-10 16:28:25,275 INFO L267 ElimStorePlain]: Start of recursive call 10: End of recursive call: and 1 xjuncts. [2018-04-10 16:28:25,278 INFO L267 ElimStorePlain]: Start of recursive call 9: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-10 16:28:25,324 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 2 dim-2 vars, End of recursive call: and 3 xjuncts. [2018-04-10 16:28:25,324 INFO L202 ElimStorePlain]: Needed 10 recursive calls to eliminate 5 variables, input treesize:76, output treesize:28 [2018-04-10 16:28:25,392 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 2 proven. 14 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-10 16:28:25,393 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-04-10 16:28:25,393 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [19] total 19 [2018-04-10 16:28:25,393 INFO L442 AbstractCegarLoop]: Interpolant automaton has 19 states [2018-04-10 16:28:25,393 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2018-04-10 16:28:25,394 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=37, Invalid=305, Unknown=0, NotChecked=0, Total=342 [2018-04-10 16:28:25,394 INFO L87 Difference]: Start difference. First operand 266 states and 286 transitions. Second operand 19 states. [2018-04-10 16:28:26,372 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-10 16:28:26,373 INFO L93 Difference]: Finished difference Result 275 states and 294 transitions. [2018-04-10 16:28:26,373 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2018-04-10 16:28:26,373 INFO L78 Accepts]: Start accepts. Automaton has 19 states. Word has length 70 [2018-04-10 16:28:26,373 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-10 16:28:26,373 INFO L225 Difference]: With dead ends: 275 [2018-04-10 16:28:26,373 INFO L226 Difference]: Without dead ends: 275 [2018-04-10 16:28:26,374 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 86 GetRequests, 52 SyntacticMatches, 0 SemanticMatches, 34 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 134 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=180, Invalid=1080, Unknown=0, NotChecked=0, Total=1260 [2018-04-10 16:28:26,374 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 275 states. [2018-04-10 16:28:26,375 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 275 to 261. [2018-04-10 16:28:26,376 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 261 states. [2018-04-10 16:28:26,376 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 261 states to 261 states and 281 transitions. [2018-04-10 16:28:26,376 INFO L78 Accepts]: Start accepts. Automaton has 261 states and 281 transitions. Word has length 70 [2018-04-10 16:28:26,376 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-10 16:28:26,376 INFO L459 AbstractCegarLoop]: Abstraction has 261 states and 281 transitions. [2018-04-10 16:28:26,376 INFO L460 AbstractCegarLoop]: Interpolant automaton has 19 states. [2018-04-10 16:28:26,376 INFO L276 IsEmpty]: Start isEmpty. Operand 261 states and 281 transitions. [2018-04-10 16:28:26,377 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 71 [2018-04-10 16:28:26,377 INFO L347 BasicCegarLoop]: Found error trace [2018-04-10 16:28:26,377 INFO L355 BasicCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-10 16:28:26,377 INFO L408 AbstractCegarLoop]: === Iteration 26 === [mainErr51RequiresViolation, mainErr26RequiresViolation, mainErr54RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr31RequiresViolation, mainErr46RequiresViolation, mainErr29RequiresViolation, mainErr58AssertViolationMEMORY_FREE, mainErr3RequiresViolation, mainErr60EnsuresViolationMEMORY_LEAK, mainErr15RequiresViolation, mainErr49RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr55RequiresViolation, mainErr17RequiresViolation, mainErr42RequiresViolation, mainErr30RequiresViolation, mainErr11RequiresViolation, mainErr57RequiresViolation, mainErr24RequiresViolation, mainErr44RequiresViolation, mainErr10RequiresViolation, mainErr43RequiresViolation, mainErr4RequiresViolation, mainErr50RequiresViolation, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr59AssertViolationMEMORY_FREE, mainErr36RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr56RequiresViolation, mainErr48RequiresViolation, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr52RequiresViolation, mainErr45RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr9RequiresViolation, mainErr53RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr34RequiresViolation, mainErr47RequiresViolation, mainErr14RequiresViolation, mainErr40RequiresViolation]=== [2018-04-10 16:28:26,377 INFO L82 PathProgramCache]: Analyzing trace with hash -1176212003, now seen corresponding path program 1 times [2018-04-10 16:28:26,377 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-04-10 16:28:26,377 INFO L68 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-04-10 16:28:26,378 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-10 16:28:26,378 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-04-10 16:28:26,378 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-10 16:28:26,383 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-10 16:28:26,383 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-10 16:28:26,437 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 12 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2018-04-10 16:28:26,438 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-04-10 16:28:26,438 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-04-10 16:28:26,438 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-04-10 16:28:26,438 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-04-10 16:28:26,438 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-04-10 16:28:26,439 INFO L87 Difference]: Start difference. First operand 261 states and 281 transitions. Second operand 3 states. [2018-04-10 16:28:26,474 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-10 16:28:26,474 INFO L93 Difference]: Finished difference Result 346 states and 372 transitions. [2018-04-10 16:28:26,478 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-04-10 16:28:26,478 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 70 [2018-04-10 16:28:26,478 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-10 16:28:26,479 INFO L225 Difference]: With dead ends: 346 [2018-04-10 16:28:26,479 INFO L226 Difference]: Without dead ends: 346 [2018-04-10 16:28:26,479 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-10 16:28:26,479 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 346 states. [2018-04-10 16:28:26,481 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 346 to 287. [2018-04-10 16:28:26,481 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 287 states. [2018-04-10 16:28:26,481 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 287 states to 287 states and 308 transitions. [2018-04-10 16:28:26,481 INFO L78 Accepts]: Start accepts. Automaton has 287 states and 308 transitions. Word has length 70 [2018-04-10 16:28:26,482 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-10 16:28:26,482 INFO L459 AbstractCegarLoop]: Abstraction has 287 states and 308 transitions. [2018-04-10 16:28:26,482 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-04-10 16:28:26,482 INFO L276 IsEmpty]: Start isEmpty. Operand 287 states and 308 transitions. [2018-04-10 16:28:26,482 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 71 [2018-04-10 16:28:26,482 INFO L347 BasicCegarLoop]: Found error trace [2018-04-10 16:28:26,482 INFO L355 BasicCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-10 16:28:26,482 INFO L408 AbstractCegarLoop]: === Iteration 27 === [mainErr51RequiresViolation, mainErr26RequiresViolation, mainErr54RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr31RequiresViolation, mainErr46RequiresViolation, mainErr29RequiresViolation, mainErr58AssertViolationMEMORY_FREE, mainErr3RequiresViolation, mainErr60EnsuresViolationMEMORY_LEAK, mainErr15RequiresViolation, mainErr49RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr55RequiresViolation, mainErr17RequiresViolation, mainErr42RequiresViolation, mainErr30RequiresViolation, mainErr11RequiresViolation, mainErr57RequiresViolation, mainErr24RequiresViolation, mainErr44RequiresViolation, mainErr10RequiresViolation, mainErr43RequiresViolation, mainErr4RequiresViolation, mainErr50RequiresViolation, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr59AssertViolationMEMORY_FREE, mainErr36RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr56RequiresViolation, mainErr48RequiresViolation, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr52RequiresViolation, mainErr45RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr9RequiresViolation, mainErr53RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr34RequiresViolation, mainErr47RequiresViolation, mainErr14RequiresViolation, mainErr40RequiresViolation]=== [2018-04-10 16:28:26,482 INFO L82 PathProgramCache]: Analyzing trace with hash -2126794385, now seen corresponding path program 1 times [2018-04-10 16:28:26,482 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-04-10 16:28:26,483 INFO L68 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-04-10 16:28:26,483 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-10 16:28:26,483 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-10 16:28:26,483 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-10 16:28:26,489 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-10 16:28:26,490 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-10 16:28:26,493 INFO L431 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown lemma type! [2018-04-10 16:28:26,493 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-04-10 16:28:26,493 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-04-10 16:28:26,494 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-10 16:28:26,529 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-10 16:28:26,539 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-10 16:28:26,632 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 16:28:26,633 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 16:28:26,634 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 16:28:26,636 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 28 [2018-04-10 16:28:26,636 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-10 16:28:26,645 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-10 16:28:26,645 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:29, output treesize:27 [2018-04-10 16:28:26,660 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 8 [2018-04-10 16:28:26,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, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-04-10 16:28:26,662 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-10 16:28:26,665 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-10 16:28:26,672 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-04-10 16:28:26,673 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:35, output treesize:32 [2018-04-10 16:28:26,717 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 16:28:26,721 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 39 treesize of output 38 [2018-04-10 16:28:26,723 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 13 [2018-04-10 16:28:26,723 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-10 16:28:26,727 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-10 16:28:26,734 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-04-10 16:28:26,735 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:53, output treesize:45 [2018-04-10 16:28:26,800 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 49 treesize of output 40 [2018-04-10 16:28:26,810 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 2 case distinctions, treesize of input 16 treesize of output 23 [2018-04-10 16:28:26,810 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 2 xjuncts. [2018-04-10 16:28:26,820 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-04-10 16:28:26,848 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 2 xjuncts. [2018-04-10 16:28:26,848 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:62, output treesize:82 [2018-04-10 16:28:26,882 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 16:28:26,883 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 16:28:26,883 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 16:28:26,884 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 16:28:26,886 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 16:28:26,887 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 5 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 51 [2018-04-10 16:28:26,888 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-10 16:28:26,900 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-10 16:28:26,900 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:50, output treesize:52 [2018-04-10 16:28:26,927 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 12 [2018-04-10 16:28:26,929 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 11 [2018-04-10 16:28:26,929 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-10 16:28:26,931 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-10 16:28:26,946 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 46 treesize of output 45 [2018-04-10 16:28:26,948 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 7 [2018-04-10 16:28:26,948 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-04-10 16:28:26,953 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-10 16:28:26,969 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-04-10 16:28:26,969 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 3 variables, input treesize:76, output treesize:65 [2018-04-10 16:28:27,028 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 95 treesize of output 95 [2018-04-10 16:28:27,031 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 13 [2018-04-10 16:28:27,031 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-10 16:28:27,041 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-10 16:28:27,055 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 33 treesize of output 38 [2018-04-10 16:28:27,057 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 13 [2018-04-10 16:28:27,057 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-04-10 16:28:27,060 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-10 16:28:27,071 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-04-10 16:28:27,072 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 3 variables, input treesize:107, output treesize:91 [2018-04-10 16:28:27,168 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 189 treesize of output 150 [2018-04-10 16:28:27,206 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 36 treesize of output 59 [2018-04-10 16:28:27,206 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 2 xjuncts. [2018-04-10 16:28:27,232 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-04-10 16:28:27,293 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 158 treesize of output 137 [2018-04-10 16:28:27,296 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 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 37 [2018-04-10 16:28:27,296 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-04-10 16:28:27,307 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-10 16:28:27,312 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 166 treesize of output 145 [2018-04-10 16:28:27,320 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 2 case distinctions, treesize of input 32 treesize of output 55 [2018-04-10 16:28:27,320 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 2 xjuncts. [2018-04-10 16:28:27,338 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-04-10 16:28:27,377 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-2 vars, End of recursive call: 3 dim-0 vars, and 2 xjuncts. [2018-04-10 16:28:27,377 INFO L202 ElimStorePlain]: Needed 7 recursive calls to eliminate 4 variables, input treesize:197, output treesize:287 [2018-04-10 16:28:27,447 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 65 treesize of output 71 [2018-04-10 16:28:27,449 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 5 [2018-04-10 16:28:27,449 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-10 16:28:27,456 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable 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 15 [2018-04-10 16:28:27,457 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-04-10 16:28:27,461 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 1 [2018-04-10 16:28:27,461 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-04-10 16:28:27,462 INFO L267 ElimStorePlain]: Start of recursive call 2: 3 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-10 16:28:27,472 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-04-10 16:28:27,472 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 2 variables, input treesize:138, output treesize:89 [2018-04-10 16:28:27,530 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 81 treesize of output 50 [2018-04-10 16:28:27,532 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 16 [2018-04-10 16:28:27,532 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-04-10 16:28:27,538 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 14 [2018-04-10 16:28:27,538 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-04-10 16:28:27,543 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-04-10 16:28:27,548 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2018-04-10 16:28:27,548 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 3 variables, input treesize:86, output treesize:28 [2018-04-10 16:28:27,589 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 0 proven. 24 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-10 16:28:27,589 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-04-10 16:28:27,589 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [22] total 22 [2018-04-10 16:28:27,589 INFO L442 AbstractCegarLoop]: Interpolant automaton has 23 states [2018-04-10 16:28:27,589 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2018-04-10 16:28:27,589 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=89, Invalid=417, Unknown=0, NotChecked=0, Total=506 [2018-04-10 16:28:27,590 INFO L87 Difference]: Start difference. First operand 287 states and 308 transitions. Second operand 23 states. [2018-04-10 16:28:28,662 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-10 16:28:28,662 INFO L93 Difference]: Finished difference Result 367 states and 394 transitions. [2018-04-10 16:28:28,662 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2018-04-10 16:28:28,662 INFO L78 Accepts]: Start accepts. Automaton has 23 states. Word has length 70 [2018-04-10 16:28:28,662 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-10 16:28:28,663 INFO L225 Difference]: With dead ends: 367 [2018-04-10 16:28:28,663 INFO L226 Difference]: Without dead ends: 367 [2018-04-10 16:28:28,664 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 91 GetRequests, 48 SyntacticMatches, 0 SemanticMatches, 43 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 372 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=321, Invalid=1658, Unknown=1, NotChecked=0, Total=1980 [2018-04-10 16:28:28,664 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 367 states. [2018-04-10 16:28:28,665 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 367 to 323. [2018-04-10 16:28:28,666 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 323 states. [2018-04-10 16:28:28,666 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 323 states to 323 states and 346 transitions. [2018-04-10 16:28:28,666 INFO L78 Accepts]: Start accepts. Automaton has 323 states and 346 transitions. Word has length 70 [2018-04-10 16:28:28,666 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-10 16:28:28,666 INFO L459 AbstractCegarLoop]: Abstraction has 323 states and 346 transitions. [2018-04-10 16:28:28,666 INFO L460 AbstractCegarLoop]: Interpolant automaton has 23 states. [2018-04-10 16:28:28,666 INFO L276 IsEmpty]: Start isEmpty. Operand 323 states and 346 transitions. [2018-04-10 16:28:28,667 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 71 [2018-04-10 16:28:28,667 INFO L347 BasicCegarLoop]: Found error trace [2018-04-10 16:28:28,667 INFO L355 BasicCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-10 16:28:28,667 INFO L408 AbstractCegarLoop]: === Iteration 28 === [mainErr51RequiresViolation, mainErr26RequiresViolation, mainErr54RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr31RequiresViolation, mainErr46RequiresViolation, mainErr29RequiresViolation, mainErr58AssertViolationMEMORY_FREE, mainErr3RequiresViolation, mainErr60EnsuresViolationMEMORY_LEAK, mainErr15RequiresViolation, mainErr49RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr55RequiresViolation, mainErr17RequiresViolation, mainErr42RequiresViolation, mainErr30RequiresViolation, mainErr11RequiresViolation, mainErr57RequiresViolation, mainErr24RequiresViolation, mainErr44RequiresViolation, mainErr10RequiresViolation, mainErr43RequiresViolation, mainErr4RequiresViolation, mainErr50RequiresViolation, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr59AssertViolationMEMORY_FREE, mainErr36RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr56RequiresViolation, mainErr48RequiresViolation, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr52RequiresViolation, mainErr45RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr9RequiresViolation, mainErr53RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr34RequiresViolation, mainErr47RequiresViolation, mainErr14RequiresViolation, mainErr40RequiresViolation]=== [2018-04-10 16:28:28,667 INFO L82 PathProgramCache]: Analyzing trace with hash -2126794384, now seen corresponding path program 1 times [2018-04-10 16:28:28,667 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-04-10 16:28:28,667 INFO L68 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-04-10 16:28:28,668 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-10 16:28:28,668 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-10 16:28:28,668 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-10 16:28:28,674 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-10 16:28:28,674 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-10 16:28:28,677 INFO L431 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown lemma type! [2018-04-10 16:28:28,677 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-04-10 16:28:28,677 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-04-10 16:28:28,678 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-10 16:28:28,716 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-10 16:28:28,720 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-10 16:28:28,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, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-04-10 16:28:28,748 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-10 16:28:28,777 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 16:28:28,777 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 16:28:28,778 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 21 [2018-04-10 16:28:28,779 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-10 16:28:28,815 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-10 16:28:28,815 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:35, output treesize:32 [2018-04-10 16:28:28,843 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 8 [2018-04-10 16:28:28,844 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-04-10 16:28:28,845 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-10 16:28:28,846 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-10 16:28:28,858 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 8 [2018-04-10 16:28:28,859 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-04-10 16:28:28,860 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-04-10 16:28:28,861 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-10 16:28:28,870 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-04-10 16:28:28,870 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 3 variables, input treesize:56, output treesize:48 [2018-04-10 16:28:28,903 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 16:28:28,908 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 77 treesize of output 76 [2018-04-10 16:28:28,909 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 17 [2018-04-10 16:28:28,909 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-10 16:28:28,915 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-10 16:28:28,930 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 50 treesize of output 54 [2018-04-10 16:28:28,931 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 17 [2018-04-10 16:28:28,932 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-04-10 16:28:28,942 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-10 16:28:28,952 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-04-10 16:28:28,952 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 2 variables, input treesize:98, output treesize:82 [2018-04-10 16:28:29,014 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 16:28:29,015 INFO L682 Elim1Store]: detected equality via solver [2018-04-10 16:28:29,022 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 2 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 133 treesize of output 102 [2018-04-10 16:28:29,026 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 16:28:29,028 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 48 treesize of output 63 [2018-04-10 16:28:29,028 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-10 16:28:29,046 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-10 16:28:29,070 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 1 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 81 treesize of output 77 [2018-04-10 16:28:29,071 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 16:28:29,072 INFO L682 Elim1Store]: detected equality via solver [2018-04-10 16:28:29,072 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 60 [2018-04-10 16:28:29,072 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-04-10 16:28:29,082 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-10 16:28:29,096 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-04-10 16:28:29,097 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 2 variables, input treesize:159, output treesize:110 [2018-04-10 16:28:29,129 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 16:28:29,129 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 23 [2018-04-10 16:28:29,129 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-10 16:28:29,147 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 16:28:29,148 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 16:28:29,149 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 16:28:29,149 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 40 [2018-04-10 16:28:29,149 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-10 16:28:29,164 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-10 16:28:29,164 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:121, output treesize:113 [2018-04-10 16:28:29,191 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 16:28:29,193 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 94 treesize of output 98 [2018-04-10 16:28:29,196 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 16:28:29,198 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 46 treesize of output 57 [2018-04-10 16:28:29,198 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-10 16:28:29,208 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-10 16:28:29,237 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 16:28:29,241 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 96 treesize of output 96 [2018-04-10 16:28:29,243 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 16:28:29,243 INFO L682 Elim1Store]: detected equality via solver [2018-04-10 16:28:29,244 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 92 [2018-04-10 16:28:29,245 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-04-10 16:28:29,256 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-10 16:28:29,305 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-04-10 16:28:29,305 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 4 variables, input treesize:140, output treesize:120 [2018-04-10 16:28:29,353 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 16:28:29,354 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 16:28:29,354 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 16:28:29,360 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 117 treesize of output 138 [2018-04-10 16:28:29,362 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 13 [2018-04-10 16:28:29,363 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-10 16:28:29,374 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-10 16:28:29,390 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 16:28:29,391 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 16:28:29,396 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 16:28:29,398 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 118 treesize of output 134 [2018-04-10 16:28:29,399 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 13 [2018-04-10 16:28:29,400 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-04-10 16:28:29,414 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-10 16:28:29,428 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-04-10 16:28:29,428 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 3 variables, input treesize:162, output treesize:132 [2018-04-10 16:28:29,558 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 16:28:29,564 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 219 treesize of output 201 [2018-04-10 16:28:29,567 INFO L682 Elim1Store]: detected equality via solver [2018-04-10 16:28:29,568 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 48 [2018-04-10 16:28:29,568 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-10 16:28:29,585 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-10 16:28:29,602 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 16:28:29,604 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 16:28:29,607 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 210 treesize of output 179 [2018-04-10 16:28:29,614 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 2 case distinctions, treesize of input 32 treesize of output 51 [2018-04-10 16:28:29,614 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 2 xjuncts. [2018-04-10 16:28:29,639 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-04-10 16:28:29,677 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-2 vars, End of recursive call: 3 dim-0 vars, and 2 xjuncts. [2018-04-10 16:28:29,677 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 4 variables, input treesize:240, output treesize:367 Received shutdown request... [2018-04-10 16:28:33,734 INFO L175 TraceCheckSpWp]: Timeout while computing interpolants [2018-04-10 16:28:33,734 WARN L519 AbstractCegarLoop]: Verification canceled [2018-04-10 16:28:33,738 WARN L197 ceAbstractionStarter]: Timeout [2018-04-10 16:28:33,739 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 10.04 04:28:33 BoogieIcfgContainer [2018-04-10 16:28:33,739 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-04-10 16:28:33,739 INFO L168 Benchmark]: Toolchain (without parser) took 214145.02 ms. Allocated memory was 402.7 MB in the beginning and 745.5 MB in the end (delta: 342.9 MB). Free memory was 334.5 MB in the beginning and 556.1 MB in the end (delta: -221.6 MB). Peak memory consumption was 121.3 MB. Max. memory is 5.3 GB. [2018-04-10 16:28:33,740 INFO L168 Benchmark]: CDTParser took 0.19 ms. Allocated memory is still 402.7 MB. Free memory is still 363.1 MB. There was no memory consumed. Max. memory is 5.3 GB. [2018-04-10 16:28:33,740 INFO L168 Benchmark]: CACSL2BoogieTranslator took 270.27 ms. Allocated memory is still 402.7 MB. Free memory was 333.2 MB in the beginning and 305.4 MB in the end (delta: 27.8 MB). Peak memory consumption was 27.8 MB. Max. memory is 5.3 GB. [2018-04-10 16:28:33,741 INFO L168 Benchmark]: Boogie Preprocessor took 46.13 ms. Allocated memory is still 402.7 MB. Free memory was 305.4 MB in the beginning and 302.8 MB in the end (delta: 2.6 MB). Peak memory consumption was 2.6 MB. Max. memory is 5.3 GB. [2018-04-10 16:28:33,741 INFO L168 Benchmark]: RCFGBuilder took 586.65 ms. Allocated memory was 402.7 MB in the beginning and 608.7 MB in the end (delta: 206.0 MB). Free memory was 302.8 MB in the beginning and 520.3 MB in the end (delta: -217.5 MB). Peak memory consumption was 26.0 MB. Max. memory is 5.3 GB. [2018-04-10 16:28:33,741 INFO L168 Benchmark]: TraceAbstraction took 213238.95 ms. Allocated memory was 608.7 MB in the beginning and 745.5 MB in the end (delta: 136.8 MB). Free memory was 520.3 MB in the beginning and 556.1 MB in the end (delta: -35.8 MB). Peak memory consumption was 101.0 MB. Max. memory is 5.3 GB. [2018-04-10 16:28:33,742 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.19 ms. Allocated memory is still 402.7 MB. Free memory is still 363.1 MB. There was no memory consumed. Max. memory is 5.3 GB. * CACSL2BoogieTranslator took 270.27 ms. Allocated memory is still 402.7 MB. Free memory was 333.2 MB in the beginning and 305.4 MB in the end (delta: 27.8 MB). Peak memory consumption was 27.8 MB. Max. memory is 5.3 GB. * Boogie Preprocessor took 46.13 ms. Allocated memory is still 402.7 MB. Free memory was 305.4 MB in the beginning and 302.8 MB in the end (delta: 2.6 MB). Peak memory consumption was 2.6 MB. Max. memory is 5.3 GB. * RCFGBuilder took 586.65 ms. Allocated memory was 402.7 MB in the beginning and 608.7 MB in the end (delta: 206.0 MB). Free memory was 302.8 MB in the beginning and 520.3 MB in the end (delta: -217.5 MB). Peak memory consumption was 26.0 MB. Max. memory is 5.3 GB. * TraceAbstraction took 213238.95 ms. Allocated memory was 608.7 MB in the beginning and 745.5 MB in the end (delta: 136.8 MB). Free memory was 520.3 MB in the beginning and 556.1 MB in the end (delta: -35.8 MB). Peak memory consumption was 101.0 MB. 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 71 with TraceHistMax 3, while TraceCheckSpWp was constructing forward predicates, while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 62. - TimeoutResultAtElement [Line: 1030]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 1030). Cancelled while BasicCegarLoop was analyzing trace of length 71 with TraceHistMax 3, while TraceCheckSpWp was constructing forward predicates, while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 62. - TimeoutResultAtElement [Line: 1045]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 1045). Cancelled while BasicCegarLoop was analyzing trace of length 71 with TraceHistMax 3, while TraceCheckSpWp was constructing forward predicates, while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 62. - TimeoutResultAtElement [Line: 1007]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 1007). Cancelled while BasicCegarLoop was analyzing trace of length 71 with TraceHistMax 3, while TraceCheckSpWp was constructing forward predicates, while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 62. - TimeoutResultAtElement [Line: 1024]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 1024). Cancelled while BasicCegarLoop was analyzing trace of length 71 with TraceHistMax 3, while TraceCheckSpWp was constructing forward predicates, while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 62. - TimeoutResultAtElement [Line: 1037]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 1037). Cancelled while BasicCegarLoop was analyzing trace of length 71 with TraceHistMax 3, while TraceCheckSpWp was constructing forward predicates, while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 62. - TimeoutResultAtElement [Line: 987]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 987). Cancelled while BasicCegarLoop was analyzing trace of length 71 with TraceHistMax 3, while TraceCheckSpWp was constructing forward predicates, while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 62. - TimeoutResultAtElement [Line: 1035]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 1035). Cancelled while BasicCegarLoop was analyzing trace of length 71 with TraceHistMax 3, while TraceCheckSpWp was constructing forward predicates, while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 62. - TimeoutResultAtElement [Line: 1038]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 1038). Cancelled while BasicCegarLoop was analyzing trace of length 71 with TraceHistMax 3, while TraceCheckSpWp was constructing forward predicates, while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 62. - TimeoutResultAtElement [Line: 1030]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 1030). Cancelled while BasicCegarLoop was analyzing trace of length 71 with TraceHistMax 3, while TraceCheckSpWp was constructing forward predicates, while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 62. - TimeoutResultAtElement [Line: 1053]: Timeout (TraceAbstraction) Unable to prove that free always succeeds (line 1053). Cancelled while BasicCegarLoop was analyzing trace of length 71 with TraceHistMax 3, while TraceCheckSpWp was constructing forward predicates, while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 62. - TimeoutResultAtElement [Line: 988]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 988). Cancelled while BasicCegarLoop was analyzing trace of length 71 with TraceHistMax 3, while TraceCheckSpWp was constructing forward predicates, while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 62. - TimeoutResultAtElement [Line: 983]: Timeout (TraceAbstraction) Unable to prove that all allocated memory was freed (line 983). Cancelled while BasicCegarLoop was analyzing trace of length 71 with TraceHistMax 3, while TraceCheckSpWp was constructing forward predicates, while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 62. - TimeoutResultAtElement [Line: 998]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 998). Cancelled while BasicCegarLoop was analyzing trace of length 71 with TraceHistMax 3, while TraceCheckSpWp was constructing forward predicates, while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 62. - TimeoutResultAtElement [Line: 1038]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 1038). Cancelled while BasicCegarLoop was analyzing trace of length 71 with TraceHistMax 3, while TraceCheckSpWp was constructing forward predicates, while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 62. - TimeoutResultAtElement [Line: 997]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 997). Cancelled while BasicCegarLoop was analyzing trace of length 71 with TraceHistMax 3, while TraceCheckSpWp was constructing forward predicates, while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 62. - TimeoutResultAtElement [Line: 995]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 995). Cancelled while BasicCegarLoop was analyzing trace of length 71 with TraceHistMax 3, while TraceCheckSpWp was constructing forward predicates, while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 62. - TimeoutResultAtElement [Line: 1036]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 1036). Cancelled while BasicCegarLoop was analyzing trace of length 71 with TraceHistMax 3, while TraceCheckSpWp was constructing forward predicates, while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 62. - TimeoutResultAtElement [Line: 1045]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 1045). Cancelled while BasicCegarLoop was analyzing trace of length 71 with TraceHistMax 3, while TraceCheckSpWp was constructing forward predicates, while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 62. - TimeoutResultAtElement [Line: 1002]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 1002). Cancelled while BasicCegarLoop was analyzing trace of length 71 with TraceHistMax 3, while TraceCheckSpWp was constructing forward predicates, while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 62. - TimeoutResultAtElement [Line: 1038]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 1038). Cancelled while BasicCegarLoop was analyzing trace of length 71 with TraceHistMax 3, while TraceCheckSpWp was constructing forward predicates, while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 62. - TimeoutResultAtElement [Line: 1035]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 1035). Cancelled while BasicCegarLoop was analyzing trace of length 71 with TraceHistMax 3, while TraceCheckSpWp was constructing forward predicates, while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 62. - TimeoutResultAtElement [Line: 996]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 996). Cancelled while BasicCegarLoop was analyzing trace of length 71 with TraceHistMax 3, while TraceCheckSpWp was constructing forward predicates, while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 62. - TimeoutResultAtElement [Line: 1052]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 1052). Cancelled while BasicCegarLoop was analyzing trace of length 71 with TraceHistMax 3, while TraceCheckSpWp was constructing forward predicates, while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 62. - TimeoutResultAtElement [Line: 1029]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 1029). Cancelled while BasicCegarLoop was analyzing trace of length 71 with TraceHistMax 3, while TraceCheckSpWp was constructing forward predicates, while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 62. - TimeoutResultAtElement [Line: 1038]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 1038). Cancelled while BasicCegarLoop was analyzing trace of length 71 with TraceHistMax 3, while TraceCheckSpWp was constructing forward predicates, while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 62. - TimeoutResultAtElement [Line: 996]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 996). Cancelled while BasicCegarLoop was analyzing trace of length 71 with TraceHistMax 3, while TraceCheckSpWp was constructing forward predicates, while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 62. - TimeoutResultAtElement [Line: 1038]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 1038). Cancelled while BasicCegarLoop was analyzing trace of length 71 with TraceHistMax 3, while TraceCheckSpWp was constructing forward predicates, while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 62. - TimeoutResultAtElement [Line: 989]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 989). Cancelled while BasicCegarLoop was analyzing trace of length 71 with TraceHistMax 3, while TraceCheckSpWp was constructing forward predicates, while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 62. - TimeoutResultAtElement [Line: 1041]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 1041). Cancelled while BasicCegarLoop was analyzing trace of length 71 with TraceHistMax 3, while TraceCheckSpWp was constructing forward predicates, while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 62. - TimeoutResultAtElement [Line: 1037]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 1037). Cancelled while BasicCegarLoop was analyzing trace of length 71 with TraceHistMax 3, while TraceCheckSpWp was constructing forward predicates, while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 62. - TimeoutResultAtElement [Line: 989]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 989). Cancelled while BasicCegarLoop was analyzing trace of length 71 with TraceHistMax 3, while TraceCheckSpWp was constructing forward predicates, while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 62. - TimeoutResultAtElement [Line: 997]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 997). Cancelled while BasicCegarLoop was analyzing trace of length 71 with TraceHistMax 3, while TraceCheckSpWp was constructing forward predicates, while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 62. - TimeoutResultAtElement [Line: 1053]: Timeout (TraceAbstraction) Unable to prove that free always succeeds (line 1053). Cancelled while BasicCegarLoop was analyzing trace of length 71 with TraceHistMax 3, while TraceCheckSpWp was constructing forward predicates, while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 62. - TimeoutResultAtElement [Line: 1037]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 1037). Cancelled while BasicCegarLoop was analyzing trace of length 71 with TraceHistMax 3, while TraceCheckSpWp was constructing forward predicates, while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 62. - TimeoutResultAtElement [Line: 1030]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 1030). Cancelled while BasicCegarLoop was analyzing trace of length 71 with TraceHistMax 3, while TraceCheckSpWp was constructing forward predicates, while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 62. - TimeoutResultAtElement [Line: 1036]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 1036). Cancelled while BasicCegarLoop was analyzing trace of length 71 with TraceHistMax 3, while TraceCheckSpWp was constructing forward predicates, while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 62. - TimeoutResultAtElement [Line: 1012]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 1012). Cancelled while BasicCegarLoop was analyzing trace of length 71 with TraceHistMax 3, while TraceCheckSpWp was constructing forward predicates, while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 62. - TimeoutResultAtElement [Line: 1037]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 1037). Cancelled while BasicCegarLoop was analyzing trace of length 71 with TraceHistMax 3, while TraceCheckSpWp was constructing forward predicates, while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 62. - TimeoutResultAtElement [Line: 1052]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 1052). Cancelled while BasicCegarLoop was analyzing trace of length 71 with TraceHistMax 3, while TraceCheckSpWp was constructing forward predicates, while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 62. - TimeoutResultAtElement [Line: 1038]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 1038). Cancelled while BasicCegarLoop was analyzing trace of length 71 with TraceHistMax 3, while TraceCheckSpWp was constructing forward predicates, while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 62. - TimeoutResultAtElement [Line: 1037]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 1037). Cancelled while BasicCegarLoop was analyzing trace of length 71 with TraceHistMax 3, while TraceCheckSpWp was constructing forward predicates, while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 62. - TimeoutResultAtElement [Line: 1002]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 1002). Cancelled while BasicCegarLoop was analyzing trace of length 71 with TraceHistMax 3, while TraceCheckSpWp was constructing forward predicates, while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 62. - TimeoutResultAtElement [Line: 1029]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 1029). Cancelled while BasicCegarLoop was analyzing trace of length 71 with TraceHistMax 3, while TraceCheckSpWp was constructing forward predicates, while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 62. - TimeoutResultAtElement [Line: 988]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 988). Cancelled while BasicCegarLoop was analyzing trace of length 71 with TraceHistMax 3, while TraceCheckSpWp was constructing forward predicates, while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 62. - TimeoutResultAtElement [Line: 1044]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 1044). Cancelled while BasicCegarLoop was analyzing trace of length 71 with TraceHistMax 3, while TraceCheckSpWp was constructing forward predicates, while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 62. - TimeoutResultAtElement [Line: 1038]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 1038). Cancelled while BasicCegarLoop was analyzing trace of length 71 with TraceHistMax 3, while TraceCheckSpWp was constructing forward predicates, while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 62. - TimeoutResultAtElement [Line: 1007]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 1007). Cancelled while BasicCegarLoop was analyzing trace of length 71 with TraceHistMax 3, while TraceCheckSpWp was constructing forward predicates, while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 62. - TimeoutResultAtElement [Line: 1024]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 1024). Cancelled while BasicCegarLoop was analyzing trace of length 71 with TraceHistMax 3, while TraceCheckSpWp was constructing forward predicates, while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 62. - TimeoutResultAtElement [Line: 1036]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 1036). Cancelled while BasicCegarLoop was analyzing trace of length 71 with TraceHistMax 3, while TraceCheckSpWp was constructing forward predicates, while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 62. - TimeoutResultAtElement [Line: 1030]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 1030). Cancelled while BasicCegarLoop was analyzing trace of length 71 with TraceHistMax 3, while TraceCheckSpWp was constructing forward predicates, while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 62. - TimeoutResultAtElement [Line: 987]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 987). Cancelled while BasicCegarLoop was analyzing trace of length 71 with TraceHistMax 3, while TraceCheckSpWp was constructing forward predicates, while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 62. - TimeoutResultAtElement [Line: 996]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 996). Cancelled while BasicCegarLoop was analyzing trace of length 71 with TraceHistMax 3, while TraceCheckSpWp was constructing forward predicates, while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 62. - TimeoutResultAtElement [Line: 1044]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 1044). Cancelled while BasicCegarLoop was analyzing trace of length 71 with TraceHistMax 3, while TraceCheckSpWp was constructing forward predicates, while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 62. - TimeoutResultAtElement [Line: 995]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 995). Cancelled while BasicCegarLoop was analyzing trace of length 71 with TraceHistMax 3, while TraceCheckSpWp was constructing forward predicates, while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 62. - TimeoutResultAtElement [Line: 1012]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 1012). Cancelled while BasicCegarLoop was analyzing trace of length 71 with TraceHistMax 3, while TraceCheckSpWp was constructing forward predicates, while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 62. - TimeoutResultAtElement [Line: 996]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 996). Cancelled while BasicCegarLoop was analyzing trace of length 71 with TraceHistMax 3, while TraceCheckSpWp was constructing forward predicates, while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 62. - TimeoutResultAtElement [Line: 1036]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 1036). Cancelled while BasicCegarLoop was analyzing trace of length 71 with TraceHistMax 3, while TraceCheckSpWp was constructing forward predicates, while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 62. - TimeoutResultAtElement [Line: 1038]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 1038). Cancelled while BasicCegarLoop was analyzing trace of length 71 with TraceHistMax 3, while TraceCheckSpWp was constructing forward predicates, while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 62. - TimeoutResultAtElement [Line: 998]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 998). Cancelled while BasicCegarLoop was analyzing trace of length 71 with TraceHistMax 3, while TraceCheckSpWp was constructing forward predicates, while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 62. - TimeoutResultAtElement [Line: 1037]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 1037). Cancelled while BasicCegarLoop was analyzing trace of length 71 with TraceHistMax 3, while TraceCheckSpWp was constructing forward predicates, while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 62. - StatisticsResult: Ultimate Automizer benchmark data CFG has 3 procedures, 174 locations, 61 error locations. TIMEOUT Result, 213.2s OverallTime, 28 OverallIterations, 3 TraceHistogramMax, 139.1s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 3471 SDtfs, 8305 SDslu, 12610 SDs, 0 SdLazy, 9300 SolverSat, 462 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 5.2s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 1084 GetRequests, 672 SyntacticMatches, 7 SemanticMatches, 405 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1718 ImplicationChecksByTransitivity, 195.9s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=323occurred in iteration=27, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s AbstIntTime, 0 AbstIntIterations, 0 AbstIntStrong, NaN AbsIntWeakeningRatio, NaN AbsIntAvgWeakeningVarsNumRemoved, NaN AbsIntAvgWeakenedConjuncts, 0.0s DumpTime, AutomataMinimizationStatistics: 0.1s AutomataMinimizationTime, 27 MinimizatonAttempts, 932 StatesRemovedByMinimization, 26 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.6s SatisfiabilityAnalysisTime, 67.9s InterpolantComputationTime, 2015 NumberOfCodeBlocks, 2015 NumberOfCodeBlocksAsserted, 47 NumberOfCheckSat, 1230 ConstructedInterpolants, 323 QuantifiedInterpolants, 1849751 SizeOfPredicates, 186 NumberOfNonLiveVariables, 2943 ConjunctsInSsa, 464 ConjunctsInUnsatCore, 29 InterpolantComputations, 16 PerfectInterpolantSequences, 70/150 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-queue_true-unreach-call_true-valid-memsafety.i_svcomp-DerefFreeMemtrack-32bit-Automizer_SmtInterpol_NoArray.epf_AutomizerC.xml/Csv-Benchmark-0-2018-04-10_16-28-33-748.csv Written .csv to /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/dll-queue_true-unreach-call_true-valid-memsafety.i_svcomp-DerefFreeMemtrack-32bit-Automizer_SmtInterpol_NoArray.epf_AutomizerC.xml/Csv-TraceAbstractionBenchmarks-0-2018-04-10_16-28-33-748.csv Completed graceful shutdown