java -Xmx6000000000 -jar ./plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data ./data --generate-csv --csv-dir ../../../releaseScripts/default/UAutomizer-linux/csv --cacsl2boogietranslator.bitprecise.bitfields false -tc ../../../trunk/examples/toolchains/AutomizerC.xml -s ../../../trunk/examples/settings/cade18-smtinterpol/svcomp-DerefFreeMemtrack-32bit-Automizer_Camel.epf -i ../../../trunk/examples/svcomp/memsafety-ext/tree_cnstr_true-valid-memsafety_false-termination.i -------------------------------------------------------------------------------- This is Ultimate 0.1.23-408c70d-m [2018-04-12 13:05:35,557 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-04-12 13:05:35,559 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-04-12 13:05:35,571 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-04-12 13:05:35,572 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-04-12 13:05:35,572 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-04-12 13:05:35,573 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-04-12 13:05:35,575 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-04-12 13:05:35,577 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-04-12 13:05:35,578 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-04-12 13:05:35,578 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-04-12 13:05:35,579 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-04-12 13:05:35,579 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-04-12 13:05:35,580 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-04-12 13:05:35,581 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-04-12 13:05:35,583 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-04-12 13:05:35,584 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-04-12 13:05:35,586 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-04-12 13:05:35,587 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-04-12 13:05:35,587 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-04-12 13:05:35,589 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-04-12 13:05:35,589 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-04-12 13:05:35,590 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-04-12 13:05:35,591 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-04-12 13:05:35,591 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-04-12 13:05:35,592 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-04-12 13:05:35,592 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-04-12 13:05:35,593 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-04-12 13:05:35,593 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-04-12 13:05:35,594 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-04-12 13:05:35,594 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-04-12 13:05:35,594 INFO L98 SettingsManager]: Beginning loading settings from /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/cade18-smtinterpol/svcomp-DerefFreeMemtrack-32bit-Automizer_Camel.epf [2018-04-12 13:05:35,604 INFO L110 SettingsManager]: Loading preferences was successful [2018-04-12 13:05:35,604 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-04-12 13:05:35,605 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-04-12 13:05:35,606 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-04-12 13:05:35,606 INFO L133 SettingsManager]: * Use SBE=true [2018-04-12 13:05:35,606 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-04-12 13:05:35,606 INFO L133 SettingsManager]: * sizeof long=4 [2018-04-12 13:05:35,606 INFO L133 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2018-04-12 13:05:35,606 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-04-12 13:05:35,607 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-04-12 13:05:35,607 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-04-12 13:05:35,607 INFO L133 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2018-04-12 13:05:35,607 INFO L133 SettingsManager]: * Bitprecise bitfields=true [2018-04-12 13:05:35,607 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-04-12 13:05:35,607 INFO L133 SettingsManager]: * sizeof long double=12 [2018-04-12 13:05:35,608 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-04-12 13:05:35,608 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-04-12 13:05:35,608 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-04-12 13:05:35,608 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-04-12 13:05:35,608 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-04-12 13:05:35,608 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-04-12 13:05:35,608 INFO L133 SettingsManager]: * Interpolant automaton=TWOTRACK [2018-04-12 13:05:35,609 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-04-12 13:05:35,609 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Bitprecise bitfields -> false [2018-04-12 13:05:35,642 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-04-12 13:05:35,652 INFO L266 ainManager$Toolchain]: [Toolchain 1]: Parser(s) successfully (re)initialized [2018-04-12 13:05:35,655 INFO L222 ainManager$Toolchain]: [Toolchain 1]: Toolchain data selected. [2018-04-12 13:05:35,657 INFO L271 PluginConnector]: Initializing CDTParser... [2018-04-12 13:05:35,657 INFO L276 PluginConnector]: CDTParser initialized [2018-04-12 13:05:35,657 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/memsafety-ext/tree_cnstr_true-valid-memsafety_false-termination.i [2018-04-12 13:05:35,948 INFO L225 CDTParser]: Created temporary CDT project at /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/data/FLAGa1a8e3e43 [2018-04-12 13:05:36,075 INFO L287 CDTParser]: IsIndexed: true [2018-04-12 13:05:36,079 INFO L288 CDTParser]: Found 1 translation units. [2018-04-12 13:05:36,079 INFO L168 CDTParser]: Scanning tree_cnstr_true-valid-memsafety_false-termination.i [2018-04-12 13:05:36,089 INFO L210 ultiparseSymbolTable]: Include resolver: [2018-04-12 13:05:36,089 INFO L215 ultiparseSymbolTable]: [2018-04-12 13:05:36,089 INFO L218 ultiparseSymbolTable]: Function table: [2018-04-12 13:05:36,090 INFO L221 ultiparseSymbolTable]: Function definition of null ('main') in tree_cnstr_true-valid-memsafety_false-termination.i [2018-04-12 13:05:36,090 INFO L227 ultiparseSymbolTable]: Global variable table: [2018-04-12 13:05:36,090 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_ftree_cnstr_true_valid_memsafety_false_termination_i__fd_mask in tree_cnstr_true-valid-memsafety_false-termination.i [2018-04-12 13:05:36,090 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_ftree_cnstr_true_valid_memsafety_false_termination_i__ushort in tree_cnstr_true-valid-memsafety_false-termination.i [2018-04-12 13:05:36,090 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_ftree_cnstr_true_valid_memsafety_false_termination_i__suseconds_t in tree_cnstr_true-valid-memsafety_false-termination.i [2018-04-12 13:05:36,090 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_ftree_cnstr_true_valid_memsafety_false_termination_i____ino_t in tree_cnstr_true-valid-memsafety_false-termination.i [2018-04-12 13:05:36,090 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_ftree_cnstr_true_valid_memsafety_false_termination_i____u_quad_t in tree_cnstr_true-valid-memsafety_false-termination.i [2018-04-12 13:05:36,091 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_ftree_cnstr_true_valid_memsafety_false_termination_i__pthread_barrier_t in tree_cnstr_true-valid-memsafety_false-termination.i [2018-04-12 13:05:36,091 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_ftree_cnstr_true_valid_memsafety_false_termination_i__int64_t in tree_cnstr_true-valid-memsafety_false-termination.i [2018-04-12 13:05:36,091 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_ftree_cnstr_true_valid_memsafety_false_termination_i__u_long in tree_cnstr_true-valid-memsafety_false-termination.i [2018-04-12 13:05:36,091 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_ftree_cnstr_true_valid_memsafety_false_termination_i____WAIT_STATUS in tree_cnstr_true-valid-memsafety_false-termination.i [2018-04-12 13:05:36,091 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_ftree_cnstr_true_valid_memsafety_false_termination_i____clock_t in tree_cnstr_true-valid-memsafety_false-termination.i [2018-04-12 13:05:36,091 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_ftree_cnstr_true_valid_memsafety_false_termination_i__u_int16_t in tree_cnstr_true-valid-memsafety_false-termination.i [2018-04-12 13:05:36,091 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_ftree_cnstr_true_valid_memsafety_false_termination_i____blkcnt_t in tree_cnstr_true-valid-memsafety_false-termination.i [2018-04-12 13:05:36,091 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_ftree_cnstr_true_valid_memsafety_false_termination_i__pthread_cond_t in tree_cnstr_true-valid-memsafety_false-termination.i [2018-04-12 13:05:36,091 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_ftree_cnstr_true_valid_memsafety_false_termination_i__daddr_t in tree_cnstr_true-valid-memsafety_false-termination.i [2018-04-12 13:05:36,091 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_ftree_cnstr_true_valid_memsafety_false_termination_i__fsid_t in tree_cnstr_true-valid-memsafety_false-termination.i [2018-04-12 13:05:36,092 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_ftree_cnstr_true_valid_memsafety_false_termination_i__quad_t in tree_cnstr_true-valid-memsafety_false-termination.i [2018-04-12 13:05:36,092 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_ftree_cnstr_true_valid_memsafety_false_termination_i____u_int in tree_cnstr_true-valid-memsafety_false-termination.i [2018-04-12 13:05:36,092 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_ftree_cnstr_true_valid_memsafety_false_termination_i____clockid_t in tree_cnstr_true-valid-memsafety_false-termination.i [2018-04-12 13:05:36,092 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_ftree_cnstr_true_valid_memsafety_false_termination_i____loff_t in tree_cnstr_true-valid-memsafety_false-termination.i [2018-04-12 13:05:36,092 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_ftree_cnstr_true_valid_memsafety_false_termination_i__clockid_t in tree_cnstr_true-valid-memsafety_false-termination.i [2018-04-12 13:05:36,092 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_ftree_cnstr_true_valid_memsafety_false_termination_i__u_int8_t in tree_cnstr_true-valid-memsafety_false-termination.i [2018-04-12 13:05:36,092 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_ftree_cnstr_true_valid_memsafety_false_termination_i____useconds_t in tree_cnstr_true-valid-memsafety_false-termination.i [2018-04-12 13:05:36,092 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_ftree_cnstr_true_valid_memsafety_false_termination_i__pthread_condattr_t in tree_cnstr_true-valid-memsafety_false-termination.i [2018-04-12 13:05:36,092 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_ftree_cnstr_true_valid_memsafety_false_termination_i__wchar_t in tree_cnstr_true-valid-memsafety_false-termination.i [2018-04-12 13:05:36,093 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_ftree_cnstr_true_valid_memsafety_false_termination_i____uint16_t in tree_cnstr_true-valid-memsafety_false-termination.i [2018-04-12 13:05:36,093 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_ftree_cnstr_true_valid_memsafety_false_termination_i____int64_t in tree_cnstr_true-valid-memsafety_false-termination.i [2018-04-12 13:05:36,093 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_ftree_cnstr_true_valid_memsafety_false_termination_i____gid_t in tree_cnstr_true-valid-memsafety_false-termination.i [2018-04-12 13:05:36,093 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_ftree_cnstr_true_valid_memsafety_false_termination_i____daddr_t in tree_cnstr_true-valid-memsafety_false-termination.i [2018-04-12 13:05:36,093 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_ftree_cnstr_true_valid_memsafety_false_termination_i____key_t in tree_cnstr_true-valid-memsafety_false-termination.i [2018-04-12 13:05:36,093 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_ftree_cnstr_true_valid_memsafety_false_termination_i____pid_t in tree_cnstr_true-valid-memsafety_false-termination.i [2018-04-12 13:05:36,093 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_ftree_cnstr_true_valid_memsafety_false_termination_i____uint8_t in tree_cnstr_true-valid-memsafety_false-termination.i [2018-04-12 13:05:36,093 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_ftree_cnstr_true_valid_memsafety_false_termination_i__loff_t in tree_cnstr_true-valid-memsafety_false-termination.i [2018-04-12 13:05:36,093 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_ftree_cnstr_true_valid_memsafety_false_termination_i____quad_t in tree_cnstr_true-valid-memsafety_false-termination.i [2018-04-12 13:05:36,093 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_ftree_cnstr_true_valid_memsafety_false_termination_i____uint64_t in tree_cnstr_true-valid-memsafety_false-termination.i [2018-04-12 13:05:36,093 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_ftree_cnstr_true_valid_memsafety_false_termination_i__ssize_t in tree_cnstr_true-valid-memsafety_false-termination.i [2018-04-12 13:05:36,094 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_ftree_cnstr_true_valid_memsafety_false_termination_i__u_quad_t in tree_cnstr_true-valid-memsafety_false-termination.i [2018-04-12 13:05:36,094 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_ftree_cnstr_true_valid_memsafety_false_termination_i____swblk_t in tree_cnstr_true-valid-memsafety_false-termination.i [2018-04-12 13:05:36,094 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_ftree_cnstr_true_valid_memsafety_false_termination_i____fsblkcnt_t in tree_cnstr_true-valid-memsafety_false-termination.i [2018-04-12 13:05:36,094 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_ftree_cnstr_true_valid_memsafety_false_termination_i__register_t in tree_cnstr_true-valid-memsafety_false-termination.i [2018-04-12 13:05:36,094 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_ftree_cnstr_true_valid_memsafety_false_termination_i__timer_t in tree_cnstr_true-valid-memsafety_false-termination.i [2018-04-12 13:05:36,094 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_ftree_cnstr_true_valid_memsafety_false_termination_i____nlink_t in tree_cnstr_true-valid-memsafety_false-termination.i [2018-04-12 13:05:36,094 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_ftree_cnstr_true_valid_memsafety_false_termination_i__pthread_t in tree_cnstr_true-valid-memsafety_false-termination.i [2018-04-12 13:05:36,094 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_ftree_cnstr_true_valid_memsafety_false_termination_i__pthread_barrierattr_t in tree_cnstr_true-valid-memsafety_false-termination.i [2018-04-12 13:05:36,094 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_ftree_cnstr_true_valid_memsafety_false_termination_i____sig_atomic_t in tree_cnstr_true-valid-memsafety_false-termination.i [2018-04-12 13:05:36,094 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_ftree_cnstr_true_valid_memsafety_false_termination_i__pthread_rwlock_t in tree_cnstr_true-valid-memsafety_false-termination.i [2018-04-12 13:05:36,094 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_ftree_cnstr_true_valid_memsafety_false_termination_i____fd_mask in tree_cnstr_true-valid-memsafety_false-termination.i [2018-04-12 13:05:36,094 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_ftree_cnstr_true_valid_memsafety_false_termination_i__pthread_key_t in tree_cnstr_true-valid-memsafety_false-termination.i [2018-04-12 13:05:36,094 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_ftree_cnstr_true_valid_memsafety_false_termination_i__u_int32_t in tree_cnstr_true-valid-memsafety_false-termination.i [2018-04-12 13:05:36,094 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_ftree_cnstr_true_valid_memsafety_false_termination_i__pthread_rwlockattr_t in tree_cnstr_true-valid-memsafety_false-termination.i [2018-04-12 13:05:36,094 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_ftree_cnstr_true_valid_memsafety_false_termination_i____blkcnt64_t in tree_cnstr_true-valid-memsafety_false-termination.i [2018-04-12 13:05:36,094 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_ftree_cnstr_true_valid_memsafety_false_termination_i__id_t in tree_cnstr_true-valid-memsafety_false-termination.i [2018-04-12 13:05:36,094 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_ftree_cnstr_true_valid_memsafety_false_termination_i__int32_t in tree_cnstr_true-valid-memsafety_false-termination.i [2018-04-12 13:05:36,095 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_ftree_cnstr_true_valid_memsafety_false_termination_i__dev_t in tree_cnstr_true-valid-memsafety_false-termination.i [2018-04-12 13:05:36,095 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_ftree_cnstr_true_valid_memsafety_false_termination_i__fsfilcnt_t in tree_cnstr_true-valid-memsafety_false-termination.i [2018-04-12 13:05:36,095 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_ftree_cnstr_true_valid_memsafety_false_termination_i____off_t in tree_cnstr_true-valid-memsafety_false-termination.i [2018-04-12 13:05:36,095 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_ftree_cnstr_true_valid_memsafety_false_termination_i____ino64_t in tree_cnstr_true-valid-memsafety_false-termination.i [2018-04-12 13:05:36,095 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_ftree_cnstr_true_valid_memsafety_false_termination_i__sigset_t in tree_cnstr_true-valid-memsafety_false-termination.i [2018-04-12 13:05:36,095 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_ftree_cnstr_true_valid_memsafety_false_termination_i____uid_t in tree_cnstr_true-valid-memsafety_false-termination.i [2018-04-12 13:05:36,095 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_ftree_cnstr_true_valid_memsafety_false_termination_i__uint in tree_cnstr_true-valid-memsafety_false-termination.i [2018-04-12 13:05:36,095 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_ftree_cnstr_true_valid_memsafety_false_termination_i__nlink_t in tree_cnstr_true-valid-memsafety_false-termination.i [2018-04-12 13:05:36,095 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_ftree_cnstr_true_valid_memsafety_false_termination_i____fsfilcnt_t in tree_cnstr_true-valid-memsafety_false-termination.i [2018-04-12 13:05:36,095 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_ftree_cnstr_true_valid_memsafety_false_termination_i__pthread_mutexattr_t in tree_cnstr_true-valid-memsafety_false-termination.i [2018-04-12 13:05:36,095 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_ftree_cnstr_true_valid_memsafety_false_termination_i__key_t in tree_cnstr_true-valid-memsafety_false-termination.i [2018-04-12 13:05:36,095 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_ftree_cnstr_true_valid_memsafety_false_termination_i__size_t in tree_cnstr_true-valid-memsafety_false-termination.i [2018-04-12 13:05:36,095 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_ftree_cnstr_true_valid_memsafety_false_termination_i____timer_t in tree_cnstr_true-valid-memsafety_false-termination.i [2018-04-12 13:05:36,095 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_ftree_cnstr_true_valid_memsafety_false_termination_i__u_int in tree_cnstr_true-valid-memsafety_false-termination.i [2018-04-12 13:05:36,095 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_ftree_cnstr_true_valid_memsafety_false_termination_i____u_short in tree_cnstr_true-valid-memsafety_false-termination.i [2018-04-12 13:05:36,095 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_ftree_cnstr_true_valid_memsafety_false_termination_i____rlim_t in tree_cnstr_true-valid-memsafety_false-termination.i [2018-04-12 13:05:36,095 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_ftree_cnstr_true_valid_memsafety_false_termination_i__pthread_mutex_t in tree_cnstr_true-valid-memsafety_false-termination.i [2018-04-12 13:05:36,095 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_ftree_cnstr_true_valid_memsafety_false_termination_i__mode_t in tree_cnstr_true-valid-memsafety_false-termination.i [2018-04-12 13:05:36,096 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_ftree_cnstr_true_valid_memsafety_false_termination_i____ssize_t in tree_cnstr_true-valid-memsafety_false-termination.i [2018-04-12 13:05:36,096 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_ftree_cnstr_true_valid_memsafety_false_termination_i____intptr_t in tree_cnstr_true-valid-memsafety_false-termination.i [2018-04-12 13:05:36,096 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_ftree_cnstr_true_valid_memsafety_false_termination_i____int32_t in tree_cnstr_true-valid-memsafety_false-termination.i [2018-04-12 13:05:36,096 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_ftree_cnstr_true_valid_memsafety_false_termination_i____socklen_t in tree_cnstr_true-valid-memsafety_false-termination.i [2018-04-12 13:05:36,096 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_ftree_cnstr_true_valid_memsafety_false_termination_i__time_t in tree_cnstr_true-valid-memsafety_false-termination.i [2018-04-12 13:05:36,096 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_ftree_cnstr_true_valid_memsafety_false_termination_i____rlim64_t in tree_cnstr_true-valid-memsafety_false-termination.i [2018-04-12 13:05:36,096 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_ftree_cnstr_true_valid_memsafety_false_termination_i__ldiv_t in tree_cnstr_true-valid-memsafety_false-termination.i [2018-04-12 13:05:36,096 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_ftree_cnstr_true_valid_memsafety_false_termination_i__uid_t in tree_cnstr_true-valid-memsafety_false-termination.i [2018-04-12 13:05:36,096 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_ftree_cnstr_true_valid_memsafety_false_termination_i____id_t in tree_cnstr_true-valid-memsafety_false-termination.i [2018-04-12 13:05:36,096 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_ftree_cnstr_true_valid_memsafety_false_termination_i__ino_t in tree_cnstr_true-valid-memsafety_false-termination.i [2018-04-12 13:05:36,096 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_ftree_cnstr_true_valid_memsafety_false_termination_i____fsfilcnt64_t in tree_cnstr_true-valid-memsafety_false-termination.i [2018-04-12 13:05:36,096 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_ftree_cnstr_true_valid_memsafety_false_termination_i__fsblkcnt_t in tree_cnstr_true-valid-memsafety_false-termination.i [2018-04-12 13:05:36,096 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_ftree_cnstr_true_valid_memsafety_false_termination_i____blksize_t in tree_cnstr_true-valid-memsafety_false-termination.i [2018-04-12 13:05:36,096 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_ftree_cnstr_true_valid_memsafety_false_termination_i__int8_t in tree_cnstr_true-valid-memsafety_false-termination.i [2018-04-12 13:05:36,096 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_ftree_cnstr_true_valid_memsafety_false_termination_i____u_char in tree_cnstr_true-valid-memsafety_false-termination.i [2018-04-12 13:05:36,097 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_ftree_cnstr_true_valid_memsafety_false_termination_i____qaddr_t in tree_cnstr_true-valid-memsafety_false-termination.i [2018-04-12 13:05:36,097 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_ftree_cnstr_true_valid_memsafety_false_termination_i____time_t in tree_cnstr_true-valid-memsafety_false-termination.i [2018-04-12 13:05:36,097 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_ftree_cnstr_true_valid_memsafety_false_termination_i____off64_t in tree_cnstr_true-valid-memsafety_false-termination.i [2018-04-12 13:05:36,097 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_ftree_cnstr_true_valid_memsafety_false_termination_i____suseconds_t in tree_cnstr_true-valid-memsafety_false-termination.i [2018-04-12 13:05:36,097 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_ftree_cnstr_true_valid_memsafety_false_termination_i____fsblkcnt64_t in tree_cnstr_true-valid-memsafety_false-termination.i [2018-04-12 13:05:36,097 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_ftree_cnstr_true_valid_memsafety_false_termination_i__u_int64_t in tree_cnstr_true-valid-memsafety_false-termination.i [2018-04-12 13:05:36,097 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_ftree_cnstr_true_valid_memsafety_false_termination_i__pthread_once_t in tree_cnstr_true-valid-memsafety_false-termination.i [2018-04-12 13:05:36,097 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_ftree_cnstr_true_valid_memsafety_false_termination_i__pthread_attr_t in tree_cnstr_true-valid-memsafety_false-termination.i [2018-04-12 13:05:36,097 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_ftree_cnstr_true_valid_memsafety_false_termination_i____caddr_t in tree_cnstr_true-valid-memsafety_false-termination.i [2018-04-12 13:05:36,097 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_ftree_cnstr_true_valid_memsafety_false_termination_i____int8_t in tree_cnstr_true-valid-memsafety_false-termination.i [2018-04-12 13:05:36,097 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_ftree_cnstr_true_valid_memsafety_false_termination_i____dev_t in tree_cnstr_true-valid-memsafety_false-termination.i [2018-04-12 13:05:36,097 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_ftree_cnstr_true_valid_memsafety_false_termination_i__u_char in tree_cnstr_true-valid-memsafety_false-termination.i [2018-04-12 13:05:36,098 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_ftree_cnstr_true_valid_memsafety_false_termination_i____pthread_list_t in tree_cnstr_true-valid-memsafety_false-termination.i [2018-04-12 13:05:36,098 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_ftree_cnstr_true_valid_memsafety_false_termination_i__int16_t in tree_cnstr_true-valid-memsafety_false-termination.i [2018-04-12 13:05:36,098 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_ftree_cnstr_true_valid_memsafety_false_termination_i__lldiv_t in tree_cnstr_true-valid-memsafety_false-termination.i [2018-04-12 13:05:36,098 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_ftree_cnstr_true_valid_memsafety_false_termination_i__off_t in tree_cnstr_true-valid-memsafety_false-termination.i [2018-04-12 13:05:36,098 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_ftree_cnstr_true_valid_memsafety_false_termination_i__blkcnt_t in tree_cnstr_true-valid-memsafety_false-termination.i [2018-04-12 13:05:36,098 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_ftree_cnstr_true_valid_memsafety_false_termination_i__gid_t in tree_cnstr_true-valid-memsafety_false-termination.i [2018-04-12 13:05:36,098 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_ftree_cnstr_true_valid_memsafety_false_termination_i____int16_t in tree_cnstr_true-valid-memsafety_false-termination.i [2018-04-12 13:05:36,098 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_ftree_cnstr_true_valid_memsafety_false_termination_i__pid_t in tree_cnstr_true-valid-memsafety_false-termination.i [2018-04-12 13:05:36,098 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_ftree_cnstr_true_valid_memsafety_false_termination_i__div_t in tree_cnstr_true-valid-memsafety_false-termination.i [2018-04-12 13:05:36,098 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_ftree_cnstr_true_valid_memsafety_false_termination_i__clock_t in tree_cnstr_true-valid-memsafety_false-termination.i [2018-04-12 13:05:36,098 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_ftree_cnstr_true_valid_memsafety_false_termination_i____u_long in tree_cnstr_true-valid-memsafety_false-termination.i [2018-04-12 13:05:36,098 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_ftree_cnstr_true_valid_memsafety_false_termination_i____uint32_t in tree_cnstr_true-valid-memsafety_false-termination.i [2018-04-12 13:05:36,099 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_ftree_cnstr_true_valid_memsafety_false_termination_i__fd_set in tree_cnstr_true-valid-memsafety_false-termination.i [2018-04-12 13:05:36,099 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_ftree_cnstr_true_valid_memsafety_false_termination_i__ulong in tree_cnstr_true-valid-memsafety_false-termination.i [2018-04-12 13:05:36,099 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_ftree_cnstr_true_valid_memsafety_false_termination_i__pthread_spinlock_t in tree_cnstr_true-valid-memsafety_false-termination.i [2018-04-12 13:05:36,099 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_ftree_cnstr_true_valid_memsafety_false_termination_i____mode_t in tree_cnstr_true-valid-memsafety_false-termination.i [2018-04-12 13:05:36,099 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_ftree_cnstr_true_valid_memsafety_false_termination_i__blksize_t in tree_cnstr_true-valid-memsafety_false-termination.i [2018-04-12 13:05:36,099 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_ftree_cnstr_true_valid_memsafety_false_termination_i__caddr_t in tree_cnstr_true-valid-memsafety_false-termination.i [2018-04-12 13:05:36,099 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_ftree_cnstr_true_valid_memsafety_false_termination_i____sigset_t in tree_cnstr_true-valid-memsafety_false-termination.i [2018-04-12 13:05:36,099 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_ftree_cnstr_true_valid_memsafety_false_termination_i____fsid_t in tree_cnstr_true-valid-memsafety_false-termination.i [2018-04-12 13:05:36,099 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_ftree_cnstr_true_valid_memsafety_false_termination_i__u_short in tree_cnstr_true-valid-memsafety_false-termination.i [2018-04-12 13:05:36,113 INFO L330 CDTParser]: Deleted temporary CDT project at /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/data/FLAGa1a8e3e43 [2018-04-12 13:05:36,117 INFO L304 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-04-12 13:05:36,118 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2018-04-12 13:05:36,118 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-04-12 13:05:36,118 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-04-12 13:05:36,122 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-04-12 13:05:36,123 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 12.04 01:05:36" (1/1) ... [2018-04-12 13:05:36,125 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@61a47180 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.04 01:05:36, skipping insertion in model container [2018-04-12 13:05:36,125 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 12.04 01:05:36" (1/1) ... [2018-04-12 13:05:36,137 INFO L167 Dispatcher]: Using SV-COMP mode [2018-04-12 13:05:36,160 INFO L167 Dispatcher]: Using SV-COMP mode [2018-04-12 13:05:36,302 INFO L175 PostProcessor]: Settings: Checked method=main [2018-04-12 13:05:36,336 INFO L175 PostProcessor]: Settings: Checked method=main [2018-04-12 13:05:36,342 INFO L100 SccComputation]: Graph consists of 0 InCaSumBalls and 110 non ball SCCs. Number of states in SCCs 110. [2018-04-12 13:05:36,376 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.04 01:05:36 WrapperNode [2018-04-12 13:05:36,376 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-04-12 13:05:36,377 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-04-12 13:05:36,377 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-04-12 13:05:36,377 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-04-12 13:05:36,389 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.04 01:05:36" (1/1) ... [2018-04-12 13:05:36,390 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.04 01:05:36" (1/1) ... [2018-04-12 13:05:36,403 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.04 01:05:36" (1/1) ... [2018-04-12 13:05:36,403 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.04 01:05:36" (1/1) ... [2018-04-12 13:05:36,411 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.04 01:05:36" (1/1) ... [2018-04-12 13:05:36,415 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.04 01:05:36" (1/1) ... [2018-04-12 13:05:36,417 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.04 01:05:36" (1/1) ... [2018-04-12 13:05:36,421 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-04-12 13:05:36,422 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-04-12 13:05:36,422 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-04-12 13:05:36,422 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-04-12 13:05:36,423 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.04 01:05:36" (1/1) ... No working directory specified, using /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-04-12 13:05:36,507 INFO L136 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-04-12 13:05:36,508 INFO L136 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-04-12 13:05:36,508 INFO L136 BoogieDeclarations]: Found implementation of procedure main [2018-04-12 13:05:36,508 INFO L128 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2018-04-12 13:05:36,508 INFO L128 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2018-04-12 13:05:36,508 INFO L128 BoogieDeclarations]: Found specification of procedure __ctype_get_mb_cur_max [2018-04-12 13:05:36,508 INFO L128 BoogieDeclarations]: Found specification of procedure atof [2018-04-12 13:05:36,508 INFO L128 BoogieDeclarations]: Found specification of procedure atoi [2018-04-12 13:05:36,508 INFO L128 BoogieDeclarations]: Found specification of procedure atol [2018-04-12 13:05:36,508 INFO L128 BoogieDeclarations]: Found specification of procedure atoll [2018-04-12 13:05:36,508 INFO L128 BoogieDeclarations]: Found specification of procedure strtod [2018-04-12 13:05:36,508 INFO L128 BoogieDeclarations]: Found specification of procedure strtof [2018-04-12 13:05:36,508 INFO L128 BoogieDeclarations]: Found specification of procedure strtold [2018-04-12 13:05:36,508 INFO L128 BoogieDeclarations]: Found specification of procedure strtol [2018-04-12 13:05:36,508 INFO L128 BoogieDeclarations]: Found specification of procedure strtoul [2018-04-12 13:05:36,509 INFO L128 BoogieDeclarations]: Found specification of procedure strtoq [2018-04-12 13:05:36,509 INFO L128 BoogieDeclarations]: Found specification of procedure strtouq [2018-04-12 13:05:36,509 INFO L128 BoogieDeclarations]: Found specification of procedure strtoll [2018-04-12 13:05:36,509 INFO L128 BoogieDeclarations]: Found specification of procedure strtoull [2018-04-12 13:05:36,509 INFO L128 BoogieDeclarations]: Found specification of procedure l64a [2018-04-12 13:05:36,509 INFO L128 BoogieDeclarations]: Found specification of procedure a64l [2018-04-12 13:05:36,509 INFO L128 BoogieDeclarations]: Found specification of procedure select [2018-04-12 13:05:36,509 INFO L128 BoogieDeclarations]: Found specification of procedure pselect [2018-04-12 13:05:36,509 INFO L128 BoogieDeclarations]: Found specification of procedure gnu_dev_major [2018-04-12 13:05:36,510 INFO L128 BoogieDeclarations]: Found specification of procedure gnu_dev_minor [2018-04-12 13:05:36,510 INFO L128 BoogieDeclarations]: Found specification of procedure gnu_dev_makedev [2018-04-12 13:05:36,510 INFO L128 BoogieDeclarations]: Found specification of procedure random [2018-04-12 13:05:36,510 INFO L128 BoogieDeclarations]: Found specification of procedure srandom [2018-04-12 13:05:36,510 INFO L128 BoogieDeclarations]: Found specification of procedure initstate [2018-04-12 13:05:36,510 INFO L128 BoogieDeclarations]: Found specification of procedure setstate [2018-04-12 13:05:36,510 INFO L128 BoogieDeclarations]: Found specification of procedure random_r [2018-04-12 13:05:36,510 INFO L128 BoogieDeclarations]: Found specification of procedure srandom_r [2018-04-12 13:05:36,510 INFO L128 BoogieDeclarations]: Found specification of procedure initstate_r [2018-04-12 13:05:36,510 INFO L128 BoogieDeclarations]: Found specification of procedure setstate_r [2018-04-12 13:05:36,511 INFO L128 BoogieDeclarations]: Found specification of procedure rand [2018-04-12 13:05:36,511 INFO L128 BoogieDeclarations]: Found specification of procedure srand [2018-04-12 13:05:36,511 INFO L128 BoogieDeclarations]: Found specification of procedure rand_r [2018-04-12 13:05:36,511 INFO L128 BoogieDeclarations]: Found specification of procedure drand48 [2018-04-12 13:05:36,511 INFO L128 BoogieDeclarations]: Found specification of procedure erand48 [2018-04-12 13:05:36,511 INFO L128 BoogieDeclarations]: Found specification of procedure lrand48 [2018-04-12 13:05:36,511 INFO L128 BoogieDeclarations]: Found specification of procedure nrand48 [2018-04-12 13:05:36,511 INFO L128 BoogieDeclarations]: Found specification of procedure mrand48 [2018-04-12 13:05:36,511 INFO L128 BoogieDeclarations]: Found specification of procedure jrand48 [2018-04-12 13:05:36,512 INFO L128 BoogieDeclarations]: Found specification of procedure srand48 [2018-04-12 13:05:36,512 INFO L128 BoogieDeclarations]: Found specification of procedure seed48 [2018-04-12 13:05:36,512 INFO L128 BoogieDeclarations]: Found specification of procedure lcong48 [2018-04-12 13:05:36,512 INFO L128 BoogieDeclarations]: Found specification of procedure drand48_r [2018-04-12 13:05:36,512 INFO L128 BoogieDeclarations]: Found specification of procedure erand48_r [2018-04-12 13:05:36,512 INFO L128 BoogieDeclarations]: Found specification of procedure lrand48_r [2018-04-12 13:05:36,512 INFO L128 BoogieDeclarations]: Found specification of procedure nrand48_r [2018-04-12 13:05:36,512 INFO L128 BoogieDeclarations]: Found specification of procedure mrand48_r [2018-04-12 13:05:36,512 INFO L128 BoogieDeclarations]: Found specification of procedure jrand48_r [2018-04-12 13:05:36,513 INFO L128 BoogieDeclarations]: Found specification of procedure srand48_r [2018-04-12 13:05:36,513 INFO L128 BoogieDeclarations]: Found specification of procedure seed48_r [2018-04-12 13:05:36,513 INFO L128 BoogieDeclarations]: Found specification of procedure lcong48_r [2018-04-12 13:05:36,513 INFO L128 BoogieDeclarations]: Found specification of procedure malloc [2018-04-12 13:05:36,513 INFO L128 BoogieDeclarations]: Found specification of procedure calloc [2018-04-12 13:05:36,513 INFO L128 BoogieDeclarations]: Found specification of procedure realloc [2018-04-12 13:05:36,513 INFO L128 BoogieDeclarations]: Found specification of procedure free [2018-04-12 13:05:36,513 INFO L128 BoogieDeclarations]: Found specification of procedure cfree [2018-04-12 13:05:36,513 INFO L128 BoogieDeclarations]: Found specification of procedure alloca [2018-04-12 13:05:36,513 INFO L128 BoogieDeclarations]: Found specification of procedure valloc [2018-04-12 13:05:36,514 INFO L128 BoogieDeclarations]: Found specification of procedure posix_memalign [2018-04-12 13:05:36,514 INFO L128 BoogieDeclarations]: Found specification of procedure abort [2018-04-12 13:05:36,514 INFO L128 BoogieDeclarations]: Found specification of procedure atexit [2018-04-12 13:05:36,514 INFO L128 BoogieDeclarations]: Found specification of procedure on_exit [2018-04-12 13:05:36,514 INFO L128 BoogieDeclarations]: Found specification of procedure exit [2018-04-12 13:05:36,514 INFO L128 BoogieDeclarations]: Found specification of procedure _Exit [2018-04-12 13:05:36,514 INFO L128 BoogieDeclarations]: Found specification of procedure getenv [2018-04-12 13:05:36,514 INFO L128 BoogieDeclarations]: Found specification of procedure __secure_getenv [2018-04-12 13:05:36,514 INFO L128 BoogieDeclarations]: Found specification of procedure putenv [2018-04-12 13:05:36,515 INFO L128 BoogieDeclarations]: Found specification of procedure setenv [2018-04-12 13:05:36,515 INFO L128 BoogieDeclarations]: Found specification of procedure unsetenv [2018-04-12 13:05:36,515 INFO L128 BoogieDeclarations]: Found specification of procedure clearenv [2018-04-12 13:05:36,515 INFO L128 BoogieDeclarations]: Found specification of procedure mktemp [2018-04-12 13:05:36,515 INFO L128 BoogieDeclarations]: Found specification of procedure mkstemp [2018-04-12 13:05:36,515 INFO L128 BoogieDeclarations]: Found specification of procedure mkstemps [2018-04-12 13:05:36,515 INFO L128 BoogieDeclarations]: Found specification of procedure mkdtemp [2018-04-12 13:05:36,515 INFO L128 BoogieDeclarations]: Found specification of procedure system [2018-04-12 13:05:36,515 INFO L128 BoogieDeclarations]: Found specification of procedure realpath [2018-04-12 13:05:36,515 INFO L128 BoogieDeclarations]: Found specification of procedure bsearch [2018-04-12 13:05:36,516 INFO L128 BoogieDeclarations]: Found specification of procedure qsort [2018-04-12 13:05:36,516 INFO L128 BoogieDeclarations]: Found specification of procedure abs [2018-04-12 13:05:36,516 INFO L128 BoogieDeclarations]: Found specification of procedure labs [2018-04-12 13:05:36,516 INFO L128 BoogieDeclarations]: Found specification of procedure llabs [2018-04-12 13:05:36,516 INFO L128 BoogieDeclarations]: Found specification of procedure div [2018-04-12 13:05:36,516 INFO L128 BoogieDeclarations]: Found specification of procedure ldiv [2018-04-12 13:05:36,516 INFO L128 BoogieDeclarations]: Found specification of procedure lldiv [2018-04-12 13:05:36,516 INFO L128 BoogieDeclarations]: Found specification of procedure ecvt [2018-04-12 13:05:36,516 INFO L128 BoogieDeclarations]: Found specification of procedure fcvt [2018-04-12 13:05:36,516 INFO L128 BoogieDeclarations]: Found specification of procedure gcvt [2018-04-12 13:05:36,517 INFO L128 BoogieDeclarations]: Found specification of procedure qecvt [2018-04-12 13:05:36,517 INFO L128 BoogieDeclarations]: Found specification of procedure qfcvt [2018-04-12 13:05:36,517 INFO L128 BoogieDeclarations]: Found specification of procedure qgcvt [2018-04-12 13:05:36,517 INFO L128 BoogieDeclarations]: Found specification of procedure ecvt_r [2018-04-12 13:05:36,517 INFO L128 BoogieDeclarations]: Found specification of procedure fcvt_r [2018-04-12 13:05:36,517 INFO L128 BoogieDeclarations]: Found specification of procedure qecvt_r [2018-04-12 13:05:36,517 INFO L128 BoogieDeclarations]: Found specification of procedure qfcvt_r [2018-04-12 13:05:36,517 INFO L128 BoogieDeclarations]: Found specification of procedure mblen [2018-04-12 13:05:36,517 INFO L128 BoogieDeclarations]: Found specification of procedure mbtowc [2018-04-12 13:05:36,517 INFO L128 BoogieDeclarations]: Found specification of procedure wctomb [2018-04-12 13:05:36,518 INFO L128 BoogieDeclarations]: Found specification of procedure mbstowcs [2018-04-12 13:05:36,518 INFO L128 BoogieDeclarations]: Found specification of procedure wcstombs [2018-04-12 13:05:36,518 INFO L128 BoogieDeclarations]: Found specification of procedure rpmatch [2018-04-12 13:05:36,518 INFO L128 BoogieDeclarations]: Found specification of procedure getsubopt [2018-04-12 13:05:36,518 INFO L128 BoogieDeclarations]: Found specification of procedure getloadavg [2018-04-12 13:05:36,518 INFO L128 BoogieDeclarations]: Found specification of procedure main [2018-04-12 13:05:36,518 INFO L128 BoogieDeclarations]: Found specification of procedure #Ultimate.alloc [2018-04-12 13:05:36,518 INFO L128 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2018-04-12 13:05:36,518 INFO L128 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2018-04-12 13:05:36,518 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2018-04-12 13:05:36,519 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-04-12 13:05:36,519 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-04-12 13:05:36,915 INFO L259 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-04-12 13:05:36,916 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.04 01:05:36 BoogieIcfgContainer [2018-04-12 13:05:36,916 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-04-12 13:05:36,916 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-04-12 13:05:36,917 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-04-12 13:05:36,919 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-04-12 13:05:36,919 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 12.04 01:05:36" (1/3) ... [2018-04-12 13:05:36,920 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@14090cec and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 12.04 01:05:36, skipping insertion in model container [2018-04-12 13:05:36,920 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.04 01:05:36" (2/3) ... [2018-04-12 13:05:36,920 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@14090cec and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 12.04 01:05:36, skipping insertion in model container [2018-04-12 13:05:36,920 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.04 01:05:36" (3/3) ... [2018-04-12 13:05:36,921 INFO L107 eAbstractionObserver]: Analyzing ICFG tree_cnstr_true-valid-memsafety_false-termination.i [2018-04-12 13:05:36,928 INFO L131 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-04-12 13:05:36,935 INFO L143 ceAbstractionStarter]: Appying trace abstraction to program that has 55 error locations. [2018-04-12 13:05:36,966 INFO L128 ementStrategyFactory]: Using default assertion order modulation [2018-04-12 13:05:36,967 INFO L369 AbstractCegarLoop]: Interprodecural is true [2018-04-12 13:05:36,967 INFO L370 AbstractCegarLoop]: Hoare is false [2018-04-12 13:05:36,967 INFO L371 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-04-12 13:05:36,967 INFO L372 AbstractCegarLoop]: Backedges is TWOTRACK [2018-04-12 13:05:36,967 INFO L373 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-04-12 13:05:36,967 INFO L374 AbstractCegarLoop]: Difference is false [2018-04-12 13:05:36,967 INFO L375 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-04-12 13:05:36,967 INFO L380 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-04-12 13:05:36,968 INFO L87 2NestedWordAutomaton]: Mode: main mode - execution starts in main procedure [2018-04-12 13:05:36,979 INFO L276 IsEmpty]: Start isEmpty. Operand 132 states. [2018-04-12 13:05:36,985 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2018-04-12 13:05:36,985 INFO L347 BasicCegarLoop]: Found error trace [2018-04-12 13:05:36,985 INFO L355 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2018-04-12 13:05:36,985 INFO L408 AbstractCegarLoop]: === Iteration 1 === [mainErr51RequiresViolation, mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr31RequiresViolation, mainErr46RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr52AssertViolationMEMORY_FREE, mainErr15RequiresViolation, mainErr49RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr17RequiresViolation, mainErr42RequiresViolation, mainErr30RequiresViolation, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr44RequiresViolation, mainErr10RequiresViolation, mainErr43RequiresViolation, mainErr4RequiresViolation, mainErr50RequiresViolation, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr48RequiresViolation, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr45RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr54EnsuresViolationMEMORY_LEAK, mainErr9RequiresViolation, mainErr53AssertViolationMEMORY_FREE, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr34RequiresViolation, mainErr47RequiresViolation, mainErr14RequiresViolation, mainErr40RequiresViolation]=== [2018-04-12 13:05:36,988 INFO L82 PathProgramCache]: Analyzing trace with hash 534396452, now seen corresponding path program 1 times [2018-04-12 13:05:36,989 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-04-12 13:05:36,990 INFO L68 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-04-12 13:05:37,023 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-12 13:05:37,023 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-12 13:05:37,023 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-12 13:05:37,049 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-12 13:05:37,056 WARN L250 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-12 13:05:37,104 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-12 13:05:37,106 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-04-12 13:05:37,106 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-04-12 13:05:37,107 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-04-12 13:05:37,115 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-04-12 13:05:37,115 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-04-12 13:05:37,116 INFO L87 Difference]: Start difference. First operand 132 states. Second operand 4 states. [2018-04-12 13:05:37,282 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-12 13:05:37,282 INFO L93 Difference]: Finished difference Result 180 states and 199 transitions. [2018-04-12 13:05:37,283 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-04-12 13:05:37,284 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 8 [2018-04-12 13:05:37,284 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-12 13:05:37,293 INFO L225 Difference]: With dead ends: 180 [2018-04-12 13:05:37,293 INFO L226 Difference]: Without dead ends: 176 [2018-04-12 13:05:37,295 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-04-12 13:05:37,309 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 176 states. [2018-04-12 13:05:37,324 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 176 to 127. [2018-04-12 13:05:37,325 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 127 states. [2018-04-12 13:05:37,327 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 127 states to 127 states and 140 transitions. [2018-04-12 13:05:37,328 INFO L78 Accepts]: Start accepts. Automaton has 127 states and 140 transitions. Word has length 8 [2018-04-12 13:05:37,329 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-12 13:05:37,329 INFO L459 AbstractCegarLoop]: Abstraction has 127 states and 140 transitions. [2018-04-12 13:05:37,329 INFO L460 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-04-12 13:05:37,329 INFO L276 IsEmpty]: Start isEmpty. Operand 127 states and 140 transitions. [2018-04-12 13:05:37,330 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2018-04-12 13:05:37,330 INFO L347 BasicCegarLoop]: Found error trace [2018-04-12 13:05:37,330 INFO L355 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2018-04-12 13:05:37,330 INFO L408 AbstractCegarLoop]: === Iteration 2 === [mainErr51RequiresViolation, mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr31RequiresViolation, mainErr46RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr52AssertViolationMEMORY_FREE, mainErr15RequiresViolation, mainErr49RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr17RequiresViolation, mainErr42RequiresViolation, mainErr30RequiresViolation, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr44RequiresViolation, mainErr10RequiresViolation, mainErr43RequiresViolation, mainErr4RequiresViolation, mainErr50RequiresViolation, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr48RequiresViolation, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr45RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr54EnsuresViolationMEMORY_LEAK, mainErr9RequiresViolation, mainErr53AssertViolationMEMORY_FREE, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr34RequiresViolation, mainErr47RequiresViolation, mainErr14RequiresViolation, mainErr40RequiresViolation]=== [2018-04-12 13:05:37,330 INFO L82 PathProgramCache]: Analyzing trace with hash 534396453, now seen corresponding path program 1 times [2018-04-12 13:05:37,330 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-04-12 13:05:37,330 INFO L68 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-04-12 13:05:37,331 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-12 13:05:37,331 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-12 13:05:37,331 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-12 13:05:37,341 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-12 13:05:37,342 WARN L250 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-12 13:05:37,370 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-12 13:05:37,370 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-04-12 13:05:37,370 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-04-12 13:05:37,371 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-04-12 13:05:37,371 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-04-12 13:05:37,371 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-04-12 13:05:37,372 INFO L87 Difference]: Start difference. First operand 127 states and 140 transitions. Second operand 4 states. [2018-04-12 13:05:37,496 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-12 13:05:37,497 INFO L93 Difference]: Finished difference Result 169 states and 187 transitions. [2018-04-12 13:05:37,497 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-04-12 13:05:37,497 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 8 [2018-04-12 13:05:37,497 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-12 13:05:37,500 INFO L225 Difference]: With dead ends: 169 [2018-04-12 13:05:37,500 INFO L226 Difference]: Without dead ends: 169 [2018-04-12 13:05:37,501 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-04-12 13:05:37,501 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 169 states. [2018-04-12 13:05:37,507 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 169 to 125. [2018-04-12 13:05:37,507 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 125 states. [2018-04-12 13:05:37,509 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 125 states to 125 states and 138 transitions. [2018-04-12 13:05:37,509 INFO L78 Accepts]: Start accepts. Automaton has 125 states and 138 transitions. Word has length 8 [2018-04-12 13:05:37,509 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-12 13:05:37,509 INFO L459 AbstractCegarLoop]: Abstraction has 125 states and 138 transitions. [2018-04-12 13:05:37,509 INFO L460 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-04-12 13:05:37,509 INFO L276 IsEmpty]: Start isEmpty. Operand 125 states and 138 transitions. [2018-04-12 13:05:37,510 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2018-04-12 13:05:37,510 INFO L347 BasicCegarLoop]: Found error trace [2018-04-12 13:05:37,510 INFO L355 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-12 13:05:37,510 INFO L408 AbstractCegarLoop]: === Iteration 3 === [mainErr51RequiresViolation, mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr31RequiresViolation, mainErr46RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr52AssertViolationMEMORY_FREE, mainErr15RequiresViolation, mainErr49RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr17RequiresViolation, mainErr42RequiresViolation, mainErr30RequiresViolation, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr44RequiresViolation, mainErr10RequiresViolation, mainErr43RequiresViolation, mainErr4RequiresViolation, mainErr50RequiresViolation, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr48RequiresViolation, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr45RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr54EnsuresViolationMEMORY_LEAK, mainErr9RequiresViolation, mainErr53AssertViolationMEMORY_FREE, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr34RequiresViolation, mainErr47RequiresViolation, mainErr14RequiresViolation, mainErr40RequiresViolation]=== [2018-04-12 13:05:37,510 INFO L82 PathProgramCache]: Analyzing trace with hash 1591612785, now seen corresponding path program 1 times [2018-04-12 13:05:37,510 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-04-12 13:05:37,511 INFO L68 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-04-12 13:05:37,511 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-12 13:05:37,511 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-12 13:05:37,512 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-12 13:05:37,521 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-12 13:05:37,522 WARN L250 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-12 13:05:37,540 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-12 13:05:37,541 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-04-12 13:05:37,541 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-04-12 13:05:37,541 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-04-12 13:05:37,541 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-04-12 13:05:37,541 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-04-12 13:05:37,542 INFO L87 Difference]: Start difference. First operand 125 states and 138 transitions. Second operand 4 states. [2018-04-12 13:05:37,652 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-12 13:05:37,652 INFO L93 Difference]: Finished difference Result 158 states and 177 transitions. [2018-04-12 13:05:37,652 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-04-12 13:05:37,652 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 14 [2018-04-12 13:05:37,653 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-12 13:05:37,654 INFO L225 Difference]: With dead ends: 158 [2018-04-12 13:05:37,654 INFO L226 Difference]: Without dead ends: 158 [2018-04-12 13:05:37,654 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-04-12 13:05:37,654 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 158 states. [2018-04-12 13:05:37,658 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 158 to 115. [2018-04-12 13:05:37,658 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 115 states. [2018-04-12 13:05:37,659 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 115 states to 115 states and 131 transitions. [2018-04-12 13:05:37,659 INFO L78 Accepts]: Start accepts. Automaton has 115 states and 131 transitions. Word has length 14 [2018-04-12 13:05:37,659 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-12 13:05:37,659 INFO L459 AbstractCegarLoop]: Abstraction has 115 states and 131 transitions. [2018-04-12 13:05:37,660 INFO L460 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-04-12 13:05:37,660 INFO L276 IsEmpty]: Start isEmpty. Operand 115 states and 131 transitions. [2018-04-12 13:05:37,660 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2018-04-12 13:05:37,660 INFO L347 BasicCegarLoop]: Found error trace [2018-04-12 13:05:37,660 INFO L355 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-12 13:05:37,660 INFO L408 AbstractCegarLoop]: === Iteration 4 === [mainErr51RequiresViolation, mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr31RequiresViolation, mainErr46RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr52AssertViolationMEMORY_FREE, mainErr15RequiresViolation, mainErr49RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr17RequiresViolation, mainErr42RequiresViolation, mainErr30RequiresViolation, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr44RequiresViolation, mainErr10RequiresViolation, mainErr43RequiresViolation, mainErr4RequiresViolation, mainErr50RequiresViolation, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr48RequiresViolation, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr45RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr54EnsuresViolationMEMORY_LEAK, mainErr9RequiresViolation, mainErr53AssertViolationMEMORY_FREE, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr34RequiresViolation, mainErr47RequiresViolation, mainErr14RequiresViolation, mainErr40RequiresViolation]=== [2018-04-12 13:05:37,660 INFO L82 PathProgramCache]: Analyzing trace with hash 1591612786, now seen corresponding path program 1 times [2018-04-12 13:05:37,660 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-04-12 13:05:37,660 INFO L68 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-04-12 13:05:37,661 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-12 13:05:37,661 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-12 13:05:37,661 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-12 13:05:37,669 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-12 13:05:37,670 WARN L250 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-12 13:05:37,701 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-12 13:05:37,701 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-04-12 13:05:37,701 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-04-12 13:05:37,702 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-04-12 13:05:37,702 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-04-12 13:05:37,702 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-04-12 13:05:37,702 INFO L87 Difference]: Start difference. First operand 115 states and 131 transitions. Second operand 5 states. [2018-04-12 13:05:37,914 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-12 13:05:37,914 INFO L93 Difference]: Finished difference Result 241 states and 273 transitions. [2018-04-12 13:05:37,914 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-04-12 13:05:37,914 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 14 [2018-04-12 13:05:37,914 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-12 13:05:37,915 INFO L225 Difference]: With dead ends: 241 [2018-04-12 13:05:37,915 INFO L226 Difference]: Without dead ends: 241 [2018-04-12 13:05:37,915 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2018-04-12 13:05:37,916 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 241 states. [2018-04-12 13:05:37,920 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 241 to 186. [2018-04-12 13:05:37,920 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 186 states. [2018-04-12 13:05:37,920 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 186 states to 186 states and 244 transitions. [2018-04-12 13:05:37,921 INFO L78 Accepts]: Start accepts. Automaton has 186 states and 244 transitions. Word has length 14 [2018-04-12 13:05:37,921 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-12 13:05:37,921 INFO L459 AbstractCegarLoop]: Abstraction has 186 states and 244 transitions. [2018-04-12 13:05:37,921 INFO L460 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-04-12 13:05:37,921 INFO L276 IsEmpty]: Start isEmpty. Operand 186 states and 244 transitions. [2018-04-12 13:05:37,921 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2018-04-12 13:05:37,921 INFO L347 BasicCegarLoop]: Found error trace [2018-04-12 13:05:37,921 INFO L355 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-12 13:05:37,921 INFO L408 AbstractCegarLoop]: === Iteration 5 === [mainErr51RequiresViolation, mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr31RequiresViolation, mainErr46RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr52AssertViolationMEMORY_FREE, mainErr15RequiresViolation, mainErr49RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr17RequiresViolation, mainErr42RequiresViolation, mainErr30RequiresViolation, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr44RequiresViolation, mainErr10RequiresViolation, mainErr43RequiresViolation, mainErr4RequiresViolation, mainErr50RequiresViolation, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr48RequiresViolation, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr45RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr54EnsuresViolationMEMORY_LEAK, mainErr9RequiresViolation, mainErr53AssertViolationMEMORY_FREE, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr34RequiresViolation, mainErr47RequiresViolation, mainErr14RequiresViolation, mainErr40RequiresViolation]=== [2018-04-12 13:05:37,921 INFO L82 PathProgramCache]: Analyzing trace with hash -655644961, now seen corresponding path program 1 times [2018-04-12 13:05:37,921 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-04-12 13:05:37,921 INFO L68 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-04-12 13:05:37,922 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-12 13:05:37,922 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-12 13:05:37,922 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-12 13:05:37,927 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-12 13:05:37,927 WARN L250 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-12 13:05:37,939 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-12 13:05:37,939 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-04-12 13:05:37,939 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-04-12 13:05:37,940 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-04-12 13:05:37,940 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-04-12 13:05:37,940 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-04-12 13:05:37,940 INFO L87 Difference]: Start difference. First operand 186 states and 244 transitions. Second operand 4 states. [2018-04-12 13:05:37,957 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-12 13:05:37,957 INFO L93 Difference]: Finished difference Result 199 states and 242 transitions. [2018-04-12 13:05:37,971 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-04-12 13:05:37,971 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 17 [2018-04-12 13:05:37,971 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-12 13:05:37,972 INFO L225 Difference]: With dead ends: 199 [2018-04-12 13:05:37,972 INFO L226 Difference]: Without dead ends: 199 [2018-04-12 13:05:37,973 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-04-12 13:05:37,973 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 199 states. [2018-04-12 13:05:37,979 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 199 to 186. [2018-04-12 13:05:37,979 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 186 states. [2018-04-12 13:05:37,980 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 186 states to 186 states and 242 transitions. [2018-04-12 13:05:37,980 INFO L78 Accepts]: Start accepts. Automaton has 186 states and 242 transitions. Word has length 17 [2018-04-12 13:05:37,980 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-12 13:05:37,981 INFO L459 AbstractCegarLoop]: Abstraction has 186 states and 242 transitions. [2018-04-12 13:05:37,981 INFO L460 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-04-12 13:05:37,981 INFO L276 IsEmpty]: Start isEmpty. Operand 186 states and 242 transitions. [2018-04-12 13:05:37,981 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2018-04-12 13:05:37,981 INFO L347 BasicCegarLoop]: Found error trace [2018-04-12 13:05:37,982 INFO L355 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-12 13:05:37,982 INFO L408 AbstractCegarLoop]: === Iteration 6 === [mainErr51RequiresViolation, mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr31RequiresViolation, mainErr46RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr52AssertViolationMEMORY_FREE, mainErr15RequiresViolation, mainErr49RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr17RequiresViolation, mainErr42RequiresViolation, mainErr30RequiresViolation, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr44RequiresViolation, mainErr10RequiresViolation, mainErr43RequiresViolation, mainErr4RequiresViolation, mainErr50RequiresViolation, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr48RequiresViolation, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr45RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr54EnsuresViolationMEMORY_LEAK, mainErr9RequiresViolation, mainErr53AssertViolationMEMORY_FREE, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr34RequiresViolation, mainErr47RequiresViolation, mainErr14RequiresViolation, mainErr40RequiresViolation]=== [2018-04-12 13:05:37,982 INFO L82 PathProgramCache]: Analyzing trace with hash -1393122237, now seen corresponding path program 1 times [2018-04-12 13:05:37,982 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-04-12 13:05:37,982 INFO L68 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-04-12 13:05:37,983 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-12 13:05:37,983 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-12 13:05:37,983 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-12 13:05:37,993 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-12 13:05:37,994 WARN L250 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-12 13:05:38,011 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-12 13:05:38,011 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-04-12 13:05:38,011 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-04-12 13:05:38,011 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-04-12 13:05:38,011 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-04-12 13:05:38,012 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-04-12 13:05:38,012 INFO L87 Difference]: Start difference. First operand 186 states and 242 transitions. Second operand 3 states. [2018-04-12 13:05:38,018 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-12 13:05:38,018 INFO L93 Difference]: Finished difference Result 189 states and 245 transitions. [2018-04-12 13:05:38,019 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-04-12 13:05:38,019 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 22 [2018-04-12 13:05:38,019 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-12 13:05:38,020 INFO L225 Difference]: With dead ends: 189 [2018-04-12 13:05:38,020 INFO L226 Difference]: Without dead ends: 189 [2018-04-12 13:05:38,020 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-04-12 13:05:38,020 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 189 states. [2018-04-12 13:05:38,024 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 189 to 189. [2018-04-12 13:05:38,024 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 189 states. [2018-04-12 13:05:38,025 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 189 states to 189 states and 245 transitions. [2018-04-12 13:05:38,026 INFO L78 Accepts]: Start accepts. Automaton has 189 states and 245 transitions. Word has length 22 [2018-04-12 13:05:38,026 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-12 13:05:38,026 INFO L459 AbstractCegarLoop]: Abstraction has 189 states and 245 transitions. [2018-04-12 13:05:38,026 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-04-12 13:05:38,026 INFO L276 IsEmpty]: Start isEmpty. Operand 189 states and 245 transitions. [2018-04-12 13:05:38,026 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2018-04-12 13:05:38,027 INFO L347 BasicCegarLoop]: Found error trace [2018-04-12 13:05:38,027 INFO L355 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-12 13:05:38,027 INFO L408 AbstractCegarLoop]: === Iteration 7 === [mainErr51RequiresViolation, mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr31RequiresViolation, mainErr46RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr52AssertViolationMEMORY_FREE, mainErr15RequiresViolation, mainErr49RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr17RequiresViolation, mainErr42RequiresViolation, mainErr30RequiresViolation, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr44RequiresViolation, mainErr10RequiresViolation, mainErr43RequiresViolation, mainErr4RequiresViolation, mainErr50RequiresViolation, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr48RequiresViolation, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr45RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr54EnsuresViolationMEMORY_LEAK, mainErr9RequiresViolation, mainErr53AssertViolationMEMORY_FREE, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr34RequiresViolation, mainErr47RequiresViolation, mainErr14RequiresViolation, mainErr40RequiresViolation]=== [2018-04-12 13:05:38,027 INFO L82 PathProgramCache]: Analyzing trace with hash 145884264, now seen corresponding path program 1 times [2018-04-12 13:05:38,027 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-04-12 13:05:38,027 INFO L68 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-04-12 13:05:38,028 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-12 13:05:38,028 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-12 13:05:38,028 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-12 13:05:38,036 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-12 13:05:38,036 WARN L250 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-12 13:05:38,047 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-12 13:05:38,047 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-04-12 13:05:38,048 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-04-12 13:05:38,048 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-04-12 13:05:38,048 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-04-12 13:05:38,048 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-04-12 13:05:38,048 INFO L87 Difference]: Start difference. First operand 189 states and 245 transitions. Second operand 3 states. [2018-04-12 13:05:38,053 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-12 13:05:38,053 INFO L93 Difference]: Finished difference Result 191 states and 247 transitions. [2018-04-12 13:05:38,055 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-04-12 13:05:38,055 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 22 [2018-04-12 13:05:38,055 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-12 13:05:38,056 INFO L225 Difference]: With dead ends: 191 [2018-04-12 13:05:38,056 INFO L226 Difference]: Without dead ends: 191 [2018-04-12 13:05:38,056 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-04-12 13:05:38,056 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 191 states. [2018-04-12 13:05:38,060 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 191 to 191. [2018-04-12 13:05:38,060 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 191 states. [2018-04-12 13:05:38,061 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 191 states to 191 states and 247 transitions. [2018-04-12 13:05:38,061 INFO L78 Accepts]: Start accepts. Automaton has 191 states and 247 transitions. Word has length 22 [2018-04-12 13:05:38,061 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-12 13:05:38,062 INFO L459 AbstractCegarLoop]: Abstraction has 191 states and 247 transitions. [2018-04-12 13:05:38,062 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-04-12 13:05:38,062 INFO L276 IsEmpty]: Start isEmpty. Operand 191 states and 247 transitions. [2018-04-12 13:05:38,062 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2018-04-12 13:05:38,062 INFO L347 BasicCegarLoop]: Found error trace [2018-04-12 13:05:38,063 INFO L355 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-12 13:05:38,063 INFO L408 AbstractCegarLoop]: === Iteration 8 === [mainErr51RequiresViolation, mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr31RequiresViolation, mainErr46RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr52AssertViolationMEMORY_FREE, mainErr15RequiresViolation, mainErr49RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr17RequiresViolation, mainErr42RequiresViolation, mainErr30RequiresViolation, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr44RequiresViolation, mainErr10RequiresViolation, mainErr43RequiresViolation, mainErr4RequiresViolation, mainErr50RequiresViolation, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr48RequiresViolation, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr45RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr54EnsuresViolationMEMORY_LEAK, mainErr9RequiresViolation, mainErr53AssertViolationMEMORY_FREE, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr34RequiresViolation, mainErr47RequiresViolation, mainErr14RequiresViolation, mainErr40RequiresViolation]=== [2018-04-12 13:05:38,063 INFO L82 PathProgramCache]: Analyzing trace with hash 1289236446, now seen corresponding path program 1 times [2018-04-12 13:05:38,063 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-04-12 13:05:38,063 INFO L68 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-04-12 13:05:38,064 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-12 13:05:38,064 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-12 13:05:38,064 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-12 13:05:38,072 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-12 13:05:38,073 WARN L250 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-12 13:05:38,089 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-12 13:05:38,089 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-04-12 13:05:38,089 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-04-12 13:05:38,089 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-04-12 13:05:38,090 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-04-12 13:05:38,090 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-04-12 13:05:38,090 INFO L87 Difference]: Start difference. First operand 191 states and 247 transitions. Second operand 3 states. [2018-04-12 13:05:38,098 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-12 13:05:38,098 INFO L93 Difference]: Finished difference Result 207 states and 257 transitions. [2018-04-12 13:05:38,099 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-04-12 13:05:38,099 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 24 [2018-04-12 13:05:38,099 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-12 13:05:38,099 INFO L225 Difference]: With dead ends: 207 [2018-04-12 13:05:38,099 INFO L226 Difference]: Without dead ends: 207 [2018-04-12 13:05:38,100 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-04-12 13:05:38,100 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 207 states. [2018-04-12 13:05:38,102 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 207 to 194. [2018-04-12 13:05:38,102 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 194 states. [2018-04-12 13:05:38,103 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 194 states to 194 states and 247 transitions. [2018-04-12 13:05:38,103 INFO L78 Accepts]: Start accepts. Automaton has 194 states and 247 transitions. Word has length 24 [2018-04-12 13:05:38,103 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-12 13:05:38,103 INFO L459 AbstractCegarLoop]: Abstraction has 194 states and 247 transitions. [2018-04-12 13:05:38,103 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-04-12 13:05:38,103 INFO L276 IsEmpty]: Start isEmpty. Operand 194 states and 247 transitions. [2018-04-12 13:05:38,104 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2018-04-12 13:05:38,104 INFO L347 BasicCegarLoop]: Found error trace [2018-04-12 13:05:38,104 INFO L355 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-12 13:05:38,104 INFO L408 AbstractCegarLoop]: === Iteration 9 === [mainErr51RequiresViolation, mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr31RequiresViolation, mainErr46RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr52AssertViolationMEMORY_FREE, mainErr15RequiresViolation, mainErr49RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr17RequiresViolation, mainErr42RequiresViolation, mainErr30RequiresViolation, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr44RequiresViolation, mainErr10RequiresViolation, mainErr43RequiresViolation, mainErr4RequiresViolation, mainErr50RequiresViolation, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr48RequiresViolation, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr45RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr54EnsuresViolationMEMORY_LEAK, mainErr9RequiresViolation, mainErr53AssertViolationMEMORY_FREE, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr34RequiresViolation, mainErr47RequiresViolation, mainErr14RequiresViolation, mainErr40RequiresViolation]=== [2018-04-12 13:05:38,104 INFO L82 PathProgramCache]: Analyzing trace with hash 527848965, now seen corresponding path program 1 times [2018-04-12 13:05:38,105 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-04-12 13:05:38,105 INFO L68 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-04-12 13:05:38,105 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-12 13:05:38,105 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-12 13:05:38,106 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-12 13:05:38,117 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-12 13:05:38,118 WARN L250 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-12 13:05:38,165 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-12 13:05:38,166 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-04-12 13:05:38,166 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-04-12 13:05:38,166 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-04-12 13:05:38,166 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-04-12 13:05:38,166 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-04-12 13:05:38,166 INFO L87 Difference]: Start difference. First operand 194 states and 247 transitions. Second operand 6 states. [2018-04-12 13:05:38,322 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-12 13:05:38,322 INFO L93 Difference]: Finished difference Result 298 states and 366 transitions. [2018-04-12 13:05:38,322 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-04-12 13:05:38,322 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 24 [2018-04-12 13:05:38,323 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-12 13:05:38,323 INFO L225 Difference]: With dead ends: 298 [2018-04-12 13:05:38,323 INFO L226 Difference]: Without dead ends: 298 [2018-04-12 13:05:38,324 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 3 SyntacticMatches, 1 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2018-04-12 13:05:38,324 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 298 states. [2018-04-12 13:05:38,327 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 298 to 210. [2018-04-12 13:05:38,327 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 210 states. [2018-04-12 13:05:38,328 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 210 states to 210 states and 268 transitions. [2018-04-12 13:05:38,329 INFO L78 Accepts]: Start accepts. Automaton has 210 states and 268 transitions. Word has length 24 [2018-04-12 13:05:38,329 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-12 13:05:38,329 INFO L459 AbstractCegarLoop]: Abstraction has 210 states and 268 transitions. [2018-04-12 13:05:38,329 INFO L460 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-04-12 13:05:38,329 INFO L276 IsEmpty]: Start isEmpty. Operand 210 states and 268 transitions. [2018-04-12 13:05:38,330 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2018-04-12 13:05:38,330 INFO L347 BasicCegarLoop]: Found error trace [2018-04-12 13:05:38,330 INFO L355 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-12 13:05:38,330 INFO L408 AbstractCegarLoop]: === Iteration 10 === [mainErr51RequiresViolation, mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr31RequiresViolation, mainErr46RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr52AssertViolationMEMORY_FREE, mainErr15RequiresViolation, mainErr49RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr17RequiresViolation, mainErr42RequiresViolation, mainErr30RequiresViolation, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr44RequiresViolation, mainErr10RequiresViolation, mainErr43RequiresViolation, mainErr4RequiresViolation, mainErr50RequiresViolation, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr48RequiresViolation, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr45RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr54EnsuresViolationMEMORY_LEAK, mainErr9RequiresViolation, mainErr53AssertViolationMEMORY_FREE, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr34RequiresViolation, mainErr47RequiresViolation, mainErr14RequiresViolation, mainErr40RequiresViolation]=== [2018-04-12 13:05:38,330 INFO L82 PathProgramCache]: Analyzing trace with hash -1108221121, now seen corresponding path program 1 times [2018-04-12 13:05:38,330 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-04-12 13:05:38,330 INFO L68 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-04-12 13:05:38,331 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-12 13:05:38,331 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-12 13:05:38,331 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-12 13:05:38,340 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-12 13:05:38,340 WARN L250 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-12 13:05:38,369 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-12 13:05:38,369 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-04-12 13:05:38,369 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-04-12 13:05:38,370 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-04-12 13:05:38,370 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-04-12 13:05:38,370 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-04-12 13:05:38,370 INFO L87 Difference]: Start difference. First operand 210 states and 268 transitions. Second operand 5 states. [2018-04-12 13:05:38,559 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-12 13:05:38,559 INFO L93 Difference]: Finished difference Result 337 states and 420 transitions. [2018-04-12 13:05:38,559 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-04-12 13:05:38,559 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 25 [2018-04-12 13:05:38,559 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-12 13:05:38,560 INFO L225 Difference]: With dead ends: 337 [2018-04-12 13:05:38,560 INFO L226 Difference]: Without dead ends: 337 [2018-04-12 13:05:38,561 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2018-04-12 13:05:38,561 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 337 states. [2018-04-12 13:05:38,563 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 337 to 209. [2018-04-12 13:05:38,564 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 209 states. [2018-04-12 13:05:38,565 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 209 states to 209 states and 266 transitions. [2018-04-12 13:05:38,565 INFO L78 Accepts]: Start accepts. Automaton has 209 states and 266 transitions. Word has length 25 [2018-04-12 13:05:38,565 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-12 13:05:38,565 INFO L459 AbstractCegarLoop]: Abstraction has 209 states and 266 transitions. [2018-04-12 13:05:38,565 INFO L460 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-04-12 13:05:38,565 INFO L276 IsEmpty]: Start isEmpty. Operand 209 states and 266 transitions. [2018-04-12 13:05:38,566 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2018-04-12 13:05:38,566 INFO L347 BasicCegarLoop]: Found error trace [2018-04-12 13:05:38,566 INFO L355 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-12 13:05:38,566 INFO L408 AbstractCegarLoop]: === Iteration 11 === [mainErr51RequiresViolation, mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr31RequiresViolation, mainErr46RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr52AssertViolationMEMORY_FREE, mainErr15RequiresViolation, mainErr49RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr17RequiresViolation, mainErr42RequiresViolation, mainErr30RequiresViolation, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr44RequiresViolation, mainErr10RequiresViolation, mainErr43RequiresViolation, mainErr4RequiresViolation, mainErr50RequiresViolation, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr48RequiresViolation, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr45RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr54EnsuresViolationMEMORY_LEAK, mainErr9RequiresViolation, mainErr53AssertViolationMEMORY_FREE, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr34RequiresViolation, mainErr47RequiresViolation, mainErr14RequiresViolation, mainErr40RequiresViolation]=== [2018-04-12 13:05:38,567 INFO L82 PathProgramCache]: Analyzing trace with hash -1108221120, now seen corresponding path program 1 times [2018-04-12 13:05:38,567 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-04-12 13:05:38,567 INFO L68 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-04-12 13:05:38,568 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-12 13:05:38,568 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-12 13:05:38,568 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-12 13:05:38,577 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-12 13:05:38,577 WARN L250 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-12 13:05:38,619 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-12 13:05:38,619 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-04-12 13:05:38,619 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-04-12 13:05:38,619 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-04-12 13:05:38,620 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-04-12 13:05:38,620 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-04-12 13:05:38,620 INFO L87 Difference]: Start difference. First operand 209 states and 266 transitions. Second operand 5 states. [2018-04-12 13:05:38,815 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-12 13:05:38,815 INFO L93 Difference]: Finished difference Result 372 states and 477 transitions. [2018-04-12 13:05:38,815 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-04-12 13:05:38,815 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 25 [2018-04-12 13:05:38,815 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-12 13:05:38,816 INFO L225 Difference]: With dead ends: 372 [2018-04-12 13:05:38,816 INFO L226 Difference]: Without dead ends: 372 [2018-04-12 13:05:38,816 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2018-04-12 13:05:38,817 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 372 states. [2018-04-12 13:05:38,819 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 372 to 208. [2018-04-12 13:05:38,819 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 208 states. [2018-04-12 13:05:38,820 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 208 states to 208 states and 264 transitions. [2018-04-12 13:05:38,820 INFO L78 Accepts]: Start accepts. Automaton has 208 states and 264 transitions. Word has length 25 [2018-04-12 13:05:38,820 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-12 13:05:38,820 INFO L459 AbstractCegarLoop]: Abstraction has 208 states and 264 transitions. [2018-04-12 13:05:38,820 INFO L460 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-04-12 13:05:38,820 INFO L276 IsEmpty]: Start isEmpty. Operand 208 states and 264 transitions. [2018-04-12 13:05:38,821 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2018-04-12 13:05:38,821 INFO L347 BasicCegarLoop]: Found error trace [2018-04-12 13:05:38,821 INFO L355 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-12 13:05:38,821 INFO L408 AbstractCegarLoop]: === Iteration 12 === [mainErr51RequiresViolation, mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr31RequiresViolation, mainErr46RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr52AssertViolationMEMORY_FREE, mainErr15RequiresViolation, mainErr49RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr17RequiresViolation, mainErr42RequiresViolation, mainErr30RequiresViolation, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr44RequiresViolation, mainErr10RequiresViolation, mainErr43RequiresViolation, mainErr4RequiresViolation, mainErr50RequiresViolation, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr48RequiresViolation, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr45RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr54EnsuresViolationMEMORY_LEAK, mainErr9RequiresViolation, mainErr53AssertViolationMEMORY_FREE, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr34RequiresViolation, mainErr47RequiresViolation, mainErr14RequiresViolation, mainErr40RequiresViolation]=== [2018-04-12 13:05:38,821 INFO L82 PathProgramCache]: Analyzing trace with hash -1869347276, now seen corresponding path program 1 times [2018-04-12 13:05:38,821 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-04-12 13:05:38,821 INFO L68 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-04-12 13:05:38,822 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-12 13:05:38,822 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-12 13:05:38,822 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-12 13:05:38,828 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-12 13:05:38,829 WARN L250 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-12 13:05:38,868 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-12 13:05:38,869 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-04-12 13:05:38,869 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-04-12 13:05:38,869 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-04-12 13:05:38,869 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-04-12 13:05:38,869 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2018-04-12 13:05:38,870 INFO L87 Difference]: Start difference. First operand 208 states and 264 transitions. Second operand 6 states. [2018-04-12 13:05:39,022 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-12 13:05:39,023 INFO L93 Difference]: Finished difference Result 221 states and 279 transitions. [2018-04-12 13:05:39,023 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-04-12 13:05:39,023 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 26 [2018-04-12 13:05:39,023 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-12 13:05:39,024 INFO L225 Difference]: With dead ends: 221 [2018-04-12 13:05:39,024 INFO L226 Difference]: Without dead ends: 221 [2018-04-12 13:05:39,025 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=25, Invalid=47, Unknown=0, NotChecked=0, Total=72 [2018-04-12 13:05:39,025 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 221 states. [2018-04-12 13:05:39,028 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 221 to 214. [2018-04-12 13:05:39,028 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 214 states. [2018-04-12 13:05:39,029 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 214 states to 214 states and 272 transitions. [2018-04-12 13:05:39,029 INFO L78 Accepts]: Start accepts. Automaton has 214 states and 272 transitions. Word has length 26 [2018-04-12 13:05:39,029 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-12 13:05:39,029 INFO L459 AbstractCegarLoop]: Abstraction has 214 states and 272 transitions. [2018-04-12 13:05:39,029 INFO L460 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-04-12 13:05:39,030 INFO L276 IsEmpty]: Start isEmpty. Operand 214 states and 272 transitions. [2018-04-12 13:05:39,030 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2018-04-12 13:05:39,030 INFO L347 BasicCegarLoop]: Found error trace [2018-04-12 13:05:39,030 INFO L355 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-12 13:05:39,030 INFO L408 AbstractCegarLoop]: === Iteration 13 === [mainErr51RequiresViolation, mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr31RequiresViolation, mainErr46RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr52AssertViolationMEMORY_FREE, mainErr15RequiresViolation, mainErr49RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr17RequiresViolation, mainErr42RequiresViolation, mainErr30RequiresViolation, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr44RequiresViolation, mainErr10RequiresViolation, mainErr43RequiresViolation, mainErr4RequiresViolation, mainErr50RequiresViolation, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr48RequiresViolation, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr45RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr54EnsuresViolationMEMORY_LEAK, mainErr9RequiresViolation, mainErr53AssertViolationMEMORY_FREE, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr34RequiresViolation, mainErr47RequiresViolation, mainErr14RequiresViolation, mainErr40RequiresViolation]=== [2018-04-12 13:05:39,035 INFO L82 PathProgramCache]: Analyzing trace with hash -1875072914, now seen corresponding path program 1 times [2018-04-12 13:05:39,035 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-04-12 13:05:39,035 INFO L68 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-04-12 13:05:39,036 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-12 13:05:39,036 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-12 13:05:39,036 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-12 13:05:39,045 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-12 13:05:39,045 WARN L250 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-12 13:05:39,096 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-12 13:05:39,096 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-04-12 13:05:39,096 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-04-12 13:05:39,096 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-04-12 13:05:39,096 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-04-12 13:05:39,097 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-04-12 13:05:39,097 INFO L87 Difference]: Start difference. First operand 214 states and 272 transitions. Second operand 6 states. [2018-04-12 13:05:39,290 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-12 13:05:39,290 INFO L93 Difference]: Finished difference Result 303 states and 371 transitions. [2018-04-12 13:05:39,290 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-04-12 13:05:39,290 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 26 [2018-04-12 13:05:39,290 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-12 13:05:39,292 INFO L225 Difference]: With dead ends: 303 [2018-04-12 13:05:39,292 INFO L226 Difference]: Without dead ends: 303 [2018-04-12 13:05:39,292 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 3 SyntacticMatches, 1 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=32, Invalid=58, Unknown=0, NotChecked=0, Total=90 [2018-04-12 13:05:39,292 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 303 states. [2018-04-12 13:05:39,296 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 303 to 256. [2018-04-12 13:05:39,296 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 256 states. [2018-04-12 13:05:39,297 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 256 states to 256 states and 336 transitions. [2018-04-12 13:05:39,297 INFO L78 Accepts]: Start accepts. Automaton has 256 states and 336 transitions. Word has length 26 [2018-04-12 13:05:39,297 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-12 13:05:39,298 INFO L459 AbstractCegarLoop]: Abstraction has 256 states and 336 transitions. [2018-04-12 13:05:39,298 INFO L460 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-04-12 13:05:39,298 INFO L276 IsEmpty]: Start isEmpty. Operand 256 states and 336 transitions. [2018-04-12 13:05:39,298 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2018-04-12 13:05:39,298 INFO L347 BasicCegarLoop]: Found error trace [2018-04-12 13:05:39,298 INFO L355 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-12 13:05:39,299 INFO L408 AbstractCegarLoop]: === Iteration 14 === [mainErr51RequiresViolation, mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr31RequiresViolation, mainErr46RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr52AssertViolationMEMORY_FREE, mainErr15RequiresViolation, mainErr49RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr17RequiresViolation, mainErr42RequiresViolation, mainErr30RequiresViolation, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr44RequiresViolation, mainErr10RequiresViolation, mainErr43RequiresViolation, mainErr4RequiresViolation, mainErr50RequiresViolation, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr48RequiresViolation, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr45RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr54EnsuresViolationMEMORY_LEAK, mainErr9RequiresViolation, mainErr53AssertViolationMEMORY_FREE, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr34RequiresViolation, mainErr47RequiresViolation, mainErr14RequiresViolation, mainErr40RequiresViolation]=== [2018-04-12 13:05:39,299 INFO L82 PathProgramCache]: Analyzing trace with hash 121654351, now seen corresponding path program 1 times [2018-04-12 13:05:39,299 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-04-12 13:05:39,299 INFO L68 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-04-12 13:05:39,300 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-12 13:05:39,300 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-12 13:05:39,300 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-12 13:05:39,307 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-12 13:05:39,307 WARN L250 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-12 13:05:39,348 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-12 13:05:39,348 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-04-12 13:05:39,348 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-04-12 13:05:39,349 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-04-12 13:05:39,349 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-04-12 13:05:39,349 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2018-04-12 13:05:39,349 INFO L87 Difference]: Start difference. First operand 256 states and 336 transitions. Second operand 6 states. [2018-04-12 13:05:39,492 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-12 13:05:39,492 INFO L93 Difference]: Finished difference Result 259 states and 321 transitions. [2018-04-12 13:05:39,492 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-04-12 13:05:39,493 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 28 [2018-04-12 13:05:39,493 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-12 13:05:39,494 INFO L225 Difference]: With dead ends: 259 [2018-04-12 13:05:39,494 INFO L226 Difference]: Without dead ends: 259 [2018-04-12 13:05:39,494 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=28, Invalid=44, Unknown=0, NotChecked=0, Total=72 [2018-04-12 13:05:39,495 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 259 states. [2018-04-12 13:05:39,497 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 259 to 224. [2018-04-12 13:05:39,498 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 224 states. [2018-04-12 13:05:39,499 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 224 states to 224 states and 282 transitions. [2018-04-12 13:05:39,499 INFO L78 Accepts]: Start accepts. Automaton has 224 states and 282 transitions. Word has length 28 [2018-04-12 13:05:39,499 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-12 13:05:39,499 INFO L459 AbstractCegarLoop]: Abstraction has 224 states and 282 transitions. [2018-04-12 13:05:39,499 INFO L460 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-04-12 13:05:39,499 INFO L276 IsEmpty]: Start isEmpty. Operand 224 states and 282 transitions. [2018-04-12 13:05:39,500 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2018-04-12 13:05:39,500 INFO L347 BasicCegarLoop]: Found error trace [2018-04-12 13:05:39,500 INFO L355 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-12 13:05:39,500 INFO L408 AbstractCegarLoop]: === Iteration 15 === [mainErr51RequiresViolation, mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr31RequiresViolation, mainErr46RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr52AssertViolationMEMORY_FREE, mainErr15RequiresViolation, mainErr49RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr17RequiresViolation, mainErr42RequiresViolation, mainErr30RequiresViolation, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr44RequiresViolation, mainErr10RequiresViolation, mainErr43RequiresViolation, mainErr4RequiresViolation, mainErr50RequiresViolation, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr48RequiresViolation, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr45RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr54EnsuresViolationMEMORY_LEAK, mainErr9RequiresViolation, mainErr53AssertViolationMEMORY_FREE, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr34RequiresViolation, mainErr47RequiresViolation, mainErr14RequiresViolation, mainErr40RequiresViolation]=== [2018-04-12 13:05:39,500 INFO L82 PathProgramCache]: Analyzing trace with hash 398243291, now seen corresponding path program 1 times [2018-04-12 13:05:39,500 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-04-12 13:05:39,500 INFO L68 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-04-12 13:05:39,501 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-12 13:05:39,501 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-12 13:05:39,501 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-12 13:05:39,512 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-12 13:05:39,513 WARN L250 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-12 13:05:39,577 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-12 13:05:39,578 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-04-12 13:05:39,578 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2018-04-12 13:05:39,578 INFO L442 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-04-12 13:05:39,578 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-04-12 13:05:39,578 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2018-04-12 13:05:39,579 INFO L87 Difference]: Start difference. First operand 224 states and 282 transitions. Second operand 9 states. [2018-04-12 13:05:39,990 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-12 13:05:39,991 INFO L93 Difference]: Finished difference Result 311 states and 385 transitions. [2018-04-12 13:05:39,995 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-04-12 13:05:39,995 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 28 [2018-04-12 13:05:39,995 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-12 13:05:39,996 INFO L225 Difference]: With dead ends: 311 [2018-04-12 13:05:39,997 INFO L226 Difference]: Without dead ends: 311 [2018-04-12 13:05:39,997 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=67, Invalid=143, Unknown=0, NotChecked=0, Total=210 [2018-04-12 13:05:39,997 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 311 states. [2018-04-12 13:05:40,000 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 311 to 223. [2018-04-12 13:05:40,001 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 223 states. [2018-04-12 13:05:40,001 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 223 states to 223 states and 280 transitions. [2018-04-12 13:05:40,002 INFO L78 Accepts]: Start accepts. Automaton has 223 states and 280 transitions. Word has length 28 [2018-04-12 13:05:40,002 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-12 13:05:40,002 INFO L459 AbstractCegarLoop]: Abstraction has 223 states and 280 transitions. [2018-04-12 13:05:40,002 INFO L460 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-04-12 13:05:40,002 INFO L276 IsEmpty]: Start isEmpty. Operand 223 states and 280 transitions. [2018-04-12 13:05:40,002 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2018-04-12 13:05:40,002 INFO L347 BasicCegarLoop]: Found error trace [2018-04-12 13:05:40,003 INFO L355 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-12 13:05:40,003 INFO L408 AbstractCegarLoop]: === Iteration 16 === [mainErr51RequiresViolation, mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr31RequiresViolation, mainErr46RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr52AssertViolationMEMORY_FREE, mainErr15RequiresViolation, mainErr49RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr17RequiresViolation, mainErr42RequiresViolation, mainErr30RequiresViolation, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr44RequiresViolation, mainErr10RequiresViolation, mainErr43RequiresViolation, mainErr4RequiresViolation, mainErr50RequiresViolation, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr48RequiresViolation, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr45RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr54EnsuresViolationMEMORY_LEAK, mainErr9RequiresViolation, mainErr53AssertViolationMEMORY_FREE, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr34RequiresViolation, mainErr47RequiresViolation, mainErr14RequiresViolation, mainErr40RequiresViolation]=== [2018-04-12 13:05:40,003 INFO L82 PathProgramCache]: Analyzing trace with hash 398243292, now seen corresponding path program 1 times [2018-04-12 13:05:40,003 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-04-12 13:05:40,003 INFO L68 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-04-12 13:05:40,004 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-12 13:05:40,004 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-12 13:05:40,004 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-12 13:05:40,012 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-12 13:05:40,012 WARN L250 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-12 13:05:40,095 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-12 13:05:40,095 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-04-12 13:05:40,095 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2018-04-12 13:05:40,096 INFO L442 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-04-12 13:05:40,096 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-04-12 13:05:40,096 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2018-04-12 13:05:40,096 INFO L87 Difference]: Start difference. First operand 223 states and 280 transitions. Second operand 9 states. [2018-04-12 13:05:40,552 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-12 13:05:40,552 INFO L93 Difference]: Finished difference Result 310 states and 383 transitions. [2018-04-12 13:05:40,552 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-04-12 13:05:40,552 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 28 [2018-04-12 13:05:40,553 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-12 13:05:40,553 INFO L225 Difference]: With dead ends: 310 [2018-04-12 13:05:40,553 INFO L226 Difference]: Without dead ends: 310 [2018-04-12 13:05:40,554 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=67, Invalid=143, Unknown=0, NotChecked=0, Total=210 [2018-04-12 13:05:40,554 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 310 states. [2018-04-12 13:05:40,556 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 310 to 222. [2018-04-12 13:05:40,556 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 222 states. [2018-04-12 13:05:40,557 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 222 states to 222 states and 278 transitions. [2018-04-12 13:05:40,557 INFO L78 Accepts]: Start accepts. Automaton has 222 states and 278 transitions. Word has length 28 [2018-04-12 13:05:40,557 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-12 13:05:40,557 INFO L459 AbstractCegarLoop]: Abstraction has 222 states and 278 transitions. [2018-04-12 13:05:40,557 INFO L460 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-04-12 13:05:40,557 INFO L276 IsEmpty]: Start isEmpty. Operand 222 states and 278 transitions. [2018-04-12 13:05:40,558 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2018-04-12 13:05:40,558 INFO L347 BasicCegarLoop]: Found error trace [2018-04-12 13:05:40,558 INFO L355 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-12 13:05:40,558 INFO L408 AbstractCegarLoop]: === Iteration 17 === [mainErr51RequiresViolation, mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr31RequiresViolation, mainErr46RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr52AssertViolationMEMORY_FREE, mainErr15RequiresViolation, mainErr49RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr17RequiresViolation, mainErr42RequiresViolation, mainErr30RequiresViolation, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr44RequiresViolation, mainErr10RequiresViolation, mainErr43RequiresViolation, mainErr4RequiresViolation, mainErr50RequiresViolation, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr48RequiresViolation, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr45RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr54EnsuresViolationMEMORY_LEAK, mainErr9RequiresViolation, mainErr53AssertViolationMEMORY_FREE, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr34RequiresViolation, mainErr47RequiresViolation, mainErr14RequiresViolation, mainErr40RequiresViolation]=== [2018-04-12 13:05:40,558 INFO L82 PathProgramCache]: Analyzing trace with hash -468463012, now seen corresponding path program 1 times [2018-04-12 13:05:40,558 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-04-12 13:05:40,558 INFO L68 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-04-12 13:05:40,559 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-12 13:05:40,559 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-12 13:05:40,559 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-12 13:05:40,564 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-12 13:05:40,565 WARN L250 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-12 13:05:40,589 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-12 13:05:40,589 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-04-12 13:05:40,589 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-04-12 13:05:40,589 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-04-12 13:05:40,589 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-04-12 13:05:40,590 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-04-12 13:05:40,590 INFO L87 Difference]: Start difference. First operand 222 states and 278 transitions. Second operand 5 states. [2018-04-12 13:05:40,744 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-12 13:05:40,744 INFO L93 Difference]: Finished difference Result 351 states and 431 transitions. [2018-04-12 13:05:40,744 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-04-12 13:05:40,744 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 29 [2018-04-12 13:05:40,744 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-12 13:05:40,745 INFO L225 Difference]: With dead ends: 351 [2018-04-12 13:05:40,745 INFO L226 Difference]: Without dead ends: 351 [2018-04-12 13:05:40,745 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2018-04-12 13:05:40,746 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 351 states. [2018-04-12 13:05:40,748 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 351 to 221. [2018-04-12 13:05:40,748 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 221 states. [2018-04-12 13:05:40,749 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 221 states to 221 states and 276 transitions. [2018-04-12 13:05:40,749 INFO L78 Accepts]: Start accepts. Automaton has 221 states and 276 transitions. Word has length 29 [2018-04-12 13:05:40,750 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-12 13:05:40,750 INFO L459 AbstractCegarLoop]: Abstraction has 221 states and 276 transitions. [2018-04-12 13:05:40,750 INFO L460 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-04-12 13:05:40,750 INFO L276 IsEmpty]: Start isEmpty. Operand 221 states and 276 transitions. [2018-04-12 13:05:40,750 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2018-04-12 13:05:40,750 INFO L347 BasicCegarLoop]: Found error trace [2018-04-12 13:05:40,750 INFO L355 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-12 13:05:40,751 INFO L408 AbstractCegarLoop]: === Iteration 18 === [mainErr51RequiresViolation, mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr31RequiresViolation, mainErr46RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr52AssertViolationMEMORY_FREE, mainErr15RequiresViolation, mainErr49RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr17RequiresViolation, mainErr42RequiresViolation, mainErr30RequiresViolation, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr44RequiresViolation, mainErr10RequiresViolation, mainErr43RequiresViolation, mainErr4RequiresViolation, mainErr50RequiresViolation, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr48RequiresViolation, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr45RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr54EnsuresViolationMEMORY_LEAK, mainErr9RequiresViolation, mainErr53AssertViolationMEMORY_FREE, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr34RequiresViolation, mainErr47RequiresViolation, mainErr14RequiresViolation, mainErr40RequiresViolation]=== [2018-04-12 13:05:40,751 INFO L82 PathProgramCache]: Analyzing trace with hash -468463011, now seen corresponding path program 1 times [2018-04-12 13:05:40,751 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-04-12 13:05:40,751 INFO L68 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-04-12 13:05:40,752 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-12 13:05:40,752 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-12 13:05:40,752 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-12 13:05:40,758 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-12 13:05:40,759 WARN L250 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-12 13:05:40,786 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-12 13:05:40,786 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-04-12 13:05:40,786 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-04-12 13:05:40,787 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-04-12 13:05:40,787 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-04-12 13:05:40,787 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-04-12 13:05:40,787 INFO L87 Difference]: Start difference. First operand 221 states and 276 transitions. Second operand 5 states. [2018-04-12 13:05:40,953 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-12 13:05:40,953 INFO L93 Difference]: Finished difference Result 388 states and 491 transitions. [2018-04-12 13:05:40,953 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-04-12 13:05:40,953 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 29 [2018-04-12 13:05:40,953 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-12 13:05:40,954 INFO L225 Difference]: With dead ends: 388 [2018-04-12 13:05:40,954 INFO L226 Difference]: Without dead ends: 388 [2018-04-12 13:05:40,955 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2018-04-12 13:05:40,955 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 388 states. [2018-04-12 13:05:40,958 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 388 to 220. [2018-04-12 13:05:40,958 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 220 states. [2018-04-12 13:05:40,959 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 220 states to 220 states and 274 transitions. [2018-04-12 13:05:40,959 INFO L78 Accepts]: Start accepts. Automaton has 220 states and 274 transitions. Word has length 29 [2018-04-12 13:05:40,959 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-12 13:05:40,959 INFO L459 AbstractCegarLoop]: Abstraction has 220 states and 274 transitions. [2018-04-12 13:05:40,959 INFO L460 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-04-12 13:05:40,959 INFO L276 IsEmpty]: Start isEmpty. Operand 220 states and 274 transitions. [2018-04-12 13:05:40,960 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2018-04-12 13:05:40,960 INFO L347 BasicCegarLoop]: Found error trace [2018-04-12 13:05:40,960 INFO L355 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-12 13:05:40,960 INFO L408 AbstractCegarLoop]: === Iteration 19 === [mainErr51RequiresViolation, mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr31RequiresViolation, mainErr46RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr52AssertViolationMEMORY_FREE, mainErr15RequiresViolation, mainErr49RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr17RequiresViolation, mainErr42RequiresViolation, mainErr30RequiresViolation, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr44RequiresViolation, mainErr10RequiresViolation, mainErr43RequiresViolation, mainErr4RequiresViolation, mainErr50RequiresViolation, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr48RequiresViolation, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr45RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr54EnsuresViolationMEMORY_LEAK, mainErr9RequiresViolation, mainErr53AssertViolationMEMORY_FREE, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr34RequiresViolation, mainErr47RequiresViolation, mainErr14RequiresViolation, mainErr40RequiresViolation]=== [2018-04-12 13:05:40,960 INFO L82 PathProgramCache]: Analyzing trace with hash -2092835834, now seen corresponding path program 1 times [2018-04-12 13:05:40,960 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-04-12 13:05:40,960 INFO L68 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-04-12 13:05:40,961 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-12 13:05:40,961 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-12 13:05:40,961 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-12 13:05:40,967 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-12 13:05:40,968 WARN L250 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-12 13:05:41,025 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-12 13:05:41,025 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-04-12 13:05:41,025 INFO L213 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-04-12 13:05:41,033 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-12 13:05:41,054 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-12 13:05:41,061 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-12 13:05:41,125 WARN L1033 $PredicateComparison]: unable to prove that (exists ((main_~n~0.base Int)) (and (= (store |c_old(#valid)| main_~n~0.base 0) |c_#valid|) (= (select |c_old(#valid)| main_~n~0.base) 0))) is different from true [2018-04-12 13:05:41,137 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 2 not checked. [2018-04-12 13:05:41,167 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-04-12 13:05:41,167 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 6] total 9 [2018-04-12 13:05:41,167 INFO L442 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-04-12 13:05:41,167 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-04-12 13:05:41,168 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=55, Unknown=1, NotChecked=14, Total=90 [2018-04-12 13:05:41,168 INFO L87 Difference]: Start difference. First operand 220 states and 274 transitions. Second operand 10 states. [2018-04-12 13:05:41,412 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-12 13:05:41,412 INFO L93 Difference]: Finished difference Result 279 states and 345 transitions. [2018-04-12 13:05:41,413 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-04-12 13:05:41,413 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 30 [2018-04-12 13:05:41,413 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-12 13:05:41,414 INFO L225 Difference]: With dead ends: 279 [2018-04-12 13:05:41,414 INFO L226 Difference]: Without dead ends: 277 [2018-04-12 13:05:41,415 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 40 GetRequests, 27 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 17 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=52, Invalid=133, Unknown=1, NotChecked=24, Total=210 [2018-04-12 13:05:41,415 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 277 states. [2018-04-12 13:05:41,418 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 277 to 226. [2018-04-12 13:05:41,423 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 226 states. [2018-04-12 13:05:41,424 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 226 states to 226 states and 280 transitions. [2018-04-12 13:05:41,424 INFO L78 Accepts]: Start accepts. Automaton has 226 states and 280 transitions. Word has length 30 [2018-04-12 13:05:41,424 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-12 13:05:41,425 INFO L459 AbstractCegarLoop]: Abstraction has 226 states and 280 transitions. [2018-04-12 13:05:41,425 INFO L460 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-04-12 13:05:41,425 INFO L276 IsEmpty]: Start isEmpty. Operand 226 states and 280 transitions. [2018-04-12 13:05:41,425 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2018-04-12 13:05:41,425 INFO L347 BasicCegarLoop]: Found error trace [2018-04-12 13:05:41,425 INFO L355 BasicCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-12 13:05:41,425 INFO L408 AbstractCegarLoop]: === Iteration 20 === [mainErr51RequiresViolation, mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr31RequiresViolation, mainErr46RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr52AssertViolationMEMORY_FREE, mainErr15RequiresViolation, mainErr49RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr17RequiresViolation, mainErr42RequiresViolation, mainErr30RequiresViolation, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr44RequiresViolation, mainErr10RequiresViolation, mainErr43RequiresViolation, mainErr4RequiresViolation, mainErr50RequiresViolation, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr48RequiresViolation, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr45RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr54EnsuresViolationMEMORY_LEAK, mainErr9RequiresViolation, mainErr53AssertViolationMEMORY_FREE, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr34RequiresViolation, mainErr47RequiresViolation, mainErr14RequiresViolation, mainErr40RequiresViolation]=== [2018-04-12 13:05:41,425 INFO L82 PathProgramCache]: Analyzing trace with hash -2092836151, now seen corresponding path program 1 times [2018-04-12 13:05:41,426 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-04-12 13:05:41,426 INFO L68 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-04-12 13:05:41,427 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-12 13:05:41,427 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-12 13:05:41,427 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-12 13:05:41,433 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-12 13:05:41,434 WARN L250 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-12 13:05:41,456 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-12 13:05:41,456 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-04-12 13:05:41,456 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-04-12 13:05:41,457 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-04-12 13:05:41,457 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-04-12 13:05:41,457 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-04-12 13:05:41,457 INFO L87 Difference]: Start difference. First operand 226 states and 280 transitions. Second operand 3 states. [2018-04-12 13:05:41,477 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-12 13:05:41,477 INFO L93 Difference]: Finished difference Result 198 states and 226 transitions. [2018-04-12 13:05:41,478 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-04-12 13:05:41,478 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 30 [2018-04-12 13:05:41,478 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-12 13:05:41,478 INFO L225 Difference]: With dead ends: 198 [2018-04-12 13:05:41,479 INFO L226 Difference]: Without dead ends: 182 [2018-04-12 13:05:41,479 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-04-12 13:05:41,479 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 182 states. [2018-04-12 13:05:41,482 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 182 to 181. [2018-04-12 13:05:41,482 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 181 states. [2018-04-12 13:05:41,482 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 181 states to 181 states and 210 transitions. [2018-04-12 13:05:41,483 INFO L78 Accepts]: Start accepts. Automaton has 181 states and 210 transitions. Word has length 30 [2018-04-12 13:05:41,483 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-12 13:05:41,483 INFO L459 AbstractCegarLoop]: Abstraction has 181 states and 210 transitions. [2018-04-12 13:05:41,483 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-04-12 13:05:41,483 INFO L276 IsEmpty]: Start isEmpty. Operand 181 states and 210 transitions. [2018-04-12 13:05:41,483 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2018-04-12 13:05:41,483 INFO L347 BasicCegarLoop]: Found error trace [2018-04-12 13:05:41,483 INFO L355 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-12 13:05:41,484 INFO L408 AbstractCegarLoop]: === Iteration 21 === [mainErr51RequiresViolation, mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr31RequiresViolation, mainErr46RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr52AssertViolationMEMORY_FREE, mainErr15RequiresViolation, mainErr49RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr17RequiresViolation, mainErr42RequiresViolation, mainErr30RequiresViolation, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr44RequiresViolation, mainErr10RequiresViolation, mainErr43RequiresViolation, mainErr4RequiresViolation, mainErr50RequiresViolation, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr48RequiresViolation, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr45RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr54EnsuresViolationMEMORY_LEAK, mainErr9RequiresViolation, mainErr53AssertViolationMEMORY_FREE, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr34RequiresViolation, mainErr47RequiresViolation, mainErr14RequiresViolation, mainErr40RequiresViolation]=== [2018-04-12 13:05:41,484 INFO L82 PathProgramCache]: Analyzing trace with hash -1632757376, now seen corresponding path program 1 times [2018-04-12 13:05:41,484 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-04-12 13:05:41,484 INFO L68 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-04-12 13:05:41,485 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-12 13:05:41,485 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-12 13:05:41,485 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-12 13:05:41,492 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-12 13:05:41,493 WARN L250 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-12 13:05:41,555 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-12 13:05:41,556 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-04-12 13:05:41,556 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2018-04-12 13:05:41,556 INFO L442 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-04-12 13:05:41,556 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-04-12 13:05:41,557 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2018-04-12 13:05:41,557 INFO L87 Difference]: Start difference. First operand 181 states and 210 transitions. Second operand 9 states. [2018-04-12 13:05:41,831 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-12 13:05:41,831 INFO L93 Difference]: Finished difference Result 237 states and 276 transitions. [2018-04-12 13:05:41,831 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-04-12 13:05:41,831 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 32 [2018-04-12 13:05:41,832 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-12 13:05:41,832 INFO L225 Difference]: With dead ends: 237 [2018-04-12 13:05:41,833 INFO L226 Difference]: Without dead ends: 237 [2018-04-12 13:05:41,833 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=67, Invalid=143, Unknown=0, NotChecked=0, Total=210 [2018-04-12 13:05:41,833 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 237 states. [2018-04-12 13:05:41,836 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 237 to 180. [2018-04-12 13:05:41,836 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 180 states. [2018-04-12 13:05:41,837 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 180 states to 180 states and 209 transitions. [2018-04-12 13:05:41,837 INFO L78 Accepts]: Start accepts. Automaton has 180 states and 209 transitions. Word has length 32 [2018-04-12 13:05:41,837 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-12 13:05:41,837 INFO L459 AbstractCegarLoop]: Abstraction has 180 states and 209 transitions. [2018-04-12 13:05:41,837 INFO L460 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-04-12 13:05:41,838 INFO L276 IsEmpty]: Start isEmpty. Operand 180 states and 209 transitions. [2018-04-12 13:05:41,838 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2018-04-12 13:05:41,838 INFO L347 BasicCegarLoop]: Found error trace [2018-04-12 13:05:41,838 INFO L355 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-12 13:05:41,838 INFO L408 AbstractCegarLoop]: === Iteration 22 === [mainErr51RequiresViolation, mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr31RequiresViolation, mainErr46RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr52AssertViolationMEMORY_FREE, mainErr15RequiresViolation, mainErr49RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr17RequiresViolation, mainErr42RequiresViolation, mainErr30RequiresViolation, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr44RequiresViolation, mainErr10RequiresViolation, mainErr43RequiresViolation, mainErr4RequiresViolation, mainErr50RequiresViolation, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr48RequiresViolation, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr45RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr54EnsuresViolationMEMORY_LEAK, mainErr9RequiresViolation, mainErr53AssertViolationMEMORY_FREE, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr34RequiresViolation, mainErr47RequiresViolation, mainErr14RequiresViolation, mainErr40RequiresViolation]=== [2018-04-12 13:05:41,838 INFO L82 PathProgramCache]: Analyzing trace with hash -1632757375, now seen corresponding path program 1 times [2018-04-12 13:05:41,838 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-04-12 13:05:41,839 INFO L68 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-04-12 13:05:41,839 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-12 13:05:41,839 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-12 13:05:41,839 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-12 13:05:41,848 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-12 13:05:41,849 WARN L250 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-12 13:05:41,930 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-12 13:05:41,930 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-04-12 13:05:41,930 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2018-04-12 13:05:41,931 INFO L442 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-04-12 13:05:41,931 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-04-12 13:05:41,931 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2018-04-12 13:05:41,931 INFO L87 Difference]: Start difference. First operand 180 states and 209 transitions. Second operand 9 states. [2018-04-12 13:05:42,296 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-12 13:05:42,296 INFO L93 Difference]: Finished difference Result 236 states and 275 transitions. [2018-04-12 13:05:42,296 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-04-12 13:05:42,296 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 32 [2018-04-12 13:05:42,297 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-12 13:05:42,297 INFO L225 Difference]: With dead ends: 236 [2018-04-12 13:05:42,297 INFO L226 Difference]: Without dead ends: 236 [2018-04-12 13:05:42,298 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=67, Invalid=143, Unknown=0, NotChecked=0, Total=210 [2018-04-12 13:05:42,298 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 236 states. [2018-04-12 13:05:42,300 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 236 to 179. [2018-04-12 13:05:42,300 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 179 states. [2018-04-12 13:05:42,301 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 179 states to 179 states and 208 transitions. [2018-04-12 13:05:42,301 INFO L78 Accepts]: Start accepts. Automaton has 179 states and 208 transitions. Word has length 32 [2018-04-12 13:05:42,301 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-12 13:05:42,301 INFO L459 AbstractCegarLoop]: Abstraction has 179 states and 208 transitions. [2018-04-12 13:05:42,301 INFO L460 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-04-12 13:05:42,301 INFO L276 IsEmpty]: Start isEmpty. Operand 179 states and 208 transitions. [2018-04-12 13:05:42,302 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2018-04-12 13:05:42,302 INFO L347 BasicCegarLoop]: Found error trace [2018-04-12 13:05:42,302 INFO L355 BasicCegarLoop]: trace histogram [3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-12 13:05:42,302 INFO L408 AbstractCegarLoop]: === Iteration 23 === [mainErr51RequiresViolation, mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr31RequiresViolation, mainErr46RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr52AssertViolationMEMORY_FREE, mainErr15RequiresViolation, mainErr49RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr17RequiresViolation, mainErr42RequiresViolation, mainErr30RequiresViolation, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr44RequiresViolation, mainErr10RequiresViolation, mainErr43RequiresViolation, mainErr4RequiresViolation, mainErr50RequiresViolation, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr48RequiresViolation, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr45RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr54EnsuresViolationMEMORY_LEAK, mainErr9RequiresViolation, mainErr53AssertViolationMEMORY_FREE, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr34RequiresViolation, mainErr47RequiresViolation, mainErr14RequiresViolation, mainErr40RequiresViolation]=== [2018-04-12 13:05:42,302 INFO L82 PathProgramCache]: Analyzing trace with hash -1370981878, now seen corresponding path program 1 times [2018-04-12 13:05:42,302 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-04-12 13:05:42,303 INFO L68 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-04-12 13:05:42,303 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-12 13:05:42,303 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-12 13:05:42,303 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-12 13:05:42,317 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-12 13:05:42,318 WARN L250 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-12 13:05:42,503 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 7 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-12 13:05:42,503 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-04-12 13:05:42,503 INFO L213 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-04-12 13:05:42,509 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-12 13:05:42,526 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-12 13:05:42,529 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-12 13:05:42,553 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 10 [2018-04-12 13:05:42,555 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 9 [2018-04-12 13:05:42,555 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-12 13:05:42,556 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-12 13:05:42,561 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 10 [2018-04-12 13:05:42,562 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 9 [2018-04-12 13:05:42,562 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-04-12 13:05:42,563 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-12 13:05:42,566 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-04-12 13:05:42,567 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 2 variables, input treesize:32, output treesize:24 [2018-04-12 13:05:42,593 INFO L700 Elim1Store]: detected not equals via solver [2018-04-12 13:05:42,593 INFO L700 Elim1Store]: detected not equals via solver [2018-04-12 13:05:42,594 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 21 [2018-04-12 13:05:42,594 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-12 13:05:42,601 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-12 13:05:42,601 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:38, output treesize:36 [2018-04-12 13:05:42,625 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 21 treesize of output 19 [2018-04-12 13:05:42,631 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 2 case distinctions, treesize of input 16 treesize of output 23 [2018-04-12 13:05:42,632 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 2 xjuncts. [2018-04-12 13:05:42,639 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-04-12 13:05:42,670 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 21 treesize of output 19 [2018-04-12 13:05:42,678 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 2 case distinctions, treesize of input 16 treesize of output 23 [2018-04-12 13:05:42,679 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 2 xjuncts. [2018-04-12 13:05:42,685 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-04-12 13:05:42,702 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-2 vars, End of recursive call: and 4 xjuncts. [2018-04-12 13:05:42,702 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 4 variables, input treesize:58, output treesize:156 [2018-04-12 13:05:42,779 INFO L700 Elim1Store]: detected not equals via solver [2018-04-12 13:05:42,783 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 69 treesize of output 65 [2018-04-12 13:05:42,785 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 11 [2018-04-12 13:05:42,786 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-12 13:05:42,793 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-12 13:05:42,819 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 61 treesize of output 54 [2018-04-12 13:05:42,821 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 11 [2018-04-12 13:05:42,821 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-04-12 13:05:42,830 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-12 13:05:42,852 INFO L700 Elim1Store]: detected not equals via solver [2018-04-12 13:05:42,856 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 82 treesize of output 78 [2018-04-12 13:05:42,858 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 11 [2018-04-12 13:05:42,858 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2018-04-12 13:05:42,866 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-12 13:05:42,889 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 74 treesize of output 67 [2018-04-12 13:05:42,891 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 11 [2018-04-12 13:05:42,891 INFO L267 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 1 xjuncts. [2018-04-12 13:05:42,900 INFO L267 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-12 13:05:42,922 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 4 dim-2 vars, End of recursive call: 2 dim-0 vars, and 2 xjuncts. [2018-04-12 13:05:42,922 INFO L202 ElimStorePlain]: Needed 9 recursive calls to eliminate 6 variables, input treesize:152, output treesize:120 [2018-04-12 13:05:43,035 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 105 treesize of output 95 [2018-04-12 13:05:43,038 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 25 [2018-04-12 13:05:43,039 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-12 13:05:43,063 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-12 13:05:43,105 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 103 treesize of output 89 [2018-04-12 13:05:43,111 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 22 treesize of output 29 [2018-04-12 13:05:43,111 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-04-12 13:05:43,120 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-12 13:05:43,157 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 97 treesize of output 84 [2018-04-12 13:05:43,166 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 25 [2018-04-12 13:05:43,167 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2018-04-12 13:05:43,177 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-12 13:05:43,201 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 93 treesize of output 76 [2018-04-12 13:05:43,203 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 22 treesize of output 29 [2018-04-12 13:05:43,203 INFO L267 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 1 xjuncts. [2018-04-12 13:05:43,211 INFO L267 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-12 13:05:43,231 INFO L267 ElimStorePlain]: Start of recursive call 1: 5 dim-0 vars, 4 dim-2 vars, End of recursive call: 5 dim-0 vars, and 2 xjuncts. [2018-04-12 13:05:43,231 INFO L202 ElimStorePlain]: Needed 9 recursive calls to eliminate 9 variables, input treesize:209, output treesize:173 [2018-04-12 13:05:47,407 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 75 treesize of output 65 [2018-04-12 13:05:47,409 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 1 [2018-04-12 13:05:47,409 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-12 13:05:47,417 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 1 [2018-04-12 13:05:47,418 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-04-12 13:05:47,428 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-12 13:05:47,456 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 107 treesize of output 91 [2018-04-12 13:05:47,460 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 1 [2018-04-12 13:05:47,460 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2018-04-12 13:05:47,476 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-04-12 13:05:47,476 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2018-04-12 13:05:47,485 INFO L267 ElimStorePlain]: Start of recursive call 5: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-12 13:05:47,502 INFO L267 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 2 dim-2 vars, End of recursive call: 4 dim-0 vars, and 2 xjuncts. [2018-04-12 13:05:47,503 INFO L202 ElimStorePlain]: Needed 7 recursive calls to eliminate 6 variables, input treesize:183, output treesize:120 [2018-04-12 13:05:47,697 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 46 treesize of output 32 [2018-04-12 13:05:47,699 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 1 [2018-04-12 13:05:47,699 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-12 13:05:47,702 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 10 [2018-04-12 13:05:47,703 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-04-12 13:05:47,705 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-12 13:05:47,708 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-04-12 13:05:47,708 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 4 variables, input treesize:51, output treesize:15 [2018-04-12 13:05:47,770 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 12 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-12 13:05:47,798 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-04-12 13:05:47,798 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 16] total 26 [2018-04-12 13:05:47,798 INFO L442 AbstractCegarLoop]: Interpolant automaton has 26 states [2018-04-12 13:05:47,799 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2018-04-12 13:05:47,799 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=74, Invalid=574, Unknown=2, NotChecked=0, Total=650 [2018-04-12 13:05:47,799 INFO L87 Difference]: Start difference. First operand 179 states and 208 transitions. Second operand 26 states. [2018-04-12 13:06:18,721 WARN L151 SmtUtils]: Spent 4094ms on a formula simplification. DAG size of input: 139 DAG size of output 58 [2018-04-12 13:06:28,861 WARN L151 SmtUtils]: Spent 4077ms on a formula simplification. DAG size of input: 125 DAG size of output 54 [2018-04-12 13:06:33,018 WARN L151 SmtUtils]: Spent 4098ms on a formula simplification. DAG size of input: 129 DAG size of output 58 [2018-04-12 13:07:01,481 WARN L151 SmtUtils]: Spent 10086ms on a formula simplification. DAG size of input: 133 DAG size of output 58 [2018-04-12 13:07:05,779 WARN L151 SmtUtils]: Spent 4191ms on a formula simplification. DAG size of input: 137 DAG size of output 61 [2018-04-12 13:07:16,033 WARN L151 SmtUtils]: Spent 10135ms on a formula simplification. DAG size of input: 142 DAG size of output 62 [2018-04-12 13:07:29,615 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-12 13:07:29,616 INFO L93 Difference]: Finished difference Result 430 states and 502 transitions. [2018-04-12 13:07:29,616 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 47 states. [2018-04-12 13:07:29,616 INFO L78 Accepts]: Start accepts. Automaton has 26 states. Word has length 48 [2018-04-12 13:07:29,616 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-12 13:07:29,617 INFO L225 Difference]: With dead ends: 430 [2018-04-12 13:07:29,618 INFO L226 Difference]: Without dead ends: 430 [2018-04-12 13:07:29,619 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 105 GetRequests, 35 SyntacticMatches, 2 SemanticMatches, 68 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1208 ImplicationChecksByTransitivity, 93.1s TimeCoverageRelationStatistics Valid=1051, Invalid=3755, Unknown=24, NotChecked=0, Total=4830 [2018-04-12 13:07:29,619 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 430 states. [2018-04-12 13:07:29,622 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 430 to 205. [2018-04-12 13:07:29,623 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 205 states. [2018-04-12 13:07:29,623 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 205 states to 205 states and 240 transitions. [2018-04-12 13:07:29,623 INFO L78 Accepts]: Start accepts. Automaton has 205 states and 240 transitions. Word has length 48 [2018-04-12 13:07:29,624 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-12 13:07:29,624 INFO L459 AbstractCegarLoop]: Abstraction has 205 states and 240 transitions. [2018-04-12 13:07:29,624 INFO L460 AbstractCegarLoop]: Interpolant automaton has 26 states. [2018-04-12 13:07:29,624 INFO L276 IsEmpty]: Start isEmpty. Operand 205 states and 240 transitions. [2018-04-12 13:07:29,624 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2018-04-12 13:07:29,624 INFO L347 BasicCegarLoop]: Found error trace [2018-04-12 13:07:29,625 INFO L355 BasicCegarLoop]: trace histogram [3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-12 13:07:29,625 INFO L408 AbstractCegarLoop]: === Iteration 24 === [mainErr51RequiresViolation, mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr31RequiresViolation, mainErr46RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr52AssertViolationMEMORY_FREE, mainErr15RequiresViolation, mainErr49RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr17RequiresViolation, mainErr42RequiresViolation, mainErr30RequiresViolation, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr44RequiresViolation, mainErr10RequiresViolation, mainErr43RequiresViolation, mainErr4RequiresViolation, mainErr50RequiresViolation, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr48RequiresViolation, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr45RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr54EnsuresViolationMEMORY_LEAK, mainErr9RequiresViolation, mainErr53AssertViolationMEMORY_FREE, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr34RequiresViolation, mainErr47RequiresViolation, mainErr14RequiresViolation, mainErr40RequiresViolation]=== [2018-04-12 13:07:29,625 INFO L82 PathProgramCache]: Analyzing trace with hash -1056039926, now seen corresponding path program 1 times [2018-04-12 13:07:29,625 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-04-12 13:07:29,625 INFO L68 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-04-12 13:07:29,626 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-12 13:07:29,626 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-12 13:07:29,626 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-12 13:07:29,638 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-12 13:07:29,638 WARN L250 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-12 13:07:29,814 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 5 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-12 13:07:29,815 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-04-12 13:07:29,815 INFO L213 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-04-12 13:07:29,829 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-12 13:07:29,849 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-12 13:07:29,852 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-12 13:07:29,955 INFO L700 Elim1Store]: detected not equals via solver [2018-04-12 13:07:29,956 INFO L700 Elim1Store]: detected not equals via solver [2018-04-12 13:07:29,957 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 4 [2018-04-12 13:07:29,957 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-12 13:07:29,964 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-12 13:07:29,964 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:40, output treesize:34 [2018-04-12 13:07:29,987 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 16 [2018-04-12 13:07:29,989 INFO L700 Elim1Store]: detected not equals via solver [2018-04-12 13:07:29,989 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 23 [2018-04-12 13:07:29,990 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-12 13:07:29,993 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-12 13:07:30,020 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 16 [2018-04-12 13:07:30,022 INFO L700 Elim1Store]: detected not equals via solver [2018-04-12 13:07:30,024 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 23 [2018-04-12 13:07:30,024 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-04-12 13:07:30,028 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-12 13:07:30,037 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-04-12 13:07:30,037 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 3 variables, input treesize:57, output treesize:46 [2018-04-12 13:07:30,089 INFO L700 Elim1Store]: detected not equals via solver [2018-04-12 13:07:30,091 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 40 treesize of output 41 [2018-04-12 13:07:30,094 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 13 [2018-04-12 13:07:30,094 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-12 13:07:30,099 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-12 13:07:30,118 INFO L700 Elim1Store]: detected not equals via solver [2018-04-12 13:07:30,122 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 54 treesize of output 51 [2018-04-12 13:07:30,124 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 13 [2018-04-12 13:07:30,124 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-04-12 13:07:30,129 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-12 13:07:30,140 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-04-12 13:07:30,140 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 3 variables, input treesize:92, output treesize:72 [2018-04-12 13:07:30,223 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 94 treesize of output 80 [2018-04-12 13:07:30,227 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 22 treesize of output 29 [2018-04-12 13:07:30,227 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-12 13:07:30,247 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-12 13:07:30,264 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 55 treesize of output 48 [2018-04-12 13:07:30,267 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 22 treesize of output 29 [2018-04-12 13:07:30,268 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-04-12 13:07:30,275 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-12 13:07:30,312 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2018-04-12 13:07:30,312 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 4 variables, input treesize:116, output treesize:96 [2018-04-12 13:07:36,449 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 55 treesize of output 46 [2018-04-12 13:07:36,451 INFO L700 Elim1Store]: detected not equals via solver [2018-04-12 13:07:36,452 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 23 [2018-04-12 13:07:36,452 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-04-12 13:07:36,458 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 1 [2018-04-12 13:07:36,458 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-04-12 13:07:36,461 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-04-12 13:07:36,470 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 33 treesize of output 29 [2018-04-12 13:07:36,471 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 1 [2018-04-12 13:07:36,471 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2018-04-12 13:07:36,476 INFO L700 Elim1Store]: detected not equals via solver [2018-04-12 13:07:36,476 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 10 [2018-04-12 13:07:36,476 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2018-04-12 13:07:36,478 INFO L267 ElimStorePlain]: Start of recursive call 5: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-12 13:07:36,482 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-04-12 13:07:36,482 INFO L202 ElimStorePlain]: Needed 7 recursive calls to eliminate 5 variables, input treesize:84, output treesize:7 [2018-04-12 13:07:36,495 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 5 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-12 13:07:36,513 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-04-12 13:07:36,514 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 18] total 29 [2018-04-12 13:07:36,514 INFO L442 AbstractCegarLoop]: Interpolant automaton has 29 states [2018-04-12 13:07:36,514 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2018-04-12 13:07:36,514 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=123, Invalid=686, Unknown=3, NotChecked=0, Total=812 [2018-04-12 13:07:36,514 INFO L87 Difference]: Start difference. First operand 205 states and 240 transitions. Second operand 29 states. [2018-04-12 13:08:28,217 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-12 13:08:28,217 INFO L93 Difference]: Finished difference Result 534 states and 624 transitions. [2018-04-12 13:08:28,218 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2018-04-12 13:08:28,218 INFO L78 Accepts]: Start accepts. Automaton has 29 states. Word has length 48 [2018-04-12 13:08:28,218 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-12 13:08:28,219 INFO L225 Difference]: With dead ends: 534 [2018-04-12 13:08:28,219 INFO L226 Difference]: Without dead ends: 534 [2018-04-12 13:08:28,219 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 92 GetRequests, 37 SyntacticMatches, 1 SemanticMatches, 54 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 724 ImplicationChecksByTransitivity, 45.4s TimeCoverageRelationStatistics Valid=696, Invalid=2362, Unknown=22, NotChecked=0, Total=3080 [2018-04-12 13:08:28,220 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 534 states. [2018-04-12 13:08:28,222 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 534 to 244. [2018-04-12 13:08:28,222 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 244 states. [2018-04-12 13:08:28,222 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 244 states to 244 states and 289 transitions. [2018-04-12 13:08:28,222 INFO L78 Accepts]: Start accepts. Automaton has 244 states and 289 transitions. Word has length 48 [2018-04-12 13:08:28,222 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-12 13:08:28,223 INFO L459 AbstractCegarLoop]: Abstraction has 244 states and 289 transitions. [2018-04-12 13:08:28,223 INFO L460 AbstractCegarLoop]: Interpolant automaton has 29 states. [2018-04-12 13:08:28,223 INFO L276 IsEmpty]: Start isEmpty. Operand 244 states and 289 transitions. [2018-04-12 13:08:28,223 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2018-04-12 13:08:28,223 INFO L347 BasicCegarLoop]: Found error trace [2018-04-12 13:08:28,223 INFO L355 BasicCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-12 13:08:28,223 INFO L408 AbstractCegarLoop]: === Iteration 25 === [mainErr51RequiresViolation, mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr31RequiresViolation, mainErr46RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr52AssertViolationMEMORY_FREE, mainErr15RequiresViolation, mainErr49RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr17RequiresViolation, mainErr42RequiresViolation, mainErr30RequiresViolation, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr44RequiresViolation, mainErr10RequiresViolation, mainErr43RequiresViolation, mainErr4RequiresViolation, mainErr50RequiresViolation, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr48RequiresViolation, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr45RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr54EnsuresViolationMEMORY_LEAK, mainErr9RequiresViolation, mainErr53AssertViolationMEMORY_FREE, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr34RequiresViolation, mainErr47RequiresViolation, mainErr14RequiresViolation, mainErr40RequiresViolation]=== [2018-04-12 13:08:28,223 INFO L82 PathProgramCache]: Analyzing trace with hash -1290412237, now seen corresponding path program 1 times [2018-04-12 13:08:28,223 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-04-12 13:08:28,223 INFO L68 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-04-12 13:08:28,224 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-12 13:08:28,224 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-12 13:08:28,224 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-12 13:08:28,230 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-12 13:08:28,231 WARN L250 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-12 13:08:28,336 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-12 13:08:28,337 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-04-12 13:08:28,337 INFO L213 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-04-12 13:08:28,345 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-12 13:08:28,370 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-12 13:08:28,373 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-12 13:08:28,393 INFO L700 Elim1Store]: detected not equals via solver [2018-04-12 13:08:28,394 INFO L700 Elim1Store]: detected not equals via solver [2018-04-12 13:08:28,394 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 21 [2018-04-12 13:08:28,395 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-12 13:08:28,405 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-12 13:08:28,405 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:23, output treesize:21 [2018-04-12 13:08:28,423 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 8 [2018-04-12 13:08:28,425 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-04-12 13:08:28,425 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-12 13:08:28,427 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-12 13:08:28,434 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-04-12 13:08:28,434 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:32, output treesize:29 [2018-04-12 13:08:28,490 INFO L700 Elim1Store]: detected not equals via solver [2018-04-12 13:08:28,495 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 2 new quantified variables, introduced 0 case distinctions, treesize of input 37 treesize of output 44 [2018-04-12 13:08:28,498 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 11 [2018-04-12 13:08:28,498 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-12 13:08:28,504 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-12 13:08:28,513 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-04-12 13:08:28,513 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:48, output treesize:40 [2018-04-12 13:08:28,566 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 50 treesize of output 40 [2018-04-12 13:08:28,569 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 25 [2018-04-12 13:08:28,569 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-12 13:08:28,583 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-12 13:08:28,591 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2018-04-12 13:08:28,591 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:55, output treesize:47 [2018-04-12 13:08:34,628 WARN L151 SmtUtils]: Spent 2010ms on a formula simplification. DAG size of input: 26 DAG size of output 22 [2018-04-12 13:08:36,656 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 38 treesize of output 26 [2018-04-12 13:08:36,658 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 1 [2018-04-12 13:08:36,658 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-12 13:08:36,670 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 10 [2018-04-12 13:08:36,671 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-04-12 13:08:36,673 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-12 13:08:36,677 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-04-12 13:08:36,677 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 4 variables, input treesize:43, output treesize:15 [2018-04-12 13:08:36,753 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 3 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-12 13:08:36,772 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-04-12 13:08:36,772 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 12] total 21 [2018-04-12 13:08:36,772 INFO L442 AbstractCegarLoop]: Interpolant automaton has 22 states [2018-04-12 13:08:36,772 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2018-04-12 13:08:36,772 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=87, Invalid=372, Unknown=3, NotChecked=0, Total=462 [2018-04-12 13:08:36,773 INFO L87 Difference]: Start difference. First operand 244 states and 289 transitions. Second operand 22 states. [2018-04-12 13:09:05,031 WARN L151 SmtUtils]: Spent 2025ms on a formula simplification. DAG size of input: 59 DAG size of output 35 [2018-04-12 13:09:13,085 WARN L151 SmtUtils]: Spent 2019ms on a formula simplification. DAG size of input: 51 DAG size of output 33 [2018-04-12 13:09:21,168 WARN L151 SmtUtils]: Spent 2015ms on a formula simplification. DAG size of input: 46 DAG size of output 28 [2018-04-12 13:09:23,282 WARN L151 SmtUtils]: Spent 2017ms on a formula simplification. DAG size of input: 53 DAG size of output 31 [2018-04-12 13:09:29,895 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-12 13:09:29,895 INFO L93 Difference]: Finished difference Result 766 states and 936 transitions. [2018-04-12 13:09:29,895 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2018-04-12 13:09:29,895 INFO L78 Accepts]: Start accepts. Automaton has 22 states. Word has length 50 [2018-04-12 13:09:29,895 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-12 13:09:29,896 INFO L225 Difference]: With dead ends: 766 [2018-04-12 13:09:29,897 INFO L226 Difference]: Without dead ends: 766 [2018-04-12 13:09:29,897 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 76 GetRequests, 41 SyntacticMatches, 2 SemanticMatches, 33 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 250 ImplicationChecksByTransitivity, 48.5s TimeCoverageRelationStatistics Valid=312, Invalid=859, Unknown=19, NotChecked=0, Total=1190 [2018-04-12 13:09:29,897 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 766 states. [2018-04-12 13:09:29,909 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 766 to 355. [2018-04-12 13:09:29,909 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 355 states. [2018-04-12 13:09:29,909 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 355 states to 355 states and 442 transitions. [2018-04-12 13:09:29,909 INFO L78 Accepts]: Start accepts. Automaton has 355 states and 442 transitions. Word has length 50 [2018-04-12 13:09:29,909 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-12 13:09:29,909 INFO L459 AbstractCegarLoop]: Abstraction has 355 states and 442 transitions. [2018-04-12 13:09:29,910 INFO L460 AbstractCegarLoop]: Interpolant automaton has 22 states. [2018-04-12 13:09:29,910 INFO L276 IsEmpty]: Start isEmpty. Operand 355 states and 442 transitions. [2018-04-12 13:09:29,910 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2018-04-12 13:09:29,910 INFO L347 BasicCegarLoop]: Found error trace [2018-04-12 13:09:29,910 INFO L355 BasicCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-12 13:09:29,910 INFO L408 AbstractCegarLoop]: === Iteration 26 === [mainErr51RequiresViolation, mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr31RequiresViolation, mainErr46RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr52AssertViolationMEMORY_FREE, mainErr15RequiresViolation, mainErr49RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr17RequiresViolation, mainErr42RequiresViolation, mainErr30RequiresViolation, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr44RequiresViolation, mainErr10RequiresViolation, mainErr43RequiresViolation, mainErr4RequiresViolation, mainErr50RequiresViolation, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr48RequiresViolation, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr45RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr54EnsuresViolationMEMORY_LEAK, mainErr9RequiresViolation, mainErr53AssertViolationMEMORY_FREE, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr34RequiresViolation, mainErr47RequiresViolation, mainErr14RequiresViolation, mainErr40RequiresViolation]=== [2018-04-12 13:09:29,910 INFO L82 PathProgramCache]: Analyzing trace with hash -1290412236, now seen corresponding path program 1 times [2018-04-12 13:09:29,910 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-04-12 13:09:29,910 INFO L68 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-04-12 13:09:29,911 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-12 13:09:29,911 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-12 13:09:29,911 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-12 13:09:29,918 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-12 13:09:29,919 WARN L250 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-12 13:09:30,076 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-12 13:09:30,076 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-04-12 13:09:30,076 INFO L213 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-04-12 13:09:30,081 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-12 13:09:30,112 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-12 13:09:30,116 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-12 13:09:30,132 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-04-12 13:09:30,132 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-12 13:09:30,143 INFO L700 Elim1Store]: detected not equals via solver [2018-04-12 13:09:30,144 INFO L700 Elim1Store]: detected not equals via solver [2018-04-12 13:09:30,144 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 4 [2018-04-12 13:09:30,145 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-12 13:09:30,153 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-12 13:09:30,154 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:26, output treesize:19 [2018-04-12 13:09:30,174 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 8 [2018-04-12 13:09:30,176 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-04-12 13:09:30,177 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-12 13:09:30,179 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-12 13:09:30,190 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 8 [2018-04-12 13:09:30,194 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-04-12 13:09:30,194 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-04-12 13:09:30,196 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-12 13:09:30,202 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-04-12 13:09:30,202 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 3 variables, input treesize:38, output treesize:31 [2018-04-12 13:09:30,239 INFO L700 Elim1Store]: detected not equals via solver [2018-04-12 13:09:30,242 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-04-12 13:09:30,244 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 11 [2018-04-12 13:09:30,244 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-12 13:09:30,248 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-12 13:09:30,262 INFO L700 Elim1Store]: detected not equals via solver [2018-04-12 13:09:30,266 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 2 new quantified variables, introduced 0 case distinctions, treesize of input 48 treesize of output 55 [2018-04-12 13:09:30,268 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 11 [2018-04-12 13:09:30,268 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-04-12 13:09:30,274 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-12 13:09:30,282 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-04-12 13:09:30,282 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 3 variables, input treesize:69, output treesize:53 [2018-04-12 13:09:30,327 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 40 treesize of output 35 [2018-04-12 13:09:30,329 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 25 [2018-04-12 13:09:30,330 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-12 13:09:30,334 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-12 13:09:30,345 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 74 treesize of output 64 [2018-04-12 13:09:30,348 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 25 [2018-04-12 13:09:30,348 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-04-12 13:09:30,354 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-12 13:09:30,361 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2018-04-12 13:09:30,361 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 4 variables, input treesize:89, output treesize:73 [2018-04-12 13:09:36,433 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 51 treesize of output 37 [2018-04-12 13:09:36,435 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 1 [2018-04-12 13:09:36,435 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-12 13:09:36,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 30 treesize of output 19 [2018-04-12 13:09:36,441 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-04-12 13:09:36,444 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-12 13:09:36,459 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 22 [2018-04-12 13:09:36,461 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 3 [2018-04-12 13:09:36,461 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2018-04-12 13:09:36,464 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 1 [2018-04-12 13:09:36,464 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2018-04-12 13:09:36,465 INFO L267 ElimStorePlain]: Start of recursive call 5: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-12 13:09:36,468 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-04-12 13:09:36,468 INFO L202 ElimStorePlain]: Needed 7 recursive calls to eliminate 5 variables, input treesize:65, output treesize:9 [2018-04-12 13:09:36,497 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-12 13:09:36,516 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-04-12 13:09:36,516 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 12] total 21 [2018-04-12 13:09:36,516 INFO L442 AbstractCegarLoop]: Interpolant automaton has 22 states [2018-04-12 13:09:36,516 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2018-04-12 13:09:36,516 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=66, Invalid=393, Unknown=3, NotChecked=0, Total=462 [2018-04-12 13:09:36,516 INFO L87 Difference]: Start difference. First operand 355 states and 442 transitions. Second operand 22 states. [2018-04-12 13:09:37,534 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-12 13:09:37,534 INFO L93 Difference]: Finished difference Result 707 states and 854 transitions. [2018-04-12 13:09:37,535 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2018-04-12 13:09:37,535 INFO L78 Accepts]: Start accepts. Automaton has 22 states. Word has length 50 [2018-04-12 13:09:37,535 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-12 13:09:37,536 INFO L225 Difference]: With dead ends: 707 [2018-04-12 13:09:37,536 INFO L226 Difference]: Without dead ends: 707 [2018-04-12 13:09:37,537 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 74 GetRequests, 41 SyntacticMatches, 2 SemanticMatches, 31 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 188 ImplicationChecksByTransitivity, 6.5s TimeCoverageRelationStatistics Valid=208, Invalid=845, Unknown=3, NotChecked=0, Total=1056 [2018-04-12 13:09:37,537 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 707 states. [2018-04-12 13:09:37,541 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 707 to 366. [2018-04-12 13:09:37,541 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 366 states. [2018-04-12 13:09:37,541 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 366 states to 366 states and 462 transitions. [2018-04-12 13:09:37,541 INFO L78 Accepts]: Start accepts. Automaton has 366 states and 462 transitions. Word has length 50 [2018-04-12 13:09:37,541 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-12 13:09:37,542 INFO L459 AbstractCegarLoop]: Abstraction has 366 states and 462 transitions. [2018-04-12 13:09:37,542 INFO L460 AbstractCegarLoop]: Interpolant automaton has 22 states. [2018-04-12 13:09:37,542 INFO L276 IsEmpty]: Start isEmpty. Operand 366 states and 462 transitions. [2018-04-12 13:09:37,542 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2018-04-12 13:09:37,542 INFO L347 BasicCegarLoop]: Found error trace [2018-04-12 13:09:37,542 INFO L355 BasicCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-12 13:09:37,542 INFO L408 AbstractCegarLoop]: === Iteration 27 === [mainErr51RequiresViolation, mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr31RequiresViolation, mainErr46RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr52AssertViolationMEMORY_FREE, mainErr15RequiresViolation, mainErr49RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr17RequiresViolation, mainErr42RequiresViolation, mainErr30RequiresViolation, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr44RequiresViolation, mainErr10RequiresViolation, mainErr43RequiresViolation, mainErr4RequiresViolation, mainErr50RequiresViolation, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr48RequiresViolation, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr45RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr54EnsuresViolationMEMORY_LEAK, mainErr9RequiresViolation, mainErr53AssertViolationMEMORY_FREE, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr34RequiresViolation, mainErr47RequiresViolation, mainErr14RequiresViolation, mainErr40RequiresViolation]=== [2018-04-12 13:09:37,542 INFO L82 PathProgramCache]: Analyzing trace with hash 721092915, now seen corresponding path program 1 times [2018-04-12 13:09:37,542 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-04-12 13:09:37,542 INFO L68 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-04-12 13:09:37,543 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-12 13:09:37,543 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-12 13:09:37,543 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-12 13:09:37,550 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-12 13:09:37,550 WARN L250 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-12 13:09:37,679 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 2 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-12 13:09:37,680 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-04-12 13:09:37,680 INFO L213 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-04-12 13:09:37,685 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-12 13:09:37,700 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-12 13:09:37,702 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-12 13:09:37,735 INFO L700 Elim1Store]: detected not equals via solver [2018-04-12 13:09:37,735 INFO L700 Elim1Store]: detected not equals via solver [2018-04-12 13:09:37,736 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 21 [2018-04-12 13:09:37,737 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-12 13:09:37,744 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-12 13:09:37,744 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:40, output treesize:38 [2018-04-12 13:09:37,773 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 21 treesize of output 16 [2018-04-12 13:09:37,775 INFO L700 Elim1Store]: detected not equals via solver [2018-04-12 13:09:37,776 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 23 [2018-04-12 13:09:37,776 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-12 13:09:37,780 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-12 13:09:37,791 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 21 treesize of output 16 [2018-04-12 13:09:37,793 INFO L700 Elim1Store]: detected not equals via solver [2018-04-12 13:09:37,794 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 23 [2018-04-12 13:09:37,794 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-04-12 13:09:37,797 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-12 13:09:37,804 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-04-12 13:09:37,805 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 3 variables, input treesize:61, output treesize:56 [2018-04-12 13:09:37,864 INFO L700 Elim1Store]: detected not equals via solver [2018-04-12 13:09:37,868 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 2 new quantified variables, introduced 0 case distinctions, treesize of input 75 treesize of output 82 [2018-04-12 13:09:37,873 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 13 [2018-04-12 13:09:37,873 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-12 13:09:37,880 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-12 13:09:37,892 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 40 treesize of output 41 [2018-04-12 13:09:37,894 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 13 [2018-04-12 13:09:37,894 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-04-12 13:09:37,898 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-12 13:09:37,907 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-04-12 13:09:37,907 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 3 variables, input treesize:102, output treesize:82 [2018-04-12 13:09:37,985 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 55 treesize of output 48 [2018-04-12 13:09:37,988 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 22 treesize of output 29 [2018-04-12 13:09:37,988 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-12 13:09:37,995 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-12 13:09:38,012 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 95 treesize of output 81 [2018-04-12 13:09:38,024 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 22 treesize of output 29 [2018-04-12 13:09:38,024 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-04-12 13:09:38,032 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-12 13:09:38,043 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2018-04-12 13:09:38,043 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 4 variables, input treesize:126, output treesize:106 [2018-04-12 13:09:44,189 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 39 treesize of output 35 [2018-04-12 13:09:44,190 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 1 [2018-04-12 13:09:44,191 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-12 13:09:44,196 INFO L700 Elim1Store]: detected not equals via solver [2018-04-12 13:09:44,197 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 10 [2018-04-12 13:09:44,197 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-04-12 13:09:44,199 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-12 13:09:44,205 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-04-12 13:09:44,205 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 2 variables, input treesize:94, output treesize:59 [2018-04-12 13:09:44,287 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-12 13:09:44,304 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-04-12 13:09:44,304 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [16] imperfect sequences [15] total 25 [2018-04-12 13:09:44,304 INFO L442 AbstractCegarLoop]: Interpolant automaton has 25 states [2018-04-12 13:09:44,305 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2018-04-12 13:09:44,305 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=105, Invalid=492, Unknown=3, NotChecked=0, Total=600 [2018-04-12 13:09:44,305 INFO L87 Difference]: Start difference. First operand 366 states and 462 transitions. Second operand 25 states. [2018-04-12 13:10:24,092 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-12 13:10:24,092 INFO L93 Difference]: Finished difference Result 687 states and 841 transitions. [2018-04-12 13:10:24,092 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 38 states. [2018-04-12 13:10:24,093 INFO L78 Accepts]: Start accepts. Automaton has 25 states. Word has length 50 [2018-04-12 13:10:24,093 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-12 13:10:24,094 INFO L225 Difference]: With dead ends: 687 [2018-04-12 13:10:24,094 INFO L226 Difference]: Without dead ends: 687 [2018-04-12 13:10:24,094 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 92 GetRequests, 40 SyntacticMatches, 3 SemanticMatches, 49 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 632 ImplicationChecksByTransitivity, 33.3s TimeCoverageRelationStatistics Valid=483, Invalid=2051, Unknown=16, NotChecked=0, Total=2550 [2018-04-12 13:10:24,095 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 687 states. [2018-04-12 13:10:24,097 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 687 to 438. [2018-04-12 13:10:24,097 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 438 states. [2018-04-12 13:10:24,098 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 438 states to 438 states and 568 transitions. [2018-04-12 13:10:24,098 INFO L78 Accepts]: Start accepts. Automaton has 438 states and 568 transitions. Word has length 50 [2018-04-12 13:10:24,098 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-12 13:10:24,098 INFO L459 AbstractCegarLoop]: Abstraction has 438 states and 568 transitions. [2018-04-12 13:10:24,098 INFO L460 AbstractCegarLoop]: Interpolant automaton has 25 states. [2018-04-12 13:10:24,098 INFO L276 IsEmpty]: Start isEmpty. Operand 438 states and 568 transitions. [2018-04-12 13:10:24,099 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2018-04-12 13:10:24,099 INFO L347 BasicCegarLoop]: Found error trace [2018-04-12 13:10:24,099 INFO L355 BasicCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-12 13:10:24,099 INFO L408 AbstractCegarLoop]: === Iteration 28 === [mainErr51RequiresViolation, mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr31RequiresViolation, mainErr46RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr52AssertViolationMEMORY_FREE, mainErr15RequiresViolation, mainErr49RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr17RequiresViolation, mainErr42RequiresViolation, mainErr30RequiresViolation, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr44RequiresViolation, mainErr10RequiresViolation, mainErr43RequiresViolation, mainErr4RequiresViolation, mainErr50RequiresViolation, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr48RequiresViolation, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr45RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr54EnsuresViolationMEMORY_LEAK, mainErr9RequiresViolation, mainErr53AssertViolationMEMORY_FREE, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr34RequiresViolation, mainErr47RequiresViolation, mainErr14RequiresViolation, mainErr40RequiresViolation]=== [2018-04-12 13:10:24,099 INFO L82 PathProgramCache]: Analyzing trace with hash -660150828, now seen corresponding path program 1 times [2018-04-12 13:10:24,099 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-04-12 13:10:24,099 INFO L68 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-04-12 13:10:24,100 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-12 13:10:24,100 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-12 13:10:24,100 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-12 13:10:24,109 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-12 13:10:24,110 WARN L250 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-12 13:10:24,300 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 2 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-12 13:10:24,300 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-04-12 13:10:24,301 INFO L213 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-04-12 13:10:24,305 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-12 13:10:24,318 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-12 13:10:24,320 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-12 13:10:24,339 INFO L700 Elim1Store]: detected not equals via solver [2018-04-12 13:10:24,340 INFO L700 Elim1Store]: detected not equals via solver [2018-04-12 13:10:24,340 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-04-12 13:10:24,340 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-12 13:10:24,343 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-12 13:10:24,343 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:21, output treesize:15 [2018-04-12 13:10:24,354 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 8 [2018-04-12 13:10:24,355 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-04-12 13:10:24,355 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-12 13:10:24,356 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-12 13:10:24,360 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-04-12 13:10:24,360 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:26, output treesize:23 [2018-04-12 13:10:24,381 INFO L700 Elim1Store]: detected not equals via solver [2018-04-12 13:10:24,384 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 43 [2018-04-12 13:10:24,386 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 11 [2018-04-12 13:10:24,386 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-12 13:10:24,389 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-12 13:10:24,394 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-04-12 13:10:24,394 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:42, output treesize:34 [2018-04-12 13:10:24,426 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 49 treesize of output 39 [2018-04-12 13:10:24,428 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 25 [2018-04-12 13:10:24,428 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-12 13:10:24,432 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-12 13:10:24,435 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2018-04-12 13:10:24,435 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:49, output treesize:41 [2018-04-12 13:10:30,493 WARN L151 SmtUtils]: Spent 2013ms on a formula simplification. DAG size of input: 22 DAG size of output 18 [2018-04-12 13:10:32,512 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 37 treesize of output 25 [2018-04-12 13:10:32,513 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 1 [2018-04-12 13:10:32,513 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-12 13:10:32,516 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 18 treesize of output 9 [2018-04-12 13:10:32,516 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-04-12 13:10:32,517 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-12 13:10:32,519 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-04-12 13:10:32,519 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 4 variables, input treesize:37, output treesize:4 [2018-04-12 13:10:32,546 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 2 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-12 13:10:32,563 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-04-12 13:10:32,563 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 13] total 26 [2018-04-12 13:10:32,564 INFO L442 AbstractCegarLoop]: Interpolant automaton has 26 states [2018-04-12 13:10:32,564 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2018-04-12 13:10:32,564 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=90, Invalid=557, Unknown=3, NotChecked=0, Total=650 [2018-04-12 13:10:32,564 INFO L87 Difference]: Start difference. First operand 438 states and 568 transitions. Second operand 26 states. [2018-04-12 13:11:00,946 WARN L151 SmtUtils]: Spent 2036ms on a formula simplification. DAG size of input: 75 DAG size of output 50 [2018-04-12 13:11:09,014 WARN L151 SmtUtils]: Spent 2036ms on a formula simplification. DAG size of input: 64 DAG size of output 48 [2018-04-12 13:11:23,143 WARN L151 SmtUtils]: Spent 2019ms on a formula simplification. DAG size of input: 50 DAG size of output 36 [2018-04-12 13:11:25,190 WARN L151 SmtUtils]: Spent 2023ms on a formula simplification. DAG size of input: 53 DAG size of output 39 [2018-04-12 13:11:27,246 WARN L151 SmtUtils]: Spent 2034ms on a formula simplification. DAG size of input: 54 DAG size of output 40 [2018-04-12 13:11:29,300 WARN L151 SmtUtils]: Spent 2021ms on a formula simplification. DAG size of input: 53 DAG size of output 39 [2018-04-12 13:11:43,732 WARN L151 SmtUtils]: Spent 2026ms on a formula simplification. DAG size of input: 57 DAG size of output 43 [2018-04-12 13:11:43,745 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-12 13:11:43,745 INFO L93 Difference]: Finished difference Result 760 states and 953 transitions. [2018-04-12 13:11:43,746 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2018-04-12 13:11:43,746 INFO L78 Accepts]: Start accepts. Automaton has 26 states. Word has length 52 [2018-04-12 13:11:43,746 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-12 13:11:43,747 INFO L225 Difference]: With dead ends: 760 [2018-04-12 13:11:43,747 INFO L226 Difference]: Without dead ends: 752 [2018-04-12 13:11:43,748 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 91 GetRequests, 43 SyntacticMatches, 2 SemanticMatches, 46 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 438 ImplicationChecksByTransitivity, 66.9s TimeCoverageRelationStatistics Valid=484, Invalid=1747, Unknown=25, NotChecked=0, Total=2256 [2018-04-12 13:11:43,748 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 752 states. [2018-04-12 13:11:43,752 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 752 to 387. [2018-04-12 13:11:43,753 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 387 states. [2018-04-12 13:11:43,753 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 387 states to 387 states and 496 transitions. [2018-04-12 13:11:43,754 INFO L78 Accepts]: Start accepts. Automaton has 387 states and 496 transitions. Word has length 52 [2018-04-12 13:11:43,754 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-12 13:11:43,754 INFO L459 AbstractCegarLoop]: Abstraction has 387 states and 496 transitions. [2018-04-12 13:11:43,754 INFO L460 AbstractCegarLoop]: Interpolant automaton has 26 states. [2018-04-12 13:11:43,754 INFO L276 IsEmpty]: Start isEmpty. Operand 387 states and 496 transitions. [2018-04-12 13:11:43,755 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2018-04-12 13:11:43,755 INFO L347 BasicCegarLoop]: Found error trace [2018-04-12 13:11:43,755 INFO L355 BasicCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-12 13:11:43,755 INFO L408 AbstractCegarLoop]: === Iteration 29 === [mainErr51RequiresViolation, mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr31RequiresViolation, mainErr46RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr52AssertViolationMEMORY_FREE, mainErr15RequiresViolation, mainErr49RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr17RequiresViolation, mainErr42RequiresViolation, mainErr30RequiresViolation, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr44RequiresViolation, mainErr10RequiresViolation, mainErr43RequiresViolation, mainErr4RequiresViolation, mainErr50RequiresViolation, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr48RequiresViolation, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr45RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr54EnsuresViolationMEMORY_LEAK, mainErr9RequiresViolation, mainErr53AssertViolationMEMORY_FREE, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr34RequiresViolation, mainErr47RequiresViolation, mainErr14RequiresViolation, mainErr40RequiresViolation]=== [2018-04-12 13:11:43,755 INFO L82 PathProgramCache]: Analyzing trace with hash -338982956, now seen corresponding path program 1 times [2018-04-12 13:11:43,755 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-04-12 13:11:43,755 INFO L68 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-04-12 13:11:43,756 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-12 13:11:43,756 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-12 13:11:43,756 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-12 13:11:43,767 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-12 13:11:43,767 WARN L250 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-12 13:11:43,866 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-12 13:11:43,866 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-04-12 13:11:43,866 INFO L213 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-04-12 13:11:43,871 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-12 13:11:43,887 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-12 13:11:43,888 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-12 13:11:43,933 INFO L700 Elim1Store]: detected not equals via solver [2018-04-12 13:11:43,934 INFO L700 Elim1Store]: detected not equals via solver [2018-04-12 13:11:43,934 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 21 [2018-04-12 13:11:43,934 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-12 13:11:43,955 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-12 13:11:43,955 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:29, output treesize:27 [2018-04-12 13:11:43,974 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 10 [2018-04-12 13:11:43,976 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 9 [2018-04-12 13:11:43,976 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-12 13:11:43,977 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-12 13:11:43,986 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-04-12 13:11:43,986 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:40, output treesize:39 [2018-04-12 13:11:44,029 INFO L700 Elim1Store]: detected not equals via solver [2018-04-12 13:11:44,033 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 45 treesize of output 42 [2018-04-12 13:11:44,034 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 13 [2018-04-12 13:11:44,035 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-12 13:11:44,039 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-12 13:11:44,047 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-04-12 13:11:44,048 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:62, output treesize:52 [2018-04-12 13:11:44,106 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 60 treesize of output 46 [2018-04-12 13:11:44,109 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 22 treesize of output 29 [2018-04-12 13:11:44,109 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-12 13:11:44,114 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-12 13:11:44,124 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-2 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2018-04-12 13:11:44,124 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:74, output treesize:64 [2018-04-12 13:11:52,208 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 59 treesize of output 44 [2018-04-12 13:11:52,210 INFO L682 Elim1Store]: detected equality via solver [2018-04-12 13:11:52,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, 1 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 17 [2018-04-12 13:11:52,211 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-12 13:11:52,220 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 1 [2018-04-12 13:11:52,220 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-04-12 13:11:52,223 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-12 13:11:52,231 INFO L267 ElimStorePlain]: Start of recursive call 1: 5 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-04-12 13:11:52,231 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 6 variables, input treesize:76, output treesize:15 [2018-04-12 13:11:52,317 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 3 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-12 13:11:52,334 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-04-12 13:11:52,335 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 16] total 26 [2018-04-12 13:11:52,335 INFO L442 AbstractCegarLoop]: Interpolant automaton has 27 states [2018-04-12 13:11:52,335 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. [2018-04-12 13:11:52,335 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=133, Invalid=565, Unknown=4, NotChecked=0, Total=702 [2018-04-12 13:11:52,335 INFO L87 Difference]: Start difference. First operand 387 states and 496 transitions. Second operand 27 states. [2018-04-12 13:11:59,282 WARN L151 SmtUtils]: Spent 4035ms on a formula simplification. DAG size of input: 65 DAG size of output 58 [2018-04-12 13:12:00,665 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-12 13:12:00,666 INFO L93 Difference]: Finished difference Result 1083 states and 1382 transitions. [2018-04-12 13:12:00,666 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2018-04-12 13:12:00,666 INFO L78 Accepts]: Start accepts. Automaton has 27 states. Word has length 52 [2018-04-12 13:12:00,666 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-12 13:12:00,668 INFO L225 Difference]: With dead ends: 1083 [2018-04-12 13:12:00,668 INFO L226 Difference]: Without dead ends: 1083 [2018-04-12 13:12:00,668 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 88 GetRequests, 41 SyntacticMatches, 0 SemanticMatches, 47 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 542 ImplicationChecksByTransitivity, 12.8s TimeCoverageRelationStatistics Valid=566, Invalid=1782, Unknown=4, NotChecked=0, Total=2352 [2018-04-12 13:12:00,669 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1083 states. [2018-04-12 13:12:00,673 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1083 to 513. [2018-04-12 13:12:00,673 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 513 states. [2018-04-12 13:12:00,674 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 513 states to 513 states and 667 transitions. [2018-04-12 13:12:00,675 INFO L78 Accepts]: Start accepts. Automaton has 513 states and 667 transitions. Word has length 52 [2018-04-12 13:12:00,675 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-12 13:12:00,675 INFO L459 AbstractCegarLoop]: Abstraction has 513 states and 667 transitions. [2018-04-12 13:12:00,675 INFO L460 AbstractCegarLoop]: Interpolant automaton has 27 states. [2018-04-12 13:12:00,675 INFO L276 IsEmpty]: Start isEmpty. Operand 513 states and 667 transitions. [2018-04-12 13:12:00,675 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2018-04-12 13:12:00,675 INFO L347 BasicCegarLoop]: Found error trace [2018-04-12 13:12:00,675 INFO L355 BasicCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-12 13:12:00,676 INFO L408 AbstractCegarLoop]: === Iteration 30 === [mainErr51RequiresViolation, mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr31RequiresViolation, mainErr46RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr52AssertViolationMEMORY_FREE, mainErr15RequiresViolation, mainErr49RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr17RequiresViolation, mainErr42RequiresViolation, mainErr30RequiresViolation, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr44RequiresViolation, mainErr10RequiresViolation, mainErr43RequiresViolation, mainErr4RequiresViolation, mainErr50RequiresViolation, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr48RequiresViolation, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr45RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr54EnsuresViolationMEMORY_LEAK, mainErr9RequiresViolation, mainErr53AssertViolationMEMORY_FREE, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr34RequiresViolation, mainErr47RequiresViolation, mainErr14RequiresViolation, mainErr40RequiresViolation]=== [2018-04-12 13:12:00,676 INFO L82 PathProgramCache]: Analyzing trace with hash -338982955, now seen corresponding path program 1 times [2018-04-12 13:12:00,676 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-04-12 13:12:00,676 INFO L68 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-04-12 13:12:00,676 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-12 13:12:00,676 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-12 13:12:00,676 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-12 13:12:00,685 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-12 13:12:00,686 WARN L250 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-12 13:12:00,918 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-12 13:12:00,918 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-04-12 13:12:00,918 INFO L213 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 10 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 10 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-04-12 13:12:00,928 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-12 13:12:00,943 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-12 13:12:00,945 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-12 13:12:00,965 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 10 [2018-04-12 13:12:00,966 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 9 [2018-04-12 13:12:00,966 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-12 13:12:00,967 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-12 13:12:00,972 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 10 [2018-04-12 13:12:00,973 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 9 [2018-04-12 13:12:00,973 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-04-12 13:12:00,974 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-12 13:12:00,978 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-04-12 13:12:00,978 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 2 variables, input treesize:35, output treesize:27 [2018-04-12 13:12:01,004 INFO L700 Elim1Store]: detected not equals via solver [2018-04-12 13:12:01,005 INFO L700 Elim1Store]: detected not equals via solver [2018-04-12 13:12:01,005 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 4 [2018-04-12 13:12:01,005 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-12 13:12:01,012 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-04-12 13:12:01,012 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-12 13:12:01,018 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-12 13:12:01,019 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:44, output treesize:37 [2018-04-12 13:12:01,037 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 23 treesize of output 21 [2018-04-12 13:12:01,043 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 18 treesize of output 27 [2018-04-12 13:12:01,043 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 2 xjuncts. [2018-04-12 13:12:01,051 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-04-12 13:12:01,068 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 23 treesize of output 21 [2018-04-12 13:12:01,070 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 19 [2018-04-12 13:12:01,070 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-04-12 13:12:01,073 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-12 13:12:01,086 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-2 vars, End of recursive call: and 2 xjuncts. [2018-04-12 13:12:01,086 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 3 variables, input treesize:60, output treesize:109 [2018-04-12 13:12:01,160 INFO L700 Elim1Store]: detected not equals via solver [2018-04-12 13:12:01,163 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 86 treesize of output 87 [2018-04-12 13:12:01,165 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 13 [2018-04-12 13:12:01,165 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-12 13:12:01,192 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-12 13:12:01,224 INFO L700 Elim1Store]: detected not equals via solver [2018-04-12 13:12:01,228 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 76 treesize of output 70 [2018-04-12 13:12:01,230 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 13 [2018-04-12 13:12:01,230 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-04-12 13:12:01,238 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-12 13:12:01,267 INFO L700 Elim1Store]: detected not equals via solver [2018-04-12 13:12:01,270 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 101 treesize of output 102 [2018-04-12 13:12:01,272 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 13 [2018-04-12 13:12:01,272 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2018-04-12 13:12:01,284 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-12 13:12:01,311 INFO L700 Elim1Store]: detected not equals via solver [2018-04-12 13:12:01,318 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 91 treesize of output 85 [2018-04-12 13:12:01,320 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 13 [2018-04-12 13:12:01,320 INFO L267 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 1 xjuncts. [2018-04-12 13:12:01,330 INFO L267 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-12 13:12:01,354 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 4 dim-2 vars, End of recursive call: 2 dim-0 vars, and 2 xjuncts. [2018-04-12 13:12:01,354 INFO L202 ElimStorePlain]: Needed 9 recursive calls to eliminate 6 variables, input treesize:188, output treesize:148 [2018-04-12 13:12:01,449 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 128 treesize of output 111 [2018-04-12 13:12:01,451 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 22 treesize of output 29 [2018-04-12 13:12:01,452 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-12 13:12:01,465 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-12 13:12:01,511 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 110 treesize of output 96 [2018-04-12 13:12:01,514 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 22 treesize of output 29 [2018-04-12 13:12:01,514 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-04-12 13:12:01,524 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-12 13:12:01,557 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 100 treesize of output 83 [2018-04-12 13:12:01,559 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 22 treesize of output 29 [2018-04-12 13:12:01,560 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2018-04-12 13:12:01,569 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-12 13:12:01,599 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 118 treesize of output 104 [2018-04-12 13:12:01,602 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 22 treesize of output 29 [2018-04-12 13:12:01,602 INFO L267 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 1 xjuncts. [2018-04-12 13:12:01,614 INFO L267 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-12 13:12:01,638 INFO L267 ElimStorePlain]: Start of recursive call 1: 5 dim-0 vars, 4 dim-2 vars, End of recursive call: 5 dim-0 vars, and 2 xjuncts. [2018-04-12 13:12:01,638 INFO L202 ElimStorePlain]: Needed 9 recursive calls to eliminate 9 variables, input treesize:239, output treesize:199 [2018-04-12 13:12:08,094 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 71 treesize of output 60 [2018-04-12 13:12:08,096 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 1 [2018-04-12 13:12:08,096 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-12 13:12:08,102 INFO L682 Elim1Store]: detected equality via solver [2018-04-12 13:12:08,102 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 46 treesize of output 30 [2018-04-12 13:12:08,102 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-04-12 13:12:08,107 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-12 13:12:08,117 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 26 [2018-04-12 13:12:08,118 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 1 [2018-04-12 13:12:08,118 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2018-04-12 13:12:08,122 INFO L682 Elim1Store]: detected equality via solver [2018-04-12 13:12:08,123 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11 [2018-04-12 13:12:08,123 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2018-04-12 13:12:08,124 INFO L267 ElimStorePlain]: Start of recursive call 5: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-12 13:12:08,130 INFO L267 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-04-12 13:12:08,130 INFO L202 ElimStorePlain]: Needed 7 recursive calls to eliminate 6 variables, input treesize:98, output treesize:13 [2018-04-12 13:12:08,180 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-12 13:12:08,197 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-04-12 13:12:08,198 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 19] total 31 [2018-04-12 13:12:08,198 INFO L442 AbstractCegarLoop]: Interpolant automaton has 32 states [2018-04-12 13:12:08,198 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 32 interpolants. [2018-04-12 13:12:08,198 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=112, Invalid=877, Unknown=3, NotChecked=0, Total=992 [2018-04-12 13:12:08,198 INFO L87 Difference]: Start difference. First operand 513 states and 667 transitions. Second operand 32 states. [2018-04-12 13:12:38,850 WARN L151 SmtUtils]: Spent 30168ms on a formula simplification. DAG size of input: 155 DAG size of output 96 [2018-04-12 13:13:09,036 WARN L151 SmtUtils]: Spent 30151ms on a formula simplification. DAG size of input: 148 DAG size of output 93 [2018-04-12 13:13:39,250 WARN L151 SmtUtils]: Spent 30167ms on a formula simplification. DAG size of input: 165 DAG size of output 102 [2018-04-12 13:13:39,595 WARN L151 SmtUtils]: Spent 121ms on a formula simplification. DAG size of input: 128 DAG size of output 69 [2018-04-12 13:13:39,821 WARN L151 SmtUtils]: Spent 136ms on a formula simplification. DAG size of input: 132 DAG size of output 90 [2018-04-12 13:13:40,072 WARN L151 SmtUtils]: Spent 178ms on a formula simplification. DAG size of input: 173 DAG size of output 107 [2018-04-12 13:13:40,310 WARN L151 SmtUtils]: Spent 177ms on a formula simplification. DAG size of input: 131 DAG size of output 56 [2018-04-12 13:14:07,954 WARN L151 SmtUtils]: Spent 136ms on a formula simplification. DAG size of input: 128 DAG size of output 67 [2018-04-12 13:14:10,368 WARN L151 SmtUtils]: Spent 106ms on a formula simplification. DAG size of input: 135 DAG size of output 74 [2018-04-12 13:14:10,383 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-12 13:14:10,383 INFO L93 Difference]: Finished difference Result 1081 states and 1371 transitions. [2018-04-12 13:14:10,383 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2018-04-12 13:14:10,383 INFO L78 Accepts]: Start accepts. Automaton has 32 states. Word has length 52 [2018-04-12 13:14:10,383 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-12 13:14:10,385 INFO L225 Difference]: With dead ends: 1081 [2018-04-12 13:14:10,385 INFO L226 Difference]: Without dead ends: 1081 [2018-04-12 13:14:10,385 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 93 GetRequests, 35 SyntacticMatches, 1 SemanticMatches, 57 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 834 ImplicationChecksByTransitivity, 117.2s TimeCoverageRelationStatistics Valid=631, Invalid=2779, Unknown=12, NotChecked=0, Total=3422 [2018-04-12 13:14:10,386 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1081 states. [2018-04-12 13:14:10,392 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1081 to 525. [2018-04-12 13:14:10,392 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 525 states. [2018-04-12 13:14:10,393 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 525 states to 525 states and 687 transitions. [2018-04-12 13:14:10,393 INFO L78 Accepts]: Start accepts. Automaton has 525 states and 687 transitions. Word has length 52 [2018-04-12 13:14:10,393 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-12 13:14:10,393 INFO L459 AbstractCegarLoop]: Abstraction has 525 states and 687 transitions. [2018-04-12 13:14:10,393 INFO L460 AbstractCegarLoop]: Interpolant automaton has 32 states. [2018-04-12 13:14:10,393 INFO L276 IsEmpty]: Start isEmpty. Operand 525 states and 687 transitions. [2018-04-12 13:14:10,394 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2018-04-12 13:14:10,394 INFO L347 BasicCegarLoop]: Found error trace [2018-04-12 13:14:10,394 INFO L355 BasicCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-12 13:14:10,394 INFO L408 AbstractCegarLoop]: === Iteration 31 === [mainErr51RequiresViolation, mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr31RequiresViolation, mainErr46RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr52AssertViolationMEMORY_FREE, mainErr15RequiresViolation, mainErr49RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr17RequiresViolation, mainErr42RequiresViolation, mainErr30RequiresViolation, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr44RequiresViolation, mainErr10RequiresViolation, mainErr43RequiresViolation, mainErr4RequiresViolation, mainErr50RequiresViolation, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr48RequiresViolation, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr45RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr54EnsuresViolationMEMORY_LEAK, mainErr9RequiresViolation, mainErr53AssertViolationMEMORY_FREE, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr34RequiresViolation, mainErr47RequiresViolation, mainErr14RequiresViolation, mainErr40RequiresViolation]=== [2018-04-12 13:14:10,395 INFO L82 PathProgramCache]: Analyzing trace with hash -344708594, now seen corresponding path program 1 times [2018-04-12 13:14:10,395 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-04-12 13:14:10,395 INFO L68 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-04-12 13:14:10,395 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-12 13:14:10,395 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-12 13:14:10,396 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-12 13:14:10,402 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-12 13:14:10,403 WARN L250 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-12 13:14:10,438 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2018-04-12 13:14:10,439 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-04-12 13:14:10,439 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-04-12 13:14:10,439 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-04-12 13:14:10,439 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-04-12 13:14:10,439 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2018-04-12 13:14:10,439 INFO L87 Difference]: Start difference. First operand 525 states and 687 transitions. Second operand 6 states. [2018-04-12 13:14:10,545 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-12 13:14:10,545 INFO L93 Difference]: Finished difference Result 526 states and 681 transitions. [2018-04-12 13:14:10,545 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-04-12 13:14:10,545 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 52 [2018-04-12 13:14:10,545 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-12 13:14:10,546 INFO L225 Difference]: With dead ends: 526 [2018-04-12 13:14:10,546 INFO L226 Difference]: Without dead ends: 526 [2018-04-12 13:14:10,547 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=25, Invalid=47, Unknown=0, NotChecked=0, Total=72 [2018-04-12 13:14:10,547 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 526 states. [2018-04-12 13:14:10,550 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 526 to 525. [2018-04-12 13:14:10,550 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 525 states. [2018-04-12 13:14:10,551 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 525 states to 525 states and 681 transitions. [2018-04-12 13:14:10,552 INFO L78 Accepts]: Start accepts. Automaton has 525 states and 681 transitions. Word has length 52 [2018-04-12 13:14:10,552 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-12 13:14:10,552 INFO L459 AbstractCegarLoop]: Abstraction has 525 states and 681 transitions. [2018-04-12 13:14:10,552 INFO L460 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-04-12 13:14:10,552 INFO L276 IsEmpty]: Start isEmpty. Operand 525 states and 681 transitions. [2018-04-12 13:14:10,553 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2018-04-12 13:14:10,553 INFO L347 BasicCegarLoop]: Found error trace [2018-04-12 13:14:10,553 INFO L355 BasicCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-12 13:14:10,553 INFO L408 AbstractCegarLoop]: === Iteration 32 === [mainErr51RequiresViolation, mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr31RequiresViolation, mainErr46RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr52AssertViolationMEMORY_FREE, mainErr15RequiresViolation, mainErr49RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr17RequiresViolation, mainErr42RequiresViolation, mainErr30RequiresViolation, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr44RequiresViolation, mainErr10RequiresViolation, mainErr43RequiresViolation, mainErr4RequiresViolation, mainErr50RequiresViolation, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr48RequiresViolation, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr45RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr54EnsuresViolationMEMORY_LEAK, mainErr9RequiresViolation, mainErr53AssertViolationMEMORY_FREE, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr34RequiresViolation, mainErr47RequiresViolation, mainErr14RequiresViolation, mainErr40RequiresViolation]=== [2018-04-12 13:14:10,553 INFO L82 PathProgramCache]: Analyzing trace with hash 1911310923, now seen corresponding path program 1 times [2018-04-12 13:14:10,553 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-04-12 13:14:10,554 INFO L68 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-04-12 13:14:10,554 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-12 13:14:10,554 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-12 13:14:10,554 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-12 13:14:10,563 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-12 13:14:10,564 WARN L250 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-12 13:14:10,769 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 2 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-12 13:14:10,770 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-04-12 13:14:10,770 INFO L213 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 11 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 11 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-04-12 13:14:10,777 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-12 13:14:10,801 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-12 13:14:10,804 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-12 13:14:10,860 INFO L700 Elim1Store]: detected not equals via solver [2018-04-12 13:14:10,861 INFO L700 Elim1Store]: detected not equals via solver [2018-04-12 13:14:10,861 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-04-12 13:14:10,862 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-12 13:14:10,868 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-12 13:14:10,868 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:24, output treesize:18 [2018-04-12 13:14:10,883 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 10 [2018-04-12 13:14:10,884 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 9 [2018-04-12 13:14:10,885 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-12 13:14:10,886 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-12 13:14:10,891 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-04-12 13:14:10,891 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:31, output treesize:30 [2018-04-12 13:14:10,920 INFO L700 Elim1Store]: detected not equals via solver [2018-04-12 13:14:10,924 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 44 treesize of output 41 [2018-04-12 13:14:10,925 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 13 [2018-04-12 13:14:10,925 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-12 13:14:10,929 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-12 13:14:10,935 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-04-12 13:14:10,935 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:53, output treesize:43 [2018-04-12 13:14:10,969 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 59 treesize of output 45 [2018-04-12 13:14:10,971 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 22 treesize of output 29 [2018-04-12 13:14:10,971 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-12 13:14:10,975 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-12 13:14:10,981 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-2 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2018-04-12 13:14:10,981 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:65, output treesize:55 [2018-04-12 13:14:19,040 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 58 treesize of output 43 [2018-04-12 13:14:19,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, 0 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 1 [2018-04-12 13:14:19,044 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-12 13:14:19,059 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 24 treesize of output 21 [2018-04-12 13:14:19,059 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 2 xjuncts. [2018-04-12 13:14:19,062 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-04-12 13:14:19,068 INFO L267 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-2 vars, End of recursive call: and 2 xjuncts. [2018-04-12 13:14:19,068 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 5 variables, input treesize:67, output treesize:22 [2018-04-12 13:14:19,123 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 2 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-12 13:14:19,140 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-04-12 13:14:19,140 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 18] total 29 [2018-04-12 13:14:19,140 INFO L442 AbstractCegarLoop]: Interpolant automaton has 29 states [2018-04-12 13:14:19,140 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2018-04-12 13:14:19,141 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=95, Invalid=713, Unknown=4, NotChecked=0, Total=812 [2018-04-12 13:14:19,141 INFO L87 Difference]: Start difference. First operand 525 states and 681 transitions. Second operand 29 states. [2018-04-12 13:14:55,523 WARN L151 SmtUtils]: Spent 4043ms on a formula simplification. DAG size of input: 75 DAG size of output 44 [2018-04-12 13:15:14,510 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-12 13:15:14,510 INFO L93 Difference]: Finished difference Result 921 states and 1175 transitions. [2018-04-12 13:15:14,511 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2018-04-12 13:15:14,511 INFO L78 Accepts]: Start accepts. Automaton has 29 states. Word has length 54 [2018-04-12 13:15:14,511 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-12 13:15:14,512 INFO L225 Difference]: With dead ends: 921 [2018-04-12 13:15:14,512 INFO L226 Difference]: Without dead ends: 921 [2018-04-12 13:15:14,513 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 87 GetRequests, 41 SyntacticMatches, 2 SemanticMatches, 44 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 409 ImplicationChecksByTransitivity, 50.8s TimeCoverageRelationStatistics Valid=441, Invalid=1606, Unknown=23, NotChecked=0, Total=2070 [2018-04-12 13:15:14,513 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 921 states. [2018-04-12 13:15:14,516 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 921 to 525. [2018-04-12 13:15:14,517 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 525 states. [2018-04-12 13:15:14,517 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 525 states to 525 states and 679 transitions. [2018-04-12 13:15:14,517 INFO L78 Accepts]: Start accepts. Automaton has 525 states and 679 transitions. Word has length 54 [2018-04-12 13:15:14,517 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-12 13:15:14,517 INFO L459 AbstractCegarLoop]: Abstraction has 525 states and 679 transitions. [2018-04-12 13:15:14,517 INFO L460 AbstractCegarLoop]: Interpolant automaton has 29 states. [2018-04-12 13:15:14,517 INFO L276 IsEmpty]: Start isEmpty. Operand 525 states and 679 transitions. [2018-04-12 13:15:14,518 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2018-04-12 13:15:14,518 INFO L347 BasicCegarLoop]: Found error trace [2018-04-12 13:15:14,518 INFO L355 BasicCegarLoop]: trace histogram [3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-12 13:15:14,518 INFO L408 AbstractCegarLoop]: === Iteration 33 === [mainErr51RequiresViolation, mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr31RequiresViolation, mainErr46RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr52AssertViolationMEMORY_FREE, mainErr15RequiresViolation, mainErr49RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr17RequiresViolation, mainErr42RequiresViolation, mainErr30RequiresViolation, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr44RequiresViolation, mainErr10RequiresViolation, mainErr43RequiresViolation, mainErr4RequiresViolation, mainErr50RequiresViolation, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr48RequiresViolation, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr45RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr54EnsuresViolationMEMORY_LEAK, mainErr9RequiresViolation, mainErr53AssertViolationMEMORY_FREE, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr34RequiresViolation, mainErr47RequiresViolation, mainErr14RequiresViolation, mainErr40RequiresViolation]=== [2018-04-12 13:15:14,518 INFO L82 PathProgramCache]: Analyzing trace with hash -640106730, now seen corresponding path program 1 times [2018-04-12 13:15:14,518 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-04-12 13:15:14,518 INFO L68 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-04-12 13:15:14,519 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-12 13:15:14,519 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-12 13:15:14,519 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-12 13:15:14,526 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-12 13:15:14,527 WARN L250 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-12 13:15:14,726 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 3 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-12 13:15:14,726 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-04-12 13:15:14,726 INFO L213 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 12 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 12 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-04-12 13:15:14,734 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-12 13:15:14,763 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-12 13:15:14,765 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-12 13:15:14,797 INFO L700 Elim1Store]: detected not equals via solver [2018-04-12 13:15:14,797 INFO L700 Elim1Store]: detected not equals via solver [2018-04-12 13:15:14,798 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 21 [2018-04-12 13:15:14,798 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-12 13:15:14,804 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-12 13:15:14,804 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:26, output treesize:24 [2018-04-12 13:15:14,819 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 10 [2018-04-12 13:15:14,820 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 9 [2018-04-12 13:15:14,821 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-12 13:15:14,822 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-12 13:15:14,827 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-04-12 13:15:14,827 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:37, output treesize:36 [2018-04-12 13:15:14,854 INFO L700 Elim1Store]: detected not equals via solver [2018-04-12 13:15:14,858 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 2 new quantified variables, introduced 0 case distinctions, treesize of input 45 treesize of output 52 [2018-04-12 13:15:14,859 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 13 [2018-04-12 13:15:14,859 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-12 13:15:14,863 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-12 13:15:14,868 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-04-12 13:15:14,868 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:59, output treesize:49 [2018-04-12 13:15:14,907 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 60 treesize of output 46 [2018-04-12 13:15:14,910 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 29 [2018-04-12 13:15:14,910 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-12 13:15:14,915 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-12 13:15:14,921 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2018-04-12 13:15:14,921 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:68, output treesize:58 [2018-04-12 13:15:20,966 WARN L151 SmtUtils]: Spent 2010ms on a formula simplification. DAG size of input: 28 DAG size of output 24 [2018-04-12 13:15:23,023 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 46 treesize of output 39 [2018-04-12 13:15:23,024 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 1 [2018-04-12 13:15:23,024 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-12 13:15:23,028 INFO L682 Elim1Store]: detected equality via solver [2018-04-12 13:15:23,028 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 17 [2018-04-12 13:15:23,028 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-04-12 13:15:23,030 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-12 13:15:23,035 INFO L267 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-04-12 13:15:23,035 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 5 variables, input treesize:60, output treesize:15 [2018-04-12 13:15:23,122 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 3 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-12 13:15:23,138 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-04-12 13:15:23,139 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 15] total 27 [2018-04-12 13:15:23,139 INFO L442 AbstractCegarLoop]: Interpolant automaton has 28 states [2018-04-12 13:15:23,139 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. [2018-04-12 13:15:23,139 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=122, Invalid=631, Unknown=3, NotChecked=0, Total=756 [2018-04-12 13:15:23,139 INFO L87 Difference]: Start difference. First operand 525 states and 679 transitions. Second operand 28 states. [2018-04-12 13:16:21,172 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-12 13:16:21,172 INFO L93 Difference]: Finished difference Result 949 states and 1203 transitions. [2018-04-12 13:16:21,172 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2018-04-12 13:16:21,172 INFO L78 Accepts]: Start accepts. Automaton has 28 states. Word has length 56 [2018-04-12 13:16:21,173 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-12 13:16:21,174 INFO L225 Difference]: With dead ends: 949 [2018-04-12 13:16:21,174 INFO L226 Difference]: Without dead ends: 949 [2018-04-12 13:16:21,174 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 90 GetRequests, 43 SyntacticMatches, 2 SemanticMatches, 45 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 479 ImplicationChecksByTransitivity, 53.1s TimeCoverageRelationStatistics Valid=539, Invalid=1598, Unknown=25, NotChecked=0, Total=2162 [2018-04-12 13:16:21,175 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 949 states. [2018-04-12 13:16:21,178 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 949 to 528. [2018-04-12 13:16:21,178 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 528 states. [2018-04-12 13:16:21,178 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 528 states to 528 states and 683 transitions. [2018-04-12 13:16:21,178 INFO L78 Accepts]: Start accepts. Automaton has 528 states and 683 transitions. Word has length 56 [2018-04-12 13:16:21,179 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-12 13:16:21,179 INFO L459 AbstractCegarLoop]: Abstraction has 528 states and 683 transitions. [2018-04-12 13:16:21,179 INFO L460 AbstractCegarLoop]: Interpolant automaton has 28 states. [2018-04-12 13:16:21,179 INFO L276 IsEmpty]: Start isEmpty. Operand 528 states and 683 transitions. [2018-04-12 13:16:21,179 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2018-04-12 13:16:21,179 INFO L347 BasicCegarLoop]: Found error trace [2018-04-12 13:16:21,179 INFO L355 BasicCegarLoop]: trace histogram [3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-12 13:16:21,179 INFO L408 AbstractCegarLoop]: === Iteration 34 === [mainErr51RequiresViolation, mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr31RequiresViolation, mainErr46RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr52AssertViolationMEMORY_FREE, mainErr15RequiresViolation, mainErr49RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr17RequiresViolation, mainErr42RequiresViolation, mainErr30RequiresViolation, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr44RequiresViolation, mainErr10RequiresViolation, mainErr43RequiresViolation, mainErr4RequiresViolation, mainErr50RequiresViolation, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr48RequiresViolation, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr45RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr54EnsuresViolationMEMORY_LEAK, mainErr9RequiresViolation, mainErr53AssertViolationMEMORY_FREE, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr34RequiresViolation, mainErr47RequiresViolation, mainErr14RequiresViolation, mainErr40RequiresViolation]=== [2018-04-12 13:16:21,179 INFO L82 PathProgramCache]: Analyzing trace with hash -640106729, now seen corresponding path program 1 times [2018-04-12 13:16:21,179 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-04-12 13:16:21,179 INFO L68 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-04-12 13:16:21,180 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-12 13:16:21,180 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-12 13:16:21,180 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-12 13:16:21,188 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-12 13:16:21,188 WARN L250 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-12 13:16:21,371 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 3 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-12 13:16:21,371 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-04-12 13:16:21,371 INFO L213 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 13 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 13 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-04-12 13:16:21,376 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-12 13:16:21,398 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-12 13:16:21,400 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-12 13:16:21,423 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-04-12 13:16:21,424 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-12 13:16:21,430 INFO L700 Elim1Store]: detected not equals via solver [2018-04-12 13:16:21,431 INFO L700 Elim1Store]: detected not equals via solver [2018-04-12 13:16:21,431 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 4 [2018-04-12 13:16:21,432 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-12 13:16:21,438 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-12 13:16:21,438 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:29, output treesize:22 [2018-04-12 13:16:21,446 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 10 [2018-04-12 13:16:21,447 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 9 [2018-04-12 13:16:21,447 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-12 13:16:21,449 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-12 13:16:21,456 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 10 [2018-04-12 13:16:21,457 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 9 [2018-04-12 13:16:21,457 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-04-12 13:16:21,458 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-12 13:16:21,464 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-04-12 13:16:21,464 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 3 variables, input treesize:45, output treesize:40 [2018-04-12 13:16:21,480 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 34 [2018-04-12 13:16:21,482 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 13 [2018-04-12 13:16:21,482 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-12 13:16:21,485 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-12 13:16:21,496 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 58 treesize of output 52 [2018-04-12 13:16:21,497 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 13 [2018-04-12 13:16:21,497 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-04-12 13:16:21,502 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-12 13:16:21,509 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-04-12 13:16:21,509 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 3 variables, input treesize:86, output treesize:66 [2018-04-12 13:16:21,551 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 48 treesize of output 41 [2018-04-12 13:16:21,553 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 22 treesize of output 29 [2018-04-12 13:16:21,553 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-12 13:16:21,558 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-12 13:16:21,570 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 88 treesize of output 74 [2018-04-12 13:16:21,572 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 22 treesize of output 29 [2018-04-12 13:16:21,573 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-04-12 13:16:21,579 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-12 13:16:21,587 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2018-04-12 13:16:21,587 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 4 variables, input treesize:110, output treesize:90 [2018-04-12 13:16:27,643 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 51 treesize of output 37 [2018-04-12 13:16:27,645 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 1 [2018-04-12 13:16:27,645 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-12 13:16:27,650 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 19 [2018-04-12 13:16:27,650 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-04-12 13:16:27,653 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-12 13:16:27,665 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 22 [2018-04-12 13:16:27,666 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 3 [2018-04-12 13:16:27,666 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2018-04-12 13:16:27,670 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 1 [2018-04-12 13:16:27,670 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2018-04-12 13:16:27,671 INFO L267 ElimStorePlain]: Start of recursive call 5: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-12 13:16:27,674 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-04-12 13:16:27,674 INFO L202 ElimStorePlain]: Needed 7 recursive calls to eliminate 4 variables, input treesize:65, output treesize:9 [2018-04-12 13:16:27,698 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 3 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-12 13:16:27,716 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-04-12 13:16:27,716 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 15] total 20 [2018-04-12 13:16:27,717 INFO L442 AbstractCegarLoop]: Interpolant automaton has 21 states [2018-04-12 13:16:27,717 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2018-04-12 13:16:27,717 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=86, Invalid=331, Unknown=3, NotChecked=0, Total=420 [2018-04-12 13:16:27,717 INFO L87 Difference]: Start difference. First operand 528 states and 683 transitions. Second operand 21 states. [2018-04-12 13:16:28,555 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-12 13:16:28,555 INFO L93 Difference]: Finished difference Result 899 states and 1137 transitions. [2018-04-12 13:16:28,555 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2018-04-12 13:16:28,555 INFO L78 Accepts]: Start accepts. Automaton has 21 states. Word has length 56 [2018-04-12 13:16:28,556 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-12 13:16:28,557 INFO L225 Difference]: With dead ends: 899 [2018-04-12 13:16:28,557 INFO L226 Difference]: Without dead ends: 899 [2018-04-12 13:16:28,557 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 88 GetRequests, 44 SyntacticMatches, 8 SemanticMatches, 36 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 327 ImplicationChecksByTransitivity, 6.6s TimeCoverageRelationStatistics Valid=365, Invalid=1038, Unknown=3, NotChecked=0, Total=1406 [2018-04-12 13:16:28,558 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 899 states. [2018-04-12 13:16:28,561 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 899 to 562. [2018-04-12 13:16:28,561 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 562 states. [2018-04-12 13:16:28,561 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 562 states to 562 states and 725 transitions. [2018-04-12 13:16:28,561 INFO L78 Accepts]: Start accepts. Automaton has 562 states and 725 transitions. Word has length 56 [2018-04-12 13:16:28,561 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-12 13:16:28,561 INFO L459 AbstractCegarLoop]: Abstraction has 562 states and 725 transitions. [2018-04-12 13:16:28,562 INFO L460 AbstractCegarLoop]: Interpolant automaton has 21 states. [2018-04-12 13:16:28,562 INFO L276 IsEmpty]: Start isEmpty. Operand 562 states and 725 transitions. [2018-04-12 13:16:28,562 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2018-04-12 13:16:28,562 INFO L347 BasicCegarLoop]: Found error trace [2018-04-12 13:16:28,562 INFO L355 BasicCegarLoop]: trace histogram [3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-12 13:16:28,562 INFO L408 AbstractCegarLoop]: === Iteration 35 === [mainErr51RequiresViolation, mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr31RequiresViolation, mainErr46RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr52AssertViolationMEMORY_FREE, mainErr15RequiresViolation, mainErr49RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr17RequiresViolation, mainErr42RequiresViolation, mainErr30RequiresViolation, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr44RequiresViolation, mainErr10RequiresViolation, mainErr43RequiresViolation, mainErr4RequiresViolation, mainErr50RequiresViolation, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr48RequiresViolation, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr45RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr54EnsuresViolationMEMORY_LEAK, mainErr9RequiresViolation, mainErr53AssertViolationMEMORY_FREE, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr34RequiresViolation, mainErr47RequiresViolation, mainErr14RequiresViolation, mainErr40RequiresViolation]=== [2018-04-12 13:16:28,562 INFO L82 PathProgramCache]: Analyzing trace with hash -645832368, now seen corresponding path program 1 times [2018-04-12 13:16:28,562 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-04-12 13:16:28,562 INFO L68 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-04-12 13:16:28,563 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-12 13:16:28,563 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-12 13:16:28,563 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-12 13:16:28,569 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-12 13:16:28,570 WARN L250 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-12 13:16:28,770 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 12 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-12 13:16:28,770 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-04-12 13:16:28,770 INFO L213 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 14 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 14 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-04-12 13:16:28,775 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-12 13:16:28,791 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-12 13:16:28,792 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-12 13:16:28,798 INFO L700 Elim1Store]: detected not equals via solver [2018-04-12 13:16:28,799 INFO L700 Elim1Store]: detected not equals via solver [2018-04-12 13:16:28,799 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 21 [2018-04-12 13:16:28,800 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-12 13:16:28,805 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-12 13:16:28,806 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:23, output treesize:21 [2018-04-12 13:16:28,820 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 8 [2018-04-12 13:16:28,821 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-04-12 13:16:28,821 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-12 13:16:28,822 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-12 13:16:28,827 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-04-12 13:16:28,828 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:37, output treesize:29 [2018-04-12 13:16:28,850 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-04-12 13:16:28,851 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 11 [2018-04-12 13:16:28,851 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-12 13:16:28,854 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-12 13:16:28,859 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-04-12 13:16:28,860 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:48, output treesize:40 [2018-04-12 13:16:28,909 INFO L682 Elim1Store]: detected equality via solver [2018-04-12 13:16:28,914 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 1 disjoint index pairs (out of 6 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 50 treesize of output 51 [2018-04-12 13:16:28,916 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 25 [2018-04-12 13:16:28,916 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-12 13:16:28,921 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-12 13:16:28,927 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2018-04-12 13:16:28,927 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:61, output treesize:53 [2018-04-12 13:16:34,966 WARN L151 SmtUtils]: Spent 2017ms on a formula simplification. DAG size of input: 30 DAG size of output 26 [2018-04-12 13:16:34,970 INFO L700 Elim1Store]: detected not equals via solver [2018-04-12 13:16:34,970 INFO L700 Elim1Store]: detected not equals via solver [2018-04-12 13:16:34,971 INFO L700 Elim1Store]: detected not equals via solver [2018-04-12 13:16:34,971 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 50 [2018-04-12 13:16:34,972 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-12 13:16:34,985 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-04-12 13:16:34,985 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:53, output treesize:59 [2018-04-12 13:16:35,015 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 52 treesize of output 47 [2018-04-12 13:16:35,016 INFO L700 Elim1Store]: detected not equals via solver [2018-04-12 13:16:35,017 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 4 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 54 [2018-04-12 13:16:35,017 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-12 13:16:35,023 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-12 13:16:35,032 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-04-12 13:16:35,032 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:72, output treesize:77 [2018-04-12 13:16:35,107 INFO L700 Elim1Store]: detected not equals via solver [2018-04-12 13:16:35,108 INFO L700 Elim1Store]: detected not equals via solver [2018-04-12 13:16:35,115 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 5 disjoint index pairs (out of 6 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 89 treesize of output 99 [2018-04-12 13:16:35,117 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 13 [2018-04-12 13:16:35,117 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-12 13:16:35,127 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-12 13:16:35,139 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2018-04-12 13:16:35,139 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:100, output treesize:90 [2018-04-12 13:16:35,278 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 104 treesize of output 93 [2018-04-12 13:16:35,280 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 22 treesize of output 29 [2018-04-12 13:16:35,280 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-12 13:16:35,288 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-12 13:16:35,298 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-2 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2018-04-12 13:16:35,298 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:109, output treesize:99 [2018-04-12 13:16:41,364 WARN L151 SmtUtils]: Spent 2040ms on a formula simplification. DAG size of input: 40 DAG size of output 36 [2018-04-12 13:16:43,407 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 88 treesize of output 67 [2018-04-12 13:16:43,409 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 1 [2018-04-12 13:16:43,409 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-12 13:16:43,417 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 4 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 46 treesize of output 29 [2018-04-12 13:16:43,418 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-04-12 13:16:43,423 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 1 [2018-04-12 13:16:43,424 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-04-12 13:16:43,427 INFO L267 ElimStorePlain]: Start of recursive call 2: 3 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-04-12 13:16:43,431 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-04-12 13:16:43,431 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 5 variables, input treesize:93, output treesize:28 [2018-04-12 13:16:43,560 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 3 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-12 13:16:43,577 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-04-12 13:16:43,577 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 18] total 31 [2018-04-12 13:16:43,577 INFO L442 AbstractCegarLoop]: Interpolant automaton has 32 states [2018-04-12 13:16:43,577 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 32 interpolants. [2018-04-12 13:16:43,578 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=197, Invalid=790, Unknown=5, NotChecked=0, Total=992 [2018-04-12 13:16:43,578 INFO L87 Difference]: Start difference. First operand 562 states and 725 transitions. Second operand 32 states. [2018-04-12 13:17:00,017 WARN L151 SmtUtils]: Spent 2030ms on a formula simplification. DAG size of input: 43 DAG size of output 35 [2018-04-12 13:18:12,254 WARN L151 SmtUtils]: Spent 2026ms on a formula simplification. DAG size of input: 48 DAG size of output 38 [2018-04-12 13:19:49,257 WARN L151 SmtUtils]: Spent 2030ms on a formula simplification. DAG size of input: 52 DAG size of output 42 [2018-04-12 13:19:55,691 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-12 13:19:55,691 INFO L93 Difference]: Finished difference Result 2002 states and 2551 transitions. [2018-04-12 13:19:55,691 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 78 states. [2018-04-12 13:19:55,691 INFO L78 Accepts]: Start accepts. Automaton has 32 states. Word has length 56 [2018-04-12 13:19:55,692 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-12 13:19:55,695 INFO L225 Difference]: With dead ends: 2002 [2018-04-12 13:19:55,695 INFO L226 Difference]: Without dead ends: 2002 [2018-04-12 13:19:55,696 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 143 GetRequests, 41 SyntacticMatches, 3 SemanticMatches, 99 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3165 ImplicationChecksByTransitivity, 168.5s TimeCoverageRelationStatistics Valid=2147, Invalid=7876, Unknown=77, NotChecked=0, Total=10100 [2018-04-12 13:19:55,697 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2002 states. [2018-04-12 13:19:55,703 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2002 to 656. [2018-04-12 13:19:55,703 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 656 states. [2018-04-12 13:19:55,704 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 656 states to 656 states and 856 transitions. [2018-04-12 13:19:55,704 INFO L78 Accepts]: Start accepts. Automaton has 656 states and 856 transitions. Word has length 56 [2018-04-12 13:19:55,704 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-12 13:19:55,704 INFO L459 AbstractCegarLoop]: Abstraction has 656 states and 856 transitions. [2018-04-12 13:19:55,705 INFO L460 AbstractCegarLoop]: Interpolant automaton has 32 states. [2018-04-12 13:19:55,705 INFO L276 IsEmpty]: Start isEmpty. Operand 656 states and 856 transitions. [2018-04-12 13:19:55,705 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2018-04-12 13:19:55,705 INFO L347 BasicCegarLoop]: Found error trace [2018-04-12 13:19:55,705 INFO L355 BasicCegarLoop]: trace histogram [3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-12 13:19:55,705 INFO L408 AbstractCegarLoop]: === Iteration 36 === [mainErr51RequiresViolation, mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr31RequiresViolation, mainErr46RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr52AssertViolationMEMORY_FREE, mainErr15RequiresViolation, mainErr49RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr17RequiresViolation, mainErr42RequiresViolation, mainErr30RequiresViolation, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr44RequiresViolation, mainErr10RequiresViolation, mainErr43RequiresViolation, mainErr4RequiresViolation, mainErr50RequiresViolation, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr48RequiresViolation, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr45RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr54EnsuresViolationMEMORY_LEAK, mainErr9RequiresViolation, mainErr53AssertViolationMEMORY_FREE, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr34RequiresViolation, mainErr47RequiresViolation, mainErr14RequiresViolation, mainErr40RequiresViolation]=== [2018-04-12 13:19:55,705 INFO L82 PathProgramCache]: Analyzing trace with hash -645832367, now seen corresponding path program 1 times [2018-04-12 13:19:55,705 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-04-12 13:19:55,705 INFO L68 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-04-12 13:19:55,706 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-12 13:19:55,706 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-12 13:19:55,706 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-12 13:19:55,716 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-12 13:19:55,717 WARN L250 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-12 13:19:55,893 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 12 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-12 13:19:55,893 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-04-12 13:19:55,893 INFO L213 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 15 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 15 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-04-12 13:19:55,898 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-12 13:19:55,915 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-12 13:19:55,917 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-12 13:19:55,921 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-04-12 13:19:55,921 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-12 13:19:55,929 INFO L700 Elim1Store]: detected not equals via solver [2018-04-12 13:19:55,930 INFO L700 Elim1Store]: detected not equals via solver [2018-04-12 13:19:55,930 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 21 [2018-04-12 13:19:55,930 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-12 13:19:55,936 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-12 13:19:55,937 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:32, output treesize:29 [2018-04-12 13:19:55,955 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 8 [2018-04-12 13:19:55,956 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-04-12 13:19:55,956 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-12 13:19:55,957 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-12 13:19:55,966 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 8 [2018-04-12 13:19:55,967 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-04-12 13:19:55,968 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-04-12 13:19:55,969 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-12 13:19:55,975 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-04-12 13:19:55,975 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 3 variables, input treesize:53, output treesize:45 [2018-04-12 13:19:56,012 INFO L700 Elim1Store]: detected not equals via solver [2018-04-12 13:19:56,014 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-04-12 13:19:56,016 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 11 [2018-04-12 13:19:56,016 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-12 13:19:56,019 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-12 13:19:56,029 INFO L700 Elim1Store]: detected not equals via solver [2018-04-12 13:19:56,033 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 2 new quantified variables, introduced 0 case distinctions, treesize of input 57 treesize of output 64 [2018-04-12 13:19:56,034 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 11 [2018-04-12 13:19:56,034 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-04-12 13:19:56,041 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-12 13:19:56,050 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-04-12 13:19:56,050 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 3 variables, input treesize:83, output treesize:67 [2018-04-12 13:19:56,105 INFO L682 Elim1Store]: detected equality via solver [2018-04-12 13:19:56,106 INFO L700 Elim1Store]: detected not equals via solver [2018-04-12 13:19:56,112 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 2 disjoint index pairs (out of 6 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 91 treesize of output 92 [2018-04-12 13:19:56,115 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 25 [2018-04-12 13:19:56,115 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-12 13:19:56,130 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-12 13:19:56,143 INFO L700 Elim1Store]: detected not equals via solver [2018-04-12 13:19:56,146 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 40 treesize of output 35 [2018-04-12 13:19:56,148 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 25 [2018-04-12 13:19:56,148 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-04-12 13:19:56,152 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-12 13:19:56,162 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2018-04-12 13:19:56,163 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 4 variables, input treesize:109, output treesize:93 [2018-04-12 13:20:00,206 INFO L700 Elim1Store]: detected not equals via solver [2018-04-12 13:20:00,206 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 23 [2018-04-12 13:20:00,207 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-12 13:20:00,220 INFO L700 Elim1Store]: detected not equals via solver [2018-04-12 13:20:00,221 INFO L700 Elim1Store]: detected not equals via solver [2018-04-12 13:20:00,221 INFO L700 Elim1Store]: detected not equals via solver [2018-04-12 13:20:00,221 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-04-12 13:20:00,222 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-12 13:20:00,231 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-04-12 13:20:00,231 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:82, output treesize:74 [2018-04-12 13:20:00,258 INFO L700 Elim1Store]: detected not equals via solver [2018-04-12 13:20:00,263 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 65 treesize of output 64 [2018-04-12 13:20:00,265 INFO L700 Elim1Store]: detected not equals via solver [2018-04-12 13:20:00,265 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 5 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 58 treesize of output 78 [2018-04-12 13:20:00,265 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-12 13:20:00,275 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-12 13:20:00,293 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 34 treesize of output 40 [2018-04-12 13:20:00,295 INFO L700 Elim1Store]: detected not equals via solver [2018-04-12 13:20:00,297 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 23 [2018-04-12 13:20:00,297 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-04-12 13:20:00,302 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-12 13:20:00,314 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 2 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-04-12 13:20:00,315 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 5 variables, input treesize:100, output treesize:92 [2018-04-12 13:20:00,374 INFO L700 Elim1Store]: detected not equals via solver [2018-04-12 13:20:00,375 INFO L700 Elim1Store]: detected not equals via solver [2018-04-12 13:20:00,382 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 5 disjoint index pairs (out of 6 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 125 treesize of output 143 [2018-04-12 13:20:00,384 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 13 [2018-04-12 13:20:00,384 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-12 13:20:00,397 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-12 13:20:00,415 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 44 treesize of output 67 [2018-04-12 13:20:00,417 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 13 [2018-04-12 13:20:00,417 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-04-12 13:20:00,423 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-12 13:20:00,435 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2018-04-12 13:20:00,435 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 4 variables, input treesize:138, output treesize:118 [2018-04-12 13:20:00,565 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 155 treesize of output 144 [2018-04-12 13:20:00,568 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 29 [2018-04-12 13:20:00,568 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-12 13:20:00,581 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-12 13:20:00,600 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 59 treesize of output 74 [2018-04-12 13:20:00,602 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 22 treesize of output 29 [2018-04-12 13:20:00,602 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-04-12 13:20:00,608 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-12 13:20:00,621 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 2 dim-2 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2018-04-12 13:20:00,621 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 5 variables, input treesize:162, output treesize:142 Received shutdown request... [2018-04-12 13:20:04,654 INFO L175 TraceCheckSpWp]: Timeout while computing interpolants [2018-04-12 13:20:04,654 WARN L519 AbstractCegarLoop]: Verification canceled [2018-04-12 13:20:04,658 WARN L197 ceAbstractionStarter]: Timeout [2018-04-12 13:20:04,658 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 12.04 01:20:04 BoogieIcfgContainer [2018-04-12 13:20:04,658 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-04-12 13:20:04,658 INFO L168 Benchmark]: Toolchain (without parser) took 868541.23 ms. Allocated memory was 397.9 MB in the beginning and 615.5 MB in the end (delta: 217.6 MB). Free memory was 332.7 MB in the beginning and 414.1 MB in the end (delta: -81.3 MB). Peak memory consumption was 136.3 MB. Max. memory is 5.3 GB. [2018-04-12 13:20:04,659 INFO L168 Benchmark]: CDTParser took 0.14 ms. Allocated memory is still 397.9 MB. Free memory is still 359.8 MB. There was no memory consumed. Max. memory is 5.3 GB. [2018-04-12 13:20:04,659 INFO L168 Benchmark]: CACSL2BoogieTranslator took 258.09 ms. Allocated memory is still 397.9 MB. Free memory was 332.7 MB in the beginning and 307.4 MB in the end (delta: 25.4 MB). Peak memory consumption was 25.4 MB. Max. memory is 5.3 GB. [2018-04-12 13:20:04,660 INFO L168 Benchmark]: Boogie Preprocessor took 44.75 ms. Allocated memory is still 397.9 MB. Free memory was 307.4 MB in the beginning and 304.7 MB in the end (delta: 2.6 MB). Peak memory consumption was 2.6 MB. Max. memory is 5.3 GB. [2018-04-12 13:20:04,660 INFO L168 Benchmark]: RCFGBuilder took 494.06 ms. Allocated memory was 397.9 MB in the beginning and 602.9 MB in the end (delta: 205.0 MB). Free memory was 304.7 MB in the beginning and 521.2 MB in the end (delta: -216.4 MB). Peak memory consumption was 23.0 MB. Max. memory is 5.3 GB. [2018-04-12 13:20:04,660 INFO L168 Benchmark]: TraceAbstraction took 867741.45 ms. Allocated memory was 602.9 MB in the beginning and 615.5 MB in the end (delta: 12.6 MB). Free memory was 521.2 MB in the beginning and 414.1 MB in the end (delta: 107.1 MB). Peak memory consumption was 119.7 MB. Max. memory is 5.3 GB. [2018-04-12 13:20:04,660 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.14 ms. Allocated memory is still 397.9 MB. Free memory is still 359.8 MB. There was no memory consumed. Max. memory is 5.3 GB. * CACSL2BoogieTranslator took 258.09 ms. Allocated memory is still 397.9 MB. Free memory was 332.7 MB in the beginning and 307.4 MB in the end (delta: 25.4 MB). Peak memory consumption was 25.4 MB. Max. memory is 5.3 GB. * Boogie Preprocessor took 44.75 ms. Allocated memory is still 397.9 MB. Free memory was 307.4 MB in the beginning and 304.7 MB in the end (delta: 2.6 MB). Peak memory consumption was 2.6 MB. Max. memory is 5.3 GB. * RCFGBuilder took 494.06 ms. Allocated memory was 397.9 MB in the beginning and 602.9 MB in the end (delta: 205.0 MB). Free memory was 304.7 MB in the beginning and 521.2 MB in the end (delta: -216.4 MB). Peak memory consumption was 23.0 MB. Max. memory is 5.3 GB. * TraceAbstraction took 867741.45 ms. Allocated memory was 602.9 MB in the beginning and 615.5 MB in the end (delta: 12.6 MB). Free memory was 521.2 MB in the beginning and 414.1 MB in the end (delta: 107.1 MB). Peak memory consumption was 119.7 MB. Max. memory is 5.3 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - TimeoutResultAtElement [Line: 663]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 663). Cancelled while BasicCegarLoop was analyzing trace of length 57 with TraceHistMax 3, while TraceCheckSpWp was constructing forward predicates, while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 53. - TimeoutResultAtElement [Line: 642]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 642). Cancelled while BasicCegarLoop was analyzing trace of length 57 with TraceHistMax 3, while TraceCheckSpWp was constructing forward predicates, while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 53. - TimeoutResultAtElement [Line: 638]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 638). Cancelled while BasicCegarLoop was analyzing trace of length 57 with TraceHistMax 3, while TraceCheckSpWp was constructing forward predicates, while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 53. - TimeoutResultAtElement [Line: 639]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 639). Cancelled while BasicCegarLoop was analyzing trace of length 57 with TraceHistMax 3, while TraceCheckSpWp was constructing forward predicates, while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 53. - TimeoutResultAtElement [Line: 652]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 652). Cancelled while BasicCegarLoop was analyzing trace of length 57 with TraceHistMax 3, while TraceCheckSpWp was constructing forward predicates, while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 53. - TimeoutResultAtElement [Line: 626]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 626). Cancelled while BasicCegarLoop was analyzing trace of length 57 with TraceHistMax 3, while TraceCheckSpWp was constructing forward predicates, while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 53. - TimeoutResultAtElement [Line: 643]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 643). Cancelled while BasicCegarLoop was analyzing trace of length 57 with TraceHistMax 3, while TraceCheckSpWp was constructing forward predicates, while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 53. - TimeoutResultAtElement [Line: 660]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 660). Cancelled while BasicCegarLoop was analyzing trace of length 57 with TraceHistMax 3, while TraceCheckSpWp was constructing forward predicates, while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 53. - TimeoutResultAtElement [Line: 643]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 643). Cancelled while BasicCegarLoop was analyzing trace of length 57 with TraceHistMax 3, while TraceCheckSpWp was constructing forward predicates, while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 53. - TimeoutResultAtElement [Line: 627]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 627). Cancelled while BasicCegarLoop was analyzing trace of length 57 with TraceHistMax 3, while TraceCheckSpWp was constructing forward predicates, while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 53. - TimeoutResultAtElement [Line: 666]: Timeout (TraceAbstraction) Unable to prove that free always succeeds (line 666). Cancelled while BasicCegarLoop was analyzing trace of length 57 with TraceHistMax 3, while TraceCheckSpWp was constructing forward predicates, while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 53. - TimeoutResultAtElement [Line: 637]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 637). Cancelled while BasicCegarLoop was analyzing trace of length 57 with TraceHistMax 3, while TraceCheckSpWp was constructing forward predicates, while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 53. - TimeoutResultAtElement [Line: 661]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 661). Cancelled while BasicCegarLoop was analyzing trace of length 57 with TraceHistMax 3, while TraceCheckSpWp was constructing forward predicates, while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 53. - TimeoutResultAtElement [Line: 636]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 636). Cancelled while BasicCegarLoop was analyzing trace of length 57 with TraceHistMax 3, while TraceCheckSpWp was constructing forward predicates, while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 53. - TimeoutResultAtElement [Line: 630]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 630). Cancelled while BasicCegarLoop was analyzing trace of length 57 with TraceHistMax 3, while TraceCheckSpWp was constructing forward predicates, while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 53. - TimeoutResultAtElement [Line: 644]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 644). Cancelled while BasicCegarLoop was analyzing trace of length 57 with TraceHistMax 3, while TraceCheckSpWp was constructing forward predicates, while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 53. - TimeoutResultAtElement [Line: 638]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 638). Cancelled while BasicCegarLoop was analyzing trace of length 57 with TraceHistMax 3, while TraceCheckSpWp was constructing forward predicates, while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 53. - TimeoutResultAtElement [Line: 655]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 655). Cancelled while BasicCegarLoop was analyzing trace of length 57 with TraceHistMax 3, while TraceCheckSpWp was constructing forward predicates, while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 53. - TimeoutResultAtElement [Line: 643]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 643). Cancelled while BasicCegarLoop was analyzing trace of length 57 with TraceHistMax 3, while TraceCheckSpWp was constructing forward predicates, while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 53. - TimeoutResultAtElement [Line: 634]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 634). Cancelled while BasicCegarLoop was analyzing trace of length 57 with TraceHistMax 3, while TraceCheckSpWp was constructing forward predicates, while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 53. - TimeoutResultAtElement [Line: 641]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 641). Cancelled while BasicCegarLoop was analyzing trace of length 57 with TraceHistMax 3, while TraceCheckSpWp was constructing forward predicates, while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 53. - TimeoutResultAtElement [Line: 657]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 657). Cancelled while BasicCegarLoop was analyzing trace of length 57 with TraceHistMax 3, while TraceCheckSpWp was constructing forward predicates, while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 53. - TimeoutResultAtElement [Line: 634]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 634). Cancelled while BasicCegarLoop was analyzing trace of length 57 with TraceHistMax 3, while TraceCheckSpWp was constructing forward predicates, while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 53. - TimeoutResultAtElement [Line: 655]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 655). Cancelled while BasicCegarLoop was analyzing trace of length 57 with TraceHistMax 3, while TraceCheckSpWp was constructing forward predicates, while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 53. - TimeoutResultAtElement [Line: 630]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 630). Cancelled while BasicCegarLoop was analyzing trace of length 57 with TraceHistMax 3, while TraceCheckSpWp was constructing forward predicates, while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 53. - TimeoutResultAtElement [Line: 663]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 663). Cancelled while BasicCegarLoop was analyzing trace of length 57 with TraceHistMax 3, while TraceCheckSpWp was constructing forward predicates, while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 53. - TimeoutResultAtElement [Line: 652]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 652). Cancelled while BasicCegarLoop was analyzing trace of length 57 with TraceHistMax 3, while TraceCheckSpWp was constructing forward predicates, while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 53. - TimeoutResultAtElement [Line: 630]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 630). Cancelled while BasicCegarLoop was analyzing trace of length 57 with TraceHistMax 3, while TraceCheckSpWp was constructing forward predicates, while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 53. - TimeoutResultAtElement [Line: 636]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 636). Cancelled while BasicCegarLoop was analyzing trace of length 57 with TraceHistMax 3, while TraceCheckSpWp was constructing forward predicates, while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 53. - TimeoutResultAtElement [Line: 652]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 652). Cancelled while BasicCegarLoop was analyzing trace of length 57 with TraceHistMax 3, while TraceCheckSpWp was constructing forward predicates, while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 53. - TimeoutResultAtElement [Line: 643]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 643). Cancelled while BasicCegarLoop was analyzing trace of length 57 with TraceHistMax 3, while TraceCheckSpWp was constructing forward predicates, while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 53. - TimeoutResultAtElement [Line: 644]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 644). Cancelled while BasicCegarLoop was analyzing trace of length 57 with TraceHistMax 3, while TraceCheckSpWp was constructing forward predicates, while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 53. - TimeoutResultAtElement [Line: 639]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 639). Cancelled while BasicCegarLoop was analyzing trace of length 57 with TraceHistMax 3, while TraceCheckSpWp was constructing forward predicates, while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 53. - TimeoutResultAtElement [Line: 654]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 654). Cancelled while BasicCegarLoop was analyzing trace of length 57 with TraceHistMax 3, while TraceCheckSpWp was constructing forward predicates, while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 53. - TimeoutResultAtElement [Line: 661]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 661). Cancelled while BasicCegarLoop was analyzing trace of length 57 with TraceHistMax 3, while TraceCheckSpWp was constructing forward predicates, while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 53. - TimeoutResultAtElement [Line: 652]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 652). Cancelled while BasicCegarLoop was analyzing trace of length 57 with TraceHistMax 3, while TraceCheckSpWp was constructing forward predicates, while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 53. - TimeoutResultAtElement [Line: 638]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 638). Cancelled while BasicCegarLoop was analyzing trace of length 57 with TraceHistMax 3, while TraceCheckSpWp was constructing forward predicates, while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 53. - TimeoutResultAtElement [Line: 641]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 641). Cancelled while BasicCegarLoop was analyzing trace of length 57 with TraceHistMax 3, while TraceCheckSpWp was constructing forward predicates, while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 53. - TimeoutResultAtElement [Line: 627]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 627). Cancelled while BasicCegarLoop was analyzing trace of length 57 with TraceHistMax 3, while TraceCheckSpWp was constructing forward predicates, while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 53. - TimeoutResultAtElement [Line: 657]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 657). Cancelled while BasicCegarLoop was analyzing trace of length 57 with TraceHistMax 3, while TraceCheckSpWp was constructing forward predicates, while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 53. - TimeoutResultAtElement [Line: 638]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 638). Cancelled while BasicCegarLoop was analyzing trace of length 57 with TraceHistMax 3, while TraceCheckSpWp was constructing forward predicates, while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 53. - TimeoutResultAtElement [Line: 639]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 639). Cancelled while BasicCegarLoop was analyzing trace of length 57 with TraceHistMax 3, while TraceCheckSpWp was constructing forward predicates, while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 53. - TimeoutResultAtElement [Line: 644]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 644). Cancelled while BasicCegarLoop was analyzing trace of length 57 with TraceHistMax 3, while TraceCheckSpWp was constructing forward predicates, while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 53. - TimeoutResultAtElement [Line: 642]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 642). Cancelled while BasicCegarLoop was analyzing trace of length 57 with TraceHistMax 3, while TraceCheckSpWp was constructing forward predicates, while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 53. - TimeoutResultAtElement [Line: 626]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 626). Cancelled while BasicCegarLoop was analyzing trace of length 57 with TraceHistMax 3, while TraceCheckSpWp was constructing forward predicates, while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 53. - TimeoutResultAtElement [Line: 620]: Timeout (TraceAbstraction) Unable to prove that all allocated memory was freed (line 620). Cancelled while BasicCegarLoop was analyzing trace of length 57 with TraceHistMax 3, while TraceCheckSpWp was constructing forward predicates, while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 53. - TimeoutResultAtElement [Line: 632]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 632). Cancelled while BasicCegarLoop was analyzing trace of length 57 with TraceHistMax 3, while TraceCheckSpWp was constructing forward predicates, while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 53. - TimeoutResultAtElement [Line: 666]: Timeout (TraceAbstraction) Unable to prove that free always succeeds (line 666). Cancelled while BasicCegarLoop was analyzing trace of length 57 with TraceHistMax 3, while TraceCheckSpWp was constructing forward predicates, while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 53. - TimeoutResultAtElement [Line: 630]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 630). Cancelled while BasicCegarLoop was analyzing trace of length 57 with TraceHistMax 3, while TraceCheckSpWp was constructing forward predicates, while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 53. - TimeoutResultAtElement [Line: 639]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 639). Cancelled while BasicCegarLoop was analyzing trace of length 57 with TraceHistMax 3, while TraceCheckSpWp was constructing forward predicates, while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 53. - TimeoutResultAtElement [Line: 632]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 632). Cancelled while BasicCegarLoop was analyzing trace of length 57 with TraceHistMax 3, while TraceCheckSpWp was constructing forward predicates, while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 53. - TimeoutResultAtElement [Line: 644]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 644). Cancelled while BasicCegarLoop was analyzing trace of length 57 with TraceHistMax 3, while TraceCheckSpWp was constructing forward predicates, while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 53. - TimeoutResultAtElement [Line: 660]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 660). Cancelled while BasicCegarLoop was analyzing trace of length 57 with TraceHistMax 3, while TraceCheckSpWp was constructing forward predicates, while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 53. - TimeoutResultAtElement [Line: 637]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 637). Cancelled while BasicCegarLoop was analyzing trace of length 57 with TraceHistMax 3, while TraceCheckSpWp was constructing forward predicates, while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 53. - TimeoutResultAtElement [Line: 654]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 654). Cancelled while BasicCegarLoop was analyzing trace of length 57 with TraceHistMax 3, while TraceCheckSpWp was constructing forward predicates, while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 53. - StatisticsResult: Ultimate Automizer benchmark data CFG has 3 procedures, 132 locations, 55 error locations. TIMEOUT Result, 867.6s OverallTime, 36 OverallIterations, 3 TraceHistogramMax, 759.4s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 3863 SDtfs, 20616 SDslu, 21516 SDs, 0 SdLazy, 23433 SolverSat, 1925 SolverUnsat, 86 SolverUnknown, 0 SolverNotchecked, 146.7s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 1332 GetRequests, 546 SyntacticMatches, 30 SemanticMatches, 756 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 9253 ImplicationChecksByTransitivity, 704.6s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=656occurred in iteration=35, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s AbstIntTime, 0 AbstIntIterations, 0 AbstIntStrong, NaN AbsIntWeakeningRatio, NaN AbsIntAvgWeakeningVarsNumRemoved, NaN AbsIntAvgWeakenedConjuncts, 0.0s DumpTime, AutomataMinimizationStatistics: 0.1s AutomataMinimizationTime, 35 MinimizatonAttempts, 6834 StatesRemovedByMinimization, 33 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.1s SsaConstructionTime, 0.4s SatisfiabilityAnalysisTime, 97.8s InterpolantComputationTime, 1851 NumberOfCodeBlocks, 1851 NumberOfCodeBlocksAsserted, 48 NumberOfCheckSat, 1803 ConstructedInterpolants, 237 QuantifiedInterpolants, 1565114 SizeOfPredicates, 197 NumberOfNonLiveVariables, 2635 ConjunctsInSsa, 428 ConjunctsInUnsatCore, 48 InterpolantComputations, 23 PerfectInterpolantSequences, 72/213 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate could not prove your program: Timeout Written .csv to /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/tree_cnstr_true-valid-memsafety_false-termination.i_svcomp-DerefFreeMemtrack-32bit-Automizer_Camel.epf_AutomizerC.xml/Csv-Benchmark-0-2018-04-12_13-20-04-665.csv Written .csv to /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/tree_cnstr_true-valid-memsafety_false-termination.i_svcomp-DerefFreeMemtrack-32bit-Automizer_Camel.epf_AutomizerC.xml/Csv-TraceAbstractionBenchmarks-0-2018-04-12_13-20-04-665.csv Completed graceful shutdown