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_SmtInterpol_NoArray.epf -i ../../../trunk/examples/svcomp/array-memsafety/cstrspn-alloca_true-valid-memsafety_true-termination.i -------------------------------------------------------------------------------- This is Ultimate 0.1.23-666feb3-m [2018-04-11 15:11:25,949 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-04-11 15:11:25,950 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-04-11 15:11:25,962 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-04-11 15:11:25,963 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-04-11 15:11:25,963 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-04-11 15:11:25,964 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-04-11 15:11:25,965 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-04-11 15:11:25,967 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-04-11 15:11:25,967 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-04-11 15:11:25,968 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-04-11 15:11:25,968 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-04-11 15:11:25,969 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-04-11 15:11:25,970 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-04-11 15:11:25,971 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-04-11 15:11:25,972 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-04-11 15:11:25,974 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-04-11 15:11:25,975 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-04-11 15:11:25,976 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-04-11 15:11:25,977 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-04-11 15:11:25,978 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-04-11 15:11:25,979 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-04-11 15:11:25,979 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-04-11 15:11:25,980 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-04-11 15:11:25,980 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-04-11 15:11:25,981 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-04-11 15:11:25,981 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-04-11 15:11:25,982 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-04-11 15:11:25,982 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-04-11 15:11:25,983 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-04-11 15:11:25,983 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-04-11 15:11:25,983 INFO L98 SettingsManager]: Beginning loading settings from /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/cade18-smtinterpol/svcomp-DerefFreeMemtrack-32bit-Automizer_SmtInterpol_NoArray.epf [2018-04-11 15:11:26,003 INFO L110 SettingsManager]: Loading preferences was successful [2018-04-11 15:11:26,003 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-04-11 15:11:26,004 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-04-11 15:11:26,004 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-04-11 15:11:26,004 INFO L133 SettingsManager]: * Use SBE=true [2018-04-11 15:11:26,004 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-04-11 15:11:26,004 INFO L133 SettingsManager]: * sizeof long=4 [2018-04-11 15:11:26,004 INFO L133 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2018-04-11 15:11:26,004 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-04-11 15:11:26,005 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-04-11 15:11:26,005 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-04-11 15:11:26,005 INFO L133 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2018-04-11 15:11:26,005 INFO L133 SettingsManager]: * Bitprecise bitfields=true [2018-04-11 15:11:26,005 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-04-11 15:11:26,005 INFO L133 SettingsManager]: * sizeof long double=12 [2018-04-11 15:11:26,005 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-04-11 15:11:26,005 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-04-11 15:11:26,005 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-04-11 15:11:26,006 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-04-11 15:11:26,006 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-04-11 15:11:26,006 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-04-11 15:11:26,006 INFO L133 SettingsManager]: * Interpolant automaton=TWOTRACK [2018-04-11 15:11:26,006 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-04-11 15:11:26,006 INFO L133 SettingsManager]: * Trace refinement strategy=SMTINTERPOL Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Bitprecise bitfields -> false [2018-04-11 15:11:26,033 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-04-11 15:11:26,041 INFO L266 ainManager$Toolchain]: [Toolchain 1]: Parser(s) successfully (re)initialized [2018-04-11 15:11:26,044 INFO L222 ainManager$Toolchain]: [Toolchain 1]: Toolchain data selected. [2018-04-11 15:11:26,045 INFO L271 PluginConnector]: Initializing CDTParser... [2018-04-11 15:11:26,045 INFO L276 PluginConnector]: CDTParser initialized [2018-04-11 15:11:26,046 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/array-memsafety/cstrspn-alloca_true-valid-memsafety_true-termination.i [2018-04-11 15:11:26,406 INFO L225 CDTParser]: Created temporary CDT project at /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/data/FLAG6e3f4b06a [2018-04-11 15:11:26,537 INFO L287 CDTParser]: IsIndexed: true [2018-04-11 15:11:26,537 INFO L288 CDTParser]: Found 1 translation units. [2018-04-11 15:11:26,538 INFO L168 CDTParser]: Scanning cstrspn-alloca_true-valid-memsafety_true-termination.i [2018-04-11 15:11:26,546 INFO L210 ultiparseSymbolTable]: Include resolver: [2018-04-11 15:11:26,547 INFO L215 ultiparseSymbolTable]: [2018-04-11 15:11:26,547 INFO L218 ultiparseSymbolTable]: Function table: [2018-04-11 15:11:26,547 INFO L221 ultiparseSymbolTable]: Function definition of __U_MULTI_fcstrspn_alloca_true_valid_memsafety_true_termination_i____bswap_32 ('__bswap_32') in cstrspn-alloca_true-valid-memsafety_true-termination.i [2018-04-11 15:11:26,547 INFO L221 ultiparseSymbolTable]: Function definition of __U_MULTI_fcstrspn_alloca_true_valid_memsafety_true_termination_i____bswap_64 ('__bswap_64') in cstrspn-alloca_true-valid-memsafety_true-termination.i [2018-04-11 15:11:26,547 INFO L221 ultiparseSymbolTable]: Function definition of null ('main') in cstrspn-alloca_true-valid-memsafety_true-termination.i [2018-04-11 15:11:26,547 INFO L221 ultiparseSymbolTable]: Function definition of __U_MULTI_fcstrspn_alloca_true_valid_memsafety_true_termination_i__ ('') in cstrspn-alloca_true-valid-memsafety_true-termination.i [2018-04-11 15:11:26,547 INFO L227 ultiparseSymbolTable]: Global variable table: [2018-04-11 15:11:26,547 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fcstrspn_alloca_true_valid_memsafety_true_termination_i__pthread_t in cstrspn-alloca_true-valid-memsafety_true-termination.i [2018-04-11 15:11:26,547 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fcstrspn_alloca_true_valid_memsafety_true_termination_i__wchar_t in cstrspn-alloca_true-valid-memsafety_true-termination.i [2018-04-11 15:11:26,547 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fcstrspn_alloca_true_valid_memsafety_true_termination_i__nlink_t in cstrspn-alloca_true-valid-memsafety_true-termination.i [2018-04-11 15:11:26,548 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fcstrspn_alloca_true_valid_memsafety_true_termination_i____fd_mask in cstrspn-alloca_true-valid-memsafety_true-termination.i [2018-04-11 15:11:26,548 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fcstrspn_alloca_true_valid_memsafety_true_termination_i____useconds_t in cstrspn-alloca_true-valid-memsafety_true-termination.i [2018-04-11 15:11:26,548 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fcstrspn_alloca_true_valid_memsafety_true_termination_i__id_t in cstrspn-alloca_true-valid-memsafety_true-termination.i [2018-04-11 15:11:26,548 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fcstrspn_alloca_true_valid_memsafety_true_termination_i__pthread_attr_t in cstrspn-alloca_true-valid-memsafety_true-termination.i [2018-04-11 15:11:26,548 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fcstrspn_alloca_true_valid_memsafety_true_termination_i____sig_atomic_t in cstrspn-alloca_true-valid-memsafety_true-termination.i [2018-04-11 15:11:26,548 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fcstrspn_alloca_true_valid_memsafety_true_termination_i____u_int in cstrspn-alloca_true-valid-memsafety_true-termination.i [2018-04-11 15:11:26,548 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fcstrspn_alloca_true_valid_memsafety_true_termination_i__dev_t in cstrspn-alloca_true-valid-memsafety_true-termination.i [2018-04-11 15:11:26,548 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fcstrspn_alloca_true_valid_memsafety_true_termination_i____clockid_t in cstrspn-alloca_true-valid-memsafety_true-termination.i [2018-04-11 15:11:26,548 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fcstrspn_alloca_true_valid_memsafety_true_termination_i__pthread_condattr_t in cstrspn-alloca_true-valid-memsafety_true-termination.i [2018-04-11 15:11:26,548 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fcstrspn_alloca_true_valid_memsafety_true_termination_i____clock_t in cstrspn-alloca_true-valid-memsafety_true-termination.i [2018-04-11 15:11:26,549 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fcstrspn_alloca_true_valid_memsafety_true_termination_i__clockid_t in cstrspn-alloca_true-valid-memsafety_true-termination.i [2018-04-11 15:11:26,549 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fcstrspn_alloca_true_valid_memsafety_true_termination_i__u_int8_t in cstrspn-alloca_true-valid-memsafety_true-termination.i [2018-04-11 15:11:26,549 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fcstrspn_alloca_true_valid_memsafety_true_termination_i__pthread_once_t in cstrspn-alloca_true-valid-memsafety_true-termination.i [2018-04-11 15:11:26,549 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fcstrspn_alloca_true_valid_memsafety_true_termination_i__u_int16_t in cstrspn-alloca_true-valid-memsafety_true-termination.i [2018-04-11 15:11:26,549 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fcstrspn_alloca_true_valid_memsafety_true_termination_i____fsblkcnt64_t in cstrspn-alloca_true-valid-memsafety_true-termination.i [2018-04-11 15:11:26,549 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fcstrspn_alloca_true_valid_memsafety_true_termination_i__quad_t in cstrspn-alloca_true-valid-memsafety_true-termination.i [2018-04-11 15:11:26,549 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fcstrspn_alloca_true_valid_memsafety_true_termination_i____daddr_t in cstrspn-alloca_true-valid-memsafety_true-termination.i [2018-04-11 15:11:26,549 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fcstrspn_alloca_true_valid_memsafety_true_termination_i__int64_t in cstrspn-alloca_true-valid-memsafety_true-termination.i [2018-04-11 15:11:26,549 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fcstrspn_alloca_true_valid_memsafety_true_termination_i__register_t in cstrspn-alloca_true-valid-memsafety_true-termination.i [2018-04-11 15:11:26,549 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fcstrspn_alloca_true_valid_memsafety_true_termination_i____u_quad_t in cstrspn-alloca_true-valid-memsafety_true-termination.i [2018-04-11 15:11:26,549 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fcstrspn_alloca_true_valid_memsafety_true_termination_i____pid_t in cstrspn-alloca_true-valid-memsafety_true-termination.i [2018-04-11 15:11:26,549 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fcstrspn_alloca_true_valid_memsafety_true_termination_i__pthread_barrier_t in cstrspn-alloca_true-valid-memsafety_true-termination.i [2018-04-11 15:11:26,549 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fcstrspn_alloca_true_valid_memsafety_true_termination_i____int64_t in cstrspn-alloca_true-valid-memsafety_true-termination.i [2018-04-11 15:11:26,549 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fcstrspn_alloca_true_valid_memsafety_true_termination_i__ldiv_t in cstrspn-alloca_true-valid-memsafety_true-termination.i [2018-04-11 15:11:26,549 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fcstrspn_alloca_true_valid_memsafety_true_termination_i__loff_t in cstrspn-alloca_true-valid-memsafety_true-termination.i [2018-04-11 15:11:26,550 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fcstrspn_alloca_true_valid_memsafety_true_termination_i____uint8_t in cstrspn-alloca_true-valid-memsafety_true-termination.i [2018-04-11 15:11:26,550 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fcstrspn_alloca_true_valid_memsafety_true_termination_i____key_t in cstrspn-alloca_true-valid-memsafety_true-termination.i [2018-04-11 15:11:26,550 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fcstrspn_alloca_true_valid_memsafety_true_termination_i__ushort in cstrspn-alloca_true-valid-memsafety_true-termination.i [2018-04-11 15:11:26,550 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fcstrspn_alloca_true_valid_memsafety_true_termination_i____ssize_t in cstrspn-alloca_true-valid-memsafety_true-termination.i [2018-04-11 15:11:26,550 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fcstrspn_alloca_true_valid_memsafety_true_termination_i__int32_t in cstrspn-alloca_true-valid-memsafety_true-termination.i [2018-04-11 15:11:26,550 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fcstrspn_alloca_true_valid_memsafety_true_termination_i____off_t in cstrspn-alloca_true-valid-memsafety_true-termination.i [2018-04-11 15:11:26,550 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fcstrspn_alloca_true_valid_memsafety_true_termination_i__ino_t in cstrspn-alloca_true-valid-memsafety_true-termination.i [2018-04-11 15:11:26,550 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fcstrspn_alloca_true_valid_memsafety_true_termination_i____quad_t in cstrspn-alloca_true-valid-memsafety_true-termination.i [2018-04-11 15:11:26,550 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fcstrspn_alloca_true_valid_memsafety_true_termination_i__fsfilcnt_t in cstrspn-alloca_true-valid-memsafety_true-termination.i [2018-04-11 15:11:26,550 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fcstrspn_alloca_true_valid_memsafety_true_termination_i____ino64_t in cstrspn-alloca_true-valid-memsafety_true-termination.i [2018-04-11 15:11:26,550 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fcstrspn_alloca_true_valid_memsafety_true_termination_i____fsfilcnt64_t in cstrspn-alloca_true-valid-memsafety_true-termination.i [2018-04-11 15:11:26,550 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fcstrspn_alloca_true_valid_memsafety_true_termination_i____gid_t in cstrspn-alloca_true-valid-memsafety_true-termination.i [2018-04-11 15:11:26,551 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fcstrspn_alloca_true_valid_memsafety_true_termination_i____syscall_slong_t in cstrspn-alloca_true-valid-memsafety_true-termination.i [2018-04-11 15:11:26,551 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fcstrspn_alloca_true_valid_memsafety_true_termination_i____timer_t in cstrspn-alloca_true-valid-memsafety_true-termination.i [2018-04-11 15:11:26,551 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fcstrspn_alloca_true_valid_memsafety_true_termination_i____blkcnt_t in cstrspn-alloca_true-valid-memsafety_true-termination.i [2018-04-11 15:11:26,551 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fcstrspn_alloca_true_valid_memsafety_true_termination_i__timer_t in cstrspn-alloca_true-valid-memsafety_true-termination.i [2018-04-11 15:11:26,551 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fcstrspn_alloca_true_valid_memsafety_true_termination_i__u_int32_t in cstrspn-alloca_true-valid-memsafety_true-termination.i [2018-04-11 15:11:26,551 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fcstrspn_alloca_true_valid_memsafety_true_termination_i__key_t in cstrspn-alloca_true-valid-memsafety_true-termination.i [2018-04-11 15:11:26,551 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fcstrspn_alloca_true_valid_memsafety_true_termination_i____nlink_t in cstrspn-alloca_true-valid-memsafety_true-termination.i [2018-04-11 15:11:26,551 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fcstrspn_alloca_true_valid_memsafety_true_termination_i__sigset_t in cstrspn-alloca_true-valid-memsafety_true-termination.i [2018-04-11 15:11:26,551 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fcstrspn_alloca_true_valid_memsafety_true_termination_i____blkcnt64_t in cstrspn-alloca_true-valid-memsafety_true-termination.i [2018-04-11 15:11:26,551 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fcstrspn_alloca_true_valid_memsafety_true_termination_i____uint64_t in cstrspn-alloca_true-valid-memsafety_true-termination.i [2018-04-11 15:11:26,551 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fcstrspn_alloca_true_valid_memsafety_true_termination_i____fsword_t in cstrspn-alloca_true-valid-memsafety_true-termination.i [2018-04-11 15:11:26,551 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fcstrspn_alloca_true_valid_memsafety_true_termination_i__fd_mask in cstrspn-alloca_true-valid-memsafety_true-termination.i [2018-04-11 15:11:26,551 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fcstrspn_alloca_true_valid_memsafety_true_termination_i__pthread_rwlockattr_t in cstrspn-alloca_true-valid-memsafety_true-termination.i [2018-04-11 15:11:26,552 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fcstrspn_alloca_true_valid_memsafety_true_termination_i__uint in cstrspn-alloca_true-valid-memsafety_true-termination.i [2018-04-11 15:11:26,552 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fcstrspn_alloca_true_valid_memsafety_true_termination_i____uid_t in cstrspn-alloca_true-valid-memsafety_true-termination.i [2018-04-11 15:11:26,552 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fcstrspn_alloca_true_valid_memsafety_true_termination_i__ssize_t in cstrspn-alloca_true-valid-memsafety_true-termination.i [2018-04-11 15:11:26,552 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fcstrspn_alloca_true_valid_memsafety_true_termination_i____id_t in cstrspn-alloca_true-valid-memsafety_true-termination.i [2018-04-11 15:11:26,552 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fcstrspn_alloca_true_valid_memsafety_true_termination_i__lldiv_t in cstrspn-alloca_true-valid-memsafety_true-termination.i [2018-04-11 15:11:26,552 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fcstrspn_alloca_true_valid_memsafety_true_termination_i__pthread_rwlock_t in cstrspn-alloca_true-valid-memsafety_true-termination.i [2018-04-11 15:11:26,552 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fcstrspn_alloca_true_valid_memsafety_true_termination_i__fd_set in cstrspn-alloca_true-valid-memsafety_true-termination.i [2018-04-11 15:11:26,552 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fcstrspn_alloca_true_valid_memsafety_true_termination_i____uint32_t in cstrspn-alloca_true-valid-memsafety_true-termination.i [2018-04-11 15:11:26,552 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fcstrspn_alloca_true_valid_memsafety_true_termination_i____blksize_t in cstrspn-alloca_true-valid-memsafety_true-termination.i [2018-04-11 15:11:26,552 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fcstrspn_alloca_true_valid_memsafety_true_termination_i__blksize_t in cstrspn-alloca_true-valid-memsafety_true-termination.i [2018-04-11 15:11:26,552 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fcstrspn_alloca_true_valid_memsafety_true_termination_i____dev_t in cstrspn-alloca_true-valid-memsafety_true-termination.i [2018-04-11 15:11:26,553 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fcstrspn_alloca_true_valid_memsafety_true_termination_i____fsblkcnt_t in cstrspn-alloca_true-valid-memsafety_true-termination.i [2018-04-11 15:11:26,553 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fcstrspn_alloca_true_valid_memsafety_true_termination_i____qaddr_t in cstrspn-alloca_true-valid-memsafety_true-termination.i [2018-04-11 15:11:26,553 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fcstrspn_alloca_true_valid_memsafety_true_termination_i__uid_t in cstrspn-alloca_true-valid-memsafety_true-termination.i [2018-04-11 15:11:26,553 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fcstrspn_alloca_true_valid_memsafety_true_termination_i__int16_t in cstrspn-alloca_true-valid-memsafety_true-termination.i [2018-04-11 15:11:26,553 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fcstrspn_alloca_true_valid_memsafety_true_termination_i____rlim64_t in cstrspn-alloca_true-valid-memsafety_true-termination.i [2018-04-11 15:11:26,553 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fcstrspn_alloca_true_valid_memsafety_true_termination_i__fsblkcnt_t in cstrspn-alloca_true-valid-memsafety_true-termination.i [2018-04-11 15:11:26,553 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fcstrspn_alloca_true_valid_memsafety_true_termination_i__time_t in cstrspn-alloca_true-valid-memsafety_true-termination.i [2018-04-11 15:11:26,553 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fcstrspn_alloca_true_valid_memsafety_true_termination_i__div_t in cstrspn-alloca_true-valid-memsafety_true-termination.i [2018-04-11 15:11:26,553 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fcstrspn_alloca_true_valid_memsafety_true_termination_i__pthread_key_t in cstrspn-alloca_true-valid-memsafety_true-termination.i [2018-04-11 15:11:26,553 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fcstrspn_alloca_true_valid_memsafety_true_termination_i____int32_t in cstrspn-alloca_true-valid-memsafety_true-termination.i [2018-04-11 15:11:26,554 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fcstrspn_alloca_true_valid_memsafety_true_termination_i____syscall_ulong_t in cstrspn-alloca_true-valid-memsafety_true-termination.i [2018-04-11 15:11:26,554 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fcstrspn_alloca_true_valid_memsafety_true_termination_i____rlim_t in cstrspn-alloca_true-valid-memsafety_true-termination.i [2018-04-11 15:11:26,554 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fcstrspn_alloca_true_valid_memsafety_true_termination_i__u_int in cstrspn-alloca_true-valid-memsafety_true-termination.i [2018-04-11 15:11:26,554 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fcstrspn_alloca_true_valid_memsafety_true_termination_i__blkcnt_t in cstrspn-alloca_true-valid-memsafety_true-termination.i [2018-04-11 15:11:26,554 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fcstrspn_alloca_true_valid_memsafety_true_termination_i__pthread_mutex_t in cstrspn-alloca_true-valid-memsafety_true-termination.i [2018-04-11 15:11:26,554 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fcstrspn_alloca_true_valid_memsafety_true_termination_i____fsfilcnt_t in cstrspn-alloca_true-valid-memsafety_true-termination.i [2018-04-11 15:11:26,554 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fcstrspn_alloca_true_valid_memsafety_true_termination_i____pthread_list_t in cstrspn-alloca_true-valid-memsafety_true-termination.i [2018-04-11 15:11:26,554 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fcstrspn_alloca_true_valid_memsafety_true_termination_i__pthread_barrierattr_t in cstrspn-alloca_true-valid-memsafety_true-termination.i [2018-04-11 15:11:26,554 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fcstrspn_alloca_true_valid_memsafety_true_termination_i____time_t in cstrspn-alloca_true-valid-memsafety_true-termination.i [2018-04-11 15:11:26,554 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fcstrspn_alloca_true_valid_memsafety_true_termination_i__pthread_mutexattr_t in cstrspn-alloca_true-valid-memsafety_true-termination.i [2018-04-11 15:11:26,554 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fcstrspn_alloca_true_valid_memsafety_true_termination_i____off64_t in cstrspn-alloca_true-valid-memsafety_true-termination.i [2018-04-11 15:11:26,555 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fcstrspn_alloca_true_valid_memsafety_true_termination_i____suseconds_t in cstrspn-alloca_true-valid-memsafety_true-termination.i [2018-04-11 15:11:26,555 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fcstrspn_alloca_true_valid_memsafety_true_termination_i__int8_t in cstrspn-alloca_true-valid-memsafety_true-termination.i [2018-04-11 15:11:26,555 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fcstrspn_alloca_true_valid_memsafety_true_termination_i____u_char in cstrspn-alloca_true-valid-memsafety_true-termination.i [2018-04-11 15:11:26,555 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fcstrspn_alloca_true_valid_memsafety_true_termination_i__u_quad_t in cstrspn-alloca_true-valid-memsafety_true-termination.i [2018-04-11 15:11:26,555 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fcstrspn_alloca_true_valid_memsafety_true_termination_i____uint16_t in cstrspn-alloca_true-valid-memsafety_true-termination.i [2018-04-11 15:11:26,555 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fcstrspn_alloca_true_valid_memsafety_true_termination_i____fsid_t in cstrspn-alloca_true-valid-memsafety_true-termination.i [2018-04-11 15:11:26,555 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fcstrspn_alloca_true_valid_memsafety_true_termination_i____socklen_t in cstrspn-alloca_true-valid-memsafety_true-termination.i [2018-04-11 15:11:26,555 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fcstrspn_alloca_true_valid_memsafety_true_termination_i__daddr_t in cstrspn-alloca_true-valid-memsafety_true-termination.i [2018-04-11 15:11:26,555 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fcstrspn_alloca_true_valid_memsafety_true_termination_i__u_int64_t in cstrspn-alloca_true-valid-memsafety_true-termination.i [2018-04-11 15:11:26,555 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fcstrspn_alloca_true_valid_memsafety_true_termination_i__pid_t in cstrspn-alloca_true-valid-memsafety_true-termination.i [2018-04-11 15:11:26,555 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fcstrspn_alloca_true_valid_memsafety_true_termination_i__clock_t in cstrspn-alloca_true-valid-memsafety_true-termination.i [2018-04-11 15:11:26,555 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fcstrspn_alloca_true_valid_memsafety_true_termination_i____mode_t in cstrspn-alloca_true-valid-memsafety_true-termination.i [2018-04-11 15:11:26,555 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fcstrspn_alloca_true_valid_memsafety_true_termination_i____int16_t in cstrspn-alloca_true-valid-memsafety_true-termination.i [2018-04-11 15:11:26,555 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fcstrspn_alloca_true_valid_memsafety_true_termination_i__off_t in cstrspn-alloca_true-valid-memsafety_true-termination.i [2018-04-11 15:11:26,556 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fcstrspn_alloca_true_valid_memsafety_true_termination_i____u_long in cstrspn-alloca_true-valid-memsafety_true-termination.i [2018-04-11 15:11:26,556 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fcstrspn_alloca_true_valid_memsafety_true_termination_i____WAIT_STATUS in cstrspn-alloca_true-valid-memsafety_true-termination.i [2018-04-11 15:11:26,556 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fcstrspn_alloca_true_valid_memsafety_true_termination_i__u_char in cstrspn-alloca_true-valid-memsafety_true-termination.i [2018-04-11 15:11:26,556 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fcstrspn_alloca_true_valid_memsafety_true_termination_i____int8_t in cstrspn-alloca_true-valid-memsafety_true-termination.i [2018-04-11 15:11:26,556 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fcstrspn_alloca_true_valid_memsafety_true_termination_i____loff_t in cstrspn-alloca_true-valid-memsafety_true-termination.i [2018-04-11 15:11:26,556 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fcstrspn_alloca_true_valid_memsafety_true_termination_i____intptr_t in cstrspn-alloca_true-valid-memsafety_true-termination.i [2018-04-11 15:11:26,556 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fcstrspn_alloca_true_valid_memsafety_true_termination_i__pthread_cond_t in cstrspn-alloca_true-valid-memsafety_true-termination.i [2018-04-11 15:11:26,556 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fcstrspn_alloca_true_valid_memsafety_true_termination_i__size_t in cstrspn-alloca_true-valid-memsafety_true-termination.i [2018-04-11 15:11:26,556 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fcstrspn_alloca_true_valid_memsafety_true_termination_i__fsid_t in cstrspn-alloca_true-valid-memsafety_true-termination.i [2018-04-11 15:11:26,556 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fcstrspn_alloca_true_valid_memsafety_true_termination_i__caddr_t in cstrspn-alloca_true-valid-memsafety_true-termination.i [2018-04-11 15:11:26,556 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fcstrspn_alloca_true_valid_memsafety_true_termination_i____sigset_t in cstrspn-alloca_true-valid-memsafety_true-termination.i [2018-04-11 15:11:26,556 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fcstrspn_alloca_true_valid_memsafety_true_termination_i__pthread_spinlock_t in cstrspn-alloca_true-valid-memsafety_true-termination.i [2018-04-11 15:11:26,556 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fcstrspn_alloca_true_valid_memsafety_true_termination_i____u_short in cstrspn-alloca_true-valid-memsafety_true-termination.i [2018-04-11 15:11:26,556 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fcstrspn_alloca_true_valid_memsafety_true_termination_i__mode_t in cstrspn-alloca_true-valid-memsafety_true-termination.i [2018-04-11 15:11:26,556 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fcstrspn_alloca_true_valid_memsafety_true_termination_i__suseconds_t in cstrspn-alloca_true-valid-memsafety_true-termination.i [2018-04-11 15:11:26,557 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fcstrspn_alloca_true_valid_memsafety_true_termination_i____ino_t in cstrspn-alloca_true-valid-memsafety_true-termination.i [2018-04-11 15:11:26,557 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fcstrspn_alloca_true_valid_memsafety_true_termination_i__u_short in cstrspn-alloca_true-valid-memsafety_true-termination.i [2018-04-11 15:11:26,557 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fcstrspn_alloca_true_valid_memsafety_true_termination_i____caddr_t in cstrspn-alloca_true-valid-memsafety_true-termination.i [2018-04-11 15:11:26,557 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fcstrspn_alloca_true_valid_memsafety_true_termination_i__u_long in cstrspn-alloca_true-valid-memsafety_true-termination.i [2018-04-11 15:11:26,557 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fcstrspn_alloca_true_valid_memsafety_true_termination_i__ulong in cstrspn-alloca_true-valid-memsafety_true-termination.i [2018-04-11 15:11:26,557 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fcstrspn_alloca_true_valid_memsafety_true_termination_i__gid_t in cstrspn-alloca_true-valid-memsafety_true-termination.i [2018-04-11 15:11:26,571 INFO L330 CDTParser]: Deleted temporary CDT project at /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/data/FLAG6e3f4b06a [2018-04-11 15:11:26,575 INFO L304 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-04-11 15:11:26,576 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2018-04-11 15:11:26,577 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-04-11 15:11:26,577 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-04-11 15:11:26,582 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-04-11 15:11:26,583 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 11.04 03:11:26" (1/1) ... [2018-04-11 15:11:26,585 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@76f70593 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.04 03:11:26, skipping insertion in model container [2018-04-11 15:11:26,585 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 11.04 03:11:26" (1/1) ... [2018-04-11 15:11:26,598 INFO L167 Dispatcher]: Using SV-COMP mode [2018-04-11 15:11:26,621 INFO L167 Dispatcher]: Using SV-COMP mode [2018-04-11 15:11:26,748 INFO L175 PostProcessor]: Settings: Checked method=main [2018-04-11 15:11:26,784 INFO L175 PostProcessor]: Settings: Checked method=main [2018-04-11 15:11:26,790 INFO L100 SccComputation]: Graph consists of 0 InCaSumBalls and 112 non ball SCCs. Number of states in SCCs 112. [2018-04-11 15:11:26,828 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.04 03:11:26 WrapperNode [2018-04-11 15:11:26,828 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-04-11 15:11:26,829 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-04-11 15:11:26,829 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-04-11 15:11:26,829 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-04-11 15:11:26,836 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.04 03:11:26" (1/1) ... [2018-04-11 15:11:26,836 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.04 03:11:26" (1/1) ... [2018-04-11 15:11:26,846 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.04 03:11:26" (1/1) ... [2018-04-11 15:11:26,847 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.04 03:11:26" (1/1) ... [2018-04-11 15:11:26,855 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.04 03:11:26" (1/1) ... [2018-04-11 15:11:26,859 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.04 03:11:26" (1/1) ... [2018-04-11 15:11:26,861 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.04 03:11:26" (1/1) ... [2018-04-11 15:11:26,865 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-04-11 15:11:26,865 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-04-11 15:11:26,865 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-04-11 15:11:26,865 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-04-11 15:11:26,866 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.04 03:11:26" (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-11 15:11:26,942 INFO L136 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-04-11 15:11:26,942 INFO L136 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-04-11 15:11:26,942 INFO L136 BoogieDeclarations]: Found implementation of procedure __U_MULTI_fcstrspn_alloca_true_valid_memsafety_true_termination_i____bswap_32 [2018-04-11 15:11:26,942 INFO L136 BoogieDeclarations]: Found implementation of procedure __U_MULTI_fcstrspn_alloca_true_valid_memsafety_true_termination_i____bswap_64 [2018-04-11 15:11:26,942 INFO L136 BoogieDeclarations]: Found implementation of procedure cstrspn [2018-04-11 15:11:26,942 INFO L136 BoogieDeclarations]: Found implementation of procedure main [2018-04-11 15:11:26,942 INFO L128 BoogieDeclarations]: Found specification of procedure __U_MULTI_fcstrspn_alloca_true_valid_memsafety_true_termination_i____bswap_32 [2018-04-11 15:11:26,942 INFO L128 BoogieDeclarations]: Found specification of procedure __U_MULTI_fcstrspn_alloca_true_valid_memsafety_true_termination_i____bswap_64 [2018-04-11 15:11:26,942 INFO L128 BoogieDeclarations]: Found specification of procedure __ctype_get_mb_cur_max [2018-04-11 15:11:26,943 INFO L128 BoogieDeclarations]: Found specification of procedure atof [2018-04-11 15:11:26,943 INFO L128 BoogieDeclarations]: Found specification of procedure atoi [2018-04-11 15:11:26,943 INFO L128 BoogieDeclarations]: Found specification of procedure atol [2018-04-11 15:11:26,943 INFO L128 BoogieDeclarations]: Found specification of procedure atoll [2018-04-11 15:11:26,943 INFO L128 BoogieDeclarations]: Found specification of procedure strtod [2018-04-11 15:11:26,943 INFO L128 BoogieDeclarations]: Found specification of procedure strtof [2018-04-11 15:11:26,943 INFO L128 BoogieDeclarations]: Found specification of procedure strtold [2018-04-11 15:11:26,943 INFO L128 BoogieDeclarations]: Found specification of procedure strtol [2018-04-11 15:11:26,943 INFO L128 BoogieDeclarations]: Found specification of procedure strtoul [2018-04-11 15:11:26,944 INFO L128 BoogieDeclarations]: Found specification of procedure strtoq [2018-04-11 15:11:26,944 INFO L128 BoogieDeclarations]: Found specification of procedure strtouq [2018-04-11 15:11:26,944 INFO L128 BoogieDeclarations]: Found specification of procedure strtoll [2018-04-11 15:11:26,944 INFO L128 BoogieDeclarations]: Found specification of procedure strtoull [2018-04-11 15:11:26,944 INFO L128 BoogieDeclarations]: Found specification of procedure l64a [2018-04-11 15:11:26,944 INFO L128 BoogieDeclarations]: Found specification of procedure a64l [2018-04-11 15:11:26,944 INFO L128 BoogieDeclarations]: Found specification of procedure select [2018-04-11 15:11:26,944 INFO L128 BoogieDeclarations]: Found specification of procedure pselect [2018-04-11 15:11:26,944 INFO L128 BoogieDeclarations]: Found specification of procedure gnu_dev_major [2018-04-11 15:11:26,945 INFO L128 BoogieDeclarations]: Found specification of procedure gnu_dev_minor [2018-04-11 15:11:26,945 INFO L128 BoogieDeclarations]: Found specification of procedure gnu_dev_makedev [2018-04-11 15:11:26,945 INFO L128 BoogieDeclarations]: Found specification of procedure random [2018-04-11 15:11:26,945 INFO L128 BoogieDeclarations]: Found specification of procedure srandom [2018-04-11 15:11:26,945 INFO L128 BoogieDeclarations]: Found specification of procedure initstate [2018-04-11 15:11:26,945 INFO L128 BoogieDeclarations]: Found specification of procedure setstate [2018-04-11 15:11:26,945 INFO L128 BoogieDeclarations]: Found specification of procedure random_r [2018-04-11 15:11:26,945 INFO L128 BoogieDeclarations]: Found specification of procedure srandom_r [2018-04-11 15:11:26,945 INFO L128 BoogieDeclarations]: Found specification of procedure initstate_r [2018-04-11 15:11:26,946 INFO L128 BoogieDeclarations]: Found specification of procedure setstate_r [2018-04-11 15:11:26,946 INFO L128 BoogieDeclarations]: Found specification of procedure rand [2018-04-11 15:11:26,946 INFO L128 BoogieDeclarations]: Found specification of procedure srand [2018-04-11 15:11:26,946 INFO L128 BoogieDeclarations]: Found specification of procedure rand_r [2018-04-11 15:11:26,946 INFO L128 BoogieDeclarations]: Found specification of procedure drand48 [2018-04-11 15:11:26,946 INFO L128 BoogieDeclarations]: Found specification of procedure erand48 [2018-04-11 15:11:26,946 INFO L128 BoogieDeclarations]: Found specification of procedure lrand48 [2018-04-11 15:11:26,946 INFO L128 BoogieDeclarations]: Found specification of procedure nrand48 [2018-04-11 15:11:26,946 INFO L128 BoogieDeclarations]: Found specification of procedure mrand48 [2018-04-11 15:11:26,947 INFO L128 BoogieDeclarations]: Found specification of procedure jrand48 [2018-04-11 15:11:26,947 INFO L128 BoogieDeclarations]: Found specification of procedure srand48 [2018-04-11 15:11:26,947 INFO L128 BoogieDeclarations]: Found specification of procedure seed48 [2018-04-11 15:11:26,947 INFO L128 BoogieDeclarations]: Found specification of procedure lcong48 [2018-04-11 15:11:26,947 INFO L128 BoogieDeclarations]: Found specification of procedure drand48_r [2018-04-11 15:11:26,947 INFO L128 BoogieDeclarations]: Found specification of procedure erand48_r [2018-04-11 15:11:26,947 INFO L128 BoogieDeclarations]: Found specification of procedure lrand48_r [2018-04-11 15:11:26,947 INFO L128 BoogieDeclarations]: Found specification of procedure nrand48_r [2018-04-11 15:11:26,947 INFO L128 BoogieDeclarations]: Found specification of procedure mrand48_r [2018-04-11 15:11:26,947 INFO L128 BoogieDeclarations]: Found specification of procedure jrand48_r [2018-04-11 15:11:26,948 INFO L128 BoogieDeclarations]: Found specification of procedure srand48_r [2018-04-11 15:11:26,948 INFO L128 BoogieDeclarations]: Found specification of procedure seed48_r [2018-04-11 15:11:26,948 INFO L128 BoogieDeclarations]: Found specification of procedure lcong48_r [2018-04-11 15:11:26,948 INFO L128 BoogieDeclarations]: Found specification of procedure malloc [2018-04-11 15:11:26,948 INFO L128 BoogieDeclarations]: Found specification of procedure calloc [2018-04-11 15:11:26,948 INFO L128 BoogieDeclarations]: Found specification of procedure realloc [2018-04-11 15:11:26,948 INFO L128 BoogieDeclarations]: Found specification of procedure free [2018-04-11 15:11:26,948 INFO L128 BoogieDeclarations]: Found specification of procedure cfree [2018-04-11 15:11:26,948 INFO L128 BoogieDeclarations]: Found specification of procedure alloca [2018-04-11 15:11:26,948 INFO L128 BoogieDeclarations]: Found specification of procedure valloc [2018-04-11 15:11:26,949 INFO L128 BoogieDeclarations]: Found specification of procedure posix_memalign [2018-04-11 15:11:26,949 INFO L128 BoogieDeclarations]: Found specification of procedure abort [2018-04-11 15:11:26,949 INFO L128 BoogieDeclarations]: Found specification of procedure atexit [2018-04-11 15:11:26,949 INFO L128 BoogieDeclarations]: Found specification of procedure on_exit [2018-04-11 15:11:26,949 INFO L128 BoogieDeclarations]: Found specification of procedure exit [2018-04-11 15:11:26,949 INFO L128 BoogieDeclarations]: Found specification of procedure _Exit [2018-04-11 15:11:26,949 INFO L128 BoogieDeclarations]: Found specification of procedure getenv [2018-04-11 15:11:26,949 INFO L128 BoogieDeclarations]: Found specification of procedure putenv [2018-04-11 15:11:26,949 INFO L128 BoogieDeclarations]: Found specification of procedure setenv [2018-04-11 15:11:26,949 INFO L128 BoogieDeclarations]: Found specification of procedure unsetenv [2018-04-11 15:11:26,950 INFO L128 BoogieDeclarations]: Found specification of procedure clearenv [2018-04-11 15:11:26,950 INFO L128 BoogieDeclarations]: Found specification of procedure mktemp [2018-04-11 15:11:26,950 INFO L128 BoogieDeclarations]: Found specification of procedure mkstemp [2018-04-11 15:11:26,950 INFO L128 BoogieDeclarations]: Found specification of procedure mkstemps [2018-04-11 15:11:26,950 INFO L128 BoogieDeclarations]: Found specification of procedure mkdtemp [2018-04-11 15:11:26,950 INFO L128 BoogieDeclarations]: Found specification of procedure system [2018-04-11 15:11:26,950 INFO L128 BoogieDeclarations]: Found specification of procedure realpath [2018-04-11 15:11:26,950 INFO L128 BoogieDeclarations]: Found specification of procedure bsearch [2018-04-11 15:11:26,950 INFO L128 BoogieDeclarations]: Found specification of procedure qsort [2018-04-11 15:11:26,950 INFO L128 BoogieDeclarations]: Found specification of procedure abs [2018-04-11 15:11:26,951 INFO L128 BoogieDeclarations]: Found specification of procedure labs [2018-04-11 15:11:26,951 INFO L128 BoogieDeclarations]: Found specification of procedure llabs [2018-04-11 15:11:26,951 INFO L128 BoogieDeclarations]: Found specification of procedure div [2018-04-11 15:11:26,951 INFO L128 BoogieDeclarations]: Found specification of procedure ldiv [2018-04-11 15:11:26,951 INFO L128 BoogieDeclarations]: Found specification of procedure lldiv [2018-04-11 15:11:26,951 INFO L128 BoogieDeclarations]: Found specification of procedure ecvt [2018-04-11 15:11:26,951 INFO L128 BoogieDeclarations]: Found specification of procedure fcvt [2018-04-11 15:11:26,951 INFO L128 BoogieDeclarations]: Found specification of procedure gcvt [2018-04-11 15:11:26,951 INFO L128 BoogieDeclarations]: Found specification of procedure qecvt [2018-04-11 15:11:26,951 INFO L128 BoogieDeclarations]: Found specification of procedure qfcvt [2018-04-11 15:11:26,951 INFO L128 BoogieDeclarations]: Found specification of procedure qgcvt [2018-04-11 15:11:26,952 INFO L128 BoogieDeclarations]: Found specification of procedure ecvt_r [2018-04-11 15:11:26,952 INFO L128 BoogieDeclarations]: Found specification of procedure fcvt_r [2018-04-11 15:11:26,952 INFO L128 BoogieDeclarations]: Found specification of procedure qecvt_r [2018-04-11 15:11:26,952 INFO L128 BoogieDeclarations]: Found specification of procedure qfcvt_r [2018-04-11 15:11:26,952 INFO L128 BoogieDeclarations]: Found specification of procedure mblen [2018-04-11 15:11:26,952 INFO L128 BoogieDeclarations]: Found specification of procedure mbtowc [2018-04-11 15:11:26,952 INFO L128 BoogieDeclarations]: Found specification of procedure wctomb [2018-04-11 15:11:26,952 INFO L128 BoogieDeclarations]: Found specification of procedure mbstowcs [2018-04-11 15:11:26,952 INFO L128 BoogieDeclarations]: Found specification of procedure wcstombs [2018-04-11 15:11:26,952 INFO L128 BoogieDeclarations]: Found specification of procedure rpmatch [2018-04-11 15:11:26,953 INFO L128 BoogieDeclarations]: Found specification of procedure getsubopt [2018-04-11 15:11:26,953 INFO L128 BoogieDeclarations]: Found specification of procedure getloadavg [2018-04-11 15:11:26,953 INFO L128 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2018-04-11 15:11:26,953 INFO L128 BoogieDeclarations]: Found specification of procedure cstrspn [2018-04-11 15:11:26,953 INFO L128 BoogieDeclarations]: Found specification of procedure read~int [2018-04-11 15:11:26,953 INFO L128 BoogieDeclarations]: Found specification of procedure main [2018-04-11 15:11:26,953 INFO L128 BoogieDeclarations]: Found specification of procedure #Ultimate.alloc [2018-04-11 15:11:26,953 INFO L128 BoogieDeclarations]: Found specification of procedure write~int [2018-04-11 15:11:26,953 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2018-04-11 15:11:26,954 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-04-11 15:11:26,954 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-04-11 15:11:26,954 INFO L128 BoogieDeclarations]: Found specification of procedure write~unchecked~int [2018-04-11 15:11:27,231 INFO L259 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-04-11 15:11:27,231 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.04 03:11:27 BoogieIcfgContainer [2018-04-11 15:11:27,231 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-04-11 15:11:27,232 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-04-11 15:11:27,232 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-04-11 15:11:27,235 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-04-11 15:11:27,235 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 11.04 03:11:26" (1/3) ... [2018-04-11 15:11:27,235 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@ba77953 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 11.04 03:11:27, skipping insertion in model container [2018-04-11 15:11:27,236 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.04 03:11:26" (2/3) ... [2018-04-11 15:11:27,236 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@ba77953 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 11.04 03:11:27, skipping insertion in model container [2018-04-11 15:11:27,236 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.04 03:11:27" (3/3) ... [2018-04-11 15:11:27,238 INFO L107 eAbstractionObserver]: Analyzing ICFG cstrspn-alloca_true-valid-memsafety_true-termination.i [2018-04-11 15:11:27,244 INFO L131 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-04-11 15:11:27,249 INFO L143 ceAbstractionStarter]: Appying trace abstraction to program that has 15 error locations. [2018-04-11 15:11:27,279 INFO L128 ementStrategyFactory]: Using default assertion order modulation [2018-04-11 15:11:27,279 INFO L369 AbstractCegarLoop]: Interprodecural is true [2018-04-11 15:11:27,279 INFO L370 AbstractCegarLoop]: Hoare is false [2018-04-11 15:11:27,279 INFO L371 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-04-11 15:11:27,279 INFO L372 AbstractCegarLoop]: Backedges is TWOTRACK [2018-04-11 15:11:27,280 INFO L373 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-04-11 15:11:27,280 INFO L374 AbstractCegarLoop]: Difference is false [2018-04-11 15:11:27,280 INFO L375 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-04-11 15:11:27,280 INFO L380 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-04-11 15:11:27,280 INFO L87 2NestedWordAutomaton]: Mode: main mode - execution starts in main procedure [2018-04-11 15:11:27,288 INFO L276 IsEmpty]: Start isEmpty. Operand 58 states. [2018-04-11 15:11:27,294 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2018-04-11 15:11:27,294 INFO L347 BasicCegarLoop]: Found error trace [2018-04-11 15:11:27,294 INFO L355 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-11 15:11:27,294 INFO L408 AbstractCegarLoop]: === Iteration 1 === [mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr4EnsuresViolationMEMORY_LEAK, mainErr0RequiresViolation, cstrspnErr7RequiresViolation, cstrspnErr5RequiresViolation, cstrspnErr1RequiresViolation, cstrspnErr0RequiresViolation, cstrspnErr6RequiresViolation, cstrspnErr8RequiresViolation, cstrspnErr2RequiresViolation, cstrspnErr4RequiresViolation, cstrspnErr3RequiresViolation, cstrspnErr9RequiresViolation]=== [2018-04-11 15:11:27,297 INFO L82 PathProgramCache]: Analyzing trace with hash 2018700559, now seen corresponding path program 1 times [2018-04-11 15:11:27,298 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-04-11 15:11:27,298 INFO L68 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-04-11 15:11:27,332 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 15:11:27,333 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-11 15:11:27,333 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 15:11:27,371 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-11 15:11:27,375 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-11 15:11:27,390 INFO L431 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown lemma type! [2018-04-11 15:11:27,390 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-04-11 15:11:27,390 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-04-11 15:11:27,391 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-11 15:11:27,415 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-11 15:11:27,422 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-11 15:11:27,449 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-11 15:11:27,451 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-11 15:11:27,454 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 15:11:27,455 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:6, output treesize:5 [2018-04-11 15:11:27,479 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 11 [2018-04-11 15:11:27,480 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-11 15:11:27,484 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-11 15:11:27,484 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:12, output treesize:11 [2018-04-11 15:11:27,492 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-11 15:11:27,493 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-04-11 15:11:27,493 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-04-11 15:11:27,495 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-04-11 15:11:27,503 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-04-11 15:11:27,503 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-04-11 15:11:27,505 INFO L87 Difference]: Start difference. First operand 58 states. Second operand 4 states. [2018-04-11 15:11:27,574 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-11 15:11:27,575 INFO L93 Difference]: Finished difference Result 57 states and 62 transitions. [2018-04-11 15:11:27,575 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-04-11 15:11:27,576 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 13 [2018-04-11 15:11:27,576 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-11 15:11:27,582 INFO L225 Difference]: With dead ends: 57 [2018-04-11 15:11:27,582 INFO L226 Difference]: Without dead ends: 54 [2018-04-11 15:11:27,583 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 9 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-04-11 15:11:27,593 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 54 states. [2018-04-11 15:11:27,603 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 54 to 54. [2018-04-11 15:11:27,603 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 54 states. [2018-04-11 15:11:27,604 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 54 states to 54 states and 59 transitions. [2018-04-11 15:11:27,605 INFO L78 Accepts]: Start accepts. Automaton has 54 states and 59 transitions. Word has length 13 [2018-04-11 15:11:27,605 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-11 15:11:27,605 INFO L459 AbstractCegarLoop]: Abstraction has 54 states and 59 transitions. [2018-04-11 15:11:27,606 INFO L460 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-04-11 15:11:27,606 INFO L276 IsEmpty]: Start isEmpty. Operand 54 states and 59 transitions. [2018-04-11 15:11:27,606 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2018-04-11 15:11:27,606 INFO L347 BasicCegarLoop]: Found error trace [2018-04-11 15:11:27,606 INFO L355 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-11 15:11:27,606 INFO L408 AbstractCegarLoop]: === Iteration 2 === [mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr4EnsuresViolationMEMORY_LEAK, mainErr0RequiresViolation, cstrspnErr7RequiresViolation, cstrspnErr5RequiresViolation, cstrspnErr1RequiresViolation, cstrspnErr0RequiresViolation, cstrspnErr6RequiresViolation, cstrspnErr8RequiresViolation, cstrspnErr2RequiresViolation, cstrspnErr4RequiresViolation, cstrspnErr3RequiresViolation, cstrspnErr9RequiresViolation]=== [2018-04-11 15:11:27,606 INFO L82 PathProgramCache]: Analyzing trace with hash 2018700560, now seen corresponding path program 1 times [2018-04-11 15:11:27,606 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-04-11 15:11:27,607 INFO L68 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-04-11 15:11:27,607 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 15:11:27,607 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-11 15:11:27,607 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 15:11:27,618 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-11 15:11:27,619 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-11 15:11:27,625 INFO L431 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown lemma type! [2018-04-11 15:11:27,625 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-04-11 15:11:27,625 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-04-11 15:11:27,626 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-11 15:11:27,646 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-11 15:11:27,649 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-11 15:11:27,661 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-11 15:11:27,661 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-11 15:11:27,673 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-11 15:11:27,673 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 15:11:27,678 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 15:11:27,678 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:19, output treesize:17 [2018-04-11 15:11:27,706 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 15:11:27,717 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 15 [2018-04-11 15:11:27,718 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-11 15:11:27,731 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 15:11:27,732 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 15:11:27,733 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-11 15:11:27,733 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 15:11:27,741 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 15:11:27,742 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:28, output treesize:12 [2018-04-11 15:11:27,753 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-11 15:11:27,753 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-04-11 15:11:27,753 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-04-11 15:11:27,754 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-04-11 15:11:27,754 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-04-11 15:11:27,754 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2018-04-11 15:11:27,754 INFO L87 Difference]: Start difference. First operand 54 states and 59 transitions. Second operand 6 states. [2018-04-11 15:11:27,888 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-11 15:11:27,888 INFO L93 Difference]: Finished difference Result 71 states and 77 transitions. [2018-04-11 15:11:27,888 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-04-11 15:11:27,888 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 13 [2018-04-11 15:11:27,888 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-11 15:11:27,890 INFO L225 Difference]: With dead ends: 71 [2018-04-11 15:11:27,890 INFO L226 Difference]: Without dead ends: 71 [2018-04-11 15:11:27,890 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=19, Invalid=23, Unknown=0, NotChecked=0, Total=42 [2018-04-11 15:11:27,890 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 71 states. [2018-04-11 15:11:27,895 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 71 to 60. [2018-04-11 15:11:27,896 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 60 states. [2018-04-11 15:11:27,897 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 60 states to 60 states and 66 transitions. [2018-04-11 15:11:27,897 INFO L78 Accepts]: Start accepts. Automaton has 60 states and 66 transitions. Word has length 13 [2018-04-11 15:11:27,897 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-11 15:11:27,897 INFO L459 AbstractCegarLoop]: Abstraction has 60 states and 66 transitions. [2018-04-11 15:11:27,897 INFO L460 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-04-11 15:11:27,897 INFO L276 IsEmpty]: Start isEmpty. Operand 60 states and 66 transitions. [2018-04-11 15:11:27,897 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2018-04-11 15:11:27,897 INFO L347 BasicCegarLoop]: Found error trace [2018-04-11 15:11:27,898 INFO L355 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-11 15:11:27,898 INFO L408 AbstractCegarLoop]: === Iteration 3 === [mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr4EnsuresViolationMEMORY_LEAK, mainErr0RequiresViolation, cstrspnErr7RequiresViolation, cstrspnErr5RequiresViolation, cstrspnErr1RequiresViolation, cstrspnErr0RequiresViolation, cstrspnErr6RequiresViolation, cstrspnErr8RequiresViolation, cstrspnErr2RequiresViolation, cstrspnErr4RequiresViolation, cstrspnErr3RequiresViolation, cstrspnErr9RequiresViolation]=== [2018-04-11 15:11:27,898 INFO L82 PathProgramCache]: Analyzing trace with hash -501259374, now seen corresponding path program 1 times [2018-04-11 15:11:27,898 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-04-11 15:11:27,898 INFO L68 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-04-11 15:11:27,899 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 15:11:27,899 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-11 15:11:27,899 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 15:11:27,910 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-11 15:11:27,911 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-11 15:11:27,915 INFO L431 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown lemma type! [2018-04-11 15:11:27,916 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-04-11 15:11:27,916 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-04-11 15:11:27,917 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-11 15:11:27,939 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-11 15:11:27,942 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-11 15:11:27,948 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-11 15:11:27,948 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-11 15:11:27,954 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-11 15:11:27,954 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 15:11:27,959 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 15:11:27,959 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:19, output treesize:17 [2018-04-11 15:11:27,995 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 15:11:27,996 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 15:11:27,996 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 4 [2018-04-11 15:11:27,997 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-11 15:11:28,008 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 15 [2018-04-11 15:11:28,008 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 15:11:28,026 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 15:11:28,026 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:28, output treesize:12 [2018-04-11 15:11:28,037 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-11 15:11:28,038 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-04-11 15:11:28,038 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-04-11 15:11:28,038 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-04-11 15:11:28,038 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-04-11 15:11:28,039 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2018-04-11 15:11:28,039 INFO L87 Difference]: Start difference. First operand 60 states and 66 transitions. Second operand 6 states. [2018-04-11 15:11:28,106 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-11 15:11:28,106 INFO L93 Difference]: Finished difference Result 59 states and 65 transitions. [2018-04-11 15:11:28,106 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-04-11 15:11:28,106 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 13 [2018-04-11 15:11:28,106 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-11 15:11:28,107 INFO L225 Difference]: With dead ends: 59 [2018-04-11 15:11:28,107 INFO L226 Difference]: Without dead ends: 59 [2018-04-11 15:11:28,107 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=19, Invalid=23, Unknown=0, NotChecked=0, Total=42 [2018-04-11 15:11:28,108 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 59 states. [2018-04-11 15:11:28,110 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 59 to 53. [2018-04-11 15:11:28,110 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 53 states. [2018-04-11 15:11:28,111 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 53 states to 53 states and 58 transitions. [2018-04-11 15:11:28,111 INFO L78 Accepts]: Start accepts. Automaton has 53 states and 58 transitions. Word has length 13 [2018-04-11 15:11:28,111 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-11 15:11:28,111 INFO L459 AbstractCegarLoop]: Abstraction has 53 states and 58 transitions. [2018-04-11 15:11:28,112 INFO L460 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-04-11 15:11:28,112 INFO L276 IsEmpty]: Start isEmpty. Operand 53 states and 58 transitions. [2018-04-11 15:11:28,112 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2018-04-11 15:11:28,112 INFO L347 BasicCegarLoop]: Found error trace [2018-04-11 15:11:28,112 INFO L355 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-11 15:11:28,112 INFO L408 AbstractCegarLoop]: === Iteration 4 === [mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr4EnsuresViolationMEMORY_LEAK, mainErr0RequiresViolation, cstrspnErr7RequiresViolation, cstrspnErr5RequiresViolation, cstrspnErr1RequiresViolation, cstrspnErr0RequiresViolation, cstrspnErr6RequiresViolation, cstrspnErr8RequiresViolation, cstrspnErr2RequiresViolation, cstrspnErr4RequiresViolation, cstrspnErr3RequiresViolation, cstrspnErr9RequiresViolation]=== [2018-04-11 15:11:28,112 INFO L82 PathProgramCache]: Analyzing trace with hash -1844792117, now seen corresponding path program 1 times [2018-04-11 15:11:28,112 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-04-11 15:11:28,112 INFO L68 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-04-11 15:11:28,113 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 15:11:28,113 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-11 15:11:28,113 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 15:11:28,122 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-11 15:11:28,122 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-11 15:11:28,144 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-11 15:11:28,144 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-04-11 15:11:28,144 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-04-11 15:11:28,145 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-04-11 15:11:28,145 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-04-11 15:11:28,145 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-04-11 15:11:28,145 INFO L87 Difference]: Start difference. First operand 53 states and 58 transitions. Second operand 4 states. [2018-04-11 15:11:28,181 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-11 15:11:28,181 INFO L93 Difference]: Finished difference Result 52 states and 57 transitions. [2018-04-11 15:11:28,181 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-04-11 15:11:28,181 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 14 [2018-04-11 15:11:28,181 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-11 15:11:28,182 INFO L225 Difference]: With dead ends: 52 [2018-04-11 15:11:28,182 INFO L226 Difference]: Without dead ends: 52 [2018-04-11 15:11:28,182 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-11 15:11:28,182 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 52 states. [2018-04-11 15:11:28,185 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 52 to 52. [2018-04-11 15:11:28,185 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 52 states. [2018-04-11 15:11:28,185 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 52 states to 52 states and 57 transitions. [2018-04-11 15:11:28,186 INFO L78 Accepts]: Start accepts. Automaton has 52 states and 57 transitions. Word has length 14 [2018-04-11 15:11:28,186 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-11 15:11:28,186 INFO L459 AbstractCegarLoop]: Abstraction has 52 states and 57 transitions. [2018-04-11 15:11:28,186 INFO L460 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-04-11 15:11:28,186 INFO L276 IsEmpty]: Start isEmpty. Operand 52 states and 57 transitions. [2018-04-11 15:11:28,186 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2018-04-11 15:11:28,186 INFO L347 BasicCegarLoop]: Found error trace [2018-04-11 15:11:28,187 INFO L355 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-11 15:11:28,187 INFO L408 AbstractCegarLoop]: === Iteration 5 === [mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr4EnsuresViolationMEMORY_LEAK, mainErr0RequiresViolation, cstrspnErr7RequiresViolation, cstrspnErr5RequiresViolation, cstrspnErr1RequiresViolation, cstrspnErr0RequiresViolation, cstrspnErr6RequiresViolation, cstrspnErr8RequiresViolation, cstrspnErr2RequiresViolation, cstrspnErr4RequiresViolation, cstrspnErr3RequiresViolation, cstrspnErr9RequiresViolation]=== [2018-04-11 15:11:28,187 INFO L82 PathProgramCache]: Analyzing trace with hash -1844792116, now seen corresponding path program 1 times [2018-04-11 15:11:28,187 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-04-11 15:11:28,187 INFO L68 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-04-11 15:11:28,188 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 15:11:28,188 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-11 15:11:28,188 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 15:11:28,197 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-11 15:11:28,198 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-11 15:11:28,242 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-11 15:11:28,242 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-04-11 15:11:28,243 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-04-11 15:11:28,243 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-04-11 15:11:28,243 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-04-11 15:11:28,243 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-04-11 15:11:28,243 INFO L87 Difference]: Start difference. First operand 52 states and 57 transitions. Second operand 5 states. [2018-04-11 15:11:28,267 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-11 15:11:28,267 INFO L93 Difference]: Finished difference Result 51 states and 56 transitions. [2018-04-11 15:11:28,268 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-04-11 15:11:28,268 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 14 [2018-04-11 15:11:28,268 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-11 15:11:28,268 INFO L225 Difference]: With dead ends: 51 [2018-04-11 15:11:28,268 INFO L226 Difference]: Without dead ends: 51 [2018-04-11 15:11:28,268 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=14, Invalid=16, Unknown=0, NotChecked=0, Total=30 [2018-04-11 15:11:28,269 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 51 states. [2018-04-11 15:11:28,270 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 51 to 51. [2018-04-11 15:11:28,270 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 51 states. [2018-04-11 15:11:28,271 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 51 states to 51 states and 56 transitions. [2018-04-11 15:11:28,271 INFO L78 Accepts]: Start accepts. Automaton has 51 states and 56 transitions. Word has length 14 [2018-04-11 15:11:28,271 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-11 15:11:28,271 INFO L459 AbstractCegarLoop]: Abstraction has 51 states and 56 transitions. [2018-04-11 15:11:28,271 INFO L460 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-04-11 15:11:28,271 INFO L276 IsEmpty]: Start isEmpty. Operand 51 states and 56 transitions. [2018-04-11 15:11:28,271 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2018-04-11 15:11:28,271 INFO L347 BasicCegarLoop]: Found error trace [2018-04-11 15:11:28,271 INFO L355 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-11 15:11:28,272 INFO L408 AbstractCegarLoop]: === Iteration 6 === [mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr4EnsuresViolationMEMORY_LEAK, mainErr0RequiresViolation, cstrspnErr7RequiresViolation, cstrspnErr5RequiresViolation, cstrspnErr1RequiresViolation, cstrspnErr0RequiresViolation, cstrspnErr6RequiresViolation, cstrspnErr8RequiresViolation, cstrspnErr2RequiresViolation, cstrspnErr4RequiresViolation, cstrspnErr3RequiresViolation, cstrspnErr9RequiresViolation]=== [2018-04-11 15:11:28,272 INFO L82 PathProgramCache]: Analyzing trace with hash 1893487725, now seen corresponding path program 1 times [2018-04-11 15:11:28,272 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-04-11 15:11:28,272 INFO L68 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-04-11 15:11:28,272 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 15:11:28,272 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-11 15:11:28,272 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 15:11:28,281 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-11 15:11:28,282 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-11 15:11:28,303 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-11 15:11:28,304 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-04-11 15:11:28,304 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-04-11 15:11:28,304 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-04-11 15:11:28,304 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-04-11 15:11:28,304 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-04-11 15:11:28,304 INFO L87 Difference]: Start difference. First operand 51 states and 56 transitions. Second operand 5 states. [2018-04-11 15:11:28,339 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-11 15:11:28,339 INFO L93 Difference]: Finished difference Result 49 states and 54 transitions. [2018-04-11 15:11:28,339 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-04-11 15:11:28,339 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 18 [2018-04-11 15:11:28,340 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-11 15:11:28,340 INFO L225 Difference]: With dead ends: 49 [2018-04-11 15:11:28,340 INFO L226 Difference]: Without dead ends: 49 [2018-04-11 15:11:28,340 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2018-04-11 15:11:28,340 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 49 states. [2018-04-11 15:11:28,342 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 49 to 49. [2018-04-11 15:11:28,342 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 49 states. [2018-04-11 15:11:28,343 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 49 states to 49 states and 54 transitions. [2018-04-11 15:11:28,343 INFO L78 Accepts]: Start accepts. Automaton has 49 states and 54 transitions. Word has length 18 [2018-04-11 15:11:28,343 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-11 15:11:28,343 INFO L459 AbstractCegarLoop]: Abstraction has 49 states and 54 transitions. [2018-04-11 15:11:28,343 INFO L460 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-04-11 15:11:28,343 INFO L276 IsEmpty]: Start isEmpty. Operand 49 states and 54 transitions. [2018-04-11 15:11:28,343 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2018-04-11 15:11:28,344 INFO L347 BasicCegarLoop]: Found error trace [2018-04-11 15:11:28,344 INFO L355 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-11 15:11:28,344 INFO L408 AbstractCegarLoop]: === Iteration 7 === [mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr4EnsuresViolationMEMORY_LEAK, mainErr0RequiresViolation, cstrspnErr7RequiresViolation, cstrspnErr5RequiresViolation, cstrspnErr1RequiresViolation, cstrspnErr0RequiresViolation, cstrspnErr6RequiresViolation, cstrspnErr8RequiresViolation, cstrspnErr2RequiresViolation, cstrspnErr4RequiresViolation, cstrspnErr3RequiresViolation, cstrspnErr9RequiresViolation]=== [2018-04-11 15:11:28,344 INFO L82 PathProgramCache]: Analyzing trace with hash 1893487726, now seen corresponding path program 1 times [2018-04-11 15:11:28,344 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-04-11 15:11:28,344 INFO L68 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-04-11 15:11:28,345 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 15:11:28,345 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-11 15:11:28,345 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 15:11:28,353 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-11 15:11:28,354 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-11 15:11:28,437 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-11 15:11:28,437 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-04-11 15:11:28,437 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-04-11 15:11:28,437 INFO L442 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-04-11 15:11:28,437 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-04-11 15:11:28,437 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2018-04-11 15:11:28,438 INFO L87 Difference]: Start difference. First operand 49 states and 54 transitions. Second operand 8 states. [2018-04-11 15:11:28,515 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-11 15:11:28,515 INFO L93 Difference]: Finished difference Result 73 states and 82 transitions. [2018-04-11 15:11:28,515 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-04-11 15:11:28,515 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 18 [2018-04-11 15:11:28,515 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-11 15:11:28,517 INFO L225 Difference]: With dead ends: 73 [2018-04-11 15:11:28,517 INFO L226 Difference]: Without dead ends: 73 [2018-04-11 15:11:28,517 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 13 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=37, Invalid=95, Unknown=0, NotChecked=0, Total=132 [2018-04-11 15:11:28,517 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 73 states. [2018-04-11 15:11:28,520 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 73 to 53. [2018-04-11 15:11:28,520 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 53 states. [2018-04-11 15:11:28,520 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 53 states to 53 states and 59 transitions. [2018-04-11 15:11:28,520 INFO L78 Accepts]: Start accepts. Automaton has 53 states and 59 transitions. Word has length 18 [2018-04-11 15:11:28,521 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-11 15:11:28,521 INFO L459 AbstractCegarLoop]: Abstraction has 53 states and 59 transitions. [2018-04-11 15:11:28,521 INFO L460 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-04-11 15:11:28,521 INFO L276 IsEmpty]: Start isEmpty. Operand 53 states and 59 transitions. [2018-04-11 15:11:28,521 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2018-04-11 15:11:28,521 INFO L347 BasicCegarLoop]: Found error trace [2018-04-11 15:11:28,521 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] [2018-04-11 15:11:28,521 INFO L408 AbstractCegarLoop]: === Iteration 8 === [mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr4EnsuresViolationMEMORY_LEAK, mainErr0RequiresViolation, cstrspnErr7RequiresViolation, cstrspnErr5RequiresViolation, cstrspnErr1RequiresViolation, cstrspnErr0RequiresViolation, cstrspnErr6RequiresViolation, cstrspnErr8RequiresViolation, cstrspnErr2RequiresViolation, cstrspnErr4RequiresViolation, cstrspnErr3RequiresViolation, cstrspnErr9RequiresViolation]=== [2018-04-11 15:11:28,522 INFO L82 PathProgramCache]: Analyzing trace with hash -894404631, now seen corresponding path program 1 times [2018-04-11 15:11:28,522 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-04-11 15:11:28,522 INFO L68 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-04-11 15:11:28,523 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 15:11:28,523 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-11 15:11:28,523 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 15:11:28,529 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-11 15:11:28,530 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-11 15:11:28,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-11 15:11:28,555 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-04-11 15:11:28,555 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-04-11 15:11:28,556 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-04-11 15:11:28,556 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-04-11 15:11:28,556 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-04-11 15:11:28,556 INFO L87 Difference]: Start difference. First operand 53 states and 59 transitions. Second operand 6 states. [2018-04-11 15:11:28,597 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-11 15:11:28,597 INFO L93 Difference]: Finished difference Result 53 states and 59 transitions. [2018-04-11 15:11:28,597 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-04-11 15:11:28,597 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 23 [2018-04-11 15:11:28,598 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-11 15:11:28,598 INFO L225 Difference]: With dead ends: 53 [2018-04-11 15:11:28,598 INFO L226 Difference]: Without dead ends: 53 [2018-04-11 15:11:28,598 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2018-04-11 15:11:28,598 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 53 states. [2018-04-11 15:11:28,600 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 53 to 50. [2018-04-11 15:11:28,600 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 50 states. [2018-04-11 15:11:28,601 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 50 states to 50 states and 56 transitions. [2018-04-11 15:11:28,601 INFO L78 Accepts]: Start accepts. Automaton has 50 states and 56 transitions. Word has length 23 [2018-04-11 15:11:28,601 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-11 15:11:28,601 INFO L459 AbstractCegarLoop]: Abstraction has 50 states and 56 transitions. [2018-04-11 15:11:28,601 INFO L460 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-04-11 15:11:28,601 INFO L276 IsEmpty]: Start isEmpty. Operand 50 states and 56 transitions. [2018-04-11 15:11:28,602 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2018-04-11 15:11:28,602 INFO L347 BasicCegarLoop]: Found error trace [2018-04-11 15:11:28,602 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] [2018-04-11 15:11:28,602 INFO L408 AbstractCegarLoop]: === Iteration 9 === [mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr4EnsuresViolationMEMORY_LEAK, mainErr0RequiresViolation, cstrspnErr7RequiresViolation, cstrspnErr5RequiresViolation, cstrspnErr1RequiresViolation, cstrspnErr0RequiresViolation, cstrspnErr6RequiresViolation, cstrspnErr8RequiresViolation, cstrspnErr2RequiresViolation, cstrspnErr4RequiresViolation, cstrspnErr3RequiresViolation, cstrspnErr9RequiresViolation]=== [2018-04-11 15:11:28,602 INFO L82 PathProgramCache]: Analyzing trace with hash -894404630, now seen corresponding path program 1 times [2018-04-11 15:11:28,602 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-04-11 15:11:28,603 INFO L68 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-04-11 15:11:28,603 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 15:11:28,603 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-11 15:11:28,603 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 15:11:28,611 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-11 15:11:28,611 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-11 15:11:28,692 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-11 15:11:28,692 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-04-11 15:11:28,692 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2018-04-11 15:11:28,693 INFO L442 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-04-11 15:11:28,693 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-04-11 15:11:28,693 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72 [2018-04-11 15:11:28,693 INFO L87 Difference]: Start difference. First operand 50 states and 56 transitions. Second operand 9 states. [2018-04-11 15:11:28,808 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-11 15:11:28,809 INFO L93 Difference]: Finished difference Result 67 states and 77 transitions. [2018-04-11 15:11:28,809 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-04-11 15:11:28,809 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 23 [2018-04-11 15:11:28,809 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-11 15:11:28,810 INFO L225 Difference]: With dead ends: 67 [2018-04-11 15:11:28,810 INFO L226 Difference]: Without dead ends: 67 [2018-04-11 15:11:28,810 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 17 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=34, Invalid=98, Unknown=0, NotChecked=0, Total=132 [2018-04-11 15:11:28,810 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 67 states. [2018-04-11 15:11:28,813 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 67 to 58. [2018-04-11 15:11:28,813 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 58 states. [2018-04-11 15:11:28,813 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 58 states to 58 states and 66 transitions. [2018-04-11 15:11:28,814 INFO L78 Accepts]: Start accepts. Automaton has 58 states and 66 transitions. Word has length 23 [2018-04-11 15:11:28,814 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-11 15:11:28,814 INFO L459 AbstractCegarLoop]: Abstraction has 58 states and 66 transitions. [2018-04-11 15:11:28,814 INFO L460 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-04-11 15:11:28,814 INFO L276 IsEmpty]: Start isEmpty. Operand 58 states and 66 transitions. [2018-04-11 15:11:28,815 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2018-04-11 15:11:28,815 INFO L347 BasicCegarLoop]: Found error trace [2018-04-11 15:11:28,815 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-11 15:11:28,815 INFO L408 AbstractCegarLoop]: === Iteration 10 === [mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr4EnsuresViolationMEMORY_LEAK, mainErr0RequiresViolation, cstrspnErr7RequiresViolation, cstrspnErr5RequiresViolation, cstrspnErr1RequiresViolation, cstrspnErr0RequiresViolation, cstrspnErr6RequiresViolation, cstrspnErr8RequiresViolation, cstrspnErr2RequiresViolation, cstrspnErr4RequiresViolation, cstrspnErr3RequiresViolation, cstrspnErr9RequiresViolation]=== [2018-04-11 15:11:28,816 INFO L82 PathProgramCache]: Analyzing trace with hash -1986095611, now seen corresponding path program 1 times [2018-04-11 15:11:28,816 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-04-11 15:11:28,816 INFO L68 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-04-11 15:11:28,816 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 15:11:28,816 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-11 15:11:28,816 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 15:11:28,826 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-11 15:11:28,827 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-11 15:11:28,829 INFO L431 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown lemma type! [2018-04-11 15:11:28,830 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-04-11 15:11:28,830 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-04-11 15:11:28,830 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-11 15:11:28,848 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-11 15:11:28,851 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-11 15:11:28,876 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 15:11:28,877 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 21 [2018-04-11 15:11:28,879 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 15:11:28,879 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-11 15:11:28,880 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 15:11:28,883 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 15:11:28,886 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2018-04-11 15:11:28,886 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:23, output treesize:15 [2018-04-11 15:11:28,917 WARN L1033 $PredicateComparison]: unable to prove that (exists ((|main_#t~malloc12.base| Int)) (let ((.cse0 (store |c_old(#valid)| |main_#t~malloc12.base| 1))) (and (= (select .cse0 |c_main_#t~malloc13.base|) 0) (= |c_#valid| (store (store .cse0 |c_main_#t~malloc13.base| 1) |main_#t~malloc12.base| 0)) (= 0 (select |c_old(#valid)| |main_#t~malloc12.base|))))) is different from true [2018-04-11 15:11:28,923 WARN L1033 $PredicateComparison]: unable to prove that (exists ((|main_#t~malloc13.base| Int) (|main_#t~malloc12.base| Int)) (let ((.cse0 (store |c_old(#valid)| |main_#t~malloc12.base| 1))) (and (= (select .cse0 |main_#t~malloc13.base|) 0) (= |c_#valid| (store (store (store .cse0 |main_#t~malloc13.base| 1) |main_#t~malloc12.base| 0) |main_#t~malloc13.base| 0)) (= 0 (select |c_old(#valid)| |main_#t~malloc12.base|))))) is different from true [2018-04-11 15:11:28,929 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-11 15:11:28,929 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-04-11 15:11:28,929 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-04-11 15:11:28,930 INFO L442 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-04-11 15:11:28,930 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-04-11 15:11:28,930 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=22, Unknown=2, NotChecked=18, Total=56 [2018-04-11 15:11:28,930 INFO L87 Difference]: Start difference. First operand 58 states and 66 transitions. Second operand 8 states. [2018-04-11 15:11:28,997 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-11 15:11:28,997 INFO L93 Difference]: Finished difference Result 57 states and 65 transitions. [2018-04-11 15:11:28,997 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-04-11 15:11:28,997 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 28 [2018-04-11 15:11:28,997 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-11 15:11:28,998 INFO L225 Difference]: With dead ends: 57 [2018-04-11 15:11:28,998 INFO L226 Difference]: Without dead ends: 48 [2018-04-11 15:11:28,998 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 20 SyntacticMatches, 1 SemanticMatches, 7 ConstructedPredicates, 2 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=30, Unknown=2, NotChecked=22, Total=72 [2018-04-11 15:11:28,998 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 48 states. [2018-04-11 15:11:28,999 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 48 to 48. [2018-04-11 15:11:28,999 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 48 states. [2018-04-11 15:11:28,999 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 48 states to 48 states and 54 transitions. [2018-04-11 15:11:28,999 INFO L78 Accepts]: Start accepts. Automaton has 48 states and 54 transitions. Word has length 28 [2018-04-11 15:11:29,000 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-11 15:11:29,000 INFO L459 AbstractCegarLoop]: Abstraction has 48 states and 54 transitions. [2018-04-11 15:11:29,000 INFO L460 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-04-11 15:11:29,000 INFO L276 IsEmpty]: Start isEmpty. Operand 48 states and 54 transitions. [2018-04-11 15:11:29,000 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2018-04-11 15:11:29,000 INFO L347 BasicCegarLoop]: Found error trace [2018-04-11 15:11:29,000 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-11 15:11:29,000 INFO L408 AbstractCegarLoop]: === Iteration 11 === [mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr4EnsuresViolationMEMORY_LEAK, mainErr0RequiresViolation, cstrspnErr7RequiresViolation, cstrspnErr5RequiresViolation, cstrspnErr1RequiresViolation, cstrspnErr0RequiresViolation, cstrspnErr6RequiresViolation, cstrspnErr8RequiresViolation, cstrspnErr2RequiresViolation, cstrspnErr4RequiresViolation, cstrspnErr3RequiresViolation, cstrspnErr9RequiresViolation]=== [2018-04-11 15:11:29,000 INFO L82 PathProgramCache]: Analyzing trace with hash 55851358, now seen corresponding path program 1 times [2018-04-11 15:11:29,000 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-04-11 15:11:29,000 INFO L68 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-04-11 15:11:29,001 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 15:11:29,001 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-11 15:11:29,001 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 15:11:29,006 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-11 15:11:29,007 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-11 15:11:29,020 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-11 15:11:29,020 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-04-11 15:11:29,020 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-04-11 15:11:29,020 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-04-11 15:11:29,020 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-04-11 15:11:29,021 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-04-11 15:11:29,021 INFO L87 Difference]: Start difference. First operand 48 states and 54 transitions. Second operand 3 states. [2018-04-11 15:11:29,024 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-11 15:11:29,024 INFO L93 Difference]: Finished difference Result 50 states and 56 transitions. [2018-04-11 15:11:29,025 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-04-11 15:11:29,025 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 28 [2018-04-11 15:11:29,025 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-11 15:11:29,025 INFO L225 Difference]: With dead ends: 50 [2018-04-11 15:11:29,025 INFO L226 Difference]: Without dead ends: 50 [2018-04-11 15:11:29,025 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-11 15:11:29,026 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 50 states. [2018-04-11 15:11:29,026 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 50 to 50. [2018-04-11 15:11:29,027 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 50 states. [2018-04-11 15:11:29,027 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 50 states to 50 states and 56 transitions. [2018-04-11 15:11:29,027 INFO L78 Accepts]: Start accepts. Automaton has 50 states and 56 transitions. Word has length 28 [2018-04-11 15:11:29,027 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-11 15:11:29,027 INFO L459 AbstractCegarLoop]: Abstraction has 50 states and 56 transitions. [2018-04-11 15:11:29,027 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-04-11 15:11:29,027 INFO L276 IsEmpty]: Start isEmpty. Operand 50 states and 56 transitions. [2018-04-11 15:11:29,028 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2018-04-11 15:11:29,028 INFO L347 BasicCegarLoop]: Found error trace [2018-04-11 15:11:29,028 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-11 15:11:29,028 INFO L408 AbstractCegarLoop]: === Iteration 12 === [mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr4EnsuresViolationMEMORY_LEAK, mainErr0RequiresViolation, cstrspnErr7RequiresViolation, cstrspnErr5RequiresViolation, cstrspnErr1RequiresViolation, cstrspnErr0RequiresViolation, cstrspnErr6RequiresViolation, cstrspnErr8RequiresViolation, cstrspnErr2RequiresViolation, cstrspnErr4RequiresViolation, cstrspnErr3RequiresViolation, cstrspnErr9RequiresViolation]=== [2018-04-11 15:11:29,028 INFO L82 PathProgramCache]: Analyzing trace with hash 1951988481, now seen corresponding path program 1 times [2018-04-11 15:11:29,028 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-04-11 15:11:29,028 INFO L68 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-04-11 15:11:29,028 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 15:11:29,028 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-11 15:11:29,029 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 15:11:29,038 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-11 15:11:29,038 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-11 15:11:29,047 INFO L431 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown lemma type! [2018-04-11 15:11:29,047 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-04-11 15:11:29,047 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-04-11 15:11:29,047 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-11 15:11:29,080 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-11 15:11:29,084 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-11 15:11:29,142 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 11 [2018-04-11 15:11:29,144 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 10 [2018-04-11 15:11:29,144 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 15:11:29,146 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 15:11:29,156 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-11 15:11:29,156 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:32, output treesize:28 [2018-04-11 15:11:29,193 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 25 treesize of output 37 [2018-04-11 15:11:29,197 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 25 [2018-04-11 15:11:29,197 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 15:11:29,208 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 15:11:29,217 INFO L267 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-2 vars, End of recursive call: 4 dim-0 vars, and 1 xjuncts. [2018-04-11 15:11:29,217 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 5 variables, input treesize:47, output treesize:43 [2018-04-11 15:11:29,263 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 14 [2018-04-11 15:11:29,264 INFO L682 Elim1Store]: detected equality via solver [2018-04-11 15:11:29,265 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 14 treesize of output 10 [2018-04-11 15:11:29,265 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 15:11:29,268 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 15:11:29,274 INFO L267 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-04-11 15:11:29,275 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 5 variables, input treesize:35, output treesize:3 [2018-04-11 15:11:29,283 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2018-04-11 15:11:29,283 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-04-11 15:11:29,284 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2018-04-11 15:11:29,284 INFO L442 AbstractCegarLoop]: Interpolant automaton has 13 states [2018-04-11 15:11:29,284 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2018-04-11 15:11:29,284 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=121, Unknown=0, NotChecked=0, Total=156 [2018-04-11 15:11:29,284 INFO L87 Difference]: Start difference. First operand 50 states and 56 transitions. Second operand 13 states. [2018-04-11 15:11:29,427 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-11 15:11:29,427 INFO L93 Difference]: Finished difference Result 69 states and 75 transitions. [2018-04-11 15:11:29,428 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-04-11 15:11:29,428 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 30 [2018-04-11 15:11:29,428 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-11 15:11:29,428 INFO L225 Difference]: With dead ends: 69 [2018-04-11 15:11:29,428 INFO L226 Difference]: Without dead ends: 58 [2018-04-11 15:11:29,428 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 35 GetRequests, 18 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 46 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=82, Invalid=260, Unknown=0, NotChecked=0, Total=342 [2018-04-11 15:11:29,429 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 58 states. [2018-04-11 15:11:29,429 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 58 to 51. [2018-04-11 15:11:29,430 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 51 states. [2018-04-11 15:11:29,430 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 51 states to 51 states and 57 transitions. [2018-04-11 15:11:29,430 INFO L78 Accepts]: Start accepts. Automaton has 51 states and 57 transitions. Word has length 30 [2018-04-11 15:11:29,430 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-11 15:11:29,430 INFO L459 AbstractCegarLoop]: Abstraction has 51 states and 57 transitions. [2018-04-11 15:11:29,430 INFO L460 AbstractCegarLoop]: Interpolant automaton has 13 states. [2018-04-11 15:11:29,430 INFO L276 IsEmpty]: Start isEmpty. Operand 51 states and 57 transitions. [2018-04-11 15:11:29,431 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2018-04-11 15:11:29,431 INFO L347 BasicCegarLoop]: Found error trace [2018-04-11 15:11:29,431 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-11 15:11:29,431 INFO L408 AbstractCegarLoop]: === Iteration 13 === [mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr4EnsuresViolationMEMORY_LEAK, mainErr0RequiresViolation, cstrspnErr7RequiresViolation, cstrspnErr5RequiresViolation, cstrspnErr1RequiresViolation, cstrspnErr0RequiresViolation, cstrspnErr6RequiresViolation, cstrspnErr8RequiresViolation, cstrspnErr2RequiresViolation, cstrspnErr4RequiresViolation, cstrspnErr3RequiresViolation, cstrspnErr9RequiresViolation]=== [2018-04-11 15:11:29,431 INFO L82 PathProgramCache]: Analyzing trace with hash 146550147, now seen corresponding path program 1 times [2018-04-11 15:11:29,431 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-04-11 15:11:29,431 INFO L68 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-04-11 15:11:29,432 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 15:11:29,432 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-11 15:11:29,432 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 15:11:29,443 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-11 15:11:29,444 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-11 15:11:29,592 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-11 15:11:29,592 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-04-11 15:11:29,592 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-04-11 15:11:29,592 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-11 15:11:29,632 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-11 15:11:29,638 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-11 15:11:29,654 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-11 15:11:29,654 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-11 15:11:29,661 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 15:11:29,661 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:13, output treesize:12 [2018-04-11 15:11:29,696 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 15:11:29,697 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 15:11:29,697 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-11 15:11:29,698 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-11 15:11:29,702 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 15:11:29,702 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:17, output treesize:11 [2018-04-11 15:11:29,739 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 14 treesize of output 11 [2018-04-11 15:11:29,743 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 10 [2018-04-11 15:11:29,743 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 15:11:29,744 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 15:11:29,750 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-11 15:11:29,750 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:30, output treesize:26 [2018-04-11 15:11:29,789 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 25 treesize of output 26 [2018-04-11 15:11:29,792 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 10 [2018-04-11 15:11:29,792 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 15:11:29,797 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 15:11:29,806 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-11 15:11:29,806 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:40, output treesize:36 [2018-04-11 15:11:29,923 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 28 treesize of output 26 [2018-04-11 15:11:29,925 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 1 [2018-04-11 15:11:29,925 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 15:11:29,929 INFO L682 Elim1Store]: detected equality via solver [2018-04-11 15:11:29,929 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 14 treesize of output 10 [2018-04-11 15:11:29,930 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-04-11 15:11:29,931 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 15:11:29,936 INFO L267 ElimStorePlain]: Start of recursive call 1: 6 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-04-11 15:11:29,936 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 7 variables, input treesize:49, output treesize:3 [2018-04-11 15:11:29,950 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2018-04-11 15:11:29,950 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-04-11 15:11:29,951 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [12] imperfect sequences [12] total 23 [2018-04-11 15:11:29,951 INFO L442 AbstractCegarLoop]: Interpolant automaton has 23 states [2018-04-11 15:11:29,951 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2018-04-11 15:11:29,951 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=53, Invalid=453, Unknown=0, NotChecked=0, Total=506 [2018-04-11 15:11:29,952 INFO L87 Difference]: Start difference. First operand 51 states and 57 transitions. Second operand 23 states. [2018-04-11 15:11:30,603 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-11 15:11:30,603 INFO L93 Difference]: Finished difference Result 90 states and 97 transitions. [2018-04-11 15:11:30,604 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2018-04-11 15:11:30,604 INFO L78 Accepts]: Start accepts. Automaton has 23 states. Word has length 30 [2018-04-11 15:11:30,604 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-11 15:11:30,605 INFO L225 Difference]: With dead ends: 90 [2018-04-11 15:11:30,605 INFO L226 Difference]: Without dead ends: 78 [2018-04-11 15:11:30,606 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 60 GetRequests, 21 SyntacticMatches, 0 SemanticMatches, 39 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 281 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=215, Invalid=1425, Unknown=0, NotChecked=0, Total=1640 [2018-04-11 15:11:30,606 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 78 states. [2018-04-11 15:11:30,608 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 78 to 57. [2018-04-11 15:11:30,609 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 57 states. [2018-04-11 15:11:30,609 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 57 states to 57 states and 64 transitions. [2018-04-11 15:11:30,609 INFO L78 Accepts]: Start accepts. Automaton has 57 states and 64 transitions. Word has length 30 [2018-04-11 15:11:30,609 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-11 15:11:30,609 INFO L459 AbstractCegarLoop]: Abstraction has 57 states and 64 transitions. [2018-04-11 15:11:30,610 INFO L460 AbstractCegarLoop]: Interpolant automaton has 23 states. [2018-04-11 15:11:30,610 INFO L276 IsEmpty]: Start isEmpty. Operand 57 states and 64 transitions. [2018-04-11 15:11:30,610 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2018-04-11 15:11:30,610 INFO L347 BasicCegarLoop]: Found error trace [2018-04-11 15:11:30,610 INFO L355 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-11 15:11:30,610 INFO L408 AbstractCegarLoop]: === Iteration 14 === [mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr4EnsuresViolationMEMORY_LEAK, mainErr0RequiresViolation, cstrspnErr7RequiresViolation, cstrspnErr5RequiresViolation, cstrspnErr1RequiresViolation, cstrspnErr0RequiresViolation, cstrspnErr6RequiresViolation, cstrspnErr8RequiresViolation, cstrspnErr2RequiresViolation, cstrspnErr4RequiresViolation, cstrspnErr3RequiresViolation, cstrspnErr9RequiresViolation]=== [2018-04-11 15:11:30,611 INFO L82 PathProgramCache]: Analyzing trace with hash 1821776862, now seen corresponding path program 1 times [2018-04-11 15:11:30,611 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-04-11 15:11:30,611 INFO L68 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-04-11 15:11:30,611 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 15:11:30,612 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-11 15:11:30,612 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 15:11:30,618 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-11 15:11:30,619 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-11 15:11:30,678 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-11 15:11:30,678 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-04-11 15:11:30,678 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2018-04-11 15:11:30,679 INFO L442 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-04-11 15:11:30,679 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-04-11 15:11:30,679 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=71, Unknown=0, NotChecked=0, Total=90 [2018-04-11 15:11:30,679 INFO L87 Difference]: Start difference. First operand 57 states and 64 transitions. Second operand 10 states. [2018-04-11 15:11:30,822 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-11 15:11:30,822 INFO L93 Difference]: Finished difference Result 62 states and 68 transitions. [2018-04-11 15:11:30,823 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2018-04-11 15:11:30,823 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 31 [2018-04-11 15:11:30,823 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-11 15:11:30,823 INFO L225 Difference]: With dead ends: 62 [2018-04-11 15:11:30,823 INFO L226 Difference]: Without dead ends: 59 [2018-04-11 15:11:30,824 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 35 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=79, Invalid=263, Unknown=0, NotChecked=0, Total=342 [2018-04-11 15:11:30,824 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 59 states. [2018-04-11 15:11:30,825 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 59 to 57. [2018-04-11 15:11:30,825 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 57 states. [2018-04-11 15:11:30,825 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 57 states to 57 states and 62 transitions. [2018-04-11 15:11:30,826 INFO L78 Accepts]: Start accepts. Automaton has 57 states and 62 transitions. Word has length 31 [2018-04-11 15:11:30,826 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-11 15:11:30,826 INFO L459 AbstractCegarLoop]: Abstraction has 57 states and 62 transitions. [2018-04-11 15:11:30,826 INFO L460 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-04-11 15:11:30,826 INFO L276 IsEmpty]: Start isEmpty. Operand 57 states and 62 transitions. [2018-04-11 15:11:30,827 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2018-04-11 15:11:30,827 INFO L347 BasicCegarLoop]: Found error trace [2018-04-11 15:11:30,827 INFO L355 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-11 15:11:30,827 INFO L408 AbstractCegarLoop]: === Iteration 15 === [mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr4EnsuresViolationMEMORY_LEAK, mainErr0RequiresViolation, cstrspnErr7RequiresViolation, cstrspnErr5RequiresViolation, cstrspnErr1RequiresViolation, cstrspnErr0RequiresViolation, cstrspnErr6RequiresViolation, cstrspnErr8RequiresViolation, cstrspnErr2RequiresViolation, cstrspnErr4RequiresViolation, cstrspnErr3RequiresViolation, cstrspnErr9RequiresViolation]=== [2018-04-11 15:11:30,827 INFO L82 PathProgramCache]: Analyzing trace with hash -279356709, now seen corresponding path program 1 times [2018-04-11 15:11:30,827 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-04-11 15:11:30,827 INFO L68 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-04-11 15:11:30,828 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 15:11:30,828 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-11 15:11:30,828 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 15:11:30,837 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-11 15:11:30,838 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-11 15:11:30,845 INFO L431 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown lemma type! [2018-04-11 15:11:30,845 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-04-11 15:11:30,845 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-04-11 15:11:30,846 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-11 15:11:30,864 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-11 15:11:30,867 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-11 15:11:30,893 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 11 [2018-04-11 15:11:30,895 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 10 [2018-04-11 15:11:30,895 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 15:11:30,896 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 15:11:30,902 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-11 15:11:30,902 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:26, output treesize:22 [2018-04-11 15:11:31,120 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-11 15:11:31,121 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-04-11 15:11:31,121 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2018-04-11 15:11:31,121 INFO L442 AbstractCegarLoop]: Interpolant automaton has 13 states [2018-04-11 15:11:31,121 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2018-04-11 15:11:31,121 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=125, Unknown=0, NotChecked=0, Total=156 [2018-04-11 15:11:31,121 INFO L87 Difference]: Start difference. First operand 57 states and 62 transitions. Second operand 13 states. [2018-04-11 15:11:31,367 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-11 15:11:31,367 INFO L93 Difference]: Finished difference Result 74 states and 78 transitions. [2018-04-11 15:11:31,367 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2018-04-11 15:11:31,367 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 33 [2018-04-11 15:11:31,367 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-11 15:11:31,367 INFO L225 Difference]: With dead ends: 74 [2018-04-11 15:11:31,367 INFO L226 Difference]: Without dead ends: 57 [2018-04-11 15:11:31,368 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 40 GetRequests, 21 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 59 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=91, Invalid=329, Unknown=0, NotChecked=0, Total=420 [2018-04-11 15:11:31,368 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 57 states. [2018-04-11 15:11:31,369 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 57 to 57. [2018-04-11 15:11:31,369 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 57 states. [2018-04-11 15:11:31,370 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 57 states to 57 states and 61 transitions. [2018-04-11 15:11:31,370 INFO L78 Accepts]: Start accepts. Automaton has 57 states and 61 transitions. Word has length 33 [2018-04-11 15:11:31,370 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-11 15:11:31,370 INFO L459 AbstractCegarLoop]: Abstraction has 57 states and 61 transitions. [2018-04-11 15:11:31,370 INFO L460 AbstractCegarLoop]: Interpolant automaton has 13 states. [2018-04-11 15:11:31,370 INFO L276 IsEmpty]: Start isEmpty. Operand 57 states and 61 transitions. [2018-04-11 15:11:31,371 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2018-04-11 15:11:31,371 INFO L347 BasicCegarLoop]: Found error trace [2018-04-11 15:11:31,371 INFO L355 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-11 15:11:31,371 INFO L408 AbstractCegarLoop]: === Iteration 16 === [mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr4EnsuresViolationMEMORY_LEAK, mainErr0RequiresViolation, cstrspnErr7RequiresViolation, cstrspnErr5RequiresViolation, cstrspnErr1RequiresViolation, cstrspnErr0RequiresViolation, cstrspnErr6RequiresViolation, cstrspnErr8RequiresViolation, cstrspnErr2RequiresViolation, cstrspnErr4RequiresViolation, cstrspnErr3RequiresViolation, cstrspnErr9RequiresViolation]=== [2018-04-11 15:11:31,371 INFO L82 PathProgramCache]: Analyzing trace with hash -217317095, now seen corresponding path program 1 times [2018-04-11 15:11:31,372 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-04-11 15:11:31,372 INFO L68 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-04-11 15:11:31,372 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 15:11:31,372 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-11 15:11:31,372 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 15:11:31,382 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-11 15:11:31,383 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-11 15:11:31,393 INFO L431 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown lemma type! [2018-04-11 15:11:31,394 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-04-11 15:11:31,394 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-04-11 15:11:31,394 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-11 15:11:31,414 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-11 15:11:31,417 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-11 15:11:31,428 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-11 15:11:31,428 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-11 15:11:31,434 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-11 15:11:31,434 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 15:11:31,438 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 15:11:31,438 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:16, output treesize:14 [2018-04-11 15:11:31,454 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 15:11:31,455 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 15:11:31,456 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-11 15:11:31,456 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-11 15:11:31,464 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 15 [2018-04-11 15:11:31,464 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 15:11:31,470 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 15:11:31,470 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:25, output treesize:18 [2018-04-11 15:11:31,492 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 13 [2018-04-11 15:11:31,498 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 12 [2018-04-11 15:11:31,498 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 15:11:31,501 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 15:11:31,506 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-04-11 15:11:31,506 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:39, output treesize:32 [2018-04-11 15:11:31,518 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 30 [2018-04-11 15:11:31,519 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 12 [2018-04-11 15:11:31,519 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 15:11:31,522 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 15:11:31,528 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-11 15:11:31,528 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:43, output treesize:39 [2018-04-11 15:11:33,690 WARN L148 SmtUtils]: Spent 2022ms on a formula simplification that was a NOOP. DAG size: 36 [2018-04-11 15:11:33,724 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 40 [2018-04-11 15:11:33,726 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 22 treesize of output 14 [2018-04-11 15:11:33,726 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 15:11:33,744 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 1 case distinctions, treesize of input 15 treesize of output 16 [2018-04-11 15:11:33,745 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 2 xjuncts. [2018-04-11 15:11:33,752 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-04-11 15:11:33,765 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-2 vars, End of recursive call: and 2 xjuncts. [2018-04-11 15:11:33,765 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 4 variables, input treesize:58, output treesize:38 [2018-04-11 15:11:33,878 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-11 15:11:33,879 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-04-11 15:11:33,879 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [18] total 18 [2018-04-11 15:11:33,879 INFO L442 AbstractCegarLoop]: Interpolant automaton has 19 states [2018-04-11 15:11:33,879 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2018-04-11 15:11:33,880 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=43, Invalid=299, Unknown=0, NotChecked=0, Total=342 [2018-04-11 15:11:33,880 INFO L87 Difference]: Start difference. First operand 57 states and 61 transitions. Second operand 19 states. [2018-04-11 15:11:38,268 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-11 15:11:38,268 INFO L93 Difference]: Finished difference Result 124 states and 135 transitions. [2018-04-11 15:11:38,268 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2018-04-11 15:11:38,268 INFO L78 Accepts]: Start accepts. Automaton has 19 states. Word has length 33 [2018-04-11 15:11:38,269 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-11 15:11:38,269 INFO L225 Difference]: With dead ends: 124 [2018-04-11 15:11:38,269 INFO L226 Difference]: Without dead ends: 124 [2018-04-11 15:11:38,270 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 48 GetRequests, 14 SyntacticMatches, 1 SemanticMatches, 33 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 138 ImplicationChecksByTransitivity, 2.8s TimeCoverageRelationStatistics Valid=184, Invalid=1006, Unknown=0, NotChecked=0, Total=1190 [2018-04-11 15:11:38,270 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 124 states. [2018-04-11 15:11:38,272 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 124 to 87. [2018-04-11 15:11:38,272 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 87 states. [2018-04-11 15:11:38,272 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 87 states to 87 states and 98 transitions. [2018-04-11 15:11:38,272 INFO L78 Accepts]: Start accepts. Automaton has 87 states and 98 transitions. Word has length 33 [2018-04-11 15:11:38,273 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-11 15:11:38,273 INFO L459 AbstractCegarLoop]: Abstraction has 87 states and 98 transitions. [2018-04-11 15:11:38,273 INFO L460 AbstractCegarLoop]: Interpolant automaton has 19 states. [2018-04-11 15:11:38,273 INFO L276 IsEmpty]: Start isEmpty. Operand 87 states and 98 transitions. [2018-04-11 15:11:38,273 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2018-04-11 15:11:38,273 INFO L347 BasicCegarLoop]: Found error trace [2018-04-11 15:11:38,273 INFO L355 BasicCegarLoop]: trace histogram [3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-11 15:11:38,273 INFO L408 AbstractCegarLoop]: === Iteration 17 === [mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr4EnsuresViolationMEMORY_LEAK, mainErr0RequiresViolation, cstrspnErr7RequiresViolation, cstrspnErr5RequiresViolation, cstrspnErr1RequiresViolation, cstrspnErr0RequiresViolation, cstrspnErr6RequiresViolation, cstrspnErr8RequiresViolation, cstrspnErr2RequiresViolation, cstrspnErr4RequiresViolation, cstrspnErr3RequiresViolation, cstrspnErr9RequiresViolation]=== [2018-04-11 15:11:38,273 INFO L82 PathProgramCache]: Analyzing trace with hash -670234678, now seen corresponding path program 1 times [2018-04-11 15:11:38,273 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-04-11 15:11:38,273 INFO L68 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-04-11 15:11:38,274 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 15:11:38,274 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-11 15:11:38,274 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 15:11:38,283 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-11 15:11:38,284 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-11 15:11:38,523 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 0 proven. 11 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-11 15:11:38,524 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-04-11 15:11:38,524 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-04-11 15:11:38,524 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-11 15:11:38,548 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-11 15:11:38,552 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-11 15:11:38,567 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-11 15:11:38,567 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-11 15:11:38,569 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 15:11:38,569 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2018-04-11 15:11:38,581 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 13 [2018-04-11 15:11:38,582 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 12 [2018-04-11 15:11:38,583 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 15:11:38,584 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 15:11:38,586 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-04-11 15:11:38,586 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:20, output treesize:16 [2018-04-11 15:11:38,660 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 15 [2018-04-11 15:11:38,664 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 1 case distinctions, treesize of input 15 treesize of output 12 [2018-04-11 15:11:38,665 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 2 xjuncts. [2018-04-11 15:11:38,666 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-04-11 15:11:38,671 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 2 xjuncts. [2018-04-11 15:11:38,671 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:32, output treesize:40 [2018-04-11 15:11:38,749 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 0 proven. 11 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-11 15:11:38,749 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-04-11 15:11:38,749 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 13] total 22 [2018-04-11 15:11:38,750 INFO L442 AbstractCegarLoop]: Interpolant automaton has 23 states [2018-04-11 15:11:38,750 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2018-04-11 15:11:38,750 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=56, Invalid=450, Unknown=0, NotChecked=0, Total=506 [2018-04-11 15:11:38,750 INFO L87 Difference]: Start difference. First operand 87 states and 98 transitions. Second operand 23 states. [2018-04-11 15:11:39,186 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-11 15:11:39,186 INFO L93 Difference]: Finished difference Result 140 states and 154 transitions. [2018-04-11 15:11:39,186 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2018-04-11 15:11:39,186 INFO L78 Accepts]: Start accepts. Automaton has 23 states. Word has length 37 [2018-04-11 15:11:39,187 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-11 15:11:39,187 INFO L225 Difference]: With dead ends: 140 [2018-04-11 15:11:39,187 INFO L226 Difference]: Without dead ends: 138 [2018-04-11 15:11:39,188 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 59 GetRequests, 25 SyntacticMatches, 3 SemanticMatches, 31 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 134 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=158, Invalid=898, Unknown=0, NotChecked=0, Total=1056 [2018-04-11 15:11:39,188 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 138 states. [2018-04-11 15:11:39,190 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 138 to 101. [2018-04-11 15:11:39,190 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 101 states. [2018-04-11 15:11:39,191 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 101 states to 101 states and 114 transitions. [2018-04-11 15:11:39,191 INFO L78 Accepts]: Start accepts. Automaton has 101 states and 114 transitions. Word has length 37 [2018-04-11 15:11:39,191 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-11 15:11:39,191 INFO L459 AbstractCegarLoop]: Abstraction has 101 states and 114 transitions. [2018-04-11 15:11:39,191 INFO L460 AbstractCegarLoop]: Interpolant automaton has 23 states. [2018-04-11 15:11:39,191 INFO L276 IsEmpty]: Start isEmpty. Operand 101 states and 114 transitions. [2018-04-11 15:11:39,192 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2018-04-11 15:11:39,192 INFO L347 BasicCegarLoop]: Found error trace [2018-04-11 15:11:39,192 INFO L355 BasicCegarLoop]: trace histogram [4, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-11 15:11:39,192 INFO L408 AbstractCegarLoop]: === Iteration 18 === [mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr4EnsuresViolationMEMORY_LEAK, mainErr0RequiresViolation, cstrspnErr7RequiresViolation, cstrspnErr5RequiresViolation, cstrspnErr1RequiresViolation, cstrspnErr0RequiresViolation, cstrspnErr6RequiresViolation, cstrspnErr8RequiresViolation, cstrspnErr2RequiresViolation, cstrspnErr4RequiresViolation, cstrspnErr3RequiresViolation, cstrspnErr9RequiresViolation]=== [2018-04-11 15:11:39,192 INFO L82 PathProgramCache]: Analyzing trace with hash -1802186975, now seen corresponding path program 2 times [2018-04-11 15:11:39,192 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-04-11 15:11:39,192 INFO L68 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-04-11 15:11:39,192 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 15:11:39,193 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-11 15:11:39,193 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 15:11:39,201 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-11 15:11:39,202 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-11 15:11:39,341 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 0 proven. 20 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2018-04-11 15:11:39,341 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-04-11 15:11:39,341 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-04-11 15:11:39,341 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-04-11 15:11:39,369 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-04-11 15:11:39,369 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-04-11 15:11:39,373 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-11 15:11:39,380 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-11 15:11:39,380 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-11 15:11:39,387 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 15:11:39,387 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2018-04-11 15:11:39,392 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 13 [2018-04-11 15:11:39,393 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 12 [2018-04-11 15:11:39,393 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 15:11:39,394 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 15:11:39,396 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-04-11 15:11:39,396 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:20, output treesize:16 [2018-04-11 15:11:39,457 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 15 [2018-04-11 15:11:39,461 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 1 case distinctions, treesize of input 15 treesize of output 12 [2018-04-11 15:11:39,461 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 2 xjuncts. [2018-04-11 15:11:39,463 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-04-11 15:11:39,467 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 2 xjuncts. [2018-04-11 15:11:39,467 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:29, output treesize:34 [2018-04-11 15:11:39,540 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 0 proven. 27 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-11 15:11:39,541 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-04-11 15:11:39,541 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 13] total 21 [2018-04-11 15:11:39,541 INFO L442 AbstractCegarLoop]: Interpolant automaton has 22 states [2018-04-11 15:11:39,541 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2018-04-11 15:11:39,541 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=65, Invalid=397, Unknown=0, NotChecked=0, Total=462 [2018-04-11 15:11:39,541 INFO L87 Difference]: Start difference. First operand 101 states and 114 transitions. Second operand 22 states. [2018-04-11 15:11:40,243 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-11 15:11:40,243 INFO L93 Difference]: Finished difference Result 164 states and 176 transitions. [2018-04-11 15:11:40,243 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2018-04-11 15:11:40,243 INFO L78 Accepts]: Start accepts. Automaton has 22 states. Word has length 44 [2018-04-11 15:11:40,244 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-11 15:11:40,244 INFO L225 Difference]: With dead ends: 164 [2018-04-11 15:11:40,244 INFO L226 Difference]: Without dead ends: 160 [2018-04-11 15:11:40,244 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 80 GetRequests, 33 SyntacticMatches, 4 SemanticMatches, 43 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 362 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=389, Invalid=1591, Unknown=0, NotChecked=0, Total=1980 [2018-04-11 15:11:40,245 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 160 states. [2018-04-11 15:11:40,246 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 160 to 52. [2018-04-11 15:11:40,246 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 52 states. [2018-04-11 15:11:40,246 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 52 states to 52 states and 54 transitions. [2018-04-11 15:11:40,246 INFO L78 Accepts]: Start accepts. Automaton has 52 states and 54 transitions. Word has length 44 [2018-04-11 15:11:40,246 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-11 15:11:40,247 INFO L459 AbstractCegarLoop]: Abstraction has 52 states and 54 transitions. [2018-04-11 15:11:40,247 INFO L460 AbstractCegarLoop]: Interpolant automaton has 22 states. [2018-04-11 15:11:40,247 INFO L276 IsEmpty]: Start isEmpty. Operand 52 states and 54 transitions. [2018-04-11 15:11:40,247 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2018-04-11 15:11:40,247 INFO L347 BasicCegarLoop]: Found error trace [2018-04-11 15:11:40,248 INFO L355 BasicCegarLoop]: trace histogram [3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-11 15:11:40,248 INFO L408 AbstractCegarLoop]: === Iteration 19 === [mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr4EnsuresViolationMEMORY_LEAK, mainErr0RequiresViolation, cstrspnErr7RequiresViolation, cstrspnErr5RequiresViolation, cstrspnErr1RequiresViolation, cstrspnErr0RequiresViolation, cstrspnErr6RequiresViolation, cstrspnErr8RequiresViolation, cstrspnErr2RequiresViolation, cstrspnErr4RequiresViolation, cstrspnErr3RequiresViolation, cstrspnErr9RequiresViolation]=== [2018-04-11 15:11:40,248 INFO L82 PathProgramCache]: Analyzing trace with hash 606683470, now seen corresponding path program 2 times [2018-04-11 15:11:40,248 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-04-11 15:11:40,248 INFO L68 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-04-11 15:11:40,248 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 15:11:40,249 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-04-11 15:11:40,249 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 15:11:40,260 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-11 15:11:40,261 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-11 15:11:40,268 INFO L431 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown lemma type! [2018-04-11 15:11:40,268 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-04-11 15:11:40,268 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-04-11 15:11:40,269 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-04-11 15:11:40,293 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-04-11 15:11:40,294 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-04-11 15:11:40,297 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-11 15:11:40,307 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-11 15:11:40,307 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-11 15:11:40,316 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-11 15:11:40,316 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 15:11:40,322 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 15:11:40,322 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:19, output treesize:17 [2018-04-11 15:11:40,340 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 15:11:40,341 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 15 [2018-04-11 15:11:40,342 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-11 15:11:40,354 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 15:11:40,354 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 15:11:40,355 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-11 15:11:40,355 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 15:11:40,361 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 15:11:40,361 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:28, output treesize:21 [2018-04-11 15:11:40,388 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 16 treesize of output 13 [2018-04-11 15:11:40,390 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 12 [2018-04-11 15:11:40,390 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 15:11:40,392 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 15:11:40,399 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-04-11 15:11:40,400 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:34, output treesize:30 [2018-04-11 15:11:40,414 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 30 [2018-04-11 15:11:40,416 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 12 [2018-04-11 15:11:40,416 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 15:11:40,420 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 15:11:40,426 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-11 15:11:40,426 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:41, output treesize:37 [2018-04-11 15:11:43,297 WARN L148 SmtUtils]: Spent 2027ms on a formula simplification that was a NOOP. DAG size: 38 [2018-04-11 15:11:43,328 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 40 [2018-04-11 15:11:43,330 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 22 treesize of output 14 [2018-04-11 15:11:43,330 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 15:11:43,338 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 1 case distinctions, treesize of input 15 treesize of output 12 [2018-04-11 15:11:43,339 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 2 xjuncts. [2018-04-11 15:11:43,343 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-04-11 15:11:43,357 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-2 vars, End of recursive call: and 2 xjuncts. [2018-04-11 15:11:43,358 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 4 variables, input treesize:63, output treesize:48 [2018-04-11 15:11:43,429 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 0 proven. 19 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-11 15:11:43,429 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-04-11 15:11:43,429 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [22] total 22 [2018-04-11 15:11:43,429 INFO L442 AbstractCegarLoop]: Interpolant automaton has 23 states [2018-04-11 15:11:43,430 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2018-04-11 15:11:43,430 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=56, Invalid=449, Unknown=1, NotChecked=0, Total=506 [2018-04-11 15:11:43,430 INFO L87 Difference]: Start difference. First operand 52 states and 54 transitions. Second operand 23 states. [2018-04-11 15:11:48,238 WARN L151 SmtUtils]: Spent 4100ms on a formula simplification. DAG size of input: 68 DAG size of output 68 [2018-04-11 15:11:48,677 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-11 15:11:48,677 INFO L93 Difference]: Finished difference Result 78 states and 82 transitions. [2018-04-11 15:11:48,677 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2018-04-11 15:11:48,677 INFO L78 Accepts]: Start accepts. Automaton has 23 states. Word has length 48 [2018-04-11 15:11:48,677 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-11 15:11:48,678 INFO L225 Difference]: With dead ends: 78 [2018-04-11 15:11:48,678 INFO L226 Difference]: Without dead ends: 78 [2018-04-11 15:11:48,678 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 67 GetRequests, 26 SyntacticMatches, 0 SemanticMatches, 41 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 375 ImplicationChecksByTransitivity, 7.7s TimeCoverageRelationStatistics Valid=252, Invalid=1553, Unknown=1, NotChecked=0, Total=1806 [2018-04-11 15:11:48,678 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 78 states. [2018-04-11 15:11:48,679 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 78 to 67. [2018-04-11 15:11:48,679 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 67 states. [2018-04-11 15:11:48,680 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 67 states to 67 states and 70 transitions. [2018-04-11 15:11:48,680 INFO L78 Accepts]: Start accepts. Automaton has 67 states and 70 transitions. Word has length 48 [2018-04-11 15:11:48,680 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-11 15:11:48,680 INFO L459 AbstractCegarLoop]: Abstraction has 67 states and 70 transitions. [2018-04-11 15:11:48,680 INFO L460 AbstractCegarLoop]: Interpolant automaton has 23 states. [2018-04-11 15:11:48,680 INFO L276 IsEmpty]: Start isEmpty. Operand 67 states and 70 transitions. [2018-04-11 15:11:48,680 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2018-04-11 15:11:48,680 INFO L347 BasicCegarLoop]: Found error trace [2018-04-11 15:11:48,680 INFO L355 BasicCegarLoop]: trace histogram [4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-11 15:11:48,681 INFO L408 AbstractCegarLoop]: === Iteration 20 === [mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr4EnsuresViolationMEMORY_LEAK, mainErr0RequiresViolation, cstrspnErr7RequiresViolation, cstrspnErr5RequiresViolation, cstrspnErr1RequiresViolation, cstrspnErr0RequiresViolation, cstrspnErr6RequiresViolation, cstrspnErr8RequiresViolation, cstrspnErr2RequiresViolation, cstrspnErr4RequiresViolation, cstrspnErr3RequiresViolation, cstrspnErr9RequiresViolation]=== [2018-04-11 15:11:48,681 INFO L82 PathProgramCache]: Analyzing trace with hash 538374265, now seen corresponding path program 3 times [2018-04-11 15:11:48,681 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-04-11 15:11:48,681 INFO L68 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-04-11 15:11:48,681 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 15:11:48,681 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-04-11 15:11:48,681 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 15:11:48,690 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-11 15:11:48,690 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-11 15:11:48,692 INFO L431 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown lemma type! [2018-04-11 15:11:48,692 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-04-11 15:11:48,692 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-04-11 15:11:48,692 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-04-11 15:11:48,715 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) [2018-04-11 15:11:48,715 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-04-11 15:11:48,718 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-11 15:11:48,723 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-04-11 15:11:48,724 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-11 15:11:48,728 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-04-11 15:11:48,728 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 15:11:48,731 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 15:11:48,731 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:16, output treesize:14 [2018-04-11 15:11:48,741 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 15:11:48,742 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 15 [2018-04-11 15:11:48,743 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-11 15:11:48,753 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 15:11:48,753 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 15:11:48,754 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-11 15:11:48,754 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 15:11:48,758 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 15:11:48,758 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:25, output treesize:18 [2018-04-11 15:11:48,785 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 15 treesize of output 12 [2018-04-11 15:11:48,787 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-11 15:11:48,787 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 15:11:48,789 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 15:11:48,794 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-04-11 15:11:48,794 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:25, output treesize:21 [2018-04-11 15:11:48,810 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 29 [2018-04-11 15:11:48,812 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 12 [2018-04-11 15:11:48,813 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 15:11:48,817 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 15:11:48,822 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-11 15:11:48,823 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:32, output treesize:28 [2018-04-11 15:11:51,101 WARN L148 SmtUtils]: Spent 2024ms on a formula simplification that was a NOOP. DAG size: 40 [2018-04-11 15:11:51,151 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 46 treesize of output 56 [2018-04-11 15:11:51,173 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 3 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 3 case distinctions, treesize of input 40 treesize of output 59 [2018-04-11 15:11:51,173 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 4 xjuncts. [2018-04-11 15:11:51,230 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 40 treesize of output 32 [2018-04-11 15:11:51,231 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-04-11 15:11:51,279 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 1 case distinctions, treesize of input 32 treesize of output 30 [2018-04-11 15:11:51,280 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 2 xjuncts. [2018-04-11 15:11:51,326 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 40 treesize of output 30 [2018-04-11 15:11:51,326 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2018-04-11 15:11:51,386 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 2 case distinctions, treesize of input 30 treesize of output 37 [2018-04-11 15:11:51,387 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 4 xjuncts. [2018-04-11 15:11:51,443 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 1 case distinctions, treesize of input 44 treesize of output 42 [2018-04-11 15:11:51,444 INFO L267 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 2 xjuncts. [2018-04-11 15:11:51,486 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 38 treesize of output 31 [2018-04-11 15:11:51,487 INFO L267 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 1 xjuncts. [2018-04-11 15:11:51,488 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 33 treesize of output 26 [2018-04-11 15:11:51,488 INFO L267 ElimStorePlain]: Start of recursive call 10: End of recursive call: and 1 xjuncts. [2018-04-11 15:11:51,528 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 31 treesize of output 21 [2018-04-11 15:11:51,529 INFO L267 ElimStorePlain]: Start of recursive call 11: End of recursive call: and 1 xjuncts. [2018-04-11 15:11:51,530 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 16 [2018-04-11 15:11:51,530 INFO L267 ElimStorePlain]: Start of recursive call 12: End of recursive call: and 1 xjuncts. [2018-04-11 15:11:51,563 INFO L267 ElimStorePlain]: Start of recursive call 2: 8 dim-1 vars, End of recursive call: and 7 xjuncts. [2018-04-11 15:11:51,600 INFO L267 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-2 vars, End of recursive call: and 3 xjuncts. [2018-04-11 15:11:51,600 INFO L202 ElimStorePlain]: Needed 12 recursive calls to eliminate 5 variables, input treesize:60, output treesize:68 [2018-04-11 15:11:51,673 INFO L134 CoverageAnalysis]: Checked inductivity of 51 backedges. 10 proven. 38 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2018-04-11 15:11:51,673 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-04-11 15:11:51,673 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [19] total 19 [2018-04-11 15:11:51,673 INFO L442 AbstractCegarLoop]: Interpolant automaton has 20 states [2018-04-11 15:11:51,674 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2018-04-11 15:11:51,674 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=52, Invalid=328, Unknown=0, NotChecked=0, Total=380 [2018-04-11 15:11:51,674 INFO L87 Difference]: Start difference. First operand 67 states and 70 transitions. Second operand 20 states. [2018-04-11 15:11:52,959 WARN L151 SmtUtils]: Spent 917ms on a formula simplification. DAG size of input: 59 DAG size of output 57 [2018-04-11 15:11:56,353 WARN L151 SmtUtils]: Spent 110ms on a formula simplification. DAG size of input: 63 DAG size of output 57 [2018-04-11 15:11:58,699 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-11 15:11:58,699 INFO L93 Difference]: Finished difference Result 109 states and 115 transitions. [2018-04-11 15:11:58,699 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 48 states. [2018-04-11 15:11:58,699 INFO L78 Accepts]: Start accepts. Automaton has 20 states. Word has length 63 [2018-04-11 15:11:58,699 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-11 15:11:58,699 INFO L225 Difference]: With dead ends: 109 [2018-04-11 15:11:58,699 INFO L226 Difference]: Without dead ends: 0 [2018-04-11 15:11:58,700 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 106 GetRequests, 44 SyntacticMatches, 0 SemanticMatches, 62 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 888 ImplicationChecksByTransitivity, 8.4s TimeCoverageRelationStatistics Valid=666, Invalid=3365, Unknown=1, NotChecked=0, Total=4032 [2018-04-11 15:11:58,700 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2018-04-11 15:11:58,700 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2018-04-11 15:11:58,700 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2018-04-11 15:11:58,700 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2018-04-11 15:11:58,700 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 63 [2018-04-11 15:11:58,700 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-11 15:11:58,700 INFO L459 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-04-11 15:11:58,700 INFO L460 AbstractCegarLoop]: Interpolant automaton has 20 states. [2018-04-11 15:11:58,701 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2018-04-11 15:11:58,701 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-04-11 15:11:58,703 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 11.04 03:11:58 BoogieIcfgContainer [2018-04-11 15:11:58,703 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-04-11 15:11:58,704 INFO L168 Benchmark]: Toolchain (without parser) took 32128.22 ms. Allocated memory was 403.7 MB in the beginning and 774.4 MB in the end (delta: 370.7 MB). Free memory was 336.0 MB in the beginning and 615.7 MB in the end (delta: -279.7 MB). Peak memory consumption was 91.0 MB. Max. memory is 5.3 GB. [2018-04-11 15:11:58,705 INFO L168 Benchmark]: CDTParser took 0.10 ms. Allocated memory is still 403.7 MB. Free memory is still 361.1 MB. There was no memory consumed. Max. memory is 5.3 GB. [2018-04-11 15:11:58,705 INFO L168 Benchmark]: CACSL2BoogieTranslator took 251.50 ms. Allocated memory is still 403.7 MB. Free memory was 336.0 MB in the beginning and 311.7 MB in the end (delta: 24.3 MB). Peak memory consumption was 24.3 MB. Max. memory is 5.3 GB. [2018-04-11 15:11:58,705 INFO L168 Benchmark]: Boogie Preprocessor took 35.89 ms. Allocated memory is still 403.7 MB. Free memory was 311.7 MB in the beginning and 309.0 MB in the end (delta: 2.6 MB). Peak memory consumption was 2.6 MB. Max. memory is 5.3 GB. [2018-04-11 15:11:58,705 INFO L168 Benchmark]: RCFGBuilder took 366.51 ms. Allocated memory was 403.7 MB in the beginning and 592.4 MB in the end (delta: 188.7 MB). Free memory was 309.0 MB in the beginning and 526.3 MB in the end (delta: -217.3 MB). Peak memory consumption was 24.7 MB. Max. memory is 5.3 GB. [2018-04-11 15:11:58,705 INFO L168 Benchmark]: TraceAbstraction took 31471.20 ms. Allocated memory was 592.4 MB in the beginning and 774.4 MB in the end (delta: 181.9 MB). Free memory was 526.3 MB in the beginning and 615.7 MB in the end (delta: -89.4 MB). Peak memory consumption was 92.5 MB. Max. memory is 5.3 GB. [2018-04-11 15:11:58,706 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.10 ms. Allocated memory is still 403.7 MB. Free memory is still 361.1 MB. There was no memory consumed. Max. memory is 5.3 GB. * CACSL2BoogieTranslator took 251.50 ms. Allocated memory is still 403.7 MB. Free memory was 336.0 MB in the beginning and 311.7 MB in the end (delta: 24.3 MB). Peak memory consumption was 24.3 MB. Max. memory is 5.3 GB. * Boogie Preprocessor took 35.89 ms. Allocated memory is still 403.7 MB. Free memory was 311.7 MB in the beginning and 309.0 MB in the end (delta: 2.6 MB). Peak memory consumption was 2.6 MB. Max. memory is 5.3 GB. * RCFGBuilder took 366.51 ms. Allocated memory was 403.7 MB in the beginning and 592.4 MB in the end (delta: 188.7 MB). Free memory was 309.0 MB in the beginning and 526.3 MB in the end (delta: -217.3 MB). Peak memory consumption was 24.7 MB. Max. memory is 5.3 GB. * TraceAbstraction took 31471.20 ms. Allocated memory was 592.4 MB in the beginning and 774.4 MB in the end (delta: 181.9 MB). Free memory was 526.3 MB in the beginning and 615.7 MB in the end (delta: -89.4 MB). Peak memory consumption was 92.5 MB. Max. memory is 5.3 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 567]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 566]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 567]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 555]: all allocated memory was freed For all program executions holds that all allocated memory was freed at this location - PositiveResult [Line: 566]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 548]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 548]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 545]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 545]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 548]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 550]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 547]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 548]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 547]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 550]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - AllSpecificationsHoldResult: All specifications hold 15 specifications checked. All of them hold - StatisticsResult: Ultimate Automizer benchmark data CFG has 6 procedures, 64 locations, 15 error locations. SAFE Result, 31.4s OverallTime, 20 OverallIterations, 4 TraceHistogramMax, 19.6s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 749 SDtfs, 1806 SDslu, 3215 SDs, 0 SdLazy, 3972 SolverSat, 226 SolverUnsat, 4 SolverUnknown, 0 SolverNotchecked, 6.4s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 627 GetRequests, 257 SyntacticMatches, 10 SemanticMatches, 360 ConstructedPredicates, 2 IntricatePredicates, 0 DeprecatedPredicates, 2349 ImplicationChecksByTransitivity, 21.9s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=101occurred in iteration=17, 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.0s AutomataMinimizationTime, 20 MinimizatonAttempts, 272 StatesRemovedByMinimization, 12 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.4s SatisfiabilityAnalysisTime, 11.0s InterpolantComputationTime, 939 NumberOfCodeBlocks, 939 NumberOfCodeBlocksAsserted, 37 NumberOfCheckSat, 642 ConstructedInterpolants, 122 QuantifiedInterpolants, 349519 SizeOfPredicates, 124 NumberOfNonLiveVariables, 1630 ConjunctsInSsa, 359 ConjunctsInUnsatCore, 23 InterpolantComputations, 15 PerfectInterpolantSequences, 30/160 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be correct! Written .csv to /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/cstrspn-alloca_true-valid-memsafety_true-termination.i_svcomp-DerefFreeMemtrack-32bit-Automizer_SmtInterpol_NoArray.epf_AutomizerC.xml/Csv-Benchmark-0-2018-04-11_15-11-58-713.csv Written .csv to /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/cstrspn-alloca_true-valid-memsafety_true-termination.i_svcomp-DerefFreeMemtrack-32bit-Automizer_SmtInterpol_NoArray.epf_AutomizerC.xml/Csv-TraceAbstractionBenchmarks-0-2018-04-11_15-11-58-713.csv Received shutdown request...