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/array-memsafety/cstrncat-alloca_true-valid-memsafety_true-termination.i -------------------------------------------------------------------------------- This is Ultimate 0.1.23-453dfda-m [2018-04-09 19:55:46,197 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-04-09 19:55:46,199 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-04-09 19:55:46,212 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-04-09 19:55:46,212 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-04-09 19:55:46,213 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-04-09 19:55:46,214 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-04-09 19:55:46,215 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-04-09 19:55:46,218 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-04-09 19:55:46,219 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-04-09 19:55:46,219 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-04-09 19:55:46,220 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-04-09 19:55:46,221 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-04-09 19:55:46,222 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-04-09 19:55:46,223 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-04-09 19:55:46,225 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-04-09 19:55:46,227 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-04-09 19:55:46,229 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-04-09 19:55:46,230 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-04-09 19:55:46,232 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-04-09 19:55:46,234 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-04-09 19:55:46,234 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-04-09 19:55:46,234 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-04-09 19:55:46,235 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-04-09 19:55:46,236 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-04-09 19:55:46,238 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-04-09 19:55:46,238 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-04-09 19:55:46,239 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-04-09 19:55:46,239 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-04-09 19:55:46,240 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-04-09 19:55:46,240 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-04-09 19:55:46,241 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-04-09 19:55:46,264 INFO L110 SettingsManager]: Loading preferences was successful [2018-04-09 19:55:46,265 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-04-09 19:55:46,265 INFO L131 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2018-04-09 19:55:46,265 INFO L133 SettingsManager]: * ultimate.logging.details=de.uni_freiburg.informatik.ultimate.plugins.icfgtransformation=DEBUG; [2018-04-09 19:55:46,266 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-04-09 19:55:46,266 INFO L133 SettingsManager]: * to procedures, called more than once=true [2018-04-09 19:55:46,266 INFO L131 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2018-04-09 19:55:46,266 INFO L133 SettingsManager]: * Abstract domain for RCFG-of-the-future=VPDomain [2018-04-09 19:55:46,266 INFO L133 SettingsManager]: * Parallel states before merging=1 [2018-04-09 19:55:46,266 INFO L133 SettingsManager]: * Use the RCFG-of-the-future interface=true [2018-04-09 19:55:46,267 INFO L131 SettingsManager]: Preferences of LTL2Aut differ from their defaults: [2018-04-09 19:55:46,267 INFO L133 SettingsManager]: * Property to check=[] a a: x > 42 [2018-04-09 19:55:46,267 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-04-09 19:55:46,267 INFO L133 SettingsManager]: * sizeof long=4 [2018-04-09 19:55:46,267 INFO L133 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2018-04-09 19:55:46,267 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-04-09 19:55:46,268 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-04-09 19:55:46,268 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-04-09 19:55:46,268 INFO L133 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2018-04-09 19:55:46,268 INFO L133 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2018-04-09 19:55:46,268 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-04-09 19:55:46,268 INFO L133 SettingsManager]: * sizeof long double=12 [2018-04-09 19:55:46,269 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-04-09 19:55:46,269 INFO L133 SettingsManager]: * Size of a code block=SingleStatement [2018-04-09 19:55:46,269 INFO L133 SettingsManager]: * Add additional assume for each assert=false [2018-04-09 19:55:46,269 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-04-09 19:55:46,269 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-04-09 19:55:46,270 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-04-09 19:55:46,270 INFO L133 SettingsManager]: * Interpolant automaton=TWOTRACK [2018-04-09 19:55:46,270 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-04-09 19:55:46,270 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-04-09 19:55:46,270 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-04-09 19:55:46,270 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-04-09 19:55:46,270 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-04-09 19:55:46,271 INFO L131 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2018-04-09 19:55:46,271 INFO L133 SettingsManager]: * TransformationType=HEAP_SEPARATOR [2018-04-09 19:55:46,272 INFO L131 SettingsManager]: Preferences of Boogie Printer differ from their defaults: [2018-04-09 19:55:46,272 INFO L133 SettingsManager]: * Dump path:=C:\Users\alex\AppData\Local\Temp\ [2018-04-09 19:55:46,303 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-04-09 19:55:46,313 INFO L266 ainManager$Toolchain]: [Toolchain 1]: Parser(s) successfully (re)initialized [2018-04-09 19:55:46,316 INFO L222 ainManager$Toolchain]: [Toolchain 1]: Toolchain data selected. [2018-04-09 19:55:46,317 INFO L271 PluginConnector]: Initializing CDTParser... [2018-04-09 19:55:46,317 INFO L276 PluginConnector]: CDTParser initialized [2018-04-09 19:55:46,318 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/array-memsafety/cstrncat-alloca_true-valid-memsafety_true-termination.i [2018-04-09 19:55:46,676 INFO L225 CDTParser]: Created temporary CDT project at /storage/ultimate/releaseScripts/default/UAutomizer-linux/data/FLAG46dd6085a [2018-04-09 19:55:46,846 INFO L287 CDTParser]: IsIndexed: true [2018-04-09 19:55:46,846 INFO L288 CDTParser]: Found 1 translation units. [2018-04-09 19:55:46,846 INFO L168 CDTParser]: Scanning cstrncat-alloca_true-valid-memsafety_true-termination.i [2018-04-09 19:55:46,857 INFO L210 ultiparseSymbolTable]: Include resolver: [2018-04-09 19:55:46,858 INFO L215 ultiparseSymbolTable]: [2018-04-09 19:55:46,858 INFO L218 ultiparseSymbolTable]: Function table: [2018-04-09 19:55:46,858 INFO L221 ultiparseSymbolTable]: Function definition of __U_MULTI_fcstrncat_alloca_true_valid_memsafety_true_termination_i____bswap_64 ('__bswap_64') in cstrncat-alloca_true-valid-memsafety_true-termination.i [2018-04-09 19:55:46,858 INFO L221 ultiparseSymbolTable]: Function definition of null ('main') in cstrncat-alloca_true-valid-memsafety_true-termination.i [2018-04-09 19:55:46,858 INFO L221 ultiparseSymbolTable]: Function definition of __U_MULTI_fcstrncat_alloca_true_valid_memsafety_true_termination_i____bswap_32 ('__bswap_32') in cstrncat-alloca_true-valid-memsafety_true-termination.i [2018-04-09 19:55:46,858 INFO L221 ultiparseSymbolTable]: Function definition of __U_MULTI_fcstrncat_alloca_true_valid_memsafety_true_termination_i__ ('') in cstrncat-alloca_true-valid-memsafety_true-termination.i [2018-04-09 19:55:46,858 INFO L227 ultiparseSymbolTable]: Global variable table: [2018-04-09 19:55:46,858 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fcstrncat_alloca_true_valid_memsafety_true_termination_i__u_quad_t in cstrncat-alloca_true-valid-memsafety_true-termination.i [2018-04-09 19:55:46,859 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fcstrncat_alloca_true_valid_memsafety_true_termination_i____u_char in cstrncat-alloca_true-valid-memsafety_true-termination.i [2018-04-09 19:55:46,859 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fcstrncat_alloca_true_valid_memsafety_true_termination_i____off64_t in cstrncat-alloca_true-valid-memsafety_true-termination.i [2018-04-09 19:55:46,859 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fcstrncat_alloca_true_valid_memsafety_true_termination_i__u_int32_t in cstrncat-alloca_true-valid-memsafety_true-termination.i [2018-04-09 19:55:46,859 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fcstrncat_alloca_true_valid_memsafety_true_termination_i__pthread_key_t in cstrncat-alloca_true-valid-memsafety_true-termination.i [2018-04-09 19:55:46,859 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fcstrncat_alloca_true_valid_memsafety_true_termination_i____id_t in cstrncat-alloca_true-valid-memsafety_true-termination.i [2018-04-09 19:55:46,859 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fcstrncat_alloca_true_valid_memsafety_true_termination_i__sigset_t in cstrncat-alloca_true-valid-memsafety_true-termination.i [2018-04-09 19:55:46,859 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fcstrncat_alloca_true_valid_memsafety_true_termination_i____syscall_ulong_t in cstrncat-alloca_true-valid-memsafety_true-termination.i [2018-04-09 19:55:46,860 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fcstrncat_alloca_true_valid_memsafety_true_termination_i____rlim64_t in cstrncat-alloca_true-valid-memsafety_true-termination.i [2018-04-09 19:55:46,860 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fcstrncat_alloca_true_valid_memsafety_true_termination_i____blksize_t in cstrncat-alloca_true-valid-memsafety_true-termination.i [2018-04-09 19:55:46,860 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fcstrncat_alloca_true_valid_memsafety_true_termination_i____uint32_t in cstrncat-alloca_true-valid-memsafety_true-termination.i [2018-04-09 19:55:46,860 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fcstrncat_alloca_true_valid_memsafety_true_termination_i__blksize_t in cstrncat-alloca_true-valid-memsafety_true-termination.i [2018-04-09 19:55:46,860 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fcstrncat_alloca_true_valid_memsafety_true_termination_i____u_long in cstrncat-alloca_true-valid-memsafety_true-termination.i [2018-04-09 19:55:46,860 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fcstrncat_alloca_true_valid_memsafety_true_termination_i____qaddr_t in cstrncat-alloca_true-valid-memsafety_true-termination.i [2018-04-09 19:55:46,860 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fcstrncat_alloca_true_valid_memsafety_true_termination_i__fsblkcnt_t in cstrncat-alloca_true-valid-memsafety_true-termination.i [2018-04-09 19:55:46,860 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fcstrncat_alloca_true_valid_memsafety_true_termination_i____int32_t in cstrncat-alloca_true-valid-memsafety_true-termination.i [2018-04-09 19:55:46,860 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fcstrncat_alloca_true_valid_memsafety_true_termination_i__ulong in cstrncat-alloca_true-valid-memsafety_true-termination.i [2018-04-09 19:55:46,861 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fcstrncat_alloca_true_valid_memsafety_true_termination_i__daddr_t in cstrncat-alloca_true-valid-memsafety_true-termination.i [2018-04-09 19:55:46,861 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fcstrncat_alloca_true_valid_memsafety_true_termination_i__clock_t in cstrncat-alloca_true-valid-memsafety_true-termination.i [2018-04-09 19:55:46,861 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fcstrncat_alloca_true_valid_memsafety_true_termination_i____dev_t in cstrncat-alloca_true-valid-memsafety_true-termination.i [2018-04-09 19:55:46,861 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fcstrncat_alloca_true_valid_memsafety_true_termination_i__key_t in cstrncat-alloca_true-valid-memsafety_true-termination.i [2018-04-09 19:55:46,861 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fcstrncat_alloca_true_valid_memsafety_true_termination_i__pthread_rwlockattr_t in cstrncat-alloca_true-valid-memsafety_true-termination.i [2018-04-09 19:55:46,861 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fcstrncat_alloca_true_valid_memsafety_true_termination_i__mode_t in cstrncat-alloca_true-valid-memsafety_true-termination.i [2018-04-09 19:55:46,861 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fcstrncat_alloca_true_valid_memsafety_true_termination_i__u_long in cstrncat-alloca_true-valid-memsafety_true-termination.i [2018-04-09 19:55:46,861 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fcstrncat_alloca_true_valid_memsafety_true_termination_i____u_short in cstrncat-alloca_true-valid-memsafety_true-termination.i [2018-04-09 19:55:46,862 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fcstrncat_alloca_true_valid_memsafety_true_termination_i____off_t in cstrncat-alloca_true-valid-memsafety_true-termination.i [2018-04-09 19:55:46,862 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fcstrncat_alloca_true_valid_memsafety_true_termination_i____caddr_t in cstrncat-alloca_true-valid-memsafety_true-termination.i [2018-04-09 19:55:46,862 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fcstrncat_alloca_true_valid_memsafety_true_termination_i__fd_set in cstrncat-alloca_true-valid-memsafety_true-termination.i [2018-04-09 19:55:46,862 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fcstrncat_alloca_true_valid_memsafety_true_termination_i__size_t in cstrncat-alloca_true-valid-memsafety_true-termination.i [2018-04-09 19:55:46,862 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fcstrncat_alloca_true_valid_memsafety_true_termination_i__pthread_barrier_t in cstrncat-alloca_true-valid-memsafety_true-termination.i [2018-04-09 19:55:46,862 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fcstrncat_alloca_true_valid_memsafety_true_termination_i____intptr_t in cstrncat-alloca_true-valid-memsafety_true-termination.i [2018-04-09 19:55:46,862 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fcstrncat_alloca_true_valid_memsafety_true_termination_i____u_quad_t in cstrncat-alloca_true-valid-memsafety_true-termination.i [2018-04-09 19:55:46,862 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fcstrncat_alloca_true_valid_memsafety_true_termination_i____pid_t in cstrncat-alloca_true-valid-memsafety_true-termination.i [2018-04-09 19:55:46,863 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fcstrncat_alloca_true_valid_memsafety_true_termination_i____ino_t in cstrncat-alloca_true-valid-memsafety_true-termination.i [2018-04-09 19:55:46,863 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fcstrncat_alloca_true_valid_memsafety_true_termination_i__pthread_mutexattr_t in cstrncat-alloca_true-valid-memsafety_true-termination.i [2018-04-09 19:55:46,863 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fcstrncat_alloca_true_valid_memsafety_true_termination_i____quad_t in cstrncat-alloca_true-valid-memsafety_true-termination.i [2018-04-09 19:55:46,863 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fcstrncat_alloca_true_valid_memsafety_true_termination_i____fsid_t in cstrncat-alloca_true-valid-memsafety_true-termination.i [2018-04-09 19:55:46,863 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fcstrncat_alloca_true_valid_memsafety_true_termination_i__u_int in cstrncat-alloca_true-valid-memsafety_true-termination.i [2018-04-09 19:55:46,863 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fcstrncat_alloca_true_valid_memsafety_true_termination_i__pthread_cond_t in cstrncat-alloca_true-valid-memsafety_true-termination.i [2018-04-09 19:55:46,863 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fcstrncat_alloca_true_valid_memsafety_true_termination_i__caddr_t in cstrncat-alloca_true-valid-memsafety_true-termination.i [2018-04-09 19:55:46,863 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fcstrncat_alloca_true_valid_memsafety_true_termination_i____sigset_t in cstrncat-alloca_true-valid-memsafety_true-termination.i [2018-04-09 19:55:46,864 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fcstrncat_alloca_true_valid_memsafety_true_termination_i____gid_t in cstrncat-alloca_true-valid-memsafety_true-termination.i [2018-04-09 19:55:46,864 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fcstrncat_alloca_true_valid_memsafety_true_termination_i__pthread_spinlock_t in cstrncat-alloca_true-valid-memsafety_true-termination.i [2018-04-09 19:55:46,864 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fcstrncat_alloca_true_valid_memsafety_true_termination_i____mode_t in cstrncat-alloca_true-valid-memsafety_true-termination.i [2018-04-09 19:55:46,864 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fcstrncat_alloca_true_valid_memsafety_true_termination_i____timer_t in cstrncat-alloca_true-valid-memsafety_true-termination.i [2018-04-09 19:55:46,864 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fcstrncat_alloca_true_valid_memsafety_true_termination_i__off_t in cstrncat-alloca_true-valid-memsafety_true-termination.i [2018-04-09 19:55:46,864 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fcstrncat_alloca_true_valid_memsafety_true_termination_i____int16_t in cstrncat-alloca_true-valid-memsafety_true-termination.i [2018-04-09 19:55:46,864 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fcstrncat_alloca_true_valid_memsafety_true_termination_i__div_t in cstrncat-alloca_true-valid-memsafety_true-termination.i [2018-04-09 19:55:46,864 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fcstrncat_alloca_true_valid_memsafety_true_termination_i__u_char in cstrncat-alloca_true-valid-memsafety_true-termination.i [2018-04-09 19:55:46,864 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fcstrncat_alloca_true_valid_memsafety_true_termination_i____clockid_t in cstrncat-alloca_true-valid-memsafety_true-termination.i [2018-04-09 19:55:46,865 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fcstrncat_alloca_true_valid_memsafety_true_termination_i__u_int16_t in cstrncat-alloca_true-valid-memsafety_true-termination.i [2018-04-09 19:55:46,865 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fcstrncat_alloca_true_valid_memsafety_true_termination_i__quad_t in cstrncat-alloca_true-valid-memsafety_true-termination.i [2018-04-09 19:55:46,865 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fcstrncat_alloca_true_valid_memsafety_true_termination_i____suseconds_t in cstrncat-alloca_true-valid-memsafety_true-termination.i [2018-04-09 19:55:46,865 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fcstrncat_alloca_true_valid_memsafety_true_termination_i__blkcnt_t in cstrncat-alloca_true-valid-memsafety_true-termination.i [2018-04-09 19:55:46,865 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fcstrncat_alloca_true_valid_memsafety_true_termination_i__lldiv_t in cstrncat-alloca_true-valid-memsafety_true-termination.i [2018-04-09 19:55:46,865 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fcstrncat_alloca_true_valid_memsafety_true_termination_i____pthread_list_t in cstrncat-alloca_true-valid-memsafety_true-termination.i [2018-04-09 19:55:46,865 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fcstrncat_alloca_true_valid_memsafety_true_termination_i____socklen_t in cstrncat-alloca_true-valid-memsafety_true-termination.i [2018-04-09 19:55:46,865 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fcstrncat_alloca_true_valid_memsafety_true_termination_i__uid_t in cstrncat-alloca_true-valid-memsafety_true-termination.i [2018-04-09 19:55:46,865 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fcstrncat_alloca_true_valid_memsafety_true_termination_i__int16_t in cstrncat-alloca_true-valid-memsafety_true-termination.i [2018-04-09 19:55:46,865 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fcstrncat_alloca_true_valid_memsafety_true_termination_i__wchar_t in cstrncat-alloca_true-valid-memsafety_true-termination.i [2018-04-09 19:55:46,865 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fcstrncat_alloca_true_valid_memsafety_true_termination_i____rlim_t in cstrncat-alloca_true-valid-memsafety_true-termination.i [2018-04-09 19:55:46,865 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fcstrncat_alloca_true_valid_memsafety_true_termination_i____uid_t in cstrncat-alloca_true-valid-memsafety_true-termination.i [2018-04-09 19:55:46,865 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fcstrncat_alloca_true_valid_memsafety_true_termination_i__pthread_attr_t in cstrncat-alloca_true-valid-memsafety_true-termination.i [2018-04-09 19:55:46,865 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fcstrncat_alloca_true_valid_memsafety_true_termination_i____sig_atomic_t in cstrncat-alloca_true-valid-memsafety_true-termination.i [2018-04-09 19:55:46,866 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fcstrncat_alloca_true_valid_memsafety_true_termination_i__ssize_t in cstrncat-alloca_true-valid-memsafety_true-termination.i [2018-04-09 19:55:46,866 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fcstrncat_alloca_true_valid_memsafety_true_termination_i____fsblkcnt64_t in cstrncat-alloca_true-valid-memsafety_true-termination.i [2018-04-09 19:55:46,866 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fcstrncat_alloca_true_valid_memsafety_true_termination_i____fd_mask in cstrncat-alloca_true-valid-memsafety_true-termination.i [2018-04-09 19:55:46,866 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fcstrncat_alloca_true_valid_memsafety_true_termination_i__pthread_t in cstrncat-alloca_true-valid-memsafety_true-termination.i [2018-04-09 19:55:46,866 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fcstrncat_alloca_true_valid_memsafety_true_termination_i__id_t in cstrncat-alloca_true-valid-memsafety_true-termination.i [2018-04-09 19:55:46,866 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fcstrncat_alloca_true_valid_memsafety_true_termination_i__pthread_condattr_t in cstrncat-alloca_true-valid-memsafety_true-termination.i [2018-04-09 19:55:46,866 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fcstrncat_alloca_true_valid_memsafety_true_termination_i__pthread_once_t in cstrncat-alloca_true-valid-memsafety_true-termination.i [2018-04-09 19:55:46,866 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fcstrncat_alloca_true_valid_memsafety_true_termination_i__u_short in cstrncat-alloca_true-valid-memsafety_true-termination.i [2018-04-09 19:55:46,866 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fcstrncat_alloca_true_valid_memsafety_true_termination_i__gid_t in cstrncat-alloca_true-valid-memsafety_true-termination.i [2018-04-09 19:55:46,866 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fcstrncat_alloca_true_valid_memsafety_true_termination_i____nlink_t in cstrncat-alloca_true-valid-memsafety_true-termination.i [2018-04-09 19:55:46,866 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fcstrncat_alloca_true_valid_memsafety_true_termination_i____clock_t in cstrncat-alloca_true-valid-memsafety_true-termination.i [2018-04-09 19:55:46,866 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fcstrncat_alloca_true_valid_memsafety_true_termination_i__u_int8_t in cstrncat-alloca_true-valid-memsafety_true-termination.i [2018-04-09 19:55:46,866 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fcstrncat_alloca_true_valid_memsafety_true_termination_i__clockid_t in cstrncat-alloca_true-valid-memsafety_true-termination.i [2018-04-09 19:55:46,866 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fcstrncat_alloca_true_valid_memsafety_true_termination_i__uint in cstrncat-alloca_true-valid-memsafety_true-termination.i [2018-04-09 19:55:46,866 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fcstrncat_alloca_true_valid_memsafety_true_termination_i____int8_t in cstrncat-alloca_true-valid-memsafety_true-termination.i [2018-04-09 19:55:46,867 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fcstrncat_alloca_true_valid_memsafety_true_termination_i__int32_t in cstrncat-alloca_true-valid-memsafety_true-termination.i [2018-04-09 19:55:46,867 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fcstrncat_alloca_true_valid_memsafety_true_termination_i__nlink_t in cstrncat-alloca_true-valid-memsafety_true-termination.i [2018-04-09 19:55:46,867 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fcstrncat_alloca_true_valid_memsafety_true_termination_i__pid_t in cstrncat-alloca_true-valid-memsafety_true-termination.i [2018-04-09 19:55:46,867 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fcstrncat_alloca_true_valid_memsafety_true_termination_i__fsfilcnt_t in cstrncat-alloca_true-valid-memsafety_true-termination.i [2018-04-09 19:55:46,867 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fcstrncat_alloca_true_valid_memsafety_true_termination_i__timer_t in cstrncat-alloca_true-valid-memsafety_true-termination.i [2018-04-09 19:55:46,867 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fcstrncat_alloca_true_valid_memsafety_true_termination_i____ssize_t in cstrncat-alloca_true-valid-memsafety_true-termination.i [2018-04-09 19:55:46,867 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fcstrncat_alloca_true_valid_memsafety_true_termination_i____uint64_t in cstrncat-alloca_true-valid-memsafety_true-termination.i [2018-04-09 19:55:46,867 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fcstrncat_alloca_true_valid_memsafety_true_termination_i____fsword_t in cstrncat-alloca_true-valid-memsafety_true-termination.i [2018-04-09 19:55:46,867 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fcstrncat_alloca_true_valid_memsafety_true_termination_i____blkcnt64_t in cstrncat-alloca_true-valid-memsafety_true-termination.i [2018-04-09 19:55:46,867 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fcstrncat_alloca_true_valid_memsafety_true_termination_i__suseconds_t in cstrncat-alloca_true-valid-memsafety_true-termination.i [2018-04-09 19:55:46,867 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fcstrncat_alloca_true_valid_memsafety_true_termination_i__fd_mask in cstrncat-alloca_true-valid-memsafety_true-termination.i [2018-04-09 19:55:46,867 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fcstrncat_alloca_true_valid_memsafety_true_termination_i____syscall_slong_t in cstrncat-alloca_true-valid-memsafety_true-termination.i [2018-04-09 19:55:46,867 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fcstrncat_alloca_true_valid_memsafety_true_termination_i__ushort in cstrncat-alloca_true-valid-memsafety_true-termination.i [2018-04-09 19:55:46,867 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fcstrncat_alloca_true_valid_memsafety_true_termination_i____ino64_t in cstrncat-alloca_true-valid-memsafety_true-termination.i [2018-04-09 19:55:46,867 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fcstrncat_alloca_true_valid_memsafety_true_termination_i____loff_t in cstrncat-alloca_true-valid-memsafety_true-termination.i [2018-04-09 19:55:46,867 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fcstrncat_alloca_true_valid_memsafety_true_termination_i____time_t in cstrncat-alloca_true-valid-memsafety_true-termination.i [2018-04-09 19:55:46,868 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fcstrncat_alloca_true_valid_memsafety_true_termination_i__int8_t in cstrncat-alloca_true-valid-memsafety_true-termination.i [2018-04-09 19:55:46,868 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fcstrncat_alloca_true_valid_memsafety_true_termination_i____uint16_t in cstrncat-alloca_true-valid-memsafety_true-termination.i [2018-04-09 19:55:46,868 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fcstrncat_alloca_true_valid_memsafety_true_termination_i____blkcnt_t in cstrncat-alloca_true-valid-memsafety_true-termination.i [2018-04-09 19:55:46,868 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fcstrncat_alloca_true_valid_memsafety_true_termination_i__fsid_t in cstrncat-alloca_true-valid-memsafety_true-termination.i [2018-04-09 19:55:46,868 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fcstrncat_alloca_true_valid_memsafety_true_termination_i____fsfilcnt_t in cstrncat-alloca_true-valid-memsafety_true-termination.i [2018-04-09 19:55:46,868 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fcstrncat_alloca_true_valid_memsafety_true_termination_i____daddr_t in cstrncat-alloca_true-valid-memsafety_true-termination.i [2018-04-09 19:55:46,868 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fcstrncat_alloca_true_valid_memsafety_true_termination_i____WAIT_STATUS in cstrncat-alloca_true-valid-memsafety_true-termination.i [2018-04-09 19:55:46,868 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fcstrncat_alloca_true_valid_memsafety_true_termination_i__int64_t in cstrncat-alloca_true-valid-memsafety_true-termination.i [2018-04-09 19:55:46,868 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fcstrncat_alloca_true_valid_memsafety_true_termination_i____uint8_t in cstrncat-alloca_true-valid-memsafety_true-termination.i [2018-04-09 19:55:46,868 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fcstrncat_alloca_true_valid_memsafety_true_termination_i____key_t in cstrncat-alloca_true-valid-memsafety_true-termination.i [2018-04-09 19:55:46,868 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fcstrncat_alloca_true_valid_memsafety_true_termination_i__dev_t in cstrncat-alloca_true-valid-memsafety_true-termination.i [2018-04-09 19:55:46,868 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fcstrncat_alloca_true_valid_memsafety_true_termination_i__ldiv_t in cstrncat-alloca_true-valid-memsafety_true-termination.i [2018-04-09 19:55:46,869 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fcstrncat_alloca_true_valid_memsafety_true_termination_i__u_int64_t in cstrncat-alloca_true-valid-memsafety_true-termination.i [2018-04-09 19:55:46,869 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fcstrncat_alloca_true_valid_memsafety_true_termination_i__loff_t in cstrncat-alloca_true-valid-memsafety_true-termination.i [2018-04-09 19:55:46,869 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fcstrncat_alloca_true_valid_memsafety_true_termination_i__pthread_rwlock_t in cstrncat-alloca_true-valid-memsafety_true-termination.i [2018-04-09 19:55:46,869 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fcstrncat_alloca_true_valid_memsafety_true_termination_i____u_int in cstrncat-alloca_true-valid-memsafety_true-termination.i [2018-04-09 19:55:46,869 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fcstrncat_alloca_true_valid_memsafety_true_termination_i__time_t in cstrncat-alloca_true-valid-memsafety_true-termination.i [2018-04-09 19:55:46,869 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fcstrncat_alloca_true_valid_memsafety_true_termination_i__ino_t in cstrncat-alloca_true-valid-memsafety_true-termination.i [2018-04-09 19:55:46,869 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fcstrncat_alloca_true_valid_memsafety_true_termination_i__pthread_barrierattr_t in cstrncat-alloca_true-valid-memsafety_true-termination.i [2018-04-09 19:55:46,869 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fcstrncat_alloca_true_valid_memsafety_true_termination_i____fsblkcnt_t in cstrncat-alloca_true-valid-memsafety_true-termination.i [2018-04-09 19:55:46,869 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fcstrncat_alloca_true_valid_memsafety_true_termination_i____int64_t in cstrncat-alloca_true-valid-memsafety_true-termination.i [2018-04-09 19:55:46,870 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fcstrncat_alloca_true_valid_memsafety_true_termination_i____useconds_t in cstrncat-alloca_true-valid-memsafety_true-termination.i [2018-04-09 19:55:46,870 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fcstrncat_alloca_true_valid_memsafety_true_termination_i__register_t in cstrncat-alloca_true-valid-memsafety_true-termination.i [2018-04-09 19:55:46,870 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fcstrncat_alloca_true_valid_memsafety_true_termination_i__pthread_mutex_t in cstrncat-alloca_true-valid-memsafety_true-termination.i [2018-04-09 19:55:46,870 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fcstrncat_alloca_true_valid_memsafety_true_termination_i____fsfilcnt64_t in cstrncat-alloca_true-valid-memsafety_true-termination.i [2018-04-09 19:55:46,890 INFO L330 CDTParser]: Deleted temporary CDT project at /storage/ultimate/releaseScripts/default/UAutomizer-linux/data/FLAG46dd6085a [2018-04-09 19:55:46,894 INFO L304 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-04-09 19:55:46,896 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2018-04-09 19:55:46,897 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-04-09 19:55:46,897 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-04-09 19:55:46,902 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-04-09 19:55:46,903 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.04 07:55:46" (1/1) ... [2018-04-09 19:55:46,905 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@14e4ddc6 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.04 07:55:46, skipping insertion in model container [2018-04-09 19:55:46,905 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.04 07:55:46" (1/1) ... [2018-04-09 19:55:46,918 INFO L167 Dispatcher]: Using SV-COMP mode [2018-04-09 19:55:46,948 INFO L167 Dispatcher]: Using SV-COMP mode [2018-04-09 19:55:47,101 INFO L175 PostProcessor]: Settings: Checked method=main [2018-04-09 19:55:47,149 INFO L175 PostProcessor]: Settings: Checked method=main [2018-04-09 19:55:47,157 INFO L100 SccComputation]: Graph consists of 0 InCaSumBalls and 112 non ball SCCs. Number of states in SCCs 112. [2018-04-09 19:55:47,202 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.04 07:55:47 WrapperNode [2018-04-09 19:55:47,202 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-04-09 19:55:47,203 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-04-09 19:55:47,204 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-04-09 19:55:47,204 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-04-09 19:55:47,219 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.04 07:55:47" (1/1) ... [2018-04-09 19:55:47,220 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.04 07:55:47" (1/1) ... [2018-04-09 19:55:47,237 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.04 07:55:47" (1/1) ... [2018-04-09 19:55:47,237 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.04 07:55:47" (1/1) ... [2018-04-09 19:55:47,250 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.04 07:55:47" (1/1) ... [2018-04-09 19:55:47,256 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.04 07:55:47" (1/1) ... [2018-04-09 19:55:47,260 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.04 07:55:47" (1/1) ... [2018-04-09 19:55:47,265 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-04-09 19:55:47,266 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-04-09 19:55:47,266 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-04-09 19:55:47,266 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-04-09 19:55:47,267 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.04 07:55:47" (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-04-09 19:55:47,403 INFO L136 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-04-09 19:55:47,403 INFO L136 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-04-09 19:55:47,403 INFO L136 BoogieDeclarations]: Found implementation of procedure __U_MULTI_fcstrncat_alloca_true_valid_memsafety_true_termination_i____bswap_32 [2018-04-09 19:55:47,403 INFO L136 BoogieDeclarations]: Found implementation of procedure __U_MULTI_fcstrncat_alloca_true_valid_memsafety_true_termination_i____bswap_64 [2018-04-09 19:55:47,403 INFO L136 BoogieDeclarations]: Found implementation of procedure cstrncat [2018-04-09 19:55:47,403 INFO L136 BoogieDeclarations]: Found implementation of procedure main [2018-04-09 19:55:47,403 INFO L128 BoogieDeclarations]: Found specification of procedure __U_MULTI_fcstrncat_alloca_true_valid_memsafety_true_termination_i____bswap_32 [2018-04-09 19:55:47,403 INFO L128 BoogieDeclarations]: Found specification of procedure __U_MULTI_fcstrncat_alloca_true_valid_memsafety_true_termination_i____bswap_64 [2018-04-09 19:55:47,404 INFO L128 BoogieDeclarations]: Found specification of procedure __ctype_get_mb_cur_max [2018-04-09 19:55:47,404 INFO L128 BoogieDeclarations]: Found specification of procedure atof [2018-04-09 19:55:47,404 INFO L128 BoogieDeclarations]: Found specification of procedure atoi [2018-04-09 19:55:47,404 INFO L128 BoogieDeclarations]: Found specification of procedure atol [2018-04-09 19:55:47,404 INFO L128 BoogieDeclarations]: Found specification of procedure atoll [2018-04-09 19:55:47,404 INFO L128 BoogieDeclarations]: Found specification of procedure strtod [2018-04-09 19:55:47,404 INFO L128 BoogieDeclarations]: Found specification of procedure strtof [2018-04-09 19:55:47,405 INFO L128 BoogieDeclarations]: Found specification of procedure strtold [2018-04-09 19:55:47,405 INFO L128 BoogieDeclarations]: Found specification of procedure strtol [2018-04-09 19:55:47,405 INFO L128 BoogieDeclarations]: Found specification of procedure strtoul [2018-04-09 19:55:47,405 INFO L128 BoogieDeclarations]: Found specification of procedure strtoq [2018-04-09 19:55:47,405 INFO L128 BoogieDeclarations]: Found specification of procedure strtouq [2018-04-09 19:55:47,405 INFO L128 BoogieDeclarations]: Found specification of procedure strtoll [2018-04-09 19:55:47,405 INFO L128 BoogieDeclarations]: Found specification of procedure strtoull [2018-04-09 19:55:47,406 INFO L128 BoogieDeclarations]: Found specification of procedure l64a [2018-04-09 19:55:47,406 INFO L128 BoogieDeclarations]: Found specification of procedure a64l [2018-04-09 19:55:47,406 INFO L128 BoogieDeclarations]: Found specification of procedure select [2018-04-09 19:55:47,406 INFO L128 BoogieDeclarations]: Found specification of procedure pselect [2018-04-09 19:55:47,406 INFO L128 BoogieDeclarations]: Found specification of procedure gnu_dev_major [2018-04-09 19:55:47,406 INFO L128 BoogieDeclarations]: Found specification of procedure gnu_dev_minor [2018-04-09 19:55:47,406 INFO L128 BoogieDeclarations]: Found specification of procedure gnu_dev_makedev [2018-04-09 19:55:47,407 INFO L128 BoogieDeclarations]: Found specification of procedure random [2018-04-09 19:55:47,407 INFO L128 BoogieDeclarations]: Found specification of procedure srandom [2018-04-09 19:55:47,407 INFO L128 BoogieDeclarations]: Found specification of procedure initstate [2018-04-09 19:55:47,407 INFO L128 BoogieDeclarations]: Found specification of procedure setstate [2018-04-09 19:55:47,407 INFO L128 BoogieDeclarations]: Found specification of procedure random_r [2018-04-09 19:55:47,407 INFO L128 BoogieDeclarations]: Found specification of procedure srandom_r [2018-04-09 19:55:47,407 INFO L128 BoogieDeclarations]: Found specification of procedure initstate_r [2018-04-09 19:55:47,407 INFO L128 BoogieDeclarations]: Found specification of procedure setstate_r [2018-04-09 19:55:47,407 INFO L128 BoogieDeclarations]: Found specification of procedure rand [2018-04-09 19:55:47,407 INFO L128 BoogieDeclarations]: Found specification of procedure srand [2018-04-09 19:55:47,407 INFO L128 BoogieDeclarations]: Found specification of procedure rand_r [2018-04-09 19:55:47,408 INFO L128 BoogieDeclarations]: Found specification of procedure drand48 [2018-04-09 19:55:47,408 INFO L128 BoogieDeclarations]: Found specification of procedure erand48 [2018-04-09 19:55:47,408 INFO L128 BoogieDeclarations]: Found specification of procedure lrand48 [2018-04-09 19:55:47,408 INFO L128 BoogieDeclarations]: Found specification of procedure nrand48 [2018-04-09 19:55:47,408 INFO L128 BoogieDeclarations]: Found specification of procedure mrand48 [2018-04-09 19:55:47,408 INFO L128 BoogieDeclarations]: Found specification of procedure jrand48 [2018-04-09 19:55:47,408 INFO L128 BoogieDeclarations]: Found specification of procedure srand48 [2018-04-09 19:55:47,408 INFO L128 BoogieDeclarations]: Found specification of procedure seed48 [2018-04-09 19:55:47,409 INFO L128 BoogieDeclarations]: Found specification of procedure lcong48 [2018-04-09 19:55:47,409 INFO L128 BoogieDeclarations]: Found specification of procedure drand48_r [2018-04-09 19:55:47,409 INFO L128 BoogieDeclarations]: Found specification of procedure erand48_r [2018-04-09 19:55:47,409 INFO L128 BoogieDeclarations]: Found specification of procedure lrand48_r [2018-04-09 19:55:47,409 INFO L128 BoogieDeclarations]: Found specification of procedure nrand48_r [2018-04-09 19:55:47,409 INFO L128 BoogieDeclarations]: Found specification of procedure mrand48_r [2018-04-09 19:55:47,409 INFO L128 BoogieDeclarations]: Found specification of procedure jrand48_r [2018-04-09 19:55:47,409 INFO L128 BoogieDeclarations]: Found specification of procedure srand48_r [2018-04-09 19:55:47,409 INFO L128 BoogieDeclarations]: Found specification of procedure seed48_r [2018-04-09 19:55:47,409 INFO L128 BoogieDeclarations]: Found specification of procedure lcong48_r [2018-04-09 19:55:47,409 INFO L128 BoogieDeclarations]: Found specification of procedure malloc [2018-04-09 19:55:47,410 INFO L128 BoogieDeclarations]: Found specification of procedure calloc [2018-04-09 19:55:47,410 INFO L128 BoogieDeclarations]: Found specification of procedure realloc [2018-04-09 19:55:47,410 INFO L128 BoogieDeclarations]: Found specification of procedure free [2018-04-09 19:55:47,410 INFO L128 BoogieDeclarations]: Found specification of procedure cfree [2018-04-09 19:55:47,410 INFO L128 BoogieDeclarations]: Found specification of procedure alloca [2018-04-09 19:55:47,410 INFO L128 BoogieDeclarations]: Found specification of procedure valloc [2018-04-09 19:55:47,410 INFO L128 BoogieDeclarations]: Found specification of procedure posix_memalign [2018-04-09 19:55:47,410 INFO L128 BoogieDeclarations]: Found specification of procedure abort [2018-04-09 19:55:47,410 INFO L128 BoogieDeclarations]: Found specification of procedure atexit [2018-04-09 19:55:47,410 INFO L128 BoogieDeclarations]: Found specification of procedure on_exit [2018-04-09 19:55:47,410 INFO L128 BoogieDeclarations]: Found specification of procedure exit [2018-04-09 19:55:47,410 INFO L128 BoogieDeclarations]: Found specification of procedure _Exit [2018-04-09 19:55:47,410 INFO L128 BoogieDeclarations]: Found specification of procedure getenv [2018-04-09 19:55:47,411 INFO L128 BoogieDeclarations]: Found specification of procedure putenv [2018-04-09 19:55:47,411 INFO L128 BoogieDeclarations]: Found specification of procedure setenv [2018-04-09 19:55:47,411 INFO L128 BoogieDeclarations]: Found specification of procedure unsetenv [2018-04-09 19:55:47,411 INFO L128 BoogieDeclarations]: Found specification of procedure clearenv [2018-04-09 19:55:47,411 INFO L128 BoogieDeclarations]: Found specification of procedure mktemp [2018-04-09 19:55:47,411 INFO L128 BoogieDeclarations]: Found specification of procedure mkstemp [2018-04-09 19:55:47,411 INFO L128 BoogieDeclarations]: Found specification of procedure mkstemps [2018-04-09 19:55:47,411 INFO L128 BoogieDeclarations]: Found specification of procedure mkdtemp [2018-04-09 19:55:47,411 INFO L128 BoogieDeclarations]: Found specification of procedure system [2018-04-09 19:55:47,411 INFO L128 BoogieDeclarations]: Found specification of procedure realpath [2018-04-09 19:55:47,411 INFO L128 BoogieDeclarations]: Found specification of procedure bsearch [2018-04-09 19:55:47,411 INFO L128 BoogieDeclarations]: Found specification of procedure qsort [2018-04-09 19:55:47,411 INFO L128 BoogieDeclarations]: Found specification of procedure abs [2018-04-09 19:55:47,412 INFO L128 BoogieDeclarations]: Found specification of procedure labs [2018-04-09 19:55:47,412 INFO L128 BoogieDeclarations]: Found specification of procedure llabs [2018-04-09 19:55:47,412 INFO L128 BoogieDeclarations]: Found specification of procedure div [2018-04-09 19:55:47,412 INFO L128 BoogieDeclarations]: Found specification of procedure ldiv [2018-04-09 19:55:47,412 INFO L128 BoogieDeclarations]: Found specification of procedure lldiv [2018-04-09 19:55:47,412 INFO L128 BoogieDeclarations]: Found specification of procedure ecvt [2018-04-09 19:55:47,412 INFO L128 BoogieDeclarations]: Found specification of procedure fcvt [2018-04-09 19:55:47,413 INFO L128 BoogieDeclarations]: Found specification of procedure gcvt [2018-04-09 19:55:47,413 INFO L128 BoogieDeclarations]: Found specification of procedure qecvt [2018-04-09 19:55:47,413 INFO L128 BoogieDeclarations]: Found specification of procedure qfcvt [2018-04-09 19:55:47,413 INFO L128 BoogieDeclarations]: Found specification of procedure qgcvt [2018-04-09 19:55:47,413 INFO L128 BoogieDeclarations]: Found specification of procedure ecvt_r [2018-04-09 19:55:47,413 INFO L128 BoogieDeclarations]: Found specification of procedure fcvt_r [2018-04-09 19:55:47,413 INFO L128 BoogieDeclarations]: Found specification of procedure qecvt_r [2018-04-09 19:55:47,413 INFO L128 BoogieDeclarations]: Found specification of procedure qfcvt_r [2018-04-09 19:55:47,414 INFO L128 BoogieDeclarations]: Found specification of procedure mblen [2018-04-09 19:55:47,414 INFO L128 BoogieDeclarations]: Found specification of procedure mbtowc [2018-04-09 19:55:47,414 INFO L128 BoogieDeclarations]: Found specification of procedure wctomb [2018-04-09 19:55:47,414 INFO L128 BoogieDeclarations]: Found specification of procedure mbstowcs [2018-04-09 19:55:47,414 INFO L128 BoogieDeclarations]: Found specification of procedure wcstombs [2018-04-09 19:55:47,414 INFO L128 BoogieDeclarations]: Found specification of procedure rpmatch [2018-04-09 19:55:47,414 INFO L128 BoogieDeclarations]: Found specification of procedure getsubopt [2018-04-09 19:55:47,414 INFO L128 BoogieDeclarations]: Found specification of procedure getloadavg [2018-04-09 19:55:47,414 INFO L128 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2018-04-09 19:55:47,415 INFO L128 BoogieDeclarations]: Found specification of procedure cstrncat [2018-04-09 19:55:47,415 INFO L128 BoogieDeclarations]: Found specification of procedure read~int [2018-04-09 19:55:47,415 INFO L128 BoogieDeclarations]: Found specification of procedure write~int [2018-04-09 19:55:47,415 INFO L128 BoogieDeclarations]: Found specification of procedure main [2018-04-09 19:55:47,415 INFO L128 BoogieDeclarations]: Found specification of procedure #Ultimate.alloc [2018-04-09 19:55:47,415 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2018-04-09 19:55:47,415 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-04-09 19:55:47,415 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-04-09 19:55:47,415 INFO L128 BoogieDeclarations]: Found specification of procedure write~unchecked~int [2018-04-09 19:55:47,830 INFO L259 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-04-09 19:55:47,831 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.04 07:55:47 BoogieIcfgContainer [2018-04-09 19:55:47,831 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-04-09 19:55:47,832 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-04-09 19:55:47,832 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-04-09 19:55:47,835 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-04-09 19:55:47,836 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 09.04 07:55:46" (1/3) ... [2018-04-09 19:55:47,837 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@60e709f6 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.04 07:55:47, skipping insertion in model container [2018-04-09 19:55:47,837 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.04 07:55:47" (2/3) ... [2018-04-09 19:55:47,837 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@60e709f6 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.04 07:55:47, skipping insertion in model container [2018-04-09 19:55:47,837 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.04 07:55:47" (3/3) ... [2018-04-09 19:55:47,839 INFO L107 eAbstractionObserver]: Analyzing ICFG cstrncat-alloca_true-valid-memsafety_true-termination.i [2018-04-09 19:55:47,849 INFO L131 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-04-09 19:55:47,857 INFO L143 ceAbstractionStarter]: Appying trace abstraction to program that has 15 error locations. [2018-04-09 19:55:47,898 INFO L128 ementStrategyFactory]: Using default assertion order modulation [2018-04-09 19:55:47,898 INFO L369 AbstractCegarLoop]: Interprodecural is true [2018-04-09 19:55:47,898 INFO L370 AbstractCegarLoop]: Hoare is true [2018-04-09 19:55:47,898 INFO L371 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-04-09 19:55:47,898 INFO L372 AbstractCegarLoop]: Backedges is TWOTRACK [2018-04-09 19:55:47,898 INFO L373 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-04-09 19:55:47,898 INFO L374 AbstractCegarLoop]: Difference is false [2018-04-09 19:55:47,899 INFO L375 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-04-09 19:55:47,899 INFO L380 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-04-09 19:55:47,899 INFO L87 2NestedWordAutomaton]: Mode: main mode - execution starts in main procedure [2018-04-09 19:55:47,912 INFO L276 IsEmpty]: Start isEmpty. Operand 96 states. [2018-04-09 19:55:47,917 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2018-04-09 19:55:47,917 INFO L347 BasicCegarLoop]: Found error trace [2018-04-09 19:55:47,917 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-04-09 19:55:47,918 INFO L408 AbstractCegarLoop]: === Iteration 1 === [mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr4EnsuresViolationMEMORY_LEAK, mainErr0RequiresViolation, cstrncatErr7RequiresViolation, cstrncatErr5RequiresViolation, cstrncatErr0RequiresViolation, cstrncatErr3RequiresViolation, cstrncatErr9RequiresViolation, cstrncatErr1RequiresViolation, cstrncatErr2RequiresViolation, cstrncatErr8RequiresViolation, cstrncatErr6RequiresViolation, cstrncatErr4RequiresViolation]=== [2018-04-09 19:55:47,921 INFO L82 PathProgramCache]: Analyzing trace with hash -1326053013, 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-04-09 19:55:47,933 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-04-09 19:55:47,961 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-09 19:55:47,970 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-09 19:55:47,999 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-09 19:55:47,999 INFO L314 TraceCheckSpWp]: Computing backward predicates... [2018-04-09 19:55:48,013 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-09 19:55:48,035 INFO L320 seRefinementStrategy]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2018-04-09 19:55:48,036 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [2, 2] imperfect sequences [] total 2 [2018-04-09 19:55:48,037 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-04-09 19:55:48,047 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-04-09 19:55:48,048 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-04-09 19:55:48,050 INFO L87 Difference]: Start difference. First operand 96 states. Second operand 3 states. [2018-04-09 19:55:48,198 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-09 19:55:48,198 INFO L93 Difference]: Finished difference Result 145 states and 158 transitions. [2018-04-09 19:55:48,199 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-04-09 19:55:48,200 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 21 [2018-04-09 19:55:48,200 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-09 19:55:48,209 INFO L225 Difference]: With dead ends: 145 [2018-04-09 19:55:48,209 INFO L226 Difference]: Without dead ends: 92 [2018-04-09 19:55:48,212 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 41 GetRequests, 40 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-04-09 19:55:48,227 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 92 states. [2018-04-09 19:55:48,242 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 92 to 92. [2018-04-09 19:55:48,243 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 92 states. [2018-04-09 19:55:48,245 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 92 states to 92 states and 98 transitions. [2018-04-09 19:55:48,246 INFO L78 Accepts]: Start accepts. Automaton has 92 states and 98 transitions. Word has length 21 [2018-04-09 19:55:48,246 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-09 19:55:48,246 INFO L459 AbstractCegarLoop]: Abstraction has 92 states and 98 transitions. [2018-04-09 19:55:48,247 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-04-09 19:55:48,247 INFO L276 IsEmpty]: Start isEmpty. Operand 92 states and 98 transitions. [2018-04-09 19:55:48,247 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2018-04-09 19:55:48,247 INFO L347 BasicCegarLoop]: Found error trace [2018-04-09 19:55:48,247 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] [2018-04-09 19:55:48,247 INFO L408 AbstractCegarLoop]: === Iteration 2 === [mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr4EnsuresViolationMEMORY_LEAK, mainErr0RequiresViolation, cstrncatErr7RequiresViolation, cstrncatErr5RequiresViolation, cstrncatErr0RequiresViolation, cstrncatErr3RequiresViolation, cstrncatErr9RequiresViolation, cstrncatErr1RequiresViolation, cstrncatErr2RequiresViolation, cstrncatErr8RequiresViolation, cstrncatErr6RequiresViolation, cstrncatErr4RequiresViolation]=== [2018-04-09 19:55:48,248 INFO L82 PathProgramCache]: Analyzing trace with hash 722601381, 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-04-09 19:55:48,255 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-04-09 19:55:48,271 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-09 19:55:48,273 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-09 19:55:48,302 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-04-09 19:55:48,304 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-09 19:55:48,306 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-09 19:55:48,306 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:6, output treesize:5 [2018-04-09 19:55:48,326 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 11 [2018-04-09 19:55:48,327 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-09 19:55:48,331 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-04-09 19:55:48,331 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:12, output treesize:11 [2018-04-09 19:55:48,339 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-09 19:55:48,339 INFO L314 TraceCheckSpWp]: Computing backward predicates... [2018-04-09 19:55:48,350 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-09 19:55:48,374 INFO L320 seRefinementStrategy]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2018-04-09 19:55:48,374 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [3, 3] imperfect sequences [] total 3 [2018-04-09 19:55:48,376 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-04-09 19:55:48,376 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-04-09 19:55:48,376 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-04-09 19:55:48,377 INFO L87 Difference]: Start difference. First operand 92 states and 98 transitions. Second operand 4 states. [2018-04-09 19:55:48,507 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-09 19:55:48,508 INFO L93 Difference]: Finished difference Result 92 states and 98 transitions. [2018-04-09 19:55:48,508 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-04-09 19:55:48,508 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 24 [2018-04-09 19:55:48,509 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-09 19:55:48,510 INFO L225 Difference]: With dead ends: 92 [2018-04-09 19:55:48,510 INFO L226 Difference]: Without dead ends: 91 [2018-04-09 19:55:48,511 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 48 GetRequests, 43 SyntacticMatches, 2 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-04-09 19:55:48,512 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 91 states. [2018-04-09 19:55:48,519 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 91 to 91. [2018-04-09 19:55:48,519 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 91 states. [2018-04-09 19:55:48,521 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 91 states to 91 states and 97 transitions. [2018-04-09 19:55:48,522 INFO L78 Accepts]: Start accepts. Automaton has 91 states and 97 transitions. Word has length 24 [2018-04-09 19:55:48,522 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-09 19:55:48,522 INFO L459 AbstractCegarLoop]: Abstraction has 91 states and 97 transitions. [2018-04-09 19:55:48,522 INFO L460 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-04-09 19:55:48,522 INFO L276 IsEmpty]: Start isEmpty. Operand 91 states and 97 transitions. [2018-04-09 19:55:48,523 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2018-04-09 19:55:48,523 INFO L347 BasicCegarLoop]: Found error trace [2018-04-09 19:55:48,524 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] [2018-04-09 19:55:48,524 INFO L408 AbstractCegarLoop]: === Iteration 3 === [mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr4EnsuresViolationMEMORY_LEAK, mainErr0RequiresViolation, cstrncatErr7RequiresViolation, cstrncatErr5RequiresViolation, cstrncatErr0RequiresViolation, cstrncatErr3RequiresViolation, cstrncatErr9RequiresViolation, cstrncatErr1RequiresViolation, cstrncatErr2RequiresViolation, cstrncatErr8RequiresViolation, cstrncatErr6RequiresViolation, cstrncatErr4RequiresViolation]=== [2018-04-09 19:55:48,524 INFO L82 PathProgramCache]: Analyzing trace with hash 722601382, 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-04-09 19:55:48,532 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-04-09 19:55:48,549 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-09 19:55:48,552 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-09 19:55:48,619 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-04-09 19:55:48,620 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-09 19:55:48,645 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-04-09 19:55:48,645 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-09 19:55:48,658 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-09 19:55:48,658 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:27, output treesize:25 [2018-04-09 19:55:48,712 INFO L700 Elim1Store]: detected not equals via solver [2018-04-09 19:55:48,713 INFO L700 Elim1Store]: detected not equals via solver [2018-04-09 19:55:48,714 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-04-09 19:55:48,715 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-09 19:55:48,750 INFO L700 Elim1Store]: detected not equals via solver [2018-04-09 19:55:48,751 INFO L700 Elim1Store]: detected not equals via solver [2018-04-09 19:55:48,751 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 4 [2018-04-09 19:55:48,752 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-09 19:55:48,768 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-04-09 19:55:48,768 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:36, output treesize:24 [2018-04-09 19:55:48,799 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-09 19:55:48,799 INFO L314 TraceCheckSpWp]: Computing backward predicates... [2018-04-09 19:55:48,927 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 17 [2018-04-09 19:55:48,928 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-09 19:55:48,941 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 20 [2018-04-09 19:55:48,973 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 14 treesize of output 3 [2018-04-09 19:55:48,974 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-04-09 19:55:48,978 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-09 19:55:48,985 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-04-09 19:55:48,985 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 4 variables, input treesize:29, output treesize:9 [2018-04-09 19:55:49,030 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-09 19:55:49,066 INFO L320 seRefinementStrategy]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2018-04-09 19:55:49,066 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [7, 7] imperfect sequences [] total 12 [2018-04-09 19:55:49,067 INFO L442 AbstractCegarLoop]: Interpolant automaton has 13 states [2018-04-09 19:55:49,067 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2018-04-09 19:55:49,068 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=45, Invalid=111, Unknown=0, NotChecked=0, Total=156 [2018-04-09 19:55:49,068 INFO L87 Difference]: Start difference. First operand 91 states and 97 transitions. Second operand 13 states. [2018-04-09 19:55:49,318 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-09 19:55:49,318 INFO L93 Difference]: Finished difference Result 91 states and 97 transitions. [2018-04-09 19:55:49,318 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-04-09 19:55:49,319 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 24 [2018-04-09 19:55:49,319 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-09 19:55:49,320 INFO L225 Difference]: With dead ends: 91 [2018-04-09 19:55:49,320 INFO L226 Difference]: Without dead ends: 90 [2018-04-09 19:55:49,321 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 50 GetRequests, 35 SyntacticMatches, 1 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 40 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=81, Invalid=159, Unknown=0, NotChecked=0, Total=240 [2018-04-09 19:55:49,321 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 90 states. [2018-04-09 19:55:49,325 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 90 to 90. [2018-04-09 19:55:49,326 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 90 states. [2018-04-09 19:55:49,327 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 90 states to 90 states and 96 transitions. [2018-04-09 19:55:49,328 INFO L78 Accepts]: Start accepts. Automaton has 90 states and 96 transitions. Word has length 24 [2018-04-09 19:55:49,328 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-09 19:55:49,328 INFO L459 AbstractCegarLoop]: Abstraction has 90 states and 96 transitions. [2018-04-09 19:55:49,328 INFO L460 AbstractCegarLoop]: Interpolant automaton has 13 states. [2018-04-09 19:55:49,329 INFO L276 IsEmpty]: Start isEmpty. Operand 90 states and 96 transitions. [2018-04-09 19:55:49,329 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2018-04-09 19:55:49,329 INFO L347 BasicCegarLoop]: Found error trace [2018-04-09 19:55:49,330 INFO L355 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-09 19:55:49,330 INFO L408 AbstractCegarLoop]: === Iteration 4 === [mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr4EnsuresViolationMEMORY_LEAK, mainErr0RequiresViolation, cstrncatErr7RequiresViolation, cstrncatErr5RequiresViolation, cstrncatErr0RequiresViolation, cstrncatErr3RequiresViolation, cstrncatErr9RequiresViolation, cstrncatErr1RequiresViolation, cstrncatErr2RequiresViolation, cstrncatErr8RequiresViolation, cstrncatErr6RequiresViolation, cstrncatErr4RequiresViolation]=== [2018-04-09 19:55:49,330 INFO L82 PathProgramCache]: Analyzing trace with hash 925806431, 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-04-09 19:55:49,336 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-04-09 19:55:49,348 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-09 19:55:49,351 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-09 19:55:49,363 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-04-09 19:55:49,364 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-09 19:55:49,365 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-09 19:55:49,365 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:6, output treesize:5 [2018-04-09 19:55:49,371 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-09 19:55:49,371 INFO L314 TraceCheckSpWp]: Computing backward predicates... [2018-04-09 19:55:49,376 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-09 19:55:49,397 INFO L320 seRefinementStrategy]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2018-04-09 19:55:49,398 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [3, 3] imperfect sequences [] total 3 [2018-04-09 19:55:49,398 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-04-09 19:55:49,398 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-04-09 19:55:49,398 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-04-09 19:55:49,398 INFO L87 Difference]: Start difference. First operand 90 states and 96 transitions. Second operand 4 states. [2018-04-09 19:55:49,455 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-09 19:55:49,455 INFO L93 Difference]: Finished difference Result 90 states and 96 transitions. [2018-04-09 19:55:49,455 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-04-09 19:55:49,456 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 25 [2018-04-09 19:55:49,456 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-09 19:55:49,457 INFO L225 Difference]: With dead ends: 90 [2018-04-09 19:55:49,457 INFO L226 Difference]: Without dead ends: 89 [2018-04-09 19:55:49,457 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 50 GetRequests, 47 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-04-09 19:55:49,457 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 89 states. [2018-04-09 19:55:49,462 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 89 to 89. [2018-04-09 19:55:49,463 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 89 states. [2018-04-09 19:55:49,464 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 89 states to 89 states and 95 transitions. [2018-04-09 19:55:49,465 INFO L78 Accepts]: Start accepts. Automaton has 89 states and 95 transitions. Word has length 25 [2018-04-09 19:55:49,465 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-09 19:55:49,465 INFO L459 AbstractCegarLoop]: Abstraction has 89 states and 95 transitions. [2018-04-09 19:55:49,465 INFO L460 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-04-09 19:55:49,465 INFO L276 IsEmpty]: Start isEmpty. Operand 89 states and 95 transitions. [2018-04-09 19:55:49,466 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2018-04-09 19:55:49,466 INFO L347 BasicCegarLoop]: Found error trace [2018-04-09 19:55:49,466 INFO L355 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-09 19:55:49,467 INFO L408 AbstractCegarLoop]: === Iteration 5 === [mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr4EnsuresViolationMEMORY_LEAK, mainErr0RequiresViolation, cstrncatErr7RequiresViolation, cstrncatErr5RequiresViolation, cstrncatErr0RequiresViolation, cstrncatErr3RequiresViolation, cstrncatErr9RequiresViolation, cstrncatErr1RequiresViolation, cstrncatErr2RequiresViolation, cstrncatErr8RequiresViolation, cstrncatErr6RequiresViolation, cstrncatErr4RequiresViolation]=== [2018-04-09 19:55:49,467 INFO L82 PathProgramCache]: Analyzing trace with hash 925806432, 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-04-09 19:55:49,473 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-04-09 19:55:49,483 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-09 19:55:49,485 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-09 19:55:49,490 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-04-09 19:55:49,491 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-09 19:55:49,494 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-09 19:55:49,495 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:13, output treesize:12 [2018-04-09 19:55:49,506 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-09 19:55:49,506 INFO L314 TraceCheckSpWp]: Computing backward predicates... [2018-04-09 19:55:49,522 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-09 19:55:49,543 INFO L320 seRefinementStrategy]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2018-04-09 19:55:49,544 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [4, 4] imperfect sequences [] total 6 [2018-04-09 19:55:49,544 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-04-09 19:55:49,544 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-04-09 19:55:49,544 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2018-04-09 19:55:49,544 INFO L87 Difference]: Start difference. First operand 89 states and 95 transitions. Second operand 7 states. [2018-04-09 19:55:49,624 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-09 19:55:49,624 INFO L93 Difference]: Finished difference Result 89 states and 95 transitions. [2018-04-09 19:55:49,624 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-04-09 19:55:49,625 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 25 [2018-04-09 19:55:49,625 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-09 19:55:49,626 INFO L225 Difference]: With dead ends: 89 [2018-04-09 19:55:49,626 INFO L226 Difference]: Without dead ends: 88 [2018-04-09 19:55:49,626 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 50 GetRequests, 44 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2018-04-09 19:55:49,627 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 88 states. [2018-04-09 19:55:49,632 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 88 to 88. [2018-04-09 19:55:49,633 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 88 states. [2018-04-09 19:55:49,634 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 88 states to 88 states and 94 transitions. [2018-04-09 19:55:49,634 INFO L78 Accepts]: Start accepts. Automaton has 88 states and 94 transitions. Word has length 25 [2018-04-09 19:55:49,634 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-09 19:55:49,634 INFO L459 AbstractCegarLoop]: Abstraction has 88 states and 94 transitions. [2018-04-09 19:55:49,634 INFO L460 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-04-09 19:55:49,635 INFO L276 IsEmpty]: Start isEmpty. Operand 88 states and 94 transitions. [2018-04-09 19:55:49,635 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2018-04-09 19:55:49,635 INFO L347 BasicCegarLoop]: Found error trace [2018-04-09 19:55:49,636 INFO L355 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-09 19:55:49,636 INFO L408 AbstractCegarLoop]: === Iteration 6 === [mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr4EnsuresViolationMEMORY_LEAK, mainErr0RequiresViolation, cstrncatErr7RequiresViolation, cstrncatErr5RequiresViolation, cstrncatErr0RequiresViolation, cstrncatErr3RequiresViolation, cstrncatErr9RequiresViolation, cstrncatErr1RequiresViolation, cstrncatErr2RequiresViolation, cstrncatErr8RequiresViolation, cstrncatErr6RequiresViolation, cstrncatErr4RequiresViolation]=== [2018-04-09 19:55:49,636 INFO L82 PathProgramCache]: Analyzing trace with hash -506179908, 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-04-09 19:55:49,651 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-04-09 19:55:49,670 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-09 19:55:49,672 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-09 19:55:49,695 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-09 19:55:49,696 INFO L314 TraceCheckSpWp]: Computing backward predicates... [2018-04-09 19:55:49,704 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-09 19:55:49,733 INFO L320 seRefinementStrategy]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2018-04-09 19:55:49,733 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [5, 5] imperfect sequences [] total 5 [2018-04-09 19:55:49,733 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-04-09 19:55:49,733 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-04-09 19:55:49,733 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-04-09 19:55:49,734 INFO L87 Difference]: Start difference. First operand 88 states and 94 transitions. Second operand 6 states. [2018-04-09 19:55:49,834 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-09 19:55:49,834 INFO L93 Difference]: Finished difference Result 118 states and 126 transitions. [2018-04-09 19:55:49,834 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-04-09 19:55:49,834 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 32 [2018-04-09 19:55:49,835 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-09 19:55:49,836 INFO L225 Difference]: With dead ends: 118 [2018-04-09 19:55:49,836 INFO L226 Difference]: Without dead ends: 114 [2018-04-09 19:55:49,837 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 65 GetRequests, 59 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2018-04-09 19:55:49,837 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 114 states. [2018-04-09 19:55:49,845 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 114 to 101. [2018-04-09 19:55:49,845 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 101 states. [2018-04-09 19:55:49,846 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 101 states to 101 states and 114 transitions. [2018-04-09 19:55:49,847 INFO L78 Accepts]: Start accepts. Automaton has 101 states and 114 transitions. Word has length 32 [2018-04-09 19:55:49,847 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-09 19:55:49,847 INFO L459 AbstractCegarLoop]: Abstraction has 101 states and 114 transitions. [2018-04-09 19:55:49,847 INFO L460 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-04-09 19:55:49,847 INFO L276 IsEmpty]: Start isEmpty. Operand 101 states and 114 transitions. [2018-04-09 19:55:49,848 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2018-04-09 19:55:49,848 INFO L347 BasicCegarLoop]: Found error trace [2018-04-09 19:55:49,848 INFO L355 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-09 19:55:49,848 INFO L408 AbstractCegarLoop]: === Iteration 7 === [mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr4EnsuresViolationMEMORY_LEAK, mainErr0RequiresViolation, cstrncatErr7RequiresViolation, cstrncatErr5RequiresViolation, cstrncatErr0RequiresViolation, cstrncatErr3RequiresViolation, cstrncatErr9RequiresViolation, cstrncatErr1RequiresViolation, cstrncatErr2RequiresViolation, cstrncatErr8RequiresViolation, cstrncatErr6RequiresViolation, cstrncatErr4RequiresViolation]=== [2018-04-09 19:55:49,849 INFO L82 PathProgramCache]: Analyzing trace with hash -506179907, 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-04-09 19:55:49,859 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-04-09 19:55:49,875 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-09 19:55:49,877 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-09 19:55:49,947 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-09 19:55:49,947 INFO L314 TraceCheckSpWp]: Computing backward predicates... [2018-04-09 19:55:49,956 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 14 [2018-04-09 19:55:49,957 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-09 19:55:49,964 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 14 treesize of output 12 [2018-04-09 19:55:49,965 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-09 19:55:49,967 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-04-09 19:55:49,968 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:33, output treesize:7 [2018-04-09 19:55:49,990 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-09 19:55:50,011 INFO L320 seRefinementStrategy]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2018-04-09 19:55:50,012 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [9, 9] imperfect sequences [] total 9 [2018-04-09 19:55:50,012 INFO L442 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-04-09 19:55:50,012 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-04-09 19:55:50,012 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=71, Unknown=0, NotChecked=0, Total=90 [2018-04-09 19:55:50,012 INFO L87 Difference]: Start difference. First operand 101 states and 114 transitions. Second operand 10 states. [2018-04-09 19:55:50,151 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-09 19:55:50,152 INFO L93 Difference]: Finished difference Result 114 states and 122 transitions. [2018-04-09 19:55:50,152 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-04-09 19:55:50,152 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 32 [2018-04-09 19:55:50,152 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-09 19:55:50,153 INFO L225 Difference]: With dead ends: 114 [2018-04-09 19:55:50,153 INFO L226 Difference]: Without dead ends: 110 [2018-04-09 19:55:50,153 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 70 GetRequests, 52 SyntacticMatches, 3 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 25 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=65, Invalid=207, Unknown=0, NotChecked=0, Total=272 [2018-04-09 19:55:50,153 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 110 states. [2018-04-09 19:55:50,158 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 110 to 100. [2018-04-09 19:55:50,158 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 100 states. [2018-04-09 19:55:50,158 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 100 states to 100 states and 110 transitions. [2018-04-09 19:55:50,159 INFO L78 Accepts]: Start accepts. Automaton has 100 states and 110 transitions. Word has length 32 [2018-04-09 19:55:50,159 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-09 19:55:50,159 INFO L459 AbstractCegarLoop]: Abstraction has 100 states and 110 transitions. [2018-04-09 19:55:50,159 INFO L460 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-04-09 19:55:50,159 INFO L276 IsEmpty]: Start isEmpty. Operand 100 states and 110 transitions. [2018-04-09 19:55:50,160 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2018-04-09 19:55:50,160 INFO L347 BasicCegarLoop]: Found error trace [2018-04-09 19:55:50,160 INFO L355 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-09 19:55:50,160 INFO L408 AbstractCegarLoop]: === Iteration 8 === [mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr4EnsuresViolationMEMORY_LEAK, mainErr0RequiresViolation, cstrncatErr7RequiresViolation, cstrncatErr5RequiresViolation, cstrncatErr0RequiresViolation, cstrncatErr3RequiresViolation, cstrncatErr9RequiresViolation, cstrncatErr1RequiresViolation, cstrncatErr2RequiresViolation, cstrncatErr8RequiresViolation, cstrncatErr6RequiresViolation, cstrncatErr4RequiresViolation]=== [2018-04-09 19:55:50,160 INFO L82 PathProgramCache]: Analyzing trace with hash -963804542, 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-04-09 19:55:50,169 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-04-09 19:55:50,189 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-09 19:55:50,192 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-09 19:55:50,230 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2018-04-09 19:55:50,230 INFO L314 TraceCheckSpWp]: Computing backward predicates... [2018-04-09 19:55:50,237 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2018-04-09 19:55:50,259 INFO L320 seRefinementStrategy]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2018-04-09 19:55:50,259 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [6, 6] imperfect sequences [] total 6 [2018-04-09 19:55:50,259 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-04-09 19:55:50,259 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-04-09 19:55:50,259 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2018-04-09 19:55:50,259 INFO L87 Difference]: Start difference. First operand 100 states and 110 transitions. Second operand 7 states. [2018-04-09 19:55:50,345 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-09 19:55:50,345 INFO L93 Difference]: Finished difference Result 110 states and 118 transitions. [2018-04-09 19:55:50,345 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-04-09 19:55:50,345 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 39 [2018-04-09 19:55:50,345 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-09 19:55:50,346 INFO L225 Difference]: With dead ends: 110 [2018-04-09 19:55:50,346 INFO L226 Difference]: Without dead ends: 109 [2018-04-09 19:55:50,347 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 80 GetRequests, 72 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=29, Invalid=61, Unknown=0, NotChecked=0, Total=90 [2018-04-09 19:55:50,347 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 109 states. [2018-04-09 19:55:50,350 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 109 to 99. [2018-04-09 19:55:50,351 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 99 states. [2018-04-09 19:55:50,351 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 99 states to 99 states and 109 transitions. [2018-04-09 19:55:50,351 INFO L78 Accepts]: Start accepts. Automaton has 99 states and 109 transitions. Word has length 39 [2018-04-09 19:55:50,352 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-09 19:55:50,352 INFO L459 AbstractCegarLoop]: Abstraction has 99 states and 109 transitions. [2018-04-09 19:55:50,352 INFO L460 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-04-09 19:55:50,352 INFO L276 IsEmpty]: Start isEmpty. Operand 99 states and 109 transitions. [2018-04-09 19:55:50,353 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2018-04-09 19:55:50,353 INFO L347 BasicCegarLoop]: Found error trace [2018-04-09 19:55:50,353 INFO L355 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-09 19:55:50,353 INFO L408 AbstractCegarLoop]: === Iteration 9 === [mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr4EnsuresViolationMEMORY_LEAK, mainErr0RequiresViolation, cstrncatErr7RequiresViolation, cstrncatErr5RequiresViolation, cstrncatErr0RequiresViolation, cstrncatErr3RequiresViolation, cstrncatErr9RequiresViolation, cstrncatErr1RequiresViolation, cstrncatErr2RequiresViolation, cstrncatErr8RequiresViolation, cstrncatErr6RequiresViolation, cstrncatErr4RequiresViolation]=== [2018-04-09 19:55:50,353 INFO L82 PathProgramCache]: Analyzing trace with hash -963804541, 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-04-09 19:55:50,360 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-04-09 19:55:50,376 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-09 19:55:50,379 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-09 19:55:50,394 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-04-09 19:55:50,394 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-09 19:55:50,401 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-04-09 19:55:50,401 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-09 19:55:50,407 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-09 19:55:50,407 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:24, output treesize:19 [2018-04-09 19:55:50,428 INFO L700 Elim1Store]: detected not equals via solver [2018-04-09 19:55:50,429 INFO L700 Elim1Store]: detected not equals via solver [2018-04-09 19:55:50,430 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 4 [2018-04-09 19:55:50,430 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-09 19:55:50,437 INFO L700 Elim1Store]: detected not equals via solver [2018-04-09 19:55:50,437 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 23 [2018-04-09 19:55:50,438 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-09 19:55:50,445 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-09 19:55:50,445 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:30, output treesize:18 [2018-04-09 19:55:50,615 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-09 19:55:50,616 INFO L314 TraceCheckSpWp]: Computing backward predicates... [2018-04-09 19:55:50,826 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 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 3 [2018-04-09 19:55:50,827 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-09 19:55:50,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, 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 15 [2018-04-09 19:55:50,841 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-04-09 19:55:50,841 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-04-09 19:55:50,842 WARN L307 Elim1Store]: Array PQE input equivalent to true [2018-04-09 19:55:50,842 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-04-09 19:55:50,845 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-09 19:55:50,847 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-09 19:55:50,847 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 4 variables, input treesize:21, output treesize:3 [2018-04-09 19:55:50,884 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-09 19:55:50,905 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-04-09 19:55:50,906 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 12] total 23 [2018-04-09 19:55:50,906 INFO L442 AbstractCegarLoop]: Interpolant automaton has 24 states [2018-04-09 19:55:50,906 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2018-04-09 19:55:50,906 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=63, Invalid=489, Unknown=0, NotChecked=0, Total=552 [2018-04-09 19:55:50,906 INFO L87 Difference]: Start difference. First operand 99 states and 109 transitions. Second operand 24 states. [2018-04-09 19:55:51,673 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-09 19:55:51,673 INFO L93 Difference]: Finished difference Result 183 states and 199 transitions. [2018-04-09 19:55:51,673 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2018-04-09 19:55:51,674 INFO L78 Accepts]: Start accepts. Automaton has 24 states. Word has length 39 [2018-04-09 19:55:51,674 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-09 19:55:51,677 INFO L225 Difference]: With dead ends: 183 [2018-04-09 19:55:51,677 INFO L226 Difference]: Without dead ends: 182 [2018-04-09 19:55:51,678 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 89 GetRequests, 54 SyntacticMatches, 1 SemanticMatches, 34 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 208 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=197, Invalid=1063, Unknown=0, NotChecked=0, Total=1260 [2018-04-09 19:55:51,678 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 182 states. [2018-04-09 19:55:51,686 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 182 to 106. [2018-04-09 19:55:51,686 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 106 states. [2018-04-09 19:55:51,687 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 106 states to 106 states and 117 transitions. [2018-04-09 19:55:51,688 INFO L78 Accepts]: Start accepts. Automaton has 106 states and 117 transitions. Word has length 39 [2018-04-09 19:55:51,688 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-09 19:55:51,688 INFO L459 AbstractCegarLoop]: Abstraction has 106 states and 117 transitions. [2018-04-09 19:55:51,688 INFO L460 AbstractCegarLoop]: Interpolant automaton has 24 states. [2018-04-09 19:55:51,688 INFO L276 IsEmpty]: Start isEmpty. Operand 106 states and 117 transitions. [2018-04-09 19:55:51,689 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2018-04-09 19:55:51,689 INFO L347 BasicCegarLoop]: Found error trace [2018-04-09 19:55:51,689 INFO L355 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-09 19:55:51,689 INFO L408 AbstractCegarLoop]: === Iteration 10 === [mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr4EnsuresViolationMEMORY_LEAK, mainErr0RequiresViolation, cstrncatErr7RequiresViolation, cstrncatErr5RequiresViolation, cstrncatErr0RequiresViolation, cstrncatErr3RequiresViolation, cstrncatErr9RequiresViolation, cstrncatErr1RequiresViolation, cstrncatErr2RequiresViolation, cstrncatErr8RequiresViolation, cstrncatErr6RequiresViolation, cstrncatErr4RequiresViolation]=== [2018-04-09 19:55:51,690 INFO L82 PathProgramCache]: Analyzing trace with hash 1123521185, 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-04-09 19:55:51,700 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-04-09 19:55:51,715 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-09 19:55:51,717 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-09 19:55:51,768 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-09 19:55:51,769 INFO L314 TraceCheckSpWp]: Computing backward predicates... [2018-04-09 19:55:51,776 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-09 19:55:51,800 INFO L320 seRefinementStrategy]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2018-04-09 19:55:51,801 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [5, 5] imperfect sequences [] total 5 [2018-04-09 19:55:51,801 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-04-09 19:55:51,801 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-04-09 19:55:51,801 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-04-09 19:55:51,801 INFO L87 Difference]: Start difference. First operand 106 states and 117 transitions. Second operand 6 states. [2018-04-09 19:55:51,884 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-09 19:55:51,885 INFO L93 Difference]: Finished difference Result 113 states and 125 transitions. [2018-04-09 19:55:51,885 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-04-09 19:55:51,885 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 40 [2018-04-09 19:55:51,885 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-09 19:55:51,886 INFO L225 Difference]: With dead ends: 113 [2018-04-09 19:55:51,886 INFO L226 Difference]: Without dead ends: 112 [2018-04-09 19:55:51,886 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 81 GetRequests, 75 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2018-04-09 19:55:51,886 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 112 states. [2018-04-09 19:55:51,890 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 112 to 105. [2018-04-09 19:55:51,890 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 105 states. [2018-04-09 19:55:51,891 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 105 states to 105 states and 115 transitions. [2018-04-09 19:55:51,891 INFO L78 Accepts]: Start accepts. Automaton has 105 states and 115 transitions. Word has length 40 [2018-04-09 19:55:51,891 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-09 19:55:51,891 INFO L459 AbstractCegarLoop]: Abstraction has 105 states and 115 transitions. [2018-04-09 19:55:51,891 INFO L460 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-04-09 19:55:51,892 INFO L276 IsEmpty]: Start isEmpty. Operand 105 states and 115 transitions. [2018-04-09 19:55:51,892 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2018-04-09 19:55:51,893 INFO L347 BasicCegarLoop]: Found error trace [2018-04-09 19:55:51,893 INFO L355 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-09 19:55:51,893 INFO L408 AbstractCegarLoop]: === Iteration 11 === [mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr4EnsuresViolationMEMORY_LEAK, mainErr0RequiresViolation, cstrncatErr7RequiresViolation, cstrncatErr5RequiresViolation, cstrncatErr0RequiresViolation, cstrncatErr3RequiresViolation, cstrncatErr9RequiresViolation, cstrncatErr1RequiresViolation, cstrncatErr2RequiresViolation, cstrncatErr8RequiresViolation, cstrncatErr6RequiresViolation, cstrncatErr4RequiresViolation]=== [2018-04-09 19:55:51,893 INFO L82 PathProgramCache]: Analyzing trace with hash 1123521186, 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-04-09 19:55:51,903 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-04-09 19:55:51,920 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-09 19:55:51,922 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-09 19:55:52,006 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-09 19:55:52,006 INFO L314 TraceCheckSpWp]: Computing backward predicates... [2018-04-09 19:55:52,014 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 10 [2018-04-09 19:55:52,014 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-09 19:55:52,023 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 12 [2018-04-09 19:55:52,024 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-09 19:55:52,026 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-04-09 19:55:52,026 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:29, output treesize:7 [2018-04-09 19:55:52,035 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-09 19:55:52,056 INFO L320 seRefinementStrategy]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2018-04-09 19:55:52,056 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [8, 8] imperfect sequences [] total 8 [2018-04-09 19:55:52,056 INFO L442 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-04-09 19:55:52,057 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-04-09 19:55:52,057 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2018-04-09 19:55:52,057 INFO L87 Difference]: Start difference. First operand 105 states and 115 transitions. Second operand 9 states. [2018-04-09 19:55:52,175 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-09 19:55:52,175 INFO L93 Difference]: Finished difference Result 143 states and 157 transitions. [2018-04-09 19:55:52,175 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-04-09 19:55:52,175 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 40 [2018-04-09 19:55:52,175 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-09 19:55:52,176 INFO L225 Difference]: With dead ends: 143 [2018-04-09 19:55:52,176 INFO L226 Difference]: Without dead ends: 142 [2018-04-09 19:55:52,177 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 85 GetRequests, 70 SyntacticMatches, 2 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 27 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=50, Invalid=160, Unknown=0, NotChecked=0, Total=210 [2018-04-09 19:55:52,177 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 142 states. [2018-04-09 19:55:52,181 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 142 to 122. [2018-04-09 19:55:52,181 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 122 states. [2018-04-09 19:55:52,182 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 122 states to 122 states and 134 transitions. [2018-04-09 19:55:52,182 INFO L78 Accepts]: Start accepts. Automaton has 122 states and 134 transitions. Word has length 40 [2018-04-09 19:55:52,182 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-09 19:55:52,182 INFO L459 AbstractCegarLoop]: Abstraction has 122 states and 134 transitions. [2018-04-09 19:55:52,182 INFO L460 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-04-09 19:55:52,182 INFO L276 IsEmpty]: Start isEmpty. Operand 122 states and 134 transitions. [2018-04-09 19:55:52,183 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2018-04-09 19:55:52,183 INFO L347 BasicCegarLoop]: Found error trace [2018-04-09 19:55:52,183 INFO L355 BasicCegarLoop]: trace histogram [3, 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] [2018-04-09 19:55:52,184 INFO L408 AbstractCegarLoop]: === Iteration 12 === [mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr4EnsuresViolationMEMORY_LEAK, mainErr0RequiresViolation, cstrncatErr7RequiresViolation, cstrncatErr5RequiresViolation, cstrncatErr0RequiresViolation, cstrncatErr3RequiresViolation, cstrncatErr9RequiresViolation, cstrncatErr1RequiresViolation, cstrncatErr2RequiresViolation, cstrncatErr8RequiresViolation, cstrncatErr6RequiresViolation, cstrncatErr4RequiresViolation]=== [2018-04-09 19:55:52,184 INFO L82 PathProgramCache]: Analyzing trace with hash 63808509, now seen corresponding path program 2 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-04-09 19:55:52,190 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-04-09 19:55:52,205 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-09 19:55:52,208 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-09 19:55:52,217 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-04-09 19:55:52,217 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-09 19:55:52,222 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-09 19:55:52,222 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:15, output treesize:14 [2018-04-09 19:55:52,241 INFO L700 Elim1Store]: detected not equals via solver [2018-04-09 19:55:52,242 INFO L700 Elim1Store]: detected not equals via solver [2018-04-09 19:55:52,243 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 4 [2018-04-09 19:55:52,243 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-09 19:55:52,247 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-09 19:55:52,247 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:19, output treesize:13 [2018-04-09 19:55:52,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 17 treesize of output 14 [2018-04-09 19:55:52,292 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 13 [2018-04-09 19:55:52,293 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-09 19:55:52,294 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-09 19:55:52,303 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2018-04-09 19:55:52,303 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:39, output treesize:35 [2018-04-09 19:55:52,330 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 29 [2018-04-09 19:55:52,333 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 11 treesize of output 10 [2018-04-09 19:55:52,334 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-09 19:55:52,340 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-09 19:55:52,351 INFO L267 ElimStorePlain]: Start of recursive call 1: 5 dim-0 vars, 1 dim-2 vars, End of recursive call: 5 dim-0 vars, and 1 xjuncts. [2018-04-09 19:55:52,352 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 6 variables, input treesize:49, output treesize:45 [2018-04-09 19:55:54,652 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 37 [2018-04-09 19:55:54,654 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 1 [2018-04-09 19:55:54,655 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-09 19:55:54,663 INFO L700 Elim1Store]: detected not equals via solver [2018-04-09 19:55:54,668 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 25 treesize of output 37 [2018-04-09 19:55:54,668 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 2 xjuncts. [2018-04-09 19:55:54,679 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-04-09 19:55:54,700 INFO L267 ElimStorePlain]: Start of recursive call 1: 6 dim-0 vars, 1 dim-2 vars, End of recursive call: and 2 xjuncts. [2018-04-09 19:55:54,701 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 7 variables, input treesize:70, output treesize:43 [2018-04-09 19:55:54,809 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 0 proven. 9 refuted. 2 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-09 19:55:54,809 INFO L314 TraceCheckSpWp]: Computing backward predicates... [2018-04-09 19:55:55,296 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 14 [2018-04-09 19:55:55,297 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-09 19:55:55,305 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 35 treesize of output 31 [2018-04-09 19:55:55,321 INFO L682 Elim1Store]: detected equality via solver [2018-04-09 19:55:55,322 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 5 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 12 [2018-04-09 19:55:55,322 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-04-09 19:55:55,326 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-09 19:55:55,332 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-04-09 19:55:55,332 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 4 variables, input treesize:58, output treesize:14 [2018-04-09 19:55:55,404 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 0 proven. 11 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-09 19:55:55,425 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-04-09 19:55:55,425 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [20, 16] total 34 [2018-04-09 19:55:55,425 INFO L442 AbstractCegarLoop]: Interpolant automaton has 35 states [2018-04-09 19:55:55,425 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 35 interpolants. [2018-04-09 19:55:55,426 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=125, Invalid=1064, Unknown=1, NotChecked=0, Total=1190 [2018-04-09 19:55:55,426 INFO L87 Difference]: Start difference. First operand 122 states and 134 transitions. Second operand 35 states. [2018-04-09 19:56:01,717 WARN L151 SmtUtils]: Spent 3118ms on a formula simplification. DAG size of input: 87 DAG size of output 84 [2018-04-09 19:56:04,322 WARN L151 SmtUtils]: Spent 1126ms on a formula simplification. DAG size of input: 70 DAG size of output 66 [2018-04-09 19:56:04,725 WARN L151 SmtUtils]: Spent 201ms on a formula simplification. DAG size of input: 79 DAG size of output 71 [2018-04-09 19:56:05,412 WARN L151 SmtUtils]: Spent 487ms on a formula simplification. DAG size of input: 77 DAG size of output 69 [2018-04-09 19:56:07,623 WARN L151 SmtUtils]: Spent 2155ms on a formula simplification. DAG size of input: 97 DAG size of output 87 [2018-04-09 19:56:10,007 WARN L151 SmtUtils]: Spent 2321ms on a formula simplification. DAG size of input: 94 DAG size of output 85 [2018-04-09 19:56:13,374 WARN L151 SmtUtils]: Spent 1317ms on a formula simplification. DAG size of input: 74 DAG size of output 67 [2018-04-09 19:56:15,258 WARN L151 SmtUtils]: Spent 1724ms on a formula simplification. DAG size of input: 84 DAG size of output 71 [2018-04-09 19:56:20,892 WARN L151 SmtUtils]: Spent 3517ms on a formula simplification. DAG size of input: 82 DAG size of output 73 [2018-04-09 19:56:22,166 WARN L151 SmtUtils]: Spent 827ms on a formula simplification. DAG size of input: 80 DAG size of output 70 [2018-04-09 19:56:22,617 WARN L151 SmtUtils]: Spent 369ms on a formula simplification. DAG size of input: 100 DAG size of output 87 [2018-04-09 19:56:27,642 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-09 19:56:27,642 INFO L93 Difference]: Finished difference Result 260 states and 282 transitions. [2018-04-09 19:56:27,643 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 40 states. [2018-04-09 19:56:27,643 INFO L78 Accepts]: Start accepts. Automaton has 35 states. Word has length 46 [2018-04-09 19:56:27,643 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-09 19:56:27,644 INFO L225 Difference]: With dead ends: 260 [2018-04-09 19:56:27,644 INFO L226 Difference]: Without dead ends: 259 [2018-04-09 19:56:27,646 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 122 GetRequests, 56 SyntacticMatches, 2 SemanticMatches, 64 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 924 ImplicationChecksByTransitivity, 25.4s TimeCoverageRelationStatistics Valid=694, Invalid=3594, Unknown=2, NotChecked=0, Total=4290 [2018-04-09 19:56:27,646 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 259 states. [2018-04-09 19:56:27,653 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 259 to 112. [2018-04-09 19:56:27,653 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 112 states. [2018-04-09 19:56:27,654 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 112 states to 112 states and 123 transitions. [2018-04-09 19:56:27,654 INFO L78 Accepts]: Start accepts. Automaton has 112 states and 123 transitions. Word has length 46 [2018-04-09 19:56:27,654 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-09 19:56:27,654 INFO L459 AbstractCegarLoop]: Abstraction has 112 states and 123 transitions. [2018-04-09 19:56:27,654 INFO L460 AbstractCegarLoop]: Interpolant automaton has 35 states. [2018-04-09 19:56:27,654 INFO L276 IsEmpty]: Start isEmpty. Operand 112 states and 123 transitions. [2018-04-09 19:56:27,655 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2018-04-09 19:56:27,655 INFO L347 BasicCegarLoop]: Found error trace [2018-04-09 19:56:27,655 INFO L355 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-09 19:56:27,655 INFO L408 AbstractCegarLoop]: === Iteration 13 === [mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr4EnsuresViolationMEMORY_LEAK, mainErr0RequiresViolation, cstrncatErr7RequiresViolation, cstrncatErr5RequiresViolation, cstrncatErr0RequiresViolation, cstrncatErr3RequiresViolation, cstrncatErr9RequiresViolation, cstrncatErr1RequiresViolation, cstrncatErr2RequiresViolation, cstrncatErr8RequiresViolation, cstrncatErr6RequiresViolation, cstrncatErr4RequiresViolation]=== [2018-04-09 19:56:27,655 INFO L82 PathProgramCache]: Analyzing trace with hash 1465279656, 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-04-09 19:56:27,661 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-04-09 19:56:27,686 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-09 19:56:27,688 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-09 19:56:27,713 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-09 19:56:27,714 INFO L314 TraceCheckSpWp]: Computing backward predicates... [2018-04-09 19:56:27,784 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-09 19:56:27,817 INFO L320 seRefinementStrategy]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2018-04-09 19:56:27,817 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [6, 6] imperfect sequences [] total 7 [2018-04-09 19:56:27,818 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-04-09 19:56:27,818 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-04-09 19:56:27,818 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2018-04-09 19:56:27,818 INFO L87 Difference]: Start difference. First operand 112 states and 123 transitions. Second operand 7 states. [2018-04-09 19:56:27,876 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-09 19:56:27,877 INFO L93 Difference]: Finished difference Result 193 states and 210 transitions. [2018-04-09 19:56:27,877 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-04-09 19:56:27,877 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 54 [2018-04-09 19:56:27,877 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-09 19:56:27,878 INFO L225 Difference]: With dead ends: 193 [2018-04-09 19:56:27,878 INFO L226 Difference]: Without dead ends: 163 [2018-04-09 19:56:27,879 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 109 GetRequests, 99 SyntacticMatches, 3 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=26, Invalid=46, Unknown=0, NotChecked=0, Total=72 [2018-04-09 19:56:27,879 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 163 states. [2018-04-09 19:56:27,885 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 163 to 135. [2018-04-09 19:56:27,885 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 135 states. [2018-04-09 19:56:27,886 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 135 states to 135 states and 151 transitions. [2018-04-09 19:56:27,886 INFO L78 Accepts]: Start accepts. Automaton has 135 states and 151 transitions. Word has length 54 [2018-04-09 19:56:27,886 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-09 19:56:27,886 INFO L459 AbstractCegarLoop]: Abstraction has 135 states and 151 transitions. [2018-04-09 19:56:27,886 INFO L460 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-04-09 19:56:27,886 INFO L276 IsEmpty]: Start isEmpty. Operand 135 states and 151 transitions. [2018-04-09 19:56:27,887 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2018-04-09 19:56:27,887 INFO L347 BasicCegarLoop]: Found error trace [2018-04-09 19:56:27,887 INFO L355 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-09 19:56:27,887 INFO L408 AbstractCegarLoop]: === Iteration 14 === [mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr4EnsuresViolationMEMORY_LEAK, mainErr0RequiresViolation, cstrncatErr7RequiresViolation, cstrncatErr5RequiresViolation, cstrncatErr0RequiresViolation, cstrncatErr3RequiresViolation, cstrncatErr9RequiresViolation, cstrncatErr1RequiresViolation, cstrncatErr2RequiresViolation, cstrncatErr8RequiresViolation, cstrncatErr6RequiresViolation, cstrncatErr4RequiresViolation]=== [2018-04-09 19:56:27,887 INFO L82 PathProgramCache]: Analyzing trace with hash 834800017, 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-04-09 19:56:27,900 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-04-09 19:56:27,918 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-09 19:56:27,920 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-09 19:56:27,935 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-09 19:56:27,935 INFO L314 TraceCheckSpWp]: Computing backward predicates... [2018-04-09 19:56:27,947 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-09 19:56:27,982 INFO L320 seRefinementStrategy]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2018-04-09 19:56:27,982 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [3, 3] imperfect sequences [] total 3 [2018-04-09 19:56:27,983 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-04-09 19:56:27,983 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-04-09 19:56:27,983 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-04-09 19:56:27,984 INFO L87 Difference]: Start difference. First operand 135 states and 151 transitions. Second operand 3 states. [2018-04-09 19:56:27,995 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-09 19:56:27,995 INFO L93 Difference]: Finished difference Result 182 states and 201 transitions. [2018-04-09 19:56:27,995 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-04-09 19:56:27,996 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 54 [2018-04-09 19:56:27,996 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-09 19:56:27,996 INFO L225 Difference]: With dead ends: 182 [2018-04-09 19:56:27,996 INFO L226 Difference]: Without dead ends: 95 [2018-04-09 19:56:27,997 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 107 GetRequests, 106 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-04-09 19:56:27,998 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 95 states. [2018-04-09 19:56:28,002 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 95 to 95. [2018-04-09 19:56:28,002 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 95 states. [2018-04-09 19:56:28,003 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 95 states to 95 states and 101 transitions. [2018-04-09 19:56:28,003 INFO L78 Accepts]: Start accepts. Automaton has 95 states and 101 transitions. Word has length 54 [2018-04-09 19:56:28,003 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-09 19:56:28,003 INFO L459 AbstractCegarLoop]: Abstraction has 95 states and 101 transitions. [2018-04-09 19:56:28,003 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-04-09 19:56:28,003 INFO L276 IsEmpty]: Start isEmpty. Operand 95 states and 101 transitions. [2018-04-09 19:56:28,004 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2018-04-09 19:56:28,004 INFO L347 BasicCegarLoop]: Found error trace [2018-04-09 19:56:28,004 INFO L355 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-09 19:56:28,004 INFO L408 AbstractCegarLoop]: === Iteration 15 === [mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr4EnsuresViolationMEMORY_LEAK, mainErr0RequiresViolation, cstrncatErr7RequiresViolation, cstrncatErr5RequiresViolation, cstrncatErr0RequiresViolation, cstrncatErr3RequiresViolation, cstrncatErr9RequiresViolation, cstrncatErr1RequiresViolation, cstrncatErr2RequiresViolation, cstrncatErr8RequiresViolation, cstrncatErr6RequiresViolation, cstrncatErr4RequiresViolation]=== [2018-04-09 19:56:28,004 INFO L82 PathProgramCache]: Analyzing trace with hash -269889426, 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-04-09 19:56:28,018 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-04-09 19:56:28,038 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-09 19:56:28,041 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-09 19:56:28,048 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 14 treesize of output 11 [2018-04-09 19:56:28,056 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 11 treesize of output 10 [2018-04-09 19:56:28,056 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-09 19:56:28,058 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-09 19:56:28,063 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-04-09 19:56:28,064 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:25, output treesize:21 [2018-04-09 19:56:28,146 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 20 treesize of output 16 [2018-04-09 19:56:28,152 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 1 case distinctions, treesize of input 16 treesize of output 13 [2018-04-09 19:56:28,152 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 2 xjuncts. [2018-04-09 19:56:28,155 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-04-09 19:56:28,164 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 2 xjuncts. [2018-04-09 19:56:28,164 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:38, output treesize:29 [2018-04-09 19:56:28,252 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-09 19:56:28,252 INFO L314 TraceCheckSpWp]: Computing backward predicates... [2018-04-09 19:56:28,530 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 16 treesize of output 12 [2018-04-09 19:56:28,531 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-09 19:56:28,536 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 13 treesize of output 11 [2018-04-09 19:56:28,544 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2018-04-09 19:56:28,545 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-04-09 19:56:28,546 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-09 19:56:28,551 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-04-09 19:56:28,551 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 5 variables, input treesize:35, output treesize:7 [2018-04-09 19:56:28,560 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-09 19:56:28,581 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-04-09 19:56:28,581 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11] total 20 [2018-04-09 19:56:28,581 INFO L442 AbstractCegarLoop]: Interpolant automaton has 21 states [2018-04-09 19:56:28,582 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2018-04-09 19:56:28,582 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=58, Invalid=362, Unknown=0, NotChecked=0, Total=420 [2018-04-09 19:56:28,582 INFO L87 Difference]: Start difference. First operand 95 states and 101 transitions. Second operand 21 states. [2018-04-09 19:56:29,460 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-09 19:56:29,460 INFO L93 Difference]: Finished difference Result 141 states and 151 transitions. [2018-04-09 19:56:29,460 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2018-04-09 19:56:29,460 INFO L78 Accepts]: Start accepts. Automaton has 21 states. Word has length 58 [2018-04-09 19:56:29,460 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-09 19:56:29,461 INFO L225 Difference]: With dead ends: 141 [2018-04-09 19:56:29,461 INFO L226 Difference]: Without dead ends: 140 [2018-04-09 19:56:29,462 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 128 GetRequests, 95 SyntacticMatches, 1 SemanticMatches, 32 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 156 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=175, Invalid=947, Unknown=0, NotChecked=0, Total=1122 [2018-04-09 19:56:29,462 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 140 states. [2018-04-09 19:56:29,468 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 140 to 112. [2018-04-09 19:56:29,469 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 112 states. [2018-04-09 19:56:29,469 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 112 states to 112 states and 120 transitions. [2018-04-09 19:56:29,470 INFO L78 Accepts]: Start accepts. Automaton has 112 states and 120 transitions. Word has length 58 [2018-04-09 19:56:29,470 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-09 19:56:29,470 INFO L459 AbstractCegarLoop]: Abstraction has 112 states and 120 transitions. [2018-04-09 19:56:29,470 INFO L460 AbstractCegarLoop]: Interpolant automaton has 21 states. [2018-04-09 19:56:29,470 INFO L276 IsEmpty]: Start isEmpty. Operand 112 states and 120 transitions. [2018-04-09 19:56:29,471 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2018-04-09 19:56:29,471 INFO L347 BasicCegarLoop]: Found error trace [2018-04-09 19:56:29,471 INFO L355 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-09 19:56:29,471 INFO L408 AbstractCegarLoop]: === Iteration 16 === [mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr4EnsuresViolationMEMORY_LEAK, mainErr0RequiresViolation, cstrncatErr7RequiresViolation, cstrncatErr5RequiresViolation, cstrncatErr0RequiresViolation, cstrncatErr3RequiresViolation, cstrncatErr9RequiresViolation, cstrncatErr1RequiresViolation, cstrncatErr2RequiresViolation, cstrncatErr8RequiresViolation, cstrncatErr6RequiresViolation, cstrncatErr4RequiresViolation]=== [2018-04-09 19:56:29,471 INFO L82 PathProgramCache]: Analyzing trace with hash 853842009, 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-04-09 19:56:29,479 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-04-09 19:56:29,495 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-09 19:56:29,497 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-09 19:56:29,520 INFO L700 Elim1Store]: detected not equals via solver [2018-04-09 19:56:29,521 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 20 treesize of output 21 [2018-04-09 19:56:29,528 INFO L700 Elim1Store]: detected not equals via solver [2018-04-09 19:56:29,529 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 21 [2018-04-09 19:56:29,529 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-09 19:56:29,536 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-09 19:56:29,540 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2018-04-09 19:56:29,540 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:23, output treesize:15 [2018-04-09 19:56:29,580 WARN L1033 $PredicateComparison]: unable to prove that (exists ((|main_#t~malloc13.base| Int)) (let ((.cse0 (store |c_old(#valid)| |main_#t~malloc13.base| 1))) (and (= (select .cse0 |c_main_#t~malloc14.base|) 0) (= 0 (select |c_old(#valid)| |main_#t~malloc13.base|)) (= |c_#valid| (store (store .cse0 |c_main_#t~malloc14.base| 1) |main_#t~malloc13.base| 0))))) is different from true [2018-04-09 19:56:29,587 WARN L1033 $PredicateComparison]: unable to prove that (exists ((|main_#t~malloc13.base| Int) (|main_#t~malloc14.base| Int)) (let ((.cse0 (store |c_old(#valid)| |main_#t~malloc13.base| 1))) (and (= (select .cse0 |main_#t~malloc14.base|) 0) (= 0 (select |c_old(#valid)| |main_#t~malloc13.base|)) (= |c_#valid| (store (store (store .cse0 |main_#t~malloc14.base| 1) |main_#t~malloc13.base| 0) |main_#t~malloc14.base| 0))))) is different from true [2018-04-09 19:56:29,599 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-09 19:56:29,599 INFO L314 TraceCheckSpWp]: Computing backward predicates... [2018-04-09 19:56:29,634 WARN L1011 $PredicateComparison]: unable to prove that (forall ((|v_main_#t~malloc14.base_17| Int)) (or (not (= (select |c_#valid| |v_main_#t~malloc14.base_17|) 0)) (= |c_old(#valid)| (store (store (store |c_#valid| |v_main_#t~malloc14.base_17| 1) |c_main_#t~malloc13.base| 0) |v_main_#t~malloc14.base_17| 0)))) is different from false [2018-04-09 19:56:29,640 WARN L1011 $PredicateComparison]: unable to prove that (forall ((|v_main_#t~malloc13.base_16| Int) (|v_main_#t~malloc14.base_17| Int)) (let ((.cse0 (store |c_#valid| |v_main_#t~malloc13.base_16| 1))) (or (= |c_old(#valid)| (store (store (store .cse0 |v_main_#t~malloc14.base_17| 1) |v_main_#t~malloc13.base_16| 0) |v_main_#t~malloc14.base_17| 0)) (not (= 0 (select |c_#valid| |v_main_#t~malloc13.base_16|))) (not (= (select .cse0 |v_main_#t~malloc14.base_17|) 0))))) is different from false [2018-04-09 19:56:29,671 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-09 19:56:29,695 INFO L320 seRefinementStrategy]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2018-04-09 19:56:29,695 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [7, 6] imperfect sequences [] total 11 [2018-04-09 19:56:29,695 INFO L442 AbstractCegarLoop]: Interpolant automaton has 12 states [2018-04-09 19:56:29,695 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2018-04-09 19:56:29,695 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=45, Unknown=4, NotChecked=60, Total=132 [2018-04-09 19:56:29,696 INFO L87 Difference]: Start difference. First operand 112 states and 120 transitions. Second operand 12 states. [2018-04-09 19:56:29,745 WARN L1011 $PredicateComparison]: unable to prove that (and (= |c_#valid| |c_old(#valid)|) (forall ((|v_main_#t~malloc13.base_16| Int) (|v_main_#t~malloc14.base_17| Int)) (let ((.cse0 (store |c_#valid| |v_main_#t~malloc13.base_16| 1))) (or (= |c_old(#valid)| (store (store (store .cse0 |v_main_#t~malloc14.base_17| 1) |v_main_#t~malloc13.base_16| 0) |v_main_#t~malloc14.base_17| 0)) (not (= 0 (select |c_#valid| |v_main_#t~malloc13.base_16|))) (not (= (select .cse0 |v_main_#t~malloc14.base_17|) 0)))))) is different from false [2018-04-09 19:56:30,106 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-09 19:56:30,106 INFO L93 Difference]: Finished difference Result 205 states and 220 transitions. [2018-04-09 19:56:30,106 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-04-09 19:56:30,106 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 59 [2018-04-09 19:56:30,107 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-09 19:56:30,108 INFO L225 Difference]: With dead ends: 205 [2018-04-09 19:56:30,108 INFO L226 Difference]: Without dead ends: 186 [2018-04-09 19:56:30,108 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 125 GetRequests, 107 SyntacticMatches, 2 SemanticMatches, 16 ConstructedPredicates, 5 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=45, Invalid=125, Unknown=6, NotChecked=130, Total=306 [2018-04-09 19:56:30,109 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 186 states. [2018-04-09 19:56:30,118 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 186 to 181. [2018-04-09 19:56:30,119 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 181 states. [2018-04-09 19:56:30,119 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 181 states to 181 states and 198 transitions. [2018-04-09 19:56:30,119 INFO L78 Accepts]: Start accepts. Automaton has 181 states and 198 transitions. Word has length 59 [2018-04-09 19:56:30,120 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-09 19:56:30,120 INFO L459 AbstractCegarLoop]: Abstraction has 181 states and 198 transitions. [2018-04-09 19:56:30,120 INFO L460 AbstractCegarLoop]: Interpolant automaton has 12 states. [2018-04-09 19:56:30,120 INFO L276 IsEmpty]: Start isEmpty. Operand 181 states and 198 transitions. [2018-04-09 19:56:30,120 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2018-04-09 19:56:30,120 INFO L347 BasicCegarLoop]: Found error trace [2018-04-09 19:56:30,121 INFO L355 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-09 19:56:30,121 INFO L408 AbstractCegarLoop]: === Iteration 17 === [mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr4EnsuresViolationMEMORY_LEAK, mainErr0RequiresViolation, cstrncatErr7RequiresViolation, cstrncatErr5RequiresViolation, cstrncatErr0RequiresViolation, cstrncatErr3RequiresViolation, cstrncatErr9RequiresViolation, cstrncatErr1RequiresViolation, cstrncatErr2RequiresViolation, cstrncatErr8RequiresViolation, cstrncatErr6RequiresViolation, cstrncatErr4RequiresViolation]=== [2018-04-09 19:56:30,121 INFO L82 PathProgramCache]: Analyzing trace with hash 223362370, 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-04-09 19:56:30,135 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-04-09 19:56:30,162 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-09 19:56:30,165 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-09 19:56:30,207 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2018-04-09 19:56:30,208 INFO L314 TraceCheckSpWp]: Computing backward predicates... [2018-04-09 19:56:30,214 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2018-04-09 19:56:30,236 INFO L320 seRefinementStrategy]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2018-04-09 19:56:30,236 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [6, 6] imperfect sequences [] total 6 [2018-04-09 19:56:30,236 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-04-09 19:56:30,237 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-04-09 19:56:30,237 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2018-04-09 19:56:30,237 INFO L87 Difference]: Start difference. First operand 181 states and 198 transitions. Second operand 7 states. [2018-04-09 19:56:30,329 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-09 19:56:30,330 INFO L93 Difference]: Finished difference Result 185 states and 202 transitions. [2018-04-09 19:56:30,330 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-04-09 19:56:30,330 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 59 [2018-04-09 19:56:30,330 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-09 19:56:30,331 INFO L225 Difference]: With dead ends: 185 [2018-04-09 19:56:30,331 INFO L226 Difference]: Without dead ends: 183 [2018-04-09 19:56:30,332 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 120 GetRequests, 112 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=29, Invalid=61, Unknown=0, NotChecked=0, Total=90 [2018-04-09 19:56:30,332 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 183 states. [2018-04-09 19:56:30,343 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 183 to 179. [2018-04-09 19:56:30,344 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 179 states. [2018-04-09 19:56:30,345 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 179 states to 179 states and 194 transitions. [2018-04-09 19:56:30,345 INFO L78 Accepts]: Start accepts. Automaton has 179 states and 194 transitions. Word has length 59 [2018-04-09 19:56:30,345 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-09 19:56:30,345 INFO L459 AbstractCegarLoop]: Abstraction has 179 states and 194 transitions. [2018-04-09 19:56:30,346 INFO L460 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-04-09 19:56:30,346 INFO L276 IsEmpty]: Start isEmpty. Operand 179 states and 194 transitions. [2018-04-09 19:56:30,347 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2018-04-09 19:56:30,347 INFO L347 BasicCegarLoop]: Found error trace [2018-04-09 19:56:30,347 INFO L355 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-09 19:56:30,347 INFO L408 AbstractCegarLoop]: === Iteration 18 === [mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr4EnsuresViolationMEMORY_LEAK, mainErr0RequiresViolation, cstrncatErr7RequiresViolation, cstrncatErr5RequiresViolation, cstrncatErr0RequiresViolation, cstrncatErr3RequiresViolation, cstrncatErr9RequiresViolation, cstrncatErr1RequiresViolation, cstrncatErr2RequiresViolation, cstrncatErr8RequiresViolation, cstrncatErr6RequiresViolation, cstrncatErr4RequiresViolation]=== [2018-04-09 19:56:30,347 INFO L82 PathProgramCache]: Analyzing trace with hash 223362371, 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-04-09 19:56:30,368 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-04-09 19:56:30,392 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-09 19:56:30,395 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-09 19:56:30,401 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-04-09 19:56:30,401 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-09 19:56:30,404 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-09 19:56:30,404 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:12, output treesize:7 [2018-04-09 19:56:30,595 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-09 19:56:30,595 INFO L314 TraceCheckSpWp]: Computing backward predicates... [2018-04-09 19:56:31,021 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-09 19:56:31,042 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-04-09 19:56:31,043 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 17] total 33 [2018-04-09 19:56:31,043 INFO L442 AbstractCegarLoop]: Interpolant automaton has 34 states [2018-04-09 19:56:31,043 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 34 interpolants. [2018-04-09 19:56:31,044 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=99, Invalid=1023, Unknown=0, NotChecked=0, Total=1122 [2018-04-09 19:56:31,044 INFO L87 Difference]: Start difference. First operand 179 states and 194 transitions. Second operand 34 states. [2018-04-09 19:56:32,413 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-09 19:56:32,413 INFO L93 Difference]: Finished difference Result 335 states and 366 transitions. [2018-04-09 19:56:32,414 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 33 states. [2018-04-09 19:56:32,414 INFO L78 Accepts]: Start accepts. Automaton has 34 states. Word has length 59 [2018-04-09 19:56:32,414 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-09 19:56:32,415 INFO L225 Difference]: With dead ends: 335 [2018-04-09 19:56:32,415 INFO L226 Difference]: Without dead ends: 334 [2018-04-09 19:56:32,416 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 145 GetRequests, 85 SyntacticMatches, 0 SemanticMatches, 60 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 590 ImplicationChecksByTransitivity, 1.4s TimeCoverageRelationStatistics Valid=523, Invalid=3259, Unknown=0, NotChecked=0, Total=3782 [2018-04-09 19:56:32,417 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 334 states. [2018-04-09 19:56:32,428 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 334 to 273. [2018-04-09 19:56:32,428 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 273 states. [2018-04-09 19:56:32,429 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 273 states to 273 states and 298 transitions. [2018-04-09 19:56:32,429 INFO L78 Accepts]: Start accepts. Automaton has 273 states and 298 transitions. Word has length 59 [2018-04-09 19:56:32,430 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-09 19:56:32,430 INFO L459 AbstractCegarLoop]: Abstraction has 273 states and 298 transitions. [2018-04-09 19:56:32,430 INFO L460 AbstractCegarLoop]: Interpolant automaton has 34 states. [2018-04-09 19:56:32,430 INFO L276 IsEmpty]: Start isEmpty. Operand 273 states and 298 transitions. [2018-04-09 19:56:32,431 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2018-04-09 19:56:32,431 INFO L347 BasicCegarLoop]: Found error trace [2018-04-09 19:56:32,431 INFO L355 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-09 19:56:32,431 INFO L408 AbstractCegarLoop]: === Iteration 19 === [mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr4EnsuresViolationMEMORY_LEAK, mainErr0RequiresViolation, cstrncatErr7RequiresViolation, cstrncatErr5RequiresViolation, cstrncatErr0RequiresViolation, cstrncatErr3RequiresViolation, cstrncatErr9RequiresViolation, cstrncatErr1RequiresViolation, cstrncatErr2RequiresViolation, cstrncatErr8RequiresViolation, cstrncatErr6RequiresViolation, cstrncatErr4RequiresViolation]=== [2018-04-09 19:56:32,432 INFO L82 PathProgramCache]: Analyzing trace with hash 1771820582, 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-04-09 19:56:32,438 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-04-09 19:56:32,453 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-09 19:56:32,455 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-09 19:56:32,466 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-09 19:56:32,467 INFO L314 TraceCheckSpWp]: Computing backward predicates... [2018-04-09 19:56:32,483 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-09 19:56:32,504 INFO L320 seRefinementStrategy]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2018-04-09 19:56:32,504 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [5, 5] imperfect sequences [] total 7 [2018-04-09 19:56:32,505 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-04-09 19:56:32,505 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-04-09 19:56:32,505 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2018-04-09 19:56:32,505 INFO L87 Difference]: Start difference. First operand 273 states and 298 transitions. Second operand 7 states. [2018-04-09 19:56:32,541 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-09 19:56:32,541 INFO L93 Difference]: Finished difference Result 412 states and 449 transitions. [2018-04-09 19:56:32,542 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-04-09 19:56:32,542 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 60 [2018-04-09 19:56:32,542 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-09 19:56:32,543 INFO L225 Difference]: With dead ends: 412 [2018-04-09 19:56:32,543 INFO L226 Difference]: Without dead ends: 271 [2018-04-09 19:56:32,544 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 119 GetRequests, 113 SyntacticMatches, 1 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2018-04-09 19:56:32,544 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 271 states. [2018-04-09 19:56:32,553 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 271 to 271. [2018-04-09 19:56:32,553 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 271 states. [2018-04-09 19:56:32,554 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 271 states to 271 states and 294 transitions. [2018-04-09 19:56:32,554 INFO L78 Accepts]: Start accepts. Automaton has 271 states and 294 transitions. Word has length 60 [2018-04-09 19:56:32,554 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-09 19:56:32,554 INFO L459 AbstractCegarLoop]: Abstraction has 271 states and 294 transitions. [2018-04-09 19:56:32,554 INFO L460 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-04-09 19:56:32,555 INFO L276 IsEmpty]: Start isEmpty. Operand 271 states and 294 transitions. [2018-04-09 19:56:32,555 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2018-04-09 19:56:32,555 INFO L347 BasicCegarLoop]: Found error trace [2018-04-09 19:56:32,555 INFO L355 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-09 19:56:32,555 INFO L408 AbstractCegarLoop]: === Iteration 20 === [mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr4EnsuresViolationMEMORY_LEAK, mainErr0RequiresViolation, cstrncatErr7RequiresViolation, cstrncatErr5RequiresViolation, cstrncatErr0RequiresViolation, cstrncatErr3RequiresViolation, cstrncatErr9RequiresViolation, cstrncatErr1RequiresViolation, cstrncatErr2RequiresViolation, cstrncatErr8RequiresViolation, cstrncatErr6RequiresViolation, cstrncatErr4RequiresViolation]=== [2018-04-09 19:56:32,555 INFO L82 PathProgramCache]: Analyzing trace with hash 8763489, 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-04-09 19:56:32,564 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-04-09 19:56:32,584 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-09 19:56:32,586 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-09 19:56:32,652 INFO L700 Elim1Store]: detected not equals via solver [2018-04-09 19:56:32,653 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 20 treesize of output 27 [2018-04-09 19:56:32,655 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 15 [2018-04-09 19:56:32,656 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-09 19:56:32,664 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-09 19:56:32,668 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2018-04-09 19:56:32,668 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:23, output treesize:15 [2018-04-09 19:56:32,706 WARN L1033 $PredicateComparison]: unable to prove that (exists ((|main_#t~malloc13.base| Int)) (let ((.cse0 (store |c_old(#valid)| |main_#t~malloc13.base| 1))) (and (= (select .cse0 |c_main_#t~malloc14.base|) 0) (= 0 (select |c_old(#valid)| |main_#t~malloc13.base|)) (= |c_#valid| (store (store .cse0 |c_main_#t~malloc14.base| 1) |main_#t~malloc13.base| 0))))) is different from true [2018-04-09 19:56:32,713 WARN L1033 $PredicateComparison]: unable to prove that (exists ((|main_#t~malloc13.base| Int) (|main_#t~malloc14.base| Int)) (let ((.cse0 (store |c_old(#valid)| |main_#t~malloc13.base| 1))) (and (= (select .cse0 |main_#t~malloc14.base|) 0) (= 0 (select |c_old(#valid)| |main_#t~malloc13.base|)) (= |c_#valid| (store (store (store .cse0 |main_#t~malloc14.base| 1) |main_#t~malloc13.base| 0) |main_#t~malloc14.base| 0))))) is different from true [2018-04-09 19:56:32,731 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-09 19:56:32,732 INFO L314 TraceCheckSpWp]: Computing backward predicates... [2018-04-09 19:56:32,761 WARN L1011 $PredicateComparison]: unable to prove that (forall ((|v_main_#t~malloc14.base_22| Int)) (or (= |c_old(#valid)| (store (store (store |c_#valid| |v_main_#t~malloc14.base_22| 1) |c_main_#t~malloc13.base| 0) |v_main_#t~malloc14.base_22| 0)) (not (= (select |c_#valid| |v_main_#t~malloc14.base_22|) 0)))) is different from false [2018-04-09 19:56:32,767 WARN L1011 $PredicateComparison]: unable to prove that (forall ((|v_main_#t~malloc14.base_22| Int) (|v_main_#t~malloc13.base_21| Int)) (let ((.cse0 (store |c_#valid| |v_main_#t~malloc13.base_21| 1))) (or (= (store (store (store .cse0 |v_main_#t~malloc14.base_22| 1) |v_main_#t~malloc13.base_21| 0) |v_main_#t~malloc14.base_22| 0) |c_old(#valid)|) (not (= (select |c_#valid| |v_main_#t~malloc13.base_21|) 0)) (not (= (select .cse0 |v_main_#t~malloc14.base_22|) 0))))) is different from false [2018-04-09 19:56:32,782 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-09 19:56:32,804 INFO L320 seRefinementStrategy]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2018-04-09 19:56:32,804 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [7, 6] imperfect sequences [] total 11 [2018-04-09 19:56:32,805 INFO L442 AbstractCegarLoop]: Interpolant automaton has 12 states [2018-04-09 19:56:32,805 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2018-04-09 19:56:32,805 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=45, Unknown=4, NotChecked=60, Total=132 [2018-04-09 19:56:32,805 INFO L87 Difference]: Start difference. First operand 271 states and 294 transitions. Second operand 12 states. [2018-04-09 19:56:32,824 WARN L1011 $PredicateComparison]: unable to prove that (and (= |c_#valid| |c_old(#valid)|) (forall ((|v_main_#t~malloc14.base_22| Int) (|v_main_#t~malloc13.base_21| Int)) (let ((.cse0 (store |c_#valid| |v_main_#t~malloc13.base_21| 1))) (or (= (store (store (store .cse0 |v_main_#t~malloc14.base_22| 1) |v_main_#t~malloc13.base_21| 0) |v_main_#t~malloc14.base_22| 0) |c_old(#valid)|) (not (= (select |c_#valid| |v_main_#t~malloc13.base_21|) 0)) (not (= (select .cse0 |v_main_#t~malloc14.base_22|) 0)))))) is different from false [2018-04-09 19:56:33,325 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-09 19:56:33,325 INFO L93 Difference]: Finished difference Result 407 states and 441 transitions. [2018-04-09 19:56:33,326 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-04-09 19:56:33,326 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 60 [2018-04-09 19:56:33,326 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-09 19:56:33,328 INFO L225 Difference]: With dead ends: 407 [2018-04-09 19:56:33,328 INFO L226 Difference]: Without dead ends: 388 [2018-04-09 19:56:33,329 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 127 GetRequests, 109 SyntacticMatches, 2 SemanticMatches, 16 ConstructedPredicates, 5 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=45, Invalid=125, Unknown=6, NotChecked=130, Total=306 [2018-04-09 19:56:33,329 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 388 states. [2018-04-09 19:56:33,344 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 388 to 270. [2018-04-09 19:56:33,345 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 270 states. [2018-04-09 19:56:33,346 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 270 states to 270 states and 292 transitions. [2018-04-09 19:56:33,346 INFO L78 Accepts]: Start accepts. Automaton has 270 states and 292 transitions. Word has length 60 [2018-04-09 19:56:33,347 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-09 19:56:33,347 INFO L459 AbstractCegarLoop]: Abstraction has 270 states and 292 transitions. [2018-04-09 19:56:33,347 INFO L460 AbstractCegarLoop]: Interpolant automaton has 12 states. [2018-04-09 19:56:33,347 INFO L276 IsEmpty]: Start isEmpty. Operand 270 states and 292 transitions. [2018-04-09 19:56:33,348 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2018-04-09 19:56:33,348 INFO L347 BasicCegarLoop]: Found error trace [2018-04-09 19:56:33,348 INFO L355 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-09 19:56:33,348 INFO L408 AbstractCegarLoop]: === Iteration 21 === [mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr4EnsuresViolationMEMORY_LEAK, mainErr0RequiresViolation, cstrncatErr7RequiresViolation, cstrncatErr5RequiresViolation, cstrncatErr0RequiresViolation, cstrncatErr3RequiresViolation, cstrncatErr9RequiresViolation, cstrncatErr1RequiresViolation, cstrncatErr2RequiresViolation, cstrncatErr8RequiresViolation, cstrncatErr6RequiresViolation, cstrncatErr4RequiresViolation]=== [2018-04-09 19:56:33,348 INFO L82 PathProgramCache]: Analyzing trace with hash -1710677306, 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-04-09 19:56:33,355 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-04-09 19:56:33,375 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-09 19:56:33,377 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-09 19:56:33,580 INFO L700 Elim1Store]: detected not equals via solver [2018-04-09 19:56:33,581 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 20 treesize of output 27 [2018-04-09 19:56:33,594 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 15 [2018-04-09 19:56:33,594 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-09 19:56:33,611 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-09 19:56:33,643 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2018-04-09 19:56:33,644 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:23, output treesize:15 [2018-04-09 19:56:33,739 WARN L1033 $PredicateComparison]: unable to prove that (exists ((|main_#t~malloc13.base| Int)) (let ((.cse0 (store |c_old(#valid)| |main_#t~malloc13.base| 1))) (and (= (select .cse0 |c_main_#t~malloc14.base|) 0) (= 0 (select |c_old(#valid)| |main_#t~malloc13.base|)) (= |c_#valid| (store (store .cse0 |c_main_#t~malloc14.base| 1) |main_#t~malloc13.base| 0))))) is different from true [2018-04-09 19:56:33,757 WARN L1033 $PredicateComparison]: unable to prove that (exists ((|main_#t~malloc13.base| Int) (|main_#t~malloc14.base| Int)) (let ((.cse0 (store |c_old(#valid)| |main_#t~malloc13.base| 1))) (and (= (select .cse0 |main_#t~malloc14.base|) 0) (= 0 (select |c_old(#valid)| |main_#t~malloc13.base|)) (= |c_#valid| (store (store (store .cse0 |main_#t~malloc14.base| 1) |main_#t~malloc13.base| 0) |main_#t~malloc14.base| 0))))) is different from true [2018-04-09 19:56:33,765 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-09 19:56:33,765 INFO L314 TraceCheckSpWp]: Computing backward predicates... [2018-04-09 19:56:33,851 WARN L1011 $PredicateComparison]: unable to prove that (forall ((|v_main_#t~malloc14.base_24| Int)) (or (= (store (store (store |c_#valid| |v_main_#t~malloc14.base_24| 1) |c_main_#t~malloc13.base| 0) |v_main_#t~malloc14.base_24| 0) |c_old(#valid)|) (not (= (select |c_#valid| |v_main_#t~malloc14.base_24|) 0)))) is different from false [2018-04-09 19:56:33,864 WARN L1011 $PredicateComparison]: unable to prove that (forall ((|v_main_#t~malloc14.base_24| Int) (|v_main_#t~malloc13.base_23| Int)) (let ((.cse0 (store |c_#valid| |v_main_#t~malloc13.base_23| 1))) (or (not (= (select .cse0 |v_main_#t~malloc14.base_24|) 0)) (not (= (select |c_#valid| |v_main_#t~malloc13.base_23|) 0)) (= |c_old(#valid)| (store (store (store .cse0 |v_main_#t~malloc14.base_24| 1) |v_main_#t~malloc13.base_23| 0) |v_main_#t~malloc14.base_24| 0))))) is different from false [2018-04-09 19:56:33,894 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-09 19:56:33,916 INFO L320 seRefinementStrategy]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2018-04-09 19:56:33,916 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [7, 6] imperfect sequences [] total 11 [2018-04-09 19:56:33,916 INFO L442 AbstractCegarLoop]: Interpolant automaton has 12 states [2018-04-09 19:56:33,916 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2018-04-09 19:56:33,917 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=45, Unknown=4, NotChecked=60, Total=132 [2018-04-09 19:56:33,917 INFO L87 Difference]: Start difference. First operand 270 states and 292 transitions. Second operand 12 states. [2018-04-09 19:56:33,932 WARN L1011 $PredicateComparison]: unable to prove that (and (forall ((|v_main_#t~malloc14.base_24| Int) (|v_main_#t~malloc13.base_23| Int)) (let ((.cse0 (store |c_#valid| |v_main_#t~malloc13.base_23| 1))) (or (not (= (select .cse0 |v_main_#t~malloc14.base_24|) 0)) (not (= (select |c_#valid| |v_main_#t~malloc13.base_23|) 0)) (= |c_old(#valid)| (store (store (store .cse0 |v_main_#t~malloc14.base_24| 1) |v_main_#t~malloc13.base_23| 0) |v_main_#t~malloc14.base_24| 0))))) (= |c_#valid| |c_old(#valid)|)) is different from false [2018-04-09 19:56:34,386 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-09 19:56:34,386 INFO L93 Difference]: Finished difference Result 408 states and 442 transitions. [2018-04-09 19:56:34,386 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-04-09 19:56:34,386 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 60 [2018-04-09 19:56:34,387 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-09 19:56:34,388 INFO L225 Difference]: With dead ends: 408 [2018-04-09 19:56:34,389 INFO L226 Difference]: Without dead ends: 389 [2018-04-09 19:56:34,392 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 127 GetRequests, 109 SyntacticMatches, 2 SemanticMatches, 16 ConstructedPredicates, 5 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=45, Invalid=125, Unknown=6, NotChecked=130, Total=306 [2018-04-09 19:56:34,393 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 389 states. [2018-04-09 19:56:34,409 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 389 to 272. [2018-04-09 19:56:34,409 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 272 states. [2018-04-09 19:56:34,411 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 272 states to 272 states and 295 transitions. [2018-04-09 19:56:34,411 INFO L78 Accepts]: Start accepts. Automaton has 272 states and 295 transitions. Word has length 60 [2018-04-09 19:56:34,411 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-09 19:56:34,412 INFO L459 AbstractCegarLoop]: Abstraction has 272 states and 295 transitions. [2018-04-09 19:56:34,412 INFO L460 AbstractCegarLoop]: Interpolant automaton has 12 states. [2018-04-09 19:56:34,412 INFO L276 IsEmpty]: Start isEmpty. Operand 272 states and 295 transitions. [2018-04-09 19:56:34,413 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2018-04-09 19:56:34,413 INFO L347 BasicCegarLoop]: Found error trace [2018-04-09 19:56:34,413 INFO L355 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-09 19:56:34,413 INFO L408 AbstractCegarLoop]: === Iteration 22 === [mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr4EnsuresViolationMEMORY_LEAK, mainErr0RequiresViolation, cstrncatErr7RequiresViolation, cstrncatErr5RequiresViolation, cstrncatErr0RequiresViolation, cstrncatErr3RequiresViolation, cstrncatErr9RequiresViolation, cstrncatErr1RequiresViolation, cstrncatErr2RequiresViolation, cstrncatErr8RequiresViolation, cstrncatErr6RequiresViolation, cstrncatErr4RequiresViolation]=== [2018-04-09 19:56:34,413 INFO L82 PathProgramCache]: Analyzing trace with hash -1337420224, 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-04-09 19:56:34,422 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-04-09 19:56:34,441 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-09 19:56:34,443 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-09 19:56:34,583 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-04-09 19:56:34,584 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-09 19:56:34,633 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-04-09 19:56:34,633 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-09 19:56:34,674 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-09 19:56:34,675 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:24, output treesize:19 [2018-04-09 19:56:34,780 INFO L700 Elim1Store]: detected not equals via solver [2018-04-09 19:56:34,781 INFO L700 Elim1Store]: detected not equals via solver [2018-04-09 19:56:34,782 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 23 [2018-04-09 19:56:34,782 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-09 19:56:34,817 INFO L700 Elim1Store]: detected not equals via solver [2018-04-09 19:56:34,818 INFO L700 Elim1Store]: detected not equals via solver [2018-04-09 19:56:34,819 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 4 [2018-04-09 19:56:34,819 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-09 19:56:34,827 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-09 19:56:34,828 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:30, output treesize:18 [2018-04-09 19:56:35,080 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-09 19:56:35,080 INFO L314 TraceCheckSpWp]: Computing backward predicates... [2018-04-09 19:56:35,361 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 10 treesize of output 3 [2018-04-09 19:56:35,361 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-09 19:56:35,365 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 15 [2018-04-09 19:56:35,374 WARN L307 Elim1Store]: Array PQE input equivalent to true [2018-04-09 19:56:35,374 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-04-09 19:56:35,376 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-04-09 19:56:35,376 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-04-09 19:56:35,378 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-09 19:56:35,381 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-09 19:56:35,381 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 4 variables, input treesize:21, output treesize:3 [2018-04-09 19:56:35,425 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-09 19:56:35,458 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-04-09 19:56:35,458 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 13] total 25 [2018-04-09 19:56:35,459 INFO L442 AbstractCegarLoop]: Interpolant automaton has 26 states [2018-04-09 19:56:35,459 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2018-04-09 19:56:35,459 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=71, Invalid=579, Unknown=0, NotChecked=0, Total=650 [2018-04-09 19:56:35,459 INFO L87 Difference]: Start difference. First operand 272 states and 295 transitions. Second operand 26 states. [2018-04-09 19:56:36,249 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-09 19:56:36,249 INFO L93 Difference]: Finished difference Result 311 states and 336 transitions. [2018-04-09 19:56:36,252 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2018-04-09 19:56:36,252 INFO L78 Accepts]: Start accepts. Automaton has 26 states. Word has length 60 [2018-04-09 19:56:36,252 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-09 19:56:36,254 INFO L225 Difference]: With dead ends: 311 [2018-04-09 19:56:36,254 INFO L226 Difference]: Without dead ends: 305 [2018-04-09 19:56:36,255 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 132 GetRequests, 94 SyntacticMatches, 1 SemanticMatches, 37 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 261 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=220, Invalid=1262, Unknown=0, NotChecked=0, Total=1482 [2018-04-09 19:56:36,255 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 305 states. [2018-04-09 19:56:36,270 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 305 to 273. [2018-04-09 19:56:36,270 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 273 states. [2018-04-09 19:56:36,272 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 273 states to 273 states and 295 transitions. [2018-04-09 19:56:36,272 INFO L78 Accepts]: Start accepts. Automaton has 273 states and 295 transitions. Word has length 60 [2018-04-09 19:56:36,273 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-09 19:56:36,273 INFO L459 AbstractCegarLoop]: Abstraction has 273 states and 295 transitions. [2018-04-09 19:56:36,273 INFO L460 AbstractCegarLoop]: Interpolant automaton has 26 states. [2018-04-09 19:56:36,273 INFO L276 IsEmpty]: Start isEmpty. Operand 273 states and 295 transitions. [2018-04-09 19:56:36,274 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 62 [2018-04-09 19:56:36,274 INFO L347 BasicCegarLoop]: Found error trace [2018-04-09 19:56:36,274 INFO L355 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-09 19:56:36,274 INFO L408 AbstractCegarLoop]: === Iteration 23 === [mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr4EnsuresViolationMEMORY_LEAK, mainErr0RequiresViolation, cstrncatErr7RequiresViolation, cstrncatErr5RequiresViolation, cstrncatErr0RequiresViolation, cstrncatErr3RequiresViolation, cstrncatErr9RequiresViolation, cstrncatErr1RequiresViolation, cstrncatErr2RequiresViolation, cstrncatErr8RequiresViolation, cstrncatErr6RequiresViolation, cstrncatErr4RequiresViolation]=== [2018-04-09 19:56:36,274 INFO L82 PathProgramCache]: Analyzing trace with hash -2138307650, 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-04-09 19:56:36,286 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-04-09 19:56:36,313 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-09 19:56:36,315 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-09 19:56:36,394 INFO L700 Elim1Store]: detected not equals via solver [2018-04-09 19:56:36,395 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 20 treesize of output 27 [2018-04-09 19:56:36,398 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 15 [2018-04-09 19:56:36,398 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-09 19:56:36,403 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-09 19:56:36,409 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2018-04-09 19:56:36,409 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:23, output treesize:15 [2018-04-09 19:56:36,454 WARN L1033 $PredicateComparison]: unable to prove that (exists ((|main_#t~malloc13.base| Int)) (let ((.cse0 (store |c_old(#valid)| |main_#t~malloc13.base| 1))) (and (= (select .cse0 |c_main_#t~malloc14.base|) 0) (= 0 (select |c_old(#valid)| |main_#t~malloc13.base|)) (= |c_#valid| (store (store .cse0 |c_main_#t~malloc14.base| 1) |main_#t~malloc13.base| 0))))) is different from true [2018-04-09 19:56:36,462 WARN L1033 $PredicateComparison]: unable to prove that (exists ((|main_#t~malloc13.base| Int) (|main_#t~malloc14.base| Int)) (let ((.cse0 (store |c_old(#valid)| |main_#t~malloc13.base| 1))) (and (= (select .cse0 |main_#t~malloc14.base|) 0) (= 0 (select |c_old(#valid)| |main_#t~malloc13.base|)) (= |c_#valid| (store (store (store .cse0 |main_#t~malloc14.base| 1) |main_#t~malloc13.base| 0) |main_#t~malloc14.base| 0))))) is different from true [2018-04-09 19:56:36,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-04-09 19:56:36,475 INFO L314 TraceCheckSpWp]: Computing backward predicates... [2018-04-09 19:56:36,516 WARN L1011 $PredicateComparison]: unable to prove that (forall ((|v_main_#t~malloc14.base_27| Int)) (or (= (store (store (store |c_#valid| |v_main_#t~malloc14.base_27| 1) |c_main_#t~malloc13.base| 0) |v_main_#t~malloc14.base_27| 0) |c_old(#valid)|) (not (= 0 (select |c_#valid| |v_main_#t~malloc14.base_27|))))) is different from false [2018-04-09 19:56:36,524 WARN L1011 $PredicateComparison]: unable to prove that (forall ((|v_main_#t~malloc13.base_26| Int) (|v_main_#t~malloc14.base_27| Int)) (let ((.cse0 (store |c_#valid| |v_main_#t~malloc13.base_26| 1))) (or (not (= (select .cse0 |v_main_#t~malloc14.base_27|) 0)) (not (= 0 (select |c_#valid| |v_main_#t~malloc13.base_26|))) (= (store (store (store .cse0 |v_main_#t~malloc14.base_27| 1) |v_main_#t~malloc13.base_26| 0) |v_main_#t~malloc14.base_27| 0) |c_old(#valid)|)))) is different from false [2018-04-09 19:56:36,547 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-09 19:56:36,582 INFO L320 seRefinementStrategy]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2018-04-09 19:56:36,582 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [7, 6] imperfect sequences [] total 11 [2018-04-09 19:56:36,582 INFO L442 AbstractCegarLoop]: Interpolant automaton has 12 states [2018-04-09 19:56:36,583 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2018-04-09 19:56:36,583 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=45, Unknown=4, NotChecked=60, Total=132 [2018-04-09 19:56:36,583 INFO L87 Difference]: Start difference. First operand 273 states and 295 transitions. Second operand 12 states. [2018-04-09 19:56:36,625 WARN L1011 $PredicateComparison]: unable to prove that (and (forall ((|v_main_#t~malloc13.base_26| Int) (|v_main_#t~malloc14.base_27| Int)) (let ((.cse0 (store |c_#valid| |v_main_#t~malloc13.base_26| 1))) (or (not (= (select .cse0 |v_main_#t~malloc14.base_27|) 0)) (not (= 0 (select |c_#valid| |v_main_#t~malloc13.base_26|))) (= (store (store (store .cse0 |v_main_#t~malloc14.base_27| 1) |v_main_#t~malloc13.base_26| 0) |v_main_#t~malloc14.base_27| 0) |c_old(#valid)|)))) (= |c_#valid| |c_old(#valid)|)) is different from false [2018-04-09 19:56:37,412 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-09 19:56:37,412 INFO L93 Difference]: Finished difference Result 276 states and 295 transitions. [2018-04-09 19:56:37,412 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-04-09 19:56:37,412 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 61 [2018-04-09 19:56:37,412 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-09 19:56:37,413 INFO L225 Difference]: With dead ends: 276 [2018-04-09 19:56:37,413 INFO L226 Difference]: Without dead ends: 256 [2018-04-09 19:56:37,413 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 129 GetRequests, 111 SyntacticMatches, 2 SemanticMatches, 16 ConstructedPredicates, 5 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=45, Invalid=125, Unknown=6, NotChecked=130, Total=306 [2018-04-09 19:56:37,414 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 256 states. [2018-04-09 19:56:37,424 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 256 to 137. [2018-04-09 19:56:37,424 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 137 states. [2018-04-09 19:56:37,425 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 137 states to 137 states and 144 transitions. [2018-04-09 19:56:37,425 INFO L78 Accepts]: Start accepts. Automaton has 137 states and 144 transitions. Word has length 61 [2018-04-09 19:56:37,425 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-09 19:56:37,426 INFO L459 AbstractCegarLoop]: Abstraction has 137 states and 144 transitions. [2018-04-09 19:56:37,426 INFO L460 AbstractCegarLoop]: Interpolant automaton has 12 states. [2018-04-09 19:56:37,426 INFO L276 IsEmpty]: Start isEmpty. Operand 137 states and 144 transitions. [2018-04-09 19:56:37,426 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2018-04-09 19:56:37,427 INFO L347 BasicCegarLoop]: Found error trace [2018-04-09 19:56:37,427 INFO L355 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-09 19:56:37,427 INFO L408 AbstractCegarLoop]: === Iteration 24 === [mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr4EnsuresViolationMEMORY_LEAK, mainErr0RequiresViolation, cstrncatErr7RequiresViolation, cstrncatErr5RequiresViolation, cstrncatErr0RequiresViolation, cstrncatErr3RequiresViolation, cstrncatErr9RequiresViolation, cstrncatErr1RequiresViolation, cstrncatErr2RequiresViolation, cstrncatErr8RequiresViolation, cstrncatErr6RequiresViolation, cstrncatErr4RequiresViolation]=== [2018-04-09 19:56:37,427 INFO L82 PathProgramCache]: Analyzing trace with hash -484778563, 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-04-09 19:56:37,436 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-04-09 19:56:37,465 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-09 19:56:37,469 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-09 19:56:37,480 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-04-09 19:56:37,480 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-09 19:56:37,491 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-04-09 19:56:37,491 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-09 19:56:37,500 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-09 19:56:37,500 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:24, output treesize:19 [2018-04-09 19:56:37,525 INFO L700 Elim1Store]: detected not equals via solver [2018-04-09 19:56:37,526 INFO L700 Elim1Store]: detected not equals via solver [2018-04-09 19:56:37,527 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 23 [2018-04-09 19:56:37,527 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-09 19:56:37,539 INFO L700 Elim1Store]: detected not equals via solver [2018-04-09 19:56:37,540 INFO L700 Elim1Store]: detected not equals via solver [2018-04-09 19:56:37,541 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 4 [2018-04-09 19:56:37,541 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-09 19:56:37,547 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-09 19:56:37,547 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:30, output treesize:16 [2018-04-09 19:56:37,936 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-09 19:56:37,936 INFO L314 TraceCheckSpWp]: Computing backward predicates... [2018-04-09 19:56:38,456 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 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 3 [2018-04-09 19:56:38,456 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-09 19:56:38,460 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 15 [2018-04-09 19:56:38,478 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-04-09 19:56:38,478 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-04-09 19:56:38,479 WARN L307 Elim1Store]: Array PQE input equivalent to true [2018-04-09 19:56:38,479 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-04-09 19:56:38,482 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-09 19:56:38,485 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-09 19:56:38,485 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 4 variables, input treesize:24, output treesize:7 [2018-04-09 19:56:38,523 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-09 19:56:38,543 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-04-09 19:56:38,543 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [24, 21] total 43 [2018-04-09 19:56:38,544 INFO L442 AbstractCegarLoop]: Interpolant automaton has 44 states [2018-04-09 19:56:38,544 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 44 interpolants. [2018-04-09 19:56:38,544 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=135, Invalid=1757, Unknown=0, NotChecked=0, Total=1892 [2018-04-09 19:56:38,545 INFO L87 Difference]: Start difference. First operand 137 states and 144 transitions. Second operand 44 states. [2018-04-09 19:56:41,526 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-09 19:56:41,526 INFO L93 Difference]: Finished difference Result 210 states and 220 transitions. [2018-04-09 19:56:41,526 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 49 states. [2018-04-09 19:56:41,526 INFO L78 Accepts]: Start accepts. Automaton has 44 states. Word has length 66 [2018-04-09 19:56:41,526 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-09 19:56:41,527 INFO L225 Difference]: With dead ends: 210 [2018-04-09 19:56:41,527 INFO L226 Difference]: Without dead ends: 209 [2018-04-09 19:56:41,529 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 175 GetRequests, 88 SyntacticMatches, 1 SemanticMatches, 86 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1599 ImplicationChecksByTransitivity, 3.1s TimeCoverageRelationStatistics Valid=861, Invalid=6795, Unknown=0, NotChecked=0, Total=7656 [2018-04-09 19:56:41,529 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 209 states. [2018-04-09 19:56:41,539 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 209 to 166. [2018-04-09 19:56:41,539 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 166 states. [2018-04-09 19:56:41,540 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 166 states to 166 states and 175 transitions. [2018-04-09 19:56:41,540 INFO L78 Accepts]: Start accepts. Automaton has 166 states and 175 transitions. Word has length 66 [2018-04-09 19:56:41,540 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-09 19:56:41,540 INFO L459 AbstractCegarLoop]: Abstraction has 166 states and 175 transitions. [2018-04-09 19:56:41,540 INFO L460 AbstractCegarLoop]: Interpolant automaton has 44 states. [2018-04-09 19:56:41,540 INFO L276 IsEmpty]: Start isEmpty. Operand 166 states and 175 transitions. [2018-04-09 19:56:41,541 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2018-04-09 19:56:41,541 INFO L347 BasicCegarLoop]: Found error trace [2018-04-09 19:56:41,541 INFO L355 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-09 19:56:41,541 INFO L408 AbstractCegarLoop]: === Iteration 25 === [mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr4EnsuresViolationMEMORY_LEAK, mainErr0RequiresViolation, cstrncatErr7RequiresViolation, cstrncatErr5RequiresViolation, cstrncatErr0RequiresViolation, cstrncatErr3RequiresViolation, cstrncatErr9RequiresViolation, cstrncatErr1RequiresViolation, cstrncatErr2RequiresViolation, cstrncatErr8RequiresViolation, cstrncatErr6RequiresViolation, cstrncatErr4RequiresViolation]=== [2018-04-09 19:56:41,541 INFO L82 PathProgramCache]: Analyzing trace with hash -1814952698, now seen corresponding path program 1 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-04-09 19:56:41,553 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-04-09 19:56:41,571 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-09 19:56:41,573 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-09 19:56:41,585 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-04-09 19:56:41,585 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-09 19:56:41,591 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-04-09 19:56:41,591 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-09 19:56:41,596 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-09 19:56:41,597 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:24, output treesize:19 [2018-04-09 19:56:41,615 INFO L700 Elim1Store]: detected not equals via solver [2018-04-09 19:56:41,616 INFO L700 Elim1Store]: detected not equals via solver [2018-04-09 19:56:41,616 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 4 [2018-04-09 19:56:41,616 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-09 19:56:41,624 INFO L700 Elim1Store]: detected not equals via solver [2018-04-09 19:56:41,625 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 23 [2018-04-09 19:56:41,625 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-09 19:56:41,631 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-09 19:56:41,632 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:30, output treesize:19 [2018-04-09 19:56:41,655 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 13 [2018-04-09 19:56:41,657 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 12 [2018-04-09 19:56:41,657 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-09 19:56:41,658 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-09 19:56:41,664 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-04-09 19:56:41,664 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:34, output treesize:30 [2018-04-09 19:56:41,824 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 20 treesize of output 16 [2018-04-09 19:56:41,830 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 1 case distinctions, treesize of input 16 treesize of output 13 [2018-04-09 19:56:41,831 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 2 xjuncts. [2018-04-09 19:56:41,834 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-04-09 19:56:41,843 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: 3 dim-0 vars, and 2 xjuncts. [2018-04-09 19:56:41,843 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:40, output treesize:55 [2018-04-09 19:56:42,100 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-09 19:56:42,100 INFO L314 TraceCheckSpWp]: Computing backward predicates... [2018-04-09 19:56:42,529 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 13 treesize of output 11 [2018-04-09 19:56:42,537 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2018-04-09 19:56:42,537 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-09 19:56:42,538 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-09 19:56:42,542 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-04-09 19:56:42,542 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:24, output treesize:14 [2018-04-09 19:56:42,656 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 10 treesize of output 3 [2018-04-09 19:56:42,656 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-09 19:56:42,660 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 15 [2018-04-09 19:56:42,667 WARN L307 Elim1Store]: Array PQE input equivalent to true [2018-04-09 19:56:42,667 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-04-09 19:56:42,668 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-04-09 19:56:42,668 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-04-09 19:56:42,671 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-09 19:56:42,674 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-09 19:56:42,674 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 4 variables, input treesize:24, output treesize:7 [2018-04-09 19:56:42,739 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-09 19:56:42,759 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-04-09 19:56:42,760 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [22, 21] total 41 [2018-04-09 19:56:42,760 INFO L442 AbstractCegarLoop]: Interpolant automaton has 42 states [2018-04-09 19:56:42,760 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 42 interpolants. [2018-04-09 19:56:42,760 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=132, Invalid=1590, Unknown=0, NotChecked=0, Total=1722 [2018-04-09 19:56:42,761 INFO L87 Difference]: Start difference. First operand 166 states and 175 transitions. Second operand 42 states. [2018-04-09 19:56:45,143 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-09 19:56:45,144 INFO L93 Difference]: Finished difference Result 194 states and 203 transitions. [2018-04-09 19:56:45,144 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 43 states. [2018-04-09 19:56:45,144 INFO L78 Accepts]: Start accepts. Automaton has 42 states. Word has length 67 [2018-04-09 19:56:45,144 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-09 19:56:45,145 INFO L225 Difference]: With dead ends: 194 [2018-04-09 19:56:45,145 INFO L226 Difference]: Without dead ends: 188 [2018-04-09 19:56:45,146 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 168 GetRequests, 92 SyntacticMatches, 1 SemanticMatches, 75 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1165 ImplicationChecksByTransitivity, 2.7s TimeCoverageRelationStatistics Valid=625, Invalid=5227, Unknown=0, NotChecked=0, Total=5852 [2018-04-09 19:56:45,146 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 188 states. [2018-04-09 19:56:45,153 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 188 to 144. [2018-04-09 19:56:45,154 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 144 states. [2018-04-09 19:56:45,154 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 144 states to 144 states and 152 transitions. [2018-04-09 19:56:45,154 INFO L78 Accepts]: Start accepts. Automaton has 144 states and 152 transitions. Word has length 67 [2018-04-09 19:56:45,154 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-09 19:56:45,154 INFO L459 AbstractCegarLoop]: Abstraction has 144 states and 152 transitions. [2018-04-09 19:56:45,154 INFO L460 AbstractCegarLoop]: Interpolant automaton has 42 states. [2018-04-09 19:56:45,154 INFO L276 IsEmpty]: Start isEmpty. Operand 144 states and 152 transitions. [2018-04-09 19:56:45,155 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 74 [2018-04-09 19:56:45,155 INFO L347 BasicCegarLoop]: Found error trace [2018-04-09 19:56:45,155 INFO L355 BasicCegarLoop]: trace histogram [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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-09 19:56:45,155 INFO L408 AbstractCegarLoop]: === Iteration 26 === [mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr4EnsuresViolationMEMORY_LEAK, mainErr0RequiresViolation, cstrncatErr7RequiresViolation, cstrncatErr5RequiresViolation, cstrncatErr0RequiresViolation, cstrncatErr3RequiresViolation, cstrncatErr9RequiresViolation, cstrncatErr1RequiresViolation, cstrncatErr2RequiresViolation, cstrncatErr8RequiresViolation, cstrncatErr6RequiresViolation, cstrncatErr4RequiresViolation]=== [2018-04-09 19:56:45,155 INFO L82 PathProgramCache]: Analyzing trace with hash 325820419, 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-04-09 19:56:45,161 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-04-09 19:56:45,184 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-09 19:56:45,187 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-09 19:56:45,197 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-04-09 19:56:45,197 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-09 19:56:45,211 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-04-09 19:56:45,211 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-09 19:56:45,217 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-09 19:56:45,217 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:24, output treesize:19 [2018-04-09 19:56:45,236 INFO L700 Elim1Store]: detected not equals via solver [2018-04-09 19:56:45,237 INFO L700 Elim1Store]: detected not equals via solver [2018-04-09 19:56:45,238 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 23 [2018-04-09 19:56:45,238 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-09 19:56:45,250 INFO L700 Elim1Store]: detected not equals via solver [2018-04-09 19:56:45,251 INFO L700 Elim1Store]: detected not equals via solver [2018-04-09 19:56:45,252 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 4 [2018-04-09 19:56:45,252 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-09 19:56:45,258 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-09 19:56:45,258 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:30, output treesize:16 [2018-04-09 19:56:45,676 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 0 proven. 20 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-09 19:56:45,677 INFO L314 TraceCheckSpWp]: Computing backward predicates... [2018-04-09 19:56:46,642 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 10 treesize of output 3 [2018-04-09 19:56:46,642 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-09 19:56:46,647 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 15 [2018-04-09 19:56:46,655 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-04-09 19:56:46,655 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-04-09 19:56:46,656 WARN L307 Elim1Store]: Array PQE input equivalent to true [2018-04-09 19:56:46,656 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-04-09 19:56:46,658 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-09 19:56:46,662 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-09 19:56:46,663 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 4 variables, input treesize:27, output treesize:10 [2018-04-09 19:56:46,714 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 0 proven. 20 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-09 19:56:46,735 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-04-09 19:56:46,735 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [28, 28] total 54 [2018-04-09 19:56:46,735 INFO L442 AbstractCegarLoop]: Interpolant automaton has 55 states [2018-04-09 19:56:46,736 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 55 interpolants. [2018-04-09 19:56:46,736 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=173, Invalid=2797, Unknown=0, NotChecked=0, Total=2970 [2018-04-09 19:56:46,737 INFO L87 Difference]: Start difference. First operand 144 states and 152 transitions. Second operand 55 states. [2018-04-09 19:56:51,368 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-09 19:56:51,369 INFO L93 Difference]: Finished difference Result 225 states and 236 transitions. [2018-04-09 19:56:51,369 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 64 states. [2018-04-09 19:56:51,369 INFO L78 Accepts]: Start accepts. Automaton has 55 states. Word has length 73 [2018-04-09 19:56:51,369 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-09 19:56:51,370 INFO L225 Difference]: With dead ends: 225 [2018-04-09 19:56:51,370 INFO L226 Difference]: Without dead ends: 224 [2018-04-09 19:56:51,372 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 204 GetRequests, 91 SyntacticMatches, 1 SemanticMatches, 112 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2762 ImplicationChecksByTransitivity, 4.9s TimeCoverageRelationStatistics Valid=1316, Invalid=11566, Unknown=0, NotChecked=0, Total=12882 [2018-04-09 19:56:51,372 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 224 states. [2018-04-09 19:56:51,380 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 224 to 173. [2018-04-09 19:56:51,380 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 173 states. [2018-04-09 19:56:51,381 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 173 states to 173 states and 183 transitions. [2018-04-09 19:56:51,381 INFO L78 Accepts]: Start accepts. Automaton has 173 states and 183 transitions. Word has length 73 [2018-04-09 19:56:51,382 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-09 19:56:51,382 INFO L459 AbstractCegarLoop]: Abstraction has 173 states and 183 transitions. [2018-04-09 19:56:51,382 INFO L460 AbstractCegarLoop]: Interpolant automaton has 55 states. [2018-04-09 19:56:51,382 INFO L276 IsEmpty]: Start isEmpty. Operand 173 states and 183 transitions. [2018-04-09 19:56:51,382 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 75 [2018-04-09 19:56:51,383 INFO L347 BasicCegarLoop]: Found error trace [2018-04-09 19:56:51,383 INFO L355 BasicCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-09 19:56:51,383 INFO L408 AbstractCegarLoop]: === Iteration 27 === [mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr4EnsuresViolationMEMORY_LEAK, mainErr0RequiresViolation, cstrncatErr7RequiresViolation, cstrncatErr5RequiresViolation, cstrncatErr0RequiresViolation, cstrncatErr3RequiresViolation, cstrncatErr9RequiresViolation, cstrncatErr1RequiresViolation, cstrncatErr2RequiresViolation, cstrncatErr8RequiresViolation, cstrncatErr6RequiresViolation, cstrncatErr4RequiresViolation]=== [2018-04-09 19:56:51,383 INFO L82 PathProgramCache]: Analyzing trace with hash 1838779264, now seen corresponding path program 2 times No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 28 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 28 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-04-09 19:56:51,397 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-04-09 19:56:51,420 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-09 19:56:51,424 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-09 19:56:51,427 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-04-09 19:56:51,427 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-09 19:56:51,431 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-04-09 19:56:51,432 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-09 19:56:51,435 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-09 19:56:51,435 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:16, output treesize:14 [2018-04-09 19:56:51,446 INFO L700 Elim1Store]: detected not equals via solver [2018-04-09 19:56:51,447 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 15 [2018-04-09 19:56:51,447 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-09 19:56:51,454 INFO L700 Elim1Store]: detected not equals via solver [2018-04-09 19:56:51,454 INFO L700 Elim1Store]: detected not equals via solver [2018-04-09 19:56:51,455 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 4 [2018-04-09 19:56:51,455 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-09 19:56:51,459 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-09 19:56:51,459 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:25, output treesize:18 [2018-04-09 19:56:51,476 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 18 treesize of output 15 [2018-04-09 19:56:51,477 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 14 [2018-04-09 19:56:51,478 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-09 19:56:51,479 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-09 19:56:51,482 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-04-09 19:56:51,483 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:28, output treesize:24 [2018-04-09 19:56:51,496 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 32 [2018-04-09 19:56:51,498 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 12 [2018-04-09 19:56:51,498 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-09 19:56:51,502 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-09 19:56:51,506 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2018-04-09 19:56:51,506 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:35, output treesize:31 [2018-04-09 19:56:51,688 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 34 treesize of output 32 [2018-04-09 19:56:51,694 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 1 case distinctions, treesize of input 18 treesize of output 15 [2018-04-09 19:56:51,695 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 2 xjuncts. [2018-04-09 19:56:51,702 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 10 treesize of output 1 [2018-04-09 19:56:51,702 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-04-09 19:56:51,705 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-04-09 19:56:51,710 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 2 xjuncts. [2018-04-09 19:56:51,710 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 3 variables, input treesize:41, output treesize:23 [2018-04-09 19:56:51,981 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 2 proven. 15 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-09 19:56:51,981 INFO L314 TraceCheckSpWp]: Computing backward predicates... [2018-04-09 19:56:52,817 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 13 treesize of output 11 [2018-04-09 19:56:52,827 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2018-04-09 19:56:52,827 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-09 19:56:52,829 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-09 19:56:52,833 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 2 xjuncts. [2018-04-09 19:56:52,834 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:31, output treesize:35 [2018-04-09 19:56:55,018 WARN L148 SmtUtils]: Spent 2013ms on a formula simplification that was a NOOP. DAG size: 34 [2018-04-09 19:56:57,147 WARN L148 SmtUtils]: Spent 2012ms on a formula simplification that was a NOOP. DAG size: 34 [2018-04-09 19:56:57,167 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 0 proven. 17 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-09 19:56:57,188 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-04-09 19:56:57,188 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [25, 23] total 47 [2018-04-09 19:56:57,188 INFO L442 AbstractCegarLoop]: Interpolant automaton has 48 states [2018-04-09 19:56:57,189 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 48 interpolants. [2018-04-09 19:56:57,189 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=154, Invalid=2102, Unknown=0, NotChecked=0, Total=2256 [2018-04-09 19:56:57,189 INFO L87 Difference]: Start difference. First operand 173 states and 183 transitions. Second operand 48 states. [2018-04-09 19:57:01,574 WARN L148 SmtUtils]: Spent 4011ms on a formula simplification that was a NOOP. DAG size: 34 [2018-04-09 19:57:05,634 WARN L148 SmtUtils]: Spent 4011ms on a formula simplification that was a NOOP. DAG size: 39 [2018-04-09 19:57:14,137 WARN L151 SmtUtils]: Spent 8449ms on a formula simplification. DAG size of input: 49 DAG size of output 45 [2018-04-09 19:57:24,143 WARN L151 SmtUtils]: Spent 9951ms on a formula simplification. DAG size of input: 69 DAG size of output 62 [2018-04-09 19:57:32,832 WARN L151 SmtUtils]: Spent 8618ms on a formula simplification. DAG size of input: 67 DAG size of output 60 [2018-04-09 19:57:42,894 WARN L148 SmtUtils]: Spent 6020ms on a formula simplification that was a NOOP. DAG size: 54 [2018-04-09 19:57:51,858 WARN L151 SmtUtils]: Spent 8907ms on a formula simplification. DAG size of input: 88 DAG size of output 74 [2018-04-09 19:58:13,497 WARN L151 SmtUtils]: Spent 17898ms on a formula simplification. DAG size of input: 86 DAG size of output 72 [2018-04-09 19:58:23,083 WARN L151 SmtUtils]: Spent 8917ms on a formula simplification. DAG size of input: 64 DAG size of output 57 [2018-04-09 19:58:32,815 WARN L151 SmtUtils]: Spent 9678ms on a formula simplification. DAG size of input: 71 DAG size of output 58 [2018-04-09 19:58:41,671 WARN L151 SmtUtils]: Spent 8777ms on a formula simplification. DAG size of input: 70 DAG size of output 55 [2018-04-09 19:58:54,253 WARN L151 SmtUtils]: Spent 8443ms on a formula simplification. DAG size of input: 63 DAG size of output 56 [2018-04-09 19:59:04,680 WARN L151 SmtUtils]: Spent 10368ms on a formula simplification. DAG size of input: 86 DAG size of output 66 [2018-04-09 19:59:21,106 WARN L151 SmtUtils]: Spent 16065ms on a formula simplification. DAG size of input: 73 DAG size of output 71 [2018-04-09 19:59:33,197 WARN L151 SmtUtils]: Spent 12041ms on a formula simplification. DAG size of input: 57 DAG size of output 55 [2018-04-09 19:59:42,827 WARN L151 SmtUtils]: Spent 9562ms on a formula simplification. DAG size of input: 67 DAG size of output 60 [2018-04-09 19:59:54,621 WARN L151 SmtUtils]: Spent 11691ms on a formula simplification. DAG size of input: 62 DAG size of output 53 [2018-04-09 20:00:07,733 WARN L151 SmtUtils]: Spent 8958ms on a formula simplification. DAG size of input: 59 DAG size of output 54 Received shutdown request... [2018-04-09 20:00:15,836 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 31 states. [2018-04-09 20:00:15,836 WARN L519 AbstractCegarLoop]: Verification canceled [2018-04-09 20:00:15,840 WARN L197 ceAbstractionStarter]: Timeout [2018-04-09 20:00:15,840 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 09.04 08:00:15 BoogieIcfgContainer [2018-04-09 20:00:15,840 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-04-09 20:00:15,840 INFO L168 Benchmark]: Toolchain (without parser) took 268945.87 ms. Allocated memory was 300.4 MB in the beginning and 659.0 MB in the end (delta: 358.6 MB). Free memory was 237.5 MB in the beginning and 600.4 MB in the end (delta: -362.9 MB). Peak memory consumption was 319.5 MB. Max. memory is 5.3 GB. [2018-04-09 20:00:15,841 INFO L168 Benchmark]: CDTParser took 0.21 ms. Allocated memory is still 300.4 MB. Free memory is still 262.7 MB. There was no memory consumed. Max. memory is 5.3 GB. [2018-04-09 20:00:15,842 INFO L168 Benchmark]: CACSL2BoogieTranslator took 305.94 ms. Allocated memory is still 300.4 MB. Free memory was 236.5 MB in the beginning and 212.6 MB in the end (delta: 23.9 MB). Peak memory consumption was 23.9 MB. Max. memory is 5.3 GB. [2018-04-09 20:00:15,842 INFO L168 Benchmark]: Boogie Preprocessor took 61.88 ms. Allocated memory is still 300.4 MB. Free memory was 212.6 MB in the beginning and 210.6 MB in the end (delta: 2.0 MB). Peak memory consumption was 2.0 MB. Max. memory is 5.3 GB. [2018-04-09 20:00:15,842 INFO L168 Benchmark]: RCFGBuilder took 565.72 ms. Allocated memory was 300.4 MB in the beginning and 459.3 MB in the end (delta: 158.9 MB). Free memory was 210.6 MB in the beginning and 390.9 MB in the end (delta: -180.2 MB). Peak memory consumption was 22.5 MB. Max. memory is 5.3 GB. [2018-04-09 20:00:15,842 INFO L168 Benchmark]: TraceAbstraction took 268007.66 ms. Allocated memory was 459.3 MB in the beginning and 659.0 MB in the end (delta: 199.8 MB). Free memory was 390.9 MB in the beginning and 600.4 MB in the end (delta: -209.6 MB). Peak memory consumption was 314.0 MB. Max. memory is 5.3 GB. [2018-04-09 20:00:15,843 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.21 ms. Allocated memory is still 300.4 MB. Free memory is still 262.7 MB. There was no memory consumed. Max. memory is 5.3 GB. * CACSL2BoogieTranslator took 305.94 ms. Allocated memory is still 300.4 MB. Free memory was 236.5 MB in the beginning and 212.6 MB in the end (delta: 23.9 MB). Peak memory consumption was 23.9 MB. Max. memory is 5.3 GB. * Boogie Preprocessor took 61.88 ms. Allocated memory is still 300.4 MB. Free memory was 212.6 MB in the beginning and 210.6 MB in the end (delta: 2.0 MB). Peak memory consumption was 2.0 MB. Max. memory is 5.3 GB. * RCFGBuilder took 565.72 ms. Allocated memory was 300.4 MB in the beginning and 459.3 MB in the end (delta: 158.9 MB). Free memory was 210.6 MB in the beginning and 390.9 MB in the end (delta: -180.2 MB). Peak memory consumption was 22.5 MB. Max. memory is 5.3 GB. * TraceAbstraction took 268007.66 ms. Allocated memory was 459.3 MB in the beginning and 659.0 MB in the end (delta: 199.8 MB). Free memory was 390.9 MB in the beginning and 600.4 MB in the end (delta: -209.6 MB). Peak memory consumption was 314.0 MB. Max. memory is 5.3 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - TimeoutResultAtElement [Line: 570]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 570). Cancelled while BasicCegarLoop was constructing difference of abstraction (173states) and interpolant automaton (currently 31 states, 48 states before enhancement), while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 78. - TimeoutResultAtElement [Line: 569]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 569). Cancelled while BasicCegarLoop was constructing difference of abstraction (173states) and interpolant automaton (currently 31 states, 48 states before enhancement), while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 78. - TimeoutResultAtElement [Line: 570]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 570). Cancelled while BasicCegarLoop was constructing difference of abstraction (173states) and interpolant automaton (currently 31 states, 48 states before enhancement), while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 78. - TimeoutResultAtElement [Line: 553]: Timeout (TraceAbstraction) Unable to prove that all allocated memory was freed (line 553). Cancelled while BasicCegarLoop was constructing difference of abstraction (173states) and interpolant automaton (currently 31 states, 48 states before enhancement), while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 78. - TimeoutResultAtElement [Line: 569]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 569). Cancelled while BasicCegarLoop was constructing difference of abstraction (173states) and interpolant automaton (currently 31 states, 48 states before enhancement), while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 78. - TimeoutResultAtElement [Line: 549]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 549). Cancelled while BasicCegarLoop was constructing difference of abstraction (173states) and interpolant automaton (currently 31 states, 48 states before enhancement), while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 78. - TimeoutResultAtElement [Line: 545]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 545). Cancelled while BasicCegarLoop was constructing difference of abstraction (173states) and interpolant automaton (currently 31 states, 48 states before enhancement), while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 78. - TimeoutResultAtElement [Line: 543]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 543). Cancelled while BasicCegarLoop was constructing difference of abstraction (173states) and interpolant automaton (currently 31 states, 48 states before enhancement), while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 78. - TimeoutResultAtElement [Line: 545]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 545). Cancelled while BasicCegarLoop was constructing difference of abstraction (173states) and interpolant automaton (currently 31 states, 48 states before enhancement), while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 78. - TimeoutResultAtElement [Line: 550]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 550). Cancelled while BasicCegarLoop was constructing difference of abstraction (173states) and interpolant automaton (currently 31 states, 48 states before enhancement), while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 78. - TimeoutResultAtElement [Line: 543]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 543). Cancelled while BasicCegarLoop was constructing difference of abstraction (173states) and interpolant automaton (currently 31 states, 48 states before enhancement), while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 78. - TimeoutResultAtElement [Line: 545]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 545). Cancelled while BasicCegarLoop was constructing difference of abstraction (173states) and interpolant automaton (currently 31 states, 48 states before enhancement), while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 78. - TimeoutResultAtElement [Line: 550]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 550). Cancelled while BasicCegarLoop was constructing difference of abstraction (173states) and interpolant automaton (currently 31 states, 48 states before enhancement), while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 78. - TimeoutResultAtElement [Line: 549]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 549). Cancelled while BasicCegarLoop was constructing difference of abstraction (173states) and interpolant automaton (currently 31 states, 48 states before enhancement), while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 78. - TimeoutResultAtElement [Line: 545]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 545). Cancelled while BasicCegarLoop was constructing difference of abstraction (173states) and interpolant automaton (currently 31 states, 48 states before enhancement), while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 78. - StatisticsResult: Ultimate Automizer benchmark data CFG has 6 procedures, 106 locations, 15 error locations. TIMEOUT Result, 267.9s OverallTime, 27 OverallIterations, 3 TraceHistogramMax, 248.3s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 2301 SDtfs, 6215 SDslu, 16977 SDs, 0 SdLazy, 10684 SolverSat, 579 SolverUnsat, 4 SolverUnknown, 0 SolverNotchecked, 19.7s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 2919 GetRequests, 2158 SyntacticMatches, 29 SemanticMatches, 731 ConstructedPredicates, 20 IntricatePredicates, 0 DeprecatedPredicates, 8614 ImplicationChecksByTransitivity, 234.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=273occurred in iteration=18, 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, 26 MinimizatonAttempts, 933 StatesRemovedByMinimization, 19 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.1s SsaConstructionTime, 0.3s SatisfiabilityAnalysisTime, 17.7s InterpolantComputationTime, 1311 NumberOfCodeBlocks, 1311 NumberOfCodeBlocksAsserted, 27 NumberOfCheckSat, 2568 ConstructedInterpolants, 357 QuantifiedInterpolants, 1446444 SizeOfPredicates, 338 NumberOfNonLiveVariables, 3816 ConjunctsInSsa, 619 ConjunctsInUnsatCore, 54 InterpolantComputations, 36 PerfectInterpolantSequences, 26/192 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/cstrncat-alloca_true-valid-memsafety_true-termination.i_svcomp-DerefFreeMemtrack-32bit-Automizer_Fixed_noBitfields+AI_EQ_SS.epf_AutomizerC.xml/Csv-Benchmark-0-2018-04-09_20-00-15-850.csv Written .csv to /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/cstrncat-alloca_true-valid-memsafety_true-termination.i_svcomp-DerefFreeMemtrack-32bit-Automizer_Fixed_noBitfields+AI_EQ_SS.epf_AutomizerC.xml/Csv-TraceAbstractionBenchmarks-0-2018-04-09_20-00-15-850.csv Completed graceful shutdown