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/ai/eq-bench/svcomp-DerefFreeMemtrack-32bit-Automizer_Fixed_noBitfields+AI_EQ_SS.epf -i ../../../trunk/examples/svcomp/memsafety-ext/dll_extends_pointer_true-valid-memsafety.i -------------------------------------------------------------------------------- This is Ultimate 0.1.23-1cf7e2d-m [2018-03-29 21:04:34,081 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-03-29 21:04:34,083 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-03-29 21:04:34,098 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-03-29 21:04:34,099 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-03-29 21:04:34,100 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-03-29 21:04:34,101 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-03-29 21:04:34,102 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-03-29 21:04:34,105 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-03-29 21:04:34,105 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-03-29 21:04:34,106 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-03-29 21:04:34,107 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-03-29 21:04:34,108 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-03-29 21:04:34,109 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-03-29 21:04:34,110 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-03-29 21:04:34,112 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-03-29 21:04:34,114 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-03-29 21:04:34,116 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-03-29 21:04:34,117 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-03-29 21:04:34,118 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-03-29 21:04:34,121 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-03-29 21:04:34,121 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-03-29 21:04:34,121 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-03-29 21:04:34,122 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-03-29 21:04:34,123 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-03-29 21:04:34,124 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-03-29 21:04:34,125 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-03-29 21:04:34,125 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-03-29 21:04:34,126 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-03-29 21:04:34,126 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-03-29 21:04:34,127 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-03-29 21:04:34,127 INFO L98 SettingsManager]: Beginning loading settings from /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/ai/eq-bench/svcomp-DerefFreeMemtrack-32bit-Automizer_Fixed_noBitfields+AI_EQ_SS.epf [2018-03-29 21:04:34,151 INFO L110 SettingsManager]: Loading preferences was successful [2018-03-29 21:04:34,152 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-03-29 21:04:34,152 INFO L131 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2018-03-29 21:04:34,152 INFO L133 SettingsManager]: * ultimate.logging.details=de.uni_freiburg.informatik.ultimate.plugins.icfgtransformation=DEBUG; [2018-03-29 21:04:34,153 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-03-29 21:04:34,153 INFO L133 SettingsManager]: * to procedures, called more than once=true [2018-03-29 21:04:34,153 INFO L131 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2018-03-29 21:04:34,153 INFO L133 SettingsManager]: * Abstract domain for RCFG-of-the-future=VPDomain [2018-03-29 21:04:34,154 INFO L133 SettingsManager]: * Use the RCFG-of-the-future interface=true [2018-03-29 21:04:34,154 INFO L131 SettingsManager]: Preferences of LTL2Aut differ from their defaults: [2018-03-29 21:04:34,154 INFO L133 SettingsManager]: * Property to check=[] a a: x > 42 [2018-03-29 21:04:34,154 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-03-29 21:04:34,155 INFO L133 SettingsManager]: * sizeof long=4 [2018-03-29 21:04:34,155 INFO L133 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2018-03-29 21:04:34,155 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-03-29 21:04:34,155 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-03-29 21:04:34,155 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-03-29 21:04:34,156 INFO L133 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2018-03-29 21:04:34,156 INFO L133 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2018-03-29 21:04:34,156 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-03-29 21:04:34,156 INFO L133 SettingsManager]: * sizeof long double=12 [2018-03-29 21:04:34,156 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-03-29 21:04:34,157 INFO L133 SettingsManager]: * Size of a code block=SingleStatement [2018-03-29 21:04:34,157 INFO L133 SettingsManager]: * Add additional assume for each assert=false [2018-03-29 21:04:34,157 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-03-29 21:04:34,157 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-03-29 21:04:34,157 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-03-29 21:04:34,158 INFO L133 SettingsManager]: * Interpolant automaton=TWOTRACK [2018-03-29 21:04:34,158 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-03-29 21:04:34,158 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-03-29 21:04:34,158 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-03-29 21:04:34,158 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-03-29 21:04:34,158 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-03-29 21:04:34,159 INFO L131 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2018-03-29 21:04:34,160 INFO L133 SettingsManager]: * TransformationType=HEAP_SEPARATOR [2018-03-29 21:04:34,160 INFO L131 SettingsManager]: Preferences of Boogie Printer differ from their defaults: [2018-03-29 21:04:34,160 INFO L133 SettingsManager]: * Dump path:=C:\Users\alex\AppData\Local\Temp\ [2018-03-29 21:04:34,194 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-03-29 21:04:34,207 INFO L266 ainManager$Toolchain]: [Toolchain 1]: Parser(s) successfully (re)initialized [2018-03-29 21:04:34,211 INFO L222 ainManager$Toolchain]: [Toolchain 1]: Toolchain data selected. [2018-03-29 21:04:34,212 INFO L271 PluginConnector]: Initializing CDTParser... [2018-03-29 21:04:34,213 INFO L276 PluginConnector]: CDTParser initialized [2018-03-29 21:04:34,214 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/memsafety-ext/dll_extends_pointer_true-valid-memsafety.i [2018-03-29 21:04:34,527 INFO L225 CDTParser]: Created temporary CDT project at /storage/ultimate/releaseScripts/default/UAutomizer-linux/data/FLAG7eb632797 [2018-03-29 21:04:34,703 INFO L287 CDTParser]: IsIndexed: true [2018-03-29 21:04:34,704 INFO L288 CDTParser]: Found 1 translation units. [2018-03-29 21:04:34,704 INFO L168 CDTParser]: Scanning dll_extends_pointer_true-valid-memsafety.i [2018-03-29 21:04:34,715 INFO L210 ultiparseSymbolTable]: Include resolver: [2018-03-29 21:04:34,715 INFO L215 ultiparseSymbolTable]: [2018-03-29 21:04:34,716 INFO L218 ultiparseSymbolTable]: Function table: [2018-03-29 21:04:34,716 INFO L221 ultiparseSymbolTable]: Function definition of null ('main') in dll_extends_pointer_true-valid-memsafety.i [2018-03-29 21:04:34,716 INFO L227 ultiparseSymbolTable]: Global variable table: [2018-03-29 21:04:34,716 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fdll_extends_pointer_true_valid_memsafety_i__suseconds_t in dll_extends_pointer_true-valid-memsafety.i [2018-03-29 21:04:34,716 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fdll_extends_pointer_true_valid_memsafety_i__fd_mask in dll_extends_pointer_true-valid-memsafety.i [2018-03-29 21:04:34,716 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fdll_extends_pointer_true_valid_memsafety_i____WAIT_STATUS in dll_extends_pointer_true-valid-memsafety.i [2018-03-29 21:04:34,717 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fdll_extends_pointer_true_valid_memsafety_i__int64_t in dll_extends_pointer_true-valid-memsafety.i [2018-03-29 21:04:34,717 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fdll_extends_pointer_true_valid_memsafety_i____loff_t in dll_extends_pointer_true-valid-memsafety.i [2018-03-29 21:04:34,717 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fdll_extends_pointer_true_valid_memsafety_i__fsid_t in dll_extends_pointer_true-valid-memsafety.i [2018-03-29 21:04:34,717 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fdll_extends_pointer_true_valid_memsafety_i__ushort in dll_extends_pointer_true-valid-memsafety.i [2018-03-29 21:04:34,717 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fdll_extends_pointer_true_valid_memsafety_i__pthread_cond_t in dll_extends_pointer_true-valid-memsafety.i [2018-03-29 21:04:34,717 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fdll_extends_pointer_true_valid_memsafety_i____u_quad_t in dll_extends_pointer_true-valid-memsafety.i [2018-03-29 21:04:34,717 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fdll_extends_pointer_true_valid_memsafety_i__pthread_barrier_t in dll_extends_pointer_true-valid-memsafety.i [2018-03-29 21:04:34,717 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fdll_extends_pointer_true_valid_memsafety_i____blkcnt_t in dll_extends_pointer_true-valid-memsafety.i [2018-03-29 21:04:34,718 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fdll_extends_pointer_true_valid_memsafety_i____clock_t in dll_extends_pointer_true-valid-memsafety.i [2018-03-29 21:04:34,718 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fdll_extends_pointer_true_valid_memsafety_i____daddr_t in dll_extends_pointer_true-valid-memsafety.i [2018-03-29 21:04:34,718 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fdll_extends_pointer_true_valid_memsafety_i____ino64_t in dll_extends_pointer_true-valid-memsafety.i [2018-03-29 21:04:34,718 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fdll_extends_pointer_true_valid_memsafety_i____uint8_t in dll_extends_pointer_true-valid-memsafety.i [2018-03-29 21:04:34,718 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fdll_extends_pointer_true_valid_memsafety_i____quad_t in dll_extends_pointer_true-valid-memsafety.i [2018-03-29 21:04:34,718 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fdll_extends_pointer_true_valid_memsafety_i____gid_t in dll_extends_pointer_true-valid-memsafety.i [2018-03-29 21:04:34,718 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fdll_extends_pointer_true_valid_memsafety_i__pthread_spinlock_t in dll_extends_pointer_true-valid-memsafety.i [2018-03-29 21:04:34,718 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fdll_extends_pointer_true_valid_memsafety_i____pid_t in dll_extends_pointer_true-valid-memsafety.i [2018-03-29 21:04:34,719 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fdll_extends_pointer_true_valid_memsafety_i____uint16_t in dll_extends_pointer_true-valid-memsafety.i [2018-03-29 21:04:34,719 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fdll_extends_pointer_true_valid_memsafety_i____sigset_t in dll_extends_pointer_true-valid-memsafety.i [2018-03-29 21:04:34,719 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fdll_extends_pointer_true_valid_memsafety_i____ino_t in dll_extends_pointer_true-valid-memsafety.i [2018-03-29 21:04:34,719 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fdll_extends_pointer_true_valid_memsafety_i__Node in dll_extends_pointer_true-valid-memsafety.i [2018-03-29 21:04:34,719 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fdll_extends_pointer_true_valid_memsafety_i__id_t in dll_extends_pointer_true-valid-memsafety.i [2018-03-29 21:04:34,719 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fdll_extends_pointer_true_valid_memsafety_i__wchar_t in dll_extends_pointer_true-valid-memsafety.i [2018-03-29 21:04:34,719 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fdll_extends_pointer_true_valid_memsafety_i____u_int in dll_extends_pointer_true-valid-memsafety.i [2018-03-29 21:04:34,719 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fdll_extends_pointer_true_valid_memsafety_i____useconds_t in dll_extends_pointer_true-valid-memsafety.i [2018-03-29 21:04:34,719 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fdll_extends_pointer_true_valid_memsafety_i__loff_t in dll_extends_pointer_true-valid-memsafety.i [2018-03-29 21:04:34,719 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fdll_extends_pointer_true_valid_memsafety_i____int16_t in dll_extends_pointer_true-valid-memsafety.i [2018-03-29 21:04:34,719 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fdll_extends_pointer_true_valid_memsafety_i__dev_t in dll_extends_pointer_true-valid-memsafety.i [2018-03-29 21:04:34,719 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fdll_extends_pointer_true_valid_memsafety_i____key_t in dll_extends_pointer_true-valid-memsafety.i [2018-03-29 21:04:34,719 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fdll_extends_pointer_true_valid_memsafety_i____int64_t in dll_extends_pointer_true-valid-memsafety.i [2018-03-29 21:04:34,720 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fdll_extends_pointer_true_valid_memsafety_i____clockid_t in dll_extends_pointer_true-valid-memsafety.i [2018-03-29 21:04:34,720 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fdll_extends_pointer_true_valid_memsafety_i__u_char in dll_extends_pointer_true-valid-memsafety.i [2018-03-29 21:04:34,720 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fdll_extends_pointer_true_valid_memsafety_i__u_int16_t in dll_extends_pointer_true-valid-memsafety.i [2018-03-29 21:04:34,720 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fdll_extends_pointer_true_valid_memsafety_i__blkcnt_t in dll_extends_pointer_true-valid-memsafety.i [2018-03-29 21:04:34,720 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fdll_extends_pointer_true_valid_memsafety_i__pthread_attr_t in dll_extends_pointer_true-valid-memsafety.i [2018-03-29 21:04:34,720 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fdll_extends_pointer_true_valid_memsafety_i__quad_t in dll_extends_pointer_true-valid-memsafety.i [2018-03-29 21:04:34,720 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fdll_extends_pointer_true_valid_memsafety_i____pthread_list_t in dll_extends_pointer_true-valid-memsafety.i [2018-03-29 21:04:34,720 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fdll_extends_pointer_true_valid_memsafety_i__pthread_barrierattr_t in dll_extends_pointer_true-valid-memsafety.i [2018-03-29 21:04:34,720 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fdll_extends_pointer_true_valid_memsafety_i__u_quad_t in dll_extends_pointer_true-valid-memsafety.i [2018-03-29 21:04:34,720 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fdll_extends_pointer_true_valid_memsafety_i____swblk_t in dll_extends_pointer_true-valid-memsafety.i [2018-03-29 21:04:34,720 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fdll_extends_pointer_true_valid_memsafety_i__pthread_once_t in dll_extends_pointer_true-valid-memsafety.i [2018-03-29 21:04:34,720 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fdll_extends_pointer_true_valid_memsafety_i____u_long in dll_extends_pointer_true-valid-memsafety.i [2018-03-29 21:04:34,720 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fdll_extends_pointer_true_valid_memsafety_i__ulong in dll_extends_pointer_true-valid-memsafety.i [2018-03-29 21:04:34,721 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fdll_extends_pointer_true_valid_memsafety_i____qaddr_t in dll_extends_pointer_true-valid-memsafety.i [2018-03-29 21:04:34,721 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fdll_extends_pointer_true_valid_memsafety_i__blksize_t in dll_extends_pointer_true-valid-memsafety.i [2018-03-29 21:04:34,721 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fdll_extends_pointer_true_valid_memsafety_i____blksize_t in dll_extends_pointer_true-valid-memsafety.i [2018-03-29 21:04:34,721 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fdll_extends_pointer_true_valid_memsafety_i__u_short in dll_extends_pointer_true-valid-memsafety.i [2018-03-29 21:04:34,721 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fdll_extends_pointer_true_valid_memsafety_i____rlim64_t in dll_extends_pointer_true-valid-memsafety.i [2018-03-29 21:04:34,721 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fdll_extends_pointer_true_valid_memsafety_i__pthread_condattr_t in dll_extends_pointer_true-valid-memsafety.i [2018-03-29 21:04:34,721 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fdll_extends_pointer_true_valid_memsafety_i__clock_t in dll_extends_pointer_true-valid-memsafety.i [2018-03-29 21:04:34,721 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fdll_extends_pointer_true_valid_memsafety_i__fd_set in dll_extends_pointer_true-valid-memsafety.i [2018-03-29 21:04:34,721 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fdll_extends_pointer_true_valid_memsafety_i__daddr_t in dll_extends_pointer_true-valid-memsafety.i [2018-03-29 21:04:34,721 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fdll_extends_pointer_true_valid_memsafety_i____fsid_t in dll_extends_pointer_true-valid-memsafety.i [2018-03-29 21:04:34,721 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fdll_extends_pointer_true_valid_memsafety_i__gid_t in dll_extends_pointer_true-valid-memsafety.i [2018-03-29 21:04:34,721 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fdll_extends_pointer_true_valid_memsafety_i__pid_t in dll_extends_pointer_true-valid-memsafety.i [2018-03-29 21:04:34,722 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fdll_extends_pointer_true_valid_memsafety_i__u_long in dll_extends_pointer_true-valid-memsafety.i [2018-03-29 21:04:34,722 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fdll_extends_pointer_true_valid_memsafety_i__mode_t in dll_extends_pointer_true-valid-memsafety.i [2018-03-29 21:04:34,722 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fdll_extends_pointer_true_valid_memsafety_i____caddr_t in dll_extends_pointer_true-valid-memsafety.i [2018-03-29 21:04:34,722 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fdll_extends_pointer_true_valid_memsafety_i____int8_t in dll_extends_pointer_true-valid-memsafety.i [2018-03-29 21:04:34,722 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fdll_extends_pointer_true_valid_memsafety_i____dev_t in dll_extends_pointer_true-valid-memsafety.i [2018-03-29 21:04:34,722 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fdll_extends_pointer_true_valid_memsafety_i__pthread_mutex_t in dll_extends_pointer_true-valid-memsafety.i [2018-03-29 21:04:34,722 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fdll_extends_pointer_true_valid_memsafety_i____u_short in dll_extends_pointer_true-valid-memsafety.i [2018-03-29 21:04:34,723 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fdll_extends_pointer_true_valid_memsafety_i__size_t in dll_extends_pointer_true-valid-memsafety.i [2018-03-29 21:04:34,723 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fdll_extends_pointer_true_valid_memsafety_i____rlim_t in dll_extends_pointer_true-valid-memsafety.i [2018-03-29 21:04:34,723 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fdll_extends_pointer_true_valid_memsafety_i____intptr_t in dll_extends_pointer_true-valid-memsafety.i [2018-03-29 21:04:34,723 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fdll_extends_pointer_true_valid_memsafety_i____mode_t in dll_extends_pointer_true-valid-memsafety.i [2018-03-29 21:04:34,723 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fdll_extends_pointer_true_valid_memsafety_i____time_t in dll_extends_pointer_true-valid-memsafety.i [2018-03-29 21:04:34,723 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fdll_extends_pointer_true_valid_memsafety_i____timer_t in dll_extends_pointer_true-valid-memsafety.i [2018-03-29 21:04:34,723 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fdll_extends_pointer_true_valid_memsafety_i__int8_t in dll_extends_pointer_true-valid-memsafety.i [2018-03-29 21:04:34,723 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fdll_extends_pointer_true_valid_memsafety_i____suseconds_t in dll_extends_pointer_true-valid-memsafety.i [2018-03-29 21:04:34,723 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fdll_extends_pointer_true_valid_memsafety_i__u_int in dll_extends_pointer_true-valid-memsafety.i [2018-03-29 21:04:34,724 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fdll_extends_pointer_true_valid_memsafety_i____fsfilcnt_t in dll_extends_pointer_true-valid-memsafety.i [2018-03-29 21:04:34,724 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fdll_extends_pointer_true_valid_memsafety_i__caddr_t in dll_extends_pointer_true-valid-memsafety.i [2018-03-29 21:04:34,724 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fdll_extends_pointer_true_valid_memsafety_i__pthread_mutexattr_t in dll_extends_pointer_true-valid-memsafety.i [2018-03-29 21:04:34,724 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fdll_extends_pointer_true_valid_memsafety_i____uint32_t in dll_extends_pointer_true-valid-memsafety.i [2018-03-29 21:04:34,724 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fdll_extends_pointer_true_valid_memsafety_i__u_int64_t in dll_extends_pointer_true-valid-memsafety.i [2018-03-29 21:04:34,724 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fdll_extends_pointer_true_valid_memsafety_i____fsfilcnt64_t in dll_extends_pointer_true-valid-memsafety.i [2018-03-29 21:04:34,724 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fdll_extends_pointer_true_valid_memsafety_i__pthread_rwlock_t in dll_extends_pointer_true-valid-memsafety.i [2018-03-29 21:04:34,724 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fdll_extends_pointer_true_valid_memsafety_i__off_t in dll_extends_pointer_true-valid-memsafety.i [2018-03-29 21:04:34,725 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fdll_extends_pointer_true_valid_memsafety_i__ldiv_t in dll_extends_pointer_true-valid-memsafety.i [2018-03-29 21:04:34,725 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fdll_extends_pointer_true_valid_memsafety_i__ino_t in dll_extends_pointer_true-valid-memsafety.i [2018-03-29 21:04:34,725 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fdll_extends_pointer_true_valid_memsafety_i__div_t in dll_extends_pointer_true-valid-memsafety.i [2018-03-29 21:04:34,725 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fdll_extends_pointer_true_valid_memsafety_i__register_t in dll_extends_pointer_true-valid-memsafety.i [2018-03-29 21:04:34,725 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fdll_extends_pointer_true_valid_memsafety_i__time_t in dll_extends_pointer_true-valid-memsafety.i [2018-03-29 21:04:34,725 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fdll_extends_pointer_true_valid_memsafety_i__pthread_key_t in dll_extends_pointer_true-valid-memsafety.i [2018-03-29 21:04:34,725 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fdll_extends_pointer_true_valid_memsafety_i__lldiv_t in dll_extends_pointer_true-valid-memsafety.i [2018-03-29 21:04:34,725 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fdll_extends_pointer_true_valid_memsafety_i__Data in dll_extends_pointer_true-valid-memsafety.i [2018-03-29 21:04:34,726 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fdll_extends_pointer_true_valid_memsafety_i__int16_t in dll_extends_pointer_true-valid-memsafety.i [2018-03-29 21:04:34,726 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fdll_extends_pointer_true_valid_memsafety_i____socklen_t in dll_extends_pointer_true-valid-memsafety.i [2018-03-29 21:04:34,726 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fdll_extends_pointer_true_valid_memsafety_i____fsblkcnt_t in dll_extends_pointer_true-valid-memsafety.i [2018-03-29 21:04:34,726 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fdll_extends_pointer_true_valid_memsafety_i__uid_t in dll_extends_pointer_true-valid-memsafety.i [2018-03-29 21:04:34,726 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fdll_extends_pointer_true_valid_memsafety_i____uint64_t in dll_extends_pointer_true-valid-memsafety.i [2018-03-29 21:04:34,726 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fdll_extends_pointer_true_valid_memsafety_i__ssize_t in dll_extends_pointer_true-valid-memsafety.i [2018-03-29 21:04:34,726 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fdll_extends_pointer_true_valid_memsafety_i____fsblkcnt64_t in dll_extends_pointer_true-valid-memsafety.i [2018-03-29 21:04:34,726 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fdll_extends_pointer_true_valid_memsafety_i__u_int32_t in dll_extends_pointer_true-valid-memsafety.i [2018-03-29 21:04:34,726 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fdll_extends_pointer_true_valid_memsafety_i____uid_t in dll_extends_pointer_true-valid-memsafety.i [2018-03-29 21:04:34,727 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fdll_extends_pointer_true_valid_memsafety_i____u_char in dll_extends_pointer_true-valid-memsafety.i [2018-03-29 21:04:34,727 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fdll_extends_pointer_true_valid_memsafety_i____off64_t in dll_extends_pointer_true-valid-memsafety.i [2018-03-29 21:04:34,727 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fdll_extends_pointer_true_valid_memsafety_i__sigset_t in dll_extends_pointer_true-valid-memsafety.i [2018-03-29 21:04:34,727 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fdll_extends_pointer_true_valid_memsafety_i__u_int8_t in dll_extends_pointer_true-valid-memsafety.i [2018-03-29 21:04:34,727 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fdll_extends_pointer_true_valid_memsafety_i__uint in dll_extends_pointer_true-valid-memsafety.i [2018-03-29 21:04:34,727 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fdll_extends_pointer_true_valid_memsafety_i__int32_t in dll_extends_pointer_true-valid-memsafety.i [2018-03-29 21:04:34,727 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fdll_extends_pointer_true_valid_memsafety_i____id_t in dll_extends_pointer_true-valid-memsafety.i [2018-03-29 21:04:34,728 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fdll_extends_pointer_true_valid_memsafety_i__fsblkcnt_t in dll_extends_pointer_true-valid-memsafety.i [2018-03-29 21:04:34,728 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fdll_extends_pointer_true_valid_memsafety_i__nlink_t in dll_extends_pointer_true-valid-memsafety.i [2018-03-29 21:04:34,728 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fdll_extends_pointer_true_valid_memsafety_i__pthread_t in dll_extends_pointer_true-valid-memsafety.i [2018-03-29 21:04:34,728 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fdll_extends_pointer_true_valid_memsafety_i__fsfilcnt_t in dll_extends_pointer_true-valid-memsafety.i [2018-03-29 21:04:34,728 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fdll_extends_pointer_true_valid_memsafety_i____blkcnt64_t in dll_extends_pointer_true-valid-memsafety.i [2018-03-29 21:04:34,728 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fdll_extends_pointer_true_valid_memsafety_i__pthread_rwlockattr_t in dll_extends_pointer_true-valid-memsafety.i [2018-03-29 21:04:34,728 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fdll_extends_pointer_true_valid_memsafety_i____int32_t in dll_extends_pointer_true-valid-memsafety.i [2018-03-29 21:04:34,728 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fdll_extends_pointer_true_valid_memsafety_i__clockid_t in dll_extends_pointer_true-valid-memsafety.i [2018-03-29 21:04:34,728 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fdll_extends_pointer_true_valid_memsafety_i____off_t in dll_extends_pointer_true-valid-memsafety.i [2018-03-29 21:04:34,728 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fdll_extends_pointer_true_valid_memsafety_i____fd_mask in dll_extends_pointer_true-valid-memsafety.i [2018-03-29 21:04:34,729 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fdll_extends_pointer_true_valid_memsafety_i____nlink_t in dll_extends_pointer_true-valid-memsafety.i [2018-03-29 21:04:34,729 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fdll_extends_pointer_true_valid_memsafety_i__timer_t in dll_extends_pointer_true-valid-memsafety.i [2018-03-29 21:04:34,729 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fdll_extends_pointer_true_valid_memsafety_i____ssize_t in dll_extends_pointer_true-valid-memsafety.i [2018-03-29 21:04:34,729 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fdll_extends_pointer_true_valid_memsafety_i__key_t in dll_extends_pointer_true-valid-memsafety.i [2018-03-29 21:04:34,729 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fdll_extends_pointer_true_valid_memsafety_i____sig_atomic_t in dll_extends_pointer_true-valid-memsafety.i [2018-03-29 21:04:34,745 INFO L330 CDTParser]: Deleted temporary CDT project at /storage/ultimate/releaseScripts/default/UAutomizer-linux/data/FLAG7eb632797 [2018-03-29 21:04:34,750 INFO L304 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-03-29 21:04:34,755 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2018-03-29 21:04:34,755 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-03-29 21:04:34,755 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-03-29 21:04:34,762 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-03-29 21:04:34,763 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 29.03 09:04:34" (1/1) ... [2018-03-29 21:04:34,765 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@3e6f9815 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.03 09:04:34, skipping insertion in model container [2018-03-29 21:04:34,765 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 29.03 09:04:34" (1/1) ... [2018-03-29 21:04:34,778 INFO L167 Dispatcher]: Using SV-COMP mode [2018-03-29 21:04:34,809 INFO L167 Dispatcher]: Using SV-COMP mode [2018-03-29 21:04:34,999 INFO L175 PostProcessor]: Settings: Checked method=main [2018-03-29 21:04:35,045 INFO L175 PostProcessor]: Settings: Checked method=main [2018-03-29 21:04:35,051 INFO L100 SccComputation]: Graph consists of 0 InCaSumBalls and 110 non ball SCCs. Number of states in SCCs 110. [2018-03-29 21:04:35,102 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.03 09:04:35 WrapperNode [2018-03-29 21:04:35,103 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-03-29 21:04:35,104 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-03-29 21:04:35,104 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-03-29 21:04:35,104 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-03-29 21:04:35,119 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.03 09:04:35" (1/1) ... [2018-03-29 21:04:35,119 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.03 09:04:35" (1/1) ... [2018-03-29 21:04:35,136 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.03 09:04:35" (1/1) ... [2018-03-29 21:04:35,136 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.03 09:04:35" (1/1) ... [2018-03-29 21:04:35,149 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.03 09:04:35" (1/1) ... [2018-03-29 21:04:35,155 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.03 09:04:35" (1/1) ... [2018-03-29 21:04:35,158 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.03 09:04:35" (1/1) ... [2018-03-29 21:04:35,163 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-03-29 21:04:35,164 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-03-29 21:04:35,164 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-03-29 21:04:35,164 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-03-29 21:04:35,165 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.03 09:04:35" (1/1) ... No working directory specified, using /storage/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-03-29 21:04:35,288 INFO L136 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-03-29 21:04:35,288 INFO L136 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-03-29 21:04:35,289 INFO L136 BoogieDeclarations]: Found implementation of procedure main [2018-03-29 21:04:35,289 INFO L128 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2018-03-29 21:04:35,289 INFO L128 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2018-03-29 21:04:35,289 INFO L128 BoogieDeclarations]: Found specification of procedure __ctype_get_mb_cur_max [2018-03-29 21:04:35,289 INFO L128 BoogieDeclarations]: Found specification of procedure atof [2018-03-29 21:04:35,289 INFO L128 BoogieDeclarations]: Found specification of procedure atoi [2018-03-29 21:04:35,289 INFO L128 BoogieDeclarations]: Found specification of procedure atol [2018-03-29 21:04:35,289 INFO L128 BoogieDeclarations]: Found specification of procedure atoll [2018-03-29 21:04:35,289 INFO L128 BoogieDeclarations]: Found specification of procedure strtod [2018-03-29 21:04:35,290 INFO L128 BoogieDeclarations]: Found specification of procedure strtof [2018-03-29 21:04:35,290 INFO L128 BoogieDeclarations]: Found specification of procedure strtold [2018-03-29 21:04:35,290 INFO L128 BoogieDeclarations]: Found specification of procedure strtol [2018-03-29 21:04:35,290 INFO L128 BoogieDeclarations]: Found specification of procedure strtoul [2018-03-29 21:04:35,290 INFO L128 BoogieDeclarations]: Found specification of procedure strtoq [2018-03-29 21:04:35,290 INFO L128 BoogieDeclarations]: Found specification of procedure strtouq [2018-03-29 21:04:35,291 INFO L128 BoogieDeclarations]: Found specification of procedure strtoll [2018-03-29 21:04:35,291 INFO L128 BoogieDeclarations]: Found specification of procedure strtoull [2018-03-29 21:04:35,291 INFO L128 BoogieDeclarations]: Found specification of procedure l64a [2018-03-29 21:04:35,291 INFO L128 BoogieDeclarations]: Found specification of procedure a64l [2018-03-29 21:04:35,291 INFO L128 BoogieDeclarations]: Found specification of procedure select [2018-03-29 21:04:35,292 INFO L128 BoogieDeclarations]: Found specification of procedure pselect [2018-03-29 21:04:35,292 INFO L128 BoogieDeclarations]: Found specification of procedure gnu_dev_major [2018-03-29 21:04:35,292 INFO L128 BoogieDeclarations]: Found specification of procedure gnu_dev_minor [2018-03-29 21:04:35,292 INFO L128 BoogieDeclarations]: Found specification of procedure gnu_dev_makedev [2018-03-29 21:04:35,292 INFO L128 BoogieDeclarations]: Found specification of procedure random [2018-03-29 21:04:35,292 INFO L128 BoogieDeclarations]: Found specification of procedure srandom [2018-03-29 21:04:35,293 INFO L128 BoogieDeclarations]: Found specification of procedure initstate [2018-03-29 21:04:35,293 INFO L128 BoogieDeclarations]: Found specification of procedure setstate [2018-03-29 21:04:35,293 INFO L128 BoogieDeclarations]: Found specification of procedure random_r [2018-03-29 21:04:35,293 INFO L128 BoogieDeclarations]: Found specification of procedure srandom_r [2018-03-29 21:04:35,293 INFO L128 BoogieDeclarations]: Found specification of procedure initstate_r [2018-03-29 21:04:35,293 INFO L128 BoogieDeclarations]: Found specification of procedure setstate_r [2018-03-29 21:04:35,293 INFO L128 BoogieDeclarations]: Found specification of procedure rand [2018-03-29 21:04:35,294 INFO L128 BoogieDeclarations]: Found specification of procedure srand [2018-03-29 21:04:35,294 INFO L128 BoogieDeclarations]: Found specification of procedure rand_r [2018-03-29 21:04:35,294 INFO L128 BoogieDeclarations]: Found specification of procedure drand48 [2018-03-29 21:04:35,294 INFO L128 BoogieDeclarations]: Found specification of procedure erand48 [2018-03-29 21:04:35,294 INFO L128 BoogieDeclarations]: Found specification of procedure lrand48 [2018-03-29 21:04:35,294 INFO L128 BoogieDeclarations]: Found specification of procedure nrand48 [2018-03-29 21:04:35,294 INFO L128 BoogieDeclarations]: Found specification of procedure mrand48 [2018-03-29 21:04:35,294 INFO L128 BoogieDeclarations]: Found specification of procedure jrand48 [2018-03-29 21:04:35,295 INFO L128 BoogieDeclarations]: Found specification of procedure srand48 [2018-03-29 21:04:35,295 INFO L128 BoogieDeclarations]: Found specification of procedure seed48 [2018-03-29 21:04:35,295 INFO L128 BoogieDeclarations]: Found specification of procedure lcong48 [2018-03-29 21:04:35,295 INFO L128 BoogieDeclarations]: Found specification of procedure drand48_r [2018-03-29 21:04:35,295 INFO L128 BoogieDeclarations]: Found specification of procedure erand48_r [2018-03-29 21:04:35,295 INFO L128 BoogieDeclarations]: Found specification of procedure lrand48_r [2018-03-29 21:04:35,295 INFO L128 BoogieDeclarations]: Found specification of procedure nrand48_r [2018-03-29 21:04:35,296 INFO L128 BoogieDeclarations]: Found specification of procedure mrand48_r [2018-03-29 21:04:35,296 INFO L128 BoogieDeclarations]: Found specification of procedure jrand48_r [2018-03-29 21:04:35,296 INFO L128 BoogieDeclarations]: Found specification of procedure srand48_r [2018-03-29 21:04:35,296 INFO L128 BoogieDeclarations]: Found specification of procedure seed48_r [2018-03-29 21:04:35,296 INFO L128 BoogieDeclarations]: Found specification of procedure lcong48_r [2018-03-29 21:04:35,296 INFO L128 BoogieDeclarations]: Found specification of procedure malloc [2018-03-29 21:04:35,296 INFO L128 BoogieDeclarations]: Found specification of procedure calloc [2018-03-29 21:04:35,296 INFO L128 BoogieDeclarations]: Found specification of procedure realloc [2018-03-29 21:04:35,297 INFO L128 BoogieDeclarations]: Found specification of procedure free [2018-03-29 21:04:35,297 INFO L128 BoogieDeclarations]: Found specification of procedure cfree [2018-03-29 21:04:35,297 INFO L128 BoogieDeclarations]: Found specification of procedure alloca [2018-03-29 21:04:35,297 INFO L128 BoogieDeclarations]: Found specification of procedure valloc [2018-03-29 21:04:35,297 INFO L128 BoogieDeclarations]: Found specification of procedure posix_memalign [2018-03-29 21:04:35,297 INFO L128 BoogieDeclarations]: Found specification of procedure abort [2018-03-29 21:04:35,297 INFO L128 BoogieDeclarations]: Found specification of procedure atexit [2018-03-29 21:04:35,298 INFO L128 BoogieDeclarations]: Found specification of procedure on_exit [2018-03-29 21:04:35,298 INFO L128 BoogieDeclarations]: Found specification of procedure exit [2018-03-29 21:04:35,298 INFO L128 BoogieDeclarations]: Found specification of procedure _Exit [2018-03-29 21:04:35,298 INFO L128 BoogieDeclarations]: Found specification of procedure getenv [2018-03-29 21:04:35,298 INFO L128 BoogieDeclarations]: Found specification of procedure __secure_getenv [2018-03-29 21:04:35,298 INFO L128 BoogieDeclarations]: Found specification of procedure putenv [2018-03-29 21:04:35,298 INFO L128 BoogieDeclarations]: Found specification of procedure setenv [2018-03-29 21:04:35,298 INFO L128 BoogieDeclarations]: Found specification of procedure unsetenv [2018-03-29 21:04:35,299 INFO L128 BoogieDeclarations]: Found specification of procedure clearenv [2018-03-29 21:04:35,299 INFO L128 BoogieDeclarations]: Found specification of procedure mktemp [2018-03-29 21:04:35,299 INFO L128 BoogieDeclarations]: Found specification of procedure mkstemp [2018-03-29 21:04:35,299 INFO L128 BoogieDeclarations]: Found specification of procedure mkstemps [2018-03-29 21:04:35,299 INFO L128 BoogieDeclarations]: Found specification of procedure mkdtemp [2018-03-29 21:04:35,299 INFO L128 BoogieDeclarations]: Found specification of procedure system [2018-03-29 21:04:35,299 INFO L128 BoogieDeclarations]: Found specification of procedure realpath [2018-03-29 21:04:35,300 INFO L128 BoogieDeclarations]: Found specification of procedure bsearch [2018-03-29 21:04:35,300 INFO L128 BoogieDeclarations]: Found specification of procedure qsort [2018-03-29 21:04:35,300 INFO L128 BoogieDeclarations]: Found specification of procedure abs [2018-03-29 21:04:35,300 INFO L128 BoogieDeclarations]: Found specification of procedure labs [2018-03-29 21:04:35,300 INFO L128 BoogieDeclarations]: Found specification of procedure llabs [2018-03-29 21:04:35,300 INFO L128 BoogieDeclarations]: Found specification of procedure div [2018-03-29 21:04:35,300 INFO L128 BoogieDeclarations]: Found specification of procedure ldiv [2018-03-29 21:04:35,300 INFO L128 BoogieDeclarations]: Found specification of procedure lldiv [2018-03-29 21:04:35,301 INFO L128 BoogieDeclarations]: Found specification of procedure ecvt [2018-03-29 21:04:35,301 INFO L128 BoogieDeclarations]: Found specification of procedure fcvt [2018-03-29 21:04:35,301 INFO L128 BoogieDeclarations]: Found specification of procedure gcvt [2018-03-29 21:04:35,301 INFO L128 BoogieDeclarations]: Found specification of procedure qecvt [2018-03-29 21:04:35,301 INFO L128 BoogieDeclarations]: Found specification of procedure qfcvt [2018-03-29 21:04:35,301 INFO L128 BoogieDeclarations]: Found specification of procedure qgcvt [2018-03-29 21:04:35,301 INFO L128 BoogieDeclarations]: Found specification of procedure ecvt_r [2018-03-29 21:04:35,301 INFO L128 BoogieDeclarations]: Found specification of procedure fcvt_r [2018-03-29 21:04:35,302 INFO L128 BoogieDeclarations]: Found specification of procedure qecvt_r [2018-03-29 21:04:35,302 INFO L128 BoogieDeclarations]: Found specification of procedure qfcvt_r [2018-03-29 21:04:35,302 INFO L128 BoogieDeclarations]: Found specification of procedure mblen [2018-03-29 21:04:35,302 INFO L128 BoogieDeclarations]: Found specification of procedure mbtowc [2018-03-29 21:04:35,302 INFO L128 BoogieDeclarations]: Found specification of procedure wctomb [2018-03-29 21:04:35,302 INFO L128 BoogieDeclarations]: Found specification of procedure mbstowcs [2018-03-29 21:04:35,302 INFO L128 BoogieDeclarations]: Found specification of procedure wcstombs [2018-03-29 21:04:35,303 INFO L128 BoogieDeclarations]: Found specification of procedure rpmatch [2018-03-29 21:04:35,303 INFO L128 BoogieDeclarations]: Found specification of procedure getsubopt [2018-03-29 21:04:35,303 INFO L128 BoogieDeclarations]: Found specification of procedure getloadavg [2018-03-29 21:04:35,303 INFO L128 BoogieDeclarations]: Found specification of procedure main [2018-03-29 21:04:35,303 INFO L128 BoogieDeclarations]: Found specification of procedure #Ultimate.alloc [2018-03-29 21:04:35,303 INFO L128 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2018-03-29 21:04:35,303 INFO L128 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2018-03-29 21:04:35,303 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2018-03-29 21:04:35,303 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-03-29 21:04:35,304 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-03-29 21:04:35,666 INFO L259 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-03-29 21:04:35,667 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 29.03 09:04:35 BoogieIcfgContainer [2018-03-29 21:04:35,667 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-03-29 21:04:35,668 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-03-29 21:04:35,668 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-03-29 21:04:35,670 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-03-29 21:04:35,670 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 29.03 09:04:34" (1/3) ... [2018-03-29 21:04:35,671 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@25a2837c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 29.03 09:04:35, skipping insertion in model container [2018-03-29 21:04:35,671 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.03 09:04:35" (2/3) ... [2018-03-29 21:04:35,671 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@25a2837c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 29.03 09:04:35, skipping insertion in model container [2018-03-29 21:04:35,672 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 29.03 09:04:35" (3/3) ... [2018-03-29 21:04:35,673 INFO L107 eAbstractionObserver]: Analyzing ICFG dll_extends_pointer_true-valid-memsafety.i [2018-03-29 21:04:35,679 INFO L131 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-03-29 21:04:35,687 INFO L143 ceAbstractionStarter]: Appying trace abstraction to program that has 25 error locations. [2018-03-29 21:04:35,725 INFO L128 ementStrategyFactory]: Using default assertion order modulation [2018-03-29 21:04:35,726 INFO L369 AbstractCegarLoop]: Interprodecural is true [2018-03-29 21:04:35,726 INFO L370 AbstractCegarLoop]: Hoare is true [2018-03-29 21:04:35,726 INFO L371 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-03-29 21:04:35,726 INFO L372 AbstractCegarLoop]: Backedges is TWOTRACK [2018-03-29 21:04:35,726 INFO L373 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-03-29 21:04:35,726 INFO L374 AbstractCegarLoop]: Difference is false [2018-03-29 21:04:35,726 INFO L375 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-03-29 21:04:35,726 INFO L380 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-03-29 21:04:35,727 INFO L87 2NestedWordAutomaton]: Mode: main mode - execution starts in main procedure [2018-03-29 21:04:35,743 INFO L276 IsEmpty]: Start isEmpty. Operand 79 states. [2018-03-29 21:04:35,748 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2018-03-29 21:04:35,748 INFO L347 BasicCegarLoop]: Found error trace [2018-03-29 21:04:35,749 INFO L355 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-03-29 21:04:35,749 INFO L408 AbstractCegarLoop]: === Iteration 1 === [mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr21AssertViolationMEMORY_FREE, mainErr18RequiresViolation, mainErr0RequiresViolation, mainErr3RequiresViolation, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr2RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr24EnsuresViolationMEMORY_LEAK, mainErr19RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr23AssertViolationMEMORY_FREE, mainErr9RequiresViolation, mainErr22AssertViolationMEMORY_FREE, mainErr7RequiresViolation, mainErr11RequiresViolation, mainErr20AssertViolationMEMORY_FREE, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr4RequiresViolation, mainErr14RequiresViolation]=== [2018-03-29 21:04:35,752 INFO L82 PathProgramCache]: Analyzing trace with hash -1298363538, now seen corresponding path program 1 times No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 2 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-03-29 21:04:35,765 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-03-29 21:04:35,792 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-03-29 21:04:35,799 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-03-29 21:04:35,839 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select 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-03-29 21:04:35,841 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-03-29 21:04:35,857 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-03-29 21:04:35,858 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:6, output treesize:5 [2018-03-29 21:04:35,872 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-03-29 21:04:35,872 INFO L314 TraceCheckSpWp]: Computing backward predicates... [2018-03-29 21:04:35,885 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-03-29 21:04:35,908 INFO L320 seRefinementStrategy]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2018-03-29 21:04:35,908 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [3, 3] imperfect sequences [] total 3 [2018-03-29 21:04:35,910 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-03-29 21:04:35,920 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-03-29 21:04:35,920 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-03-29 21:04:35,922 INFO L87 Difference]: Start difference. First operand 79 states. Second operand 4 states. [2018-03-29 21:04:36,145 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-03-29 21:04:36,145 INFO L93 Difference]: Finished difference Result 145 states and 159 transitions. [2018-03-29 21:04:36,145 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-03-29 21:04:36,146 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 11 [2018-03-29 21:04:36,147 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-03-29 21:04:36,157 INFO L225 Difference]: With dead ends: 145 [2018-03-29 21:04:36,157 INFO L226 Difference]: Without dead ends: 102 [2018-03-29 21:04:36,160 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 19 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-03-29 21:04:36,175 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 102 states. [2018-03-29 21:04:36,192 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 102 to 72. [2018-03-29 21:04:36,193 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 72 states. [2018-03-29 21:04:36,194 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 72 states to 72 states and 76 transitions. [2018-03-29 21:04:36,196 INFO L78 Accepts]: Start accepts. Automaton has 72 states and 76 transitions. Word has length 11 [2018-03-29 21:04:36,196 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-03-29 21:04:36,196 INFO L459 AbstractCegarLoop]: Abstraction has 72 states and 76 transitions. [2018-03-29 21:04:36,196 INFO L460 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-03-29 21:04:36,196 INFO L276 IsEmpty]: Start isEmpty. Operand 72 states and 76 transitions. [2018-03-29 21:04:36,197 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2018-03-29 21:04:36,197 INFO L347 BasicCegarLoop]: Found error trace [2018-03-29 21:04:36,197 INFO L355 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-03-29 21:04:36,197 INFO L408 AbstractCegarLoop]: === Iteration 2 === [mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr21AssertViolationMEMORY_FREE, mainErr18RequiresViolation, mainErr0RequiresViolation, mainErr3RequiresViolation, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr2RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr24EnsuresViolationMEMORY_LEAK, mainErr19RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr23AssertViolationMEMORY_FREE, mainErr9RequiresViolation, mainErr22AssertViolationMEMORY_FREE, mainErr7RequiresViolation, mainErr11RequiresViolation, mainErr20AssertViolationMEMORY_FREE, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr4RequiresViolation, mainErr14RequiresViolation]=== [2018-03-29 21:04:36,197 INFO L82 PathProgramCache]: Analyzing trace with hash -1298363537, now seen corresponding path program 1 times No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 3 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-03-29 21:04:36,205 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-03-29 21:04:36,217 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-03-29 21:04:36,218 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-03-29 21:04:36,229 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select 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-03-29 21:04:36,230 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-03-29 21:04:36,245 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-03-29 21:04:36,246 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2018-03-29 21:04:36,263 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-03-29 21:04:36,264 INFO L314 TraceCheckSpWp]: Computing backward predicates... [2018-03-29 21:04:36,302 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-03-29 21:04:36,325 INFO L320 seRefinementStrategy]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2018-03-29 21:04:36,325 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [3, 3] imperfect sequences [] total 5 [2018-03-29 21:04:36,327 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-03-29 21:04:36,327 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-03-29 21:04:36,328 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2018-03-29 21:04:36,328 INFO L87 Difference]: Start difference. First operand 72 states and 76 transitions. Second operand 6 states. [2018-03-29 21:04:36,544 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-03-29 21:04:36,544 INFO L93 Difference]: Finished difference Result 157 states and 167 transitions. [2018-03-29 21:04:36,544 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-03-29 21:04:36,544 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 11 [2018-03-29 21:04:36,545 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-03-29 21:04:36,547 INFO L225 Difference]: With dead ends: 157 [2018-03-29 21:04:36,547 INFO L226 Difference]: Without dead ends: 154 [2018-03-29 21:04:36,548 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 17 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2018-03-29 21:04:36,548 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 154 states. [2018-03-29 21:04:36,556 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 154 to 69. [2018-03-29 21:04:36,556 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 69 states. [2018-03-29 21:04:36,558 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 69 states to 69 states and 73 transitions. [2018-03-29 21:04:36,558 INFO L78 Accepts]: Start accepts. Automaton has 69 states and 73 transitions. Word has length 11 [2018-03-29 21:04:36,558 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-03-29 21:04:36,558 INFO L459 AbstractCegarLoop]: Abstraction has 69 states and 73 transitions. [2018-03-29 21:04:36,558 INFO L460 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-03-29 21:04:36,558 INFO L276 IsEmpty]: Start isEmpty. Operand 69 states and 73 transitions. [2018-03-29 21:04:36,559 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2018-03-29 21:04:36,559 INFO L347 BasicCegarLoop]: Found error trace [2018-03-29 21:04:36,559 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] [2018-03-29 21:04:36,560 INFO L408 AbstractCegarLoop]: === Iteration 3 === [mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr21AssertViolationMEMORY_FREE, mainErr18RequiresViolation, mainErr0RequiresViolation, mainErr3RequiresViolation, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr2RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr24EnsuresViolationMEMORY_LEAK, mainErr19RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr23AssertViolationMEMORY_FREE, mainErr9RequiresViolation, mainErr22AssertViolationMEMORY_FREE, mainErr7RequiresViolation, mainErr11RequiresViolation, mainErr20AssertViolationMEMORY_FREE, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr4RequiresViolation, mainErr14RequiresViolation]=== [2018-03-29 21:04:36,560 INFO L82 PathProgramCache]: Analyzing trace with hash -1953155203, now seen corresponding path program 1 times No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 4 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-03-29 21:04:36,572 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-03-29 21:04:36,600 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-03-29 21:04:36,603 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-03-29 21:04:36,608 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select 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-03-29 21:04:36,609 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-03-29 21:04:36,611 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-03-29 21:04:36,611 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:6, output treesize:5 [2018-03-29 21:04:36,623 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-03-29 21:04:36,624 INFO L314 TraceCheckSpWp]: Computing backward predicates... [2018-03-29 21:04:36,631 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-03-29 21:04:36,652 INFO L320 seRefinementStrategy]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2018-03-29 21:04:36,652 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [3, 3] imperfect sequences [] total 3 [2018-03-29 21:04:36,653 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-03-29 21:04:36,653 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-03-29 21:04:36,653 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-03-29 21:04:36,653 INFO L87 Difference]: Start difference. First operand 69 states and 73 transitions. Second operand 4 states. [2018-03-29 21:04:36,757 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-03-29 21:04:36,757 INFO L93 Difference]: Finished difference Result 111 states and 116 transitions. [2018-03-29 21:04:36,757 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-03-29 21:04:36,757 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 21 [2018-03-29 21:04:36,758 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-03-29 21:04:36,758 INFO L225 Difference]: With dead ends: 111 [2018-03-29 21:04:36,758 INFO L226 Difference]: Without dead ends: 110 [2018-03-29 21:04:36,759 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 43 GetRequests, 40 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-03-29 21:04:36,759 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 110 states. [2018-03-29 21:04:36,762 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 110 to 68. [2018-03-29 21:04:36,763 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 68 states. [2018-03-29 21:04:36,764 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 68 states to 68 states and 72 transitions. [2018-03-29 21:04:36,764 INFO L78 Accepts]: Start accepts. Automaton has 68 states and 72 transitions. Word has length 21 [2018-03-29 21:04:36,764 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-03-29 21:04:36,764 INFO L459 AbstractCegarLoop]: Abstraction has 68 states and 72 transitions. [2018-03-29 21:04:36,764 INFO L460 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-03-29 21:04:36,764 INFO L276 IsEmpty]: Start isEmpty. Operand 68 states and 72 transitions. [2018-03-29 21:04:36,765 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2018-03-29 21:04:36,765 INFO L347 BasicCegarLoop]: Found error trace [2018-03-29 21:04:36,765 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] [2018-03-29 21:04:36,765 INFO L408 AbstractCegarLoop]: === Iteration 4 === [mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr21AssertViolationMEMORY_FREE, mainErr18RequiresViolation, mainErr0RequiresViolation, mainErr3RequiresViolation, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr2RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr24EnsuresViolationMEMORY_LEAK, mainErr19RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr23AssertViolationMEMORY_FREE, mainErr9RequiresViolation, mainErr22AssertViolationMEMORY_FREE, mainErr7RequiresViolation, mainErr11RequiresViolation, mainErr20AssertViolationMEMORY_FREE, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr4RequiresViolation, mainErr14RequiresViolation]=== [2018-03-29 21:04:36,765 INFO L82 PathProgramCache]: Analyzing trace with hash -1953155202, now seen corresponding path program 1 times No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 5 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 5 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-03-29 21:04:36,771 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-03-29 21:04:36,789 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-03-29 21:04:36,790 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-03-29 21:04:36,797 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select 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-03-29 21:04:36,798 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-03-29 21:04:36,802 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-03-29 21:04:36,802 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2018-03-29 21:04:36,816 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-03-29 21:04:36,816 INFO L314 TraceCheckSpWp]: Computing backward predicates... [2018-03-29 21:04:36,870 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-03-29 21:04:36,891 INFO L320 seRefinementStrategy]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2018-03-29 21:04:36,891 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [3, 3] imperfect sequences [] total 5 [2018-03-29 21:04:36,891 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-03-29 21:04:36,892 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-03-29 21:04:36,892 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2018-03-29 21:04:36,892 INFO L87 Difference]: Start difference. First operand 68 states and 72 transitions. Second operand 6 states. [2018-03-29 21:04:37,004 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-03-29 21:04:37,004 INFO L93 Difference]: Finished difference Result 126 states and 134 transitions. [2018-03-29 21:04:37,005 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-03-29 21:04:37,005 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 21 [2018-03-29 21:04:37,005 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-03-29 21:04:37,006 INFO L225 Difference]: With dead ends: 126 [2018-03-29 21:04:37,007 INFO L226 Difference]: Without dead ends: 124 [2018-03-29 21:04:37,007 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 43 GetRequests, 38 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2018-03-29 21:04:37,007 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 124 states. [2018-03-29 21:04:37,013 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 124 to 66. [2018-03-29 21:04:37,013 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 66 states. [2018-03-29 21:04:37,015 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 66 states to 66 states and 70 transitions. [2018-03-29 21:04:37,015 INFO L78 Accepts]: Start accepts. Automaton has 66 states and 70 transitions. Word has length 21 [2018-03-29 21:04:37,015 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-03-29 21:04:37,015 INFO L459 AbstractCegarLoop]: Abstraction has 66 states and 70 transitions. [2018-03-29 21:04:37,015 INFO L460 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-03-29 21:04:37,015 INFO L276 IsEmpty]: Start isEmpty. Operand 66 states and 70 transitions. [2018-03-29 21:04:37,016 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2018-03-29 21:04:37,016 INFO L347 BasicCegarLoop]: Found error trace [2018-03-29 21:04:37,016 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-03-29 21:04:37,017 INFO L408 AbstractCegarLoop]: === Iteration 5 === [mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr21AssertViolationMEMORY_FREE, mainErr18RequiresViolation, mainErr0RequiresViolation, mainErr3RequiresViolation, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr2RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr24EnsuresViolationMEMORY_LEAK, mainErr19RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr23AssertViolationMEMORY_FREE, mainErr9RequiresViolation, mainErr22AssertViolationMEMORY_FREE, mainErr7RequiresViolation, mainErr11RequiresViolation, mainErr20AssertViolationMEMORY_FREE, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr4RequiresViolation, mainErr14RequiresViolation]=== [2018-03-29 21:04:37,017 INFO L82 PathProgramCache]: Analyzing trace with hash -505999511, now seen corresponding path program 1 times No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 6 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 6 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-03-29 21:04:37,032 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-03-29 21:04:37,047 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-03-29 21:04:37,049 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-03-29 21:04:37,082 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-03-29 21:04:37,082 INFO L314 TraceCheckSpWp]: Computing backward predicates... [2018-03-29 21:04:37,091 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-03-29 21:04:37,112 INFO L320 seRefinementStrategy]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2018-03-29 21:04:37,113 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [5, 5] imperfect sequences [] total 5 [2018-03-29 21:04:37,113 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-03-29 21:04:37,113 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-03-29 21:04:37,113 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-03-29 21:04:37,113 INFO L87 Difference]: Start difference. First operand 66 states and 70 transitions. Second operand 5 states. [2018-03-29 21:04:37,230 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-03-29 21:04:37,230 INFO L93 Difference]: Finished difference Result 123 states and 132 transitions. [2018-03-29 21:04:37,230 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-03-29 21:04:37,230 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 22 [2018-03-29 21:04:37,230 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-03-29 21:04:37,232 INFO L225 Difference]: With dead ends: 123 [2018-03-29 21:04:37,232 INFO L226 Difference]: Without dead ends: 120 [2018-03-29 21:04:37,232 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 46 GetRequests, 40 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-03-29 21:04:37,233 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 120 states. [2018-03-29 21:04:37,239 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 120 to 72. [2018-03-29 21:04:37,240 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 72 states. [2018-03-29 21:04:37,241 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 72 states to 72 states and 77 transitions. [2018-03-29 21:04:37,241 INFO L78 Accepts]: Start accepts. Automaton has 72 states and 77 transitions. Word has length 22 [2018-03-29 21:04:37,241 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-03-29 21:04:37,241 INFO L459 AbstractCegarLoop]: Abstraction has 72 states and 77 transitions. [2018-03-29 21:04:37,241 INFO L460 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-03-29 21:04:37,242 INFO L276 IsEmpty]: Start isEmpty. Operand 72 states and 77 transitions. [2018-03-29 21:04:37,242 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2018-03-29 21:04:37,242 INFO L347 BasicCegarLoop]: Found error trace [2018-03-29 21:04:37,243 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-03-29 21:04:37,243 INFO L408 AbstractCegarLoop]: === Iteration 6 === [mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr21AssertViolationMEMORY_FREE, mainErr18RequiresViolation, mainErr0RequiresViolation, mainErr3RequiresViolation, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr2RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr24EnsuresViolationMEMORY_LEAK, mainErr19RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr23AssertViolationMEMORY_FREE, mainErr9RequiresViolation, mainErr22AssertViolationMEMORY_FREE, mainErr7RequiresViolation, mainErr11RequiresViolation, mainErr20AssertViolationMEMORY_FREE, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr4RequiresViolation, mainErr14RequiresViolation]=== [2018-03-29 21:04:37,243 INFO L82 PathProgramCache]: Analyzing trace with hash -505998677, now seen corresponding path program 1 times No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 7 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 7 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-03-29 21:04:37,255 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-03-29 21:04:37,271 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-03-29 21:04:37,273 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-03-29 21:04:37,283 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-03-29 21:04:37,283 INFO L314 TraceCheckSpWp]: Computing backward predicates... [2018-03-29 21:04:37,288 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-03-29 21:04:37,309 INFO L320 seRefinementStrategy]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2018-03-29 21:04:37,309 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [3, 3] imperfect sequences [] total 3 [2018-03-29 21:04:37,309 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-03-29 21:04:37,309 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-03-29 21:04:37,309 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-03-29 21:04:37,310 INFO L87 Difference]: Start difference. First operand 72 states and 77 transitions. Second operand 4 states. [2018-03-29 21:04:37,362 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-03-29 21:04:37,362 INFO L93 Difference]: Finished difference Result 88 states and 92 transitions. [2018-03-29 21:04:37,363 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-03-29 21:04:37,363 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 22 [2018-03-29 21:04:37,363 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-03-29 21:04:37,363 INFO L225 Difference]: With dead ends: 88 [2018-03-29 21:04:37,363 INFO L226 Difference]: Without dead ends: 85 [2018-03-29 21:04:37,364 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 44 GetRequests, 41 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-03-29 21:04:37,364 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 85 states. [2018-03-29 21:04:37,368 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 85 to 78. [2018-03-29 21:04:37,369 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 78 states. [2018-03-29 21:04:37,369 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 78 states to 78 states and 86 transitions. [2018-03-29 21:04:37,369 INFO L78 Accepts]: Start accepts. Automaton has 78 states and 86 transitions. Word has length 22 [2018-03-29 21:04:37,370 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-03-29 21:04:37,370 INFO L459 AbstractCegarLoop]: Abstraction has 78 states and 86 transitions. [2018-03-29 21:04:37,370 INFO L460 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-03-29 21:04:37,370 INFO L276 IsEmpty]: Start isEmpty. Operand 78 states and 86 transitions. [2018-03-29 21:04:37,370 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2018-03-29 21:04:37,370 INFO L347 BasicCegarLoop]: Found error trace [2018-03-29 21:04:37,370 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-03-29 21:04:37,371 INFO L408 AbstractCegarLoop]: === Iteration 7 === [mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr21AssertViolationMEMORY_FREE, mainErr18RequiresViolation, mainErr0RequiresViolation, mainErr3RequiresViolation, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr2RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr24EnsuresViolationMEMORY_LEAK, mainErr19RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr23AssertViolationMEMORY_FREE, mainErr9RequiresViolation, mainErr22AssertViolationMEMORY_FREE, mainErr7RequiresViolation, mainErr11RequiresViolation, mainErr20AssertViolationMEMORY_FREE, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr4RequiresViolation, mainErr14RequiresViolation]=== [2018-03-29 21:04:37,371 INFO L82 PathProgramCache]: Analyzing trace with hash -505998676, now seen corresponding path program 1 times No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 8 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 8 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-03-29 21:04:37,376 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-03-29 21:04:37,391 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-03-29 21:04:37,393 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-03-29 21:04:37,403 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select 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-03-29 21:04:37,403 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-03-29 21:04:37,406 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-03-29 21:04:37,407 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2018-03-29 21:04:37,434 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-03-29 21:04:37,435 INFO L314 TraceCheckSpWp]: Computing backward predicates... [2018-03-29 21:04:37,474 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-03-29 21:04:37,495 INFO L320 seRefinementStrategy]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2018-03-29 21:04:37,495 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [4, 5] imperfect sequences [] total 8 [2018-03-29 21:04:37,496 INFO L442 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-03-29 21:04:37,496 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-03-29 21:04:37,496 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=52, Unknown=0, NotChecked=0, Total=72 [2018-03-29 21:04:37,496 INFO L87 Difference]: Start difference. First operand 78 states and 86 transitions. Second operand 9 states. [2018-03-29 21:04:37,790 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-03-29 21:04:37,790 INFO L93 Difference]: Finished difference Result 248 states and 270 transitions. [2018-03-29 21:04:37,790 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2018-03-29 21:04:37,790 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2018-03-29 21:04:37,790 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-03-29 21:04:37,791 INFO L225 Difference]: With dead ends: 248 [2018-03-29 21:04:37,792 INFO L226 Difference]: Without dead ends: 243 [2018-03-29 21:04:37,792 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 52 GetRequests, 35 SyntacticMatches, 1 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 42 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=100, Invalid=206, Unknown=0, NotChecked=0, Total=306 [2018-03-29 21:04:37,792 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 243 states. [2018-03-29 21:04:37,800 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 243 to 107. [2018-03-29 21:04:37,800 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 107 states. [2018-03-29 21:04:37,801 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 107 states to 107 states and 120 transitions. [2018-03-29 21:04:37,801 INFO L78 Accepts]: Start accepts. Automaton has 107 states and 120 transitions. Word has length 22 [2018-03-29 21:04:37,801 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-03-29 21:04:37,801 INFO L459 AbstractCegarLoop]: Abstraction has 107 states and 120 transitions. [2018-03-29 21:04:37,801 INFO L460 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-03-29 21:04:37,802 INFO L276 IsEmpty]: Start isEmpty. Operand 107 states and 120 transitions. [2018-03-29 21:04:37,802 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2018-03-29 21:04:37,802 INFO L347 BasicCegarLoop]: Found error trace [2018-03-29 21:04:37,802 INFO L355 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-03-29 21:04:37,802 INFO L408 AbstractCegarLoop]: === Iteration 8 === [mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr21AssertViolationMEMORY_FREE, mainErr18RequiresViolation, mainErr0RequiresViolation, mainErr3RequiresViolation, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr2RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr24EnsuresViolationMEMORY_LEAK, mainErr19RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr23AssertViolationMEMORY_FREE, mainErr9RequiresViolation, mainErr22AssertViolationMEMORY_FREE, mainErr7RequiresViolation, mainErr11RequiresViolation, mainErr20AssertViolationMEMORY_FREE, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr4RequiresViolation, mainErr14RequiresViolation]=== [2018-03-29 21:04:37,802 INFO L82 PathProgramCache]: Analyzing trace with hash 469306275, now seen corresponding path program 1 times No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 9 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 9 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-03-29 21:04:37,809 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-03-29 21:04:37,824 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-03-29 21:04:37,827 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-03-29 21:04:37,831 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select 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-03-29 21:04:37,831 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-03-29 21:04:37,835 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-03-29 21:04:37,835 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2018-03-29 21:04:37,868 INFO L700 Elim1Store]: detected not equals via solver [2018-03-29 21:04:37,869 INFO L700 Elim1Store]: detected not equals via solver [2018-03-29 21:04:37,871 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-03-29 21:04:37,871 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-03-29 21:04:37,878 INFO L700 Elim1Store]: detected not equals via solver [2018-03-29 21:04:37,879 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 21 [2018-03-29 21:04:37,879 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-03-29 21:04:37,885 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-03-29 21:04:37,886 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:28, output treesize:17 [2018-03-29 21:04:37,903 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-03-29 21:04:37,903 INFO L314 TraceCheckSpWp]: Computing backward predicates... [2018-03-29 21:04:37,964 WARN L307 Elim1Store]: Array PQE input equivalent to true [2018-03-29 21:04:37,964 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-03-29 21:04:37,974 INFO L682 Elim1Store]: detected equality via solver [2018-03-29 21:04:37,975 INFO L682 Elim1Store]: detected equality via solver [2018-03-29 21:04:37,975 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 3 [2018-03-29 21:04:37,976 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-03-29 21:04:37,983 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-03-29 21:04:37,983 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:50, output treesize:18 [2018-03-29 21:04:38,020 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-03-29 21:04:38,052 INFO L320 seRefinementStrategy]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2018-03-29 21:04:38,053 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [5, 5] imperfect sequences [] total 9 [2018-03-29 21:04:38,053 INFO L442 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-03-29 21:04:38,053 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-03-29 21:04:38,053 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=63, Unknown=0, NotChecked=0, Total=90 [2018-03-29 21:04:38,053 INFO L87 Difference]: Start difference. First operand 107 states and 120 transitions. Second operand 10 states. [2018-03-29 21:04:38,297 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-03-29 21:04:38,297 INFO L93 Difference]: Finished difference Result 153 states and 166 transitions. [2018-03-29 21:04:38,297 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-03-29 21:04:38,298 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 27 [2018-03-29 21:04:38,298 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-03-29 21:04:38,298 INFO L225 Difference]: With dead ends: 153 [2018-03-29 21:04:38,299 INFO L226 Difference]: Without dead ends: 151 [2018-03-29 21:04:38,299 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 62 GetRequests, 48 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 31 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=76, Invalid=164, Unknown=0, NotChecked=0, Total=240 [2018-03-29 21:04:38,299 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 151 states. [2018-03-29 21:04:38,306 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 151 to 105. [2018-03-29 21:04:38,306 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 105 states. [2018-03-29 21:04:38,307 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 105 states to 105 states and 118 transitions. [2018-03-29 21:04:38,307 INFO L78 Accepts]: Start accepts. Automaton has 105 states and 118 transitions. Word has length 27 [2018-03-29 21:04:38,308 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-03-29 21:04:38,308 INFO L459 AbstractCegarLoop]: Abstraction has 105 states and 118 transitions. [2018-03-29 21:04:38,308 INFO L460 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-03-29 21:04:38,308 INFO L276 IsEmpty]: Start isEmpty. Operand 105 states and 118 transitions. [2018-03-29 21:04:38,309 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2018-03-29 21:04:38,309 INFO L347 BasicCegarLoop]: Found error trace [2018-03-29 21:04:38,309 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-03-29 21:04:38,309 INFO L408 AbstractCegarLoop]: === Iteration 9 === [mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr21AssertViolationMEMORY_FREE, mainErr18RequiresViolation, mainErr0RequiresViolation, mainErr3RequiresViolation, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr2RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr24EnsuresViolationMEMORY_LEAK, mainErr19RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr23AssertViolationMEMORY_FREE, mainErr9RequiresViolation, mainErr22AssertViolationMEMORY_FREE, mainErr7RequiresViolation, mainErr11RequiresViolation, mainErr20AssertViolationMEMORY_FREE, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr4RequiresViolation, mainErr14RequiresViolation]=== [2018-03-29 21:04:38,309 INFO L82 PathProgramCache]: Analyzing trace with hash -1445383902, now seen corresponding path program 1 times No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 10 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 10 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-03-29 21:04:38,315 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-03-29 21:04:38,336 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-03-29 21:04:38,339 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-03-29 21:04:38,357 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 10 [2018-03-29 21:04:38,359 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 9 [2018-03-29 21:04:38,359 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-03-29 21:04:38,361 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-03-29 21:04:38,372 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 15 treesize of output 12 [2018-03-29 21:04:38,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 12 treesize of output 11 [2018-03-29 21:04:38,374 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-03-29 21:04:38,376 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-03-29 21:04:38,381 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-03-29 21:04:38,382 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 2 variables, input treesize:32, output treesize:24 [2018-03-29 21:04:38,444 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 15 [2018-03-29 21:04:38,446 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 3 [2018-03-29 21:04:38,446 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-03-29 21:04:38,447 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-03-29 21:04:38,453 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 21 treesize of output 17 [2018-03-29 21:04:38,455 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 17 treesize of output 5 [2018-03-29 21:04:38,455 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-03-29 21:04:38,456 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-03-29 21:04:38,459 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-03-29 21:04:38,460 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 2 variables, input treesize:42, output treesize:12 [2018-03-29 21:04:38,469 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-03-29 21:04:38,469 INFO L314 TraceCheckSpWp]: Computing backward predicates... [2018-03-29 21:04:38,533 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-03-29 21:04:38,565 INFO L320 seRefinementStrategy]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2018-03-29 21:04:38,565 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [8, 7] imperfect sequences [] total 13 [2018-03-29 21:04:38,565 INFO L442 AbstractCegarLoop]: Interpolant automaton has 13 states [2018-03-29 21:04:38,566 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2018-03-29 21:04:38,566 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=37, Invalid=119, Unknown=0, NotChecked=0, Total=156 [2018-03-29 21:04:38,566 INFO L87 Difference]: Start difference. First operand 105 states and 118 transitions. Second operand 13 states. [2018-03-29 21:04:38,955 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-03-29 21:04:38,955 INFO L93 Difference]: Finished difference Result 167 states and 182 transitions. [2018-03-29 21:04:38,955 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2018-03-29 21:04:38,956 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 29 [2018-03-29 21:04:38,956 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-03-29 21:04:38,956 INFO L225 Difference]: With dead ends: 167 [2018-03-29 21:04:38,956 INFO L226 Difference]: Without dead ends: 129 [2018-03-29 21:04:38,957 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 70 GetRequests, 44 SyntacticMatches, 2 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 121 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=157, Invalid=493, Unknown=0, NotChecked=0, Total=650 [2018-03-29 21:04:38,957 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 129 states. [2018-03-29 21:04:38,962 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 129 to 102. [2018-03-29 21:04:38,962 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 102 states. [2018-03-29 21:04:38,963 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 102 states to 102 states and 113 transitions. [2018-03-29 21:04:38,963 INFO L78 Accepts]: Start accepts. Automaton has 102 states and 113 transitions. Word has length 29 [2018-03-29 21:04:38,963 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-03-29 21:04:38,963 INFO L459 AbstractCegarLoop]: Abstraction has 102 states and 113 transitions. [2018-03-29 21:04:38,963 INFO L460 AbstractCegarLoop]: Interpolant automaton has 13 states. [2018-03-29 21:04:38,963 INFO L276 IsEmpty]: Start isEmpty. Operand 102 states and 113 transitions. [2018-03-29 21:04:38,964 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2018-03-29 21:04:38,964 INFO L347 BasicCegarLoop]: Found error trace [2018-03-29 21:04:38,964 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] [2018-03-29 21:04:38,964 INFO L408 AbstractCegarLoop]: === Iteration 10 === [mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr21AssertViolationMEMORY_FREE, mainErr18RequiresViolation, mainErr0RequiresViolation, mainErr3RequiresViolation, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr2RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr24EnsuresViolationMEMORY_LEAK, mainErr19RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr23AssertViolationMEMORY_FREE, mainErr9RequiresViolation, mainErr22AssertViolationMEMORY_FREE, mainErr7RequiresViolation, mainErr11RequiresViolation, mainErr20AssertViolationMEMORY_FREE, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr4RequiresViolation, mainErr14RequiresViolation]=== [2018-03-29 21:04:38,965 INFO L82 PathProgramCache]: Analyzing trace with hash 1061088070, now seen corresponding path program 1 times No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 11 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 11 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-03-29 21:04:38,975 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-03-29 21:04:38,994 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-03-29 21:04:38,997 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-03-29 21:04:39,030 WARN L1033 $PredicateComparison]: unable to prove that (exists ((main_~y~0.base Int)) (and (= |c_#valid| (store |c_old(#valid)| main_~y~0.base 0)) (= (select |c_old(#valid)| main_~y~0.base) 0))) is different from true [2018-03-29 21:04:39,037 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 2 not checked. [2018-03-29 21:04:39,037 INFO L314 TraceCheckSpWp]: Computing backward predicates... [2018-03-29 21:04:39,060 WARN L1011 $PredicateComparison]: unable to prove that (forall ((|v_main_#t~malloc0.base_7| Int)) (or (= |c_old(#valid)| (store |c_#valid| |v_main_#t~malloc0.base_7| 0)) (not (= 0 (select |c_#valid| |v_main_#t~malloc0.base_7|))))) is different from false [2018-03-29 21:04:39,068 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-03-29 21:04:39,089 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-03-29 21:04:39,089 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 10 [2018-03-29 21:04:39,089 INFO L442 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-03-29 21:04:39,090 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-03-29 21:04:39,090 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=56, Unknown=2, NotChecked=30, Total=110 [2018-03-29 21:04:39,090 INFO L87 Difference]: Start difference. First operand 102 states and 113 transitions. Second operand 11 states. [2018-03-29 21:04:39,098 WARN L1011 $PredicateComparison]: unable to prove that (and (forall ((|v_main_#t~malloc0.base_7| Int)) (or (= |c_old(#valid)| (store |c_#valid| |v_main_#t~malloc0.base_7| 0)) (not (= 0 (select |c_#valid| |v_main_#t~malloc0.base_7|))))) (= |c_#valid| |c_old(#valid)|)) is different from false [2018-03-29 21:04:39,243 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-03-29 21:04:39,243 INFO L93 Difference]: Finished difference Result 131 states and 143 transitions. [2018-03-29 21:04:39,243 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-03-29 21:04:39,243 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 34 [2018-03-29 21:04:39,243 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-03-29 21:04:39,244 INFO L225 Difference]: With dead ends: 131 [2018-03-29 21:04:39,244 INFO L226 Difference]: Without dead ends: 128 [2018-03-29 21:04:39,245 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 73 GetRequests, 58 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 3 IntricatePredicates, 1 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=57, Invalid=134, Unknown=3, NotChecked=78, Total=272 [2018-03-29 21:04:39,245 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 128 states. [2018-03-29 21:04:39,250 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 128 to 106. [2018-03-29 21:04:39,251 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 106 states. [2018-03-29 21:04:39,251 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 106 states to 106 states and 117 transitions. [2018-03-29 21:04:39,251 INFO L78 Accepts]: Start accepts. Automaton has 106 states and 117 transitions. Word has length 34 [2018-03-29 21:04:39,252 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-03-29 21:04:39,252 INFO L459 AbstractCegarLoop]: Abstraction has 106 states and 117 transitions. [2018-03-29 21:04:39,252 INFO L460 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-03-29 21:04:39,252 INFO L276 IsEmpty]: Start isEmpty. Operand 106 states and 117 transitions. [2018-03-29 21:04:39,253 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2018-03-29 21:04:39,253 INFO L347 BasicCegarLoop]: Found error trace [2018-03-29 21:04:39,253 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] [2018-03-29 21:04:39,253 INFO L408 AbstractCegarLoop]: === Iteration 11 === [mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr21AssertViolationMEMORY_FREE, mainErr18RequiresViolation, mainErr0RequiresViolation, mainErr3RequiresViolation, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr2RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr24EnsuresViolationMEMORY_LEAK, mainErr19RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr23AssertViolationMEMORY_FREE, mainErr9RequiresViolation, mainErr22AssertViolationMEMORY_FREE, mainErr7RequiresViolation, mainErr11RequiresViolation, mainErr20AssertViolationMEMORY_FREE, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr4RequiresViolation, mainErr14RequiresViolation]=== [2018-03-29 21:04:39,253 INFO L82 PathProgramCache]: Analyzing trace with hash 1061088904, now seen corresponding path program 1 times No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 12 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 12 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-03-29 21:04:39,261 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-03-29 21:04:39,276 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-03-29 21:04:39,279 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-03-29 21:04:39,313 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 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-03-29 21:04:39,314 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select 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-03-29 21:04:39,314 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-03-29 21:04:39,316 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-03-29 21:04:39,321 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 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-03-29 21:04:39,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-03-29 21:04:39,328 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-03-29 21:04:39,330 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-03-29 21:04:39,334 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-03-29 21:04:39,334 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 2 variables, input treesize:29, output treesize:18 [2018-03-29 21:04:39,344 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-03-29 21:04:39,347 INFO L700 Elim1Store]: detected not equals via solver [2018-03-29 21:04:39,347 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-03-29 21:04:39,348 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-03-29 21:04:39,352 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-03-29 21:04:39,363 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-03-29 21:04:39,366 INFO L700 Elim1Store]: detected not equals via solver [2018-03-29 21:04:39,367 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-03-29 21:04:39,368 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-03-29 21:04:39,372 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-03-29 21:04:39,379 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-03-29 21:04:39,379 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 2 variables, input treesize:49, output treesize:36 [2018-03-29 21:04:39,400 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 30 treesize of output 23 [2018-03-29 21:04:39,403 INFO L700 Elim1Store]: detected not equals via solver [2018-03-29 21:04:39,403 INFO L700 Elim1Store]: detected not equals via solver [2018-03-29 21:04:39,404 INFO L700 Elim1Store]: detected not equals via solver [2018-03-29 21:04:39,406 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 46 [2018-03-29 21:04:39,406 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-03-29 21:04:39,413 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-03-29 21:04:39,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, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 25 [2018-03-29 21:04:39,428 INFO L700 Elim1Store]: detected not equals via solver [2018-03-29 21:04:39,428 INFO L700 Elim1Store]: detected not equals via solver [2018-03-29 21:04:39,429 INFO L700 Elim1Store]: detected not equals via solver [2018-03-29 21:04:39,430 INFO L700 Elim1Store]: detected not equals via solver [2018-03-29 21:04:39,430 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 4 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 58 [2018-03-29 21:04:39,431 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-03-29 21:04:39,439 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-03-29 21:04:39,448 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-03-29 21:04:39,449 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 2 variables, input treesize:64, output treesize:56 [2018-03-29 21:04:39,538 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 29 treesize of output 21 [2018-03-29 21:04:39,556 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 3 [2018-03-29 21:04:39,556 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-03-29 21:04:39,570 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-03-29 21:04:39,602 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 29 treesize of output 21 [2018-03-29 21:04:39,605 INFO L700 Elim1Store]: detected not equals via solver [2018-03-29 21:04:39,606 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 8 [2018-03-29 21:04:39,606 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-03-29 21:04:39,609 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-03-29 21:04:39,611 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-03-29 21:04:39,611 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 3 variables, input treesize:57, output treesize:7 [2018-03-29 21:04:39,631 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 2 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-03-29 21:04:39,631 INFO L314 TraceCheckSpWp]: Computing backward predicates... [2018-03-29 21:04:39,725 WARN L307 Elim1Store]: Array PQE input equivalent to true [2018-03-29 21:04:39,725 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-03-29 21:04:39,726 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-03-29 21:04:39,726 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:51, output treesize:1 [2018-03-29 21:04:39,729 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 2 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-03-29 21:04:39,750 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-03-29 21:04:39,751 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 7] total 13 [2018-03-29 21:04:39,751 INFO L442 AbstractCegarLoop]: Interpolant automaton has 13 states [2018-03-29 21:04:39,751 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2018-03-29 21:04:39,751 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=37, Invalid=119, Unknown=0, NotChecked=0, Total=156 [2018-03-29 21:04:39,751 INFO L87 Difference]: Start difference. First operand 106 states and 117 transitions. Second operand 13 states. [2018-03-29 21:04:40,037 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-03-29 21:04:40,037 INFO L93 Difference]: Finished difference Result 137 states and 150 transitions. [2018-03-29 21:04:40,037 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2018-03-29 21:04:40,037 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 34 [2018-03-29 21:04:40,038 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-03-29 21:04:40,038 INFO L225 Difference]: With dead ends: 137 [2018-03-29 21:04:40,038 INFO L226 Difference]: Without dead ends: 91 [2018-03-29 21:04:40,039 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 77 GetRequests, 55 SyntacticMatches, 1 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 74 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=139, Invalid=367, Unknown=0, NotChecked=0, Total=506 [2018-03-29 21:04:40,039 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 91 states. [2018-03-29 21:04:40,044 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 91 to 91. [2018-03-29 21:04:40,044 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 91 states. [2018-03-29 21:04:40,045 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 91 states to 91 states and 101 transitions. [2018-03-29 21:04:40,045 INFO L78 Accepts]: Start accepts. Automaton has 91 states and 101 transitions. Word has length 34 [2018-03-29 21:04:40,045 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-03-29 21:04:40,045 INFO L459 AbstractCegarLoop]: Abstraction has 91 states and 101 transitions. [2018-03-29 21:04:40,045 INFO L460 AbstractCegarLoop]: Interpolant automaton has 13 states. [2018-03-29 21:04:40,045 INFO L276 IsEmpty]: Start isEmpty. Operand 91 states and 101 transitions. [2018-03-29 21:04:40,046 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2018-03-29 21:04:40,046 INFO L347 BasicCegarLoop]: Found error trace [2018-03-29 21:04:40,046 INFO L355 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-03-29 21:04:40,046 INFO L408 AbstractCegarLoop]: === Iteration 12 === [mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr21AssertViolationMEMORY_FREE, mainErr18RequiresViolation, mainErr0RequiresViolation, mainErr3RequiresViolation, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr2RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr24EnsuresViolationMEMORY_LEAK, mainErr19RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr23AssertViolationMEMORY_FREE, mainErr9RequiresViolation, mainErr22AssertViolationMEMORY_FREE, mainErr7RequiresViolation, mainErr11RequiresViolation, mainErr20AssertViolationMEMORY_FREE, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr4RequiresViolation, mainErr14RequiresViolation]=== [2018-03-29 21:04:40,046 INFO L82 PathProgramCache]: Analyzing trace with hash -651749331, now seen corresponding path program 1 times No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 13 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 13 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-03-29 21:04:40,055 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-03-29 21:04:40,071 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-03-29 21:04:40,073 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-03-29 21:04:40,083 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-03-29 21:04:40,083 INFO L314 TraceCheckSpWp]: Computing backward predicates... [2018-03-29 21:04:40,091 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-03-29 21:04:40,112 INFO L320 seRefinementStrategy]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2018-03-29 21:04:40,112 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [5, 5] imperfect sequences [] total 5 [2018-03-29 21:04:40,112 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-03-29 21:04:40,112 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-03-29 21:04:40,112 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-03-29 21:04:40,112 INFO L87 Difference]: Start difference. First operand 91 states and 101 transitions. Second operand 5 states. [2018-03-29 21:04:40,169 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-03-29 21:04:40,169 INFO L93 Difference]: Finished difference Result 127 states and 138 transitions. [2018-03-29 21:04:40,169 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-03-29 21:04:40,170 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 35 [2018-03-29 21:04:40,170 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-03-29 21:04:40,170 INFO L225 Difference]: With dead ends: 127 [2018-03-29 21:04:40,170 INFO L226 Difference]: Without dead ends: 124 [2018-03-29 21:04:40,171 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 72 GetRequests, 67 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-03-29 21:04:40,171 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 124 states. [2018-03-29 21:04:40,175 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 124 to 91. [2018-03-29 21:04:40,175 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 91 states. [2018-03-29 21:04:40,175 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 91 states to 91 states and 99 transitions. [2018-03-29 21:04:40,176 INFO L78 Accepts]: Start accepts. Automaton has 91 states and 99 transitions. Word has length 35 [2018-03-29 21:04:40,176 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-03-29 21:04:40,176 INFO L459 AbstractCegarLoop]: Abstraction has 91 states and 99 transitions. [2018-03-29 21:04:40,176 INFO L460 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-03-29 21:04:40,176 INFO L276 IsEmpty]: Start isEmpty. Operand 91 states and 99 transitions. [2018-03-29 21:04:40,176 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2018-03-29 21:04:40,177 INFO L347 BasicCegarLoop]: Found error trace [2018-03-29 21:04:40,177 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] [2018-03-29 21:04:40,177 INFO L408 AbstractCegarLoop]: === Iteration 13 === [mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr21AssertViolationMEMORY_FREE, mainErr18RequiresViolation, mainErr0RequiresViolation, mainErr3RequiresViolation, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr2RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr24EnsuresViolationMEMORY_LEAK, mainErr19RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr23AssertViolationMEMORY_FREE, mainErr9RequiresViolation, mainErr22AssertViolationMEMORY_FREE, mainErr7RequiresViolation, mainErr11RequiresViolation, mainErr20AssertViolationMEMORY_FREE, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr4RequiresViolation, mainErr14RequiresViolation]=== [2018-03-29 21:04:40,177 INFO L82 PathProgramCache]: Analyzing trace with hash -564018963, now seen corresponding path program 1 times No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 14 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 14 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-03-29 21:04:40,187 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-03-29 21:04:40,208 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-03-29 21:04:40,211 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-03-29 21:04:40,229 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select 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-03-29 21:04:40,230 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-03-29 21:04:40,241 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-03-29 21:04:40,242 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2018-03-29 21:04:40,286 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 11 [2018-03-29 21:04:40,287 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-03-29 21:04:40,291 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-03-29 21:04:40,292 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:18, output treesize:17 [2018-03-29 21:04:40,307 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 5 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-03-29 21:04:40,307 INFO L314 TraceCheckSpWp]: Computing backward predicates... [2018-03-29 21:04:40,675 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 5 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-03-29 21:04:40,696 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-03-29 21:04:40,696 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 11 [2018-03-29 21:04:40,697 INFO L442 AbstractCegarLoop]: Interpolant automaton has 12 states [2018-03-29 21:04:40,697 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2018-03-29 21:04:40,697 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=99, Unknown=1, NotChecked=0, Total=132 [2018-03-29 21:04:40,697 INFO L87 Difference]: Start difference. First operand 91 states and 99 transitions. Second operand 12 states. [2018-03-29 21:04:40,884 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-03-29 21:04:40,884 INFO L93 Difference]: Finished difference Result 147 states and 157 transitions. [2018-03-29 21:04:40,884 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-03-29 21:04:40,884 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 35 [2018-03-29 21:04:40,884 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-03-29 21:04:40,885 INFO L225 Difference]: With dead ends: 147 [2018-03-29 21:04:40,885 INFO L226 Difference]: Without dead ends: 144 [2018-03-29 21:04:40,886 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 75 GetRequests, 59 SyntacticMatches, 1 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 31 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=85, Invalid=186, Unknown=1, NotChecked=0, Total=272 [2018-03-29 21:04:40,886 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 144 states. [2018-03-29 21:04:40,891 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 144 to 93. [2018-03-29 21:04:40,891 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 93 states. [2018-03-29 21:04:40,892 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 93 states to 93 states and 100 transitions. [2018-03-29 21:04:40,892 INFO L78 Accepts]: Start accepts. Automaton has 93 states and 100 transitions. Word has length 35 [2018-03-29 21:04:40,892 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-03-29 21:04:40,892 INFO L459 AbstractCegarLoop]: Abstraction has 93 states and 100 transitions. [2018-03-29 21:04:40,892 INFO L460 AbstractCegarLoop]: Interpolant automaton has 12 states. [2018-03-29 21:04:40,892 INFO L276 IsEmpty]: Start isEmpty. Operand 93 states and 100 transitions. [2018-03-29 21:04:40,893 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2018-03-29 21:04:40,893 INFO L347 BasicCegarLoop]: Found error trace [2018-03-29 21:04:40,893 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-03-29 21:04:40,894 INFO L408 AbstractCegarLoop]: === Iteration 14 === [mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr21AssertViolationMEMORY_FREE, mainErr18RequiresViolation, mainErr0RequiresViolation, mainErr3RequiresViolation, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr2RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr24EnsuresViolationMEMORY_LEAK, mainErr19RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr23AssertViolationMEMORY_FREE, mainErr9RequiresViolation, mainErr22AssertViolationMEMORY_FREE, mainErr7RequiresViolation, mainErr11RequiresViolation, mainErr20AssertViolationMEMORY_FREE, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr4RequiresViolation, mainErr14RequiresViolation]=== [2018-03-29 21:04:40,894 INFO L82 PathProgramCache]: Analyzing trace with hash 842485185, now seen corresponding path program 1 times No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 15 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 15 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-03-29 21:04:40,906 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-03-29 21:04:40,922 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-03-29 21:04:40,923 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-03-29 21:04:40,943 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-03-29 21:04:40,943 INFO L314 TraceCheckSpWp]: Computing backward predicates... [2018-03-29 21:04:40,963 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 16 [2018-03-29 21:04:40,963 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-03-29 21:04:40,969 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-03-29 21:04:40,970 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:41, output treesize:10 [2018-03-29 21:04:40,979 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-03-29 21:04:40,999 INFO L320 seRefinementStrategy]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2018-03-29 21:04:41,000 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [5, 4] imperfect sequences [] total 8 [2018-03-29 21:04:41,000 INFO L442 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-03-29 21:04:41,000 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-03-29 21:04:41,000 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2018-03-29 21:04:41,001 INFO L87 Difference]: Start difference. First operand 93 states and 100 transitions. Second operand 9 states. [2018-03-29 21:04:41,143 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-03-29 21:04:41,144 INFO L93 Difference]: Finished difference Result 130 states and 138 transitions. [2018-03-29 21:04:41,144 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2018-03-29 21:04:41,144 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 36 [2018-03-29 21:04:41,144 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-03-29 21:04:41,145 INFO L225 Difference]: With dead ends: 130 [2018-03-29 21:04:41,145 INFO L226 Difference]: Without dead ends: 126 [2018-03-29 21:04:41,145 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 82 GetRequests, 65 SyntacticMatches, 1 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 29 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=99, Invalid=207, Unknown=0, NotChecked=0, Total=306 [2018-03-29 21:04:41,146 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 126 states. [2018-03-29 21:04:41,152 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 126 to 95. [2018-03-29 21:04:41,152 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 95 states. [2018-03-29 21:04:41,153 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 95 states to 95 states and 103 transitions. [2018-03-29 21:04:41,153 INFO L78 Accepts]: Start accepts. Automaton has 95 states and 103 transitions. Word has length 36 [2018-03-29 21:04:41,153 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-03-29 21:04:41,153 INFO L459 AbstractCegarLoop]: Abstraction has 95 states and 103 transitions. [2018-03-29 21:04:41,153 INFO L460 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-03-29 21:04:41,153 INFO L276 IsEmpty]: Start isEmpty. Operand 95 states and 103 transitions. [2018-03-29 21:04:41,154 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2018-03-29 21:04:41,154 INFO L347 BasicCegarLoop]: Found error trace [2018-03-29 21:04:41,154 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] [2018-03-29 21:04:41,155 INFO L408 AbstractCegarLoop]: === Iteration 15 === [mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr21AssertViolationMEMORY_FREE, mainErr18RequiresViolation, mainErr0RequiresViolation, mainErr3RequiresViolation, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr2RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr24EnsuresViolationMEMORY_LEAK, mainErr19RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr23AssertViolationMEMORY_FREE, mainErr9RequiresViolation, mainErr22AssertViolationMEMORY_FREE, mainErr7RequiresViolation, mainErr11RequiresViolation, mainErr20AssertViolationMEMORY_FREE, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr4RequiresViolation, mainErr14RequiresViolation]=== [2018-03-29 21:04:41,155 INFO L82 PathProgramCache]: Analyzing trace with hash -1740028819, now seen corresponding path program 1 times No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 16 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 16 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-03-29 21:04:41,162 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-03-29 21:04:41,181 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-03-29 21:04:41,183 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-03-29 21:04:41,198 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 10 [2018-03-29 21:04:41,200 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 9 [2018-03-29 21:04:41,200 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-03-29 21:04:41,201 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-03-29 21:04:41,203 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-03-29 21:04:41,204 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:17, output treesize:13 [2018-03-29 21:04:41,243 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11 [2018-03-29 21:04:41,246 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-03-29 21:04:41,246 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-03-29 21:04:41,247 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-03-29 21:04:41,248 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-03-29 21:04:41,248 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:15, output treesize:3 [2018-03-29 21:04:41,263 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-03-29 21:04:41,263 INFO L314 TraceCheckSpWp]: Computing backward predicates... [2018-03-29 21:04:41,307 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-03-29 21:04:41,328 INFO L320 seRefinementStrategy]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2018-03-29 21:04:41,328 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [8, 7] imperfect sequences [] total 13 [2018-03-29 21:04:41,329 INFO L442 AbstractCegarLoop]: Interpolant automaton has 14 states [2018-03-29 21:04:41,329 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2018-03-29 21:04:41,329 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=39, Invalid=143, Unknown=0, NotChecked=0, Total=182 [2018-03-29 21:04:41,329 INFO L87 Difference]: Start difference. First operand 95 states and 103 transitions. Second operand 14 states. [2018-03-29 21:04:41,572 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-03-29 21:04:41,572 INFO L93 Difference]: Finished difference Result 182 states and 193 transitions. [2018-03-29 21:04:41,573 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-03-29 21:04:41,573 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 43 [2018-03-29 21:04:41,573 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-03-29 21:04:41,574 INFO L225 Difference]: With dead ends: 182 [2018-03-29 21:04:41,574 INFO L226 Difference]: Without dead ends: 181 [2018-03-29 21:04:41,575 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 97 GetRequests, 75 SyntacticMatches, 2 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 56 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=128, Invalid=334, Unknown=0, NotChecked=0, Total=462 [2018-03-29 21:04:41,575 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 181 states. [2018-03-29 21:04:41,581 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 181 to 95. [2018-03-29 21:04:41,581 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 95 states. [2018-03-29 21:04:41,582 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 95 states to 95 states and 102 transitions. [2018-03-29 21:04:41,582 INFO L78 Accepts]: Start accepts. Automaton has 95 states and 102 transitions. Word has length 43 [2018-03-29 21:04:41,582 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-03-29 21:04:41,582 INFO L459 AbstractCegarLoop]: Abstraction has 95 states and 102 transitions. [2018-03-29 21:04:41,583 INFO L460 AbstractCegarLoop]: Interpolant automaton has 14 states. [2018-03-29 21:04:41,583 INFO L276 IsEmpty]: Start isEmpty. Operand 95 states and 102 transitions. [2018-03-29 21:04:41,583 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2018-03-29 21:04:41,583 INFO L347 BasicCegarLoop]: Found error trace [2018-03-29 21:04:41,583 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] [2018-03-29 21:04:41,584 INFO L408 AbstractCegarLoop]: === Iteration 16 === [mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr21AssertViolationMEMORY_FREE, mainErr18RequiresViolation, mainErr0RequiresViolation, mainErr3RequiresViolation, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr2RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr24EnsuresViolationMEMORY_LEAK, mainErr19RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr23AssertViolationMEMORY_FREE, mainErr9RequiresViolation, mainErr22AssertViolationMEMORY_FREE, mainErr7RequiresViolation, mainErr11RequiresViolation, mainErr20AssertViolationMEMORY_FREE, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr4RequiresViolation, mainErr14RequiresViolation]=== [2018-03-29 21:04:41,584 INFO L82 PathProgramCache]: Analyzing trace with hash 1893681575, now seen corresponding path program 1 times No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 17 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 17 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-03-29 21:04:41,594 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-03-29 21:04:41,613 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-03-29 21:04:41,615 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-03-29 21:04:41,625 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select 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-03-29 21:04:41,625 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-03-29 21:04:41,628 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-03-29 21:04:41,628 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2018-03-29 21:04:41,635 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 10 [2018-03-29 21:04:41,640 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 9 [2018-03-29 21:04:41,641 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-03-29 21:04:41,642 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-03-29 21:04:41,646 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-03-29 21:04:41,646 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:22, output treesize:15 [2018-03-29 21:04:41,678 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 13 [2018-03-29 21:04:41,680 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 5 [2018-03-29 21:04:41,680 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-03-29 21:04:41,681 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-03-29 21:04:41,682 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-03-29 21:04:41,683 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:17, output treesize:5 [2018-03-29 21:04:41,690 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-03-29 21:04:41,690 INFO L314 TraceCheckSpWp]: Computing backward predicates... [2018-03-29 21:04:41,749 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-03-29 21:04:41,785 INFO L320 seRefinementStrategy]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2018-03-29 21:04:41,785 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [8, 7] imperfect sequences [] total 13 [2018-03-29 21:04:41,786 INFO L442 AbstractCegarLoop]: Interpolant automaton has 14 states [2018-03-29 21:04:41,786 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2018-03-29 21:04:41,786 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=39, Invalid=143, Unknown=0, NotChecked=0, Total=182 [2018-03-29 21:04:41,786 INFO L87 Difference]: Start difference. First operand 95 states and 102 transitions. Second operand 14 states. [2018-03-29 21:04:42,152 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-03-29 21:04:42,152 INFO L93 Difference]: Finished difference Result 149 states and 158 transitions. [2018-03-29 21:04:42,177 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2018-03-29 21:04:42,177 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 44 [2018-03-29 21:04:42,178 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-03-29 21:04:42,178 INFO L225 Difference]: With dead ends: 149 [2018-03-29 21:04:42,178 INFO L226 Difference]: Without dead ends: 148 [2018-03-29 21:04:42,179 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 106 GetRequests, 78 SyntacticMatches, 2 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 119 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=203, Invalid=553, Unknown=0, NotChecked=0, Total=756 [2018-03-29 21:04:42,179 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 148 states. [2018-03-29 21:04:42,185 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 148 to 95. [2018-03-29 21:04:42,185 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 95 states. [2018-03-29 21:04:42,186 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 95 states to 95 states and 101 transitions. [2018-03-29 21:04:42,186 INFO L78 Accepts]: Start accepts. Automaton has 95 states and 101 transitions. Word has length 44 [2018-03-29 21:04:42,187 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-03-29 21:04:42,187 INFO L459 AbstractCegarLoop]: Abstraction has 95 states and 101 transitions. [2018-03-29 21:04:42,187 INFO L460 AbstractCegarLoop]: Interpolant automaton has 14 states. [2018-03-29 21:04:42,187 INFO L276 IsEmpty]: Start isEmpty. Operand 95 states and 101 transitions. [2018-03-29 21:04:42,187 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2018-03-29 21:04:42,188 INFO L347 BasicCegarLoop]: Found error trace [2018-03-29 21:04:42,188 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] [2018-03-29 21:04:42,188 INFO L408 AbstractCegarLoop]: === Iteration 17 === [mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr21AssertViolationMEMORY_FREE, mainErr18RequiresViolation, mainErr0RequiresViolation, mainErr3RequiresViolation, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr2RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr24EnsuresViolationMEMORY_LEAK, mainErr19RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr23AssertViolationMEMORY_FREE, mainErr9RequiresViolation, mainErr22AssertViolationMEMORY_FREE, mainErr7RequiresViolation, mainErr11RequiresViolation, mainErr20AssertViolationMEMORY_FREE, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr4RequiresViolation, mainErr14RequiresViolation]=== [2018-03-29 21:04:42,188 INFO L82 PathProgramCache]: Analyzing trace with hash 1930685962, now seen corresponding path program 1 times No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 18 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 18 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-03-29 21:04:42,196 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-03-29 21:04:42,215 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-03-29 21:04:42,218 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-03-29 21:04:42,246 INFO L700 Elim1Store]: detected not equals via solver [2018-03-29 21:04:42,247 INFO L700 Elim1Store]: detected not equals via solver [2018-03-29 21:04:42,248 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 4 [2018-03-29 21:04:42,254 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-03-29 21:04:42,258 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-03-29 21:04:42,258 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:18, output treesize:12 [2018-03-29 21:04:42,274 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-03-29 21:04:42,276 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-03-29 21:04:42,276 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-03-29 21:04:42,277 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-03-29 21:04:42,281 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-03-29 21:04:42,282 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:26, output treesize:19 [2018-03-29 21:04:42,296 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 38 treesize of output 34 [2018-03-29 21:04:42,298 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select 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-03-29 21:04:42,298 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-03-29 21:04:42,303 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-03-29 21:04:42,308 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-03-29 21:04:42,308 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:41, output treesize:33 [2018-03-29 21:04:42,334 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 43 treesize of output 37 [2018-03-29 21:04:42,337 INFO L700 Elim1Store]: detected not equals via solver [2018-03-29 21:04:42,337 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 34 treesize of output 45 [2018-03-29 21:04:42,338 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-03-29 21:04:42,347 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-03-29 21:04:42,353 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-03-29 21:04:42,354 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:46, output treesize:42 [2018-03-29 21:04:42,395 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 44 treesize of output 30 [2018-03-29 21:04:42,397 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 9 [2018-03-29 21:04:42,398 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-03-29 21:04:42,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 7 treesize of output 1 [2018-03-29 21:04:42,409 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-03-29 21:04:42,412 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-03-29 21:04:42,414 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-03-29 21:04:42,414 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 3 variables, input treesize:44, output treesize:4 [2018-03-29 21:04:42,436 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-03-29 21:04:42,436 INFO L314 TraceCheckSpWp]: Computing backward predicates... [2018-03-29 21:04:42,488 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 2 new quantified variables, introduced 0 case distinctions, treesize of input 34 treesize of output 28 [2018-03-29 21:04:42,505 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 8 [2018-03-29 21:04:42,505 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-03-29 21:04:42,509 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 13 [2018-03-29 21:04:42,510 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 4 [2018-03-29 21:04:42,511 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-03-29 21:04:42,511 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-03-29 21:04:42,512 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-03-29 21:04:42,514 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-03-29 21:04:42,514 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 2 variables, input treesize:39, output treesize:9 [2018-03-29 21:04:42,596 INFO L682 Elim1Store]: detected equality via solver [2018-03-29 21:04:42,596 INFO L682 Elim1Store]: detected equality via solver [2018-03-29 21:04:42,597 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-03-29 21:04:42,597 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-03-29 21:04:42,603 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-03-29 21:04:42,604 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:17, output treesize:4 [2018-03-29 21:04:42,611 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-03-29 21:04:42,645 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-03-29 21:04:42,645 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 13] total 21 [2018-03-29 21:04:42,646 INFO L442 AbstractCegarLoop]: Interpolant automaton has 21 states [2018-03-29 21:04:42,646 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2018-03-29 21:04:42,646 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=69, Invalid=351, Unknown=0, NotChecked=0, Total=420 [2018-03-29 21:04:42,647 INFO L87 Difference]: Start difference. First operand 95 states and 101 transitions. Second operand 21 states. [2018-03-29 21:04:44,134 WARN L148 SmtUtils]: Spent 821ms on a formula simplification that was a NOOP. DAG size: 22 [2018-03-29 21:04:44,310 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-03-29 21:04:44,310 INFO L93 Difference]: Finished difference Result 199 states and 212 transitions. [2018-03-29 21:04:44,310 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2018-03-29 21:04:44,310 INFO L78 Accepts]: Start accepts. Automaton has 21 states. Word has length 47 [2018-03-29 21:04:44,311 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-03-29 21:04:44,311 INFO L225 Difference]: With dead ends: 199 [2018-03-29 21:04:44,312 INFO L226 Difference]: Without dead ends: 196 [2018-03-29 21:04:44,312 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 118 GetRequests, 73 SyntacticMatches, 1 SemanticMatches, 44 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 415 ImplicationChecksByTransitivity, 1.5s TimeCoverageRelationStatistics Valid=409, Invalid=1661, Unknown=0, NotChecked=0, Total=2070 [2018-03-29 21:04:44,313 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 196 states. [2018-03-29 21:04:44,321 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 196 to 147. [2018-03-29 21:04:44,321 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 147 states. [2018-03-29 21:04:44,322 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 147 states to 147 states and 158 transitions. [2018-03-29 21:04:44,322 INFO L78 Accepts]: Start accepts. Automaton has 147 states and 158 transitions. Word has length 47 [2018-03-29 21:04:44,323 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-03-29 21:04:44,323 INFO L459 AbstractCegarLoop]: Abstraction has 147 states and 158 transitions. [2018-03-29 21:04:44,323 INFO L460 AbstractCegarLoop]: Interpolant automaton has 21 states. [2018-03-29 21:04:44,323 INFO L276 IsEmpty]: Start isEmpty. Operand 147 states and 158 transitions. [2018-03-29 21:04:44,323 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2018-03-29 21:04:44,324 INFO L347 BasicCegarLoop]: Found error trace [2018-03-29 21:04:44,324 INFO L355 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-03-29 21:04:44,324 INFO L408 AbstractCegarLoop]: === Iteration 18 === [mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr21AssertViolationMEMORY_FREE, mainErr18RequiresViolation, mainErr0RequiresViolation, mainErr3RequiresViolation, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr2RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr24EnsuresViolationMEMORY_LEAK, mainErr19RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr23AssertViolationMEMORY_FREE, mainErr9RequiresViolation, mainErr22AssertViolationMEMORY_FREE, mainErr7RequiresViolation, mainErr11RequiresViolation, mainErr20AssertViolationMEMORY_FREE, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr4RequiresViolation, mainErr14RequiresViolation]=== [2018-03-29 21:04:44,324 INFO L82 PathProgramCache]: Analyzing trace with hash 1930686796, now seen corresponding path program 1 times No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 19 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 19 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-03-29 21:04:44,330 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-03-29 21:04:44,345 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-03-29 21:04:44,347 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-03-29 21:04:44,355 INFO L700 Elim1Store]: detected not equals via solver [2018-03-29 21:04:44,355 INFO L700 Elim1Store]: detected not equals via solver [2018-03-29 21:04:44,356 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 4 [2018-03-29 21:04:44,356 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-03-29 21:04:44,358 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-03-29 21:04:44,358 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:14, output treesize:8 [2018-03-29 21:04:44,370 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-03-29 21:04:44,372 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 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-03-29 21:04:44,372 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-03-29 21:04:44,373 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-03-29 21:04:44,377 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-03-29 21:04:44,377 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:22, output treesize:15 [2018-03-29 21:04:44,389 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-03-29 21:04:44,391 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select 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-03-29 21:04:44,391 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-03-29 21:04:44,395 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-03-29 21:04:44,400 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-03-29 21:04:44,400 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:42, output treesize:34 [2018-03-29 21:04:44,423 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 44 treesize of output 38 [2018-03-29 21:04:44,425 INFO L700 Elim1Store]: detected not equals via solver [2018-03-29 21:04:44,426 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 35 treesize of output 46 [2018-03-29 21:04:44,426 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-03-29 21:04:44,432 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-03-29 21:04:44,438 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-03-29 21:04:44,439 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:47, output treesize:43 [2018-03-29 21:04:44,493 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 31 [2018-03-29 21:04:44,498 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 10 [2018-03-29 21:04:44,499 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-03-29 21:04:44,503 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-03-29 21:04:44,504 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-03-29 21:04:44,506 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-03-29 21:04:44,508 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-03-29 21:04:44,508 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 2 variables, input treesize:45, output treesize:10 [2018-03-29 21:04:44,532 INFO L700 Elim1Store]: detected not equals via solver [2018-03-29 21:04:44,533 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 21 [2018-03-29 21:04:44,533 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-03-29 21:04:44,539 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-03-29 21:04:44,539 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:16, output treesize:11 [2018-03-29 21:04:44,562 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-03-29 21:04:44,562 INFO L314 TraceCheckSpWp]: Computing backward predicates... [2018-03-29 21:04:44,626 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 25 treesize of output 18 [2018-03-29 21:04:44,626 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-03-29 21:04:44,634 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 21 [2018-03-29 21:04:44,634 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-03-29 21:04:44,638 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-1 vars, End of recursive call: 2 dim-0 vars, and 2 xjuncts. [2018-03-29 21:04:44,638 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:52, output treesize:36 [2018-03-29 21:04:45,273 WARN L148 SmtUtils]: Spent 614ms on a formula simplification that was a NOOP. DAG size: 24 [2018-03-29 21:04:45,277 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 2 new quantified variables, introduced 0 case distinctions, treesize of input 39 treesize of output 32 [2018-03-29 21:04:45,295 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 8 [2018-03-29 21:04:45,295 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-03-29 21:04:45,299 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 13 [2018-03-29 21:04:45,301 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 4 [2018-03-29 21:04:45,301 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-03-29 21:04:45,302 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-03-29 21:04:45,304 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-03-29 21:04:45,310 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-03-29 21:04:45,311 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 4 variables, input treesize:78, output treesize:8 [2018-03-29 21:04:45,364 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-03-29 21:04:45,385 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-03-29 21:04:45,386 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 12] total 21 [2018-03-29 21:04:45,386 INFO L442 AbstractCegarLoop]: Interpolant automaton has 22 states [2018-03-29 21:04:45,386 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2018-03-29 21:04:45,386 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=61, Invalid=401, Unknown=0, NotChecked=0, Total=462 [2018-03-29 21:04:45,386 INFO L87 Difference]: Start difference. First operand 147 states and 158 transitions. Second operand 22 states. [2018-03-29 21:04:46,444 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-03-29 21:04:46,444 INFO L93 Difference]: Finished difference Result 207 states and 218 transitions. [2018-03-29 21:04:46,445 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 33 states. [2018-03-29 21:04:46,445 INFO L78 Accepts]: Start accepts. Automaton has 22 states. Word has length 47 [2018-03-29 21:04:46,445 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-03-29 21:04:46,446 INFO L225 Difference]: With dead ends: 207 [2018-03-29 21:04:46,446 INFO L226 Difference]: Without dead ends: 205 [2018-03-29 21:04:46,446 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 121 GetRequests, 71 SyntacticMatches, 2 SemanticMatches, 48 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 459 ImplicationChecksByTransitivity, 1.5s TimeCoverageRelationStatistics Valid=515, Invalid=1935, Unknown=0, NotChecked=0, Total=2450 [2018-03-29 21:04:46,447 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 205 states. [2018-03-29 21:04:46,452 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 205 to 159. [2018-03-29 21:04:46,452 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 159 states. [2018-03-29 21:04:46,453 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 159 states to 159 states and 173 transitions. [2018-03-29 21:04:46,453 INFO L78 Accepts]: Start accepts. Automaton has 159 states and 173 transitions. Word has length 47 [2018-03-29 21:04:46,453 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-03-29 21:04:46,453 INFO L459 AbstractCegarLoop]: Abstraction has 159 states and 173 transitions. [2018-03-29 21:04:46,453 INFO L460 AbstractCegarLoop]: Interpolant automaton has 22 states. [2018-03-29 21:04:46,454 INFO L276 IsEmpty]: Start isEmpty. Operand 159 states and 173 transitions. [2018-03-29 21:04:46,454 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2018-03-29 21:04:46,454 INFO L347 BasicCegarLoop]: Found error trace [2018-03-29 21:04:46,454 INFO L355 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-03-29 21:04:46,454 INFO L408 AbstractCegarLoop]: === Iteration 19 === [mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr21AssertViolationMEMORY_FREE, mainErr18RequiresViolation, mainErr0RequiresViolation, mainErr3RequiresViolation, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr2RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr24EnsuresViolationMEMORY_LEAK, mainErr19RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr23AssertViolationMEMORY_FREE, mainErr9RequiresViolation, mainErr22AssertViolationMEMORY_FREE, mainErr7RequiresViolation, mainErr11RequiresViolation, mainErr20AssertViolationMEMORY_FREE, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr4RequiresViolation, mainErr14RequiresViolation]=== [2018-03-29 21:04:46,454 INFO L82 PathProgramCache]: Analyzing trace with hash 1930686797, now seen corresponding path program 1 times No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 20 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 20 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-03-29 21:04:46,460 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-03-29 21:04:46,475 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-03-29 21:04:46,477 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-03-29 21:04:46,493 INFO L700 Elim1Store]: detected not equals via solver [2018-03-29 21:04:46,494 INFO L700 Elim1Store]: detected not equals via solver [2018-03-29 21:04:46,494 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-03-29 21:04:46,494 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-03-29 21:04:46,497 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-03-29 21:04:46,498 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:17, output treesize:11 [2018-03-29 21:04:46,514 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-03-29 21:04:46,516 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 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-03-29 21:04:46,516 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-03-29 21:04:46,518 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-03-29 21:04:46,526 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-03-29 21:04:46,527 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select 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-03-29 21:04:46,527 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-03-29 21:04:46,529 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-03-29 21:04:46,533 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-03-29 21:04:46,534 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 2 variables, input treesize:36, output treesize:25 [2018-03-29 21:04:46,550 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 28 [2018-03-29 21:04:46,552 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select 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-03-29 21:04:46,552 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-03-29 21:04:46,556 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-03-29 21:04:46,567 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 48 treesize of output 44 [2018-03-29 21:04:46,568 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 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-03-29 21:04:46,569 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-03-29 21:04:46,573 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-03-29 21:04:46,581 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-03-29 21:04:46,581 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 2 variables, input treesize:66, output treesize:50 [2018-03-29 21:04:46,602 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 34 treesize of output 37 [2018-03-29 21:04:46,604 INFO L700 Elim1Store]: detected not equals via solver [2018-03-29 21:04:46,605 INFO L700 Elim1Store]: detected not equals via solver [2018-03-29 21:04:46,606 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 35 [2018-03-29 21:04:46,606 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-03-29 21:04:46,613 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-03-29 21:04:46,628 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 53 treesize of output 45 [2018-03-29 21:04:46,631 INFO L700 Elim1Store]: detected not equals via solver [2018-03-29 21:04:46,631 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 42 treesize of output 55 [2018-03-29 21:04:46,632 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-03-29 21:04:46,640 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-03-29 21:04:46,652 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-03-29 21:04:46,653 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 2 variables, input treesize:78, output treesize:70 [2018-03-29 21:04:46,703 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 54 treesize of output 38 [2018-03-29 21:04:46,705 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-03-29 21:04:46,706 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-03-29 21:04:46,715 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 33 treesize of output 17 [2018-03-29 21:04:46,715 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-03-29 21:04:46,720 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-03-29 21:04:46,729 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 25 [2018-03-29 21:04:46,742 INFO L700 Elim1Store]: detected not equals via solver [2018-03-29 21:04:46,743 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 16 treesize of output 8 [2018-03-29 21:04:46,743 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2018-03-29 21:04:46,746 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-03-29 21:04:46,750 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-03-29 21:04:46,750 INFO L202 ElimStorePlain]: Needed 6 recursive calls to eliminate 3 variables, input treesize:75, output treesize:9 [2018-03-29 21:04:46,795 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-03-29 21:04:46,796 INFO L314 TraceCheckSpWp]: Computing backward predicates... [2018-03-29 21:04:46,988 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 32 treesize of output 30 [2018-03-29 21:04:46,989 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-03-29 21:04:47,040 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 2 new quantified variables, introduced 1 case distinctions, treesize of input 50 treesize of output 54 [2018-03-29 21:04:47,041 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 2 xjuncts. [2018-03-29 21:04:47,060 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 3 xjuncts. [2018-03-29 21:04:47,060 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:83, output treesize:75 [2018-03-29 21:04:47,107 WARN L307 Elim1Store]: Array PQE input equivalent to true [2018-03-29 21:04:47,107 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-03-29 21:04:47,129 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 2 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 27 [2018-03-29 21:04:47,156 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 8 [2018-03-29 21:04:47,156 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-03-29 21:04:47,226 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-03-29 21:04:47,229 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 3 [2018-03-29 21:04:47,229 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2018-03-29 21:04:47,244 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-03-29 21:04:47,251 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 2 xjuncts. [2018-03-29 21:04:47,263 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-2 vars, End of recursive call: and 2 xjuncts. [2018-03-29 21:04:47,263 INFO L202 ElimStorePlain]: Needed 6 recursive calls to eliminate 3 variables, input treesize:132, output treesize:35 [2018-03-29 21:04:47,537 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-03-29 21:04:47,558 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-03-29 21:04:47,558 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 12] total 24 [2018-03-29 21:04:47,559 INFO L442 AbstractCegarLoop]: Interpolant automaton has 25 states [2018-03-29 21:04:47,559 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2018-03-29 21:04:47,559 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=95, Invalid=505, Unknown=0, NotChecked=0, Total=600 [2018-03-29 21:04:47,559 INFO L87 Difference]: Start difference. First operand 159 states and 173 transitions. Second operand 25 states. [2018-03-29 21:04:49,234 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-03-29 21:04:49,234 INFO L93 Difference]: Finished difference Result 256 states and 276 transitions. [2018-03-29 21:04:49,235 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 41 states. [2018-03-29 21:04:49,235 INFO L78 Accepts]: Start accepts. Automaton has 25 states. Word has length 47 [2018-03-29 21:04:49,235 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-03-29 21:04:49,236 INFO L225 Difference]: With dead ends: 256 [2018-03-29 21:04:49,236 INFO L226 Difference]: Without dead ends: 254 [2018-03-29 21:04:49,237 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 131 GetRequests, 69 SyntacticMatches, 1 SemanticMatches, 61 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 921 ImplicationChecksByTransitivity, 1.8s TimeCoverageRelationStatistics Valid=1039, Invalid=2867, Unknown=0, NotChecked=0, Total=3906 [2018-03-29 21:04:49,237 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 254 states. [2018-03-29 21:04:49,243 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 254 to 192. [2018-03-29 21:04:49,243 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 192 states. [2018-03-29 21:04:49,244 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 192 states to 192 states and 213 transitions. [2018-03-29 21:04:49,244 INFO L78 Accepts]: Start accepts. Automaton has 192 states and 213 transitions. Word has length 47 [2018-03-29 21:04:49,244 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-03-29 21:04:49,244 INFO L459 AbstractCegarLoop]: Abstraction has 192 states and 213 transitions. [2018-03-29 21:04:49,244 INFO L460 AbstractCegarLoop]: Interpolant automaton has 25 states. [2018-03-29 21:04:49,244 INFO L276 IsEmpty]: Start isEmpty. Operand 192 states and 213 transitions. [2018-03-29 21:04:49,245 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2018-03-29 21:04:49,245 INFO L347 BasicCegarLoop]: Found error trace [2018-03-29 21:04:49,245 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] [2018-03-29 21:04:49,245 INFO L408 AbstractCegarLoop]: === Iteration 20 === [mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr21AssertViolationMEMORY_FREE, mainErr18RequiresViolation, mainErr0RequiresViolation, mainErr3RequiresViolation, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr2RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr24EnsuresViolationMEMORY_LEAK, mainErr19RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr23AssertViolationMEMORY_FREE, mainErr9RequiresViolation, mainErr22AssertViolationMEMORY_FREE, mainErr7RequiresViolation, mainErr11RequiresViolation, mainErr20AssertViolationMEMORY_FREE, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr4RequiresViolation, mainErr14RequiresViolation]=== [2018-03-29 21:04:49,245 INFO L82 PathProgramCache]: Analyzing trace with hash -142927862, now seen corresponding path program 1 times No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 21 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 21 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-03-29 21:04:49,251 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-03-29 21:04:49,269 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-03-29 21:04:49,271 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-03-29 21:04:49,285 INFO L700 Elim1Store]: detected not equals via solver [2018-03-29 21:04:49,286 INFO L700 Elim1Store]: detected not equals via solver [2018-03-29 21:04:49,286 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-03-29 21:04:49,287 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-03-29 21:04:49,291 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-03-29 21:04:49,291 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:14, output treesize:8 [2018-03-29 21:04:49,303 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 13 treesize of output 10 [2018-03-29 21:04:49,304 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 10 treesize of output 9 [2018-03-29 21:04:49,304 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-03-29 21:04:49,305 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-03-29 21:04:49,309 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-03-29 21:04:49,309 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:21, output treesize:14 [2018-03-29 21:04:49,344 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-03-29 21:04:49,346 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 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-03-29 21:04:49,346 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-03-29 21:04:49,347 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-03-29 21:04:49,349 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-03-29 21:04:49,349 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:21, output treesize:10 [2018-03-29 21:04:49,358 INFO L700 Elim1Store]: detected not equals via solver [2018-03-29 21:04:49,359 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 21 [2018-03-29 21:04:49,359 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-03-29 21:04:49,363 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-03-29 21:04:49,363 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:16, output treesize:11 [2018-03-29 21:04:49,375 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-03-29 21:04:49,376 INFO L314 TraceCheckSpWp]: Computing backward predicates... [2018-03-29 21:04:49,398 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 1 [2018-03-29 21:04:49,399 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-03-29 21:04:49,400 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-03-29 21:04:49,400 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:17, output treesize:10 [2018-03-29 21:04:49,471 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-03-29 21:04:49,492 INFO L320 seRefinementStrategy]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2018-03-29 21:04:49,493 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [11, 10] imperfect sequences [] total 19 [2018-03-29 21:04:49,493 INFO L442 AbstractCegarLoop]: Interpolant automaton has 20 states [2018-03-29 21:04:49,493 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2018-03-29 21:04:49,493 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=73, Invalid=307, Unknown=0, NotChecked=0, Total=380 [2018-03-29 21:04:49,493 INFO L87 Difference]: Start difference. First operand 192 states and 213 transitions. Second operand 20 states. [2018-03-29 21:04:49,930 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-03-29 21:04:49,930 INFO L93 Difference]: Finished difference Result 211 states and 230 transitions. [2018-03-29 21:04:49,930 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2018-03-29 21:04:49,930 INFO L78 Accepts]: Start accepts. Automaton has 20 states. Word has length 48 [2018-03-29 21:04:49,931 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-03-29 21:04:49,931 INFO L225 Difference]: With dead ends: 211 [2018-03-29 21:04:49,931 INFO L226 Difference]: Without dead ends: 210 [2018-03-29 21:04:49,932 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 115 GetRequests, 78 SyntacticMatches, 2 SemanticMatches, 35 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 214 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=312, Invalid=1020, Unknown=0, NotChecked=0, Total=1332 [2018-03-29 21:04:49,932 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 210 states. [2018-03-29 21:04:49,939 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 210 to 192. [2018-03-29 21:04:49,939 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 192 states. [2018-03-29 21:04:49,940 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 192 states to 192 states and 211 transitions. [2018-03-29 21:04:49,940 INFO L78 Accepts]: Start accepts. Automaton has 192 states and 211 transitions. Word has length 48 [2018-03-29 21:04:49,940 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-03-29 21:04:49,941 INFO L459 AbstractCegarLoop]: Abstraction has 192 states and 211 transitions. [2018-03-29 21:04:49,941 INFO L460 AbstractCegarLoop]: Interpolant automaton has 20 states. [2018-03-29 21:04:49,941 INFO L276 IsEmpty]: Start isEmpty. Operand 192 states and 211 transitions. [2018-03-29 21:04:49,941 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2018-03-29 21:04:49,942 INFO L347 BasicCegarLoop]: Found error trace [2018-03-29 21:04:49,942 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] [2018-03-29 21:04:49,942 INFO L408 AbstractCegarLoop]: === Iteration 21 === [mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr21AssertViolationMEMORY_FREE, mainErr18RequiresViolation, mainErr0RequiresViolation, mainErr3RequiresViolation, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr2RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr24EnsuresViolationMEMORY_LEAK, mainErr19RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr23AssertViolationMEMORY_FREE, mainErr9RequiresViolation, mainErr22AssertViolationMEMORY_FREE, mainErr7RequiresViolation, mainErr11RequiresViolation, mainErr20AssertViolationMEMORY_FREE, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr4RequiresViolation, mainErr14RequiresViolation]=== [2018-03-29 21:04:49,942 INFO L82 PathProgramCache]: Analyzing trace with hash -1111647649, now seen corresponding path program 1 times No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 22 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 22 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-03-29 21:04:49,949 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-03-29 21:04:49,966 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-03-29 21:04:49,968 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-03-29 21:04:49,971 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select 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-03-29 21:04:49,971 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-03-29 21:04:49,973 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-03-29 21:04:49,974 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2018-03-29 21:04:49,995 INFO L700 Elim1Store]: detected not equals via solver [2018-03-29 21:04:49,995 INFO L700 Elim1Store]: detected not equals via solver [2018-03-29 21:04:49,996 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 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-03-29 21:04:49,996 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-03-29 21:04:50,003 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-03-29 21:04:50,003 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-03-29 21:04:50,009 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-03-29 21:04:50,009 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:28, output treesize:21 [2018-03-29 21:04:50,032 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-03-29 21:04:50,034 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select 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-03-29 21:04:50,034 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-03-29 21:04:50,036 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-03-29 21:04:50,049 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-03-29 21:04:50,050 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-03-29 21:04:50,051 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-03-29 21:04:50,052 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-03-29 21:04:50,059 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-03-29 21:04:50,060 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 2 variables, input treesize:46, output treesize:35 [2018-03-29 21:04:50,079 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 28 [2018-03-29 21:04:50,081 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select 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-03-29 21:04:50,081 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-03-29 21:04:50,084 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-03-29 21:04:50,097 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 48 treesize of output 44 [2018-03-29 21:04:50,099 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select 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-03-29 21:04:50,099 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-03-29 21:04:50,103 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-03-29 21:04:50,111 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-03-29 21:04:50,111 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 2 variables, input treesize:71, output treesize:55 [2018-03-29 21:04:50,133 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 34 treesize of output 37 [2018-03-29 21:04:50,135 INFO L700 Elim1Store]: detected not equals via solver [2018-03-29 21:04:50,136 INFO L700 Elim1Store]: detected not equals via solver [2018-03-29 21:04:50,136 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 35 [2018-03-29 21:04:50,137 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-03-29 21:04:50,144 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-03-29 21:04:50,161 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 53 treesize of output 45 [2018-03-29 21:04:50,164 INFO L700 Elim1Store]: detected not equals via solver [2018-03-29 21:04:50,164 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 42 treesize of output 55 [2018-03-29 21:04:50,165 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-03-29 21:04:50,173 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-03-29 21:04:50,185 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-03-29 21:04:50,186 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 2 variables, input treesize:83, output treesize:75 [2018-03-29 21:04:50,229 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 54 treesize of output 38 [2018-03-29 21:04:50,231 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-03-29 21:04:50,231 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-03-29 21:04:50,238 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 17 [2018-03-29 21:04:50,238 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-03-29 21:04:50,242 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-03-29 21:04:50,252 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 25 [2018-03-29 21:04:50,255 INFO L700 Elim1Store]: detected not equals via solver [2018-03-29 21:04:50,256 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 16 treesize of output 8 [2018-03-29 21:04:50,256 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2018-03-29 21:04:50,261 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-03-29 21:04:50,268 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-03-29 21:04:50,268 INFO L202 ElimStorePlain]: Needed 6 recursive calls to eliminate 3 variables, input treesize:80, output treesize:18 [2018-03-29 21:04:50,343 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-03-29 21:04:50,343 INFO L314 TraceCheckSpWp]: Computing backward predicates... [2018-03-29 21:04:50,470 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 2 new quantified variables, introduced 0 case distinctions, treesize of input 67 treesize of output 61 [2018-03-29 21:04:50,484 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 8 [2018-03-29 21:04:50,485 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-03-29 21:04:50,490 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 50 treesize of output 46 [2018-03-29 21:04:50,492 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 46 treesize of output 37 [2018-03-29 21:04:50,492 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-03-29 21:04:50,494 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-03-29 21:04:50,496 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-03-29 21:04:50,503 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 2 new quantified variables, introduced 0 case distinctions, treesize of input 71 treesize of output 48 [2018-03-29 21:04:50,538 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 8 [2018-03-29 21:04:50,538 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2018-03-29 21:04:50,553 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 17 [2018-03-29 21:04:50,555 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 6 treesize of output 1 [2018-03-29 21:04:50,555 INFO L267 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 1 xjuncts. [2018-03-29 21:04:50,557 INFO L267 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-03-29 21:04:50,559 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 27 treesize of output 21 [2018-03-29 21:04:50,560 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 11 [2018-03-29 21:04:50,560 INFO L267 ElimStorePlain]: Start of recursive call 11: End of recursive call: and 1 xjuncts. [2018-03-29 21:04:50,563 INFO L267 ElimStorePlain]: Start of recursive call 10: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-03-29 21:04:50,572 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 3 xjuncts. [2018-03-29 21:04:50,593 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 2 xjuncts. [2018-03-29 21:04:50,593 INFO L202 ElimStorePlain]: Needed 11 recursive calls to eliminate 2 variables, input treesize:105, output treesize:38 [2018-03-29 21:04:50,692 INFO L682 Elim1Store]: detected equality via solver [2018-03-29 21:04:50,692 INFO L682 Elim1Store]: detected equality via solver [2018-03-29 21:04:50,692 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 3 [2018-03-29 21:04:50,693 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-03-29 21:04:50,696 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-03-29 21:04:50,696 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:26, output treesize:17 [2018-03-29 21:04:50,756 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-03-29 21:04:50,777 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-03-29 21:04:50,777 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 14] total 28 [2018-03-29 21:04:50,778 INFO L442 AbstractCegarLoop]: Interpolant automaton has 29 states [2018-03-29 21:04:50,778 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2018-03-29 21:04:50,778 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=133, Invalid=679, Unknown=0, NotChecked=0, Total=812 [2018-03-29 21:04:50,778 INFO L87 Difference]: Start difference. First operand 192 states and 211 transitions. Second operand 29 states. [2018-03-29 21:04:51,765 WARN L151 SmtUtils]: Spent 117ms on a formula simplification. DAG size of input: 110 DAG size of output 83 [2018-03-29 21:05:17,217 WARN L151 SmtUtils]: Spent 24118ms on a formula simplification. DAG size of input: 40 DAG size of output 39 [2018-03-29 21:05:17,544 WARN L151 SmtUtils]: Spent 120ms on a formula simplification. DAG size of input: 105 DAG size of output 78 [2018-03-29 21:05:18,175 WARN L151 SmtUtils]: Spent 151ms on a formula simplification. DAG size of input: 77 DAG size of output 69 [2018-03-29 21:05:18,716 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-03-29 21:05:18,717 INFO L93 Difference]: Finished difference Result 325 states and 344 transitions. [2018-03-29 21:05:18,717 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 60 states. [2018-03-29 21:05:18,717 INFO L78 Accepts]: Start accepts. Automaton has 29 states. Word has length 50 [2018-03-29 21:05:18,717 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-03-29 21:05:18,718 INFO L225 Difference]: With dead ends: 325 [2018-03-29 21:05:18,718 INFO L226 Difference]: Without dead ends: 324 [2018-03-29 21:05:18,719 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 153 GetRequests, 71 SyntacticMatches, 1 SemanticMatches, 81 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1953 ImplicationChecksByTransitivity, 27.6s TimeCoverageRelationStatistics Valid=1788, Invalid=5018, Unknown=0, NotChecked=0, Total=6806 [2018-03-29 21:05:18,720 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 324 states. [2018-03-29 21:05:18,729 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 324 to 195. [2018-03-29 21:05:18,730 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 195 states. [2018-03-29 21:05:18,731 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 195 states to 195 states and 213 transitions. [2018-03-29 21:05:18,731 INFO L78 Accepts]: Start accepts. Automaton has 195 states and 213 transitions. Word has length 50 [2018-03-29 21:05:18,732 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-03-29 21:05:18,732 INFO L459 AbstractCegarLoop]: Abstraction has 195 states and 213 transitions. [2018-03-29 21:05:18,732 INFO L460 AbstractCegarLoop]: Interpolant automaton has 29 states. [2018-03-29 21:05:18,732 INFO L276 IsEmpty]: Start isEmpty. Operand 195 states and 213 transitions. [2018-03-29 21:05:18,733 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2018-03-29 21:05:18,733 INFO L347 BasicCegarLoop]: Found error trace [2018-03-29 21:05:18,733 INFO L355 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-03-29 21:05:18,733 INFO L408 AbstractCegarLoop]: === Iteration 22 === [mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr21AssertViolationMEMORY_FREE, mainErr18RequiresViolation, mainErr0RequiresViolation, mainErr3RequiresViolation, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr2RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr24EnsuresViolationMEMORY_LEAK, mainErr19RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr23AssertViolationMEMORY_FREE, mainErr9RequiresViolation, mainErr22AssertViolationMEMORY_FREE, mainErr7RequiresViolation, mainErr11RequiresViolation, mainErr20AssertViolationMEMORY_FREE, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr4RequiresViolation, mainErr14RequiresViolation]=== [2018-03-29 21:05:18,733 INFO L82 PathProgramCache]: Analyzing trace with hash -1980996322, now seen corresponding path program 1 times No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 23 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 23 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-03-29 21:05:18,742 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-03-29 21:05:18,765 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-03-29 21:05:18,767 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-03-29 21:05:18,773 INFO L700 Elim1Store]: detected not equals via solver [2018-03-29 21:05:18,774 INFO L700 Elim1Store]: detected not equals via solver [2018-03-29 21:05:18,774 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-03-29 21:05:18,775 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-03-29 21:05:18,777 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-03-29 21:05:18,777 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:14, output treesize:8 [2018-03-29 21:05:18,789 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-03-29 21:05:18,790 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-03-29 21:05:18,790 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-03-29 21:05:18,791 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-03-29 21:05:18,795 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-03-29 21:05:18,795 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:22, output treesize:15 [2018-03-29 21:05:18,807 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-03-29 21:05:18,809 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select 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-03-29 21:05:18,809 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-03-29 21:05:18,813 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-03-29 21:05:18,817 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-03-29 21:05:18,817 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:42, output treesize:34 [2018-03-29 21:05:18,833 INFO L700 Elim1Store]: detected not equals via solver [2018-03-29 21:05:18,834 INFO L700 Elim1Store]: detected not equals via solver [2018-03-29 21:05:18,834 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 21 treesize of output 33 [2018-03-29 21:05:18,835 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-03-29 21:05:18,845 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-03-29 21:05:18,846 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:45, output treesize:47 [2018-03-29 21:05:18,879 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 52 treesize of output 44 [2018-03-29 21:05:18,882 INFO L700 Elim1Store]: detected not equals via solver [2018-03-29 21:05:18,883 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 54 [2018-03-29 21:05:18,884 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-03-29 21:05:18,892 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-03-29 21:05:18,903 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-03-29 21:05:18,904 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:60, output treesize:59 [2018-03-29 21:05:19,062 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 66 treesize of output 46 [2018-03-29 21:05:19,065 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 39 treesize of output 19 [2018-03-29 21:05:19,065 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-03-29 21:05:19,075 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 1 [2018-03-29 21:05:19,076 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-03-29 21:05:19,080 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-03-29 21:05:19,085 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-03-29 21:05:19,085 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 2 variables, input treesize:66, output treesize:19 [2018-03-29 21:05:19,105 INFO L700 Elim1Store]: detected not equals via solver [2018-03-29 21:05:19,106 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 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 15 [2018-03-29 21:05:19,106 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-03-29 21:05:19,111 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-03-29 21:05:19,112 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:25, output treesize:15 [2018-03-29 21:05:19,148 INFO L700 Elim1Store]: detected not equals via solver [2018-03-29 21:05:19,150 INFO L700 Elim1Store]: detected not equals via solver [2018-03-29 21:05:19,151 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 30 [2018-03-29 21:05:19,151 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-03-29 21:05:19,161 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-03-29 21:05:19,161 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:21, output treesize:16 [2018-03-29 21:05:19,207 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-03-29 21:05:19,208 INFO L314 TraceCheckSpWp]: Computing backward predicates... [2018-03-29 21:05:19,382 INFO L682 Elim1Store]: detected equality via solver [2018-03-29 21:05:19,382 INFO L682 Elim1Store]: detected equality via solver [2018-03-29 21:05:19,383 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 43 treesize of output 48 [2018-03-29 21:05:19,402 INFO L682 Elim1Store]: detected equality via solver [2018-03-29 21:05:19,402 INFO L682 Elim1Store]: detected equality via solver [2018-03-29 21:05:19,403 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 27 [2018-03-29 21:05:19,403 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-03-29 21:05:19,404 INFO L682 Elim1Store]: detected equality via solver [2018-03-29 21:05:19,406 INFO L682 Elim1Store]: detected equality via solver [2018-03-29 21:05:19,413 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 1 case distinctions, treesize of input 37 treesize of output 56 [2018-03-29 21:05:19,413 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 2 xjuncts. [2018-03-29 21:05:19,424 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-03-29 21:05:19,435 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: 4 dim-0 vars, and 2 xjuncts. [2018-03-29 21:05:19,435 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 3 variables, input treesize:46, output treesize:60 [2018-03-29 21:05:22,426 WARN L307 Elim1Store]: Array PQE input equivalent to true [2018-03-29 21:05:22,426 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-03-29 21:05:22,468 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 2 new quantified variables, introduced 0 case distinctions, treesize of input 39 treesize of output 33 [2018-03-29 21:05:22,470 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 9 treesize of output 8 [2018-03-29 21:05:22,470 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-03-29 21:05:22,476 INFO L700 Elim1Store]: detected not equals via solver [2018-03-29 21:05:22,478 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 35 [2018-03-29 21:05:22,481 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 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 23 [2018-03-29 21:05:22,482 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2018-03-29 21:05:22,488 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 15 [2018-03-29 21:05:22,496 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2018-03-29 21:05:22,496 INFO L267 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 1 xjuncts. [2018-03-29 21:05:22,504 INFO L267 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-03-29 21:05:22,506 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-03-29 21:05:22,507 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-03-29 21:05:22,511 INFO L267 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-03-29 21:05:22,511 INFO L202 ElimStorePlain]: Needed 8 recursive calls to eliminate 6 variables, input treesize:100, output treesize:8 [2018-03-29 21:05:22,579 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-03-29 21:05:22,601 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-03-29 21:05:22,601 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 16] total 30 [2018-03-29 21:05:22,601 INFO L442 AbstractCegarLoop]: Interpolant automaton has 31 states [2018-03-29 21:05:22,601 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 31 interpolants. [2018-03-29 21:05:22,602 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=124, Invalid=806, Unknown=0, NotChecked=0, Total=930 [2018-03-29 21:05:22,602 INFO L87 Difference]: Start difference. First operand 195 states and 213 transitions. Second operand 31 states. [2018-03-29 21:05:24,225 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-03-29 21:05:24,226 INFO L93 Difference]: Finished difference Result 208 states and 221 transitions. [2018-03-29 21:05:24,226 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 33 states. [2018-03-29 21:05:24,226 INFO L78 Accepts]: Start accepts. Automaton has 31 states. Word has length 53 [2018-03-29 21:05:24,226 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-03-29 21:05:24,227 INFO L225 Difference]: With dead ends: 208 [2018-03-29 21:05:24,227 INFO L226 Difference]: Without dead ends: 206 [2018-03-29 21:05:24,228 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 134 GetRequests, 76 SyntacticMatches, 0 SemanticMatches, 58 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 690 ImplicationChecksByTransitivity, 4.5s TimeCoverageRelationStatistics Valid=698, Invalid=2842, Unknown=0, NotChecked=0, Total=3540 [2018-03-29 21:05:24,228 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 206 states. [2018-03-29 21:05:24,234 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 206 to 180. [2018-03-29 21:05:24,234 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 180 states. [2018-03-29 21:05:24,235 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 180 states to 180 states and 195 transitions. [2018-03-29 21:05:24,235 INFO L78 Accepts]: Start accepts. Automaton has 180 states and 195 transitions. Word has length 53 [2018-03-29 21:05:24,235 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-03-29 21:05:24,235 INFO L459 AbstractCegarLoop]: Abstraction has 180 states and 195 transitions. [2018-03-29 21:05:24,235 INFO L460 AbstractCegarLoop]: Interpolant automaton has 31 states. [2018-03-29 21:05:24,235 INFO L276 IsEmpty]: Start isEmpty. Operand 180 states and 195 transitions. [2018-03-29 21:05:24,236 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2018-03-29 21:05:24,236 INFO L347 BasicCegarLoop]: Found error trace [2018-03-29 21:05:24,236 INFO L355 BasicCegarLoop]: trace histogram [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, 1, 1] [2018-03-29 21:05:24,236 INFO L408 AbstractCegarLoop]: === Iteration 23 === [mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr21AssertViolationMEMORY_FREE, mainErr18RequiresViolation, mainErr0RequiresViolation, mainErr3RequiresViolation, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr2RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr24EnsuresViolationMEMORY_LEAK, mainErr19RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr23AssertViolationMEMORY_FREE, mainErr9RequiresViolation, mainErr22AssertViolationMEMORY_FREE, mainErr7RequiresViolation, mainErr11RequiresViolation, mainErr20AssertViolationMEMORY_FREE, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr4RequiresViolation, mainErr14RequiresViolation]=== [2018-03-29 21:05:24,236 INFO L82 PathProgramCache]: Analyzing trace with hash 379833185, now seen corresponding path program 1 times No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 24 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 24 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-03-29 21:05:24,250 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-03-29 21:05:24,276 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-03-29 21:05:24,279 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-03-29 21:05:24,295 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 10 [2018-03-29 21:05:24,297 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 9 [2018-03-29 21:05:24,297 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-03-29 21:05:24,299 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-03-29 21:05:24,308 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 15 treesize of output 12 [2018-03-29 21:05:24,322 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 11 [2018-03-29 21:05:24,322 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-03-29 21:05:24,324 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-03-29 21:05:24,330 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-03-29 21:05:24,330 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 2 variables, input treesize:37, output treesize:29 [2018-03-29 21:05:24,355 INFO L700 Elim1Store]: detected not equals via solver [2018-03-29 21:05:24,356 INFO L700 Elim1Store]: detected not equals via solver [2018-03-29 21:05:24,357 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-03-29 21:05:24,357 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-03-29 21:05:24,363 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-03-29 21:05:24,364 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:31, output treesize:25 [2018-03-29 21:05:24,397 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 20 [2018-03-29 21:05:24,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 8 treesize of output 7 [2018-03-29 21:05:24,400 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-03-29 21:05:24,404 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-03-29 21:05:24,421 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 24 [2018-03-29 21:05:24,423 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select 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-03-29 21:05:24,424 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-03-29 21:05:24,428 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-03-29 21:05:24,438 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-03-29 21:05:24,438 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 2 variables, input treesize:50, output treesize:43 [2018-03-29 21:05:24,464 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 73 treesize of output 63 [2018-03-29 21:05:24,467 INFO L700 Elim1Store]: detected not equals via solver [2018-03-29 21:05:24,467 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 22 treesize of output 39 [2018-03-29 21:05:24,468 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-03-29 21:05:24,487 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-03-29 21:05:24,503 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 38 treesize of output 33 [2018-03-29 21:05:24,505 INFO L700 Elim1Store]: detected not equals via solver [2018-03-29 21:05:24,506 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 35 [2018-03-29 21:05:24,506 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-03-29 21:05:24,513 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-03-29 21:05:24,523 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-03-29 21:05:24,524 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 2 variables, input treesize:83, output treesize:67 [2018-03-29 21:05:24,550 INFO L700 Elim1Store]: detected not equals via solver [2018-03-29 21:05:24,551 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 70 treesize of output 67 [2018-03-29 21:05:24,555 INFO L700 Elim1Store]: detected not equals via solver [2018-03-29 21:05:24,556 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 68 treesize of output 84 [2018-03-29 21:05:24,556 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-03-29 21:05:24,570 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-03-29 21:05:24,591 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 45 treesize of output 48 [2018-03-29 21:05:24,594 INFO L700 Elim1Store]: detected not equals via solver [2018-03-29 21:05:24,595 INFO L700 Elim1Store]: detected not equals via solver [2018-03-29 21:05:24,595 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 35 [2018-03-29 21:05:24,596 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-03-29 21:05:24,606 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-03-29 21:05:24,619 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-03-29 21:05:24,619 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 2 variables, input treesize:95, output treesize:87 [2018-03-29 21:05:24,846 INFO L700 Elim1Store]: detected not equals via solver [2018-03-29 21:05:24,847 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 80 treesize of output 62 [2018-03-29 21:05:24,850 INFO L682 Elim1Store]: detected equality via solver [2018-03-29 21:05:24,852 INFO L700 Elim1Store]: detected not equals via solver [2018-03-29 21:05:24,860 INFO L477 Elim1Store]: Elim1 applied some preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 3 disjoint index pairs (out of 6 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 24 treesize of output 39 [2018-03-29 21:05:24,862 INFO L267 ElimStorePlain]: Start of recursive call 3: 2 dim-0 vars, End of recursive call: 2 dim-0 vars, and 3 xjuncts. [2018-03-29 21:05:24,878 INFO L700 Elim1Store]: detected not equals via solver [2018-03-29 21:05:24,878 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 34 treesize of output 22 [2018-03-29 21:05:24,879 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-03-29 21:05:24,883 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-03-29 21:05:24,895 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-03-29 21:05:24,897 INFO L682 Elim1Store]: detected equality via solver [2018-03-29 21:05:24,897 INFO L700 Elim1Store]: detected not equals via solver [2018-03-29 21:05:24,898 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 13 [2018-03-29 21:05:24,898 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2018-03-29 21:05:24,906 INFO L700 Elim1Store]: detected not equals via solver [2018-03-29 21:05:24,906 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-03-29 21:05:24,906 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2018-03-29 21:05:24,909 INFO L267 ElimStorePlain]: Start of recursive call 5: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-03-29 21:05:24,914 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-03-29 21:05:24,914 INFO L202 ElimStorePlain]: Needed 7 recursive calls to eliminate 3 variables, input treesize:110, output treesize:12 [2018-03-29 21:05:24,951 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 0 proven. 11 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-03-29 21:05:24,951 INFO L314 TraceCheckSpWp]: Computing backward predicates... [2018-03-29 21:05:26,764 WARN L148 SmtUtils]: Spent 100ms on a formula simplification that was a NOOP. DAG size: 72 [2018-03-29 21:05:29,622 WARN L148 SmtUtils]: Spent 132ms on a formula simplification that was a NOOP. DAG size: 72 [2018-03-29 21:05:29,628 WARN L307 Elim1Store]: Array PQE input equivalent to true [2018-03-29 21:05:29,628 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-03-29 21:05:29,632 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 4 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-03-29 21:05:29,632 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 6 variables, input treesize:961, output treesize:1 [2018-03-29 21:05:29,648 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 0 proven. 11 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-03-29 21:05:29,670 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-03-29 21:05:29,670 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [18, 15] total 31 [2018-03-29 21:05:29,670 INFO L442 AbstractCegarLoop]: Interpolant automaton has 31 states [2018-03-29 21:05:29,671 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 31 interpolants. [2018-03-29 21:05:29,671 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=113, Invalid=816, Unknown=1, NotChecked=0, Total=930 [2018-03-29 21:05:29,671 INFO L87 Difference]: Start difference. First operand 180 states and 195 transitions. Second operand 31 states. [2018-03-29 21:05:31,273 WARN L151 SmtUtils]: Spent 739ms on a formula simplification. DAG size of input: 155 DAG size of output 131 [2018-03-29 21:05:31,639 WARN L151 SmtUtils]: Spent 219ms on a formula simplification. DAG size of input: 106 DAG size of output 98 [2018-03-29 21:05:32,159 WARN L151 SmtUtils]: Spent 323ms on a formula simplification. DAG size of input: 124 DAG size of output 104 [2018-03-29 21:05:33,598 WARN L151 SmtUtils]: Spent 605ms on a formula simplification. DAG size of input: 161 DAG size of output 135 [2018-03-29 21:05:34,248 WARN L151 SmtUtils]: Spent 147ms on a formula simplification. DAG size of input: 148 DAG size of output 109 [2018-03-29 21:05:34,658 WARN L151 SmtUtils]: Spent 118ms on a formula simplification. DAG size of input: 123 DAG size of output 84 [2018-03-29 21:05:35,786 WARN L151 SmtUtils]: Spent 107ms on a formula simplification. DAG size of input: 119 DAG size of output 80 [2018-03-29 21:05:36,306 WARN L151 SmtUtils]: Spent 243ms on a formula simplification. DAG size of input: 99 DAG size of output 87 [2018-03-29 21:05:49,391 WARN L151 SmtUtils]: Spent 9266ms on a formula simplification. DAG size of input: 128 DAG size of output 122 [2018-03-29 21:05:49,741 WARN L151 SmtUtils]: Spent 177ms on a formula simplification. DAG size of input: 95 DAG size of output 83 [2018-03-29 21:05:51,017 WARN L151 SmtUtils]: Spent 594ms on a formula simplification. DAG size of input: 131 DAG size of output 119 [2018-03-29 21:05:52,039 WARN L151 SmtUtils]: Spent 710ms on a formula simplification. DAG size of input: 135 DAG size of output 123 [2018-03-29 21:05:53,123 WARN L151 SmtUtils]: Spent 716ms on a formula simplification. DAG size of input: 135 DAG size of output 123 [2018-03-29 21:05:53,394 WARN L151 SmtUtils]: Spent 158ms on a formula simplification. DAG size of input: 89 DAG size of output 83 [2018-03-29 21:05:53,769 WARN L148 SmtUtils]: Spent 126ms on a formula simplification that was a NOOP. DAG size: 90 [2018-03-29 21:05:54,654 WARN L151 SmtUtils]: Spent 335ms on a formula simplification. DAG size of input: 125 DAG size of output 113 [2018-03-29 21:05:55,111 WARN L151 SmtUtils]: Spent 251ms on a formula simplification. DAG size of input: 108 DAG size of output 96 [2018-03-29 21:06:32,327 WARN L151 SmtUtils]: Spent 32315ms on a formula simplification. DAG size of input: 154 DAG size of output 148 [2018-03-29 21:06:35,628 WARN L151 SmtUtils]: Spent 158ms on a formula simplification. DAG size of input: 102 DAG size of output 96 [2018-03-29 21:06:36,003 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-03-29 21:06:36,003 INFO L93 Difference]: Finished difference Result 374 states and 403 transitions. [2018-03-29 21:06:36,003 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 60 states. [2018-03-29 21:06:36,004 INFO L78 Accepts]: Start accepts. Automaton has 31 states. Word has length 54 [2018-03-29 21:06:36,004 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-03-29 21:06:36,005 INFO L225 Difference]: With dead ends: 374 [2018-03-29 21:06:36,005 INFO L226 Difference]: Without dead ends: 336 [2018-03-29 21:06:36,008 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 163 GetRequests, 78 SyntacticMatches, 0 SemanticMatches, 85 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2052 ImplicationChecksByTransitivity, 65.5s TimeCoverageRelationStatistics Valid=1217, Invalid=6262, Unknown=3, NotChecked=0, Total=7482 [2018-03-29 21:06:36,008 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 336 states. [2018-03-29 21:06:36,023 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 336 to 261. [2018-03-29 21:06:36,023 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 261 states. [2018-03-29 21:06:36,024 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 261 states to 261 states and 284 transitions. [2018-03-29 21:06:36,025 INFO L78 Accepts]: Start accepts. Automaton has 261 states and 284 transitions. Word has length 54 [2018-03-29 21:06:36,025 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-03-29 21:06:36,025 INFO L459 AbstractCegarLoop]: Abstraction has 261 states and 284 transitions. [2018-03-29 21:06:36,025 INFO L460 AbstractCegarLoop]: Interpolant automaton has 31 states. [2018-03-29 21:06:36,025 INFO L276 IsEmpty]: Start isEmpty. Operand 261 states and 284 transitions. [2018-03-29 21:06:36,026 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2018-03-29 21:06:36,026 INFO L347 BasicCegarLoop]: Found error trace [2018-03-29 21:06:36,026 INFO L355 BasicCegarLoop]: trace histogram [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] [2018-03-29 21:06:36,026 INFO L408 AbstractCegarLoop]: === Iteration 24 === [mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr21AssertViolationMEMORY_FREE, mainErr18RequiresViolation, mainErr0RequiresViolation, mainErr3RequiresViolation, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr2RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr24EnsuresViolationMEMORY_LEAK, mainErr19RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr23AssertViolationMEMORY_FREE, mainErr9RequiresViolation, mainErr22AssertViolationMEMORY_FREE, mainErr7RequiresViolation, mainErr11RequiresViolation, mainErr20AssertViolationMEMORY_FREE, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr4RequiresViolation, mainErr14RequiresViolation]=== [2018-03-29 21:06:36,027 INFO L82 PathProgramCache]: Analyzing trace with hash -496997936, now seen corresponding path program 1 times No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 25 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 25 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-03-29 21:06:36,037 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-03-29 21:06:36,066 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-03-29 21:06:36,069 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-03-29 21:06:36,126 INFO L700 Elim1Store]: detected not equals via solver [2018-03-29 21:06:36,127 INFO L700 Elim1Store]: detected not equals via solver [2018-03-29 21:06:36,128 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-03-29 21:06:36,128 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-03-29 21:06:36,140 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-03-29 21:06:36,140 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:17, output treesize:11 [2018-03-29 21:06:36,184 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-03-29 21:06:36,187 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select 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-03-29 21:06:36,187 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-03-29 21:06:36,189 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-03-29 21:06:36,197 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-03-29 21:06:36,197 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:25, output treesize:18 [2018-03-29 21:06:36,220 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 20 [2018-03-29 21:06:36,222 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select 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-03-29 21:06:36,223 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-03-29 21:06:36,229 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-03-29 21:06:36,242 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-03-29 21:06:36,242 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:26, output treesize:22 [2018-03-29 21:06:36,271 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 27 [2018-03-29 21:06:36,274 INFO L700 Elim1Store]: detected not equals via solver [2018-03-29 21:06:36,276 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-03-29 21:06:36,277 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-03-29 21:06:36,289 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-03-29 21:06:36,308 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-03-29 21:06:36,309 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:35, output treesize:22 [2018-03-29 21:06:36,338 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 20 [2018-03-29 21:06:36,352 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-03-29 21:06:36,353 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-03-29 21:06:36,356 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-03-29 21:06:36,359 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-03-29 21:06:36,360 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:26, output treesize:3 [2018-03-29 21:06:36,378 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 0 proven. 13 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-03-29 21:06:36,378 INFO L314 TraceCheckSpWp]: Computing backward predicates... [2018-03-29 21:06:36,419 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 2 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 27 [2018-03-29 21:06:36,432 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 8 [2018-03-29 21:06:36,432 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-03-29 21:06:36,444 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 17 [2018-03-29 21:06:36,446 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 6 treesize of output 1 [2018-03-29 21:06:36,446 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-03-29 21:06:36,448 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-03-29 21:06:36,450 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-03-29 21:06:36,451 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 3 [2018-03-29 21:06:36,451 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2018-03-29 21:06:36,452 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-03-29 21:06:36,462 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 4 xjuncts. [2018-03-29 21:06:36,475 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 3 xjuncts. [2018-03-29 21:06:36,476 INFO L202 ElimStorePlain]: Needed 7 recursive calls to eliminate 1 variables, input treesize:38, output treesize:43 [2018-03-29 21:06:36,588 INFO L682 Elim1Store]: detected equality via solver [2018-03-29 21:06:36,588 INFO L682 Elim1Store]: detected equality via solver [2018-03-29 21:06:36,589 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 21 treesize of output 12 [2018-03-29 21:06:36,589 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-03-29 21:06:36,617 INFO L682 Elim1Store]: detected equality via solver [2018-03-29 21:06:36,617 INFO L682 Elim1Store]: detected equality via solver [2018-03-29 21:06:36,617 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 16 treesize of output 7 [2018-03-29 21:06:36,618 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-03-29 21:06:36,624 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-03-29 21:06:36,625 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:41, output treesize:13 [2018-03-29 21:06:36,633 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 0 proven. 13 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-03-29 21:06:36,654 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-03-29 21:06:36,654 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 12] total 19 [2018-03-29 21:06:36,654 INFO L442 AbstractCegarLoop]: Interpolant automaton has 20 states [2018-03-29 21:06:36,655 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2018-03-29 21:06:36,655 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=66, Invalid=314, Unknown=0, NotChecked=0, Total=380 [2018-03-29 21:06:36,655 INFO L87 Difference]: Start difference. First operand 261 states and 284 transitions. Second operand 20 states. [2018-03-29 21:06:37,470 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-03-29 21:06:37,470 INFO L93 Difference]: Finished difference Result 297 states and 321 transitions. [2018-03-29 21:06:37,471 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2018-03-29 21:06:37,471 INFO L78 Accepts]: Start accepts. Automaton has 20 states. Word has length 54 [2018-03-29 21:06:37,471 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-03-29 21:06:37,473 INFO L225 Difference]: With dead ends: 297 [2018-03-29 21:06:37,473 INFO L226 Difference]: Without dead ends: 296 [2018-03-29 21:06:37,474 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 128 GetRequests, 87 SyntacticMatches, 2 SemanticMatches, 39 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 294 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=477, Invalid=1163, Unknown=0, NotChecked=0, Total=1640 [2018-03-29 21:06:37,474 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 296 states. [2018-03-29 21:06:37,485 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 296 to 232. [2018-03-29 21:06:37,485 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 232 states. [2018-03-29 21:06:37,486 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 232 states to 232 states and 253 transitions. [2018-03-29 21:06:37,486 INFO L78 Accepts]: Start accepts. Automaton has 232 states and 253 transitions. Word has length 54 [2018-03-29 21:06:37,486 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-03-29 21:06:37,486 INFO L459 AbstractCegarLoop]: Abstraction has 232 states and 253 transitions. [2018-03-29 21:06:37,486 INFO L460 AbstractCegarLoop]: Interpolant automaton has 20 states. [2018-03-29 21:06:37,486 INFO L276 IsEmpty]: Start isEmpty. Operand 232 states and 253 transitions. [2018-03-29 21:06:37,486 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2018-03-29 21:06:37,487 INFO L347 BasicCegarLoop]: Found error trace [2018-03-29 21:06:37,487 INFO L355 BasicCegarLoop]: trace histogram [3, 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] [2018-03-29 21:06:37,487 INFO L408 AbstractCegarLoop]: === Iteration 25 === [mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr21AssertViolationMEMORY_FREE, mainErr18RequiresViolation, mainErr0RequiresViolation, mainErr3RequiresViolation, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr2RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr24EnsuresViolationMEMORY_LEAK, mainErr19RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr23AssertViolationMEMORY_FREE, mainErr9RequiresViolation, mainErr22AssertViolationMEMORY_FREE, mainErr7RequiresViolation, mainErr11RequiresViolation, mainErr20AssertViolationMEMORY_FREE, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr4RequiresViolation, mainErr14RequiresViolation]=== [2018-03-29 21:06:37,487 INFO L82 PathProgramCache]: Analyzing trace with hash 1988485223, now seen corresponding path program 2 times No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 26 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 26 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-03-29 21:06:37,493 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-03-29 21:06:37,511 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-03-29 21:06:37,514 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-03-29 21:06:37,562 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 8 [2018-03-29 21:06:37,563 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select 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-03-29 21:06:37,564 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-03-29 21:06:37,565 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-03-29 21:06:37,573 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-03-29 21:06:37,574 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:40, output treesize:33 [2018-03-29 21:06:37,592 INFO L700 Elim1Store]: detected not equals via solver [2018-03-29 21:06:37,596 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 56 treesize of output 60 [2018-03-29 21:06:37,598 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select 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-03-29 21:06:37,598 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-03-29 21:06:37,606 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-03-29 21:06:37,613 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-03-29 21:06:37,614 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:59, output treesize:51 [2018-03-29 21:06:37,640 INFO L700 Elim1Store]: detected not equals via solver [2018-03-29 21:06:37,643 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 61 treesize of output 59 [2018-03-29 21:06:37,645 INFO L700 Elim1Store]: detected not equals via solver [2018-03-29 21:06:37,646 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 56 treesize of output 71 [2018-03-29 21:06:37,646 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-03-29 21:06:37,656 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-03-29 21:06:37,665 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-03-29 21:06:37,665 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:64, output treesize:60 [2018-03-29 21:06:37,743 INFO L700 Elim1Store]: detected not equals via solver [2018-03-29 21:06:37,744 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 62 treesize of output 52 [2018-03-29 21:06:37,746 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-03-29 21:06:37,746 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-03-29 21:06:37,754 INFO L700 Elim1Store]: detected not equals via solver [2018-03-29 21:06:37,755 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 39 treesize of output 27 [2018-03-29 21:06:37,755 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-03-29 21:06:37,759 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-03-29 21:06:37,763 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-03-29 21:06:37,763 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 2 variables, input treesize:62, output treesize:23 [2018-03-29 21:06:37,855 WARN L1033 $PredicateComparison]: unable to prove that (exists ((main_~y~0.base Int) (v_subst_4 Int)) (let ((.cse0 (store |c_old(#valid)| main_~y~0.base 1))) (and (= (select |c_old(#valid)| main_~y~0.base) 0) (= (store (store .cse0 v_subst_4 0) main_~y~0.base 0) |c_#valid|) (= (select .cse0 v_subst_4) 0)))) is different from true [2018-03-29 21:06:37,867 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 0 proven. 15 refuted. 0 times theorem prover too weak. 0 trivial. 4 not checked. [2018-03-29 21:06:37,867 INFO L314 TraceCheckSpWp]: Computing backward predicates... [2018-03-29 21:06:38,008 WARN L1011 $PredicateComparison]: unable to prove that (forall ((main_~list~0.offset Int)) (= |c_old(#valid)| (store (store |c_#valid| c_main_~y~0.base 0) (select (select (store |c_#memory_$Pointer$.base| c_main_~list~0.base (store (select |c_#memory_$Pointer$.base| c_main_~list~0.base) (+ main_~list~0.offset 4) c_main_~y~0.base)) c_main_~y~0.base) c_main_~y~0.offset) 0))) is different from false [2018-03-29 21:06:38,013 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 2 new quantified variables, introduced 0 case distinctions, treesize of input 39 treesize of output 33 [2018-03-29 21:06:38,034 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 8 [2018-03-29 21:06:38,034 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-03-29 21:06:38,039 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 22 treesize of output 18 [2018-03-29 21:06:38,040 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 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 9 [2018-03-29 21:06:38,040 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-03-29 21:06:38,042 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-03-29 21:06:38,043 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-03-29 21:06:38,046 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-03-29 21:06:38,046 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 2 variables, input treesize:44, output treesize:14 [2018-03-29 21:06:38,090 WARN L1011 $PredicateComparison]: unable to prove that (forall ((|v_main_#t~malloc2.base_16| Int)) (or (not (= 0 (select |c_#valid| |v_main_#t~malloc2.base_16|))) (= (store (store |c_#valid| |v_main_#t~malloc2.base_16| 0) c_main_~list~0.base 0) |c_old(#valid)|))) is different from false [2018-03-29 21:06:38,093 WARN L1011 $PredicateComparison]: unable to prove that (forall ((|v_main_#t~malloc2.base_16| Int)) (or (not (= 0 (select |c_#valid| |v_main_#t~malloc2.base_16|))) (= (store (store |c_#valid| |v_main_#t~malloc2.base_16| 0) c_main_~y~0.base 0) |c_old(#valid)|))) is different from false [2018-03-29 21:06:38,151 WARN L1011 $PredicateComparison]: unable to prove that (forall ((|v_main_#t~malloc2.base_16| Int) (|v_main_#t~malloc0.base_12| Int)) (let ((.cse0 (store |c_#valid| |v_main_#t~malloc0.base_12| 1))) (or (not (= (select |c_#valid| |v_main_#t~malloc0.base_12|) 0)) (= (store (store .cse0 |v_main_#t~malloc2.base_16| 0) |v_main_#t~malloc0.base_12| 0) |c_old(#valid)|) (not (= 0 (select .cse0 |v_main_#t~malloc2.base_16|)))))) is different from false [2018-03-29 21:06:38,161 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 0 proven. 16 refuted. 0 times theorem prover too weak. 0 trivial. 3 not checked. [2018-03-29 21:06:38,183 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-03-29 21:06:38,183 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 17] total 32 [2018-03-29 21:06:38,183 INFO L442 AbstractCegarLoop]: Interpolant automaton has 33 states [2018-03-29 21:06:38,183 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 33 interpolants. [2018-03-29 21:06:38,184 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=93, Invalid=665, Unknown=18, NotChecked=280, Total=1056 [2018-03-29 21:06:38,184 INFO L87 Difference]: Start difference. First operand 232 states and 253 transitions. Second operand 33 states. [2018-03-29 21:06:38,212 WARN L1011 $PredicateComparison]: unable to prove that (and (= |c_#valid| |c_old(#valid)|) (forall ((|v_main_#t~malloc2.base_16| Int) (|v_main_#t~malloc0.base_12| Int)) (let ((.cse0 (store |c_#valid| |v_main_#t~malloc0.base_12| 1))) (or (not (= (select |c_#valid| |v_main_#t~malloc0.base_12|) 0)) (= (store (store .cse0 |v_main_#t~malloc2.base_16| 0) |v_main_#t~malloc0.base_12| 0) |c_old(#valid)|) (not (= 0 (select .cse0 |v_main_#t~malloc2.base_16|))))))) is different from false [2018-03-29 21:06:38,398 WARN L1011 $PredicateComparison]: unable to prove that (let ((.cse0 (store |c_old(#valid)| c_main_~list~0.base 1))) (and (= c_main_~list~0.base (select (select |c_#memory_$Pointer$.base| c_main_~y~0.base) c_main_~y~0.offset)) (forall ((main_~list~0.offset Int)) (= |c_old(#valid)| (store (store |c_#valid| c_main_~y~0.base 0) (select (select (store |c_#memory_$Pointer$.base| c_main_~list~0.base (store (select |c_#memory_$Pointer$.base| c_main_~list~0.base) (+ main_~list~0.offset 4) c_main_~y~0.base)) c_main_~y~0.base) c_main_~y~0.offset) 0))) (= c_main_~y~0.offset 0) (= (select .cse0 |c_main_#t~malloc2.base|) 0) (= |c_#valid| (store .cse0 c_main_~y~0.base 1)) (= 0 |c_main_#t~malloc2.offset|) (= |c_#valid| (store .cse0 |c_main_#t~malloc2.base| 1)) (= (select .cse0 c_main_~y~0.base) 0) (= (select |c_old(#valid)| c_main_~list~0.base) 0))) is different from false [2018-03-29 21:06:39,191 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-03-29 21:06:39,191 INFO L93 Difference]: Finished difference Result 277 states and 299 transitions. [2018-03-29 21:06:39,191 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2018-03-29 21:06:39,191 INFO L78 Accepts]: Start accepts. Automaton has 33 states. Word has length 59 [2018-03-29 21:06:39,191 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-03-29 21:06:39,192 INFO L225 Difference]: With dead ends: 277 [2018-03-29 21:06:39,192 INFO L226 Difference]: Without dead ends: 274 [2018-03-29 21:06:39,193 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 132 GetRequests, 84 SyntacticMatches, 3 SemanticMatches, 45 ConstructedPredicates, 7 IntricatePredicates, 0 DeprecatedPredicates, 265 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=205, Invalid=1356, Unknown=27, NotChecked=574, Total=2162 [2018-03-29 21:06:39,193 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 274 states. [2018-03-29 21:06:39,210 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 274 to 250. [2018-03-29 21:06:39,210 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 250 states. [2018-03-29 21:06:39,211 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 250 states to 250 states and 271 transitions. [2018-03-29 21:06:39,211 INFO L78 Accepts]: Start accepts. Automaton has 250 states and 271 transitions. Word has length 59 [2018-03-29 21:06:39,211 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-03-29 21:06:39,211 INFO L459 AbstractCegarLoop]: Abstraction has 250 states and 271 transitions. [2018-03-29 21:06:39,211 INFO L460 AbstractCegarLoop]: Interpolant automaton has 33 states. [2018-03-29 21:06:39,212 INFO L276 IsEmpty]: Start isEmpty. Operand 250 states and 271 transitions. [2018-03-29 21:06:39,212 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2018-03-29 21:06:39,213 INFO L347 BasicCegarLoop]: Found error trace [2018-03-29 21:06:39,213 INFO L355 BasicCegarLoop]: trace histogram [3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-03-29 21:06:39,213 INFO L408 AbstractCegarLoop]: === Iteration 26 === [mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr21AssertViolationMEMORY_FREE, mainErr18RequiresViolation, mainErr0RequiresViolation, mainErr3RequiresViolation, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr2RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr24EnsuresViolationMEMORY_LEAK, mainErr19RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr23AssertViolationMEMORY_FREE, mainErr9RequiresViolation, mainErr22AssertViolationMEMORY_FREE, mainErr7RequiresViolation, mainErr11RequiresViolation, mainErr20AssertViolationMEMORY_FREE, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr4RequiresViolation, mainErr14RequiresViolation]=== [2018-03-29 21:06:39,213 INFO L82 PathProgramCache]: Analyzing trace with hash 1988486057, now seen corresponding path program 2 times No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 27 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 27 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-03-29 21:06:39,219 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-03-29 21:06:39,241 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-03-29 21:06:39,243 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-03-29 21:06:39,252 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-03-29 21:06:39,253 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select 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-03-29 21:06:39,254 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-03-29 21:06:39,255 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-03-29 21:06:39,263 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 8 [2018-03-29 21:06:39,265 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 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-03-29 21:06:39,265 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-03-29 21:06:39,266 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-03-29 21:06:39,270 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-03-29 21:06:39,271 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 2 variables, input treesize:34, output treesize:23 [2018-03-29 21:06:39,281 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-03-29 21:06:39,283 INFO L700 Elim1Store]: detected not equals via solver [2018-03-29 21:06:39,284 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-03-29 21:06:39,284 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-03-29 21:06:39,288 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-03-29 21:06:39,298 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-03-29 21:06:39,300 INFO L700 Elim1Store]: detected not equals via solver [2018-03-29 21:06:39,301 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-03-29 21:06:39,301 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-03-29 21:06:39,305 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-03-29 21:06:39,312 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-03-29 21:06:39,312 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 2 variables, input treesize:49, output treesize:41 [2018-03-29 21:06:39,327 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 32 treesize of output 25 [2018-03-29 21:06:39,329 INFO L700 Elim1Store]: detected not equals via solver [2018-03-29 21:06:39,330 INFO L700 Elim1Store]: detected not equals via solver [2018-03-29 21:06:39,330 INFO L700 Elim1Store]: detected not equals via solver [2018-03-29 21:06:39,331 INFO L700 Elim1Store]: detected not equals via solver [2018-03-29 21:06:39,332 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 4 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 60 [2018-03-29 21:06:39,332 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-03-29 21:06:39,340 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-03-29 21:06:39,354 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 30 treesize of output 23 [2018-03-29 21:06:39,356 INFO L700 Elim1Store]: detected not equals via solver [2018-03-29 21:06:39,357 INFO L700 Elim1Store]: detected not equals via solver [2018-03-29 21:06:39,358 INFO L700 Elim1Store]: detected not equals via solver [2018-03-29 21:06:39,360 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 46 [2018-03-29 21:06:39,360 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-03-29 21:06:39,367 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-03-29 21:06:39,377 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-03-29 21:06:39,377 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 2 variables, input treesize:69, output treesize:61 [2018-03-29 21:06:39,412 INFO L700 Elim1Store]: detected not equals via solver [2018-03-29 21:06:39,413 INFO L700 Elim1Store]: detected not equals via solver [2018-03-29 21:06:39,413 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-03-29 21:06:39,413 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-03-29 21:06:39,425 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-03-29 21:06:39,425 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:59, output treesize:53 [2018-03-29 21:06:39,468 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 33 treesize of output 34 [2018-03-29 21:06:39,470 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select 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-03-29 21:06:39,470 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-03-29 21:06:39,478 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-03-29 21:06:39,512 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 33 treesize of output 34 [2018-03-29 21:06:39,515 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 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-03-29 21:06:39,515 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-03-29 21:06:39,522 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-03-29 21:06:39,536 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-03-29 21:06:39,537 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 2 variables, input treesize:78, output treesize:67 [2018-03-29 21:06:39,569 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 117 treesize of output 95 [2018-03-29 21:06:39,574 INFO L700 Elim1Store]: detected not equals via solver [2018-03-29 21:06:39,576 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 50 [2018-03-29 21:06:39,576 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-03-29 21:06:39,589 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-03-29 21:06:39,606 INFO L682 Elim1Store]: detected equality via solver [2018-03-29 21:06:39,607 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 60 treesize of output 48 [2018-03-29 21:06:39,609 INFO L700 Elim1Store]: detected not equals via solver [2018-03-29 21:06:39,610 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 49 [2018-03-29 21:06:39,610 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-03-29 21:06:39,617 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-03-29 21:06:39,629 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-03-29 21:06:39,629 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 2 variables, input treesize:127, output treesize:89 [2018-03-29 21:06:39,660 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 56 treesize of output 59 [2018-03-29 21:06:39,665 INFO L700 Elim1Store]: detected not equals via solver [2018-03-29 21:06:39,666 INFO L700 Elim1Store]: detected not equals via solver [2018-03-29 21:06:39,667 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 35 [2018-03-29 21:06:39,667 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-03-29 21:06:39,677 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-03-29 21:06:39,699 INFO L700 Elim1Store]: detected not equals via solver [2018-03-29 21:06:39,700 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 92 treesize of output 83 [2018-03-29 21:06:39,702 INFO L700 Elim1Store]: detected not equals via solver [2018-03-29 21:06:39,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, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 86 treesize of output 106 [2018-03-29 21:06:39,703 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-03-29 21:06:39,715 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-03-29 21:06:39,729 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-03-29 21:06:39,730 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 2 variables, input treesize:117, output treesize:109 [2018-03-29 21:06:39,860 INFO L700 Elim1Store]: detected not equals via solver [2018-03-29 21:06:39,861 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 116 treesize of output 87 [2018-03-29 21:06:39,868 INFO L700 Elim1Store]: detected not equals via solver [2018-03-29 21:06:39,881 INFO L477 Elim1Store]: Elim1 applied some preprocessing eliminated variable of array dimension 1, 0 stores, 5 select indices, 5 select index equivalence classes, 5 disjoint index pairs (out of 10 index pairs), introduced 2 new quantified variables, introduced 4 case distinctions, treesize of input 31 treesize of output 77 [2018-03-29 21:06:39,884 INFO L267 ElimStorePlain]: Start of recursive call 3: 5 dim-0 vars, End of recursive call: 5 dim-0 vars, and 6 xjuncts. [2018-03-29 21:06:39,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, 2 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 52 treesize of output 37 [2018-03-29 21:06:39,910 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-03-29 21:06:39,918 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-03-29 21:06:39,929 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 54 treesize of output 42 [2018-03-29 21:06:39,931 INFO L700 Elim1Store]: detected not equals via solver [2018-03-29 21:06:39,932 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 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-03-29 21:06:39,932 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2018-03-29 21:06:39,940 INFO L700 Elim1Store]: detected not equals via solver [2018-03-29 21:06:39,940 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 4 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 19 [2018-03-29 21:06:39,941 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2018-03-29 21:06:39,947 INFO L267 ElimStorePlain]: Start of recursive call 5: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-03-29 21:06:39,950 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-03-29 21:06:39,951 INFO L202 ElimStorePlain]: Needed 7 recursive calls to eliminate 3 variables, input treesize:137, output treesize:7 [2018-03-29 21:06:39,998 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 4 proven. 19 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-03-29 21:06:39,998 INFO L314 TraceCheckSpWp]: Computing backward predicates... Received shutdown request... [2018-03-29 21:07:08,932 INFO L175 TraceCheckSpWp]: Timeout while computing interpolants [2018-03-29 21:07:08,932 WARN L519 AbstractCegarLoop]: Verification canceled [2018-03-29 21:07:08,936 WARN L197 ceAbstractionStarter]: Timeout [2018-03-29 21:07:08,936 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 29.03 09:07:08 BoogieIcfgContainer [2018-03-29 21:07:08,937 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-03-29 21:07:08,937 INFO L168 Benchmark]: Toolchain (without parser) took 154186.29 ms. Allocated memory was 298.8 MB in the beginning and 631.8 MB in the end (delta: 332.9 MB). Free memory was 236.3 MB in the beginning and 552.5 MB in the end (delta: -316.1 MB). Peak memory consumption was 16.8 MB. Max. memory is 5.3 GB. [2018-03-29 21:07:08,938 INFO L168 Benchmark]: CDTParser took 0.24 ms. Allocated memory is still 298.8 MB. Free memory is still 261.2 MB. There was no memory consumed. Max. memory is 5.3 GB. [2018-03-29 21:07:08,938 INFO L168 Benchmark]: CACSL2BoogieTranslator took 347.91 ms. Allocated memory is still 298.8 MB. Free memory was 236.3 MB in the beginning and 212.3 MB in the end (delta: 24.1 MB). Peak memory consumption was 24.1 MB. Max. memory is 5.3 GB. [2018-03-29 21:07:08,938 INFO L168 Benchmark]: Boogie Preprocessor took 59.74 ms. Allocated memory is still 298.8 MB. Free memory was 212.3 MB in the beginning and 210.3 MB in the end (delta: 2.0 MB). Peak memory consumption was 2.0 MB. Max. memory is 5.3 GB. [2018-03-29 21:07:08,939 INFO L168 Benchmark]: RCFGBuilder took 503.30 ms. Allocated memory was 298.8 MB in the beginning and 452.5 MB in the end (delta: 153.6 MB). Free memory was 210.3 MB in the beginning and 387.2 MB in the end (delta: -176.9 MB). Peak memory consumption was 22.0 MB. Max. memory is 5.3 GB. [2018-03-29 21:07:08,939 INFO L168 Benchmark]: TraceAbstraction took 153268.66 ms. Allocated memory was 452.5 MB in the beginning and 631.8 MB in the end (delta: 179.3 MB). Free memory was 387.2 MB in the beginning and 552.5 MB in the end (delta: -165.3 MB). Peak memory consumption was 14.0 MB. Max. memory is 5.3 GB. [2018-03-29 21:07:08,940 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.24 ms. Allocated memory is still 298.8 MB. Free memory is still 261.2 MB. There was no memory consumed. Max. memory is 5.3 GB. * CACSL2BoogieTranslator took 347.91 ms. Allocated memory is still 298.8 MB. Free memory was 236.3 MB in the beginning and 212.3 MB in the end (delta: 24.1 MB). Peak memory consumption was 24.1 MB. Max. memory is 5.3 GB. * Boogie Preprocessor took 59.74 ms. Allocated memory is still 298.8 MB. Free memory was 212.3 MB in the beginning and 210.3 MB in the end (delta: 2.0 MB). Peak memory consumption was 2.0 MB. Max. memory is 5.3 GB. * RCFGBuilder took 503.30 ms. Allocated memory was 298.8 MB in the beginning and 452.5 MB in the end (delta: 153.6 MB). Free memory was 210.3 MB in the beginning and 387.2 MB in the end (delta: -176.9 MB). Peak memory consumption was 22.0 MB. Max. memory is 5.3 GB. * TraceAbstraction took 153268.66 ms. Allocated memory was 452.5 MB in the beginning and 631.8 MB in the end (delta: 179.3 MB). Free memory was 387.2 MB in the beginning and 552.5 MB in the end (delta: -165.3 MB). Peak memory consumption was 14.0 MB. Max. memory is 5.3 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - TimeoutResultAtElement [Line: 638]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 638). Cancelled while BasicCegarLoop was analyzing trace of length 60 with TraceHistMax 3, while TraceCheckSpWp was constructing backward predicates, while PredicateComparison was comparing new predicate (quantified with 0quantifier alternations) to 28 known predicates. - TimeoutResultAtElement [Line: 651]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 651). Cancelled while BasicCegarLoop was analyzing trace of length 60 with TraceHistMax 3, while TraceCheckSpWp was constructing backward predicates, while PredicateComparison was comparing new predicate (quantified with 0quantifier alternations) to 28 known predicates. - TimeoutResultAtElement [Line: 661]: Timeout (TraceAbstraction) Unable to prove that free always succeeds (line 661). Cancelled while BasicCegarLoop was analyzing trace of length 60 with TraceHistMax 3, while TraceCheckSpWp was constructing backward predicates, while PredicateComparison was comparing new predicate (quantified with 0quantifier alternations) to 28 known predicates. - TimeoutResultAtElement [Line: 661]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 661). Cancelled while BasicCegarLoop was analyzing trace of length 60 with TraceHistMax 3, while TraceCheckSpWp was constructing backward predicates, while PredicateComparison was comparing new predicate (quantified with 0quantifier alternations) to 28 known predicates. - TimeoutResultAtElement [Line: 636]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 636). Cancelled while BasicCegarLoop was analyzing trace of length 60 with TraceHistMax 3, while TraceCheckSpWp was constructing backward predicates, while PredicateComparison was comparing new predicate (quantified with 0quantifier alternations) to 28 known predicates. - TimeoutResultAtElement [Line: 637]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 637). Cancelled while BasicCegarLoop was analyzing trace of length 60 with TraceHistMax 3, while TraceCheckSpWp was constructing backward predicates, while PredicateComparison was comparing new predicate (quantified with 0quantifier alternations) to 28 known predicates. - TimeoutResultAtElement [Line: 658]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 658). Cancelled while BasicCegarLoop was analyzing trace of length 60 with TraceHistMax 3, while TraceCheckSpWp was constructing backward predicates, while PredicateComparison was comparing new predicate (quantified with 0quantifier alternations) to 28 known predicates. - TimeoutResultAtElement [Line: 659]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 659). Cancelled while BasicCegarLoop was analyzing trace of length 60 with TraceHistMax 3, while TraceCheckSpWp was constructing backward predicates, while PredicateComparison was comparing new predicate (quantified with 0quantifier alternations) to 28 known predicates. - TimeoutResultAtElement [Line: 637]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 637). Cancelled while BasicCegarLoop was analyzing trace of length 60 with TraceHistMax 3, while TraceCheckSpWp was constructing backward predicates, while PredicateComparison was comparing new predicate (quantified with 0quantifier alternations) to 28 known predicates. - TimeoutResultAtElement [Line: 651]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 651). Cancelled while BasicCegarLoop was analyzing trace of length 60 with TraceHistMax 3, while TraceCheckSpWp was constructing backward predicates, while PredicateComparison was comparing new predicate (quantified with 0quantifier alternations) to 28 known predicates. - TimeoutResultAtElement [Line: 643]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 643). Cancelled while BasicCegarLoop was analyzing trace of length 60 with TraceHistMax 3, while TraceCheckSpWp was constructing backward predicates, while PredicateComparison was comparing new predicate (quantified with 0quantifier alternations) to 28 known predicates. - TimeoutResultAtElement [Line: 631]: Timeout (TraceAbstraction) Unable to prove that all allocated memory was freed (line 631). Cancelled while BasicCegarLoop was analyzing trace of length 60 with TraceHistMax 3, while TraceCheckSpWp was constructing backward predicates, while PredicateComparison was comparing new predicate (quantified with 0quantifier alternations) to 28 known predicates. - TimeoutResultAtElement [Line: 661]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 661). Cancelled while BasicCegarLoop was analyzing trace of length 60 with TraceHistMax 3, while TraceCheckSpWp was constructing backward predicates, while PredicateComparison was comparing new predicate (quantified with 0quantifier alternations) to 28 known predicates. - TimeoutResultAtElement [Line: 636]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 636). Cancelled while BasicCegarLoop was analyzing trace of length 60 with TraceHistMax 3, while TraceCheckSpWp was constructing backward predicates, while PredicateComparison was comparing new predicate (quantified with 0quantifier alternations) to 28 known predicates. - TimeoutResultAtElement [Line: 659]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 659). Cancelled while BasicCegarLoop was analyzing trace of length 60 with TraceHistMax 3, while TraceCheckSpWp was constructing backward predicates, while PredicateComparison was comparing new predicate (quantified with 0quantifier alternations) to 28 known predicates. - TimeoutResultAtElement [Line: 663]: Timeout (TraceAbstraction) Unable to prove that free always succeeds (line 663). Cancelled while BasicCegarLoop was analyzing trace of length 60 with TraceHistMax 3, while TraceCheckSpWp was constructing backward predicates, while PredicateComparison was comparing new predicate (quantified with 0quantifier alternations) to 28 known predicates. - TimeoutResultAtElement [Line: 644]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 644). Cancelled while BasicCegarLoop was analyzing trace of length 60 with TraceHistMax 3, while TraceCheckSpWp was constructing backward predicates, while PredicateComparison was comparing new predicate (quantified with 0quantifier alternations) to 28 known predicates. - TimeoutResultAtElement [Line: 663]: Timeout (TraceAbstraction) Unable to prove that free always succeeds (line 663). Cancelled while BasicCegarLoop was analyzing trace of length 60 with TraceHistMax 3, while TraceCheckSpWp was constructing backward predicates, while PredicateComparison was comparing new predicate (quantified with 0quantifier alternations) to 28 known predicates. - TimeoutResultAtElement [Line: 643]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 643). Cancelled while BasicCegarLoop was analyzing trace of length 60 with TraceHistMax 3, while TraceCheckSpWp was constructing backward predicates, while PredicateComparison was comparing new predicate (quantified with 0quantifier alternations) to 28 known predicates. - TimeoutResultAtElement [Line: 647]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 647). Cancelled while BasicCegarLoop was analyzing trace of length 60 with TraceHistMax 3, while TraceCheckSpWp was constructing backward predicates, while PredicateComparison was comparing new predicate (quantified with 0quantifier alternations) to 28 known predicates. - TimeoutResultAtElement [Line: 661]: Timeout (TraceAbstraction) Unable to prove that free always succeeds (line 661). Cancelled while BasicCegarLoop was analyzing trace of length 60 with TraceHistMax 3, while TraceCheckSpWp was constructing backward predicates, while PredicateComparison was comparing new predicate (quantified with 0quantifier alternations) to 28 known predicates. - TimeoutResultAtElement [Line: 644]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 644). Cancelled while BasicCegarLoop was analyzing trace of length 60 with TraceHistMax 3, while TraceCheckSpWp was constructing backward predicates, while PredicateComparison was comparing new predicate (quantified with 0quantifier alternations) to 28 known predicates. - TimeoutResultAtElement [Line: 647]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 647). Cancelled while BasicCegarLoop was analyzing trace of length 60 with TraceHistMax 3, while TraceCheckSpWp was constructing backward predicates, while PredicateComparison was comparing new predicate (quantified with 0quantifier alternations) to 28 known predicates. - TimeoutResultAtElement [Line: 638]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 638). Cancelled while BasicCegarLoop was analyzing trace of length 60 with TraceHistMax 3, while TraceCheckSpWp was constructing backward predicates, while PredicateComparison was comparing new predicate (quantified with 0quantifier alternations) to 28 known predicates. - TimeoutResultAtElement [Line: 658]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 658). Cancelled while BasicCegarLoop was analyzing trace of length 60 with TraceHistMax 3, while TraceCheckSpWp was constructing backward predicates, while PredicateComparison was comparing new predicate (quantified with 0quantifier alternations) to 28 known predicates. - StatisticsResult: Ultimate Automizer benchmark data CFG has 3 procedures, 79 locations, 25 error locations. TIMEOUT Result, 153.2s OverallTime, 26 OverallIterations, 3 TraceHistogramMax, 105.8s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 1453 SDtfs, 6870 SDslu, 8554 SDs, 0 SdLazy, 7739 SolverSat, 1464 SolverUnsat, 13 SolverUnknown, 0 SolverNotchecked, 9.8s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 2182 GetRequests, 1466 SyntacticMatches, 22 SemanticMatches, 694 ConstructedPredicates, 10 IntricatePredicates, 1 DeprecatedPredicates, 7783 ImplicationChecksByTransitivity, 107.2s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=261occurred in iteration=23, 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.2s AutomataMinimizationTime, 25 MinimizatonAttempts, 1248 StatesRemovedByMinimization, 24 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.1s SsaConstructionTime, 0.3s SatisfiabilityAnalysisTime, 16.0s InterpolantComputationTime, 906 NumberOfCodeBlocks, 906 NumberOfCodeBlocksAsserted, 25 NumberOfCheckSat, 1762 ConstructedInterpolants, 223 QuantifiedInterpolants, 1177854 SizeOfPredicates, 251 NumberOfNonLiveVariables, 3291 ConjunctsInSsa, 524 ConjunctsInUnsatCore, 50 InterpolantComputations, 28 PerfectInterpolantSequences, 44/216 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate could not prove your program: Timeout Written .csv to /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/dll_extends_pointer_true-valid-memsafety.i_svcomp-DerefFreeMemtrack-32bit-Automizer_Fixed_noBitfields+AI_EQ_SS.epf_AutomizerC.xml/Csv-Benchmark-0-2018-03-29_21-07-08-947.csv Written .csv to /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/dll_extends_pointer_true-valid-memsafety.i_svcomp-DerefFreeMemtrack-32bit-Automizer_Fixed_noBitfields+AI_EQ_SS.epf_AutomizerC.xml/Csv-TraceAbstractionBenchmarks-0-2018-03-29_21-07-08-947.csv Completed graceful shutdown