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_Camel+AI_EQ_SS.epf -i ../../../trunk/examples/svcomp/forester-heap/sll-simple-white-blue_true-unreach-call_false-valid-memtrack.i -------------------------------------------------------------------------------- This is Ultimate 0.1.23-d4a2356 [2018-03-23 11:57:05,304 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-03-23 11:57:05,307 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-03-23 11:57:05,322 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-03-23 11:57:05,322 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-03-23 11:57:05,323 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-03-23 11:57:05,324 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-03-23 11:57:05,326 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-03-23 11:57:05,328 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-03-23 11:57:05,329 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-03-23 11:57:05,330 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-03-23 11:57:05,330 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-03-23 11:57:05,331 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-03-23 11:57:05,333 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-03-23 11:57:05,334 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-03-23 11:57:05,337 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-03-23 11:57:05,339 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-03-23 11:57:05,341 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-03-23 11:57:05,343 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-03-23 11:57:05,344 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-03-23 11:57:05,346 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-03-23 11:57:05,347 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-03-23 11:57:05,347 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-03-23 11:57:05,348 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-03-23 11:57:05,349 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-03-23 11:57:05,350 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-03-23 11:57:05,351 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-03-23 11:57:05,351 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-03-23 11:57:05,352 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-03-23 11:57:05,352 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-03-23 11:57:05,353 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-03-23 11:57:05,353 INFO L98 SettingsManager]: Beginning loading settings from /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/ai/eq-bench/svcomp-DerefFreeMemtrack-32bit-Automizer_Camel+AI_EQ_SS.epf [2018-03-23 11:57:05,363 INFO L110 SettingsManager]: Loading preferences was successful [2018-03-23 11:57:05,363 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-03-23 11:57:05,364 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-03-23 11:57:05,364 INFO L133 SettingsManager]: * to procedures, called more than once=true [2018-03-23 11:57:05,365 INFO L131 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2018-03-23 11:57:05,365 INFO L133 SettingsManager]: * Abstract domain for RCFG-of-the-future=VPDomain [2018-03-23 11:57:05,365 INFO L133 SettingsManager]: * Use the RCFG-of-the-future interface=true [2018-03-23 11:57:05,366 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-03-23 11:57:05,366 INFO L133 SettingsManager]: * sizeof long=4 [2018-03-23 11:57:05,366 INFO L133 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2018-03-23 11:57:05,366 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-03-23 11:57:05,366 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-03-23 11:57:05,367 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-03-23 11:57:05,367 INFO L133 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2018-03-23 11:57:05,367 INFO L133 SettingsManager]: * Bitprecise bitfields=true [2018-03-23 11:57:05,367 INFO L133 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2018-03-23 11:57:05,367 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-03-23 11:57:05,367 INFO L133 SettingsManager]: * sizeof long double=12 [2018-03-23 11:57:05,368 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-03-23 11:57:05,368 INFO L133 SettingsManager]: * Size of a code block=SingleStatement [2018-03-23 11:57:05,368 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-03-23 11:57:05,368 INFO L133 SettingsManager]: * Add additional assume for each assert=false [2018-03-23 11:57:05,369 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-03-23 11:57:05,369 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-03-23 11:57:05,369 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-03-23 11:57:05,369 INFO L133 SettingsManager]: * Interpolant automaton=TWOTRACK [2018-03-23 11:57:05,369 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-03-23 11:57:05,370 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-03-23 11:57:05,370 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2018-03-23 11:57:05,370 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-03-23 11:57:05,370 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-03-23 11:57:05,370 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-03-23 11:57:05,371 INFO L131 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2018-03-23 11:57:05,371 INFO L133 SettingsManager]: * TransformationType=HEAP_SEPARATOR [2018-03-23 11:57:05,408 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-03-23 11:57:05,422 INFO L266 ainManager$Toolchain]: [Toolchain 1]: Parser(s) successfully (re)initialized [2018-03-23 11:57:05,426 INFO L222 ainManager$Toolchain]: [Toolchain 1]: Toolchain data selected. [2018-03-23 11:57:05,428 INFO L271 PluginConnector]: Initializing CDTParser... [2018-03-23 11:57:05,429 INFO L276 PluginConnector]: CDTParser initialized [2018-03-23 11:57:05,430 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/forester-heap/sll-simple-white-blue_true-unreach-call_false-valid-memtrack.i [2018-03-23 11:57:05,736 INFO L228 CDTParser]: Created temporary CDT project at /storage/ultimate/releaseScripts/default/UAutomizer-linux/data/FLAG06445795c [2018-03-23 11:57:05,926 INFO L291 CDTParser]: IsIndexed: true [2018-03-23 11:57:05,926 INFO L292 CDTParser]: Found 1 translation units. [2018-03-23 11:57:05,927 INFO L171 CDTParser]: Scanning sll-simple-white-blue_true-unreach-call_false-valid-memtrack.i [2018-03-23 11:57:05,938 INFO L210 ultiparseSymbolTable]: Include resolver: [2018-03-23 11:57:05,938 INFO L215 ultiparseSymbolTable]: [2018-03-23 11:57:05,939 INFO L218 ultiparseSymbolTable]: Function table: [2018-03-23 11:57:05,939 INFO L221 ultiparseSymbolTable]: Function definition of null ('main') in sll-simple-white-blue_true-unreach-call_false-valid-memtrack.i [2018-03-23 11:57:05,939 INFO L227 ultiparseSymbolTable]: Global variable table: [2018-03-23 11:57:05,939 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fsll_simple_white_blue_true_unreach_call_false_valid_memtrack_i__pthread_rwlockattr_t in sll-simple-white-blue_true-unreach-call_false-valid-memtrack.i [2018-03-23 11:57:05,939 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fsll_simple_white_blue_true_unreach_call_false_valid_memtrack_i____gid_t in sll-simple-white-blue_true-unreach-call_false-valid-memtrack.i [2018-03-23 11:57:05,939 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fsll_simple_white_blue_true_unreach_call_false_valid_memtrack_i____uint16_t in sll-simple-white-blue_true-unreach-call_false-valid-memtrack.i [2018-03-23 11:57:05,939 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fsll_simple_white_blue_true_unreach_call_false_valid_memtrack_i__clock_t in sll-simple-white-blue_true-unreach-call_false-valid-memtrack.i [2018-03-23 11:57:05,939 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fsll_simple_white_blue_true_unreach_call_false_valid_memtrack_i__u_char in sll-simple-white-blue_true-unreach-call_false-valid-memtrack.i [2018-03-23 11:57:05,940 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fsll_simple_white_blue_true_unreach_call_false_valid_memtrack_i____int16_t in sll-simple-white-blue_true-unreach-call_false-valid-memtrack.i [2018-03-23 11:57:05,940 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fsll_simple_white_blue_true_unreach_call_false_valid_memtrack_i____u_long in sll-simple-white-blue_true-unreach-call_false-valid-memtrack.i [2018-03-23 11:57:05,940 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fsll_simple_white_blue_true_unreach_call_false_valid_memtrack_i__blkcnt_t in sll-simple-white-blue_true-unreach-call_false-valid-memtrack.i [2018-03-23 11:57:05,940 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fsll_simple_white_blue_true_unreach_call_false_valid_memtrack_i__daddr_t in sll-simple-white-blue_true-unreach-call_false-valid-memtrack.i [2018-03-23 11:57:05,940 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fsll_simple_white_blue_true_unreach_call_false_valid_memtrack_i____loff_t in sll-simple-white-blue_true-unreach-call_false-valid-memtrack.i [2018-03-23 11:57:05,940 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fsll_simple_white_blue_true_unreach_call_false_valid_memtrack_i__suseconds_t in sll-simple-white-blue_true-unreach-call_false-valid-memtrack.i [2018-03-23 11:57:05,940 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fsll_simple_white_blue_true_unreach_call_false_valid_memtrack_i__u_int32_t in sll-simple-white-blue_true-unreach-call_false-valid-memtrack.i [2018-03-23 11:57:05,940 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fsll_simple_white_blue_true_unreach_call_false_valid_memtrack_i____sigset_t in sll-simple-white-blue_true-unreach-call_false-valid-memtrack.i [2018-03-23 11:57:05,941 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fsll_simple_white_blue_true_unreach_call_false_valid_memtrack_i__fd_mask in sll-simple-white-blue_true-unreach-call_false-valid-memtrack.i [2018-03-23 11:57:05,941 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fsll_simple_white_blue_true_unreach_call_false_valid_memtrack_i__sigset_t in sll-simple-white-blue_true-unreach-call_false-valid-memtrack.i [2018-03-23 11:57:05,941 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fsll_simple_white_blue_true_unreach_call_false_valid_memtrack_i____ino_t in sll-simple-white-blue_true-unreach-call_false-valid-memtrack.i [2018-03-23 11:57:05,941 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fsll_simple_white_blue_true_unreach_call_false_valid_memtrack_i__pthread_spinlock_t in sll-simple-white-blue_true-unreach-call_false-valid-memtrack.i [2018-03-23 11:57:05,941 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fsll_simple_white_blue_true_unreach_call_false_valid_memtrack_i__SLL in sll-simple-white-blue_true-unreach-call_false-valid-memtrack.i [2018-03-23 11:57:05,941 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fsll_simple_white_blue_true_unreach_call_false_valid_memtrack_i____caddr_t in sll-simple-white-blue_true-unreach-call_false-valid-memtrack.i [2018-03-23 11:57:05,941 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fsll_simple_white_blue_true_unreach_call_false_valid_memtrack_i____off_t in sll-simple-white-blue_true-unreach-call_false-valid-memtrack.i [2018-03-23 11:57:05,941 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fsll_simple_white_blue_true_unreach_call_false_valid_memtrack_i____ino64_t in sll-simple-white-blue_true-unreach-call_false-valid-memtrack.i [2018-03-23 11:57:05,942 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fsll_simple_white_blue_true_unreach_call_false_valid_memtrack_i__u_long in sll-simple-white-blue_true-unreach-call_false-valid-memtrack.i [2018-03-23 11:57:05,942 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fsll_simple_white_blue_true_unreach_call_false_valid_memtrack_i____fsid_t in sll-simple-white-blue_true-unreach-call_false-valid-memtrack.i [2018-03-23 11:57:05,942 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fsll_simple_white_blue_true_unreach_call_false_valid_memtrack_i__ulong in sll-simple-white-blue_true-unreach-call_false-valid-memtrack.i [2018-03-23 11:57:05,942 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fsll_simple_white_blue_true_unreach_call_false_valid_memtrack_i____uint32_t in sll-simple-white-blue_true-unreach-call_false-valid-memtrack.i [2018-03-23 11:57:05,942 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fsll_simple_white_blue_true_unreach_call_false_valid_memtrack_i__uid_t in sll-simple-white-blue_true-unreach-call_false-valid-memtrack.i [2018-03-23 11:57:05,942 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fsll_simple_white_blue_true_unreach_call_false_valid_memtrack_i__fsblkcnt_t in sll-simple-white-blue_true-unreach-call_false-valid-memtrack.i [2018-03-23 11:57:05,942 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fsll_simple_white_blue_true_unreach_call_false_valid_memtrack_i__lldiv_t in sll-simple-white-blue_true-unreach-call_false-valid-memtrack.i [2018-03-23 11:57:05,942 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fsll_simple_white_blue_true_unreach_call_false_valid_memtrack_i__wchar_t in sll-simple-white-blue_true-unreach-call_false-valid-memtrack.i [2018-03-23 11:57:05,943 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fsll_simple_white_blue_true_unreach_call_false_valid_memtrack_i__int16_t in sll-simple-white-blue_true-unreach-call_false-valid-memtrack.i [2018-03-23 11:57:05,943 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fsll_simple_white_blue_true_unreach_call_false_valid_memtrack_i__blksize_t in sll-simple-white-blue_true-unreach-call_false-valid-memtrack.i [2018-03-23 11:57:05,943 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fsll_simple_white_blue_true_unreach_call_false_valid_memtrack_i____clockid_t in sll-simple-white-blue_true-unreach-call_false-valid-memtrack.i [2018-03-23 11:57:05,943 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fsll_simple_white_blue_true_unreach_call_false_valid_memtrack_i__clockid_t in sll-simple-white-blue_true-unreach-call_false-valid-memtrack.i [2018-03-23 11:57:05,943 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fsll_simple_white_blue_true_unreach_call_false_valid_memtrack_i____pthread_slist_t in sll-simple-white-blue_true-unreach-call_false-valid-memtrack.i [2018-03-23 11:57:05,943 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fsll_simple_white_blue_true_unreach_call_false_valid_memtrack_i____int32_t in sll-simple-white-blue_true-unreach-call_false-valid-memtrack.i [2018-03-23 11:57:05,943 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fsll_simple_white_blue_true_unreach_call_false_valid_memtrack_i____syscall_ulong_t in sll-simple-white-blue_true-unreach-call_false-valid-memtrack.i [2018-03-23 11:57:05,943 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fsll_simple_white_blue_true_unreach_call_false_valid_memtrack_i____sig_atomic_t in sll-simple-white-blue_true-unreach-call_false-valid-memtrack.i [2018-03-23 11:57:05,943 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fsll_simple_white_blue_true_unreach_call_false_valid_memtrack_i__div_t in sll-simple-white-blue_true-unreach-call_false-valid-memtrack.i [2018-03-23 11:57:05,944 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fsll_simple_white_blue_true_unreach_call_false_valid_memtrack_i__pthread_t in sll-simple-white-blue_true-unreach-call_false-valid-memtrack.i [2018-03-23 11:57:05,944 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fsll_simple_white_blue_true_unreach_call_false_valid_memtrack_i____id_t in sll-simple-white-blue_true-unreach-call_false-valid-memtrack.i [2018-03-23 11:57:05,944 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fsll_simple_white_blue_true_unreach_call_false_valid_memtrack_i____fd_mask in sll-simple-white-blue_true-unreach-call_false-valid-memtrack.i [2018-03-23 11:57:05,944 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fsll_simple_white_blue_true_unreach_call_false_valid_memtrack_i__quad_t in sll-simple-white-blue_true-unreach-call_false-valid-memtrack.i [2018-03-23 11:57:05,944 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fsll_simple_white_blue_true_unreach_call_false_valid_memtrack_i__u_int8_t in sll-simple-white-blue_true-unreach-call_false-valid-memtrack.i [2018-03-23 11:57:05,944 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fsll_simple_white_blue_true_unreach_call_false_valid_memtrack_i__u_int16_t in sll-simple-white-blue_true-unreach-call_false-valid-memtrack.i [2018-03-23 11:57:05,944 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fsll_simple_white_blue_true_unreach_call_false_valid_memtrack_i__pthread_cond_t in sll-simple-white-blue_true-unreach-call_false-valid-memtrack.i [2018-03-23 11:57:05,944 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fsll_simple_white_blue_true_unreach_call_false_valid_memtrack_i____fsblkcnt64_t in sll-simple-white-blue_true-unreach-call_false-valid-memtrack.i [2018-03-23 11:57:05,944 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fsll_simple_white_blue_true_unreach_call_false_valid_memtrack_i____pid_t in sll-simple-white-blue_true-unreach-call_false-valid-memtrack.i [2018-03-23 11:57:05,945 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fsll_simple_white_blue_true_unreach_call_false_valid_memtrack_i____rlim_t in sll-simple-white-blue_true-unreach-call_false-valid-memtrack.i [2018-03-23 11:57:05,945 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fsll_simple_white_blue_true_unreach_call_false_valid_memtrack_i____timer_t in sll-simple-white-blue_true-unreach-call_false-valid-memtrack.i [2018-03-23 11:57:05,945 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fsll_simple_white_blue_true_unreach_call_false_valid_memtrack_i__pthread_mutexattr_t in sll-simple-white-blue_true-unreach-call_false-valid-memtrack.i [2018-03-23 11:57:05,945 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fsll_simple_white_blue_true_unreach_call_false_valid_memtrack_i__pthread_attr_t in sll-simple-white-blue_true-unreach-call_false-valid-memtrack.i [2018-03-23 11:57:05,945 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fsll_simple_white_blue_true_unreach_call_false_valid_memtrack_i__u_int in sll-simple-white-blue_true-unreach-call_false-valid-memtrack.i [2018-03-23 11:57:05,945 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fsll_simple_white_blue_true_unreach_call_false_valid_memtrack_i____u_char in sll-simple-white-blue_true-unreach-call_false-valid-memtrack.i [2018-03-23 11:57:05,945 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fsll_simple_white_blue_true_unreach_call_false_valid_memtrack_i____u_quad_t in sll-simple-white-blue_true-unreach-call_false-valid-memtrack.i [2018-03-23 11:57:05,946 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fsll_simple_white_blue_true_unreach_call_false_valid_memtrack_i__pthread_barrier_t in sll-simple-white-blue_true-unreach-call_false-valid-memtrack.i [2018-03-23 11:57:05,946 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fsll_simple_white_blue_true_unreach_call_false_valid_memtrack_i____quad_t in sll-simple-white-blue_true-unreach-call_false-valid-memtrack.i [2018-03-23 11:57:05,946 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fsll_simple_white_blue_true_unreach_call_false_valid_memtrack_i____off64_t in sll-simple-white-blue_true-unreach-call_false-valid-memtrack.i [2018-03-23 11:57:05,946 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fsll_simple_white_blue_true_unreach_call_false_valid_memtrack_i____suseconds_t in sll-simple-white-blue_true-unreach-call_false-valid-memtrack.i [2018-03-23 11:57:05,946 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fsll_simple_white_blue_true_unreach_call_false_valid_memtrack_i____fsfilcnt64_t in sll-simple-white-blue_true-unreach-call_false-valid-memtrack.i [2018-03-23 11:57:05,946 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fsll_simple_white_blue_true_unreach_call_false_valid_memtrack_i__u_int64_t in sll-simple-white-blue_true-unreach-call_false-valid-memtrack.i [2018-03-23 11:57:05,946 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fsll_simple_white_blue_true_unreach_call_false_valid_memtrack_i____blkcnt64_t in sll-simple-white-blue_true-unreach-call_false-valid-memtrack.i [2018-03-23 11:57:05,946 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fsll_simple_white_blue_true_unreach_call_false_valid_memtrack_i__pid_t in sll-simple-white-blue_true-unreach-call_false-valid-memtrack.i [2018-03-23 11:57:05,946 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fsll_simple_white_blue_true_unreach_call_false_valid_memtrack_i__ldiv_t in sll-simple-white-blue_true-unreach-call_false-valid-memtrack.i [2018-03-23 11:57:05,947 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fsll_simple_white_blue_true_unreach_call_false_valid_memtrack_i__ino_t in sll-simple-white-blue_true-unreach-call_false-valid-memtrack.i [2018-03-23 11:57:05,947 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fsll_simple_white_blue_true_unreach_call_false_valid_memtrack_i__fsfilcnt_t in sll-simple-white-blue_true-unreach-call_false-valid-memtrack.i [2018-03-23 11:57:05,947 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fsll_simple_white_blue_true_unreach_call_false_valid_memtrack_i____ssize_t in sll-simple-white-blue_true-unreach-call_false-valid-memtrack.i [2018-03-23 11:57:05,947 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fsll_simple_white_blue_true_unreach_call_false_valid_memtrack_i____socklen_t in sll-simple-white-blue_true-unreach-call_false-valid-memtrack.i [2018-03-23 11:57:05,947 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fsll_simple_white_blue_true_unreach_call_false_valid_memtrack_i____mode_t in sll-simple-white-blue_true-unreach-call_false-valid-memtrack.i [2018-03-23 11:57:05,947 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fsll_simple_white_blue_true_unreach_call_false_valid_memtrack_i__int32_t in sll-simple-white-blue_true-unreach-call_false-valid-memtrack.i [2018-03-23 11:57:05,947 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fsll_simple_white_blue_true_unreach_call_false_valid_memtrack_i__idtype_t in sll-simple-white-blue_true-unreach-call_false-valid-memtrack.i [2018-03-23 11:57:05,947 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fsll_simple_white_blue_true_unreach_call_false_valid_memtrack_i____int8_t in sll-simple-white-blue_true-unreach-call_false-valid-memtrack.i [2018-03-23 11:57:05,947 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fsll_simple_white_blue_true_unreach_call_false_valid_memtrack_i____nlink_t in sll-simple-white-blue_true-unreach-call_false-valid-memtrack.i [2018-03-23 11:57:05,948 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fsll_simple_white_blue_true_unreach_call_false_valid_memtrack_i____intptr_t in sll-simple-white-blue_true-unreach-call_false-valid-memtrack.i [2018-03-23 11:57:05,948 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fsll_simple_white_blue_true_unreach_call_false_valid_memtrack_i__timer_t in sll-simple-white-blue_true-unreach-call_false-valid-memtrack.i [2018-03-23 11:57:05,948 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fsll_simple_white_blue_true_unreach_call_false_valid_memtrack_i__size_t in sll-simple-white-blue_true-unreach-call_false-valid-memtrack.i [2018-03-23 11:57:05,948 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fsll_simple_white_blue_true_unreach_call_false_valid_memtrack_i__off_t in sll-simple-white-blue_true-unreach-call_false-valid-memtrack.i [2018-03-23 11:57:05,948 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fsll_simple_white_blue_true_unreach_call_false_valid_memtrack_i__key_t in sll-simple-white-blue_true-unreach-call_false-valid-memtrack.i [2018-03-23 11:57:05,948 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fsll_simple_white_blue_true_unreach_call_false_valid_memtrack_i____uint64_t in sll-simple-white-blue_true-unreach-call_false-valid-memtrack.i [2018-03-23 11:57:05,948 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fsll_simple_white_blue_true_unreach_call_false_valid_memtrack_i__pthread_once_t in sll-simple-white-blue_true-unreach-call_false-valid-memtrack.i [2018-03-23 11:57:05,948 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fsll_simple_white_blue_true_unreach_call_false_valid_memtrack_i____fsword_t in sll-simple-white-blue_true-unreach-call_false-valid-memtrack.i [2018-03-23 11:57:05,948 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fsll_simple_white_blue_true_unreach_call_false_valid_memtrack_i__caddr_t in sll-simple-white-blue_true-unreach-call_false-valid-memtrack.i [2018-03-23 11:57:05,948 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fsll_simple_white_blue_true_unreach_call_false_valid_memtrack_i__mode_t in sll-simple-white-blue_true-unreach-call_false-valid-memtrack.i [2018-03-23 11:57:05,948 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fsll_simple_white_blue_true_unreach_call_false_valid_memtrack_i____u_short in sll-simple-white-blue_true-unreach-call_false-valid-memtrack.i [2018-03-23 11:57:05,948 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fsll_simple_white_blue_true_unreach_call_false_valid_memtrack_i__nlink_t in sll-simple-white-blue_true-unreach-call_false-valid-memtrack.i [2018-03-23 11:57:05,948 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fsll_simple_white_blue_true_unreach_call_false_valid_memtrack_i__u_short in sll-simple-white-blue_true-unreach-call_false-valid-memtrack.i [2018-03-23 11:57:05,948 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fsll_simple_white_blue_true_unreach_call_false_valid_memtrack_i____uid_t in sll-simple-white-blue_true-unreach-call_false-valid-memtrack.i [2018-03-23 11:57:05,949 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fsll_simple_white_blue_true_unreach_call_false_valid_memtrack_i__gid_t in sll-simple-white-blue_true-unreach-call_false-valid-memtrack.i [2018-03-23 11:57:05,949 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fsll_simple_white_blue_true_unreach_call_false_valid_memtrack_i__ssize_t in sll-simple-white-blue_true-unreach-call_false-valid-memtrack.i [2018-03-23 11:57:05,949 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fsll_simple_white_blue_true_unreach_call_false_valid_memtrack_i__uint in sll-simple-white-blue_true-unreach-call_false-valid-memtrack.i [2018-03-23 11:57:05,949 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fsll_simple_white_blue_true_unreach_call_false_valid_memtrack_i__loff_t in sll-simple-white-blue_true-unreach-call_false-valid-memtrack.i [2018-03-23 11:57:05,949 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fsll_simple_white_blue_true_unreach_call_false_valid_memtrack_i____useconds_t in sll-simple-white-blue_true-unreach-call_false-valid-memtrack.i [2018-03-23 11:57:05,949 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fsll_simple_white_blue_true_unreach_call_false_valid_memtrack_i__fd_set in sll-simple-white-blue_true-unreach-call_false-valid-memtrack.i [2018-03-23 11:57:05,949 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fsll_simple_white_blue_true_unreach_call_false_valid_memtrack_i__pthread_condattr_t in sll-simple-white-blue_true-unreach-call_false-valid-memtrack.i [2018-03-23 11:57:05,949 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fsll_simple_white_blue_true_unreach_call_false_valid_memtrack_i__dev_t in sll-simple-white-blue_true-unreach-call_false-valid-memtrack.i [2018-03-23 11:57:05,949 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fsll_simple_white_blue_true_unreach_call_false_valid_memtrack_i____rlim64_t in sll-simple-white-blue_true-unreach-call_false-valid-memtrack.i [2018-03-23 11:57:05,949 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fsll_simple_white_blue_true_unreach_call_false_valid_memtrack_i____blksize_t in sll-simple-white-blue_true-unreach-call_false-valid-memtrack.i [2018-03-23 11:57:05,949 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fsll_simple_white_blue_true_unreach_call_false_valid_memtrack_i__id_t in sll-simple-white-blue_true-unreach-call_false-valid-memtrack.i [2018-03-23 11:57:05,949 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fsll_simple_white_blue_true_unreach_call_false_valid_memtrack_i____qaddr_t in sll-simple-white-blue_true-unreach-call_false-valid-memtrack.i [2018-03-23 11:57:05,949 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fsll_simple_white_blue_true_unreach_call_false_valid_memtrack_i____clock_t in sll-simple-white-blue_true-unreach-call_false-valid-memtrack.i [2018-03-23 11:57:05,949 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fsll_simple_white_blue_true_unreach_call_false_valid_memtrack_i__pthread_key_t in sll-simple-white-blue_true-unreach-call_false-valid-memtrack.i [2018-03-23 11:57:05,949 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fsll_simple_white_blue_true_unreach_call_false_valid_memtrack_i____dev_t in sll-simple-white-blue_true-unreach-call_false-valid-memtrack.i [2018-03-23 11:57:05,950 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fsll_simple_white_blue_true_unreach_call_false_valid_memtrack_i____fsblkcnt_t in sll-simple-white-blue_true-unreach-call_false-valid-memtrack.i [2018-03-23 11:57:05,950 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fsll_simple_white_blue_true_unreach_call_false_valid_memtrack_i__fsid_t in sll-simple-white-blue_true-unreach-call_false-valid-memtrack.i [2018-03-23 11:57:05,950 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fsll_simple_white_blue_true_unreach_call_false_valid_memtrack_i____u_int in sll-simple-white-blue_true-unreach-call_false-valid-memtrack.i [2018-03-23 11:57:05,950 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fsll_simple_white_blue_true_unreach_call_false_valid_memtrack_i____blkcnt_t in sll-simple-white-blue_true-unreach-call_false-valid-memtrack.i [2018-03-23 11:57:05,950 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fsll_simple_white_blue_true_unreach_call_false_valid_memtrack_i__time_t in sll-simple-white-blue_true-unreach-call_false-valid-memtrack.i [2018-03-23 11:57:05,950 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fsll_simple_white_blue_true_unreach_call_false_valid_memtrack_i__pthread_rwlock_t in sll-simple-white-blue_true-unreach-call_false-valid-memtrack.i [2018-03-23 11:57:05,950 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fsll_simple_white_blue_true_unreach_call_false_valid_memtrack_i__pthread_mutex_t in sll-simple-white-blue_true-unreach-call_false-valid-memtrack.i [2018-03-23 11:57:05,950 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fsll_simple_white_blue_true_unreach_call_false_valid_memtrack_i____fsfilcnt_t in sll-simple-white-blue_true-unreach-call_false-valid-memtrack.i [2018-03-23 11:57:05,950 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fsll_simple_white_blue_true_unreach_call_false_valid_memtrack_i____syscall_slong_t in sll-simple-white-blue_true-unreach-call_false-valid-memtrack.i [2018-03-23 11:57:05,950 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fsll_simple_white_blue_true_unreach_call_false_valid_memtrack_i__pthread_barrierattr_t in sll-simple-white-blue_true-unreach-call_false-valid-memtrack.i [2018-03-23 11:57:05,950 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fsll_simple_white_blue_true_unreach_call_false_valid_memtrack_i__register_t in sll-simple-white-blue_true-unreach-call_false-valid-memtrack.i [2018-03-23 11:57:05,950 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fsll_simple_white_blue_true_unreach_call_false_valid_memtrack_i__int64_t in sll-simple-white-blue_true-unreach-call_false-valid-memtrack.i [2018-03-23 11:57:05,950 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fsll_simple_white_blue_true_unreach_call_false_valid_memtrack_i____daddr_t in sll-simple-white-blue_true-unreach-call_false-valid-memtrack.i [2018-03-23 11:57:05,950 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fsll_simple_white_blue_true_unreach_call_false_valid_memtrack_i____int64_t in sll-simple-white-blue_true-unreach-call_false-valid-memtrack.i [2018-03-23 11:57:05,951 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fsll_simple_white_blue_true_unreach_call_false_valid_memtrack_i__int8_t in sll-simple-white-blue_true-unreach-call_false-valid-memtrack.i [2018-03-23 11:57:05,951 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fsll_simple_white_blue_true_unreach_call_false_valid_memtrack_i____time_t in sll-simple-white-blue_true-unreach-call_false-valid-memtrack.i [2018-03-23 11:57:05,951 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fsll_simple_white_blue_true_unreach_call_false_valid_memtrack_i____uint8_t in sll-simple-white-blue_true-unreach-call_false-valid-memtrack.i [2018-03-23 11:57:05,951 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fsll_simple_white_blue_true_unreach_call_false_valid_memtrack_i____key_t in sll-simple-white-blue_true-unreach-call_false-valid-memtrack.i [2018-03-23 11:57:05,951 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fsll_simple_white_blue_true_unreach_call_false_valid_memtrack_i__u_quad_t in sll-simple-white-blue_true-unreach-call_false-valid-memtrack.i [2018-03-23 11:57:05,951 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fsll_simple_white_blue_true_unreach_call_false_valid_memtrack_i__ushort in sll-simple-white-blue_true-unreach-call_false-valid-memtrack.i [2018-03-23 11:57:05,970 INFO L334 CDTParser]: Deleted temporary CDT project at /storage/ultimate/releaseScripts/default/UAutomizer-linux/data/FLAG06445795c [2018-03-23 11:57:05,974 INFO L304 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-03-23 11:57:05,976 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2018-03-23 11:57:05,977 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-03-23 11:57:05,977 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-03-23 11:57:05,982 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-03-23 11:57:05,983 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 23.03 11:57:05" (1/1) ... [2018-03-23 11:57:05,986 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@1623f62e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.03 11:57:05, skipping insertion in model container [2018-03-23 11:57:05,986 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 23.03 11:57:05" (1/1) ... [2018-03-23 11:57:06,002 INFO L167 Dispatcher]: Using SV-COMP mode [2018-03-23 11:57:06,034 INFO L167 Dispatcher]: Using SV-COMP mode [2018-03-23 11:57:06,205 INFO L175 PostProcessor]: Settings: Checked method=main [2018-03-23 11:57:06,256 INFO L175 PostProcessor]: Settings: Checked method=main [2018-03-23 11:57:06,264 INFO L100 SccComputation]: Graph consists of 0 InCaSumBalls and 115 non ball SCCs. Number of states in SCCs 115. [2018-03-23 11:57:06,311 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.03 11:57:06 WrapperNode [2018-03-23 11:57:06,311 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-03-23 11:57:06,312 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-03-23 11:57:06,312 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-03-23 11:57:06,312 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-03-23 11:57:06,326 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.03 11:57:06" (1/1) ... [2018-03-23 11:57:06,327 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.03 11:57:06" (1/1) ... [2018-03-23 11:57:06,344 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.03 11:57:06" (1/1) ... [2018-03-23 11:57:06,344 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.03 11:57:06" (1/1) ... [2018-03-23 11:57:06,359 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.03 11:57:06" (1/1) ... [2018-03-23 11:57:06,364 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.03 11:57:06" (1/1) ... [2018-03-23 11:57:06,367 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.03 11:57:06" (1/1) ... [2018-03-23 11:57:06,372 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-03-23 11:57:06,372 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-03-23 11:57:06,373 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-03-23 11:57:06,373 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-03-23 11:57:06,374 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.03 11:57:06" (1/1) ... No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-03-23 11:57:06,493 INFO L136 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-03-23 11:57:06,493 INFO L136 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-03-23 11:57:06,493 INFO L136 BoogieDeclarations]: Found implementation of procedure main [2018-03-23 11:57:06,493 INFO L128 BoogieDeclarations]: Found specification of procedure __ctype_get_mb_cur_max [2018-03-23 11:57:06,493 INFO L128 BoogieDeclarations]: Found specification of procedure atof [2018-03-23 11:57:06,494 INFO L128 BoogieDeclarations]: Found specification of procedure atoi [2018-03-23 11:57:06,494 INFO L128 BoogieDeclarations]: Found specification of procedure atol [2018-03-23 11:57:06,494 INFO L128 BoogieDeclarations]: Found specification of procedure atoll [2018-03-23 11:57:06,494 INFO L128 BoogieDeclarations]: Found specification of procedure strtod [2018-03-23 11:57:06,494 INFO L128 BoogieDeclarations]: Found specification of procedure strtof [2018-03-23 11:57:06,494 INFO L128 BoogieDeclarations]: Found specification of procedure strtold [2018-03-23 11:57:06,494 INFO L128 BoogieDeclarations]: Found specification of procedure strtol [2018-03-23 11:57:06,495 INFO L128 BoogieDeclarations]: Found specification of procedure strtoul [2018-03-23 11:57:06,495 INFO L128 BoogieDeclarations]: Found specification of procedure strtoq [2018-03-23 11:57:06,495 INFO L128 BoogieDeclarations]: Found specification of procedure strtouq [2018-03-23 11:57:06,495 INFO L128 BoogieDeclarations]: Found specification of procedure strtoll [2018-03-23 11:57:06,495 INFO L128 BoogieDeclarations]: Found specification of procedure strtoull [2018-03-23 11:57:06,495 INFO L128 BoogieDeclarations]: Found specification of procedure l64a [2018-03-23 11:57:06,495 INFO L128 BoogieDeclarations]: Found specification of procedure a64l [2018-03-23 11:57:06,496 INFO L128 BoogieDeclarations]: Found specification of procedure select [2018-03-23 11:57:06,496 INFO L128 BoogieDeclarations]: Found specification of procedure pselect [2018-03-23 11:57:06,496 INFO L128 BoogieDeclarations]: Found specification of procedure gnu_dev_major [2018-03-23 11:57:06,496 INFO L128 BoogieDeclarations]: Found specification of procedure gnu_dev_minor [2018-03-23 11:57:06,496 INFO L128 BoogieDeclarations]: Found specification of procedure gnu_dev_makedev [2018-03-23 11:57:06,496 INFO L128 BoogieDeclarations]: Found specification of procedure random [2018-03-23 11:57:06,496 INFO L128 BoogieDeclarations]: Found specification of procedure srandom [2018-03-23 11:57:06,497 INFO L128 BoogieDeclarations]: Found specification of procedure initstate [2018-03-23 11:57:06,497 INFO L128 BoogieDeclarations]: Found specification of procedure setstate [2018-03-23 11:57:06,497 INFO L128 BoogieDeclarations]: Found specification of procedure random_r [2018-03-23 11:57:06,497 INFO L128 BoogieDeclarations]: Found specification of procedure srandom_r [2018-03-23 11:57:06,497 INFO L128 BoogieDeclarations]: Found specification of procedure initstate_r [2018-03-23 11:57:06,497 INFO L128 BoogieDeclarations]: Found specification of procedure setstate_r [2018-03-23 11:57:06,497 INFO L128 BoogieDeclarations]: Found specification of procedure rand [2018-03-23 11:57:06,498 INFO L128 BoogieDeclarations]: Found specification of procedure srand [2018-03-23 11:57:06,498 INFO L128 BoogieDeclarations]: Found specification of procedure rand_r [2018-03-23 11:57:06,498 INFO L128 BoogieDeclarations]: Found specification of procedure drand48 [2018-03-23 11:57:06,498 INFO L128 BoogieDeclarations]: Found specification of procedure erand48 [2018-03-23 11:57:06,498 INFO L128 BoogieDeclarations]: Found specification of procedure lrand48 [2018-03-23 11:57:06,498 INFO L128 BoogieDeclarations]: Found specification of procedure nrand48 [2018-03-23 11:57:06,498 INFO L128 BoogieDeclarations]: Found specification of procedure mrand48 [2018-03-23 11:57:06,498 INFO L128 BoogieDeclarations]: Found specification of procedure jrand48 [2018-03-23 11:57:06,499 INFO L128 BoogieDeclarations]: Found specification of procedure srand48 [2018-03-23 11:57:06,499 INFO L128 BoogieDeclarations]: Found specification of procedure seed48 [2018-03-23 11:57:06,499 INFO L128 BoogieDeclarations]: Found specification of procedure lcong48 [2018-03-23 11:57:06,499 INFO L128 BoogieDeclarations]: Found specification of procedure drand48_r [2018-03-23 11:57:06,499 INFO L128 BoogieDeclarations]: Found specification of procedure erand48_r [2018-03-23 11:57:06,499 INFO L128 BoogieDeclarations]: Found specification of procedure lrand48_r [2018-03-23 11:57:06,499 INFO L128 BoogieDeclarations]: Found specification of procedure nrand48_r [2018-03-23 11:57:06,500 INFO L128 BoogieDeclarations]: Found specification of procedure mrand48_r [2018-03-23 11:57:06,500 INFO L128 BoogieDeclarations]: Found specification of procedure jrand48_r [2018-03-23 11:57:06,500 INFO L128 BoogieDeclarations]: Found specification of procedure srand48_r [2018-03-23 11:57:06,500 INFO L128 BoogieDeclarations]: Found specification of procedure seed48_r [2018-03-23 11:57:06,500 INFO L128 BoogieDeclarations]: Found specification of procedure lcong48_r [2018-03-23 11:57:06,500 INFO L128 BoogieDeclarations]: Found specification of procedure malloc [2018-03-23 11:57:06,500 INFO L128 BoogieDeclarations]: Found specification of procedure calloc [2018-03-23 11:57:06,501 INFO L128 BoogieDeclarations]: Found specification of procedure realloc [2018-03-23 11:57:06,501 INFO L128 BoogieDeclarations]: Found specification of procedure free [2018-03-23 11:57:06,501 INFO L128 BoogieDeclarations]: Found specification of procedure cfree [2018-03-23 11:57:06,501 INFO L128 BoogieDeclarations]: Found specification of procedure alloca [2018-03-23 11:57:06,501 INFO L128 BoogieDeclarations]: Found specification of procedure valloc [2018-03-23 11:57:06,501 INFO L128 BoogieDeclarations]: Found specification of procedure posix_memalign [2018-03-23 11:57:06,501 INFO L128 BoogieDeclarations]: Found specification of procedure aligned_alloc [2018-03-23 11:57:06,501 INFO L128 BoogieDeclarations]: Found specification of procedure abort [2018-03-23 11:57:06,502 INFO L128 BoogieDeclarations]: Found specification of procedure atexit [2018-03-23 11:57:06,502 INFO L128 BoogieDeclarations]: Found specification of procedure at_quick_exit [2018-03-23 11:57:06,502 INFO L128 BoogieDeclarations]: Found specification of procedure on_exit [2018-03-23 11:57:06,502 INFO L128 BoogieDeclarations]: Found specification of procedure exit [2018-03-23 11:57:06,502 INFO L128 BoogieDeclarations]: Found specification of procedure quick_exit [2018-03-23 11:57:06,502 INFO L128 BoogieDeclarations]: Found specification of procedure _Exit [2018-03-23 11:57:06,502 INFO L128 BoogieDeclarations]: Found specification of procedure getenv [2018-03-23 11:57:06,502 INFO L128 BoogieDeclarations]: Found specification of procedure putenv [2018-03-23 11:57:06,503 INFO L128 BoogieDeclarations]: Found specification of procedure setenv [2018-03-23 11:57:06,503 INFO L128 BoogieDeclarations]: Found specification of procedure unsetenv [2018-03-23 11:57:06,503 INFO L128 BoogieDeclarations]: Found specification of procedure clearenv [2018-03-23 11:57:06,503 INFO L128 BoogieDeclarations]: Found specification of procedure mktemp [2018-03-23 11:57:06,503 INFO L128 BoogieDeclarations]: Found specification of procedure mkstemp [2018-03-23 11:57:06,503 INFO L128 BoogieDeclarations]: Found specification of procedure mkstemps [2018-03-23 11:57:06,503 INFO L128 BoogieDeclarations]: Found specification of procedure mkdtemp [2018-03-23 11:57:06,503 INFO L128 BoogieDeclarations]: Found specification of procedure system [2018-03-23 11:57:06,504 INFO L128 BoogieDeclarations]: Found specification of procedure realpath [2018-03-23 11:57:06,504 INFO L128 BoogieDeclarations]: Found specification of procedure bsearch [2018-03-23 11:57:06,504 INFO L128 BoogieDeclarations]: Found specification of procedure qsort [2018-03-23 11:57:06,504 INFO L128 BoogieDeclarations]: Found specification of procedure abs [2018-03-23 11:57:06,504 INFO L128 BoogieDeclarations]: Found specification of procedure labs [2018-03-23 11:57:06,504 INFO L128 BoogieDeclarations]: Found specification of procedure llabs [2018-03-23 11:57:06,504 INFO L128 BoogieDeclarations]: Found specification of procedure div [2018-03-23 11:57:06,504 INFO L128 BoogieDeclarations]: Found specification of procedure ldiv [2018-03-23 11:57:06,505 INFO L128 BoogieDeclarations]: Found specification of procedure lldiv [2018-03-23 11:57:06,505 INFO L128 BoogieDeclarations]: Found specification of procedure ecvt [2018-03-23 11:57:06,505 INFO L128 BoogieDeclarations]: Found specification of procedure fcvt [2018-03-23 11:57:06,505 INFO L128 BoogieDeclarations]: Found specification of procedure gcvt [2018-03-23 11:57:06,505 INFO L128 BoogieDeclarations]: Found specification of procedure qecvt [2018-03-23 11:57:06,505 INFO L128 BoogieDeclarations]: Found specification of procedure qfcvt [2018-03-23 11:57:06,505 INFO L128 BoogieDeclarations]: Found specification of procedure qgcvt [2018-03-23 11:57:06,505 INFO L128 BoogieDeclarations]: Found specification of procedure ecvt_r [2018-03-23 11:57:06,506 INFO L128 BoogieDeclarations]: Found specification of procedure fcvt_r [2018-03-23 11:57:06,506 INFO L128 BoogieDeclarations]: Found specification of procedure qecvt_r [2018-03-23 11:57:06,506 INFO L128 BoogieDeclarations]: Found specification of procedure qfcvt_r [2018-03-23 11:57:06,506 INFO L128 BoogieDeclarations]: Found specification of procedure mblen [2018-03-23 11:57:06,506 INFO L128 BoogieDeclarations]: Found specification of procedure mbtowc [2018-03-23 11:57:06,506 INFO L128 BoogieDeclarations]: Found specification of procedure wctomb [2018-03-23 11:57:06,506 INFO L128 BoogieDeclarations]: Found specification of procedure mbstowcs [2018-03-23 11:57:06,506 INFO L128 BoogieDeclarations]: Found specification of procedure wcstombs [2018-03-23 11:57:06,507 INFO L128 BoogieDeclarations]: Found specification of procedure rpmatch [2018-03-23 11:57:06,507 INFO L128 BoogieDeclarations]: Found specification of procedure getsubopt [2018-03-23 11:57:06,507 INFO L128 BoogieDeclarations]: Found specification of procedure getloadavg [2018-03-23 11:57:06,507 INFO L128 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2018-03-23 11:57:06,507 INFO L128 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2018-03-23 11:57:06,507 INFO L128 BoogieDeclarations]: Found specification of procedure main [2018-03-23 11:57:06,507 INFO L128 BoogieDeclarations]: Found specification of procedure #Ultimate.alloc [2018-03-23 11:57:06,507 INFO L128 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2018-03-23 11:57:06,508 INFO L128 BoogieDeclarations]: Found specification of procedure write~int [2018-03-23 11:57:06,508 INFO L128 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2018-03-23 11:57:06,508 INFO L128 BoogieDeclarations]: Found specification of procedure read~int [2018-03-23 11:57:06,508 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2018-03-23 11:57:06,508 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-03-23 11:57:06,508 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-03-23 11:57:06,508 INFO L128 BoogieDeclarations]: Found specification of procedure write~unchecked~int [2018-03-23 11:57:07,051 INFO L259 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-03-23 11:57:07,051 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.03 11:57:07 BoogieIcfgContainer [2018-03-23 11:57:07,052 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-03-23 11:57:07,052 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-03-23 11:57:07,052 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-03-23 11:57:07,055 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-03-23 11:57:07,055 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 23.03 11:57:05" (1/3) ... [2018-03-23 11:57:07,055 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2fad9a23 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 23.03 11:57:07, skipping insertion in model container [2018-03-23 11:57:07,056 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.03 11:57:06" (2/3) ... [2018-03-23 11:57:07,056 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2fad9a23 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 23.03 11:57:07, skipping insertion in model container [2018-03-23 11:57:07,056 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.03 11:57:07" (3/3) ... [2018-03-23 11:57:07,057 INFO L107 eAbstractionObserver]: Analyzing ICFG sll-simple-white-blue_true-unreach-call_false-valid-memtrack.i [2018-03-23 11:57:07,067 INFO L131 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-03-23 11:57:07,074 INFO L143 ceAbstractionStarter]: Appying trace abstraction to program that has 43 error locations. [2018-03-23 11:57:07,119 INFO L128 ementStrategyFactory]: Using default assertion order modulation [2018-03-23 11:57:07,120 INFO L369 AbstractCegarLoop]: Interprodecural is true [2018-03-23 11:57:07,120 INFO L370 AbstractCegarLoop]: Hoare is true [2018-03-23 11:57:07,120 INFO L371 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-03-23 11:57:07,120 INFO L372 AbstractCegarLoop]: Backedges is TWOTRACK [2018-03-23 11:57:07,120 INFO L373 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-03-23 11:57:07,120 INFO L374 AbstractCegarLoop]: Difference is false [2018-03-23 11:57:07,120 INFO L375 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-03-23 11:57:07,120 INFO L380 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-03-23 11:57:07,121 INFO L87 2NestedWordAutomaton]: Mode: main mode - execution starts in main procedure [2018-03-23 11:57:07,138 INFO L276 IsEmpty]: Start isEmpty. Operand 135 states. [2018-03-23 11:57:07,143 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2018-03-23 11:57:07,144 INFO L345 BasicCegarLoop]: Found error trace [2018-03-23 11:57:07,144 INFO L353 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-03-23 11:57:07,145 INFO L408 AbstractCegarLoop]: === Iteration 1 === [mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr42EnsuresViolationMEMORY_LEAK, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr21RequiresViolation, mainErr31RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr39RequiresViolation, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr12RequiresViolation, mainErr40AssertViolationMEMORY_FREE, mainErr41AssertViolationMEMORY_FREE, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr9RequiresViolation, mainErr30RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr34RequiresViolation, mainErr4RequiresViolation, mainErr14RequiresViolation, mainErr37RequiresViolation]=== [2018-03-23 11:57:07,150 INFO L82 PathProgramCache]: Analyzing trace with hash 1387009914, now seen corresponding path program 1 times [2018-03-23 11:57:07,152 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-03-23 11:57:07,152 INFO L68 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-03-23 11:57:07,210 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-03-23 11:57:07,210 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-03-23 11:57:07,211 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-03-23 11:57:07,244 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-03-23 11:57:07,251 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-03-23 11:57:07,330 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-03-23 11:57:07,333 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-03-23 11:57:07,333 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-03-23 11:57:07,335 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-03-23 11:57:07,351 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-03-23 11:57:07,351 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-03-23 11:57:07,354 INFO L87 Difference]: Start difference. First operand 135 states. Second operand 4 states. [2018-03-23 11:57:07,612 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-03-23 11:57:07,612 INFO L93 Difference]: Finished difference Result 293 states and 331 transitions. [2018-03-23 11:57:07,613 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-03-23 11:57:07,614 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 9 [2018-03-23 11:57:07,615 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-03-23 11:57:07,630 INFO L225 Difference]: With dead ends: 293 [2018-03-23 11:57:07,631 INFO L226 Difference]: Without dead ends: 178 [2018-03-23 11:57:07,636 INFO L568 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-03-23 11:57:07,656 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 178 states. [2018-03-23 11:57:07,677 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 178 to 125. [2018-03-23 11:57:07,679 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 125 states. [2018-03-23 11:57:07,681 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 125 states to 125 states and 131 transitions. [2018-03-23 11:57:07,683 INFO L78 Accepts]: Start accepts. Automaton has 125 states and 131 transitions. Word has length 9 [2018-03-23 11:57:07,683 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-03-23 11:57:07,683 INFO L459 AbstractCegarLoop]: Abstraction has 125 states and 131 transitions. [2018-03-23 11:57:07,684 INFO L460 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-03-23 11:57:07,684 INFO L276 IsEmpty]: Start isEmpty. Operand 125 states and 131 transitions. [2018-03-23 11:57:07,684 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2018-03-23 11:57:07,684 INFO L345 BasicCegarLoop]: Found error trace [2018-03-23 11:57:07,684 INFO L353 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-03-23 11:57:07,684 INFO L408 AbstractCegarLoop]: === Iteration 2 === [mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr42EnsuresViolationMEMORY_LEAK, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr21RequiresViolation, mainErr31RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr39RequiresViolation, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr12RequiresViolation, mainErr40AssertViolationMEMORY_FREE, mainErr41AssertViolationMEMORY_FREE, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr9RequiresViolation, mainErr30RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr34RequiresViolation, mainErr4RequiresViolation, mainErr14RequiresViolation, mainErr37RequiresViolation]=== [2018-03-23 11:57:07,685 INFO L82 PathProgramCache]: Analyzing trace with hash 1387009915, now seen corresponding path program 1 times [2018-03-23 11:57:07,685 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-03-23 11:57:07,685 INFO L68 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-03-23 11:57:07,686 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-03-23 11:57:07,686 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-03-23 11:57:07,686 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-03-23 11:57:07,698 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-03-23 11:57:07,699 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-03-23 11:57:07,781 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-03-23 11:57:07,781 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-03-23 11:57:07,781 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-03-23 11:57:07,783 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-03-23 11:57:07,783 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-03-23 11:57:07,783 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-03-23 11:57:07,784 INFO L87 Difference]: Start difference. First operand 125 states and 131 transitions. Second operand 4 states. [2018-03-23 11:57:07,929 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-03-23 11:57:07,929 INFO L93 Difference]: Finished difference Result 162 states and 170 transitions. [2018-03-23 11:57:07,930 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-03-23 11:57:07,930 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 9 [2018-03-23 11:57:07,930 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-03-23 11:57:07,931 INFO L225 Difference]: With dead ends: 162 [2018-03-23 11:57:07,932 INFO L226 Difference]: Without dead ends: 160 [2018-03-23 11:57:07,932 INFO L568 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-03-23 11:57:07,933 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 160 states. [2018-03-23 11:57:07,941 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 160 to 123. [2018-03-23 11:57:07,941 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 123 states. [2018-03-23 11:57:07,942 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 123 states to 123 states and 129 transitions. [2018-03-23 11:57:07,942 INFO L78 Accepts]: Start accepts. Automaton has 123 states and 129 transitions. Word has length 9 [2018-03-23 11:57:07,943 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-03-23 11:57:07,943 INFO L459 AbstractCegarLoop]: Abstraction has 123 states and 129 transitions. [2018-03-23 11:57:07,943 INFO L460 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-03-23 11:57:07,943 INFO L276 IsEmpty]: Start isEmpty. Operand 123 states and 129 transitions. [2018-03-23 11:57:07,943 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2018-03-23 11:57:07,943 INFO L345 BasicCegarLoop]: Found error trace [2018-03-23 11:57:07,944 INFO L353 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-03-23 11:57:07,944 INFO L408 AbstractCegarLoop]: === Iteration 3 === [mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr42EnsuresViolationMEMORY_LEAK, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr21RequiresViolation, mainErr31RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr39RequiresViolation, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr12RequiresViolation, mainErr40AssertViolationMEMORY_FREE, mainErr41AssertViolationMEMORY_FREE, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr9RequiresViolation, mainErr30RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr34RequiresViolation, mainErr4RequiresViolation, mainErr14RequiresViolation, mainErr37RequiresViolation]=== [2018-03-23 11:57:07,944 INFO L82 PathProgramCache]: Analyzing trace with hash -1065446431, now seen corresponding path program 1 times [2018-03-23 11:57:07,944 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-03-23 11:57:07,944 INFO L68 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-03-23 11:57:07,946 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-03-23 11:57:07,946 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-03-23 11:57:07,946 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-03-23 11:57:07,967 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-03-23 11:57:07,968 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-03-23 11:57:08,018 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-03-23 11:57:08,019 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-03-23 11:57:08,019 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-03-23 11:57:08,019 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-03-23 11:57:08,019 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-03-23 11:57:08,020 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-03-23 11:57:08,020 INFO L87 Difference]: Start difference. First operand 123 states and 129 transitions. Second operand 4 states. [2018-03-23 11:57:08,166 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-03-23 11:57:08,166 INFO L93 Difference]: Finished difference Result 147 states and 153 transitions. [2018-03-23 11:57:08,167 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-03-23 11:57:08,167 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 17 [2018-03-23 11:57:08,167 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-03-23 11:57:08,168 INFO L225 Difference]: With dead ends: 147 [2018-03-23 11:57:08,168 INFO L226 Difference]: Without dead ends: 131 [2018-03-23 11:57:08,169 INFO L568 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-03-23 11:57:08,169 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 131 states. [2018-03-23 11:57:08,179 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 131 to 123. [2018-03-23 11:57:08,179 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 123 states. [2018-03-23 11:57:08,181 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 123 states to 123 states and 134 transitions. [2018-03-23 11:57:08,181 INFO L78 Accepts]: Start accepts. Automaton has 123 states and 134 transitions. Word has length 17 [2018-03-23 11:57:08,181 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-03-23 11:57:08,181 INFO L459 AbstractCegarLoop]: Abstraction has 123 states and 134 transitions. [2018-03-23 11:57:08,181 INFO L460 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-03-23 11:57:08,182 INFO L276 IsEmpty]: Start isEmpty. Operand 123 states and 134 transitions. [2018-03-23 11:57:08,182 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2018-03-23 11:57:08,182 INFO L345 BasicCegarLoop]: Found error trace [2018-03-23 11:57:08,182 INFO L353 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-03-23 11:57:08,182 INFO L408 AbstractCegarLoop]: === Iteration 4 === [mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr42EnsuresViolationMEMORY_LEAK, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr21RequiresViolation, mainErr31RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr39RequiresViolation, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr12RequiresViolation, mainErr40AssertViolationMEMORY_FREE, mainErr41AssertViolationMEMORY_FREE, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr9RequiresViolation, mainErr30RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr34RequiresViolation, mainErr4RequiresViolation, mainErr14RequiresViolation, mainErr37RequiresViolation]=== [2018-03-23 11:57:08,183 INFO L82 PathProgramCache]: Analyzing trace with hash -1065446430, now seen corresponding path program 1 times [2018-03-23 11:57:08,183 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-03-23 11:57:08,183 INFO L68 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-03-23 11:57:08,184 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-03-23 11:57:08,184 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-03-23 11:57:08,184 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-03-23 11:57:08,200 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-03-23 11:57:08,201 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-03-23 11:57:08,307 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-03-23 11:57:08,307 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-03-23 11:57:08,307 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-03-23 11:57:08,308 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-03-23 11:57:08,308 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-03-23 11:57:08,308 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-03-23 11:57:08,308 INFO L87 Difference]: Start difference. First operand 123 states and 134 transitions. Second operand 5 states. [2018-03-23 11:57:08,542 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-03-23 11:57:08,542 INFO L93 Difference]: Finished difference Result 224 states and 241 transitions. [2018-03-23 11:57:08,542 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-03-23 11:57:08,543 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 17 [2018-03-23 11:57:08,543 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-03-23 11:57:08,544 INFO L225 Difference]: With dead ends: 224 [2018-03-23 11:57:08,544 INFO L226 Difference]: Without dead ends: 211 [2018-03-23 11:57:08,544 INFO L568 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2018-03-23 11:57:08,545 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 211 states. [2018-03-23 11:57:08,561 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 211 to 180. [2018-03-23 11:57:08,562 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 180 states. [2018-03-23 11:57:08,563 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 180 states to 180 states and 204 transitions. [2018-03-23 11:57:08,564 INFO L78 Accepts]: Start accepts. Automaton has 180 states and 204 transitions. Word has length 17 [2018-03-23 11:57:08,564 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-03-23 11:57:08,564 INFO L459 AbstractCegarLoop]: Abstraction has 180 states and 204 transitions. [2018-03-23 11:57:08,564 INFO L460 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-03-23 11:57:08,564 INFO L276 IsEmpty]: Start isEmpty. Operand 180 states and 204 transitions. [2018-03-23 11:57:08,565 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2018-03-23 11:57:08,565 INFO L345 BasicCegarLoop]: Found error trace [2018-03-23 11:57:08,565 INFO L353 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-03-23 11:57:08,566 INFO L408 AbstractCegarLoop]: === Iteration 5 === [mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr42EnsuresViolationMEMORY_LEAK, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr21RequiresViolation, mainErr31RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr39RequiresViolation, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr12RequiresViolation, mainErr40AssertViolationMEMORY_FREE, mainErr41AssertViolationMEMORY_FREE, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr9RequiresViolation, mainErr30RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr34RequiresViolation, mainErr4RequiresViolation, mainErr14RequiresViolation, mainErr37RequiresViolation]=== [2018-03-23 11:57:08,566 INFO L82 PathProgramCache]: Analyzing trace with hash -1092447099, now seen corresponding path program 1 times [2018-03-23 11:57:08,566 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-03-23 11:57:08,566 INFO L68 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-03-23 11:57:08,567 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-03-23 11:57:08,568 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-03-23 11:57:08,568 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-03-23 11:57:08,579 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-03-23 11:57:08,580 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-03-23 11:57:08,600 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-03-23 11:57:08,600 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-03-23 11:57:08,601 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-03-23 11:57:08,601 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-03-23 11:57:08,601 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-03-23 11:57:08,601 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-03-23 11:57:08,601 INFO L87 Difference]: Start difference. First operand 180 states and 204 transitions. Second operand 4 states. [2018-03-23 11:57:08,736 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-03-23 11:57:08,736 INFO L93 Difference]: Finished difference Result 202 states and 217 transitions. [2018-03-23 11:57:08,736 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-03-23 11:57:08,736 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 21 [2018-03-23 11:57:08,736 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-03-23 11:57:08,738 INFO L225 Difference]: With dead ends: 202 [2018-03-23 11:57:08,738 INFO L226 Difference]: Without dead ends: 201 [2018-03-23 11:57:08,738 INFO L568 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-03-23 11:57:08,738 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 201 states. [2018-03-23 11:57:08,748 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 201 to 179. [2018-03-23 11:57:08,749 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 179 states. [2018-03-23 11:57:08,750 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 179 states to 179 states and 203 transitions. [2018-03-23 11:57:08,750 INFO L78 Accepts]: Start accepts. Automaton has 179 states and 203 transitions. Word has length 21 [2018-03-23 11:57:08,751 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-03-23 11:57:08,751 INFO L459 AbstractCegarLoop]: Abstraction has 179 states and 203 transitions. [2018-03-23 11:57:08,751 INFO L460 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-03-23 11:57:08,751 INFO L276 IsEmpty]: Start isEmpty. Operand 179 states and 203 transitions. [2018-03-23 11:57:08,752 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2018-03-23 11:57:08,752 INFO L345 BasicCegarLoop]: Found error trace [2018-03-23 11:57:08,752 INFO L353 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-03-23 11:57:08,752 INFO L408 AbstractCegarLoop]: === Iteration 6 === [mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr42EnsuresViolationMEMORY_LEAK, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr21RequiresViolation, mainErr31RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr39RequiresViolation, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr12RequiresViolation, mainErr40AssertViolationMEMORY_FREE, mainErr41AssertViolationMEMORY_FREE, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr9RequiresViolation, mainErr30RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr34RequiresViolation, mainErr4RequiresViolation, mainErr14RequiresViolation, mainErr37RequiresViolation]=== [2018-03-23 11:57:08,752 INFO L82 PathProgramCache]: Analyzing trace with hash -1092447098, now seen corresponding path program 1 times [2018-03-23 11:57:08,752 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-03-23 11:57:08,753 INFO L68 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-03-23 11:57:08,754 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-03-23 11:57:08,754 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-03-23 11:57:08,754 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-03-23 11:57:08,767 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-03-23 11:57:08,768 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-03-23 11:57:08,798 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-03-23 11:57:08,798 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-03-23 11:57:08,798 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-03-23 11:57:08,798 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-03-23 11:57:08,799 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-03-23 11:57:08,799 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-03-23 11:57:08,799 INFO L87 Difference]: Start difference. First operand 179 states and 203 transitions. Second operand 4 states. [2018-03-23 11:57:08,897 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-03-23 11:57:08,897 INFO L93 Difference]: Finished difference Result 203 states and 220 transitions. [2018-03-23 11:57:08,897 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-03-23 11:57:08,897 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 21 [2018-03-23 11:57:08,897 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-03-23 11:57:08,898 INFO L225 Difference]: With dead ends: 203 [2018-03-23 11:57:08,898 INFO L226 Difference]: Without dead ends: 201 [2018-03-23 11:57:08,899 INFO L568 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-03-23 11:57:08,899 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 201 states. [2018-03-23 11:57:08,907 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 201 to 177. [2018-03-23 11:57:08,907 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 177 states. [2018-03-23 11:57:08,908 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 177 states to 177 states and 201 transitions. [2018-03-23 11:57:08,908 INFO L78 Accepts]: Start accepts. Automaton has 177 states and 201 transitions. Word has length 21 [2018-03-23 11:57:08,908 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-03-23 11:57:08,908 INFO L459 AbstractCegarLoop]: Abstraction has 177 states and 201 transitions. [2018-03-23 11:57:08,908 INFO L460 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-03-23 11:57:08,908 INFO L276 IsEmpty]: Start isEmpty. Operand 177 states and 201 transitions. [2018-03-23 11:57:08,909 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2018-03-23 11:57:08,909 INFO L345 BasicCegarLoop]: Found error trace [2018-03-23 11:57:08,909 INFO L353 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-03-23 11:57:08,909 INFO L408 AbstractCegarLoop]: === Iteration 7 === [mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr42EnsuresViolationMEMORY_LEAK, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr21RequiresViolation, mainErr31RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr39RequiresViolation, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr12RequiresViolation, mainErr40AssertViolationMEMORY_FREE, mainErr41AssertViolationMEMORY_FREE, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr9RequiresViolation, mainErr30RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr34RequiresViolation, mainErr4RequiresViolation, mainErr14RequiresViolation, mainErr37RequiresViolation]=== [2018-03-23 11:57:08,909 INFO L82 PathProgramCache]: Analyzing trace with hash 1969180389, now seen corresponding path program 1 times [2018-03-23 11:57:08,909 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-03-23 11:57:08,909 INFO L68 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-03-23 11:57:08,911 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-03-23 11:57:08,911 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-03-23 11:57:08,911 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-03-23 11:57:08,922 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-03-23 11:57:08,923 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-03-23 11:57:08,959 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-03-23 11:57:08,959 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-03-23 11:57:08,959 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-03-23 11:57:08,959 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-03-23 11:57:08,960 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-03-23 11:57:08,960 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-03-23 11:57:08,960 INFO L87 Difference]: Start difference. First operand 177 states and 201 transitions. Second operand 6 states. [2018-03-23 11:57:09,192 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-03-23 11:57:09,192 INFO L93 Difference]: Finished difference Result 310 states and 353 transitions. [2018-03-23 11:57:09,193 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-03-23 11:57:09,193 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 21 [2018-03-23 11:57:09,193 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-03-23 11:57:09,194 INFO L225 Difference]: With dead ends: 310 [2018-03-23 11:57:09,194 INFO L226 Difference]: Without dead ends: 309 [2018-03-23 11:57:09,195 INFO L568 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=34, Invalid=56, Unknown=0, NotChecked=0, Total=90 [2018-03-23 11:57:09,195 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 309 states. [2018-03-23 11:57:09,202 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 309 to 176. [2018-03-23 11:57:09,202 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 176 states. [2018-03-23 11:57:09,203 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 176 states to 176 states and 200 transitions. [2018-03-23 11:57:09,203 INFO L78 Accepts]: Start accepts. Automaton has 176 states and 200 transitions. Word has length 21 [2018-03-23 11:57:09,204 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-03-23 11:57:09,204 INFO L459 AbstractCegarLoop]: Abstraction has 176 states and 200 transitions. [2018-03-23 11:57:09,204 INFO L460 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-03-23 11:57:09,204 INFO L276 IsEmpty]: Start isEmpty. Operand 176 states and 200 transitions. [2018-03-23 11:57:09,204 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2018-03-23 11:57:09,204 INFO L345 BasicCegarLoop]: Found error trace [2018-03-23 11:57:09,204 INFO L353 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-03-23 11:57:09,204 INFO L408 AbstractCegarLoop]: === Iteration 8 === [mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr42EnsuresViolationMEMORY_LEAK, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr21RequiresViolation, mainErr31RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr39RequiresViolation, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr12RequiresViolation, mainErr40AssertViolationMEMORY_FREE, mainErr41AssertViolationMEMORY_FREE, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr9RequiresViolation, mainErr30RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr34RequiresViolation, mainErr4RequiresViolation, mainErr14RequiresViolation, mainErr37RequiresViolation]=== [2018-03-23 11:57:09,205 INFO L82 PathProgramCache]: Analyzing trace with hash 1969180390, now seen corresponding path program 1 times [2018-03-23 11:57:09,205 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-03-23 11:57:09,205 INFO L68 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-03-23 11:57:09,206 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-03-23 11:57:09,206 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-03-23 11:57:09,206 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-03-23 11:57:09,214 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-03-23 11:57:09,215 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-03-23 11:57:09,289 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-03-23 11:57:09,289 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-03-23 11:57:09,289 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-03-23 11:57:09,289 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-03-23 11:57:09,289 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-03-23 11:57:09,290 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-03-23 11:57:09,290 INFO L87 Difference]: Start difference. First operand 176 states and 200 transitions. Second operand 6 states. [2018-03-23 11:57:09,614 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-03-23 11:57:09,615 INFO L93 Difference]: Finished difference Result 320 states and 366 transitions. [2018-03-23 11:57:09,615 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-03-23 11:57:09,615 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 21 [2018-03-23 11:57:09,615 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-03-23 11:57:09,616 INFO L225 Difference]: With dead ends: 320 [2018-03-23 11:57:09,616 INFO L226 Difference]: Without dead ends: 316 [2018-03-23 11:57:09,617 INFO L568 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=47, Invalid=85, Unknown=0, NotChecked=0, Total=132 [2018-03-23 11:57:09,617 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 316 states. [2018-03-23 11:57:09,624 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 316 to 165. [2018-03-23 11:57:09,625 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 165 states. [2018-03-23 11:57:09,625 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 165 states to 165 states and 188 transitions. [2018-03-23 11:57:09,625 INFO L78 Accepts]: Start accepts. Automaton has 165 states and 188 transitions. Word has length 21 [2018-03-23 11:57:09,626 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-03-23 11:57:09,626 INFO L459 AbstractCegarLoop]: Abstraction has 165 states and 188 transitions. [2018-03-23 11:57:09,626 INFO L460 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-03-23 11:57:09,626 INFO L276 IsEmpty]: Start isEmpty. Operand 165 states and 188 transitions. [2018-03-23 11:57:09,627 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2018-03-23 11:57:09,627 INFO L345 BasicCegarLoop]: Found error trace [2018-03-23 11:57:09,627 INFO L353 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] [2018-03-23 11:57:09,627 INFO L408 AbstractCegarLoop]: === Iteration 9 === [mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr42EnsuresViolationMEMORY_LEAK, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr21RequiresViolation, mainErr31RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr39RequiresViolation, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr12RequiresViolation, mainErr40AssertViolationMEMORY_FREE, mainErr41AssertViolationMEMORY_FREE, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr9RequiresViolation, mainErr30RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr34RequiresViolation, mainErr4RequiresViolation, mainErr14RequiresViolation, mainErr37RequiresViolation]=== [2018-03-23 11:57:09,628 INFO L82 PathProgramCache]: Analyzing trace with hash -1344302103, now seen corresponding path program 1 times [2018-03-23 11:57:09,628 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-03-23 11:57:09,628 INFO L68 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-03-23 11:57:09,629 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-03-23 11:57:09,629 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-03-23 11:57:09,629 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-03-23 11:57:09,639 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-03-23 11:57:09,640 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-03-23 11:57:09,682 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-03-23 11:57:09,682 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-03-23 11:57:09,682 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-03-23 11:57:09,682 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-03-23 11:57:09,682 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-03-23 11:57:09,682 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-03-23 11:57:09,683 INFO L87 Difference]: Start difference. First operand 165 states and 188 transitions. Second operand 5 states. [2018-03-23 11:57:10,110 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-03-23 11:57:10,110 INFO L93 Difference]: Finished difference Result 211 states and 224 transitions. [2018-03-23 11:57:10,111 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-03-23 11:57:10,111 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 26 [2018-03-23 11:57:10,111 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-03-23 11:57:10,113 INFO L225 Difference]: With dead ends: 211 [2018-03-23 11:57:10,113 INFO L226 Difference]: Without dead ends: 206 [2018-03-23 11:57:10,113 INFO L568 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2018-03-23 11:57:10,114 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 206 states. [2018-03-23 11:57:10,124 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 206 to 135. [2018-03-23 11:57:10,124 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 135 states. [2018-03-23 11:57:10,125 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 135 states to 135 states and 145 transitions. [2018-03-23 11:57:10,125 INFO L78 Accepts]: Start accepts. Automaton has 135 states and 145 transitions. Word has length 26 [2018-03-23 11:57:10,126 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-03-23 11:57:10,126 INFO L459 AbstractCegarLoop]: Abstraction has 135 states and 145 transitions. [2018-03-23 11:57:10,126 INFO L460 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-03-23 11:57:10,126 INFO L276 IsEmpty]: Start isEmpty. Operand 135 states and 145 transitions. [2018-03-23 11:57:10,127 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2018-03-23 11:57:10,127 INFO L345 BasicCegarLoop]: Found error trace [2018-03-23 11:57:10,128 INFO L353 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] [2018-03-23 11:57:10,128 INFO L408 AbstractCegarLoop]: === Iteration 10 === [mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr42EnsuresViolationMEMORY_LEAK, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr21RequiresViolation, mainErr31RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr39RequiresViolation, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr12RequiresViolation, mainErr40AssertViolationMEMORY_FREE, mainErr41AssertViolationMEMORY_FREE, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr9RequiresViolation, mainErr30RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr34RequiresViolation, mainErr4RequiresViolation, mainErr14RequiresViolation, mainErr37RequiresViolation]=== [2018-03-23 11:57:10,128 INFO L82 PathProgramCache]: Analyzing trace with hash 779529853, now seen corresponding path program 1 times [2018-03-23 11:57:10,128 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-03-23 11:57:10,128 INFO L68 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-03-23 11:57:10,130 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-03-23 11:57:10,130 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-03-23 11:57:10,130 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-03-23 11:57:10,139 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-03-23 11:57:10,140 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-03-23 11:57:10,213 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-03-23 11:57:10,213 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-03-23 11:57:10,213 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-03-23 11:57:10,214 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-03-23 11:57:10,214 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-03-23 11:57:10,214 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-03-23 11:57:10,214 INFO L87 Difference]: Start difference. First operand 135 states and 145 transitions. Second operand 5 states. [2018-03-23 11:57:10,432 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-03-23 11:57:10,432 INFO L93 Difference]: Finished difference Result 258 states and 278 transitions. [2018-03-23 11:57:10,432 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-03-23 11:57:10,433 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 31 [2018-03-23 11:57:10,433 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-03-23 11:57:10,434 INFO L225 Difference]: With dead ends: 258 [2018-03-23 11:57:10,434 INFO L226 Difference]: Without dead ends: 160 [2018-03-23 11:57:10,435 INFO L568 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2018-03-23 11:57:10,435 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 160 states. [2018-03-23 11:57:10,445 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 160 to 146. [2018-03-23 11:57:10,445 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 146 states. [2018-03-23 11:57:10,446 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 146 states to 146 states and 158 transitions. [2018-03-23 11:57:10,446 INFO L78 Accepts]: Start accepts. Automaton has 146 states and 158 transitions. Word has length 31 [2018-03-23 11:57:10,447 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-03-23 11:57:10,447 INFO L459 AbstractCegarLoop]: Abstraction has 146 states and 158 transitions. [2018-03-23 11:57:10,447 INFO L460 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-03-23 11:57:10,447 INFO L276 IsEmpty]: Start isEmpty. Operand 146 states and 158 transitions. [2018-03-23 11:57:10,448 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2018-03-23 11:57:10,448 INFO L345 BasicCegarLoop]: Found error trace [2018-03-23 11:57:10,449 INFO L353 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] [2018-03-23 11:57:10,449 INFO L408 AbstractCegarLoop]: === Iteration 11 === [mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr42EnsuresViolationMEMORY_LEAK, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr21RequiresViolation, mainErr31RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr39RequiresViolation, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr12RequiresViolation, mainErr40AssertViolationMEMORY_FREE, mainErr41AssertViolationMEMORY_FREE, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr9RequiresViolation, mainErr30RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr34RequiresViolation, mainErr4RequiresViolation, mainErr14RequiresViolation, mainErr37RequiresViolation]=== [2018-03-23 11:57:10,449 INFO L82 PathProgramCache]: Analyzing trace with hash -1629493320, now seen corresponding path program 1 times [2018-03-23 11:57:10,449 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-03-23 11:57:10,449 INFO L68 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-03-23 11:57:10,450 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-03-23 11:57:10,451 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-03-23 11:57:10,451 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-03-23 11:57:10,463 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-03-23 11:57:10,476 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-03-23 11:57:10,603 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-03-23 11:57:10,603 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-03-23 11:57:10,603 INFO L213 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-03-23 11:57:10,617 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-03-23 11:57:10,648 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-03-23 11:57:10,658 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-03-23 11:57:10,711 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 11 [2018-03-23 11:57:10,712 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-03-23 11:57:10,722 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-03-23 11:57:10,723 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:12, output treesize:11 [2018-03-23 11:57:10,761 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 8 [2018-03-23 11:57:10,764 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-03-23 11:57:10,764 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-03-23 11:57:10,766 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-03-23 11:57:10,771 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-03-23 11:57:10,772 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:22, output treesize:15 [2018-03-23 11:57:10,802 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 13 [2018-03-23 11:57:10,805 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 5 [2018-03-23 11:57:10,805 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-03-23 11:57:10,807 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-03-23 11:57:10,811 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-03-23 11:57:10,811 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:22, output treesize:11 [2018-03-23 11:57:10,846 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-03-23 11:57:10,869 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-03-23 11:57:10,870 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 12 [2018-03-23 11:57:10,870 INFO L442 AbstractCegarLoop]: Interpolant automaton has 13 states [2018-03-23 11:57:10,870 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2018-03-23 11:57:10,870 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=118, Unknown=0, NotChecked=0, Total=156 [2018-03-23 11:57:10,871 INFO L87 Difference]: Start difference. First operand 146 states and 158 transitions. Second operand 13 states. [2018-03-23 11:57:11,577 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-03-23 11:57:11,577 INFO L93 Difference]: Finished difference Result 203 states and 217 transitions. [2018-03-23 11:57:11,577 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-03-23 11:57:11,577 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 33 [2018-03-23 11:57:11,578 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-03-23 11:57:11,579 INFO L225 Difference]: With dead ends: 203 [2018-03-23 11:57:11,579 INFO L226 Difference]: Without dead ends: 201 [2018-03-23 11:57:11,580 INFO L568 BasicCegarLoop]: 0 DeclaredPredicates, 49 GetRequests, 29 SyntacticMatches, 2 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 60 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=126, Invalid=254, Unknown=0, NotChecked=0, Total=380 [2018-03-23 11:57:11,580 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 201 states. [2018-03-23 11:57:11,591 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 201 to 154. [2018-03-23 11:57:11,592 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 154 states. [2018-03-23 11:57:11,593 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 154 states to 154 states and 168 transitions. [2018-03-23 11:57:11,593 INFO L78 Accepts]: Start accepts. Automaton has 154 states and 168 transitions. Word has length 33 [2018-03-23 11:57:11,593 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-03-23 11:57:11,593 INFO L459 AbstractCegarLoop]: Abstraction has 154 states and 168 transitions. [2018-03-23 11:57:11,593 INFO L460 AbstractCegarLoop]: Interpolant automaton has 13 states. [2018-03-23 11:57:11,594 INFO L276 IsEmpty]: Start isEmpty. Operand 154 states and 168 transitions. [2018-03-23 11:57:11,594 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2018-03-23 11:57:11,595 INFO L345 BasicCegarLoop]: Found error trace [2018-03-23 11:57:11,595 INFO L353 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] [2018-03-23 11:57:11,595 INFO L408 AbstractCegarLoop]: === Iteration 12 === [mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr42EnsuresViolationMEMORY_LEAK, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr21RequiresViolation, mainErr31RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr39RequiresViolation, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr12RequiresViolation, mainErr40AssertViolationMEMORY_FREE, mainErr41AssertViolationMEMORY_FREE, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr9RequiresViolation, mainErr30RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr34RequiresViolation, mainErr4RequiresViolation, mainErr14RequiresViolation, mainErr37RequiresViolation]=== [2018-03-23 11:57:11,595 INFO L82 PathProgramCache]: Analyzing trace with hash -1629493319, now seen corresponding path program 1 times [2018-03-23 11:57:11,595 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-03-23 11:57:11,595 INFO L68 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-03-23 11:57:11,597 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-03-23 11:57:11,597 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-03-23 11:57:11,597 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-03-23 11:57:11,609 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-03-23 11:57:11,610 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-03-23 11:57:11,739 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-03-23 11:57:11,739 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-03-23 11:57:11,739 INFO L213 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-03-23 11:57:11,753 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-03-23 11:57:11,775 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-03-23 11:57:11,778 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-03-23 11:57:11,790 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-03-23 11:57:11,790 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-03-23 11:57:11,802 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-03-23 11:57:11,802 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:6, output treesize:5 [2018-03-23 11:57:11,876 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 19 treesize of output 14 [2018-03-23 11:57:11,876 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-03-23 11:57:11,901 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-03-23 11:57:11,902 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:24, output treesize:19 [2018-03-23 11:57:11,997 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 8 [2018-03-23 11:57:12,002 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-03-23 11:57:12,002 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-03-23 11:57:12,016 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-03-23 11:57:12,029 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 8 [2018-03-23 11:57:12,030 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-03-23 11:57:12,031 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-03-23 11:57:12,032 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-03-23 11:57:12,039 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-03-23 11:57:12,039 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 4 variables, input treesize:41, output treesize:31 [2018-03-23 11:57:12,110 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 13 [2018-03-23 11:57:12,112 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 5 [2018-03-23 11:57:12,112 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-03-23 11:57:12,115 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-03-23 11:57:12,124 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 18 [2018-03-23 11:57:12,127 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 9 [2018-03-23 11:57:12,127 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-03-23 11:57:12,130 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-03-23 11:57:12,136 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-03-23 11:57:12,136 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 4 variables, input treesize:45, output treesize:19 [2018-03-23 11:57:12,179 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-03-23 11:57:12,214 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-03-23 11:57:12,215 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 10] total 17 [2018-03-23 11:57:12,215 INFO L442 AbstractCegarLoop]: Interpolant automaton has 18 states [2018-03-23 11:57:12,215 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2018-03-23 11:57:12,215 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=259, Unknown=0, NotChecked=0, Total=306 [2018-03-23 11:57:12,215 INFO L87 Difference]: Start difference. First operand 154 states and 168 transitions. Second operand 18 states. [2018-03-23 11:57:13,272 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-03-23 11:57:13,273 INFO L93 Difference]: Finished difference Result 235 states and 250 transitions. [2018-03-23 11:57:13,273 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2018-03-23 11:57:13,273 INFO L78 Accepts]: Start accepts. Automaton has 18 states. Word has length 33 [2018-03-23 11:57:13,273 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-03-23 11:57:13,275 INFO L225 Difference]: With dead ends: 235 [2018-03-23 11:57:13,275 INFO L226 Difference]: Without dead ends: 232 [2018-03-23 11:57:13,276 INFO L568 BasicCegarLoop]: 0 DeclaredPredicates, 57 GetRequests, 26 SyntacticMatches, 1 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 121 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=256, Invalid=736, Unknown=0, NotChecked=0, Total=992 [2018-03-23 11:57:13,276 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 232 states. [2018-03-23 11:57:13,296 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 232 to 152. [2018-03-23 11:57:13,297 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 152 states. [2018-03-23 11:57:13,297 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 152 states to 152 states and 165 transitions. [2018-03-23 11:57:13,297 INFO L78 Accepts]: Start accepts. Automaton has 152 states and 165 transitions. Word has length 33 [2018-03-23 11:57:13,298 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-03-23 11:57:13,298 INFO L459 AbstractCegarLoop]: Abstraction has 152 states and 165 transitions. [2018-03-23 11:57:13,298 INFO L460 AbstractCegarLoop]: Interpolant automaton has 18 states. [2018-03-23 11:57:13,298 INFO L276 IsEmpty]: Start isEmpty. Operand 152 states and 165 transitions. [2018-03-23 11:57:13,299 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2018-03-23 11:57:13,299 INFO L345 BasicCegarLoop]: Found error trace [2018-03-23 11:57:13,299 INFO L353 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] [2018-03-23 11:57:13,299 INFO L408 AbstractCegarLoop]: === Iteration 13 === [mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr42EnsuresViolationMEMORY_LEAK, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr21RequiresViolation, mainErr31RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr39RequiresViolation, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr12RequiresViolation, mainErr40AssertViolationMEMORY_FREE, mainErr41AssertViolationMEMORY_FREE, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr9RequiresViolation, mainErr30RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr34RequiresViolation, mainErr4RequiresViolation, mainErr14RequiresViolation, mainErr37RequiresViolation]=== [2018-03-23 11:57:13,299 INFO L82 PathProgramCache]: Analyzing trace with hash 1960994897, now seen corresponding path program 1 times [2018-03-23 11:57:13,299 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-03-23 11:57:13,300 INFO L68 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-03-23 11:57:13,301 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-03-23 11:57:13,301 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-03-23 11:57:13,301 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-03-23 11:57:13,311 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-03-23 11:57:13,312 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-03-23 11:57:13,501 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-03-23 11:57:13,501 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-03-23 11:57:13,501 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2018-03-23 11:57:13,501 INFO L442 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-03-23 11:57:13,501 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-03-23 11:57:13,502 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2018-03-23 11:57:13,502 INFO L87 Difference]: Start difference. First operand 152 states and 165 transitions. Second operand 9 states. [2018-03-23 11:57:13,968 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-03-23 11:57:13,968 INFO L93 Difference]: Finished difference Result 211 states and 227 transitions. [2018-03-23 11:57:13,969 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-03-23 11:57:13,969 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 34 [2018-03-23 11:57:13,969 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-03-23 11:57:13,970 INFO L225 Difference]: With dead ends: 211 [2018-03-23 11:57:13,970 INFO L226 Difference]: Without dead ends: 210 [2018-03-23 11:57:13,971 INFO L568 BasicCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 24 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=84, Invalid=156, Unknown=0, NotChecked=0, Total=240 [2018-03-23 11:57:13,971 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 210 states. [2018-03-23 11:57:13,981 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 210 to 159. [2018-03-23 11:57:13,981 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 159 states. [2018-03-23 11:57:13,983 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 159 states to 159 states and 174 transitions. [2018-03-23 11:57:13,983 INFO L78 Accepts]: Start accepts. Automaton has 159 states and 174 transitions. Word has length 34 [2018-03-23 11:57:13,983 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-03-23 11:57:13,983 INFO L459 AbstractCegarLoop]: Abstraction has 159 states and 174 transitions. [2018-03-23 11:57:13,983 INFO L460 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-03-23 11:57:13,984 INFO L276 IsEmpty]: Start isEmpty. Operand 159 states and 174 transitions. [2018-03-23 11:57:13,984 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2018-03-23 11:57:13,984 INFO L345 BasicCegarLoop]: Found error trace [2018-03-23 11:57:13,985 INFO L353 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] [2018-03-23 11:57:13,985 INFO L408 AbstractCegarLoop]: === Iteration 14 === [mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr42EnsuresViolationMEMORY_LEAK, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr21RequiresViolation, mainErr31RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr39RequiresViolation, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr12RequiresViolation, mainErr40AssertViolationMEMORY_FREE, mainErr41AssertViolationMEMORY_FREE, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr9RequiresViolation, mainErr30RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr34RequiresViolation, mainErr4RequiresViolation, mainErr14RequiresViolation, mainErr37RequiresViolation]=== [2018-03-23 11:57:13,985 INFO L82 PathProgramCache]: Analyzing trace with hash 1960994898, now seen corresponding path program 1 times [2018-03-23 11:57:13,985 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-03-23 11:57:13,985 INFO L68 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-03-23 11:57:13,986 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-03-23 11:57:13,986 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-03-23 11:57:13,986 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-03-23 11:57:13,997 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-03-23 11:57:13,998 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-03-23 11:57:14,165 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-03-23 11:57:14,165 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-03-23 11:57:14,165 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2018-03-23 11:57:14,165 INFO L442 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-03-23 11:57:14,166 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-03-23 11:57:14,166 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2018-03-23 11:57:14,166 INFO L87 Difference]: Start difference. First operand 159 states and 174 transitions. Second operand 9 states. [2018-03-23 11:57:14,529 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-03-23 11:57:14,529 INFO L93 Difference]: Finished difference Result 241 states and 257 transitions. [2018-03-23 11:57:14,529 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2018-03-23 11:57:14,529 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 34 [2018-03-23 11:57:14,529 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-03-23 11:57:14,530 INFO L225 Difference]: With dead ends: 241 [2018-03-23 11:57:14,530 INFO L226 Difference]: Without dead ends: 239 [2018-03-23 11:57:14,531 INFO L568 BasicCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 3 SyntacticMatches, 2 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 48 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=81, Invalid=261, Unknown=0, NotChecked=0, Total=342 [2018-03-23 11:57:14,531 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 239 states. [2018-03-23 11:57:14,539 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 239 to 162. [2018-03-23 11:57:14,539 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 162 states. [2018-03-23 11:57:14,539 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 162 states to 162 states and 176 transitions. [2018-03-23 11:57:14,540 INFO L78 Accepts]: Start accepts. Automaton has 162 states and 176 transitions. Word has length 34 [2018-03-23 11:57:14,540 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-03-23 11:57:14,540 INFO L459 AbstractCegarLoop]: Abstraction has 162 states and 176 transitions. [2018-03-23 11:57:14,540 INFO L460 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-03-23 11:57:14,540 INFO L276 IsEmpty]: Start isEmpty. Operand 162 states and 176 transitions. [2018-03-23 11:57:14,540 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2018-03-23 11:57:14,541 INFO L345 BasicCegarLoop]: Found error trace [2018-03-23 11:57:14,541 INFO L353 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] [2018-03-23 11:57:14,541 INFO L408 AbstractCegarLoop]: === Iteration 15 === [mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr42EnsuresViolationMEMORY_LEAK, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr21RequiresViolation, mainErr31RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr39RequiresViolation, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr12RequiresViolation, mainErr40AssertViolationMEMORY_FREE, mainErr41AssertViolationMEMORY_FREE, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr9RequiresViolation, mainErr30RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr34RequiresViolation, mainErr4RequiresViolation, mainErr14RequiresViolation, mainErr37RequiresViolation]=== [2018-03-23 11:57:14,541 INFO L82 PathProgramCache]: Analyzing trace with hash -253991650, now seen corresponding path program 1 times [2018-03-23 11:57:14,541 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-03-23 11:57:14,541 INFO L68 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-03-23 11:57:14,542 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-03-23 11:57:14,542 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-03-23 11:57:14,542 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-03-23 11:57:14,549 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-03-23 11:57:14,550 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-03-23 11:57:14,583 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-03-23 11:57:14,583 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-03-23 11:57:14,583 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-03-23 11:57:14,584 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-03-23 11:57:14,584 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-03-23 11:57:14,584 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-03-23 11:57:14,584 INFO L87 Difference]: Start difference. First operand 162 states and 176 transitions. Second operand 5 states. [2018-03-23 11:57:14,795 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-03-23 11:57:14,795 INFO L93 Difference]: Finished difference Result 229 states and 246 transitions. [2018-03-23 11:57:14,795 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-03-23 11:57:14,795 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 38 [2018-03-23 11:57:14,795 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-03-23 11:57:14,796 INFO L225 Difference]: With dead ends: 229 [2018-03-23 11:57:14,796 INFO L226 Difference]: Without dead ends: 226 [2018-03-23 11:57:14,796 INFO L568 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2018-03-23 11:57:14,796 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 226 states. [2018-03-23 11:57:14,812 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 226 to 191. [2018-03-23 11:57:14,812 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 191 states. [2018-03-23 11:57:14,813 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 191 states to 191 states and 215 transitions. [2018-03-23 11:57:14,814 INFO L78 Accepts]: Start accepts. Automaton has 191 states and 215 transitions. Word has length 38 [2018-03-23 11:57:14,814 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-03-23 11:57:14,814 INFO L459 AbstractCegarLoop]: Abstraction has 191 states and 215 transitions. [2018-03-23 11:57:14,814 INFO L460 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-03-23 11:57:14,814 INFO L276 IsEmpty]: Start isEmpty. Operand 191 states and 215 transitions. [2018-03-23 11:57:14,815 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2018-03-23 11:57:14,815 INFO L345 BasicCegarLoop]: Found error trace [2018-03-23 11:57:14,815 INFO L353 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, 1] [2018-03-23 11:57:14,815 INFO L408 AbstractCegarLoop]: === Iteration 16 === [mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr42EnsuresViolationMEMORY_LEAK, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr21RequiresViolation, mainErr31RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr39RequiresViolation, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr12RequiresViolation, mainErr40AssertViolationMEMORY_FREE, mainErr41AssertViolationMEMORY_FREE, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr9RequiresViolation, mainErr30RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr34RequiresViolation, mainErr4RequiresViolation, mainErr14RequiresViolation, mainErr37RequiresViolation]=== [2018-03-23 11:57:14,815 INFO L82 PathProgramCache]: Analyzing trace with hash -271979520, now seen corresponding path program 1 times [2018-03-23 11:57:14,816 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-03-23 11:57:14,816 INFO L68 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-03-23 11:57:14,817 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-03-23 11:57:14,817 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-03-23 11:57:14,817 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-03-23 11:57:14,829 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-03-23 11:57:14,830 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-03-23 11:57:14,955 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-03-23 11:57:14,955 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-03-23 11:57:14,955 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2018-03-23 11:57:14,956 INFO L442 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-03-23 11:57:14,956 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-03-23 11:57:14,956 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2018-03-23 11:57:14,956 INFO L87 Difference]: Start difference. First operand 191 states and 215 transitions. Second operand 9 states. [2018-03-23 11:57:15,340 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-03-23 11:57:15,341 INFO L93 Difference]: Finished difference Result 314 states and 335 transitions. [2018-03-23 11:57:15,341 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2018-03-23 11:57:15,341 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 40 [2018-03-23 11:57:15,341 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-03-23 11:57:15,343 INFO L225 Difference]: With dead ends: 314 [2018-03-23 11:57:15,343 INFO L226 Difference]: Without dead ends: 263 [2018-03-23 11:57:15,344 INFO L568 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 53 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=108, Invalid=272, Unknown=0, NotChecked=0, Total=380 [2018-03-23 11:57:15,344 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 263 states. [2018-03-23 11:57:15,361 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 263 to 195. [2018-03-23 11:57:15,361 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 195 states. [2018-03-23 11:57:15,362 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 195 states to 195 states and 219 transitions. [2018-03-23 11:57:15,363 INFO L78 Accepts]: Start accepts. Automaton has 195 states and 219 transitions. Word has length 40 [2018-03-23 11:57:15,363 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-03-23 11:57:15,363 INFO L459 AbstractCegarLoop]: Abstraction has 195 states and 219 transitions. [2018-03-23 11:57:15,363 INFO L460 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-03-23 11:57:15,363 INFO L276 IsEmpty]: Start isEmpty. Operand 195 states and 219 transitions. [2018-03-23 11:57:15,364 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2018-03-23 11:57:15,364 INFO L345 BasicCegarLoop]: Found error trace [2018-03-23 11:57:15,364 INFO L353 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] [2018-03-23 11:57:15,364 INFO L408 AbstractCegarLoop]: === Iteration 17 === [mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr42EnsuresViolationMEMORY_LEAK, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr21RequiresViolation, mainErr31RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr39RequiresViolation, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr12RequiresViolation, mainErr40AssertViolationMEMORY_FREE, mainErr41AssertViolationMEMORY_FREE, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr9RequiresViolation, mainErr30RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr34RequiresViolation, mainErr4RequiresViolation, mainErr14RequiresViolation, mainErr37RequiresViolation]=== [2018-03-23 11:57:15,364 INFO L82 PathProgramCache]: Analyzing trace with hash 945859048, now seen corresponding path program 2 times [2018-03-23 11:57:15,365 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-03-23 11:57:15,365 INFO L68 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-03-23 11:57:15,366 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-03-23 11:57:15,366 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-03-23 11:57:15,366 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-03-23 11:57:15,378 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-03-23 11:57:15,379 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-03-23 11:57:15,606 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2018-03-23 11:57:15,607 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-03-23 11:57:15,607 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2018-03-23 11:57:15,607 INFO L442 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-03-23 11:57:15,607 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-03-23 11:57:15,607 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=82, Unknown=0, NotChecked=0, Total=110 [2018-03-23 11:57:15,608 INFO L87 Difference]: Start difference. First operand 195 states and 219 transitions. Second operand 11 states. [2018-03-23 11:57:16,102 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-03-23 11:57:16,102 INFO L93 Difference]: Finished difference Result 268 states and 286 transitions. [2018-03-23 11:57:16,102 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2018-03-23 11:57:16,102 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 40 [2018-03-23 11:57:16,102 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-03-23 11:57:16,103 INFO L225 Difference]: With dead ends: 268 [2018-03-23 11:57:16,103 INFO L226 Difference]: Without dead ends: 208 [2018-03-23 11:57:16,104 INFO L568 BasicCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 65 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=145, Invalid=317, Unknown=0, NotChecked=0, Total=462 [2018-03-23 11:57:16,104 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 208 states. [2018-03-23 11:57:16,123 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 208 to 173. [2018-03-23 11:57:16,123 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 173 states. [2018-03-23 11:57:16,125 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 173 states to 173 states and 190 transitions. [2018-03-23 11:57:16,125 INFO L78 Accepts]: Start accepts. Automaton has 173 states and 190 transitions. Word has length 40 [2018-03-23 11:57:16,125 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-03-23 11:57:16,126 INFO L459 AbstractCegarLoop]: Abstraction has 173 states and 190 transitions. [2018-03-23 11:57:16,126 INFO L460 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-03-23 11:57:16,126 INFO L276 IsEmpty]: Start isEmpty. Operand 173 states and 190 transitions. [2018-03-23 11:57:16,126 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2018-03-23 11:57:16,127 INFO L345 BasicCegarLoop]: Found error trace [2018-03-23 11:57:16,127 INFO L353 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] [2018-03-23 11:57:16,127 INFO L408 AbstractCegarLoop]: === Iteration 18 === [mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr42EnsuresViolationMEMORY_LEAK, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr21RequiresViolation, mainErr31RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr39RequiresViolation, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr12RequiresViolation, mainErr40AssertViolationMEMORY_FREE, mainErr41AssertViolationMEMORY_FREE, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr9RequiresViolation, mainErr30RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr34RequiresViolation, mainErr4RequiresViolation, mainErr14RequiresViolation, mainErr37RequiresViolation]=== [2018-03-23 11:57:16,127 INFO L82 PathProgramCache]: Analyzing trace with hash 1094249737, now seen corresponding path program 1 times [2018-03-23 11:57:16,127 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-03-23 11:57:16,128 INFO L68 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-03-23 11:57:16,129 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-03-23 11:57:16,129 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-03-23 11:57:16,129 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-03-23 11:57:16,141 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-03-23 11:57:16,142 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-03-23 11:57:16,327 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-03-23 11:57:16,327 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-03-23 11:57:16,327 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2018-03-23 11:57:16,328 INFO L442 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-03-23 11:57:16,328 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-03-23 11:57:16,328 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=85, Unknown=0, NotChecked=0, Total=110 [2018-03-23 11:57:16,328 INFO L87 Difference]: Start difference. First operand 173 states and 190 transitions. Second operand 11 states. [2018-03-23 11:57:16,758 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-03-23 11:57:16,759 INFO L93 Difference]: Finished difference Result 259 states and 278 transitions. [2018-03-23 11:57:16,759 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2018-03-23 11:57:16,759 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 41 [2018-03-23 11:57:16,759 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-03-23 11:57:16,760 INFO L225 Difference]: With dead ends: 259 [2018-03-23 11:57:16,760 INFO L226 Difference]: Without dead ends: 225 [2018-03-23 11:57:16,760 INFO L568 BasicCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 61 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=88, Invalid=292, Unknown=0, NotChecked=0, Total=380 [2018-03-23 11:57:16,761 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 225 states. [2018-03-23 11:57:16,776 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 225 to 190. [2018-03-23 11:57:16,776 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 190 states. [2018-03-23 11:57:16,777 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 190 states to 190 states and 207 transitions. [2018-03-23 11:57:16,777 INFO L78 Accepts]: Start accepts. Automaton has 190 states and 207 transitions. Word has length 41 [2018-03-23 11:57:16,777 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-03-23 11:57:16,778 INFO L459 AbstractCegarLoop]: Abstraction has 190 states and 207 transitions. [2018-03-23 11:57:16,778 INFO L460 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-03-23 11:57:16,778 INFO L276 IsEmpty]: Start isEmpty. Operand 190 states and 207 transitions. [2018-03-23 11:57:16,778 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2018-03-23 11:57:16,779 INFO L345 BasicCegarLoop]: Found error trace [2018-03-23 11:57:16,779 INFO L353 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] [2018-03-23 11:57:16,779 INFO L408 AbstractCegarLoop]: === Iteration 19 === [mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr42EnsuresViolationMEMORY_LEAK, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr21RequiresViolation, mainErr31RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr39RequiresViolation, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr12RequiresViolation, mainErr40AssertViolationMEMORY_FREE, mainErr41AssertViolationMEMORY_FREE, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr9RequiresViolation, mainErr30RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr34RequiresViolation, mainErr4RequiresViolation, mainErr14RequiresViolation, mainErr37RequiresViolation]=== [2018-03-23 11:57:16,779 INFO L82 PathProgramCache]: Analyzing trace with hash -1844261651, now seen corresponding path program 1 times [2018-03-23 11:57:16,779 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-03-23 11:57:16,779 INFO L68 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-03-23 11:57:16,780 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-03-23 11:57:16,780 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-03-23 11:57:16,781 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-03-23 11:57:16,792 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-03-23 11:57:16,793 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-03-23 11:57:16,985 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-03-23 11:57:16,985 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-03-23 11:57:16,985 INFO L213 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-03-23 11:57:16,993 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-03-23 11:57:17,010 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-03-23 11:57:17,013 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-03-23 11:57:17,019 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 8 [2018-03-23 11:57:17,021 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-03-23 11:57:17,021 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-03-23 11:57:17,023 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-03-23 11:57:17,030 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 8 [2018-03-23 11:57:17,031 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-03-23 11:57:17,031 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-03-23 11:57:17,033 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-03-23 11:57:17,036 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-03-23 11:57:17,037 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 2 variables, input treesize:28, output treesize:20 [2018-03-23 11:57:17,052 INFO L700 Elim1Store]: detected not equals via solver [2018-03-23 11:57:17,052 INFO L700 Elim1Store]: detected not equals via solver [2018-03-23 11:57:17,053 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 4 [2018-03-23 11:57:17,053 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-03-23 11:57:17,111 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-03-23 11:57:17,112 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:25, output treesize:19 [2018-03-23 11:57:17,137 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 20 [2018-03-23 11:57:17,145 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-03-23 11:57:17,146 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-03-23 11:57:17,150 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-03-23 11:57:17,165 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 20 [2018-03-23 11:57:17,167 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-03-23 11:57:17,167 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-03-23 11:57:17,171 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-03-23 11:57:17,178 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-03-23 11:57:17,178 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 4 variables, input treesize:41, output treesize:39 [2018-03-23 11:57:17,366 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 69 treesize of output 56 [2018-03-23 11:57:17,371 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 33 treesize of output 27 [2018-03-23 11:57:17,372 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-03-23 11:57:17,406 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 3 [2018-03-23 11:57:17,406 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-03-23 11:57:17,412 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-03-23 11:57:17,419 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 19 [2018-03-23 11:57:17,421 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 15 treesize of output 11 [2018-03-23 11:57:17,421 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-03-23 11:57:17,427 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 3 [2018-03-23 11:57:17,427 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2018-03-23 11:57:17,428 INFO L267 ElimStorePlain]: Start of recursive call 5: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-03-23 11:57:17,432 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-03-23 11:57:17,432 INFO L202 ElimStorePlain]: Needed 7 recursive calls to eliminate 4 variables, input treesize:69, output treesize:7 [2018-03-23 11:57:17,459 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-03-23 11:57:17,481 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-03-23 11:57:17,481 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11] total 15 [2018-03-23 11:57:17,481 INFO L442 AbstractCegarLoop]: Interpolant automaton has 15 states [2018-03-23 11:57:17,481 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2018-03-23 11:57:17,481 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=170, Unknown=9, NotChecked=0, Total=210 [2018-03-23 11:57:17,481 INFO L87 Difference]: Start difference. First operand 190 states and 207 transitions. Second operand 15 states. [2018-03-23 11:57:18,047 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-03-23 11:57:18,047 INFO L93 Difference]: Finished difference Result 274 states and 294 transitions. [2018-03-23 11:57:18,047 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2018-03-23 11:57:18,047 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 42 [2018-03-23 11:57:18,048 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-03-23 11:57:18,048 INFO L225 Difference]: With dead ends: 274 [2018-03-23 11:57:18,049 INFO L226 Difference]: Without dead ends: 240 [2018-03-23 11:57:18,049 INFO L568 BasicCegarLoop]: 0 DeclaredPredicates, 66 GetRequests, 36 SyntacticMatches, 5 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 104 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=114, Invalid=577, Unknown=11, NotChecked=0, Total=702 [2018-03-23 11:57:18,050 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 240 states. [2018-03-23 11:57:18,069 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 240 to 214. [2018-03-23 11:57:18,069 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 214 states. [2018-03-23 11:57:18,070 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 214 states to 214 states and 232 transitions. [2018-03-23 11:57:18,071 INFO L78 Accepts]: Start accepts. Automaton has 214 states and 232 transitions. Word has length 42 [2018-03-23 11:57:18,071 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-03-23 11:57:18,071 INFO L459 AbstractCegarLoop]: Abstraction has 214 states and 232 transitions. [2018-03-23 11:57:18,071 INFO L460 AbstractCegarLoop]: Interpolant automaton has 15 states. [2018-03-23 11:57:18,071 INFO L276 IsEmpty]: Start isEmpty. Operand 214 states and 232 transitions. [2018-03-23 11:57:18,072 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2018-03-23 11:57:18,072 INFO L345 BasicCegarLoop]: Found error trace [2018-03-23 11:57:18,072 INFO L353 BasicCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-03-23 11:57:18,072 INFO L408 AbstractCegarLoop]: === Iteration 20 === [mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr42EnsuresViolationMEMORY_LEAK, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr21RequiresViolation, mainErr31RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr39RequiresViolation, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr12RequiresViolation, mainErr40AssertViolationMEMORY_FREE, mainErr41AssertViolationMEMORY_FREE, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr9RequiresViolation, mainErr30RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr34RequiresViolation, mainErr4RequiresViolation, mainErr14RequiresViolation, mainErr37RequiresViolation]=== [2018-03-23 11:57:18,072 INFO L82 PathProgramCache]: Analyzing trace with hash 1810311554, now seen corresponding path program 1 times [2018-03-23 11:57:18,073 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-03-23 11:57:18,073 INFO L68 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-03-23 11:57:18,074 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-03-23 11:57:18,074 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-03-23 11:57:18,074 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-03-23 11:57:18,085 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-03-23 11:57:18,086 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-03-23 11:57:18,213 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-03-23 11:57:18,213 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-03-23 11:57:18,213 INFO L213 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-03-23 11:57:18,219 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-03-23 11:57:18,235 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-03-23 11:57:18,238 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-03-23 11:57:18,259 INFO L700 Elim1Store]: detected not equals via solver [2018-03-23 11:57:18,260 INFO L700 Elim1Store]: detected not equals via solver [2018-03-23 11:57:18,261 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-03-23 11:57:18,261 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-03-23 11:57:18,271 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-03-23 11:57:18,271 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:23, output treesize:21 [2018-03-23 11:57:18,295 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 8 [2018-03-23 11:57:18,297 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-03-23 11:57:18,298 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-03-23 11:57:18,300 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-03-23 11:57:18,311 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-03-23 11:57:18,311 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:32, output treesize:29 [2018-03-23 11:57:18,368 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 37 treesize of output 33 [2018-03-23 11:57:18,371 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 11 [2018-03-23 11:57:18,371 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-03-23 11:57:18,375 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-03-23 11:57:18,380 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-03-23 11:57:18,380 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:42, output treesize:34 [2018-03-23 11:57:18,439 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 24 [2018-03-23 11:57:18,441 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 10 [2018-03-23 11:57:18,441 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-03-23 11:57:18,447 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 1 [2018-03-23 11:57:18,447 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-03-23 11:57:18,451 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-03-23 11:57:18,455 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-03-23 11:57:18,455 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 4 variables, input treesize:41, output treesize:15 [2018-03-23 11:57:18,510 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-03-23 11:57:18,533 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-03-23 11:57:18,533 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 11] total 20 [2018-03-23 11:57:18,533 INFO L442 AbstractCegarLoop]: Interpolant automaton has 21 states [2018-03-23 11:57:18,533 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2018-03-23 11:57:18,533 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=72, Invalid=348, Unknown=0, NotChecked=0, Total=420 [2018-03-23 11:57:18,533 INFO L87 Difference]: Start difference. First operand 214 states and 232 transitions. Second operand 21 states. [2018-03-23 11:57:19,313 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-03-23 11:57:19,313 INFO L93 Difference]: Finished difference Result 317 states and 337 transitions. [2018-03-23 11:57:19,313 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2018-03-23 11:57:19,313 INFO L78 Accepts]: Start accepts. Automaton has 21 states. Word has length 42 [2018-03-23 11:57:19,313 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-03-23 11:57:19,317 INFO L225 Difference]: With dead ends: 317 [2018-03-23 11:57:19,317 INFO L226 Difference]: Without dead ends: 316 [2018-03-23 11:57:19,317 INFO L568 BasicCegarLoop]: 0 DeclaredPredicates, 72 GetRequests, 34 SyntacticMatches, 2 SemanticMatches, 36 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 311 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=313, Invalid=1093, Unknown=0, NotChecked=0, Total=1406 [2018-03-23 11:57:19,318 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 316 states. [2018-03-23 11:57:19,333 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 316 to 242. [2018-03-23 11:57:19,333 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 242 states. [2018-03-23 11:57:19,334 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 242 states to 242 states and 265 transitions. [2018-03-23 11:57:19,334 INFO L78 Accepts]: Start accepts. Automaton has 242 states and 265 transitions. Word has length 42 [2018-03-23 11:57:19,334 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-03-23 11:57:19,334 INFO L459 AbstractCegarLoop]: Abstraction has 242 states and 265 transitions. [2018-03-23 11:57:19,334 INFO L460 AbstractCegarLoop]: Interpolant automaton has 21 states. [2018-03-23 11:57:19,334 INFO L276 IsEmpty]: Start isEmpty. Operand 242 states and 265 transitions. [2018-03-23 11:57:19,335 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2018-03-23 11:57:19,335 INFO L345 BasicCegarLoop]: Found error trace [2018-03-23 11:57:19,335 INFO L353 BasicCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-03-23 11:57:19,335 INFO L408 AbstractCegarLoop]: === Iteration 21 === [mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr42EnsuresViolationMEMORY_LEAK, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr21RequiresViolation, mainErr31RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr39RequiresViolation, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr12RequiresViolation, mainErr40AssertViolationMEMORY_FREE, mainErr41AssertViolationMEMORY_FREE, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr9RequiresViolation, mainErr30RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr34RequiresViolation, mainErr4RequiresViolation, mainErr14RequiresViolation, mainErr37RequiresViolation]=== [2018-03-23 11:57:19,335 INFO L82 PathProgramCache]: Analyzing trace with hash 1810311555, now seen corresponding path program 1 times [2018-03-23 11:57:19,335 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-03-23 11:57:19,335 INFO L68 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-03-23 11:57:19,336 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-03-23 11:57:19,336 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-03-23 11:57:19,336 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-03-23 11:57:19,345 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-03-23 11:57:19,346 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-03-23 11:57:19,470 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-03-23 11:57:19,470 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-03-23 11:57:19,470 INFO L213 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-03-23 11:57:19,476 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-03-23 11:57:19,491 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-03-23 11:57:19,494 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-03-23 11:57:19,500 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-03-23 11:57:19,501 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-03-23 11:57:19,508 INFO L700 Elim1Store]: detected not equals via solver [2018-03-23 11:57:19,509 INFO L700 Elim1Store]: detected not equals via solver [2018-03-23 11:57:19,510 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 4 [2018-03-23 11:57:19,510 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-03-23 11:57:19,515 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-03-23 11:57:19,515 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:26, output treesize:19 [2018-03-23 11:57:19,522 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 8 [2018-03-23 11:57:19,525 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-03-23 11:57:19,525 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-03-23 11:57:19,527 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-03-23 11:57:19,536 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 8 [2018-03-23 11:57:19,539 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-03-23 11:57:19,540 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-03-23 11:57:19,541 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-03-23 11:57:19,547 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-03-23 11:57:19,547 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 3 variables, input treesize:38, output treesize:31 [2018-03-23 11:57:19,593 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 56 treesize of output 52 [2018-03-23 11:57:19,595 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 11 [2018-03-23 11:57:19,595 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-03-23 11:57:19,600 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-03-23 11:57:19,610 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 28 [2018-03-23 11:57:19,612 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 11 [2018-03-23 11:57:19,612 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-03-23 11:57:19,616 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-03-23 11:57:19,622 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-03-23 11:57:19,622 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 3 variables, input treesize:63, output treesize:47 [2018-03-23 11:57:19,675 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 47 treesize of output 33 [2018-03-23 11:57:19,677 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 1 [2018-03-23 11:57:19,677 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-03-23 11:57:19,684 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 17 [2018-03-23 11:57:19,684 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-03-23 11:57:19,688 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-03-23 11:57:19,696 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 20 [2018-03-23 11:57:19,698 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 1 [2018-03-23 11:57:19,698 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2018-03-23 11:57:19,703 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 3 [2018-03-23 11:57:19,703 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2018-03-23 11:57:19,704 INFO L267 ElimStorePlain]: Start of recursive call 5: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-03-23 11:57:19,707 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-03-23 11:57:19,707 INFO L202 ElimStorePlain]: Needed 7 recursive calls to eliminate 5 variables, input treesize:61, output treesize:9 [2018-03-23 11:57:19,727 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-03-23 11:57:19,748 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-03-23 11:57:19,748 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11] total 16 [2018-03-23 11:57:19,749 INFO L442 AbstractCegarLoop]: Interpolant automaton has 17 states [2018-03-23 11:57:19,749 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2018-03-23 11:57:19,749 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=44, Invalid=228, Unknown=0, NotChecked=0, Total=272 [2018-03-23 11:57:19,749 INFO L87 Difference]: Start difference. First operand 242 states and 265 transitions. Second operand 17 states. [2018-03-23 11:57:20,718 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-03-23 11:57:20,718 INFO L93 Difference]: Finished difference Result 328 states and 350 transitions. [2018-03-23 11:57:20,719 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2018-03-23 11:57:20,719 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 42 [2018-03-23 11:57:20,719 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-03-23 11:57:20,720 INFO L225 Difference]: With dead ends: 328 [2018-03-23 11:57:20,720 INFO L226 Difference]: Without dead ends: 322 [2018-03-23 11:57:20,720 INFO L568 BasicCegarLoop]: 0 DeclaredPredicates, 68 GetRequests, 34 SyntacticMatches, 5 SemanticMatches, 29 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 174 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=170, Invalid=760, Unknown=0, NotChecked=0, Total=930 [2018-03-23 11:57:20,721 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 322 states. [2018-03-23 11:57:20,735 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 322 to 255. [2018-03-23 11:57:20,735 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 255 states. [2018-03-23 11:57:20,736 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 255 states to 255 states and 279 transitions. [2018-03-23 11:57:20,736 INFO L78 Accepts]: Start accepts. Automaton has 255 states and 279 transitions. Word has length 42 [2018-03-23 11:57:20,736 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-03-23 11:57:20,736 INFO L459 AbstractCegarLoop]: Abstraction has 255 states and 279 transitions. [2018-03-23 11:57:20,736 INFO L460 AbstractCegarLoop]: Interpolant automaton has 17 states. [2018-03-23 11:57:20,736 INFO L276 IsEmpty]: Start isEmpty. Operand 255 states and 279 transitions. [2018-03-23 11:57:20,736 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2018-03-23 11:57:20,737 INFO L345 BasicCegarLoop]: Found error trace [2018-03-23 11:57:20,737 INFO L353 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] [2018-03-23 11:57:20,737 INFO L408 AbstractCegarLoop]: === Iteration 22 === [mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr42EnsuresViolationMEMORY_LEAK, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr21RequiresViolation, mainErr31RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr39RequiresViolation, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr12RequiresViolation, mainErr40AssertViolationMEMORY_FREE, mainErr41AssertViolationMEMORY_FREE, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr9RequiresViolation, mainErr30RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr34RequiresViolation, mainErr4RequiresViolation, mainErr14RequiresViolation, mainErr37RequiresViolation]=== [2018-03-23 11:57:20,737 INFO L82 PathProgramCache]: Analyzing trace with hash -260977194, now seen corresponding path program 1 times [2018-03-23 11:57:20,737 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-03-23 11:57:20,737 INFO L68 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-03-23 11:57:20,738 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-03-23 11:57:20,738 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-03-23 11:57:20,738 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-03-23 11:57:20,744 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-03-23 11:57:20,745 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-03-23 11:57:20,805 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-03-23 11:57:20,805 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-03-23 11:57:20,805 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-03-23 11:57:20,805 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-03-23 11:57:20,805 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-03-23 11:57:20,805 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-03-23 11:57:20,806 INFO L87 Difference]: Start difference. First operand 255 states and 279 transitions. Second operand 5 states. [2018-03-23 11:57:20,976 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-03-23 11:57:20,976 INFO L93 Difference]: Finished difference Result 279 states and 299 transitions. [2018-03-23 11:57:20,976 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-03-23 11:57:20,976 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 45 [2018-03-23 11:57:20,976 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-03-23 11:57:20,977 INFO L225 Difference]: With dead ends: 279 [2018-03-23 11:57:20,978 INFO L226 Difference]: Without dead ends: 276 [2018-03-23 11:57:20,978 INFO L568 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2018-03-23 11:57:20,979 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 276 states. [2018-03-23 11:57:20,999 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 276 to 242. [2018-03-23 11:57:20,999 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 242 states. [2018-03-23 11:57:21,000 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 242 states to 242 states and 261 transitions. [2018-03-23 11:57:21,000 INFO L78 Accepts]: Start accepts. Automaton has 242 states and 261 transitions. Word has length 45 [2018-03-23 11:57:21,001 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-03-23 11:57:21,001 INFO L459 AbstractCegarLoop]: Abstraction has 242 states and 261 transitions. [2018-03-23 11:57:21,001 INFO L460 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-03-23 11:57:21,001 INFO L276 IsEmpty]: Start isEmpty. Operand 242 states and 261 transitions. [2018-03-23 11:57:21,002 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2018-03-23 11:57:21,002 INFO L345 BasicCegarLoop]: Found error trace [2018-03-23 11:57:21,002 INFO L353 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, 1, 1, 1, 1, 1, 1, 1, 1] [2018-03-23 11:57:21,002 INFO L408 AbstractCegarLoop]: === Iteration 23 === [mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr42EnsuresViolationMEMORY_LEAK, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr21RequiresViolation, mainErr31RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr39RequiresViolation, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr12RequiresViolation, mainErr40AssertViolationMEMORY_FREE, mainErr41AssertViolationMEMORY_FREE, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr9RequiresViolation, mainErr30RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr34RequiresViolation, mainErr4RequiresViolation, mainErr14RequiresViolation, mainErr37RequiresViolation]=== [2018-03-23 11:57:21,002 INFO L82 PathProgramCache]: Analyzing trace with hash 1019841138, now seen corresponding path program 1 times [2018-03-23 11:57:21,002 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-03-23 11:57:21,003 INFO L68 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-03-23 11:57:21,003 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-03-23 11:57:21,004 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-03-23 11:57:21,004 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-03-23 11:57:21,012 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-03-23 11:57:21,013 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-03-23 11:57:21,093 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2018-03-23 11:57:21,094 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-03-23 11:57:21,094 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2018-03-23 11:57:21,094 INFO L442 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-03-23 11:57:21,094 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-03-23 11:57:21,094 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2018-03-23 11:57:21,094 INFO L87 Difference]: Start difference. First operand 242 states and 261 transitions. Second operand 8 states. [2018-03-23 11:57:21,330 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-03-23 11:57:21,330 INFO L93 Difference]: Finished difference Result 308 states and 328 transitions. [2018-03-23 11:57:21,331 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-03-23 11:57:21,331 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 47 [2018-03-23 11:57:21,331 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-03-23 11:57:21,332 INFO L225 Difference]: With dead ends: 308 [2018-03-23 11:57:21,332 INFO L226 Difference]: Without dead ends: 285 [2018-03-23 11:57:21,332 INFO L568 BasicCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 26 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=61, Invalid=179, Unknown=0, NotChecked=0, Total=240 [2018-03-23 11:57:21,333 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 285 states. [2018-03-23 11:57:21,345 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 285 to 242. [2018-03-23 11:57:21,345 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 242 states. [2018-03-23 11:57:21,345 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 242 states to 242 states and 259 transitions. [2018-03-23 11:57:21,345 INFO L78 Accepts]: Start accepts. Automaton has 242 states and 259 transitions. Word has length 47 [2018-03-23 11:57:21,346 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-03-23 11:57:21,346 INFO L459 AbstractCegarLoop]: Abstraction has 242 states and 259 transitions. [2018-03-23 11:57:21,346 INFO L460 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-03-23 11:57:21,346 INFO L276 IsEmpty]: Start isEmpty. Operand 242 states and 259 transitions. [2018-03-23 11:57:21,346 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2018-03-23 11:57:21,346 INFO L345 BasicCegarLoop]: Found error trace [2018-03-23 11:57:21,346 INFO L353 BasicCegarLoop]: trace histogram [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] [2018-03-23 11:57:21,346 INFO L408 AbstractCegarLoop]: === Iteration 24 === [mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr42EnsuresViolationMEMORY_LEAK, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr21RequiresViolation, mainErr31RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr39RequiresViolation, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr12RequiresViolation, mainErr40AssertViolationMEMORY_FREE, mainErr41AssertViolationMEMORY_FREE, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr9RequiresViolation, mainErr30RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr34RequiresViolation, mainErr4RequiresViolation, mainErr14RequiresViolation, mainErr37RequiresViolation]=== [2018-03-23 11:57:21,347 INFO L82 PathProgramCache]: Analyzing trace with hash 122704397, now seen corresponding path program 2 times [2018-03-23 11:57:21,347 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-03-23 11:57:21,347 INFO L68 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-03-23 11:57:21,348 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-03-23 11:57:21,348 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-03-23 11:57:21,348 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-03-23 11:57:21,356 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-03-23 11:57:21,357 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-03-23 11:57:21,512 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 11 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-03-23 11:57:21,512 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-03-23 11:57:21,512 INFO L213 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-03-23 11:57:21,518 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-03-23 11:57:21,539 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-03-23 11:57:21,539 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-03-23 11:57:21,542 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-03-23 11:57:21,610 INFO L700 Elim1Store]: detected not equals via solver [2018-03-23 11:57:21,611 INFO L700 Elim1Store]: detected not equals via solver [2018-03-23 11:57:21,611 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 4 [2018-03-23 11:57:21,612 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-03-23 11:57:21,617 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-03-23 11:57:21,618 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:23, output treesize:17 [2018-03-23 11:57:21,640 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 8 [2018-03-23 11:57:21,643 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-03-23 11:57:21,644 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-03-23 11:57:21,645 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-03-23 11:57:21,655 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 8 [2018-03-23 11:57:21,657 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-03-23 11:57:21,657 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-03-23 11:57:21,658 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-03-23 11:57:21,666 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-03-23 11:57:21,666 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 3 variables, input treesize:36, output treesize:25 [2018-03-23 11:57:21,742 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 55 treesize of output 51 [2018-03-23 11:57:21,744 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 15 [2018-03-23 11:57:21,744 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-03-23 11:57:21,749 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-03-23 11:57:21,759 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 46 treesize of output 47 [2018-03-23 11:57:21,761 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 15 [2018-03-23 11:57:21,761 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-03-23 11:57:21,766 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-03-23 11:57:21,773 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-03-23 11:57:21,773 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 2 variables, input treesize:65, output treesize:49 [2018-03-23 11:57:21,881 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 69 treesize of output 56 [2018-03-23 11:57:21,883 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 15 [2018-03-23 11:57:21,883 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-03-23 11:57:21,890 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 33 treesize of output 27 [2018-03-23 11:57:21,891 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-03-23 11:57:21,896 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-03-23 11:57:21,903 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 37 treesize of output 29 [2018-03-23 11:57:21,905 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2018-03-23 11:57:21,905 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2018-03-23 11:57:21,910 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 1 [2018-03-23 11:57:21,910 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2018-03-23 11:57:21,912 INFO L267 ElimStorePlain]: Start of recursive call 5: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-03-23 11:57:21,915 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-03-23 11:57:21,916 INFO L202 ElimStorePlain]: Needed 7 recursive calls to eliminate 3 variables, input treesize:76, output treesize:7 [2018-03-23 11:57:21,931 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 11 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-03-23 11:57:21,952 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-03-23 11:57:21,953 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 15] total 25 [2018-03-23 11:57:21,953 INFO L442 AbstractCegarLoop]: Interpolant automaton has 25 states [2018-03-23 11:57:21,953 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2018-03-23 11:57:21,953 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=67, Invalid=530, Unknown=3, NotChecked=0, Total=600 [2018-03-23 11:57:21,953 INFO L87 Difference]: Start difference. First operand 242 states and 259 transitions. Second operand 25 states. [2018-03-23 11:57:23,060 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-03-23 11:57:23,060 INFO L93 Difference]: Finished difference Result 388 states and 411 transitions. [2018-03-23 11:57:23,060 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2018-03-23 11:57:23,060 INFO L78 Accepts]: Start accepts. Automaton has 25 states. Word has length 52 [2018-03-23 11:57:23,060 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-03-23 11:57:23,061 INFO L225 Difference]: With dead ends: 388 [2018-03-23 11:57:23,061 INFO L226 Difference]: Without dead ends: 292 [2018-03-23 11:57:23,062 INFO L568 BasicCegarLoop]: 0 DeclaredPredicates, 87 GetRequests, 42 SyntacticMatches, 3 SemanticMatches, 42 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 325 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=327, Invalid=1561, Unknown=4, NotChecked=0, Total=1892 [2018-03-23 11:57:23,062 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 292 states. [2018-03-23 11:57:23,083 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 292 to 238. [2018-03-23 11:57:23,083 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 238 states. [2018-03-23 11:57:23,084 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 238 states to 238 states and 253 transitions. [2018-03-23 11:57:23,084 INFO L78 Accepts]: Start accepts. Automaton has 238 states and 253 transitions. Word has length 52 [2018-03-23 11:57:23,084 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-03-23 11:57:23,084 INFO L459 AbstractCegarLoop]: Abstraction has 238 states and 253 transitions. [2018-03-23 11:57:23,085 INFO L460 AbstractCegarLoop]: Interpolant automaton has 25 states. [2018-03-23 11:57:23,085 INFO L276 IsEmpty]: Start isEmpty. Operand 238 states and 253 transitions. [2018-03-23 11:57:23,085 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2018-03-23 11:57:23,086 INFO L345 BasicCegarLoop]: Found error trace [2018-03-23 11:57:23,086 INFO L353 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] [2018-03-23 11:57:23,086 INFO L408 AbstractCegarLoop]: === Iteration 25 === [mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr42EnsuresViolationMEMORY_LEAK, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr21RequiresViolation, mainErr31RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr39RequiresViolation, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr12RequiresViolation, mainErr40AssertViolationMEMORY_FREE, mainErr41AssertViolationMEMORY_FREE, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr9RequiresViolation, mainErr30RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr34RequiresViolation, mainErr4RequiresViolation, mainErr14RequiresViolation, mainErr37RequiresViolation]=== [2018-03-23 11:57:23,086 INFO L82 PathProgramCache]: Analyzing trace with hash 261074120, now seen corresponding path program 1 times [2018-03-23 11:57:23,086 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-03-23 11:57:23,086 INFO L68 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-03-23 11:57:23,087 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-03-23 11:57:23,088 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-03-23 11:57:23,088 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-03-23 11:57:23,101 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-03-23 11:57:23,102 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-03-23 11:57:23,343 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-03-23 11:57:23,343 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-03-23 11:57:23,343 INFO L213 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-03-23 11:57:23,351 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-03-23 11:57:23,372 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-03-23 11:57:23,376 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-03-23 11:57:23,394 INFO L700 Elim1Store]: detected not equals via solver [2018-03-23 11:57:23,395 INFO L700 Elim1Store]: detected not equals via solver [2018-03-23 11:57:23,396 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-03-23 11:57:23,396 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-03-23 11:57:23,408 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-03-23 11:57:23,409 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:23, output treesize:21 [2018-03-23 11:57:23,435 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 8 [2018-03-23 11:57:23,437 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-03-23 11:57:23,438 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-03-23 11:57:23,439 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-03-23 11:57:23,447 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-03-23 11:57:23,447 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:32, output treesize:29 [2018-03-23 11:57:23,504 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 37 treesize of output 33 [2018-03-23 11:57:23,507 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 11 [2018-03-23 11:57:23,507 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-03-23 11:57:23,512 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-03-23 11:57:23,518 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-03-23 11:57:23,518 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:42, output treesize:34 [2018-03-23 11:57:23,553 INFO L700 Elim1Store]: detected not equals via solver [2018-03-23 11:57:23,554 INFO L700 Elim1Store]: detected not equals via solver [2018-03-23 11:57:23,555 INFO L700 Elim1Store]: detected not equals via solver [2018-03-23 11:57:23,556 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 46 [2018-03-23 11:57:23,556 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-03-23 11:57:23,566 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-03-23 11:57:23,567 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:45, output treesize:51 [2018-03-23 11:57:23,632 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 48 treesize of output 52 [2018-03-23 11:57:23,635 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-03-23 11:57:23,635 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-03-23 11:57:23,642 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-03-23 11:57:23,656 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 8 [2018-03-23 11:57:23,658 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-03-23 11:57:23,658 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-03-23 11:57:23,660 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-03-23 11:57:23,671 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 2 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-03-23 11:57:23,671 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 5 variables, input treesize:73, output treesize:95 [2018-03-23 11:57:23,740 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 80 treesize of output 70 [2018-03-23 11:57:23,743 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 70 treesize of output 57 [2018-03-23 11:57:23,743 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-03-23 11:57:23,749 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-03-23 11:57:23,760 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-2 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2018-03-23 11:57:23,760 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:109, output treesize:86 [2018-03-23 11:57:23,836 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 85 treesize of output 50 [2018-03-23 11:57:23,838 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 16 [2018-03-23 11:57:23,839 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-03-23 11:57:23,848 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 1 [2018-03-23 11:57:23,848 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-03-23 11:57:23,856 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 14 [2018-03-23 11:57:23,856 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-03-23 11:57:23,862 INFO L267 ElimStorePlain]: Start of recursive call 2: 3 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-03-23 11:57:23,868 INFO L267 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2018-03-23 11:57:23,869 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 5 variables, input treesize:90, output treesize:28 [2018-03-23 11:57:23,937 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-03-23 11:57:23,957 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-03-23 11:57:23,958 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 16] total 29 [2018-03-23 11:57:23,958 INFO L442 AbstractCegarLoop]: Interpolant automaton has 30 states [2018-03-23 11:57:23,958 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 30 interpolants. [2018-03-23 11:57:23,958 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=112, Invalid=758, Unknown=0, NotChecked=0, Total=870 [2018-03-23 11:57:23,958 INFO L87 Difference]: Start difference. First operand 238 states and 253 transitions. Second operand 30 states. [2018-03-23 11:57:25,387 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-03-23 11:57:25,387 INFO L93 Difference]: Finished difference Result 366 states and 385 transitions. [2018-03-23 11:57:25,387 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 39 states. [2018-03-23 11:57:25,387 INFO L78 Accepts]: Start accepts. Automaton has 30 states. Word has length 53 [2018-03-23 11:57:25,387 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-03-23 11:57:25,388 INFO L225 Difference]: With dead ends: 366 [2018-03-23 11:57:25,389 INFO L226 Difference]: Without dead ends: 365 [2018-03-23 11:57:25,389 INFO L568 BasicCegarLoop]: 0 DeclaredPredicates, 99 GetRequests, 41 SyntacticMatches, 3 SemanticMatches, 55 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 833 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=495, Invalid=2697, Unknown=0, NotChecked=0, Total=3192 [2018-03-23 11:57:25,390 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 365 states. [2018-03-23 11:57:25,414 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 365 to 263. [2018-03-23 11:57:25,414 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 263 states. [2018-03-23 11:57:25,415 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 263 states to 263 states and 280 transitions. [2018-03-23 11:57:25,415 INFO L78 Accepts]: Start accepts. Automaton has 263 states and 280 transitions. Word has length 53 [2018-03-23 11:57:25,415 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-03-23 11:57:25,415 INFO L459 AbstractCegarLoop]: Abstraction has 263 states and 280 transitions. [2018-03-23 11:57:25,415 INFO L460 AbstractCegarLoop]: Interpolant automaton has 30 states. [2018-03-23 11:57:25,415 INFO L276 IsEmpty]: Start isEmpty. Operand 263 states and 280 transitions. [2018-03-23 11:57:25,416 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2018-03-23 11:57:25,416 INFO L345 BasicCegarLoop]: Found error trace [2018-03-23 11:57:25,416 INFO L353 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] [2018-03-23 11:57:25,416 INFO L408 AbstractCegarLoop]: === Iteration 26 === [mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr42EnsuresViolationMEMORY_LEAK, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr21RequiresViolation, mainErr31RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr39RequiresViolation, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr12RequiresViolation, mainErr40AssertViolationMEMORY_FREE, mainErr41AssertViolationMEMORY_FREE, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr9RequiresViolation, mainErr30RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr34RequiresViolation, mainErr4RequiresViolation, mainErr14RequiresViolation, mainErr37RequiresViolation]=== [2018-03-23 11:57:25,416 INFO L82 PathProgramCache]: Analyzing trace with hash 261074121, now seen corresponding path program 1 times [2018-03-23 11:57:25,416 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-03-23 11:57:25,416 INFO L68 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-03-23 11:57:25,417 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-03-23 11:57:25,417 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-03-23 11:57:25,417 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-03-23 11:57:25,430 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-03-23 11:57:25,431 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-03-23 11:57:25,880 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-03-23 11:57:25,880 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-03-23 11:57:25,880 INFO L213 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-03-23 11:57:25,888 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-03-23 11:57:25,908 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-03-23 11:57:25,912 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-03-23 11:57:25,919 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-03-23 11:57:25,919 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-03-23 11:57:25,930 INFO L700 Elim1Store]: detected not equals via solver [2018-03-23 11:57:25,931 INFO L700 Elim1Store]: detected not equals via solver [2018-03-23 11:57:25,931 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-03-23 11:57:25,932 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-03-23 11:57:25,941 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-03-23 11:57:25,941 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:32, output treesize:29 [2018-03-23 11:57:25,969 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 8 [2018-03-23 11:57:25,971 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-03-23 11:57:25,971 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-03-23 11:57:25,973 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-03-23 11:57:25,985 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 8 [2018-03-23 11:57:25,987 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-03-23 11:57:25,987 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-03-23 11:57:25,989 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-03-23 11:57:25,999 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-03-23 11:57:25,999 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 3 variables, input treesize:48, output treesize:45 [2018-03-23 11:57:26,077 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 28 [2018-03-23 11:57:26,080 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 11 [2018-03-23 11:57:26,080 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-03-23 11:57:26,086 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-03-23 11:57:26,107 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 57 treesize of output 53 [2018-03-23 11:57:26,110 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 11 [2018-03-23 11:57:26,111 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-03-23 11:57:26,121 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-03-23 11:57:26,134 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-03-23 11:57:26,135 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 3 variables, input treesize:77, output treesize:61 [2018-03-23 11:57:26,211 INFO L700 Elim1Store]: detected not equals via solver [2018-03-23 11:57:26,212 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 23 [2018-03-23 11:57:26,213 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-03-23 11:57:26,244 INFO L700 Elim1Store]: detected not equals via solver [2018-03-23 11:57:26,246 INFO L700 Elim1Store]: detected not equals via solver [2018-03-23 11:57:26,247 INFO L700 Elim1Store]: detected not equals via solver [2018-03-23 11:57:26,248 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 21 [2018-03-23 11:57:26,249 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-03-23 11:57:26,268 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-03-23 11:57:26,269 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:72, output treesize:64 [2018-03-23 11:57:26,452 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 47 [2018-03-23 11:57:26,455 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-03-23 11:57:26,455 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-03-23 11:57:26,466 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-03-23 11:57:26,519 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 59 treesize of output 63 [2018-03-23 11:57:26,523 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-03-23 11:57:26,523 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-03-23 11:57:26,533 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-03-23 11:57:26,547 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 2 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-03-23 11:57:26,548 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 5 variables, input treesize:86, output treesize:120 [2018-03-23 11:57:26,746 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 145 treesize of output 98 [2018-03-23 11:57:26,762 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 45 treesize of output 37 [2018-03-23 11:57:26,762 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-03-23 11:57:26,792 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 1 [2018-03-23 11:57:26,792 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-03-23 11:57:26,804 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 54 treesize of output 21 [2018-03-23 11:57:26,805 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-03-23 11:57:26,814 INFO L267 ElimStorePlain]: Start of recursive call 2: 3 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-03-23 11:57:26,829 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 32 [2018-03-23 11:57:26,832 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 3 [2018-03-23 11:57:26,832 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2018-03-23 11:57:26,842 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 1 [2018-03-23 11:57:26,842 INFO L267 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 1 xjuncts. [2018-03-23 11:57:26,843 INFO L267 ElimStorePlain]: Start of recursive call 6: 3 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-03-23 11:57:26,860 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 2 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-03-23 11:57:26,861 INFO L202 ElimStorePlain]: Needed 8 recursive calls to eliminate 5 variables, input treesize:150, output treesize:18 [2018-03-23 11:57:27,030 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-03-23 11:57:27,052 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-03-23 11:57:27,053 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 16] total 29 [2018-03-23 11:57:27,053 INFO L442 AbstractCegarLoop]: Interpolant automaton has 30 states [2018-03-23 11:57:27,053 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 30 interpolants. [2018-03-23 11:57:27,053 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=90, Invalid=780, Unknown=0, NotChecked=0, Total=870 [2018-03-23 11:57:27,053 INFO L87 Difference]: Start difference. First operand 263 states and 280 transitions. Second operand 30 states. [2018-03-23 11:57:28,593 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-03-23 11:57:28,593 INFO L93 Difference]: Finished difference Result 343 states and 361 transitions. [2018-03-23 11:57:28,593 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2018-03-23 11:57:28,593 INFO L78 Accepts]: Start accepts. Automaton has 30 states. Word has length 53 [2018-03-23 11:57:28,594 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-03-23 11:57:28,595 INFO L225 Difference]: With dead ends: 343 [2018-03-23 11:57:28,595 INFO L226 Difference]: Without dead ends: 341 [2018-03-23 11:57:28,596 INFO L568 BasicCegarLoop]: 0 DeclaredPredicates, 88 GetRequests, 41 SyntacticMatches, 4 SemanticMatches, 43 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 532 ImplicationChecksByTransitivity, 1.4s TimeCoverageRelationStatistics Valid=225, Invalid=1755, Unknown=0, NotChecked=0, Total=1980 [2018-03-23 11:57:28,596 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 341 states. [2018-03-23 11:57:28,615 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 341 to 262. [2018-03-23 11:57:28,616 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 262 states. [2018-03-23 11:57:28,616 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 262 states to 262 states and 278 transitions. [2018-03-23 11:57:28,617 INFO L78 Accepts]: Start accepts. Automaton has 262 states and 278 transitions. Word has length 53 [2018-03-23 11:57:28,617 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-03-23 11:57:28,617 INFO L459 AbstractCegarLoop]: Abstraction has 262 states and 278 transitions. [2018-03-23 11:57:28,617 INFO L460 AbstractCegarLoop]: Interpolant automaton has 30 states. [2018-03-23 11:57:28,617 INFO L276 IsEmpty]: Start isEmpty. Operand 262 states and 278 transitions. [2018-03-23 11:57:28,618 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2018-03-23 11:57:28,618 INFO L345 BasicCegarLoop]: Found error trace [2018-03-23 11:57:28,618 INFO L353 BasicCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-03-23 11:57:28,619 INFO L408 AbstractCegarLoop]: === Iteration 27 === [mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr42EnsuresViolationMEMORY_LEAK, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr21RequiresViolation, mainErr31RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr39RequiresViolation, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr12RequiresViolation, mainErr40AssertViolationMEMORY_FREE, mainErr41AssertViolationMEMORY_FREE, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr9RequiresViolation, mainErr30RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr34RequiresViolation, mainErr4RequiresViolation, mainErr14RequiresViolation, mainErr37RequiresViolation]=== [2018-03-23 11:57:28,619 INFO L82 PathProgramCache]: Analyzing trace with hash -379319971, now seen corresponding path program 3 times [2018-03-23 11:57:28,619 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-03-23 11:57:28,619 INFO L68 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-03-23 11:57:28,620 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-03-23 11:57:28,620 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-03-23 11:57:28,620 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-03-23 11:57:28,630 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-03-23 11:57:28,631 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-03-23 11:57:28,813 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 0 proven. 19 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-03-23 11:57:28,814 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-03-23 11:57:28,814 INFO L213 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 10 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 10 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-03-23 11:57:28,820 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-03-23 11:57:28,843 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2018-03-23 11:57:28,843 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-03-23 11:57:28,846 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-03-23 11:57:28,900 INFO L700 Elim1Store]: detected not equals via solver [2018-03-23 11:57:28,901 INFO L700 Elim1Store]: detected not equals via solver [2018-03-23 11:57:28,901 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 4 [2018-03-23 11:57:28,901 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-03-23 11:57:28,906 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-03-23 11:57:28,906 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:20, output treesize:14 [2018-03-23 11:57:28,936 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 8 [2018-03-23 11:57:28,937 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-03-23 11:57:28,937 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-03-23 11:57:28,939 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-03-23 11:57:28,945 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-03-23 11:57:28,946 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:30, output treesize:23 [2018-03-23 11:57:29,004 INFO L700 Elim1Store]: detected not equals via solver [2018-03-23 11:57:29,007 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 28 [2018-03-23 11:57:29,009 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-03-23 11:57:29,009 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-03-23 11:57:29,013 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-03-23 11:57:29,019 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-03-23 11:57:29,019 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:35, output treesize:27 [2018-03-23 11:57:29,042 INFO L700 Elim1Store]: detected not equals via solver [2018-03-23 11:57:29,043 INFO L700 Elim1Store]: detected not equals via solver [2018-03-23 11:57:29,043 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 4 [2018-03-23 11:57:29,043 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-03-23 11:57:29,049 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-03-23 11:57:29,049 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:32, output treesize:26 [2018-03-23 11:57:29,074 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 25 [2018-03-23 11:57:29,076 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 7 [2018-03-23 11:57:29,077 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-03-23 11:57:29,080 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-03-23 11:57:29,088 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-03-23 11:57:29,089 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:42, output treesize:28 [2018-03-23 11:57:29,177 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 4 new quantified variables, introduced 3 case distinctions, treesize of input 57 treesize of output 61 [2018-03-23 11:57:29,186 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 2 case distinctions, treesize of input 45 treesize of output 48 [2018-03-23 11:57:29,187 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 2 xjuncts. [2018-03-23 11:57:29,212 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 46 treesize of output 45 [2018-03-23 11:57:29,212 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-03-23 11:57:29,227 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-03-23 11:57:29,241 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-03-23 11:57:29,241 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 3 variables, input treesize:60, output treesize:81 [2018-03-23 11:57:29,389 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 24 [2018-03-23 11:57:29,400 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 1 [2018-03-23 11:57:29,400 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-03-23 11:57:29,421 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 10 [2018-03-23 11:57:29,421 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-03-23 11:57:29,437 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-03-23 11:57:29,527 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 4 new quantified variables, introduced 1 case distinctions, treesize of input 52 treesize of output 43 [2018-03-23 11:57:29,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, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 30 treesize of output 31 [2018-03-23 11:57:29,542 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 2 xjuncts. [2018-03-23 11:57:29,565 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 36 treesize of output 27 [2018-03-23 11:57:29,566 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2018-03-23 11:57:29,587 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 14 [2018-03-23 11:57:29,588 INFO L267 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 1 xjuncts. [2018-03-23 11:57:29,590 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 14 [2018-03-23 11:57:29,590 INFO L267 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 1 xjuncts. [2018-03-23 11:57:29,616 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 22 [2018-03-23 11:57:29,616 INFO L267 ElimStorePlain]: Start of recursive call 10: End of recursive call: and 1 xjuncts. [2018-03-23 11:57:29,633 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 18 [2018-03-23 11:57:29,634 INFO L267 ElimStorePlain]: Start of recursive call 11: End of recursive call: and 1 xjuncts. [2018-03-23 11:57:29,641 INFO L267 ElimStorePlain]: Start of recursive call 5: 5 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-03-23 11:57:29,650 INFO L267 ElimStorePlain]: Start of recursive call 1: 5 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-03-23 11:57:29,650 INFO L202 ElimStorePlain]: Needed 11 recursive calls to eliminate 7 variables, input treesize:89, output treesize:5 [2018-03-23 11:57:29,662 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 0 proven. 19 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-03-23 11:57:29,685 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-03-23 11:57:29,685 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 18] total 30 [2018-03-23 11:57:29,685 INFO L442 AbstractCegarLoop]: Interpolant automaton has 31 states [2018-03-23 11:57:29,685 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 31 interpolants. [2018-03-23 11:57:29,685 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=114, Invalid=816, Unknown=0, NotChecked=0, Total=930 [2018-03-23 11:57:29,686 INFO L87 Difference]: Start difference. First operand 262 states and 278 transitions. Second operand 31 states. [2018-03-23 11:57:31,822 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-03-23 11:57:31,823 INFO L93 Difference]: Finished difference Result 404 states and 427 transitions. [2018-03-23 11:57:31,823 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 38 states. [2018-03-23 11:57:31,823 INFO L78 Accepts]: Start accepts. Automaton has 31 states. Word has length 53 [2018-03-23 11:57:31,823 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-03-23 11:57:31,824 INFO L225 Difference]: With dead ends: 404 [2018-03-23 11:57:31,824 INFO L226 Difference]: Without dead ends: 403 [2018-03-23 11:57:31,825 INFO L568 BasicCegarLoop]: 0 DeclaredPredicates, 106 GetRequests, 41 SyntacticMatches, 1 SemanticMatches, 64 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1078 ImplicationChecksByTransitivity, 1.7s TimeCoverageRelationStatistics Valid=724, Invalid=3565, Unknown=1, NotChecked=0, Total=4290 [2018-03-23 11:57:31,826 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 403 states. [2018-03-23 11:57:31,841 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 403 to 290. [2018-03-23 11:57:31,841 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 290 states. [2018-03-23 11:57:31,842 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 290 states to 290 states and 311 transitions. [2018-03-23 11:57:31,842 INFO L78 Accepts]: Start accepts. Automaton has 290 states and 311 transitions. Word has length 53 [2018-03-23 11:57:31,842 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-03-23 11:57:31,842 INFO L459 AbstractCegarLoop]: Abstraction has 290 states and 311 transitions. [2018-03-23 11:57:31,842 INFO L460 AbstractCegarLoop]: Interpolant automaton has 31 states. [2018-03-23 11:57:31,842 INFO L276 IsEmpty]: Start isEmpty. Operand 290 states and 311 transitions. [2018-03-23 11:57:31,843 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2018-03-23 11:57:31,843 INFO L345 BasicCegarLoop]: Found error trace [2018-03-23 11:57:31,843 INFO L353 BasicCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-03-23 11:57:31,843 INFO L408 AbstractCegarLoop]: === Iteration 28 === [mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr42EnsuresViolationMEMORY_LEAK, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr21RequiresViolation, mainErr31RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr39RequiresViolation, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr12RequiresViolation, mainErr40AssertViolationMEMORY_FREE, mainErr41AssertViolationMEMORY_FREE, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr9RequiresViolation, mainErr30RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr34RequiresViolation, mainErr4RequiresViolation, mainErr14RequiresViolation, mainErr37RequiresViolation]=== [2018-03-23 11:57:31,843 INFO L82 PathProgramCache]: Analyzing trace with hash -379319970, now seen corresponding path program 2 times [2018-03-23 11:57:31,843 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-03-23 11:57:31,843 INFO L68 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-03-23 11:57:31,844 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-03-23 11:57:31,844 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-03-23 11:57:31,844 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-03-23 11:57:31,853 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-03-23 11:57:31,853 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-03-23 11:57:32,122 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 0 proven. 19 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-03-23 11:57:32,122 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-03-23 11:57:32,122 INFO L213 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 11 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 11 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-03-23 11:57:32,128 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-03-23 11:57:32,147 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-03-23 11:57:32,147 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-03-23 11:57:32,150 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-03-23 11:57:32,210 INFO L700 Elim1Store]: detected not equals via solver [2018-03-23 11:57:32,210 INFO L700 Elim1Store]: detected not equals via solver [2018-03-23 11:57:32,211 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 4 [2018-03-23 11:57:32,211 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-03-23 11:57:32,216 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-03-23 11:57:32,216 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:23, output treesize:17 [2018-03-23 11:57:32,238 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 8 [2018-03-23 11:57:32,240 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-03-23 11:57:32,240 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-03-23 11:57:32,242 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-03-23 11:57:32,252 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 8 [2018-03-23 11:57:32,254 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-03-23 11:57:32,254 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-03-23 11:57:32,255 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-03-23 11:57:32,263 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-03-23 11:57:32,263 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 3 variables, input treesize:41, output treesize:30 [2018-03-23 11:57:32,339 INFO L700 Elim1Store]: detected not equals via solver [2018-03-23 11:57:32,343 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 28 [2018-03-23 11:57:32,346 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-03-23 11:57:32,346 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-03-23 11:57:32,352 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-03-23 11:57:32,367 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 24 [2018-03-23 11:57:32,369 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 11 [2018-03-23 11:57:32,370 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-03-23 11:57:32,374 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-03-23 11:57:32,383 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-03-23 11:57:32,383 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 2 variables, input treesize:56, output treesize:48 [2018-03-23 11:57:32,418 INFO L700 Elim1Store]: detected not equals via solver [2018-03-23 11:57:32,418 INFO L700 Elim1Store]: detected not equals via solver [2018-03-23 11:57:32,419 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 4 [2018-03-23 11:57:32,419 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-03-23 11:57:32,428 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-03-23 11:57:32,428 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:53, output treesize:47 [2018-03-23 11:57:32,464 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 37 treesize of output 36 [2018-03-23 11:57:32,467 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 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 7 [2018-03-23 11:57:32,468 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-03-23 11:57:32,473 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-03-23 11:57:32,491 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 36 [2018-03-23 11:57:32,495 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 11 [2018-03-23 11:57:32,495 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-03-23 11:57:32,500 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-03-23 11:57:32,519 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-03-23 11:57:32,519 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 4 variables, input treesize:76, output treesize:40 [2018-03-23 11:57:32,631 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 4 new quantified variables, introduced 3 case distinctions, treesize of input 86 treesize of output 78 [2018-03-23 11:57:32,634 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 91 treesize of output 90 [2018-03-23 11:57:32,634 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-03-23 11:57:32,672 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 1 new quantified variables, introduced 2 case distinctions, treesize of input 52 treesize of output 66 [2018-03-23 11:57:32,672 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 2 xjuncts. [2018-03-23 11:57:32,697 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-03-23 11:57:32,726 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 81 treesize of output 70 [2018-03-23 11:57:32,728 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 15 [2018-03-23 11:57:32,728 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2018-03-23 11:57:32,736 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-03-23 11:57:32,740 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 60 treesize of output 53 [2018-03-23 11:57:32,742 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 11 [2018-03-23 11:57:32,742 INFO L267 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 1 xjuncts. [2018-03-23 11:57:32,750 INFO L267 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-03-23 11:57:32,773 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-2 vars, End of recursive call: 3 dim-0 vars, and 2 xjuncts. [2018-03-23 11:57:32,773 INFO L202 ElimStorePlain]: Needed 8 recursive calls to eliminate 4 variables, input treesize:99, output treesize:131 [2018-03-23 11:57:32,931 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 66 treesize of output 52 [2018-03-23 11:57:32,934 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 19 [2018-03-23 11:57:32,935 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-03-23 11:57:32,953 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 1 [2018-03-23 11:57:32,954 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-03-23 11:57:32,962 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-03-23 11:57:32,988 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 30 [2018-03-23 11:57:32,990 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 3 [2018-03-23 11:57:32,990 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2018-03-23 11:57:32,997 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 1 [2018-03-23 11:57:32,997 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2018-03-23 11:57:33,003 INFO L267 ElimStorePlain]: Start of recursive call 5: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-03-23 11:57:33,024 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 86 treesize of output 72 [2018-03-23 11:57:33,039 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 3 [2018-03-23 11:57:33,039 INFO L267 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 1 xjuncts. [2018-03-23 11:57:33,057 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 1 [2018-03-23 11:57:33,058 INFO L267 ElimStorePlain]: Start of recursive call 10: End of recursive call: and 1 xjuncts. [2018-03-23 11:57:33,067 INFO L267 ElimStorePlain]: Start of recursive call 8: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-03-23 11:57:33,092 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 4 new quantified variables, introduced 1 case distinctions, treesize of input 60 treesize of output 51 [2018-03-23 11:57:33,094 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 44 treesize of output 40 [2018-03-23 11:57:33,095 INFO L267 ElimStorePlain]: Start of recursive call 12: End of recursive call: and 1 xjuncts. [2018-03-23 11:57:33,112 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 38 treesize of output 29 [2018-03-23 11:57:33,113 INFO L267 ElimStorePlain]: Start of recursive call 13: End of recursive call: and 1 xjuncts. [2018-03-23 11:57:33,132 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 29 treesize of output 30 [2018-03-23 11:57:33,133 INFO L267 ElimStorePlain]: Start of recursive call 14: End of recursive call: and 2 xjuncts. [2018-03-23 11:57:33,155 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 23 [2018-03-23 11:57:33,155 INFO L267 ElimStorePlain]: Start of recursive call 15: End of recursive call: and 1 xjuncts. [2018-03-23 11:57:33,174 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 18 [2018-03-23 11:57:33,174 INFO L267 ElimStorePlain]: Start of recursive call 16: End of recursive call: and 1 xjuncts. [2018-03-23 11:57:33,183 INFO L267 ElimStorePlain]: Start of recursive call 11: 5 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-03-23 11:57:33,194 INFO L267 ElimStorePlain]: Start of recursive call 1: 5 dim-0 vars, 4 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-03-23 11:57:33,195 INFO L202 ElimStorePlain]: Needed 16 recursive calls to eliminate 9 variables, input treesize:153, output treesize:9 [2018-03-23 11:57:33,220 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 0 proven. 19 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-03-23 11:57:33,242 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-03-23 11:57:33,242 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 18] total 31 [2018-03-23 11:57:33,242 INFO L442 AbstractCegarLoop]: Interpolant automaton has 32 states [2018-03-23 11:57:33,242 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 32 interpolants. [2018-03-23 11:57:33,242 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=114, Invalid=878, Unknown=0, NotChecked=0, Total=992 [2018-03-23 11:57:33,243 INFO L87 Difference]: Start difference. First operand 290 states and 311 transitions. Second operand 32 states. [2018-03-23 11:57:35,102 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-03-23 11:57:35,102 INFO L93 Difference]: Finished difference Result 393 states and 418 transitions. [2018-03-23 11:57:35,102 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 32 states. [2018-03-23 11:57:35,102 INFO L78 Accepts]: Start accepts. Automaton has 32 states. Word has length 53 [2018-03-23 11:57:35,102 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-03-23 11:57:35,103 INFO L225 Difference]: With dead ends: 393 [2018-03-23 11:57:35,104 INFO L226 Difference]: Without dead ends: 388 [2018-03-23 11:57:35,104 INFO L568 BasicCegarLoop]: 0 DeclaredPredicates, 100 GetRequests, 39 SyntacticMatches, 2 SemanticMatches, 59 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 859 ImplicationChecksByTransitivity, 1.7s TimeCoverageRelationStatistics Valid=565, Invalid=3088, Unknown=7, NotChecked=0, Total=3660 [2018-03-23 11:57:35,105 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 388 states. [2018-03-23 11:57:35,129 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 388 to 302. [2018-03-23 11:57:35,129 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 302 states. [2018-03-23 11:57:35,130 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 302 states to 302 states and 325 transitions. [2018-03-23 11:57:35,130 INFO L78 Accepts]: Start accepts. Automaton has 302 states and 325 transitions. Word has length 53 [2018-03-23 11:57:35,130 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-03-23 11:57:35,130 INFO L459 AbstractCegarLoop]: Abstraction has 302 states and 325 transitions. [2018-03-23 11:57:35,131 INFO L460 AbstractCegarLoop]: Interpolant automaton has 32 states. [2018-03-23 11:57:35,131 INFO L276 IsEmpty]: Start isEmpty. Operand 302 states and 325 transitions. [2018-03-23 11:57:35,131 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2018-03-23 11:57:35,131 INFO L345 BasicCegarLoop]: Found error trace [2018-03-23 11:57:35,131 INFO L353 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-03-23 11:57:35,131 INFO L408 AbstractCegarLoop]: === Iteration 29 === [mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr42EnsuresViolationMEMORY_LEAK, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr21RequiresViolation, mainErr31RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr39RequiresViolation, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr12RequiresViolation, mainErr40AssertViolationMEMORY_FREE, mainErr41AssertViolationMEMORY_FREE, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr9RequiresViolation, mainErr30RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr34RequiresViolation, mainErr4RequiresViolation, mainErr14RequiresViolation, mainErr37RequiresViolation]=== [2018-03-23 11:57:35,132 INFO L82 PathProgramCache]: Analyzing trace with hash 1603432634, now seen corresponding path program 1 times [2018-03-23 11:57:35,132 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-03-23 11:57:35,132 INFO L68 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-03-23 11:57:35,132 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-03-23 11:57:35,132 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-03-23 11:57:35,133 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-03-23 11:57:35,142 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-03-23 11:57:35,156 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-03-23 11:57:35,182 INFO L419 BasicCegarLoop]: Counterexample might be feasible [2018-03-23 11:57:35,207 WARN L343 cessorBacktranslator]: Generated EnsuresSpecification ensures #valid == old(#valid); is not ensure(true) [2018-03-23 11:57:35,231 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 23.03 11:57:35 BoogieIcfgContainer [2018-03-23 11:57:35,231 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-03-23 11:57:35,232 INFO L168 Benchmark]: Toolchain (without parser) took 29257.16 ms. Allocated memory was 297.8 MB in the beginning and 742.4 MB in the end (delta: 444.6 MB). Free memory was 235.0 MB in the beginning and 520.8 MB in the end (delta: -285.8 MB). Peak memory consumption was 158.8 MB. Max. memory is 5.3 GB. [2018-03-23 11:57:35,234 INFO L168 Benchmark]: CDTParser took 0.23 ms. Allocated memory is still 297.8 MB. Free memory is still 261.8 MB. There was no memory consumed. Max. memory is 5.3 GB. [2018-03-23 11:57:35,234 INFO L168 Benchmark]: CACSL2BoogieTranslator took 334.68 ms. Allocated memory is still 297.8 MB. Free memory was 235.0 MB in the beginning and 206.8 MB in the end (delta: 28.2 MB). Peak memory consumption was 28.2 MB. Max. memory is 5.3 GB. [2018-03-23 11:57:35,234 INFO L168 Benchmark]: Boogie Preprocessor took 59.93 ms. Allocated memory is still 297.8 MB. Free memory was 206.8 MB in the beginning and 204.9 MB in the end (delta: 2.0 MB). Peak memory consumption was 2.0 MB. Max. memory is 5.3 GB. [2018-03-23 11:57:35,235 INFO L168 Benchmark]: RCFGBuilder took 679.19 ms. Allocated memory was 297.8 MB in the beginning and 454.6 MB in the end (delta: 156.8 MB). Free memory was 204.9 MB in the beginning and 376.4 MB in the end (delta: -171.6 MB). Peak memory consumption was 22.6 MB. Max. memory is 5.3 GB. [2018-03-23 11:57:35,235 INFO L168 Benchmark]: TraceAbstraction took 28178.99 ms. Allocated memory was 454.6 MB in the beginning and 742.4 MB in the end (delta: 287.8 MB). Free memory was 376.4 MB in the beginning and 520.8 MB in the end (delta: -144.4 MB). Peak memory consumption was 143.4 MB. Max. memory is 5.3 GB. [2018-03-23 11:57:35,237 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.23 ms. Allocated memory is still 297.8 MB. Free memory is still 261.8 MB. There was no memory consumed. Max. memory is 5.3 GB. * CACSL2BoogieTranslator took 334.68 ms. Allocated memory is still 297.8 MB. Free memory was 235.0 MB in the beginning and 206.8 MB in the end (delta: 28.2 MB). Peak memory consumption was 28.2 MB. Max. memory is 5.3 GB. * Boogie Preprocessor took 59.93 ms. Allocated memory is still 297.8 MB. Free memory was 206.8 MB in the beginning and 204.9 MB in the end (delta: 2.0 MB). Peak memory consumption was 2.0 MB. Max. memory is 5.3 GB. * RCFGBuilder took 679.19 ms. Allocated memory was 297.8 MB in the beginning and 454.6 MB in the end (delta: 156.8 MB). Free memory was 204.9 MB in the beginning and 376.4 MB in the end (delta: -171.6 MB). Peak memory consumption was 22.6 MB. Max. memory is 5.3 GB. * TraceAbstraction took 28178.99 ms. Allocated memory was 454.6 MB in the beginning and 742.4 MB in the end (delta: 287.8 MB). Free memory was 376.4 MB in the beginning and 520.8 MB in the end (delta: -144.4 MB). Peak memory consumption was 143.4 MB. Max. memory is 5.3 GB. * Results from de.uni_freiburg.informatik.ultimate.boogie.preprocessor: - GenericResult: Unfinished Backtranslation Generated EnsuresSpecification ensures #valid == old(#valid); is not ensure(true) * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - UnprovableResult [Line: 985]: Unable to prove that all allocated memory was freed Unable to prove that all allocated memory was freed Reason: overapproximation of memtrack at line 985. Possible FailurePath: [L988] EXPR, FCALL malloc(sizeof(SLL)) VAL [malloc(sizeof(SLL))={11:0}] [L988] SLL* head = malloc(sizeof(SLL)); VAL [head={11:0}, malloc(sizeof(SLL))={11:0}] [L989] FCALL head->next = ((void*)0) VAL [head={11:0}, malloc(sizeof(SLL))={11:0}] [L990] FCALL head->data = 0 VAL [head={11:0}, malloc(sizeof(SLL))={11:0}] [L992] SLL* x = head; VAL [head={11:0}, malloc(sizeof(SLL))={11:0}, x={11:0}] [L995] COND FALSE !(__VERIFIER_nondet_int()) VAL [__VERIFIER_nondet_int()=0, head={11:0}, malloc(sizeof(SLL))={11:0}, x={11:0}] [L1005] COND FALSE !(__VERIFIER_nondet_int()) VAL [__VERIFIER_nondet_int()=0, head={11:0}, malloc(sizeof(SLL))={11:0}, x={11:0}] [L1014] x = head VAL [head={11:0}, malloc(sizeof(SLL))={11:0}, x={11:0}] [L1015] FCALL x->next VAL [head={11:0}, malloc(sizeof(SLL))={11:0}, x={11:0}, x->next={0:0}] [L1015] COND FALSE !(x->next) VAL [head={11:0}, malloc(sizeof(SLL))={11:0}, x={11:0}, x->next={0:0}] [L1022] EXPR, FCALL x->next VAL [head={11:0}, malloc(sizeof(SLL))={11:0}, x={11:0}, x->next={0:0}] [L1022] SLL* y = x->next; VAL [head={11:0}, malloc(sizeof(SLL))={11:0}, x={11:0}, x->next={0:0}, y={0:0}] [L1023] EXPR, FCALL malloc(sizeof(SLL)) VAL [head={11:0}, malloc(sizeof(SLL))={11:0}, malloc(sizeof(SLL))={10:0}, x={11:0}, y={0:0}] [L1023] FCALL x->next = malloc(sizeof(SLL)) VAL [head={11:0}, malloc(sizeof(SLL))={11:0}, malloc(sizeof(SLL))={10:0}, x={11:0}, y={0:0}] [L1024] FCALL x->data = 1 VAL [head={11:0}, malloc(sizeof(SLL))={11:0}, malloc(sizeof(SLL))={10:0}, x={11:0}, y={0:0}] [L1025] FCALL x->next = y VAL [head={11:0}, malloc(sizeof(SLL))={11:0}, malloc(sizeof(SLL))={10:0}, x={11:0}, y={0:0}] [L1029] x = head VAL [head={11:0}, malloc(sizeof(SLL))={11:0}, malloc(sizeof(SLL))={10:0}, x={11:0}, y={0:0}] [L1032] EXPR, FCALL x->data VAL [head={11:0}, malloc(sizeof(SLL))={11:0}, malloc(sizeof(SLL))={10:0}, x={11:0}, x->data=1, y={0:0}] [L1032] COND FALSE !(x->data != 1) VAL [head={11:0}, malloc(sizeof(SLL))={11:0}, malloc(sizeof(SLL))={10:0}, x={11:0}, x->data=1, y={0:0}] [L1038] EXPR, FCALL x->next VAL [head={11:0}, malloc(sizeof(SLL))={11:0}, malloc(sizeof(SLL))={10:0}, x={11:0}, x->next={0:0}, y={0:0}] [L1038] x = x->next VAL [head={11:0}, malloc(sizeof(SLL))={11:0}, malloc(sizeof(SLL))={10:0}, x={0:0}, x->next={0:0}, y={0:0}] [L1039] COND FALSE !(\read(*x)) VAL [head={11:0}, malloc(sizeof(SLL))={11:0}, malloc(sizeof(SLL))={10:0}, x={0:0}, y={0:0}] [L1047] x = head VAL [head={11:0}, malloc(sizeof(SLL))={11:0}, malloc(sizeof(SLL))={10:0}, x={11:0}, y={0:0}] [L1048] COND TRUE x != ((void*)0) VAL [head={11:0}, malloc(sizeof(SLL))={11:0}, malloc(sizeof(SLL))={10:0}, x={11:0}, y={0:0}] [L1050] head = x VAL [head={11:0}, malloc(sizeof(SLL))={11:0}, malloc(sizeof(SLL))={10:0}, x={11:0}, y={0:0}] [L1051] EXPR, FCALL x->next VAL [head={11:0}, malloc(sizeof(SLL))={11:0}, malloc(sizeof(SLL))={10:0}, x={11:0}, x->next={0:0}, y={0:0}] [L1051] x = x->next VAL [head={11:0}, malloc(sizeof(SLL))={11:0}, malloc(sizeof(SLL))={10:0}, x={0:0}, x->next={0:0}, y={0:0}] [L1052] free(head) VAL [head={11:0}, malloc(sizeof(SLL))={11:0}, malloc(sizeof(SLL))={10:0}, x={0:0}, y={0:0}] [L1052] free(head) VAL [head={11:0}, malloc(sizeof(SLL))={11:0}, malloc(sizeof(SLL))={10:0}, x={0:0}, y={0:0}] [L1052] FCALL free(head) VAL [head={11:0}, malloc(sizeof(SLL))={11:0}, malloc(sizeof(SLL))={10:0}, x={0:0}, y={0:0}] [L1048] COND FALSE !(x != ((void*)0)) VAL [head={11:0}, malloc(sizeof(SLL))={11:0}, malloc(sizeof(SLL))={10:0}, x={0:0}, y={0:0}] [L1055] return 0; VAL [\result=0, head={11:0}, malloc(sizeof(SLL))={11:0}, malloc(sizeof(SLL))={10:0}, x={0:0}, y={0:0}] - StatisticsResult: Ultimate Automizer benchmark data CFG has 3 procedures, 135 locations, 43 error locations. UNSAFE Result, 28.1s OverallTime, 29 OverallIterations, 3 TraceHistogramMax, 17.2s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 2834 SDtfs, 10959 SDslu, 14165 SDs, 0 SdLazy, 14062 SolverSat, 1440 SolverUnsat, 31 SolverUnknown, 0 SolverNotchecked, 8.5s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 993 GetRequests, 397 SyntacticMatches, 34 SemanticMatches, 562 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4692 ImplicationChecksByTransitivity, 11.4s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=302occurred in iteration=28, 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.4s AutomataMinimizationTime, 28 MinimizatonAttempts, 1650 StatesRemovedByMinimization, 28 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.4s SatisfiabilityAnalysisTime, 9.1s InterpolantComputationTime, 1478 NumberOfCodeBlocks, 1478 NumberOfCodeBlocksAsserted, 43 NumberOfCheckSat, 1386 ConstructedInterpolants, 150 QuantifiedInterpolants, 1084652 SizeOfPredicates, 183 NumberOfNonLiveVariables, 1602 ConjunctsInSsa, 385 ConjunctsInUnsatCore, 38 InterpolantComputations, 18 PerfectInterpolantSequences, 41/185 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate could not prove your program: unable to determine feasibility of some traces Written .csv to /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/sll-simple-white-blue_true-unreach-call_false-valid-memtrack.i_svcomp-DerefFreeMemtrack-32bit-Automizer_Camel+AI_EQ_SS.epf_AutomizerC.xml/Csv-Benchmark-0-2018-03-23_11-57-35-245.csv Written .csv to /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/sll-simple-white-blue_true-unreach-call_false-valid-memtrack.i_svcomp-DerefFreeMemtrack-32bit-Automizer_Camel+AI_EQ_SS.epf_AutomizerC.xml/Csv-TraceAbstractionBenchmarks-0-2018-03-23_11-57-35-245.csv Received shutdown request...