java -Xmx6000000000 -jar ./plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data ./data --generate-csv --csv-dir ../../../releaseScripts/default/UAutomizer-linux/csv --cacsl2boogietranslator.bitprecise.bitfields false -tc ../../../trunk/examples/toolchains/AutomizerC.xml -s ../../../trunk/examples/settings/cade18-smtinterpol/svcomp-DerefFreeMemtrack-32bit-Automizer_Camel.epf -i ../../../trunk/examples/svcomp/forester-heap/dll-sorted_true-unreach-call_true-valid-memsafety.i -------------------------------------------------------------------------------- This is Ultimate 0.1.23-666feb3-m [2018-04-12 01:12:02,272 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-04-12 01:12:02,273 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-04-12 01:12:02,285 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-04-12 01:12:02,286 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-04-12 01:12:02,286 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-04-12 01:12:02,287 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-04-12 01:12:02,289 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-04-12 01:12:02,290 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-04-12 01:12:02,291 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-04-12 01:12:02,291 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-04-12 01:12:02,292 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-04-12 01:12:02,292 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-04-12 01:12:02,293 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-04-12 01:12:02,294 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-04-12 01:12:02,296 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-04-12 01:12:02,297 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-04-12 01:12:02,298 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-04-12 01:12:02,299 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-04-12 01:12:02,300 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-04-12 01:12:02,302 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-04-12 01:12:02,302 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-04-12 01:12:02,302 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-04-12 01:12:02,303 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-04-12 01:12:02,304 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-04-12 01:12:02,305 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-04-12 01:12:02,305 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-04-12 01:12:02,305 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-04-12 01:12:02,306 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-04-12 01:12:02,306 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-04-12 01:12:02,307 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-04-12 01:12:02,307 INFO L98 SettingsManager]: Beginning loading settings from /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/cade18-smtinterpol/svcomp-DerefFreeMemtrack-32bit-Automizer_Camel.epf [2018-04-12 01:12:02,327 INFO L110 SettingsManager]: Loading preferences was successful [2018-04-12 01:12:02,327 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-04-12 01:12:02,328 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-04-12 01:12:02,328 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-04-12 01:12:02,328 INFO L133 SettingsManager]: * Use SBE=true [2018-04-12 01:12:02,328 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-04-12 01:12:02,329 INFO L133 SettingsManager]: * sizeof long=4 [2018-04-12 01:12:02,329 INFO L133 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2018-04-12 01:12:02,329 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-04-12 01:12:02,329 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-04-12 01:12:02,329 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-04-12 01:12:02,329 INFO L133 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2018-04-12 01:12:02,329 INFO L133 SettingsManager]: * Bitprecise bitfields=true [2018-04-12 01:12:02,329 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-04-12 01:12:02,330 INFO L133 SettingsManager]: * sizeof long double=12 [2018-04-12 01:12:02,330 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-04-12 01:12:02,330 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-04-12 01:12:02,330 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-04-12 01:12:02,330 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-04-12 01:12:02,330 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-04-12 01:12:02,330 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-04-12 01:12:02,330 INFO L133 SettingsManager]: * Interpolant automaton=TWOTRACK [2018-04-12 01:12:02,330 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-04-12 01:12:02,331 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Bitprecise bitfields -> false [2018-04-12 01:12:02,356 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-04-12 01:12:02,364 INFO L266 ainManager$Toolchain]: [Toolchain 1]: Parser(s) successfully (re)initialized [2018-04-12 01:12:02,367 INFO L222 ainManager$Toolchain]: [Toolchain 1]: Toolchain data selected. [2018-04-12 01:12:02,368 INFO L271 PluginConnector]: Initializing CDTParser... [2018-04-12 01:12:02,368 INFO L276 PluginConnector]: CDTParser initialized [2018-04-12 01:12:02,369 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/forester-heap/dll-sorted_true-unreach-call_true-valid-memsafety.i [2018-04-12 01:12:02,697 INFO L225 CDTParser]: Created temporary CDT project at /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/data/FLAGfcfb89054 [2018-04-12 01:12:02,826 INFO L287 CDTParser]: IsIndexed: true [2018-04-12 01:12:02,827 INFO L288 CDTParser]: Found 1 translation units. [2018-04-12 01:12:02,827 INFO L168 CDTParser]: Scanning dll-sorted_true-unreach-call_true-valid-memsafety.i [2018-04-12 01:12:02,834 INFO L210 ultiparseSymbolTable]: Include resolver: [2018-04-12 01:12:02,834 INFO L215 ultiparseSymbolTable]: [2018-04-12 01:12:02,834 INFO L218 ultiparseSymbolTable]: Function table: [2018-04-12 01:12:02,834 INFO L221 ultiparseSymbolTable]: Function definition of null ('main') in dll-sorted_true-unreach-call_true-valid-memsafety.i [2018-04-12 01:12:02,835 INFO L227 ultiparseSymbolTable]: Global variable table: [2018-04-12 01:12:02,835 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fdll_sorted_true_unreach_call_true_valid_memsafety_i____time_t in dll-sorted_true-unreach-call_true-valid-memsafety.i [2018-04-12 01:12:02,835 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fdll_sorted_true_unreach_call_true_valid_memsafety_i____timer_t in dll-sorted_true-unreach-call_true-valid-memsafety.i [2018-04-12 01:12:02,835 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fdll_sorted_true_unreach_call_true_valid_memsafety_i____intptr_t in dll-sorted_true-unreach-call_true-valid-memsafety.i [2018-04-12 01:12:02,835 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fdll_sorted_true_unreach_call_true_valid_memsafety_i__pthread_mutexattr_t in dll-sorted_true-unreach-call_true-valid-memsafety.i [2018-04-12 01:12:02,835 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fdll_sorted_true_unreach_call_true_valid_memsafety_i__size_t in dll-sorted_true-unreach-call_true-valid-memsafety.i [2018-04-12 01:12:02,835 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fdll_sorted_true_unreach_call_true_valid_memsafety_i__idtype_t in dll-sorted_true-unreach-call_true-valid-memsafety.i [2018-04-12 01:12:02,835 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fdll_sorted_true_unreach_call_true_valid_memsafety_i____fsfilcnt_t in dll-sorted_true-unreach-call_true-valid-memsafety.i [2018-04-12 01:12:02,835 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fdll_sorted_true_unreach_call_true_valid_memsafety_i__int8_t in dll-sorted_true-unreach-call_true-valid-memsafety.i [2018-04-12 01:12:02,835 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fdll_sorted_true_unreach_call_true_valid_memsafety_i____ssize_t in dll-sorted_true-unreach-call_true-valid-memsafety.i [2018-04-12 01:12:02,835 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fdll_sorted_true_unreach_call_true_valid_memsafety_i__pid_t in dll-sorted_true-unreach-call_true-valid-memsafety.i [2018-04-12 01:12:02,835 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fdll_sorted_true_unreach_call_true_valid_memsafety_i__int32_t in dll-sorted_true-unreach-call_true-valid-memsafety.i [2018-04-12 01:12:02,835 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fdll_sorted_true_unreach_call_true_valid_memsafety_i____socklen_t in dll-sorted_true-unreach-call_true-valid-memsafety.i [2018-04-12 01:12:02,835 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fdll_sorted_true_unreach_call_true_valid_memsafety_i__ino_t in dll-sorted_true-unreach-call_true-valid-memsafety.i [2018-04-12 01:12:02,835 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fdll_sorted_true_unreach_call_true_valid_memsafety_i____u_short in dll-sorted_true-unreach-call_true-valid-memsafety.i [2018-04-12 01:12:02,836 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fdll_sorted_true_unreach_call_true_valid_memsafety_i__key_t in dll-sorted_true-unreach-call_true-valid-memsafety.i [2018-04-12 01:12:02,836 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fdll_sorted_true_unreach_call_true_valid_memsafety_i____blkcnt64_t in dll-sorted_true-unreach-call_true-valid-memsafety.i [2018-04-12 01:12:02,836 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fdll_sorted_true_unreach_call_true_valid_memsafety_i__mode_t in dll-sorted_true-unreach-call_true-valid-memsafety.i [2018-04-12 01:12:02,836 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fdll_sorted_true_unreach_call_true_valid_memsafety_i__ldiv_t in dll-sorted_true-unreach-call_true-valid-memsafety.i [2018-04-12 01:12:02,836 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fdll_sorted_true_unreach_call_true_valid_memsafety_i____fsfilcnt64_t in dll-sorted_true-unreach-call_true-valid-memsafety.i [2018-04-12 01:12:02,836 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fdll_sorted_true_unreach_call_true_valid_memsafety_i__fsfilcnt_t in dll-sorted_true-unreach-call_true-valid-memsafety.i [2018-04-12 01:12:02,836 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fdll_sorted_true_unreach_call_true_valid_memsafety_i__pthread_mutex_t in dll-sorted_true-unreach-call_true-valid-memsafety.i [2018-04-12 01:12:02,836 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fdll_sorted_true_unreach_call_true_valid_memsafety_i____rlim_t in dll-sorted_true-unreach-call_true-valid-memsafety.i [2018-04-12 01:12:02,836 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fdll_sorted_true_unreach_call_true_valid_memsafety_i__time_t in dll-sorted_true-unreach-call_true-valid-memsafety.i [2018-04-12 01:12:02,836 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fdll_sorted_true_unreach_call_true_valid_memsafety_i__div_t in dll-sorted_true-unreach-call_true-valid-memsafety.i [2018-04-12 01:12:02,836 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fdll_sorted_true_unreach_call_true_valid_memsafety_i__off_t in dll-sorted_true-unreach-call_true-valid-memsafety.i [2018-04-12 01:12:02,836 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fdll_sorted_true_unreach_call_true_valid_memsafety_i__gid_t in dll-sorted_true-unreach-call_true-valid-memsafety.i [2018-04-12 01:12:02,836 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fdll_sorted_true_unreach_call_true_valid_memsafety_i__caddr_t in dll-sorted_true-unreach-call_true-valid-memsafety.i [2018-04-12 01:12:02,836 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fdll_sorted_true_unreach_call_true_valid_memsafety_i__u_short in dll-sorted_true-unreach-call_true-valid-memsafety.i [2018-04-12 01:12:02,836 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fdll_sorted_true_unreach_call_true_valid_memsafety_i__pthread_rwlock_t in dll-sorted_true-unreach-call_true-valid-memsafety.i [2018-04-12 01:12:02,836 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fdll_sorted_true_unreach_call_true_valid_memsafety_i____mode_t in dll-sorted_true-unreach-call_true-valid-memsafety.i [2018-04-12 01:12:02,836 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fdll_sorted_true_unreach_call_true_valid_memsafety_i__blksize_t in dll-sorted_true-unreach-call_true-valid-memsafety.i [2018-04-12 01:12:02,837 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fdll_sorted_true_unreach_call_true_valid_memsafety_i__pthread_once_t in dll-sorted_true-unreach-call_true-valid-memsafety.i [2018-04-12 01:12:02,837 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fdll_sorted_true_unreach_call_true_valid_memsafety_i____uint32_t in dll-sorted_true-unreach-call_true-valid-memsafety.i [2018-04-12 01:12:02,837 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fdll_sorted_true_unreach_call_true_valid_memsafety_i____caddr_t in dll-sorted_true-unreach-call_true-valid-memsafety.i [2018-04-12 01:12:02,837 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fdll_sorted_true_unreach_call_true_valid_memsafety_i____dev_t in dll-sorted_true-unreach-call_true-valid-memsafety.i [2018-04-12 01:12:02,837 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fdll_sorted_true_unreach_call_true_valid_memsafety_i____fsblkcnt_t in dll-sorted_true-unreach-call_true-valid-memsafety.i [2018-04-12 01:12:02,837 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fdll_sorted_true_unreach_call_true_valid_memsafety_i__u_quad_t in dll-sorted_true-unreach-call_true-valid-memsafety.i [2018-04-12 01:12:02,837 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fdll_sorted_true_unreach_call_true_valid_memsafety_i__pthread_key_t in dll-sorted_true-unreach-call_true-valid-memsafety.i [2018-04-12 01:12:02,837 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fdll_sorted_true_unreach_call_true_valid_memsafety_i__fd_set in dll-sorted_true-unreach-call_true-valid-memsafety.i [2018-04-12 01:12:02,837 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fdll_sorted_true_unreach_call_true_valid_memsafety_i__pthread_barrierattr_t in dll-sorted_true-unreach-call_true-valid-memsafety.i [2018-04-12 01:12:02,837 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fdll_sorted_true_unreach_call_true_valid_memsafety_i__register_t in dll-sorted_true-unreach-call_true-valid-memsafety.i [2018-04-12 01:12:02,837 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fdll_sorted_true_unreach_call_true_valid_memsafety_i____int64_t in dll-sorted_true-unreach-call_true-valid-memsafety.i [2018-04-12 01:12:02,837 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fdll_sorted_true_unreach_call_true_valid_memsafety_i____useconds_t in dll-sorted_true-unreach-call_true-valid-memsafety.i [2018-04-12 01:12:02,838 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fdll_sorted_true_unreach_call_true_valid_memsafety_i____uint8_t in dll-sorted_true-unreach-call_true-valid-memsafety.i [2018-04-12 01:12:02,838 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fdll_sorted_true_unreach_call_true_valid_memsafety_i____daddr_t in dll-sorted_true-unreach-call_true-valid-memsafety.i [2018-04-12 01:12:02,838 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fdll_sorted_true_unreach_call_true_valid_memsafety_i____key_t in dll-sorted_true-unreach-call_true-valid-memsafety.i [2018-04-12 01:12:02,838 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fdll_sorted_true_unreach_call_true_valid_memsafety_i____int8_t in dll-sorted_true-unreach-call_true-valid-memsafety.i [2018-04-12 01:12:02,838 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fdll_sorted_true_unreach_call_true_valid_memsafety_i__loff_t in dll-sorted_true-unreach-call_true-valid-memsafety.i [2018-04-12 01:12:02,838 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fdll_sorted_true_unreach_call_true_valid_memsafety_i__u_int64_t in dll-sorted_true-unreach-call_true-valid-memsafety.i [2018-04-12 01:12:02,838 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fdll_sorted_true_unreach_call_true_valid_memsafety_i__daddr_t in dll-sorted_true-unreach-call_true-valid-memsafety.i [2018-04-12 01:12:02,838 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fdll_sorted_true_unreach_call_true_valid_memsafety_i__int64_t in dll-sorted_true-unreach-call_true-valid-memsafety.i [2018-04-12 01:12:02,838 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fdll_sorted_true_unreach_call_true_valid_memsafety_i____uint16_t in dll-sorted_true-unreach-call_true-valid-memsafety.i [2018-04-12 01:12:02,838 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fdll_sorted_true_unreach_call_true_valid_memsafety_i__fsid_t in dll-sorted_true-unreach-call_true-valid-memsafety.i [2018-04-12 01:12:02,838 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fdll_sorted_true_unreach_call_true_valid_memsafety_i____rlim64_t in dll-sorted_true-unreach-call_true-valid-memsafety.i [2018-04-12 01:12:02,838 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fdll_sorted_true_unreach_call_true_valid_memsafety_i____qaddr_t in dll-sorted_true-unreach-call_true-valid-memsafety.i [2018-04-12 01:12:02,839 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fdll_sorted_true_unreach_call_true_valid_memsafety_i____clock_t in dll-sorted_true-unreach-call_true-valid-memsafety.i [2018-04-12 01:12:02,839 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fdll_sorted_true_unreach_call_true_valid_memsafety_i____blksize_t in dll-sorted_true-unreach-call_true-valid-memsafety.i [2018-04-12 01:12:02,839 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fdll_sorted_true_unreach_call_true_valid_memsafety_i__pthread_condattr_t in dll-sorted_true-unreach-call_true-valid-memsafety.i [2018-04-12 01:12:02,839 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fdll_sorted_true_unreach_call_true_valid_memsafety_i____u_quad_t in dll-sorted_true-unreach-call_true-valid-memsafety.i [2018-04-12 01:12:02,839 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fdll_sorted_true_unreach_call_true_valid_memsafety_i__pthread_barrier_t in dll-sorted_true-unreach-call_true-valid-memsafety.i [2018-04-12 01:12:02,839 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fdll_sorted_true_unreach_call_true_valid_memsafety_i____pid_t in dll-sorted_true-unreach-call_true-valid-memsafety.i [2018-04-12 01:12:02,839 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fdll_sorted_true_unreach_call_true_valid_memsafety_i____syscall_slong_t in dll-sorted_true-unreach-call_true-valid-memsafety.i [2018-04-12 01:12:02,839 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fdll_sorted_true_unreach_call_true_valid_memsafety_i____ino_t in dll-sorted_true-unreach-call_true-valid-memsafety.i [2018-04-12 01:12:02,839 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fdll_sorted_true_unreach_call_true_valid_memsafety_i__ushort in dll-sorted_true-unreach-call_true-valid-memsafety.i [2018-04-12 01:12:02,839 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fdll_sorted_true_unreach_call_true_valid_memsafety_i____fsid_t in dll-sorted_true-unreach-call_true-valid-memsafety.i [2018-04-12 01:12:02,839 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fdll_sorted_true_unreach_call_true_valid_memsafety_i____loff_t in dll-sorted_true-unreach-call_true-valid-memsafety.i [2018-04-12 01:12:02,840 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fdll_sorted_true_unreach_call_true_valid_memsafety_i____ino64_t in dll-sorted_true-unreach-call_true-valid-memsafety.i [2018-04-12 01:12:02,840 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fdll_sorted_true_unreach_call_true_valid_memsafety_i____quad_t in dll-sorted_true-unreach-call_true-valid-memsafety.i [2018-04-12 01:12:02,840 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fdll_sorted_true_unreach_call_true_valid_memsafety_i__clock_t in dll-sorted_true-unreach-call_true-valid-memsafety.i [2018-04-12 01:12:02,840 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fdll_sorted_true_unreach_call_true_valid_memsafety_i__suseconds_t in dll-sorted_true-unreach-call_true-valid-memsafety.i [2018-04-12 01:12:02,840 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fdll_sorted_true_unreach_call_true_valid_memsafety_i__pthread_rwlockattr_t in dll-sorted_true-unreach-call_true-valid-memsafety.i [2018-04-12 01:12:02,840 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fdll_sorted_true_unreach_call_true_valid_memsafety_i__u_long in dll-sorted_true-unreach-call_true-valid-memsafety.i [2018-04-12 01:12:02,840 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fdll_sorted_true_unreach_call_true_valid_memsafety_i__fd_mask in dll-sorted_true-unreach-call_true-valid-memsafety.i [2018-04-12 01:12:02,840 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fdll_sorted_true_unreach_call_true_valid_memsafety_i____off_t in dll-sorted_true-unreach-call_true-valid-memsafety.i [2018-04-12 01:12:02,840 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fdll_sorted_true_unreach_call_true_valid_memsafety_i__ulong in dll-sorted_true-unreach-call_true-valid-memsafety.i [2018-04-12 01:12:02,840 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fdll_sorted_true_unreach_call_true_valid_memsafety_i__SLL in dll-sorted_true-unreach-call_true-valid-memsafety.i [2018-04-12 01:12:02,840 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fdll_sorted_true_unreach_call_true_valid_memsafety_i__u_int16_t in dll-sorted_true-unreach-call_true-valid-memsafety.i [2018-04-12 01:12:02,841 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fdll_sorted_true_unreach_call_true_valid_memsafety_i__blkcnt_t in dll-sorted_true-unreach-call_true-valid-memsafety.i [2018-04-12 01:12:02,841 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fdll_sorted_true_unreach_call_true_valid_memsafety_i____u_int in dll-sorted_true-unreach-call_true-valid-memsafety.i [2018-04-12 01:12:02,841 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fdll_sorted_true_unreach_call_true_valid_memsafety_i__u_char in dll-sorted_true-unreach-call_true-valid-memsafety.i [2018-04-12 01:12:02,841 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fdll_sorted_true_unreach_call_true_valid_memsafety_i____clockid_t in dll-sorted_true-unreach-call_true-valid-memsafety.i [2018-04-12 01:12:02,841 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fdll_sorted_true_unreach_call_true_valid_memsafety_i__quad_t in dll-sorted_true-unreach-call_true-valid-memsafety.i [2018-04-12 01:12:02,841 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fdll_sorted_true_unreach_call_true_valid_memsafety_i__pthread_cond_t in dll-sorted_true-unreach-call_true-valid-memsafety.i [2018-04-12 01:12:02,841 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fdll_sorted_true_unreach_call_true_valid_memsafety_i____sigset_t in dll-sorted_true-unreach-call_true-valid-memsafety.i [2018-04-12 01:12:02,841 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fdll_sorted_true_unreach_call_true_valid_memsafety_i__sigset_t in dll-sorted_true-unreach-call_true-valid-memsafety.i [2018-04-12 01:12:02,841 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fdll_sorted_true_unreach_call_true_valid_memsafety_i____blkcnt_t in dll-sorted_true-unreach-call_true-valid-memsafety.i [2018-04-12 01:12:02,841 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fdll_sorted_true_unreach_call_true_valid_memsafety_i__id_t in dll-sorted_true-unreach-call_true-valid-memsafety.i [2018-04-12 01:12:02,841 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fdll_sorted_true_unreach_call_true_valid_memsafety_i__pthread_spinlock_t in dll-sorted_true-unreach-call_true-valid-memsafety.i [2018-04-12 01:12:02,841 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fdll_sorted_true_unreach_call_true_valid_memsafety_i____u_long in dll-sorted_true-unreach-call_true-valid-memsafety.i [2018-04-12 01:12:02,842 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fdll_sorted_true_unreach_call_true_valid_memsafety_i__dev_t in dll-sorted_true-unreach-call_true-valid-memsafety.i [2018-04-12 01:12:02,842 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fdll_sorted_true_unreach_call_true_valid_memsafety_i____int16_t in dll-sorted_true-unreach-call_true-valid-memsafety.i [2018-04-12 01:12:02,842 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fdll_sorted_true_unreach_call_true_valid_memsafety_i____off64_t in dll-sorted_true-unreach-call_true-valid-memsafety.i [2018-04-12 01:12:02,842 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fdll_sorted_true_unreach_call_true_valid_memsafety_i____sig_atomic_t in dll-sorted_true-unreach-call_true-valid-memsafety.i [2018-04-12 01:12:02,842 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fdll_sorted_true_unreach_call_true_valid_memsafety_i__pthread_attr_t in dll-sorted_true-unreach-call_true-valid-memsafety.i [2018-04-12 01:12:02,842 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fdll_sorted_true_unreach_call_true_valid_memsafety_i____uid_t in dll-sorted_true-unreach-call_true-valid-memsafety.i [2018-04-12 01:12:02,842 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fdll_sorted_true_unreach_call_true_valid_memsafety_i__int16_t in dll-sorted_true-unreach-call_true-valid-memsafety.i [2018-04-12 01:12:02,842 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fdll_sorted_true_unreach_call_true_valid_memsafety_i____fd_mask in dll-sorted_true-unreach-call_true-valid-memsafety.i [2018-04-12 01:12:02,842 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fdll_sorted_true_unreach_call_true_valid_memsafety_i____u_char in dll-sorted_true-unreach-call_true-valid-memsafety.i [2018-04-12 01:12:02,842 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fdll_sorted_true_unreach_call_true_valid_memsafety_i____fsblkcnt64_t in dll-sorted_true-unreach-call_true-valid-memsafety.i [2018-04-12 01:12:02,842 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fdll_sorted_true_unreach_call_true_valid_memsafety_i__wchar_t in dll-sorted_true-unreach-call_true-valid-memsafety.i [2018-04-12 01:12:02,842 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fdll_sorted_true_unreach_call_true_valid_memsafety_i__uid_t in dll-sorted_true-unreach-call_true-valid-memsafety.i [2018-04-12 01:12:02,842 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fdll_sorted_true_unreach_call_true_valid_memsafety_i__uint in dll-sorted_true-unreach-call_true-valid-memsafety.i [2018-04-12 01:12:02,843 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fdll_sorted_true_unreach_call_true_valid_memsafety_i__nlink_t in dll-sorted_true-unreach-call_true-valid-memsafety.i [2018-04-12 01:12:02,843 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fdll_sorted_true_unreach_call_true_valid_memsafety_i__lldiv_t in dll-sorted_true-unreach-call_true-valid-memsafety.i [2018-04-12 01:12:02,843 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fdll_sorted_true_unreach_call_true_valid_memsafety_i__ssize_t in dll-sorted_true-unreach-call_true-valid-memsafety.i [2018-04-12 01:12:02,843 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fdll_sorted_true_unreach_call_true_valid_memsafety_i____fsword_t in dll-sorted_true-unreach-call_true-valid-memsafety.i [2018-04-12 01:12:02,843 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fdll_sorted_true_unreach_call_true_valid_memsafety_i____uint64_t in dll-sorted_true-unreach-call_true-valid-memsafety.i [2018-04-12 01:12:02,843 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fdll_sorted_true_unreach_call_true_valid_memsafety_i____suseconds_t in dll-sorted_true-unreach-call_true-valid-memsafety.i [2018-04-12 01:12:02,843 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fdll_sorted_true_unreach_call_true_valid_memsafety_i____nlink_t in dll-sorted_true-unreach-call_true-valid-memsafety.i [2018-04-12 01:12:02,843 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fdll_sorted_true_unreach_call_true_valid_memsafety_i____pthread_slist_t in dll-sorted_true-unreach-call_true-valid-memsafety.i [2018-04-12 01:12:02,843 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fdll_sorted_true_unreach_call_true_valid_memsafety_i____int32_t in dll-sorted_true-unreach-call_true-valid-memsafety.i [2018-04-12 01:12:02,843 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fdll_sorted_true_unreach_call_true_valid_memsafety_i__u_int8_t in dll-sorted_true-unreach-call_true-valid-memsafety.i [2018-04-12 01:12:02,843 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fdll_sorted_true_unreach_call_true_valid_memsafety_i__timer_t in dll-sorted_true-unreach-call_true-valid-memsafety.i [2018-04-12 01:12:02,843 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fdll_sorted_true_unreach_call_true_valid_memsafety_i__clockid_t in dll-sorted_true-unreach-call_true-valid-memsafety.i [2018-04-12 01:12:02,843 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fdll_sorted_true_unreach_call_true_valid_memsafety_i__u_int32_t in dll-sorted_true-unreach-call_true-valid-memsafety.i [2018-04-12 01:12:02,843 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fdll_sorted_true_unreach_call_true_valid_memsafety_i____id_t in dll-sorted_true-unreach-call_true-valid-memsafety.i [2018-04-12 01:12:02,843 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fdll_sorted_true_unreach_call_true_valid_memsafety_i__pthread_t in dll-sorted_true-unreach-call_true-valid-memsafety.i [2018-04-12 01:12:02,844 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fdll_sorted_true_unreach_call_true_valid_memsafety_i__u_int in dll-sorted_true-unreach-call_true-valid-memsafety.i [2018-04-12 01:12:02,844 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fdll_sorted_true_unreach_call_true_valid_memsafety_i____syscall_ulong_t in dll-sorted_true-unreach-call_true-valid-memsafety.i [2018-04-12 01:12:02,844 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fdll_sorted_true_unreach_call_true_valid_memsafety_i____gid_t in dll-sorted_true-unreach-call_true-valid-memsafety.i [2018-04-12 01:12:02,844 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fdll_sorted_true_unreach_call_true_valid_memsafety_i__fsblkcnt_t in dll-sorted_true-unreach-call_true-valid-memsafety.i [2018-04-12 01:12:02,857 INFO L330 CDTParser]: Deleted temporary CDT project at /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/data/FLAGfcfb89054 [2018-04-12 01:12:02,860 INFO L304 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-04-12 01:12:02,861 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2018-04-12 01:12:02,861 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-04-12 01:12:02,861 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-04-12 01:12:02,866 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-04-12 01:12:02,866 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 12.04 01:12:02" (1/1) ... [2018-04-12 01:12:02,868 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@16fa3b53 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.04 01:12:02, skipping insertion in model container [2018-04-12 01:12:02,869 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 12.04 01:12:02" (1/1) ... [2018-04-12 01:12:02,880 INFO L167 Dispatcher]: Using SV-COMP mode [2018-04-12 01:12:02,907 INFO L167 Dispatcher]: Using SV-COMP mode [2018-04-12 01:12:03,031 INFO L175 PostProcessor]: Settings: Checked method=main [2018-04-12 01:12:03,073 INFO L175 PostProcessor]: Settings: Checked method=main [2018-04-12 01:12:03,079 INFO L100 SccComputation]: Graph consists of 0 InCaSumBalls and 115 non ball SCCs. Number of states in SCCs 115. [2018-04-12 01:12:03,112 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.04 01:12:03 WrapperNode [2018-04-12 01:12:03,112 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-04-12 01:12:03,113 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-04-12 01:12:03,113 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-04-12 01:12:03,113 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-04-12 01:12:03,123 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.04 01:12:03" (1/1) ... [2018-04-12 01:12:03,123 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.04 01:12:03" (1/1) ... [2018-04-12 01:12:03,134 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.04 01:12:03" (1/1) ... [2018-04-12 01:12:03,135 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.04 01:12:03" (1/1) ... [2018-04-12 01:12:03,147 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.04 01:12:03" (1/1) ... [2018-04-12 01:12:03,154 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.04 01:12:03" (1/1) ... [2018-04-12 01:12:03,156 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.04 01:12:03" (1/1) ... [2018-04-12 01:12:03,160 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-04-12 01:12:03,160 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-04-12 01:12:03,161 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-04-12 01:12:03,161 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-04-12 01:12:03,161 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.04 01:12:03" (1/1) ... No working directory specified, using /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-04-12 01:12:03,284 INFO L136 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-04-12 01:12:03,285 INFO L136 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-04-12 01:12:03,285 INFO L136 BoogieDeclarations]: Found implementation of procedure main [2018-04-12 01:12:03,285 INFO L128 BoogieDeclarations]: Found specification of procedure __ctype_get_mb_cur_max [2018-04-12 01:12:03,285 INFO L128 BoogieDeclarations]: Found specification of procedure atof [2018-04-12 01:12:03,285 INFO L128 BoogieDeclarations]: Found specification of procedure atoi [2018-04-12 01:12:03,285 INFO L128 BoogieDeclarations]: Found specification of procedure atol [2018-04-12 01:12:03,285 INFO L128 BoogieDeclarations]: Found specification of procedure atoll [2018-04-12 01:12:03,285 INFO L128 BoogieDeclarations]: Found specification of procedure strtod [2018-04-12 01:12:03,286 INFO L128 BoogieDeclarations]: Found specification of procedure strtof [2018-04-12 01:12:03,286 INFO L128 BoogieDeclarations]: Found specification of procedure strtold [2018-04-12 01:12:03,286 INFO L128 BoogieDeclarations]: Found specification of procedure strtol [2018-04-12 01:12:03,286 INFO L128 BoogieDeclarations]: Found specification of procedure strtoul [2018-04-12 01:12:03,286 INFO L128 BoogieDeclarations]: Found specification of procedure strtoq [2018-04-12 01:12:03,286 INFO L128 BoogieDeclarations]: Found specification of procedure strtouq [2018-04-12 01:12:03,286 INFO L128 BoogieDeclarations]: Found specification of procedure strtoll [2018-04-12 01:12:03,286 INFO L128 BoogieDeclarations]: Found specification of procedure strtoull [2018-04-12 01:12:03,286 INFO L128 BoogieDeclarations]: Found specification of procedure l64a [2018-04-12 01:12:03,286 INFO L128 BoogieDeclarations]: Found specification of procedure a64l [2018-04-12 01:12:03,286 INFO L128 BoogieDeclarations]: Found specification of procedure select [2018-04-12 01:12:03,287 INFO L128 BoogieDeclarations]: Found specification of procedure pselect [2018-04-12 01:12:03,287 INFO L128 BoogieDeclarations]: Found specification of procedure gnu_dev_major [2018-04-12 01:12:03,287 INFO L128 BoogieDeclarations]: Found specification of procedure gnu_dev_minor [2018-04-12 01:12:03,287 INFO L128 BoogieDeclarations]: Found specification of procedure gnu_dev_makedev [2018-04-12 01:12:03,287 INFO L128 BoogieDeclarations]: Found specification of procedure random [2018-04-12 01:12:03,287 INFO L128 BoogieDeclarations]: Found specification of procedure srandom [2018-04-12 01:12:03,287 INFO L128 BoogieDeclarations]: Found specification of procedure initstate [2018-04-12 01:12:03,287 INFO L128 BoogieDeclarations]: Found specification of procedure setstate [2018-04-12 01:12:03,287 INFO L128 BoogieDeclarations]: Found specification of procedure random_r [2018-04-12 01:12:03,288 INFO L128 BoogieDeclarations]: Found specification of procedure srandom_r [2018-04-12 01:12:03,288 INFO L128 BoogieDeclarations]: Found specification of procedure initstate_r [2018-04-12 01:12:03,288 INFO L128 BoogieDeclarations]: Found specification of procedure setstate_r [2018-04-12 01:12:03,288 INFO L128 BoogieDeclarations]: Found specification of procedure rand [2018-04-12 01:12:03,288 INFO L128 BoogieDeclarations]: Found specification of procedure srand [2018-04-12 01:12:03,288 INFO L128 BoogieDeclarations]: Found specification of procedure rand_r [2018-04-12 01:12:03,288 INFO L128 BoogieDeclarations]: Found specification of procedure drand48 [2018-04-12 01:12:03,288 INFO L128 BoogieDeclarations]: Found specification of procedure erand48 [2018-04-12 01:12:03,288 INFO L128 BoogieDeclarations]: Found specification of procedure lrand48 [2018-04-12 01:12:03,289 INFO L128 BoogieDeclarations]: Found specification of procedure nrand48 [2018-04-12 01:12:03,289 INFO L128 BoogieDeclarations]: Found specification of procedure mrand48 [2018-04-12 01:12:03,289 INFO L128 BoogieDeclarations]: Found specification of procedure jrand48 [2018-04-12 01:12:03,289 INFO L128 BoogieDeclarations]: Found specification of procedure srand48 [2018-04-12 01:12:03,289 INFO L128 BoogieDeclarations]: Found specification of procedure seed48 [2018-04-12 01:12:03,289 INFO L128 BoogieDeclarations]: Found specification of procedure lcong48 [2018-04-12 01:12:03,289 INFO L128 BoogieDeclarations]: Found specification of procedure drand48_r [2018-04-12 01:12:03,289 INFO L128 BoogieDeclarations]: Found specification of procedure erand48_r [2018-04-12 01:12:03,289 INFO L128 BoogieDeclarations]: Found specification of procedure lrand48_r [2018-04-12 01:12:03,289 INFO L128 BoogieDeclarations]: Found specification of procedure nrand48_r [2018-04-12 01:12:03,290 INFO L128 BoogieDeclarations]: Found specification of procedure mrand48_r [2018-04-12 01:12:03,290 INFO L128 BoogieDeclarations]: Found specification of procedure jrand48_r [2018-04-12 01:12:03,290 INFO L128 BoogieDeclarations]: Found specification of procedure srand48_r [2018-04-12 01:12:03,290 INFO L128 BoogieDeclarations]: Found specification of procedure seed48_r [2018-04-12 01:12:03,290 INFO L128 BoogieDeclarations]: Found specification of procedure lcong48_r [2018-04-12 01:12:03,290 INFO L128 BoogieDeclarations]: Found specification of procedure malloc [2018-04-12 01:12:03,290 INFO L128 BoogieDeclarations]: Found specification of procedure calloc [2018-04-12 01:12:03,290 INFO L128 BoogieDeclarations]: Found specification of procedure realloc [2018-04-12 01:12:03,290 INFO L128 BoogieDeclarations]: Found specification of procedure free [2018-04-12 01:12:03,291 INFO L128 BoogieDeclarations]: Found specification of procedure cfree [2018-04-12 01:12:03,291 INFO L128 BoogieDeclarations]: Found specification of procedure alloca [2018-04-12 01:12:03,291 INFO L128 BoogieDeclarations]: Found specification of procedure valloc [2018-04-12 01:12:03,291 INFO L128 BoogieDeclarations]: Found specification of procedure posix_memalign [2018-04-12 01:12:03,291 INFO L128 BoogieDeclarations]: Found specification of procedure aligned_alloc [2018-04-12 01:12:03,291 INFO L128 BoogieDeclarations]: Found specification of procedure abort [2018-04-12 01:12:03,291 INFO L128 BoogieDeclarations]: Found specification of procedure atexit [2018-04-12 01:12:03,291 INFO L128 BoogieDeclarations]: Found specification of procedure at_quick_exit [2018-04-12 01:12:03,291 INFO L128 BoogieDeclarations]: Found specification of procedure on_exit [2018-04-12 01:12:03,291 INFO L128 BoogieDeclarations]: Found specification of procedure exit [2018-04-12 01:12:03,292 INFO L128 BoogieDeclarations]: Found specification of procedure quick_exit [2018-04-12 01:12:03,292 INFO L128 BoogieDeclarations]: Found specification of procedure _Exit [2018-04-12 01:12:03,292 INFO L128 BoogieDeclarations]: Found specification of procedure getenv [2018-04-12 01:12:03,292 INFO L128 BoogieDeclarations]: Found specification of procedure putenv [2018-04-12 01:12:03,292 INFO L128 BoogieDeclarations]: Found specification of procedure setenv [2018-04-12 01:12:03,292 INFO L128 BoogieDeclarations]: Found specification of procedure unsetenv [2018-04-12 01:12:03,292 INFO L128 BoogieDeclarations]: Found specification of procedure clearenv [2018-04-12 01:12:03,292 INFO L128 BoogieDeclarations]: Found specification of procedure mktemp [2018-04-12 01:12:03,292 INFO L128 BoogieDeclarations]: Found specification of procedure mkstemp [2018-04-12 01:12:03,292 INFO L128 BoogieDeclarations]: Found specification of procedure mkstemps [2018-04-12 01:12:03,292 INFO L128 BoogieDeclarations]: Found specification of procedure mkdtemp [2018-04-12 01:12:03,293 INFO L128 BoogieDeclarations]: Found specification of procedure system [2018-04-12 01:12:03,293 INFO L128 BoogieDeclarations]: Found specification of procedure realpath [2018-04-12 01:12:03,293 INFO L128 BoogieDeclarations]: Found specification of procedure bsearch [2018-04-12 01:12:03,293 INFO L128 BoogieDeclarations]: Found specification of procedure qsort [2018-04-12 01:12:03,293 INFO L128 BoogieDeclarations]: Found specification of procedure abs [2018-04-12 01:12:03,293 INFO L128 BoogieDeclarations]: Found specification of procedure labs [2018-04-12 01:12:03,293 INFO L128 BoogieDeclarations]: Found specification of procedure llabs [2018-04-12 01:12:03,293 INFO L128 BoogieDeclarations]: Found specification of procedure div [2018-04-12 01:12:03,293 INFO L128 BoogieDeclarations]: Found specification of procedure ldiv [2018-04-12 01:12:03,293 INFO L128 BoogieDeclarations]: Found specification of procedure lldiv [2018-04-12 01:12:03,294 INFO L128 BoogieDeclarations]: Found specification of procedure ecvt [2018-04-12 01:12:03,294 INFO L128 BoogieDeclarations]: Found specification of procedure fcvt [2018-04-12 01:12:03,294 INFO L128 BoogieDeclarations]: Found specification of procedure gcvt [2018-04-12 01:12:03,294 INFO L128 BoogieDeclarations]: Found specification of procedure qecvt [2018-04-12 01:12:03,294 INFO L128 BoogieDeclarations]: Found specification of procedure qfcvt [2018-04-12 01:12:03,294 INFO L128 BoogieDeclarations]: Found specification of procedure qgcvt [2018-04-12 01:12:03,294 INFO L128 BoogieDeclarations]: Found specification of procedure ecvt_r [2018-04-12 01:12:03,294 INFO L128 BoogieDeclarations]: Found specification of procedure fcvt_r [2018-04-12 01:12:03,294 INFO L128 BoogieDeclarations]: Found specification of procedure qecvt_r [2018-04-12 01:12:03,294 INFO L128 BoogieDeclarations]: Found specification of procedure qfcvt_r [2018-04-12 01:12:03,294 INFO L128 BoogieDeclarations]: Found specification of procedure mblen [2018-04-12 01:12:03,295 INFO L128 BoogieDeclarations]: Found specification of procedure mbtowc [2018-04-12 01:12:03,295 INFO L128 BoogieDeclarations]: Found specification of procedure wctomb [2018-04-12 01:12:03,295 INFO L128 BoogieDeclarations]: Found specification of procedure mbstowcs [2018-04-12 01:12:03,295 INFO L128 BoogieDeclarations]: Found specification of procedure wcstombs [2018-04-12 01:12:03,295 INFO L128 BoogieDeclarations]: Found specification of procedure rpmatch [2018-04-12 01:12:03,295 INFO L128 BoogieDeclarations]: Found specification of procedure getsubopt [2018-04-12 01:12:03,295 INFO L128 BoogieDeclarations]: Found specification of procedure getloadavg [2018-04-12 01:12:03,295 INFO L128 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2018-04-12 01:12:03,295 INFO L128 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2018-04-12 01:12:03,295 INFO L128 BoogieDeclarations]: Found specification of procedure main [2018-04-12 01:12:03,296 INFO L128 BoogieDeclarations]: Found specification of procedure #Ultimate.alloc [2018-04-12 01:12:03,296 INFO L128 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2018-04-12 01:12:03,296 INFO L128 BoogieDeclarations]: Found specification of procedure write~int [2018-04-12 01:12:03,296 INFO L128 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2018-04-12 01:12:03,296 INFO L128 BoogieDeclarations]: Found specification of procedure read~int [2018-04-12 01:12:03,296 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2018-04-12 01:12:03,296 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-04-12 01:12:03,296 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-04-12 01:12:03,296 INFO L128 BoogieDeclarations]: Found specification of procedure write~unchecked~int [2018-04-12 01:12:03,759 INFO L259 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-04-12 01:12:03,759 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.04 01:12:03 BoogieIcfgContainer [2018-04-12 01:12:03,760 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-04-12 01:12:03,760 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-04-12 01:12:03,760 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-04-12 01:12:03,763 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-04-12 01:12:03,763 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 12.04 01:12:02" (1/3) ... [2018-04-12 01:12:03,764 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4f0a2f1c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 12.04 01:12:03, skipping insertion in model container [2018-04-12 01:12:03,764 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.04 01:12:03" (2/3) ... [2018-04-12 01:12:03,764 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4f0a2f1c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 12.04 01:12:03, skipping insertion in model container [2018-04-12 01:12:03,764 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.04 01:12:03" (3/3) ... [2018-04-12 01:12:03,766 INFO L107 eAbstractionObserver]: Analyzing ICFG dll-sorted_true-unreach-call_true-valid-memsafety.i [2018-04-12 01:12:03,773 INFO L131 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-04-12 01:12:03,782 INFO L143 ceAbstractionStarter]: Appying trace abstraction to program that has 73 error locations. [2018-04-12 01:12:03,805 INFO L128 ementStrategyFactory]: Using default assertion order modulation [2018-04-12 01:12:03,805 INFO L369 AbstractCegarLoop]: Interprodecural is true [2018-04-12 01:12:03,805 INFO L370 AbstractCegarLoop]: Hoare is false [2018-04-12 01:12:03,805 INFO L371 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-04-12 01:12:03,805 INFO L372 AbstractCegarLoop]: Backedges is TWOTRACK [2018-04-12 01:12:03,806 INFO L373 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-04-12 01:12:03,806 INFO L374 AbstractCegarLoop]: Difference is false [2018-04-12 01:12:03,806 INFO L375 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-04-12 01:12:03,806 INFO L380 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-04-12 01:12:03,806 INFO L87 2NestedWordAutomaton]: Mode: main mode - execution starts in main procedure [2018-04-12 01:12:03,817 INFO L276 IsEmpty]: Start isEmpty. Operand 185 states. [2018-04-12 01:12:03,823 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2018-04-12 01:12:03,824 INFO L347 BasicCegarLoop]: Found error trace [2018-04-12 01:12:03,824 INFO L355 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2018-04-12 01:12:03,824 INFO L408 AbstractCegarLoop]: === Iteration 1 === [mainErr51RequiresViolation, mainErr69RequiresViolation, mainErr26RequiresViolation, mainErr54RequiresViolation, mainErr66RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr31RequiresViolation, mainErr46RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr58RequiresViolation, mainErr62RequiresViolation, mainErr15RequiresViolation, mainErr49RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr55RequiresViolation, mainErr65RequiresViolation, mainErr17RequiresViolation, mainErr42RequiresViolation, mainErr71AssertViolationMEMORY_FREE, mainErr30RequiresViolation, mainErr11RequiresViolation, mainErr57RequiresViolation, mainErr63RequiresViolation, mainErr24RequiresViolation, mainErr44RequiresViolation, mainErr10RequiresViolation, mainErr43RequiresViolation, mainErr4RequiresViolation, mainErr50RequiresViolation, mainErr72EnsuresViolationMEMORY_LEAK, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr61RequiresViolation, mainErr59RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr70AssertViolationMEMORY_FREE, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr56RequiresViolation, mainErr64RequiresViolation, mainErr48RequiresViolation, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr52RequiresViolation, mainErr68RequiresViolation, mainErr45RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr60RequiresViolation, mainErr9RequiresViolation, mainErr67RequiresViolation, mainErr53RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr34RequiresViolation, mainErr47RequiresViolation, mainErr14RequiresViolation, mainErr40RequiresViolation]=== [2018-04-12 01:12:03,827 INFO L82 PathProgramCache]: Analyzing trace with hash 1591934807, now seen corresponding path program 1 times [2018-04-12 01:12:03,828 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-04-12 01:12:03,828 INFO L68 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-04-12 01:12:03,859 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-12 01:12:03,860 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-12 01:12:03,860 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-12 01:12:03,880 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-12 01:12:03,885 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-12 01:12:03,934 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-12 01:12:03,936 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-04-12 01:12:03,936 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-04-12 01:12:03,938 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-04-12 01:12:03,949 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-04-12 01:12:03,950 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-04-12 01:12:03,952 INFO L87 Difference]: Start difference. First operand 185 states. Second operand 4 states. [2018-04-12 01:12:04,143 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-12 01:12:04,144 INFO L93 Difference]: Finished difference Result 197 states and 209 transitions. [2018-04-12 01:12:04,144 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-04-12 01:12:04,145 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 8 [2018-04-12 01:12:04,145 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-12 01:12:04,153 INFO L225 Difference]: With dead ends: 197 [2018-04-12 01:12:04,153 INFO L226 Difference]: Without dead ends: 193 [2018-04-12 01:12:04,155 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-04-12 01:12:04,167 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 193 states. [2018-04-12 01:12:04,182 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 193 to 179. [2018-04-12 01:12:04,184 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 179 states. [2018-04-12 01:12:04,185 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 179 states to 179 states and 190 transitions. [2018-04-12 01:12:04,187 INFO L78 Accepts]: Start accepts. Automaton has 179 states and 190 transitions. Word has length 8 [2018-04-12 01:12:04,187 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-12 01:12:04,187 INFO L459 AbstractCegarLoop]: Abstraction has 179 states and 190 transitions. [2018-04-12 01:12:04,187 INFO L460 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-04-12 01:12:04,187 INFO L276 IsEmpty]: Start isEmpty. Operand 179 states and 190 transitions. [2018-04-12 01:12:04,187 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2018-04-12 01:12:04,188 INFO L347 BasicCegarLoop]: Found error trace [2018-04-12 01:12:04,188 INFO L355 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2018-04-12 01:12:04,188 INFO L408 AbstractCegarLoop]: === Iteration 2 === [mainErr51RequiresViolation, mainErr69RequiresViolation, mainErr26RequiresViolation, mainErr54RequiresViolation, mainErr66RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr31RequiresViolation, mainErr46RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr58RequiresViolation, mainErr62RequiresViolation, mainErr15RequiresViolation, mainErr49RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr55RequiresViolation, mainErr65RequiresViolation, mainErr17RequiresViolation, mainErr42RequiresViolation, mainErr71AssertViolationMEMORY_FREE, mainErr30RequiresViolation, mainErr11RequiresViolation, mainErr57RequiresViolation, mainErr63RequiresViolation, mainErr24RequiresViolation, mainErr44RequiresViolation, mainErr10RequiresViolation, mainErr43RequiresViolation, mainErr4RequiresViolation, mainErr50RequiresViolation, mainErr72EnsuresViolationMEMORY_LEAK, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr61RequiresViolation, mainErr59RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr70AssertViolationMEMORY_FREE, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr56RequiresViolation, mainErr64RequiresViolation, mainErr48RequiresViolation, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr52RequiresViolation, mainErr68RequiresViolation, mainErr45RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr60RequiresViolation, mainErr9RequiresViolation, mainErr67RequiresViolation, mainErr53RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr34RequiresViolation, mainErr47RequiresViolation, mainErr14RequiresViolation, mainErr40RequiresViolation]=== [2018-04-12 01:12:04,188 INFO L82 PathProgramCache]: Analyzing trace with hash 1591934808, now seen corresponding path program 1 times [2018-04-12 01:12:04,188 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-04-12 01:12:04,188 INFO L68 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-04-12 01:12:04,189 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-12 01:12:04,190 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-12 01:12:04,190 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-12 01:12:04,200 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-12 01:12:04,201 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-12 01:12:04,235 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-12 01:12:04,235 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-04-12 01:12:04,235 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-04-12 01:12:04,236 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-04-12 01:12:04,236 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-04-12 01:12:04,237 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-04-12 01:12:04,237 INFO L87 Difference]: Start difference. First operand 179 states and 190 transitions. Second operand 4 states. [2018-04-12 01:12:04,342 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-12 01:12:04,342 INFO L93 Difference]: Finished difference Result 181 states and 192 transitions. [2018-04-12 01:12:04,343 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-04-12 01:12:04,343 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 8 [2018-04-12 01:12:04,343 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-12 01:12:04,344 INFO L225 Difference]: With dead ends: 181 [2018-04-12 01:12:04,344 INFO L226 Difference]: Without dead ends: 181 [2018-04-12 01:12:04,345 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-04-12 01:12:04,345 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 181 states. [2018-04-12 01:12:04,351 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 181 to 176. [2018-04-12 01:12:04,351 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 176 states. [2018-04-12 01:12:04,354 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 176 states to 176 states and 187 transitions. [2018-04-12 01:12:04,354 INFO L78 Accepts]: Start accepts. Automaton has 176 states and 187 transitions. Word has length 8 [2018-04-12 01:12:04,354 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-12 01:12:04,354 INFO L459 AbstractCegarLoop]: Abstraction has 176 states and 187 transitions. [2018-04-12 01:12:04,354 INFO L460 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-04-12 01:12:04,354 INFO L276 IsEmpty]: Start isEmpty. Operand 176 states and 187 transitions. [2018-04-12 01:12:04,355 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2018-04-12 01:12:04,355 INFO L347 BasicCegarLoop]: Found error trace [2018-04-12 01:12:04,355 INFO L355 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-12 01:12:04,355 INFO L408 AbstractCegarLoop]: === Iteration 3 === [mainErr51RequiresViolation, mainErr69RequiresViolation, mainErr26RequiresViolation, mainErr54RequiresViolation, mainErr66RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr31RequiresViolation, mainErr46RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr58RequiresViolation, mainErr62RequiresViolation, mainErr15RequiresViolation, mainErr49RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr55RequiresViolation, mainErr65RequiresViolation, mainErr17RequiresViolation, mainErr42RequiresViolation, mainErr71AssertViolationMEMORY_FREE, mainErr30RequiresViolation, mainErr11RequiresViolation, mainErr57RequiresViolation, mainErr63RequiresViolation, mainErr24RequiresViolation, mainErr44RequiresViolation, mainErr10RequiresViolation, mainErr43RequiresViolation, mainErr4RequiresViolation, mainErr50RequiresViolation, mainErr72EnsuresViolationMEMORY_LEAK, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr61RequiresViolation, mainErr59RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr70AssertViolationMEMORY_FREE, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr56RequiresViolation, mainErr64RequiresViolation, mainErr48RequiresViolation, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr52RequiresViolation, mainErr68RequiresViolation, mainErr45RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr60RequiresViolation, mainErr9RequiresViolation, mainErr67RequiresViolation, mainErr53RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr34RequiresViolation, mainErr47RequiresViolation, mainErr14RequiresViolation, mainErr40RequiresViolation]=== [2018-04-12 01:12:04,355 INFO L82 PathProgramCache]: Analyzing trace with hash 1438606308, now seen corresponding path program 1 times [2018-04-12 01:12:04,355 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-04-12 01:12:04,355 INFO L68 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-04-12 01:12:04,357 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-12 01:12:04,357 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-12 01:12:04,357 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-12 01:12:04,373 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-12 01:12:04,374 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-12 01:12:04,413 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-12 01:12:04,413 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-04-12 01:12:04,413 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-04-12 01:12:04,414 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-04-12 01:12:04,414 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-04-12 01:12:04,414 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-04-12 01:12:04,414 INFO L87 Difference]: Start difference. First operand 176 states and 187 transitions. Second operand 4 states. [2018-04-12 01:12:04,522 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-12 01:12:04,522 INFO L93 Difference]: Finished difference Result 186 states and 200 transitions. [2018-04-12 01:12:04,522 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-04-12 01:12:04,522 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 16 [2018-04-12 01:12:04,522 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-12 01:12:04,523 INFO L225 Difference]: With dead ends: 186 [2018-04-12 01:12:04,523 INFO L226 Difference]: Without dead ends: 186 [2018-04-12 01:12:04,523 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-04-12 01:12:04,523 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 186 states. [2018-04-12 01:12:04,527 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 186 to 175. [2018-04-12 01:12:04,527 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 175 states. [2018-04-12 01:12:04,528 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 175 states to 175 states and 196 transitions. [2018-04-12 01:12:04,528 INFO L78 Accepts]: Start accepts. Automaton has 175 states and 196 transitions. Word has length 16 [2018-04-12 01:12:04,528 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-12 01:12:04,528 INFO L459 AbstractCegarLoop]: Abstraction has 175 states and 196 transitions. [2018-04-12 01:12:04,528 INFO L460 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-04-12 01:12:04,528 INFO L276 IsEmpty]: Start isEmpty. Operand 175 states and 196 transitions. [2018-04-12 01:12:04,528 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2018-04-12 01:12:04,528 INFO L347 BasicCegarLoop]: Found error trace [2018-04-12 01:12:04,528 INFO L355 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-12 01:12:04,529 INFO L408 AbstractCegarLoop]: === Iteration 4 === [mainErr51RequiresViolation, mainErr69RequiresViolation, mainErr26RequiresViolation, mainErr54RequiresViolation, mainErr66RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr31RequiresViolation, mainErr46RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr58RequiresViolation, mainErr62RequiresViolation, mainErr15RequiresViolation, mainErr49RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr55RequiresViolation, mainErr65RequiresViolation, mainErr17RequiresViolation, mainErr42RequiresViolation, mainErr71AssertViolationMEMORY_FREE, mainErr30RequiresViolation, mainErr11RequiresViolation, mainErr57RequiresViolation, mainErr63RequiresViolation, mainErr24RequiresViolation, mainErr44RequiresViolation, mainErr10RequiresViolation, mainErr43RequiresViolation, mainErr4RequiresViolation, mainErr50RequiresViolation, mainErr72EnsuresViolationMEMORY_LEAK, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr61RequiresViolation, mainErr59RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr70AssertViolationMEMORY_FREE, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr56RequiresViolation, mainErr64RequiresViolation, mainErr48RequiresViolation, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr52RequiresViolation, mainErr68RequiresViolation, mainErr45RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr60RequiresViolation, mainErr9RequiresViolation, mainErr67RequiresViolation, mainErr53RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr34RequiresViolation, mainErr47RequiresViolation, mainErr14RequiresViolation, mainErr40RequiresViolation]=== [2018-04-12 01:12:04,529 INFO L82 PathProgramCache]: Analyzing trace with hash 1438606309, now seen corresponding path program 1 times [2018-04-12 01:12:04,529 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-04-12 01:12:04,529 INFO L68 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-04-12 01:12:04,530 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-12 01:12:04,530 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-12 01:12:04,530 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-12 01:12:04,538 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-12 01:12:04,538 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-12 01:12:04,583 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-12 01:12:04,584 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-04-12 01:12:04,584 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-04-12 01:12:04,584 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-04-12 01:12:04,584 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-04-12 01:12:04,584 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-04-12 01:12:04,584 INFO L87 Difference]: Start difference. First operand 175 states and 196 transitions. Second operand 5 states. [2018-04-12 01:12:04,756 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-12 01:12:04,756 INFO L93 Difference]: Finished difference Result 267 states and 291 transitions. [2018-04-12 01:12:04,756 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-04-12 01:12:04,756 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 16 [2018-04-12 01:12:04,756 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-12 01:12:04,758 INFO L225 Difference]: With dead ends: 267 [2018-04-12 01:12:04,758 INFO L226 Difference]: Without dead ends: 267 [2018-04-12 01:12:04,758 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2018-04-12 01:12:04,758 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 267 states. [2018-04-12 01:12:04,764 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 267 to 236. [2018-04-12 01:12:04,765 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 236 states. [2018-04-12 01:12:04,766 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 236 states to 236 states and 275 transitions. [2018-04-12 01:12:04,766 INFO L78 Accepts]: Start accepts. Automaton has 236 states and 275 transitions. Word has length 16 [2018-04-12 01:12:04,766 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-12 01:12:04,766 INFO L459 AbstractCegarLoop]: Abstraction has 236 states and 275 transitions. [2018-04-12 01:12:04,766 INFO L460 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-04-12 01:12:04,766 INFO L276 IsEmpty]: Start isEmpty. Operand 236 states and 275 transitions. [2018-04-12 01:12:04,766 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2018-04-12 01:12:04,766 INFO L347 BasicCegarLoop]: Found error trace [2018-04-12 01:12:04,766 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-12 01:12:04,766 INFO L408 AbstractCegarLoop]: === Iteration 5 === [mainErr51RequiresViolation, mainErr69RequiresViolation, mainErr26RequiresViolation, mainErr54RequiresViolation, mainErr66RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr31RequiresViolation, mainErr46RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr58RequiresViolation, mainErr62RequiresViolation, mainErr15RequiresViolation, mainErr49RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr55RequiresViolation, mainErr65RequiresViolation, mainErr17RequiresViolation, mainErr42RequiresViolation, mainErr71AssertViolationMEMORY_FREE, mainErr30RequiresViolation, mainErr11RequiresViolation, mainErr57RequiresViolation, mainErr63RequiresViolation, mainErr24RequiresViolation, mainErr44RequiresViolation, mainErr10RequiresViolation, mainErr43RequiresViolation, mainErr4RequiresViolation, mainErr50RequiresViolation, mainErr72EnsuresViolationMEMORY_LEAK, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr61RequiresViolation, mainErr59RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr70AssertViolationMEMORY_FREE, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr56RequiresViolation, mainErr64RequiresViolation, mainErr48RequiresViolation, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr52RequiresViolation, mainErr68RequiresViolation, mainErr45RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr60RequiresViolation, mainErr9RequiresViolation, mainErr67RequiresViolation, mainErr53RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr34RequiresViolation, mainErr47RequiresViolation, mainErr14RequiresViolation, mainErr40RequiresViolation]=== [2018-04-12 01:12:04,767 INFO L82 PathProgramCache]: Analyzing trace with hash -478807353, now seen corresponding path program 1 times [2018-04-12 01:12:04,767 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-04-12 01:12:04,767 INFO L68 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-04-12 01:12:04,768 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-12 01:12:04,768 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-12 01:12:04,768 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-12 01:12:04,778 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-12 01:12:04,779 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-12 01:12:04,808 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-12 01:12:04,808 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-04-12 01:12:04,808 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-04-12 01:12:04,808 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-04-12 01:12:04,809 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-04-12 01:12:04,809 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-04-12 01:12:04,809 INFO L87 Difference]: Start difference. First operand 236 states and 275 transitions. Second operand 5 states. [2018-04-12 01:12:05,049 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-12 01:12:05,049 INFO L93 Difference]: Finished difference Result 416 states and 486 transitions. [2018-04-12 01:12:05,049 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-04-12 01:12:05,049 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 18 [2018-04-12 01:12:05,050 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-12 01:12:05,052 INFO L225 Difference]: With dead ends: 416 [2018-04-12 01:12:05,053 INFO L226 Difference]: Without dead ends: 416 [2018-04-12 01:12:05,053 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2018-04-12 01:12:05,053 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 416 states. [2018-04-12 01:12:05,059 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 416 to 235. [2018-04-12 01:12:05,059 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 235 states. [2018-04-12 01:12:05,060 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 235 states to 235 states and 273 transitions. [2018-04-12 01:12:05,060 INFO L78 Accepts]: Start accepts. Automaton has 235 states and 273 transitions. Word has length 18 [2018-04-12 01:12:05,061 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-12 01:12:05,061 INFO L459 AbstractCegarLoop]: Abstraction has 235 states and 273 transitions. [2018-04-12 01:12:05,061 INFO L460 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-04-12 01:12:05,061 INFO L276 IsEmpty]: Start isEmpty. Operand 235 states and 273 transitions. [2018-04-12 01:12:05,061 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2018-04-12 01:12:05,061 INFO L347 BasicCegarLoop]: Found error trace [2018-04-12 01:12:05,061 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-12 01:12:05,062 INFO L408 AbstractCegarLoop]: === Iteration 6 === [mainErr51RequiresViolation, mainErr69RequiresViolation, mainErr26RequiresViolation, mainErr54RequiresViolation, mainErr66RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr31RequiresViolation, mainErr46RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr58RequiresViolation, mainErr62RequiresViolation, mainErr15RequiresViolation, mainErr49RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr55RequiresViolation, mainErr65RequiresViolation, mainErr17RequiresViolation, mainErr42RequiresViolation, mainErr71AssertViolationMEMORY_FREE, mainErr30RequiresViolation, mainErr11RequiresViolation, mainErr57RequiresViolation, mainErr63RequiresViolation, mainErr24RequiresViolation, mainErr44RequiresViolation, mainErr10RequiresViolation, mainErr43RequiresViolation, mainErr4RequiresViolation, mainErr50RequiresViolation, mainErr72EnsuresViolationMEMORY_LEAK, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr61RequiresViolation, mainErr59RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr70AssertViolationMEMORY_FREE, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr56RequiresViolation, mainErr64RequiresViolation, mainErr48RequiresViolation, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr52RequiresViolation, mainErr68RequiresViolation, mainErr45RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr60RequiresViolation, mainErr9RequiresViolation, mainErr67RequiresViolation, mainErr53RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr34RequiresViolation, mainErr47RequiresViolation, mainErr14RequiresViolation, mainErr40RequiresViolation]=== [2018-04-12 01:12:05,063 INFO L82 PathProgramCache]: Analyzing trace with hash -478807352, now seen corresponding path program 1 times [2018-04-12 01:12:05,063 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-04-12 01:12:05,063 INFO L68 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-04-12 01:12:05,064 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-12 01:12:05,064 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-12 01:12:05,064 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-12 01:12:05,073 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-12 01:12:05,073 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-12 01:12:05,108 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-12 01:12:05,108 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-04-12 01:12:05,108 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-04-12 01:12:05,108 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-04-12 01:12:05,108 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-04-12 01:12:05,109 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-04-12 01:12:05,109 INFO L87 Difference]: Start difference. First operand 235 states and 273 transitions. Second operand 5 states. [2018-04-12 01:12:05,307 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-12 01:12:05,307 INFO L93 Difference]: Finished difference Result 425 states and 495 transitions. [2018-04-12 01:12:05,307 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-04-12 01:12:05,307 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 18 [2018-04-12 01:12:05,308 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-12 01:12:05,309 INFO L225 Difference]: With dead ends: 425 [2018-04-12 01:12:05,309 INFO L226 Difference]: Without dead ends: 425 [2018-04-12 01:12:05,309 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2018-04-12 01:12:05,309 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 425 states. [2018-04-12 01:12:05,312 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 425 to 234. [2018-04-12 01:12:05,312 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 234 states. [2018-04-12 01:12:05,313 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 234 states to 234 states and 271 transitions. [2018-04-12 01:12:05,313 INFO L78 Accepts]: Start accepts. Automaton has 234 states and 271 transitions. Word has length 18 [2018-04-12 01:12:05,313 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-12 01:12:05,313 INFO L459 AbstractCegarLoop]: Abstraction has 234 states and 271 transitions. [2018-04-12 01:12:05,313 INFO L460 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-04-12 01:12:05,313 INFO L276 IsEmpty]: Start isEmpty. Operand 234 states and 271 transitions. [2018-04-12 01:12:05,313 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2018-04-12 01:12:05,313 INFO L347 BasicCegarLoop]: Found error trace [2018-04-12 01:12:05,313 INFO L355 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-12 01:12:05,313 INFO L408 AbstractCegarLoop]: === Iteration 7 === [mainErr51RequiresViolation, mainErr69RequiresViolation, mainErr26RequiresViolation, mainErr54RequiresViolation, mainErr66RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr31RequiresViolation, mainErr46RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr58RequiresViolation, mainErr62RequiresViolation, mainErr15RequiresViolation, mainErr49RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr55RequiresViolation, mainErr65RequiresViolation, mainErr17RequiresViolation, mainErr42RequiresViolation, mainErr71AssertViolationMEMORY_FREE, mainErr30RequiresViolation, mainErr11RequiresViolation, mainErr57RequiresViolation, mainErr63RequiresViolation, mainErr24RequiresViolation, mainErr44RequiresViolation, mainErr10RequiresViolation, mainErr43RequiresViolation, mainErr4RequiresViolation, mainErr50RequiresViolation, mainErr72EnsuresViolationMEMORY_LEAK, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr61RequiresViolation, mainErr59RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr70AssertViolationMEMORY_FREE, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr56RequiresViolation, mainErr64RequiresViolation, mainErr48RequiresViolation, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr52RequiresViolation, mainErr68RequiresViolation, mainErr45RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr60RequiresViolation, mainErr9RequiresViolation, mainErr67RequiresViolation, mainErr53RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr34RequiresViolation, mainErr47RequiresViolation, mainErr14RequiresViolation, mainErr40RequiresViolation]=== [2018-04-12 01:12:05,314 INFO L82 PathProgramCache]: Analyzing trace with hash -287335223, now seen corresponding path program 1 times [2018-04-12 01:12:05,314 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-04-12 01:12:05,314 INFO L68 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-04-12 01:12:05,314 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-12 01:12:05,315 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-12 01:12:05,315 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-12 01:12:05,322 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-12 01:12:05,323 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-12 01:12:05,397 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-12 01:12:05,398 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-04-12 01:12:05,398 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2018-04-12 01:12:05,398 INFO L442 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-04-12 01:12:05,398 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-04-12 01:12:05,398 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2018-04-12 01:12:05,399 INFO L87 Difference]: Start difference. First operand 234 states and 271 transitions. Second operand 9 states. [2018-04-12 01:12:05,785 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-12 01:12:05,785 INFO L93 Difference]: Finished difference Result 240 states and 274 transitions. [2018-04-12 01:12:05,785 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-04-12 01:12:05,786 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2018-04-12 01:12:05,786 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-12 01:12:05,787 INFO L225 Difference]: With dead ends: 240 [2018-04-12 01:12:05,787 INFO L226 Difference]: Without dead ends: 240 [2018-04-12 01:12:05,787 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 1 SyntacticMatches, 2 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=58, Invalid=124, Unknown=0, NotChecked=0, Total=182 [2018-04-12 01:12:05,787 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 240 states. [2018-04-12 01:12:05,790 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 240 to 233. [2018-04-12 01:12:05,790 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 233 states. [2018-04-12 01:12:05,791 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 233 states to 233 states and 270 transitions. [2018-04-12 01:12:05,791 INFO L78 Accepts]: Start accepts. Automaton has 233 states and 270 transitions. Word has length 22 [2018-04-12 01:12:05,792 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-12 01:12:05,792 INFO L459 AbstractCegarLoop]: Abstraction has 233 states and 270 transitions. [2018-04-12 01:12:05,792 INFO L460 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-04-12 01:12:05,792 INFO L276 IsEmpty]: Start isEmpty. Operand 233 states and 270 transitions. [2018-04-12 01:12:05,792 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2018-04-12 01:12:05,792 INFO L347 BasicCegarLoop]: Found error trace [2018-04-12 01:12:05,792 INFO L355 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-12 01:12:05,792 INFO L408 AbstractCegarLoop]: === Iteration 8 === [mainErr51RequiresViolation, mainErr69RequiresViolation, mainErr26RequiresViolation, mainErr54RequiresViolation, mainErr66RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr31RequiresViolation, mainErr46RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr58RequiresViolation, mainErr62RequiresViolation, mainErr15RequiresViolation, mainErr49RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr55RequiresViolation, mainErr65RequiresViolation, mainErr17RequiresViolation, mainErr42RequiresViolation, mainErr71AssertViolationMEMORY_FREE, mainErr30RequiresViolation, mainErr11RequiresViolation, mainErr57RequiresViolation, mainErr63RequiresViolation, mainErr24RequiresViolation, mainErr44RequiresViolation, mainErr10RequiresViolation, mainErr43RequiresViolation, mainErr4RequiresViolation, mainErr50RequiresViolation, mainErr72EnsuresViolationMEMORY_LEAK, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr61RequiresViolation, mainErr59RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr70AssertViolationMEMORY_FREE, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr56RequiresViolation, mainErr64RequiresViolation, mainErr48RequiresViolation, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr52RequiresViolation, mainErr68RequiresViolation, mainErr45RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr60RequiresViolation, mainErr9RequiresViolation, mainErr67RequiresViolation, mainErr53RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr34RequiresViolation, mainErr47RequiresViolation, mainErr14RequiresViolation, mainErr40RequiresViolation]=== [2018-04-12 01:12:05,793 INFO L82 PathProgramCache]: Analyzing trace with hash -287335222, now seen corresponding path program 1 times [2018-04-12 01:12:05,793 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-04-12 01:12:05,793 INFO L68 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-04-12 01:12:05,794 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-12 01:12:05,794 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-12 01:12:05,794 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-12 01:12:05,803 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-12 01:12:05,804 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-12 01:12:05,909 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-12 01:12:05,909 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-04-12 01:12:05,910 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2018-04-12 01:12:05,910 INFO L442 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-04-12 01:12:05,910 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-04-12 01:12:05,910 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=71, Unknown=0, NotChecked=0, Total=90 [2018-04-12 01:12:05,910 INFO L87 Difference]: Start difference. First operand 233 states and 270 transitions. Second operand 10 states. [2018-04-12 01:12:06,438 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-12 01:12:06,438 INFO L93 Difference]: Finished difference Result 236 states and 270 transitions. [2018-04-12 01:12:06,438 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2018-04-12 01:12:06,438 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 22 [2018-04-12 01:12:06,439 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-12 01:12:06,440 INFO L225 Difference]: With dead ends: 236 [2018-04-12 01:12:06,440 INFO L226 Difference]: Without dead ends: 236 [2018-04-12 01:12:06,441 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 20 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=129, Invalid=291, Unknown=0, NotChecked=0, Total=420 [2018-04-12 01:12:06,441 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 236 states. [2018-04-12 01:12:06,444 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 236 to 218. [2018-04-12 01:12:06,444 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 218 states. [2018-04-12 01:12:06,445 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 218 states to 218 states and 254 transitions. [2018-04-12 01:12:06,445 INFO L78 Accepts]: Start accepts. Automaton has 218 states and 254 transitions. Word has length 22 [2018-04-12 01:12:06,446 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-12 01:12:06,446 INFO L459 AbstractCegarLoop]: Abstraction has 218 states and 254 transitions. [2018-04-12 01:12:06,446 INFO L460 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-04-12 01:12:06,446 INFO L276 IsEmpty]: Start isEmpty. Operand 218 states and 254 transitions. [2018-04-12 01:12:06,446 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2018-04-12 01:12:06,446 INFO L347 BasicCegarLoop]: Found error trace [2018-04-12 01:12:06,447 INFO L355 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-12 01:12:06,447 INFO L408 AbstractCegarLoop]: === Iteration 9 === [mainErr51RequiresViolation, mainErr69RequiresViolation, mainErr26RequiresViolation, mainErr54RequiresViolation, mainErr66RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr31RequiresViolation, mainErr46RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr58RequiresViolation, mainErr62RequiresViolation, mainErr15RequiresViolation, mainErr49RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr55RequiresViolation, mainErr65RequiresViolation, mainErr17RequiresViolation, mainErr42RequiresViolation, mainErr71AssertViolationMEMORY_FREE, mainErr30RequiresViolation, mainErr11RequiresViolation, mainErr57RequiresViolation, mainErr63RequiresViolation, mainErr24RequiresViolation, mainErr44RequiresViolation, mainErr10RequiresViolation, mainErr43RequiresViolation, mainErr4RequiresViolation, mainErr50RequiresViolation, mainErr72EnsuresViolationMEMORY_LEAK, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr61RequiresViolation, mainErr59RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr70AssertViolationMEMORY_FREE, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr56RequiresViolation, mainErr64RequiresViolation, mainErr48RequiresViolation, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr52RequiresViolation, mainErr68RequiresViolation, mainErr45RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr60RequiresViolation, mainErr9RequiresViolation, mainErr67RequiresViolation, mainErr53RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr34RequiresViolation, mainErr47RequiresViolation, mainErr14RequiresViolation, mainErr40RequiresViolation]=== [2018-04-12 01:12:06,447 INFO L82 PathProgramCache]: Analyzing trace with hash 1793562549, now seen corresponding path program 1 times [2018-04-12 01:12:06,447 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-04-12 01:12:06,447 INFO L68 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-04-12 01:12:06,448 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-12 01:12:06,448 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-12 01:12:06,448 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-12 01:12:06,455 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-12 01:12:06,456 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-12 01:12:06,479 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-12 01:12:06,479 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-04-12 01:12:06,479 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-04-12 01:12:06,479 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-04-12 01:12:06,479 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-04-12 01:12:06,479 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-04-12 01:12:06,479 INFO L87 Difference]: Start difference. First operand 218 states and 254 transitions. Second operand 3 states. [2018-04-12 01:12:06,497 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-12 01:12:06,497 INFO L93 Difference]: Finished difference Result 259 states and 298 transitions. [2018-04-12 01:12:06,497 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-04-12 01:12:06,497 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 25 [2018-04-12 01:12:06,497 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-12 01:12:06,498 INFO L225 Difference]: With dead ends: 259 [2018-04-12 01:12:06,498 INFO L226 Difference]: Without dead ends: 259 [2018-04-12 01:12:06,498 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-04-12 01:12:06,499 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 259 states. [2018-04-12 01:12:06,500 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 259 to 232. [2018-04-12 01:12:06,500 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 232 states. [2018-04-12 01:12:06,501 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 232 states to 232 states and 269 transitions. [2018-04-12 01:12:06,501 INFO L78 Accepts]: Start accepts. Automaton has 232 states and 269 transitions. Word has length 25 [2018-04-12 01:12:06,501 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-12 01:12:06,501 INFO L459 AbstractCegarLoop]: Abstraction has 232 states and 269 transitions. [2018-04-12 01:12:06,501 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-04-12 01:12:06,501 INFO L276 IsEmpty]: Start isEmpty. Operand 232 states and 269 transitions. [2018-04-12 01:12:06,502 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2018-04-12 01:12:06,502 INFO L347 BasicCegarLoop]: Found error trace [2018-04-12 01:12:06,502 INFO L355 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-12 01:12:06,502 INFO L408 AbstractCegarLoop]: === Iteration 10 === [mainErr51RequiresViolation, mainErr69RequiresViolation, mainErr26RequiresViolation, mainErr54RequiresViolation, mainErr66RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr31RequiresViolation, mainErr46RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr58RequiresViolation, mainErr62RequiresViolation, mainErr15RequiresViolation, mainErr49RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr55RequiresViolation, mainErr65RequiresViolation, mainErr17RequiresViolation, mainErr42RequiresViolation, mainErr71AssertViolationMEMORY_FREE, mainErr30RequiresViolation, mainErr11RequiresViolation, mainErr57RequiresViolation, mainErr63RequiresViolation, mainErr24RequiresViolation, mainErr44RequiresViolation, mainErr10RequiresViolation, mainErr43RequiresViolation, mainErr4RequiresViolation, mainErr50RequiresViolation, mainErr72EnsuresViolationMEMORY_LEAK, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr61RequiresViolation, mainErr59RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr70AssertViolationMEMORY_FREE, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr56RequiresViolation, mainErr64RequiresViolation, mainErr48RequiresViolation, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr52RequiresViolation, mainErr68RequiresViolation, mainErr45RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr60RequiresViolation, mainErr9RequiresViolation, mainErr67RequiresViolation, mainErr53RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr34RequiresViolation, mainErr47RequiresViolation, mainErr14RequiresViolation, mainErr40RequiresViolation]=== [2018-04-12 01:12:06,503 INFO L82 PathProgramCache]: Analyzing trace with hash -2135914195, now seen corresponding path program 1 times [2018-04-12 01:12:06,503 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-04-12 01:12:06,503 INFO L68 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-04-12 01:12:06,504 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-12 01:12:06,504 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-12 01:12:06,504 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-12 01:12:06,518 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-12 01:12:06,519 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-12 01:12:06,819 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-12 01:12:06,820 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-04-12 01:12:06,820 INFO L213 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-04-12 01:12:06,830 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-12 01:12:06,851 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-12 01:12:06,857 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-12 01:12:06,910 INFO L700 Elim1Store]: detected not equals via solver [2018-04-12 01:12:06,910 INFO L700 Elim1Store]: detected not equals via solver [2018-04-12 01:12:06,914 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 21 [2018-04-12 01:12:06,914 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-12 01:12:06,920 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-12 01:12:06,920 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:23, output treesize:21 [2018-04-12 01:12:06,948 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 8 [2018-04-12 01:12:06,950 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-04-12 01:12:06,951 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-12 01:12:06,952 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-12 01:12:06,960 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-04-12 01:12:06,961 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:32, output treesize:29 [2018-04-12 01:12:07,006 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 39 treesize of output 43 [2018-04-12 01:12:07,008 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 13 [2018-04-12 01:12:07,008 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-12 01:12:07,013 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-12 01:12:07,020 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-04-12 01:12:07,020 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:50, output treesize:42 [2018-04-12 01:12:07,129 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 50 treesize of output 40 [2018-04-12 01:12:07,145 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 2 case distinctions, treesize of input 20 treesize of output 31 [2018-04-12 01:12:07,145 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 2 xjuncts. [2018-04-12 01:12:07,154 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-04-12 01:12:07,166 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: 3 dim-0 vars, and 2 xjuncts. [2018-04-12 01:12:07,166 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:55, output treesize:84 [2018-04-12 01:12:21,229 WARN L148 SmtUtils]: Spent 14035ms on a formula simplification that was a NOOP. DAG size: 33 [2018-04-12 01:12:35,278 WARN L148 SmtUtils]: Spent 14015ms on a formula simplification that was a NOOP. DAG size: 33 [2018-04-12 01:12:35,305 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 43 treesize of output 31 [2018-04-12 01:12:35,307 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 10 [2018-04-12 01:12:35,307 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-12 01:12:35,312 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 1 [2018-04-12 01:12:35,312 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-04-12 01:12:35,315 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-12 01:12:35,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 54 treesize of output 36 [2018-04-12 01:12:35,330 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 10 [2018-04-12 01:12:35,330 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2018-04-12 01:12:35,339 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 13 treesize of output 10 [2018-04-12 01:12:35,339 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 2 xjuncts. [2018-04-12 01:12:35,345 INFO L267 ElimStorePlain]: Start of recursive call 5: 2 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-04-12 01:12:35,359 INFO L267 ElimStorePlain]: Start of recursive call 1: 7 dim-0 vars, 2 dim-2 vars, End of recursive call: 2 dim-0 vars, and 3 xjuncts. [2018-04-12 01:12:35,359 INFO L202 ElimStorePlain]: Needed 7 recursive calls to eliminate 9 variables, input treesize:98, output treesize:46 [2018-04-12 01:12:35,432 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-12 01:12:35,459 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-04-12 01:12:35,460 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [21, 12] total 32 [2018-04-12 01:12:35,460 INFO L442 AbstractCegarLoop]: Interpolant automaton has 33 states [2018-04-12 01:12:35,460 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 33 interpolants. [2018-04-12 01:12:35,460 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=117, Invalid=939, Unknown=0, NotChecked=0, Total=1056 [2018-04-12 01:12:35,460 INFO L87 Difference]: Start difference. First operand 232 states and 269 transitions. Second operand 33 states. [2018-04-12 01:13:12,234 WARN L151 SmtUtils]: Spent 36142ms on a formula simplification. DAG size of input: 78 DAG size of output 63 [2018-04-12 01:13:34,367 WARN L151 SmtUtils]: Spent 22049ms on a formula simplification. DAG size of input: 85 DAG size of output 43 [2018-04-12 01:13:58,601 WARN L151 SmtUtils]: Spent 22060ms on a formula simplification. DAG size of input: 95 DAG size of output 45 [2018-04-12 01:14:20,718 WARN L151 SmtUtils]: Spent 22060ms on a formula simplification. DAG size of input: 102 DAG size of output 47 [2018-04-12 01:14:42,861 WARN L151 SmtUtils]: Spent 22073ms on a formula simplification. DAG size of input: 109 DAG size of output 50 [2018-04-12 01:15:07,059 WARN L151 SmtUtils]: Spent 24065ms on a formula simplification. DAG size of input: 61 DAG size of output 52 [2018-04-12 01:15:31,218 WARN L151 SmtUtils]: Spent 24062ms on a formula simplification. DAG size of input: 68 DAG size of output 59 [2018-04-12 01:15:55,331 WARN L151 SmtUtils]: Spent 24063ms on a formula simplification. DAG size of input: 73 DAG size of output 56 [2018-04-12 01:16:19,439 WARN L151 SmtUtils]: Spent 24060ms on a formula simplification. DAG size of input: 68 DAG size of output 55 [2018-04-12 01:16:43,581 WARN L151 SmtUtils]: Spent 24041ms on a formula simplification. DAG size of input: 48 DAG size of output 39 [2018-04-12 01:17:07,767 WARN L151 SmtUtils]: Spent 24047ms on a formula simplification. DAG size of input: 56 DAG size of output 47 [2018-04-12 01:17:31,916 WARN L151 SmtUtils]: Spent 24048ms on a formula simplification. DAG size of input: 61 DAG size of output 44 [2018-04-12 01:17:56,073 WARN L151 SmtUtils]: Spent 24069ms on a formula simplification. DAG size of input: 58 DAG size of output 42 [2018-04-12 01:17:56,832 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-12 01:17:56,832 INFO L93 Difference]: Finished difference Result 471 states and 520 transitions. [2018-04-12 01:17:56,832 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 47 states. [2018-04-12 01:17:56,832 INFO L78 Accepts]: Start accepts. Automaton has 33 states. Word has length 40 [2018-04-12 01:17:56,832 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-12 01:17:56,834 INFO L225 Difference]: With dead ends: 471 [2018-04-12 01:17:56,834 INFO L226 Difference]: Without dead ends: 471 [2018-04-12 01:17:56,835 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 105 GetRequests, 31 SyntacticMatches, 0 SemanticMatches, 74 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1525 ImplicationChecksByTransitivity, 346.7s TimeCoverageRelationStatistics Valid=1012, Invalid=4688, Unknown=0, NotChecked=0, Total=5700 [2018-04-12 01:17:56,836 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 471 states. [2018-04-12 01:17:56,840 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 471 to 261. [2018-04-12 01:17:56,840 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 261 states. [2018-04-12 01:17:56,841 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 261 states to 261 states and 301 transitions. [2018-04-12 01:17:56,841 INFO L78 Accepts]: Start accepts. Automaton has 261 states and 301 transitions. Word has length 40 [2018-04-12 01:17:56,841 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-12 01:17:56,841 INFO L459 AbstractCegarLoop]: Abstraction has 261 states and 301 transitions. [2018-04-12 01:17:56,841 INFO L460 AbstractCegarLoop]: Interpolant automaton has 33 states. [2018-04-12 01:17:56,841 INFO L276 IsEmpty]: Start isEmpty. Operand 261 states and 301 transitions. [2018-04-12 01:17:56,842 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2018-04-12 01:17:56,842 INFO L347 BasicCegarLoop]: Found error trace [2018-04-12 01:17:56,842 INFO L355 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-12 01:17:56,843 INFO L408 AbstractCegarLoop]: === Iteration 11 === [mainErr51RequiresViolation, mainErr69RequiresViolation, mainErr26RequiresViolation, mainErr54RequiresViolation, mainErr66RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr31RequiresViolation, mainErr46RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr58RequiresViolation, mainErr62RequiresViolation, mainErr15RequiresViolation, mainErr49RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr55RequiresViolation, mainErr65RequiresViolation, mainErr17RequiresViolation, mainErr42RequiresViolation, mainErr71AssertViolationMEMORY_FREE, mainErr30RequiresViolation, mainErr11RequiresViolation, mainErr57RequiresViolation, mainErr63RequiresViolation, mainErr24RequiresViolation, mainErr44RequiresViolation, mainErr10RequiresViolation, mainErr43RequiresViolation, mainErr4RequiresViolation, mainErr50RequiresViolation, mainErr72EnsuresViolationMEMORY_LEAK, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr61RequiresViolation, mainErr59RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr70AssertViolationMEMORY_FREE, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr56RequiresViolation, mainErr64RequiresViolation, mainErr48RequiresViolation, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr52RequiresViolation, mainErr68RequiresViolation, mainErr45RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr60RequiresViolation, mainErr9RequiresViolation, mainErr67RequiresViolation, mainErr53RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr34RequiresViolation, mainErr47RequiresViolation, mainErr14RequiresViolation, mainErr40RequiresViolation]=== [2018-04-12 01:17:56,843 INFO L82 PathProgramCache]: Analyzing trace with hash -2135914194, now seen corresponding path program 1 times [2018-04-12 01:17:56,843 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-04-12 01:17:56,843 INFO L68 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-04-12 01:17:56,844 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-12 01:17:56,844 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-12 01:17:56,844 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-12 01:17:56,857 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-12 01:17:56,858 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-12 01:17:57,182 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-12 01:17:57,182 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-04-12 01:17:57,183 INFO L213 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-04-12 01:17:57,188 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-12 01:17:57,203 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-12 01:17:57,205 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-12 01:17:57,231 INFO L700 Elim1Store]: detected not equals via solver [2018-04-12 01:17:57,232 INFO L700 Elim1Store]: detected not equals via solver [2018-04-12 01:17:57,232 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 4 [2018-04-12 01:17:57,232 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-12 01:17:57,263 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-04-12 01:17:57,263 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-12 01:17:57,268 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-12 01:17:57,268 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:26, output treesize:19 [2018-04-12 01:17:57,285 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 8 [2018-04-12 01:17:57,287 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-04-12 01:17:57,287 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-12 01:17:57,288 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-12 01:17:57,296 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 8 [2018-04-12 01:17:57,297 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-04-12 01:17:57,297 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-04-12 01:17:57,299 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-12 01:17:57,304 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-04-12 01:17:57,304 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 3 variables, input treesize:38, output treesize:31 [2018-04-12 01:17:57,342 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 60 treesize of output 64 [2018-04-12 01:17:57,344 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 13 [2018-04-12 01:17:57,344 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-12 01:17:57,350 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-12 01:17:57,360 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-12 01:17:57,361 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 13 [2018-04-12 01:17:57,361 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-04-12 01:17:57,365 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-12 01:17:57,371 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-04-12 01:17:57,372 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 3 variables, input treesize:73, output treesize:57 [2018-04-12 01:17:57,503 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 82 treesize of output 72 [2018-04-12 01:17:57,510 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 2 case distinctions, treesize of input 20 treesize of output 31 [2018-04-12 01:17:57,511 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 2 xjuncts. [2018-04-12 01:17:57,521 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-04-12 01:17:57,548 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 73 treesize of output 60 [2018-04-12 01:17:57,552 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 17 [2018-04-12 01:17:57,553 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-04-12 01:17:57,576 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-12 01:17:57,580 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 81 treesize of output 68 [2018-04-12 01:17:57,589 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 2 case distinctions, treesize of input 20 treesize of output 31 [2018-04-12 01:17:57,590 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 2 xjuncts. [2018-04-12 01:17:57,604 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-04-12 01:17:57,627 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-2 vars, End of recursive call: 3 dim-0 vars, and 2 xjuncts. [2018-04-12 01:17:57,627 INFO L202 ElimStorePlain]: Needed 7 recursive calls to eliminate 4 variables, input treesize:89, output treesize:125 [2018-04-12 01:18:11,690 WARN L148 SmtUtils]: Spent 14031ms on a formula simplification that was a NOOP. DAG size: 45 [2018-04-12 01:18:25,783 WARN L148 SmtUtils]: Spent 14020ms on a formula simplification that was a NOOP. DAG size: 45 [2018-04-12 01:18:25,816 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 65 treesize of output 55 [2018-04-12 01:18:25,818 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 3 [2018-04-12 01:18:25,818 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-12 01:18:25,828 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 1 [2018-04-12 01:18:25,828 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-04-12 01:18:25,837 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-12 01:18:25,858 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 87 treesize of output 65 [2018-04-12 01:18:25,860 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 39 treesize of output 26 [2018-04-12 01:18:25,860 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2018-04-12 01:18:25,873 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 13 treesize of output 10 [2018-04-12 01:18:25,873 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 2 xjuncts. [2018-04-12 01:18:25,883 INFO L267 ElimStorePlain]: Start of recursive call 5: 2 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-04-12 01:18:25,909 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 38 [2018-04-12 01:18:25,910 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 3 [2018-04-12 01:18:25,911 INFO L267 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 1 xjuncts. [2018-04-12 01:18:25,917 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 6 [2018-04-12 01:18:25,918 INFO L267 ElimStorePlain]: Start of recursive call 10: End of recursive call: and 1 xjuncts. [2018-04-12 01:18:25,921 INFO L267 ElimStorePlain]: Start of recursive call 8: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-12 01:18:25,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 43 treesize of output 35 [2018-04-12 01:18:25,927 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 13 treesize of output 10 [2018-04-12 01:18:25,927 INFO L267 ElimStorePlain]: Start of recursive call 12: End of recursive call: and 2 xjuncts. [2018-04-12 01:18:25,934 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 3 [2018-04-12 01:18:25,934 INFO L267 ElimStorePlain]: Start of recursive call 13: End of recursive call: and 1 xjuncts. [2018-04-12 01:18:25,940 INFO L267 ElimStorePlain]: Start of recursive call 11: 2 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-04-12 01:18:25,957 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 29 [2018-04-12 01:18:25,958 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 10 [2018-04-12 01:18:25,958 INFO L267 ElimStorePlain]: Start of recursive call 15: End of recursive call: and 1 xjuncts. [2018-04-12 01:18:25,962 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 1 [2018-04-12 01:18:25,962 INFO L267 ElimStorePlain]: Start of recursive call 16: End of recursive call: and 1 xjuncts. [2018-04-12 01:18:25,965 INFO L267 ElimStorePlain]: Start of recursive call 14: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-12 01:18:25,976 INFO L267 ElimStorePlain]: Start of recursive call 1: 7 dim-0 vars, 4 dim-2 vars, End of recursive call: and 2 xjuncts. [2018-04-12 01:18:25,976 INFO L202 ElimStorePlain]: Needed 16 recursive calls to eliminate 11 variables, input treesize:153, output treesize:23 [2018-04-12 01:18:26,004 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-12 01:18:26,021 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-04-12 01:18:26,021 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [19, 12] total 30 [2018-04-12 01:18:26,022 INFO L442 AbstractCegarLoop]: Interpolant automaton has 31 states [2018-04-12 01:18:26,022 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 31 interpolants. [2018-04-12 01:18:26,022 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=112, Invalid=818, Unknown=0, NotChecked=0, Total=930 [2018-04-12 01:18:26,022 INFO L87 Difference]: Start difference. First operand 261 states and 301 transitions. Second operand 31 states. [2018-04-12 01:18:50,714 WARN L151 SmtUtils]: Spent 24118ms on a formula simplification. DAG size of input: 77 DAG size of output 75 [2018-04-12 01:19:18,980 WARN L151 SmtUtils]: Spent 28062ms on a formula simplification. DAG size of input: 95 DAG size of output 57 [2018-04-12 01:19:47,140 WARN L151 SmtUtils]: Spent 28077ms on a formula simplification. DAG size of input: 103 DAG size of output 63 [2018-04-12 01:20:15,415 WARN L151 SmtUtils]: Spent 28205ms on a formula simplification. DAG size of input: 108 DAG size of output 68 [2018-04-12 01:20:43,569 WARN L151 SmtUtils]: Spent 28072ms on a formula simplification. DAG size of input: 62 DAG size of output 61 [2018-04-12 01:21:11,767 WARN L151 SmtUtils]: Spent 28087ms on a formula simplification. DAG size of input: 73 DAG size of output 72 [2018-04-12 01:21:39,899 WARN L151 SmtUtils]: Spent 28078ms on a formula simplification. DAG size of input: 69 DAG size of output 68 [2018-04-12 01:21:54,065 WARN L148 SmtUtils]: Spent 14028ms on a formula simplification that was a NOOP. DAG size: 53 [2018-04-12 01:22:08,248 WARN L148 SmtUtils]: Spent 14030ms on a formula simplification that was a NOOP. DAG size: 65 [2018-04-12 01:22:22,385 WARN L148 SmtUtils]: Spent 14029ms on a formula simplification that was a NOOP. DAG size: 61 [2018-04-12 01:22:23,135 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-12 01:22:23,135 INFO L93 Difference]: Finished difference Result 464 states and 513 transitions. [2018-04-12 01:22:23,135 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 40 states. [2018-04-12 01:22:23,135 INFO L78 Accepts]: Start accepts. Automaton has 31 states. Word has length 40 [2018-04-12 01:22:23,135 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-12 01:22:23,136 INFO L225 Difference]: With dead ends: 464 [2018-04-12 01:22:23,136 INFO L226 Difference]: Without dead ends: 464 [2018-04-12 01:22:23,137 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 97 GetRequests, 31 SyntacticMatches, 0 SemanticMatches, 66 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1211 ImplicationChecksByTransitivity, 264.4s TimeCoverageRelationStatistics Valid=857, Invalid=3699, Unknown=0, NotChecked=0, Total=4556 [2018-04-12 01:22:23,137 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 464 states. [2018-04-12 01:22:23,140 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 464 to 261. [2018-04-12 01:22:23,140 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 261 states. [2018-04-12 01:22:23,140 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 261 states to 261 states and 300 transitions. [2018-04-12 01:22:23,140 INFO L78 Accepts]: Start accepts. Automaton has 261 states and 300 transitions. Word has length 40 [2018-04-12 01:22:23,141 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-12 01:22:23,141 INFO L459 AbstractCegarLoop]: Abstraction has 261 states and 300 transitions. [2018-04-12 01:22:23,141 INFO L460 AbstractCegarLoop]: Interpolant automaton has 31 states. [2018-04-12 01:22:23,141 INFO L276 IsEmpty]: Start isEmpty. Operand 261 states and 300 transitions. [2018-04-12 01:22:23,141 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2018-04-12 01:22:23,141 INFO L347 BasicCegarLoop]: Found error trace [2018-04-12 01:22:23,141 INFO L355 BasicCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-12 01:22:23,142 INFO L408 AbstractCegarLoop]: === Iteration 12 === [mainErr51RequiresViolation, mainErr69RequiresViolation, mainErr26RequiresViolation, mainErr54RequiresViolation, mainErr66RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr31RequiresViolation, mainErr46RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr58RequiresViolation, mainErr62RequiresViolation, mainErr15RequiresViolation, mainErr49RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr55RequiresViolation, mainErr65RequiresViolation, mainErr17RequiresViolation, mainErr42RequiresViolation, mainErr71AssertViolationMEMORY_FREE, mainErr30RequiresViolation, mainErr11RequiresViolation, mainErr57RequiresViolation, mainErr63RequiresViolation, mainErr24RequiresViolation, mainErr44RequiresViolation, mainErr10RequiresViolation, mainErr43RequiresViolation, mainErr4RequiresViolation, mainErr50RequiresViolation, mainErr72EnsuresViolationMEMORY_LEAK, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr61RequiresViolation, mainErr59RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr70AssertViolationMEMORY_FREE, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr56RequiresViolation, mainErr64RequiresViolation, mainErr48RequiresViolation, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr52RequiresViolation, mainErr68RequiresViolation, mainErr45RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr60RequiresViolation, mainErr9RequiresViolation, mainErr67RequiresViolation, mainErr53RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr34RequiresViolation, mainErr47RequiresViolation, mainErr14RequiresViolation, mainErr40RequiresViolation]=== [2018-04-12 01:22:23,142 INFO L82 PathProgramCache]: Analyzing trace with hash -808260317, now seen corresponding path program 1 times [2018-04-12 01:22:23,142 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-04-12 01:22:23,142 INFO L68 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-04-12 01:22:23,142 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-12 01:22:23,143 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-12 01:22:23,143 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-12 01:22:23,149 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-12 01:22:23,149 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-12 01:22:23,169 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2018-04-12 01:22:23,169 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-04-12 01:22:23,169 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-04-12 01:22:23,170 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-04-12 01:22:23,170 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-04-12 01:22:23,170 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-04-12 01:22:23,170 INFO L87 Difference]: Start difference. First operand 261 states and 300 transitions. Second operand 3 states. [2018-04-12 01:22:23,176 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-12 01:22:23,176 INFO L93 Difference]: Finished difference Result 263 states and 302 transitions. [2018-04-12 01:22:23,176 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-04-12 01:22:23,176 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 43 [2018-04-12 01:22:23,177 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-12 01:22:23,177 INFO L225 Difference]: With dead ends: 263 [2018-04-12 01:22:23,177 INFO L226 Difference]: Without dead ends: 263 [2018-04-12 01:22:23,178 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-04-12 01:22:23,178 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 263 states. [2018-04-12 01:22:23,181 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 263 to 263. [2018-04-12 01:22:23,181 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 263 states. [2018-04-12 01:22:23,181 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 263 states to 263 states and 302 transitions. [2018-04-12 01:22:23,182 INFO L78 Accepts]: Start accepts. Automaton has 263 states and 302 transitions. Word has length 43 [2018-04-12 01:22:23,182 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-12 01:22:23,182 INFO L459 AbstractCegarLoop]: Abstraction has 263 states and 302 transitions. [2018-04-12 01:22:23,182 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-04-12 01:22:23,182 INFO L276 IsEmpty]: Start isEmpty. Operand 263 states and 302 transitions. [2018-04-12 01:22:23,183 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2018-04-12 01:22:23,183 INFO L347 BasicCegarLoop]: Found error trace [2018-04-12 01:22:23,183 INFO L355 BasicCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-12 01:22:23,183 INFO L408 AbstractCegarLoop]: === Iteration 13 === [mainErr51RequiresViolation, mainErr69RequiresViolation, mainErr26RequiresViolation, mainErr54RequiresViolation, mainErr66RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr31RequiresViolation, mainErr46RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr58RequiresViolation, mainErr62RequiresViolation, mainErr15RequiresViolation, mainErr49RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr55RequiresViolation, mainErr65RequiresViolation, mainErr17RequiresViolation, mainErr42RequiresViolation, mainErr71AssertViolationMEMORY_FREE, mainErr30RequiresViolation, mainErr11RequiresViolation, mainErr57RequiresViolation, mainErr63RequiresViolation, mainErr24RequiresViolation, mainErr44RequiresViolation, mainErr10RequiresViolation, mainErr43RequiresViolation, mainErr4RequiresViolation, mainErr50RequiresViolation, mainErr72EnsuresViolationMEMORY_LEAK, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr61RequiresViolation, mainErr59RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr70AssertViolationMEMORY_FREE, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr56RequiresViolation, mainErr64RequiresViolation, mainErr48RequiresViolation, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr52RequiresViolation, mainErr68RequiresViolation, mainErr45RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr60RequiresViolation, mainErr9RequiresViolation, mainErr67RequiresViolation, mainErr53RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr34RequiresViolation, mainErr47RequiresViolation, mainErr14RequiresViolation, mainErr40RequiresViolation]=== [2018-04-12 01:22:23,183 INFO L82 PathProgramCache]: Analyzing trace with hash 1074525530, now seen corresponding path program 1 times [2018-04-12 01:22:23,183 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-04-12 01:22:23,183 INFO L68 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-04-12 01:22:23,184 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-12 01:22:23,184 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-12 01:22:23,184 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-12 01:22:23,192 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-12 01:22:23,193 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-12 01:22:23,223 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2018-04-12 01:22:23,223 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-04-12 01:22:23,223 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-04-12 01:22:23,224 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-04-12 01:22:23,224 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-04-12 01:22:23,224 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-04-12 01:22:23,224 INFO L87 Difference]: Start difference. First operand 263 states and 302 transitions. Second operand 6 states. [2018-04-12 01:22:23,459 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-12 01:22:23,459 INFO L93 Difference]: Finished difference Result 297 states and 343 transitions. [2018-04-12 01:22:23,459 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-04-12 01:22:23,459 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 46 [2018-04-12 01:22:23,460 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-12 01:22:23,461 INFO L225 Difference]: With dead ends: 297 [2018-04-12 01:22:23,461 INFO L226 Difference]: Without dead ends: 297 [2018-04-12 01:22:23,461 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=30, Invalid=60, Unknown=0, NotChecked=0, Total=90 [2018-04-12 01:22:23,461 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 297 states. [2018-04-12 01:22:23,465 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 297 to 262. [2018-04-12 01:22:23,465 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 262 states. [2018-04-12 01:22:23,466 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 262 states to 262 states and 301 transitions. [2018-04-12 01:22:23,466 INFO L78 Accepts]: Start accepts. Automaton has 262 states and 301 transitions. Word has length 46 [2018-04-12 01:22:23,466 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-12 01:22:23,466 INFO L459 AbstractCegarLoop]: Abstraction has 262 states and 301 transitions. [2018-04-12 01:22:23,466 INFO L460 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-04-12 01:22:23,466 INFO L276 IsEmpty]: Start isEmpty. Operand 262 states and 301 transitions. [2018-04-12 01:22:23,467 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2018-04-12 01:22:23,467 INFO L347 BasicCegarLoop]: Found error trace [2018-04-12 01:22:23,467 INFO L355 BasicCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-12 01:22:23,467 INFO L408 AbstractCegarLoop]: === Iteration 14 === [mainErr51RequiresViolation, mainErr69RequiresViolation, mainErr26RequiresViolation, mainErr54RequiresViolation, mainErr66RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr31RequiresViolation, mainErr46RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr58RequiresViolation, mainErr62RequiresViolation, mainErr15RequiresViolation, mainErr49RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr55RequiresViolation, mainErr65RequiresViolation, mainErr17RequiresViolation, mainErr42RequiresViolation, mainErr71AssertViolationMEMORY_FREE, mainErr30RequiresViolation, mainErr11RequiresViolation, mainErr57RequiresViolation, mainErr63RequiresViolation, mainErr24RequiresViolation, mainErr44RequiresViolation, mainErr10RequiresViolation, mainErr43RequiresViolation, mainErr4RequiresViolation, mainErr50RequiresViolation, mainErr72EnsuresViolationMEMORY_LEAK, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr61RequiresViolation, mainErr59RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr70AssertViolationMEMORY_FREE, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr56RequiresViolation, mainErr64RequiresViolation, mainErr48RequiresViolation, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr52RequiresViolation, mainErr68RequiresViolation, mainErr45RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr60RequiresViolation, mainErr9RequiresViolation, mainErr67RequiresViolation, mainErr53RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr34RequiresViolation, mainErr47RequiresViolation, mainErr14RequiresViolation, mainErr40RequiresViolation]=== [2018-04-12 01:22:23,467 INFO L82 PathProgramCache]: Analyzing trace with hash 1074525531, now seen corresponding path program 1 times [2018-04-12 01:22:23,467 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-04-12 01:22:23,468 INFO L68 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-04-12 01:22:23,468 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-12 01:22:23,468 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-12 01:22:23,469 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-12 01:22:23,482 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-12 01:22:23,483 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-12 01:22:23,916 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-12 01:22:23,916 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-04-12 01:22:23,917 INFO L213 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-04-12 01:22:23,925 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-12 01:22:23,947 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-12 01:22:23,950 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-12 01:22:23,995 INFO L700 Elim1Store]: detected not equals via solver [2018-04-12 01:22:23,996 INFO L700 Elim1Store]: detected not equals via solver [2018-04-12 01:22:23,997 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 4 [2018-04-12 01:22:23,997 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-12 01:22:24,010 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-12 01:22:24,010 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:20, output treesize:14 [2018-04-12 01:22:24,028 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 8 [2018-04-12 01:22:24,030 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-04-12 01:22:24,030 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-12 01:22:24,031 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-12 01:22:24,037 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 8 [2018-04-12 01:22:24,038 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-04-12 01:22:24,038 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-04-12 01:22:24,039 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-12 01:22:24,045 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-04-12 01:22:24,045 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 3 variables, input treesize:33, output treesize:22 [2018-04-12 01:22:24,087 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 51 treesize of output 55 [2018-04-12 01:22:24,089 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 13 [2018-04-12 01:22:24,089 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-12 01:22:24,094 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-12 01:22:24,103 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-12 01:22:24,105 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 13 [2018-04-12 01:22:24,105 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-04-12 01:22:24,108 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-12 01:22:24,114 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-04-12 01:22:24,114 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 3 variables, input treesize:64, output treesize:48 [2018-04-12 01:22:24,139 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 42 treesize of output 30 [2018-04-12 01:22:24,141 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 14 [2018-04-12 01:22:24,141 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-12 01:22:24,145 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 1 [2018-04-12 01:22:24,146 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-04-12 01:22:24,147 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-12 01:22:24,150 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-04-12 01:22:24,150 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 2 variables, input treesize:49, output treesize:21 [2018-04-12 01:22:24,187 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 27 [2018-04-12 01:22:24,193 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 2 case distinctions, treesize of input 16 treesize of output 23 [2018-04-12 01:22:24,194 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 2 xjuncts. [2018-04-12 01:22:24,201 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-04-12 01:22:24,210 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-2 vars, End of recursive call: 5 dim-0 vars, and 2 xjuncts. [2018-04-12 01:22:24,210 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:32, output treesize:50 [2018-04-12 01:22:30,455 WARN L148 SmtUtils]: Spent 6154ms on a formula simplification that was a NOOP. DAG size: 34 [2018-04-12 01:22:36,783 WARN L148 SmtUtils]: Spent 6260ms on a formula simplification that was a NOOP. DAG size: 34 [2018-04-12 01:22:46,903 WARN L148 SmtUtils]: Spent 10083ms on a formula simplification that was a NOOP. DAG size: 41 [2018-04-12 01:22:54,990 WARN L148 SmtUtils]: Spent 8056ms on a formula simplification that was a NOOP. DAG size: 42 [2018-04-12 01:22:54,995 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 78 treesize of output 74 [2018-04-12 01:22:54,997 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 37 treesize of output 17 [2018-04-12 01:22:54,997 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-12 01:22:55,003 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-12 01:22:55,019 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 55 treesize of output 41 [2018-04-12 01:22:55,021 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 32 treesize of output 11 [2018-04-12 01:22:55,021 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-04-12 01:22:55,027 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 1 [2018-04-12 01:22:55,027 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2018-04-12 01:22:55,030 INFO L267 ElimStorePlain]: Start of recursive call 4: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-12 01:22:55,043 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 50 treesize of output 46 [2018-04-12 01:22:55,045 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 24 treesize of output 15 [2018-04-12 01:22:55,045 INFO L267 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 1 xjuncts. [2018-04-12 01:22:55,056 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 1 [2018-04-12 01:22:55,056 INFO L267 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 1 xjuncts. [2018-04-12 01:22:55,084 INFO L267 ElimStorePlain]: Start of recursive call 7: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-12 01:22:55,094 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 22 [2018-04-12 01:22:55,095 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2018-04-12 01:22:55,096 INFO L267 ElimStorePlain]: Start of recursive call 11: End of recursive call: and 1 xjuncts. [2018-04-12 01:22:55,099 INFO L267 ElimStorePlain]: Start of recursive call 10: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-12 01:22:55,107 INFO L267 ElimStorePlain]: Start of recursive call 1: 8 dim-0 vars, 4 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-04-12 01:22:55,107 INFO L202 ElimStorePlain]: Needed 11 recursive calls to eliminate 12 variables, input treesize:129, output treesize:11 [2018-04-12 01:22:55,154 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-12 01:22:55,172 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-04-12 01:22:55,172 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [22, 15] total 36 [2018-04-12 01:22:55,172 INFO L442 AbstractCegarLoop]: Interpolant automaton has 37 states [2018-04-12 01:22:55,173 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 37 interpolants. [2018-04-12 01:22:55,173 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=120, Invalid=1212, Unknown=0, NotChecked=0, Total=1332 [2018-04-12 01:22:55,173 INFO L87 Difference]: Start difference. First operand 262 states and 301 transitions. Second operand 37 states. [2018-04-12 01:23:00,159 WARN L151 SmtUtils]: Spent 4230ms on a formula simplification. DAG size of input: 86 DAG size of output 34 [2018-04-12 01:23:02,948 WARN L151 SmtUtils]: Spent 2092ms on a formula simplification. DAG size of input: 105 DAG size of output 56 [2018-04-12 01:23:05,035 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-12 01:23:05,035 INFO L93 Difference]: Finished difference Result 451 states and 495 transitions. [2018-04-12 01:23:05,036 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 37 states. [2018-04-12 01:23:05,036 INFO L78 Accepts]: Start accepts. Automaton has 37 states. Word has length 46 [2018-04-12 01:23:05,036 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-12 01:23:05,037 INFO L225 Difference]: With dead ends: 451 [2018-04-12 01:23:05,037 INFO L226 Difference]: Without dead ends: 451 [2018-04-12 01:23:05,038 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 102 GetRequests, 34 SyntacticMatches, 0 SemanticMatches, 68 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1259 ImplicationChecksByTransitivity, 39.3s TimeCoverageRelationStatistics Valid=885, Invalid=3945, Unknown=0, NotChecked=0, Total=4830 [2018-04-12 01:23:05,038 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 451 states. [2018-04-12 01:23:05,041 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 451 to 266. [2018-04-12 01:23:05,041 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 266 states. [2018-04-12 01:23:05,042 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 266 states to 266 states and 306 transitions. [2018-04-12 01:23:05,042 INFO L78 Accepts]: Start accepts. Automaton has 266 states and 306 transitions. Word has length 46 [2018-04-12 01:23:05,042 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-12 01:23:05,042 INFO L459 AbstractCegarLoop]: Abstraction has 266 states and 306 transitions. [2018-04-12 01:23:05,042 INFO L460 AbstractCegarLoop]: Interpolant automaton has 37 states. [2018-04-12 01:23:05,043 INFO L276 IsEmpty]: Start isEmpty. Operand 266 states and 306 transitions. [2018-04-12 01:23:05,043 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2018-04-12 01:23:05,043 INFO L347 BasicCegarLoop]: Found error trace [2018-04-12 01:23:05,043 INFO L355 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-12 01:23:05,043 INFO L408 AbstractCegarLoop]: === Iteration 15 === [mainErr51RequiresViolation, mainErr69RequiresViolation, mainErr26RequiresViolation, mainErr54RequiresViolation, mainErr66RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr31RequiresViolation, mainErr46RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr58RequiresViolation, mainErr62RequiresViolation, mainErr15RequiresViolation, mainErr49RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr55RequiresViolation, mainErr65RequiresViolation, mainErr17RequiresViolation, mainErr42RequiresViolation, mainErr71AssertViolationMEMORY_FREE, mainErr30RequiresViolation, mainErr11RequiresViolation, mainErr57RequiresViolation, mainErr63RequiresViolation, mainErr24RequiresViolation, mainErr44RequiresViolation, mainErr10RequiresViolation, mainErr43RequiresViolation, mainErr4RequiresViolation, mainErr50RequiresViolation, mainErr72EnsuresViolationMEMORY_LEAK, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr61RequiresViolation, mainErr59RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr70AssertViolationMEMORY_FREE, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr56RequiresViolation, mainErr64RequiresViolation, mainErr48RequiresViolation, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr52RequiresViolation, mainErr68RequiresViolation, mainErr45RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr60RequiresViolation, mainErr9RequiresViolation, mainErr67RequiresViolation, mainErr53RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr34RequiresViolation, mainErr47RequiresViolation, mainErr14RequiresViolation, mainErr40RequiresViolation]=== [2018-04-12 01:23:05,044 INFO L82 PathProgramCache]: Analyzing trace with hash 222607969, now seen corresponding path program 1 times [2018-04-12 01:23:05,044 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-04-12 01:23:05,044 INFO L68 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-04-12 01:23:05,045 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-12 01:23:05,045 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-12 01:23:05,045 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-12 01:23:05,053 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-12 01:23:05,054 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-12 01:23:05,105 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2018-04-12 01:23:05,105 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-04-12 01:23:05,105 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-04-12 01:23:05,105 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-04-12 01:23:05,106 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-04-12 01:23:05,106 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2018-04-12 01:23:05,106 INFO L87 Difference]: Start difference. First operand 266 states and 306 transitions. Second operand 7 states. [2018-04-12 01:23:05,251 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-12 01:23:05,252 INFO L93 Difference]: Finished difference Result 295 states and 341 transitions. [2018-04-12 01:23:05,252 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-04-12 01:23:05,252 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 47 [2018-04-12 01:23:05,252 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-12 01:23:05,253 INFO L225 Difference]: With dead ends: 295 [2018-04-12 01:23:05,253 INFO L226 Difference]: Without dead ends: 295 [2018-04-12 01:23:05,253 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=34, Invalid=76, Unknown=0, NotChecked=0, Total=110 [2018-04-12 01:23:05,253 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 295 states. [2018-04-12 01:23:05,255 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 295 to 276. [2018-04-12 01:23:05,255 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 276 states. [2018-04-12 01:23:05,256 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 276 states to 276 states and 317 transitions. [2018-04-12 01:23:05,256 INFO L78 Accepts]: Start accepts. Automaton has 276 states and 317 transitions. Word has length 47 [2018-04-12 01:23:05,256 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-12 01:23:05,256 INFO L459 AbstractCegarLoop]: Abstraction has 276 states and 317 transitions. [2018-04-12 01:23:05,256 INFO L460 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-04-12 01:23:05,256 INFO L276 IsEmpty]: Start isEmpty. Operand 276 states and 317 transitions. [2018-04-12 01:23:05,256 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2018-04-12 01:23:05,256 INFO L347 BasicCegarLoop]: Found error trace [2018-04-12 01:23:05,256 INFO L355 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-12 01:23:05,256 INFO L408 AbstractCegarLoop]: === Iteration 16 === [mainErr51RequiresViolation, mainErr69RequiresViolation, mainErr26RequiresViolation, mainErr54RequiresViolation, mainErr66RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr31RequiresViolation, mainErr46RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr58RequiresViolation, mainErr62RequiresViolation, mainErr15RequiresViolation, mainErr49RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr55RequiresViolation, mainErr65RequiresViolation, mainErr17RequiresViolation, mainErr42RequiresViolation, mainErr71AssertViolationMEMORY_FREE, mainErr30RequiresViolation, mainErr11RequiresViolation, mainErr57RequiresViolation, mainErr63RequiresViolation, mainErr24RequiresViolation, mainErr44RequiresViolation, mainErr10RequiresViolation, mainErr43RequiresViolation, mainErr4RequiresViolation, mainErr50RequiresViolation, mainErr72EnsuresViolationMEMORY_LEAK, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr61RequiresViolation, mainErr59RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr70AssertViolationMEMORY_FREE, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr56RequiresViolation, mainErr64RequiresViolation, mainErr48RequiresViolation, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr52RequiresViolation, mainErr68RequiresViolation, mainErr45RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr60RequiresViolation, mainErr9RequiresViolation, mainErr67RequiresViolation, mainErr53RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr34RequiresViolation, mainErr47RequiresViolation, mainErr14RequiresViolation, mainErr40RequiresViolation]=== [2018-04-12 01:23:05,257 INFO L82 PathProgramCache]: Analyzing trace with hash 224455011, now seen corresponding path program 1 times [2018-04-12 01:23:05,257 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-04-12 01:23:05,257 INFO L68 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-04-12 01:23:05,258 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-12 01:23:05,258 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-12 01:23:05,258 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-12 01:23:05,263 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-12 01:23:05,264 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-12 01:23:05,276 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2018-04-12 01:23:05,276 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-04-12 01:23:05,276 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-04-12 01:23:05,276 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-04-12 01:23:05,276 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-04-12 01:23:05,276 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-04-12 01:23:05,277 INFO L87 Difference]: Start difference. First operand 276 states and 317 transitions. Second operand 4 states. [2018-04-12 01:23:05,327 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-12 01:23:05,327 INFO L93 Difference]: Finished difference Result 273 states and 310 transitions. [2018-04-12 01:23:05,327 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-04-12 01:23:05,327 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 47 [2018-04-12 01:23:05,327 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-12 01:23:05,328 INFO L225 Difference]: With dead ends: 273 [2018-04-12 01:23:05,328 INFO L226 Difference]: Without dead ends: 273 [2018-04-12 01:23:05,328 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-04-12 01:23:05,328 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 273 states. [2018-04-12 01:23:05,330 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 273 to 272. [2018-04-12 01:23:05,330 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 272 states. [2018-04-12 01:23:05,331 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 272 states to 272 states and 309 transitions. [2018-04-12 01:23:05,331 INFO L78 Accepts]: Start accepts. Automaton has 272 states and 309 transitions. Word has length 47 [2018-04-12 01:23:05,331 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-12 01:23:05,331 INFO L459 AbstractCegarLoop]: Abstraction has 272 states and 309 transitions. [2018-04-12 01:23:05,331 INFO L460 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-04-12 01:23:05,331 INFO L276 IsEmpty]: Start isEmpty. Operand 272 states and 309 transitions. [2018-04-12 01:23:05,331 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2018-04-12 01:23:05,331 INFO L347 BasicCegarLoop]: Found error trace [2018-04-12 01:23:05,331 INFO L355 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-12 01:23:05,331 INFO L408 AbstractCegarLoop]: === Iteration 17 === [mainErr51RequiresViolation, mainErr69RequiresViolation, mainErr26RequiresViolation, mainErr54RequiresViolation, mainErr66RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr31RequiresViolation, mainErr46RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr58RequiresViolation, mainErr62RequiresViolation, mainErr15RequiresViolation, mainErr49RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr55RequiresViolation, mainErr65RequiresViolation, mainErr17RequiresViolation, mainErr42RequiresViolation, mainErr71AssertViolationMEMORY_FREE, mainErr30RequiresViolation, mainErr11RequiresViolation, mainErr57RequiresViolation, mainErr63RequiresViolation, mainErr24RequiresViolation, mainErr44RequiresViolation, mainErr10RequiresViolation, mainErr43RequiresViolation, mainErr4RequiresViolation, mainErr50RequiresViolation, mainErr72EnsuresViolationMEMORY_LEAK, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr61RequiresViolation, mainErr59RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr70AssertViolationMEMORY_FREE, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr56RequiresViolation, mainErr64RequiresViolation, mainErr48RequiresViolation, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr52RequiresViolation, mainErr68RequiresViolation, mainErr45RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr60RequiresViolation, mainErr9RequiresViolation, mainErr67RequiresViolation, mainErr53RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr34RequiresViolation, mainErr47RequiresViolation, mainErr14RequiresViolation, mainErr40RequiresViolation]=== [2018-04-12 01:23:05,332 INFO L82 PathProgramCache]: Analyzing trace with hash 224455012, now seen corresponding path program 1 times [2018-04-12 01:23:05,332 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-04-12 01:23:05,332 INFO L68 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-04-12 01:23:05,332 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-12 01:23:05,332 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-12 01:23:05,333 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-12 01:23:05,338 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-12 01:23:05,339 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-12 01:23:05,366 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2018-04-12 01:23:05,367 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-04-12 01:23:05,367 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-04-12 01:23:05,367 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-04-12 01:23:05,367 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-04-12 01:23:05,367 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-04-12 01:23:05,367 INFO L87 Difference]: Start difference. First operand 272 states and 309 transitions. Second operand 4 states. [2018-04-12 01:23:05,427 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-12 01:23:05,427 INFO L93 Difference]: Finished difference Result 268 states and 301 transitions. [2018-04-12 01:23:05,427 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-04-12 01:23:05,427 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 47 [2018-04-12 01:23:05,427 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-12 01:23:05,428 INFO L225 Difference]: With dead ends: 268 [2018-04-12 01:23:05,428 INFO L226 Difference]: Without dead ends: 268 [2018-04-12 01:23:05,428 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-04-12 01:23:05,429 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 268 states. [2018-04-12 01:23:05,430 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 268 to 268. [2018-04-12 01:23:05,431 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 268 states. [2018-04-12 01:23:05,431 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 268 states to 268 states and 301 transitions. [2018-04-12 01:23:05,431 INFO L78 Accepts]: Start accepts. Automaton has 268 states and 301 transitions. Word has length 47 [2018-04-12 01:23:05,431 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-12 01:23:05,431 INFO L459 AbstractCegarLoop]: Abstraction has 268 states and 301 transitions. [2018-04-12 01:23:05,431 INFO L460 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-04-12 01:23:05,431 INFO L276 IsEmpty]: Start isEmpty. Operand 268 states and 301 transitions. [2018-04-12 01:23:05,431 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2018-04-12 01:23:05,432 INFO L347 BasicCegarLoop]: Found error trace [2018-04-12 01:23:05,432 INFO L355 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-12 01:23:05,432 INFO L408 AbstractCegarLoop]: === Iteration 18 === [mainErr51RequiresViolation, mainErr69RequiresViolation, mainErr26RequiresViolation, mainErr54RequiresViolation, mainErr66RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr31RequiresViolation, mainErr46RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr58RequiresViolation, mainErr62RequiresViolation, mainErr15RequiresViolation, mainErr49RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr55RequiresViolation, mainErr65RequiresViolation, mainErr17RequiresViolation, mainErr42RequiresViolation, mainErr71AssertViolationMEMORY_FREE, mainErr30RequiresViolation, mainErr11RequiresViolation, mainErr57RequiresViolation, mainErr63RequiresViolation, mainErr24RequiresViolation, mainErr44RequiresViolation, mainErr10RequiresViolation, mainErr43RequiresViolation, mainErr4RequiresViolation, mainErr50RequiresViolation, mainErr72EnsuresViolationMEMORY_LEAK, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr61RequiresViolation, mainErr59RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr70AssertViolationMEMORY_FREE, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr56RequiresViolation, mainErr64RequiresViolation, mainErr48RequiresViolation, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr52RequiresViolation, mainErr68RequiresViolation, mainErr45RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr60RequiresViolation, mainErr9RequiresViolation, mainErr67RequiresViolation, mainErr53RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr34RequiresViolation, mainErr47RequiresViolation, mainErr14RequiresViolation, mainErr40RequiresViolation]=== [2018-04-12 01:23:05,432 INFO L82 PathProgramCache]: Analyzing trace with hash -1004839968, now seen corresponding path program 1 times [2018-04-12 01:23:05,432 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-04-12 01:23:05,432 INFO L68 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-04-12 01:23:05,432 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-12 01:23:05,433 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-12 01:23:05,433 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-12 01:23:05,440 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-12 01:23:05,441 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-12 01:23:05,895 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 6 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-12 01:23:05,895 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-04-12 01:23:05,895 INFO L213 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-04-12 01:23:05,900 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-12 01:23:05,922 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-12 01:23:05,927 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-12 01:23:05,943 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-04-12 01:23:05,943 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-12 01:23:05,947 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-12 01:23:05,947 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2018-04-12 01:23:06,029 INFO L700 Elim1Store]: detected not equals via solver [2018-04-12 01:23:06,030 INFO L700 Elim1Store]: detected not equals via solver [2018-04-12 01:23:06,030 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 4 [2018-04-12 01:23:06,030 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-12 01:23:06,038 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 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-12 01:23:06,038 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-12 01:23:06,048 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-04-12 01:23:06,048 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:31, output treesize:24 [2018-04-12 01:23:06,180 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 47 treesize of output 61 [2018-04-12 01:23:06,182 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 48 treesize of output 47 [2018-04-12 01:23:06,182 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-12 01:23:06,199 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-12 01:23:06,214 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 3 new quantified variables, introduced 3 case distinctions, treesize of input 39 treesize of output 48 [2018-04-12 01:23:06,221 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 1 new quantified variables, introduced 2 case distinctions, treesize of input 33 treesize of output 39 [2018-04-12 01:23:06,221 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 2 xjuncts. [2018-04-12 01:23:06,238 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 32 treesize of output 31 [2018-04-12 01:23:06,238 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2018-04-12 01:23:06,246 INFO L267 ElimStorePlain]: Start of recursive call 4: 2 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-04-12 01:23:06,265 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-2 vars, End of recursive call: 2 dim-0 vars, and 2 xjuncts. [2018-04-12 01:23:06,266 INFO L202 ElimStorePlain]: Needed 6 recursive calls to eliminate 3 variables, input treesize:64, output treesize:85 [2018-04-12 01:23:06,762 WARN L151 SmtUtils]: Spent 173ms on a formula simplification. DAG size of input: 50 DAG size of output 45 [2018-04-12 01:23:06,955 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 1 new quantified variables, introduced 2 case distinctions, treesize of input 80 treesize of output 88 [2018-04-12 01:23:06,956 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 2 xjuncts. [2018-04-12 01:23:07,001 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 80 treesize of output 88 [2018-04-12 01:23:07,002 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 2 xjuncts. [2018-04-12 01:23:07,044 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-1 vars, End of recursive call: and 4 xjuncts. [2018-04-12 01:23:07,045 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:161, output treesize:235 [2018-04-12 01:23:07,305 WARN L307 Elim1Store]: Array PQE input equivalent to false [2018-04-12 01:23:07,305 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-12 01:23:07,341 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 2 new quantified variables, introduced 0 case distinctions, treesize of input 87 treesize of output 75 [2018-04-12 01:23:07,343 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2018-04-12 01:23:07,343 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-04-12 01:23:07,355 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 16 [2018-04-12 01:23:07,355 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-04-12 01:23:07,364 INFO L267 ElimStorePlain]: Start of recursive call 3: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-12 01:23:07,387 INFO L700 Elim1Store]: detected not equals via solver [2018-04-12 01:23:07,389 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 86 treesize of output 74 [2018-04-12 01:23:07,391 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2018-04-12 01:23:07,391 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2018-04-12 01:23:07,403 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 24 treesize of output 15 [2018-04-12 01:23:07,403 INFO L267 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 1 xjuncts. [2018-04-12 01:23:07,411 INFO L267 ElimStorePlain]: Start of recursive call 6: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-12 01:23:07,430 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 3 dim-2 vars, End of recursive call: 2 dim-0 vars, and 2 xjuncts. [2018-04-12 01:23:07,430 INFO L202 ElimStorePlain]: Needed 8 recursive calls to eliminate 6 variables, input treesize:260, output treesize:106 [2018-04-12 01:23:07,623 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 2 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-12 01:23:07,640 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-04-12 01:23:07,640 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [22, 20] total 40 [2018-04-12 01:23:07,641 INFO L442 AbstractCegarLoop]: Interpolant automaton has 40 states [2018-04-12 01:23:07,641 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 40 interpolants. [2018-04-12 01:23:07,641 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=136, Invalid=1410, Unknown=14, NotChecked=0, Total=1560 [2018-04-12 01:23:07,641 INFO L87 Difference]: Start difference. First operand 268 states and 301 transitions. Second operand 40 states. [2018-04-12 01:23:09,036 WARN L151 SmtUtils]: Spent 179ms on a formula simplification. DAG size of input: 122 DAG size of output 70 [2018-04-12 01:23:09,184 WARN L151 SmtUtils]: Spent 112ms on a formula simplification. DAG size of input: 132 DAG size of output 53 [2018-04-12 01:23:09,328 WARN L151 SmtUtils]: Spent 108ms on a formula simplification. DAG size of input: 113 DAG size of output 50 [2018-04-12 01:23:09,487 WARN L151 SmtUtils]: Spent 119ms on a formula simplification. DAG size of input: 136 DAG size of output 57 [2018-04-12 01:23:09,786 WARN L151 SmtUtils]: Spent 142ms on a formula simplification. DAG size of input: 143 DAG size of output 59 [2018-04-12 01:23:09,934 WARN L151 SmtUtils]: Spent 109ms on a formula simplification. DAG size of input: 137 DAG size of output 58 [2018-04-12 01:23:10,238 WARN L151 SmtUtils]: Spent 136ms on a formula simplification. DAG size of input: 175 DAG size of output 110 [2018-04-12 01:23:10,408 WARN L151 SmtUtils]: Spent 104ms on a formula simplification. DAG size of input: 122 DAG size of output 115 [2018-04-12 01:23:10,634 WARN L151 SmtUtils]: Spent 121ms on a formula simplification. DAG size of input: 143 DAG size of output 103 [2018-04-12 01:23:10,831 WARN L151 SmtUtils]: Spent 134ms on a formula simplification. DAG size of input: 148 DAG size of output 106 [2018-04-12 01:23:12,716 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-12 01:23:12,716 INFO L93 Difference]: Finished difference Result 428 states and 468 transitions. [2018-04-12 01:23:12,716 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 44 states. [2018-04-12 01:23:12,716 INFO L78 Accepts]: Start accepts. Automaton has 40 states. Word has length 50 [2018-04-12 01:23:12,716 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-12 01:23:12,717 INFO L225 Difference]: With dead ends: 428 [2018-04-12 01:23:12,717 INFO L226 Difference]: Without dead ends: 428 [2018-04-12 01:23:12,718 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 114 GetRequests, 33 SyntacticMatches, 2 SemanticMatches, 79 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1808 ImplicationChecksByTransitivity, 4.8s TimeCoverageRelationStatistics Valid=1187, Invalid=5271, Unknown=22, NotChecked=0, Total=6480 [2018-04-12 01:23:12,718 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 428 states. [2018-04-12 01:23:12,721 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 428 to 272. [2018-04-12 01:23:12,721 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 272 states. [2018-04-12 01:23:12,721 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 272 states to 272 states and 305 transitions. [2018-04-12 01:23:12,721 INFO L78 Accepts]: Start accepts. Automaton has 272 states and 305 transitions. Word has length 50 [2018-04-12 01:23:12,721 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-12 01:23:12,721 INFO L459 AbstractCegarLoop]: Abstraction has 272 states and 305 transitions. [2018-04-12 01:23:12,721 INFO L460 AbstractCegarLoop]: Interpolant automaton has 40 states. [2018-04-12 01:23:12,721 INFO L276 IsEmpty]: Start isEmpty. Operand 272 states and 305 transitions. [2018-04-12 01:23:12,722 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2018-04-12 01:23:12,722 INFO L347 BasicCegarLoop]: Found error trace [2018-04-12 01:23:12,722 INFO L355 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-12 01:23:12,722 INFO L408 AbstractCegarLoop]: === Iteration 19 === [mainErr51RequiresViolation, mainErr69RequiresViolation, mainErr26RequiresViolation, mainErr54RequiresViolation, mainErr66RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr31RequiresViolation, mainErr46RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr58RequiresViolation, mainErr62RequiresViolation, mainErr15RequiresViolation, mainErr49RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr55RequiresViolation, mainErr65RequiresViolation, mainErr17RequiresViolation, mainErr42RequiresViolation, mainErr71AssertViolationMEMORY_FREE, mainErr30RequiresViolation, mainErr11RequiresViolation, mainErr57RequiresViolation, mainErr63RequiresViolation, mainErr24RequiresViolation, mainErr44RequiresViolation, mainErr10RequiresViolation, mainErr43RequiresViolation, mainErr4RequiresViolation, mainErr50RequiresViolation, mainErr72EnsuresViolationMEMORY_LEAK, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr61RequiresViolation, mainErr59RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr70AssertViolationMEMORY_FREE, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr56RequiresViolation, mainErr64RequiresViolation, mainErr48RequiresViolation, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr52RequiresViolation, mainErr68RequiresViolation, mainErr45RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr60RequiresViolation, mainErr9RequiresViolation, mainErr67RequiresViolation, mainErr53RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr34RequiresViolation, mainErr47RequiresViolation, mainErr14RequiresViolation, mainErr40RequiresViolation]=== [2018-04-12 01:23:12,722 INFO L82 PathProgramCache]: Analyzing trace with hash 1801987223, now seen corresponding path program 1 times [2018-04-12 01:23:12,722 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-04-12 01:23:12,722 INFO L68 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-04-12 01:23:12,723 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-12 01:23:12,723 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-12 01:23:12,723 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-12 01:23:12,728 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-12 01:23:12,729 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-12 01:23:12,749 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2018-04-12 01:23:12,750 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-04-12 01:23:12,750 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-04-12 01:23:12,750 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-04-12 01:23:12,750 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-04-12 01:23:12,750 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-04-12 01:23:12,750 INFO L87 Difference]: Start difference. First operand 272 states and 305 transitions. Second operand 6 states. [2018-04-12 01:23:12,901 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-12 01:23:12,901 INFO L93 Difference]: Finished difference Result 302 states and 336 transitions. [2018-04-12 01:23:12,901 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-04-12 01:23:12,901 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 51 [2018-04-12 01:23:12,901 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-12 01:23:12,902 INFO L225 Difference]: With dead ends: 302 [2018-04-12 01:23:12,902 INFO L226 Difference]: Without dead ends: 302 [2018-04-12 01:23:12,902 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=30, Invalid=60, Unknown=0, NotChecked=0, Total=90 [2018-04-12 01:23:12,902 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 302 states. [2018-04-12 01:23:12,905 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 302 to 281. [2018-04-12 01:23:12,905 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 281 states. [2018-04-12 01:23:12,905 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 281 states to 281 states and 319 transitions. [2018-04-12 01:23:12,905 INFO L78 Accepts]: Start accepts. Automaton has 281 states and 319 transitions. Word has length 51 [2018-04-12 01:23:12,905 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-12 01:23:12,906 INFO L459 AbstractCegarLoop]: Abstraction has 281 states and 319 transitions. [2018-04-12 01:23:12,906 INFO L460 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-04-12 01:23:12,906 INFO L276 IsEmpty]: Start isEmpty. Operand 281 states and 319 transitions. [2018-04-12 01:23:12,906 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2018-04-12 01:23:12,906 INFO L347 BasicCegarLoop]: Found error trace [2018-04-12 01:23:12,906 INFO L355 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-12 01:23:12,906 INFO L408 AbstractCegarLoop]: === Iteration 20 === [mainErr51RequiresViolation, mainErr69RequiresViolation, mainErr26RequiresViolation, mainErr54RequiresViolation, mainErr66RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr31RequiresViolation, mainErr46RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr58RequiresViolation, mainErr62RequiresViolation, mainErr15RequiresViolation, mainErr49RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr55RequiresViolation, mainErr65RequiresViolation, mainErr17RequiresViolation, mainErr42RequiresViolation, mainErr71AssertViolationMEMORY_FREE, mainErr30RequiresViolation, mainErr11RequiresViolation, mainErr57RequiresViolation, mainErr63RequiresViolation, mainErr24RequiresViolation, mainErr44RequiresViolation, mainErr10RequiresViolation, mainErr43RequiresViolation, mainErr4RequiresViolation, mainErr50RequiresViolation, mainErr72EnsuresViolationMEMORY_LEAK, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr61RequiresViolation, mainErr59RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr70AssertViolationMEMORY_FREE, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr56RequiresViolation, mainErr64RequiresViolation, mainErr48RequiresViolation, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr52RequiresViolation, mainErr68RequiresViolation, mainErr45RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr60RequiresViolation, mainErr9RequiresViolation, mainErr67RequiresViolation, mainErr53RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr34RequiresViolation, mainErr47RequiresViolation, mainErr14RequiresViolation, mainErr40RequiresViolation]=== [2018-04-12 01:23:12,907 INFO L82 PathProgramCache]: Analyzing trace with hash 1801987224, now seen corresponding path program 1 times [2018-04-12 01:23:12,907 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-04-12 01:23:12,907 INFO L68 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-04-12 01:23:12,908 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-12 01:23:12,908 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-12 01:23:12,908 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-12 01:23:12,918 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-12 01:23:12,919 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-12 01:23:13,235 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-12 01:23:13,235 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-04-12 01:23:13,235 INFO L213 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-04-12 01:23:13,241 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-12 01:23:13,258 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-12 01:23:13,260 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-12 01:23:13,305 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 19 [2018-04-12 01:23:13,307 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 11 [2018-04-12 01:23:13,308 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-12 01:23:13,309 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-12 01:23:13,314 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 28 treesize of output 22 [2018-04-12 01:23:13,316 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 22 treesize of output 13 [2018-04-12 01:23:13,316 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-04-12 01:23:13,318 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-12 01:23:13,321 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-04-12 01:23:13,321 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 4 variables, input treesize:39, output treesize:13 [2018-04-12 01:23:13,353 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2018-04-12 01:23:13,374 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-04-12 01:23:13,374 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [20] total 24 [2018-04-12 01:23:13,375 INFO L442 AbstractCegarLoop]: Interpolant automaton has 25 states [2018-04-12 01:23:13,375 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2018-04-12 01:23:13,375 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=82, Invalid=518, Unknown=0, NotChecked=0, Total=600 [2018-04-12 01:23:13,375 INFO L87 Difference]: Start difference. First operand 281 states and 319 transitions. Second operand 25 states. [2018-04-12 01:23:15,568 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-12 01:23:15,568 INFO L93 Difference]: Finished difference Result 420 states and 459 transitions. [2018-04-12 01:23:15,569 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 46 states. [2018-04-12 01:23:15,569 INFO L78 Accepts]: Start accepts. Automaton has 25 states. Word has length 51 [2018-04-12 01:23:15,569 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-12 01:23:15,570 INFO L225 Difference]: With dead ends: 420 [2018-04-12 01:23:15,570 INFO L226 Difference]: Without dead ends: 420 [2018-04-12 01:23:15,571 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 127 GetRequests, 60 SyntacticMatches, 2 SemanticMatches, 65 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1115 ImplicationChecksByTransitivity, 1.6s TimeCoverageRelationStatistics Valid=865, Invalid=3557, Unknown=0, NotChecked=0, Total=4422 [2018-04-12 01:23:15,571 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 420 states. [2018-04-12 01:23:15,573 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 420 to 292. [2018-04-12 01:23:15,573 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 292 states. [2018-04-12 01:23:15,573 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 292 states to 292 states and 328 transitions. [2018-04-12 01:23:15,573 INFO L78 Accepts]: Start accepts. Automaton has 292 states and 328 transitions. Word has length 51 [2018-04-12 01:23:15,573 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-12 01:23:15,573 INFO L459 AbstractCegarLoop]: Abstraction has 292 states and 328 transitions. [2018-04-12 01:23:15,574 INFO L460 AbstractCegarLoop]: Interpolant automaton has 25 states. [2018-04-12 01:23:15,574 INFO L276 IsEmpty]: Start isEmpty. Operand 292 states and 328 transitions. [2018-04-12 01:23:15,574 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2018-04-12 01:23:15,574 INFO L347 BasicCegarLoop]: Found error trace [2018-04-12 01:23:15,574 INFO L355 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-12 01:23:15,574 INFO L408 AbstractCegarLoop]: === Iteration 21 === [mainErr51RequiresViolation, mainErr69RequiresViolation, mainErr26RequiresViolation, mainErr54RequiresViolation, mainErr66RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr31RequiresViolation, mainErr46RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr58RequiresViolation, mainErr62RequiresViolation, mainErr15RequiresViolation, mainErr49RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr55RequiresViolation, mainErr65RequiresViolation, mainErr17RequiresViolation, mainErr42RequiresViolation, mainErr71AssertViolationMEMORY_FREE, mainErr30RequiresViolation, mainErr11RequiresViolation, mainErr57RequiresViolation, mainErr63RequiresViolation, mainErr24RequiresViolation, mainErr44RequiresViolation, mainErr10RequiresViolation, mainErr43RequiresViolation, mainErr4RequiresViolation, mainErr50RequiresViolation, mainErr72EnsuresViolationMEMORY_LEAK, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr61RequiresViolation, mainErr59RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr70AssertViolationMEMORY_FREE, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr56RequiresViolation, mainErr64RequiresViolation, mainErr48RequiresViolation, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr52RequiresViolation, mainErr68RequiresViolation, mainErr45RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr60RequiresViolation, mainErr9RequiresViolation, mainErr67RequiresViolation, mainErr53RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr34RequiresViolation, mainErr47RequiresViolation, mainErr14RequiresViolation, mainErr40RequiresViolation]=== [2018-04-12 01:23:15,574 INFO L82 PathProgramCache]: Analyzing trace with hash 2133118707, now seen corresponding path program 1 times [2018-04-12 01:23:15,574 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-04-12 01:23:15,574 INFO L68 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-04-12 01:23:15,575 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-12 01:23:15,575 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-12 01:23:15,575 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-12 01:23:15,581 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-12 01:23:15,582 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-12 01:23:15,717 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-12 01:23:15,717 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-04-12 01:23:15,717 INFO L213 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-04-12 01:23:15,731 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-12 01:23:15,748 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-12 01:23:15,751 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-12 01:23:15,804 INFO L700 Elim1Store]: detected not equals via solver [2018-04-12 01:23:15,805 INFO L700 Elim1Store]: detected not equals via solver [2018-04-12 01:23:15,805 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 4 [2018-04-12 01:23:15,805 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-12 01:23:15,808 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-12 01:23:15,808 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:25, output treesize:19 [2018-04-12 01:23:15,823 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 20 [2018-04-12 01:23:15,825 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-04-12 01:23:15,825 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-12 01:23:15,828 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-12 01:23:15,837 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 20 [2018-04-12 01:23:15,848 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-04-12 01:23:15,849 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-04-12 01:23:15,852 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-12 01:23:15,857 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-04-12 01:23:15,857 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 2 variables, input treesize:41, output treesize:33 [2018-04-12 01:23:15,874 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 27 [2018-04-12 01:23:15,883 INFO L700 Elim1Store]: detected not equals via solver [2018-04-12 01:23:15,884 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 23 [2018-04-12 01:23:15,885 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-12 01:23:15,891 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-12 01:23:15,903 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 33 [2018-04-12 01:23:15,905 INFO L700 Elim1Store]: detected not equals via solver [2018-04-12 01:23:15,907 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 23 [2018-04-12 01:23:15,907 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-04-12 01:23:15,912 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-12 01:23:15,919 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2018-04-12 01:23:15,919 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 4 variables, input treesize:59, output treesize:57 [2018-04-12 01:23:15,939 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 94 treesize of output 77 [2018-04-12 01:23:15,949 INFO L700 Elim1Store]: detected not equals via solver [2018-04-12 01:23:15,950 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 48 treesize of output 37 [2018-04-12 01:23:15,950 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-04-12 01:23:15,957 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 3 [2018-04-12 01:23:15,957 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-04-12 01:23:15,962 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-04-12 01:23:15,969 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 34 treesize of output 28 [2018-04-12 01:23:15,970 INFO L700 Elim1Store]: detected not equals via solver [2018-04-12 01:23:15,971 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 17 [2018-04-12 01:23:15,972 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-04-12 01:23:15,976 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 3 [2018-04-12 01:23:15,977 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2018-04-12 01:23:15,978 INFO L267 ElimStorePlain]: Start of recursive call 5: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-12 01:23:15,989 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-04-12 01:23:15,989 INFO L202 ElimStorePlain]: Needed 7 recursive calls to eliminate 4 variables, input treesize:101, output treesize:7 [2018-04-12 01:23:16,005 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-12 01:23:16,024 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-04-12 01:23:16,024 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 13] total 22 [2018-04-12 01:23:16,024 INFO L442 AbstractCegarLoop]: Interpolant automaton has 22 states [2018-04-12 01:23:16,024 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2018-04-12 01:23:16,024 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=70, Invalid=392, Unknown=0, NotChecked=0, Total=462 [2018-04-12 01:23:16,024 INFO L87 Difference]: Start difference. First operand 292 states and 328 transitions. Second operand 22 states. [2018-04-12 01:23:17,009 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-12 01:23:17,009 INFO L93 Difference]: Finished difference Result 350 states and 380 transitions. [2018-04-12 01:23:17,009 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2018-04-12 01:23:17,009 INFO L78 Accepts]: Start accepts. Automaton has 22 states. Word has length 53 [2018-04-12 01:23:17,009 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-12 01:23:17,010 INFO L225 Difference]: With dead ends: 350 [2018-04-12 01:23:17,010 INFO L226 Difference]: Without dead ends: 350 [2018-04-12 01:23:17,010 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 92 GetRequests, 46 SyntacticMatches, 3 SemanticMatches, 43 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 432 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=434, Invalid=1543, Unknown=3, NotChecked=0, Total=1980 [2018-04-12 01:23:17,011 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 350 states. [2018-04-12 01:23:17,012 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 350 to 306. [2018-04-12 01:23:17,012 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 306 states. [2018-04-12 01:23:17,013 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 306 states to 306 states and 341 transitions. [2018-04-12 01:23:17,013 INFO L78 Accepts]: Start accepts. Automaton has 306 states and 341 transitions. Word has length 53 [2018-04-12 01:23:17,013 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-12 01:23:17,013 INFO L459 AbstractCegarLoop]: Abstraction has 306 states and 341 transitions. [2018-04-12 01:23:17,013 INFO L460 AbstractCegarLoop]: Interpolant automaton has 22 states. [2018-04-12 01:23:17,013 INFO L276 IsEmpty]: Start isEmpty. Operand 306 states and 341 transitions. [2018-04-12 01:23:17,013 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2018-04-12 01:23:17,013 INFO L347 BasicCegarLoop]: Found error trace [2018-04-12 01:23:17,013 INFO L355 BasicCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-12 01:23:17,013 INFO L408 AbstractCegarLoop]: === Iteration 22 === [mainErr51RequiresViolation, mainErr69RequiresViolation, mainErr26RequiresViolation, mainErr54RequiresViolation, mainErr66RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr31RequiresViolation, mainErr46RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr58RequiresViolation, mainErr62RequiresViolation, mainErr15RequiresViolation, mainErr49RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr55RequiresViolation, mainErr65RequiresViolation, mainErr17RequiresViolation, mainErr42RequiresViolation, mainErr71AssertViolationMEMORY_FREE, mainErr30RequiresViolation, mainErr11RequiresViolation, mainErr57RequiresViolation, mainErr63RequiresViolation, mainErr24RequiresViolation, mainErr44RequiresViolation, mainErr10RequiresViolation, mainErr43RequiresViolation, mainErr4RequiresViolation, mainErr50RequiresViolation, mainErr72EnsuresViolationMEMORY_LEAK, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr61RequiresViolation, mainErr59RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr70AssertViolationMEMORY_FREE, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr56RequiresViolation, mainErr64RequiresViolation, mainErr48RequiresViolation, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr52RequiresViolation, mainErr68RequiresViolation, mainErr45RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr60RequiresViolation, mainErr9RequiresViolation, mainErr67RequiresViolation, mainErr53RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr34RequiresViolation, mainErr47RequiresViolation, mainErr14RequiresViolation, mainErr40RequiresViolation]=== [2018-04-12 01:23:17,013 INFO L82 PathProgramCache]: Analyzing trace with hash -1401734189, now seen corresponding path program 1 times [2018-04-12 01:23:17,014 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-04-12 01:23:17,014 INFO L68 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-04-12 01:23:17,014 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-12 01:23:17,014 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-12 01:23:17,014 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-12 01:23:17,023 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-12 01:23:17,023 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-12 01:23:17,469 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 0 proven. 20 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-12 01:23:17,469 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-04-12 01:23:17,469 INFO L213 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-04-12 01:23:17,474 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-12 01:23:17,490 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-12 01:23:17,492 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-12 01:23:17,526 INFO L700 Elim1Store]: detected not equals via solver [2018-04-12 01:23:17,527 INFO L700 Elim1Store]: detected not equals via solver [2018-04-12 01:23:17,527 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 4 [2018-04-12 01:23:17,527 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-12 01:23:17,529 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-12 01:23:17,530 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:17, output treesize:11 [2018-04-12 01:23:17,552 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 8 [2018-04-12 01:23:17,553 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-04-12 01:23:17,553 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-12 01:23:17,554 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-12 01:23:17,566 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-04-12 01:23:17,567 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:27, output treesize:20 [2018-04-12 01:23:17,605 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 34 [2018-04-12 01:23:17,606 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 13 [2018-04-12 01:23:17,606 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-12 01:23:17,609 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-12 01:23:17,613 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-04-12 01:23:17,613 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:41, output treesize:33 [2018-04-12 01:23:17,695 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 40 treesize of output 35 [2018-04-12 01:23:17,711 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 2 case distinctions, treesize of input 16 treesize of output 23 [2018-04-12 01:23:17,711 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 2 xjuncts. [2018-04-12 01:23:17,721 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-04-12 01:23:17,735 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 2 xjuncts. [2018-04-12 01:23:17,735 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:50, output treesize:68 [2018-04-12 01:23:17,787 INFO L700 Elim1Store]: detected not equals via solver [2018-04-12 01:23:17,787 INFO L700 Elim1Store]: detected not equals via solver [2018-04-12 01:23:17,788 INFO L700 Elim1Store]: detected not equals via solver [2018-04-12 01:23:17,789 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 13 [2018-04-12 01:23:17,789 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-12 01:23:17,794 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-12 01:23:17,794 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:34, output treesize:27 [2018-04-12 01:23:17,818 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 25 [2018-04-12 01:23:17,820 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 7 [2018-04-12 01:23:17,820 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-12 01:23:17,823 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-12 01:23:17,827 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-04-12 01:23:17,827 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:43, output treesize:33 [2018-04-12 01:23:17,879 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 45 treesize of output 45 [2018-04-12 01:23:17,880 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 13 [2018-04-12 01:23:17,880 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-12 01:23:17,885 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-12 01:23:17,890 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-04-12 01:23:17,891 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:54, output treesize:46 [2018-04-12 01:23:18,032 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 94 treesize of output 71 [2018-04-12 01:23:18,040 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 2 case distinctions, treesize of input 28 treesize of output 43 [2018-04-12 01:23:18,040 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 2 xjuncts. [2018-04-12 01:23:18,051 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-04-12 01:23:18,066 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-2 vars, End of recursive call: 5 dim-0 vars, and 2 xjuncts. [2018-04-12 01:23:18,067 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:94, output treesize:146 [2018-04-12 01:23:26,111 WARN L148 SmtUtils]: Spent 8013ms on a formula simplification that was a NOOP. DAG size: 46 [2018-04-12 01:23:34,171 WARN L148 SmtUtils]: Spent 8012ms on a formula simplification that was a NOOP. DAG size: 46 [2018-04-12 01:23:34,180 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 70 treesize of output 45 [2018-04-12 01:23:34,182 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 16 [2018-04-12 01:23:34,182 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-12 01:23:34,186 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2018-04-12 01:23:34,187 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-04-12 01:23:34,190 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 1 [2018-04-12 01:23:34,190 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-04-12 01:23:34,191 INFO L267 ElimStorePlain]: Start of recursive call 2: 3 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-12 01:23:34,202 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 89 treesize of output 52 [2018-04-12 01:23:34,204 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 35 [2018-04-12 01:23:34,204 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2018-04-12 01:23:34,213 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 1 case distinctions, treesize of input 40 treesize of output 26 [2018-04-12 01:23:34,213 INFO L267 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 2 xjuncts. [2018-04-12 01:23:34,223 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 21 [2018-04-12 01:23:34,224 INFO L267 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 1 xjuncts. [2018-04-12 01:23:34,225 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 24 [2018-04-12 01:23:34,225 INFO L267 ElimStorePlain]: Start of recursive call 10: End of recursive call: and 1 xjuncts. [2018-04-12 01:23:34,233 INFO L267 ElimStorePlain]: Start of recursive call 6: 3 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-04-12 01:23:34,242 INFO L267 ElimStorePlain]: Start of recursive call 1: 9 dim-0 vars, 2 dim-2 vars, End of recursive call: and 2 xjuncts. [2018-04-12 01:23:34,242 INFO L202 ElimStorePlain]: Needed 10 recursive calls to eliminate 11 variables, input treesize:160, output treesize:15 [2018-04-12 01:23:34,263 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 0 proven. 20 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-12 01:23:34,280 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-04-12 01:23:34,280 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [19, 19] total 36 [2018-04-12 01:23:34,280 INFO L442 AbstractCegarLoop]: Interpolant automaton has 37 states [2018-04-12 01:23:34,280 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 37 interpolants. [2018-04-12 01:23:34,281 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=147, Invalid=1185, Unknown=0, NotChecked=0, Total=1332 [2018-04-12 01:23:34,281 INFO L87 Difference]: Start difference. First operand 306 states and 341 transitions. Second operand 37 states. [2018-04-12 01:23:51,454 WARN L151 SmtUtils]: Spent 16048ms on a formula simplification. DAG size of input: 62 DAG size of output 62 [2018-04-12 01:24:07,669 WARN L151 SmtUtils]: Spent 16056ms on a formula simplification. DAG size of input: 111 DAG size of output 62 [2018-04-12 01:24:23,927 WARN L151 SmtUtils]: Spent 16058ms on a formula simplification. DAG size of input: 114 DAG size of output 65 [2018-04-12 01:24:32,111 WARN L148 SmtUtils]: Spent 8017ms on a formula simplification that was a NOOP. DAG size: 59 [2018-04-12 01:24:40,293 WARN L148 SmtUtils]: Spent 8019ms on a formula simplification that was a NOOP. DAG size: 62 [2018-04-12 01:24:40,827 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-12 01:24:40,827 INFO L93 Difference]: Finished difference Result 519 states and 568 transitions. [2018-04-12 01:24:40,828 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 34 states. [2018-04-12 01:24:40,829 INFO L78 Accepts]: Start accepts. Automaton has 37 states. Word has length 55 [2018-04-12 01:24:40,829 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-12 01:24:40,831 INFO L225 Difference]: With dead ends: 519 [2018-04-12 01:24:40,831 INFO L226 Difference]: Without dead ends: 519 [2018-04-12 01:24:40,831 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 108 GetRequests, 40 SyntacticMatches, 2 SemanticMatches, 66 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1167 ImplicationChecksByTransitivity, 82.1s TimeCoverageRelationStatistics Valid=755, Invalid=3801, Unknown=0, NotChecked=0, Total=4556 [2018-04-12 01:24:40,832 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 519 states. [2018-04-12 01:24:40,834 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 519 to 347. [2018-04-12 01:24:40,834 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 347 states. [2018-04-12 01:24:40,835 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 347 states to 347 states and 387 transitions. [2018-04-12 01:24:40,835 INFO L78 Accepts]: Start accepts. Automaton has 347 states and 387 transitions. Word has length 55 [2018-04-12 01:24:40,835 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-12 01:24:40,835 INFO L459 AbstractCegarLoop]: Abstraction has 347 states and 387 transitions. [2018-04-12 01:24:40,835 INFO L460 AbstractCegarLoop]: Interpolant automaton has 37 states. [2018-04-12 01:24:40,835 INFO L276 IsEmpty]: Start isEmpty. Operand 347 states and 387 transitions. [2018-04-12 01:24:40,836 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2018-04-12 01:24:40,836 INFO L347 BasicCegarLoop]: Found error trace [2018-04-12 01:24:40,836 INFO L355 BasicCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-12 01:24:40,836 INFO L408 AbstractCegarLoop]: === Iteration 23 === [mainErr51RequiresViolation, mainErr69RequiresViolation, mainErr26RequiresViolation, mainErr54RequiresViolation, mainErr66RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr31RequiresViolation, mainErr46RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr58RequiresViolation, mainErr62RequiresViolation, mainErr15RequiresViolation, mainErr49RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr55RequiresViolation, mainErr65RequiresViolation, mainErr17RequiresViolation, mainErr42RequiresViolation, mainErr71AssertViolationMEMORY_FREE, mainErr30RequiresViolation, mainErr11RequiresViolation, mainErr57RequiresViolation, mainErr63RequiresViolation, mainErr24RequiresViolation, mainErr44RequiresViolation, mainErr10RequiresViolation, mainErr43RequiresViolation, mainErr4RequiresViolation, mainErr50RequiresViolation, mainErr72EnsuresViolationMEMORY_LEAK, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr61RequiresViolation, mainErr59RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr70AssertViolationMEMORY_FREE, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr56RequiresViolation, mainErr64RequiresViolation, mainErr48RequiresViolation, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr52RequiresViolation, mainErr68RequiresViolation, mainErr45RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr60RequiresViolation, mainErr9RequiresViolation, mainErr67RequiresViolation, mainErr53RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr34RequiresViolation, mainErr47RequiresViolation, mainErr14RequiresViolation, mainErr40RequiresViolation]=== [2018-04-12 01:24:40,836 INFO L82 PathProgramCache]: Analyzing trace with hash -1401734188, now seen corresponding path program 1 times [2018-04-12 01:24:40,836 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-04-12 01:24:40,836 INFO L68 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-04-12 01:24:40,837 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-12 01:24:40,837 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-12 01:24:40,837 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-12 01:24:40,850 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-12 01:24:40,851 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-12 01:24:41,352 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 0 proven. 20 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-12 01:24:41,352 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-04-12 01:24:41,352 INFO L213 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-04-12 01:24:41,361 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-12 01:24:41,391 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-12 01:24:41,394 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-12 01:24:41,413 INFO L700 Elim1Store]: detected not equals via solver [2018-04-12 01:24:41,413 INFO L700 Elim1Store]: detected not equals via solver [2018-04-12 01:24:41,414 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 4 [2018-04-12 01:24:41,414 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-12 01:24:41,419 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-12 01:24:41,419 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:20, output treesize:14 [2018-04-12 01:24:41,447 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 8 [2018-04-12 01:24:41,450 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-04-12 01:24:41,451 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-12 01:24:41,452 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-12 01:24:41,461 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 8 [2018-04-12 01:24:41,462 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-04-12 01:24:41,462 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-04-12 01:24:41,463 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-12 01:24:41,471 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-04-12 01:24:41,471 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 3 variables, input treesize:38, output treesize:27 [2018-04-12 01:24:41,523 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 51 treesize of output 55 [2018-04-12 01:24:41,525 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 13 [2018-04-12 01:24:41,526 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-12 01:24:41,531 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-12 01:24:41,543 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-12 01:24:41,546 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 13 [2018-04-12 01:24:41,547 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-04-12 01:24:41,551 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-12 01:24:41,559 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-04-12 01:24:41,559 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 3 variables, input treesize:69, output treesize:53 [2018-04-12 01:24:41,642 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 53 treesize of output 48 [2018-04-12 01:24:41,650 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 2 case distinctions, treesize of input 16 treesize of output 23 [2018-04-12 01:24:41,650 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 2 xjuncts. [2018-04-12 01:24:41,665 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-04-12 01:24:41,696 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 59 treesize of output 60 [2018-04-12 01:24:41,704 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 2 case distinctions, treesize of input 20 treesize of output 31 [2018-04-12 01:24:41,704 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 2 xjuncts. [2018-04-12 01:24:41,716 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-04-12 01:24:41,720 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 55 treesize of output 50 [2018-04-12 01:24:41,723 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 17 [2018-04-12 01:24:41,723 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2018-04-12 01:24:41,729 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-12 01:24:41,753 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-2 vars, End of recursive call: 1 dim-0 vars, and 2 xjuncts. [2018-04-12 01:24:41,753 INFO L202 ElimStorePlain]: Needed 7 recursive calls to eliminate 3 variables, input treesize:84, output treesize:129 [2018-04-12 01:24:41,830 INFO L700 Elim1Store]: detected not equals via solver [2018-04-12 01:24:41,831 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 21 [2018-04-12 01:24:41,831 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-12 01:24:41,845 INFO L700 Elim1Store]: detected not equals via solver [2018-04-12 01:24:41,845 INFO L700 Elim1Store]: detected not equals via solver [2018-04-12 01:24:41,846 INFO L700 Elim1Store]: detected not equals via solver [2018-04-12 01:24:41,846 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 13 [2018-04-12 01:24:41,846 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-12 01:24:41,856 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-12 01:24:41,857 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:68, output treesize:64 [2018-04-12 01:24:41,891 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 36 [2018-04-12 01:24:41,900 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 11 [2018-04-12 01:24:41,900 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-12 01:24:41,904 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-12 01:24:41,928 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 48 treesize of output 47 [2018-04-12 01:24:41,930 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 7 [2018-04-12 01:24:41,931 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-04-12 01:24:41,936 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-12 01:24:41,945 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-04-12 01:24:41,945 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 4 variables, input treesize:86, output treesize:58 [2018-04-12 01:24:42,005 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 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-12 01:24:42,006 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 13 [2018-04-12 01:24:42,007 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-12 01:24:42,010 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-12 01:24:42,030 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 78 treesize of output 78 [2018-04-12 01:24:42,032 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 13 [2018-04-12 01:24:42,032 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-04-12 01:24:42,040 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-12 01:24:42,051 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-04-12 01:24:42,051 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 3 variables, input treesize:100, output treesize:84 [2018-04-12 01:24:42,160 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 52 treesize of output 43 [2018-04-12 01:24:42,167 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 2 case distinctions, treesize of input 24 treesize of output 39 [2018-04-12 01:24:42,168 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 2 xjuncts. [2018-04-12 01:24:42,178 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-04-12 01:24:42,209 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 136 treesize of output 105 [2018-04-12 01:24:42,212 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 21 [2018-04-12 01:24:42,212 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-04-12 01:24:42,222 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-12 01:24:42,228 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 148 treesize of output 113 [2018-04-12 01:24:42,242 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 2 case distinctions, treesize of input 28 treesize of output 43 [2018-04-12 01:24:42,243 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 2 xjuncts. [2018-04-12 01:24:42,260 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-04-12 01:24:42,295 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 2 dim-2 vars, End of recursive call: 5 dim-0 vars, and 2 xjuncts. [2018-04-12 01:24:42,295 INFO L202 ElimStorePlain]: Needed 7 recursive calls to eliminate 5 variables, input treesize:163, output treesize:245 [2018-04-12 01:24:50,360 WARN L148 SmtUtils]: Spent 8017ms on a formula simplification that was a NOOP. DAG size: 67 [2018-04-12 01:24:58,443 WARN L148 SmtUtils]: Spent 8017ms on a formula simplification that was a NOOP. DAG size: 67 [2018-04-12 01:24:58,458 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 153 treesize of output 98 [2018-04-12 01:24:58,464 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-12 01:24:58,464 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 2 xjuncts. [2018-04-12 01:24:58,482 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 42 treesize of output 32 [2018-04-12 01:24:58,483 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-04-12 01:24:58,507 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 22 [2018-04-12 01:24:58,507 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-04-12 01:24:58,509 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 19 [2018-04-12 01:24:58,509 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2018-04-12 01:24:58,528 INFO L267 ElimStorePlain]: Start of recursive call 2: 3 dim-1 vars, End of recursive call: 2 dim-0 vars, and 2 xjuncts. [2018-04-12 01:24:58,571 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 64 treesize of output 56 [2018-04-12 01:24:58,572 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 3 [2018-04-12 01:24:58,573 INFO L267 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 1 xjuncts. [2018-04-12 01:24:58,583 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 6 [2018-04-12 01:24:58,583 INFO L267 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 1 xjuncts. [2018-04-12 01:24:58,590 INFO L267 ElimStorePlain]: Start of recursive call 7: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-12 01:24:58,592 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 61 treesize of output 57 [2018-04-12 01:24:58,593 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 3 [2018-04-12 01:24:58,593 INFO L267 ElimStorePlain]: Start of recursive call 11: End of recursive call: and 1 xjuncts. [2018-04-12 01:24:58,606 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 13 treesize of output 10 [2018-04-12 01:24:58,606 INFO L267 ElimStorePlain]: Start of recursive call 12: End of recursive call: and 2 xjuncts. [2018-04-12 01:24:58,615 INFO L267 ElimStorePlain]: Start of recursive call 10: 2 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-04-12 01:24:58,663 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 119 treesize of output 82 [2018-04-12 01:24:58,665 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 1 [2018-04-12 01:24:58,665 INFO L267 ElimStorePlain]: Start of recursive call 14: End of recursive call: and 1 xjuncts. [2018-04-12 01:24:58,675 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 25 [2018-04-12 01:24:58,675 INFO L267 ElimStorePlain]: Start of recursive call 15: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-04-12 01:24:58,685 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 16 [2018-04-12 01:24:58,685 INFO L267 ElimStorePlain]: Start of recursive call 16: End of recursive call: and 1 xjuncts. [2018-04-12 01:24:58,693 INFO L267 ElimStorePlain]: Start of recursive call 13: 3 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-04-12 01:24:58,740 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 51 treesize of output 45 [2018-04-12 01:24:58,742 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 1 [2018-04-12 01:24:58,742 INFO L267 ElimStorePlain]: Start of recursive call 18: End of recursive call: and 1 xjuncts. [2018-04-12 01:24:58,751 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 3 [2018-04-12 01:24:58,751 INFO L267 ElimStorePlain]: Start of recursive call 19: End of recursive call: and 1 xjuncts. [2018-04-12 01:24:58,757 INFO L267 ElimStorePlain]: Start of recursive call 17: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-12 01:24:58,794 INFO L267 ElimStorePlain]: Start of recursive call 1: 9 dim-0 vars, 4 dim-2 vars, End of recursive call: 3 dim-0 vars, and 3 xjuncts. [2018-04-12 01:24:58,794 INFO L202 ElimStorePlain]: Needed 19 recursive calls to eliminate 13 variables, input treesize:273, output treesize:58 [2018-04-12 01:24:59,009 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 0 proven. 20 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-12 01:24:59,026 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-04-12 01:24:59,027 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [19, 20] total 36 [2018-04-12 01:24:59,027 INFO L442 AbstractCegarLoop]: Interpolant automaton has 37 states [2018-04-12 01:24:59,027 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 37 interpolants. [2018-04-12 01:24:59,027 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=131, Invalid=1201, Unknown=0, NotChecked=0, Total=1332 [2018-04-12 01:24:59,028 INFO L87 Difference]: Start difference. First operand 347 states and 387 transitions. Second operand 37 states. [2018-04-12 01:25:16,140 WARN L151 SmtUtils]: Spent 16044ms on a formula simplification. DAG size of input: 76 DAG size of output 76 [2018-04-12 01:25:30,399 WARN L151 SmtUtils]: Spent 14050ms on a formula simplification. DAG size of input: 127 DAG size of output 79 [2018-04-12 01:25:44,702 WARN L151 SmtUtils]: Spent 14056ms on a formula simplification. DAG size of input: 140 DAG size of output 84 [2018-04-12 01:26:00,948 WARN L151 SmtUtils]: Spent 16050ms on a formula simplification. DAG size of input: 73 DAG size of output 73 [2018-04-12 01:26:01,914 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-12 01:26:01,914 INFO L93 Difference]: Finished difference Result 518 states and 567 transitions. [2018-04-12 01:26:01,914 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 31 states. [2018-04-12 01:26:01,914 INFO L78 Accepts]: Start accepts. Automaton has 37 states. Word has length 55 [2018-04-12 01:26:01,914 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-12 01:26:01,915 INFO L225 Difference]: With dead ends: 518 [2018-04-12 01:26:01,915 INFO L226 Difference]: Without dead ends: 518 [2018-04-12 01:26:01,916 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 100 GetRequests, 38 SyntacticMatches, 2 SemanticMatches, 60 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 874 ImplicationChecksByTransitivity, 78.2s TimeCoverageRelationStatistics Valid=491, Invalid=3291, Unknown=0, NotChecked=0, Total=3782 [2018-04-12 01:26:01,916 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 518 states. [2018-04-12 01:26:01,918 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 518 to 347. [2018-04-12 01:26:01,918 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 347 states. [2018-04-12 01:26:01,918 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 347 states to 347 states and 386 transitions. [2018-04-12 01:26:01,919 INFO L78 Accepts]: Start accepts. Automaton has 347 states and 386 transitions. Word has length 55 [2018-04-12 01:26:01,919 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-12 01:26:01,919 INFO L459 AbstractCegarLoop]: Abstraction has 347 states and 386 transitions. [2018-04-12 01:26:01,919 INFO L460 AbstractCegarLoop]: Interpolant automaton has 37 states. [2018-04-12 01:26:01,919 INFO L276 IsEmpty]: Start isEmpty. Operand 347 states and 386 transitions. [2018-04-12 01:26:01,919 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2018-04-12 01:26:01,919 INFO L347 BasicCegarLoop]: Found error trace [2018-04-12 01:26:01,919 INFO L355 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-12 01:26:01,919 INFO L408 AbstractCegarLoop]: === Iteration 24 === [mainErr51RequiresViolation, mainErr69RequiresViolation, mainErr26RequiresViolation, mainErr54RequiresViolation, mainErr66RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr31RequiresViolation, mainErr46RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr58RequiresViolation, mainErr62RequiresViolation, mainErr15RequiresViolation, mainErr49RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr55RequiresViolation, mainErr65RequiresViolation, mainErr17RequiresViolation, mainErr42RequiresViolation, mainErr71AssertViolationMEMORY_FREE, mainErr30RequiresViolation, mainErr11RequiresViolation, mainErr57RequiresViolation, mainErr63RequiresViolation, mainErr24RequiresViolation, mainErr44RequiresViolation, mainErr10RequiresViolation, mainErr43RequiresViolation, mainErr4RequiresViolation, mainErr50RequiresViolation, mainErr72EnsuresViolationMEMORY_LEAK, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr61RequiresViolation, mainErr59RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr70AssertViolationMEMORY_FREE, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr56RequiresViolation, mainErr64RequiresViolation, mainErr48RequiresViolation, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr52RequiresViolation, mainErr68RequiresViolation, mainErr45RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr60RequiresViolation, mainErr9RequiresViolation, mainErr67RequiresViolation, mainErr53RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr34RequiresViolation, mainErr47RequiresViolation, mainErr14RequiresViolation, mainErr40RequiresViolation]=== [2018-04-12 01:26:01,919 INFO L82 PathProgramCache]: Analyzing trace with hash -1257449240, now seen corresponding path program 1 times [2018-04-12 01:26:01,919 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-04-12 01:26:01,920 INFO L68 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-04-12 01:26:01,920 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-12 01:26:01,920 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-12 01:26:01,920 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-12 01:26:01,926 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-12 01:26:01,926 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-12 01:26:02,257 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-12 01:26:02,258 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-04-12 01:26:02,258 INFO L213 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 10 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 10 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-04-12 01:26:02,264 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-12 01:26:02,284 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-12 01:26:02,286 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-12 01:26:02,322 INFO L700 Elim1Store]: detected not equals via solver [2018-04-12 01:26:02,323 INFO L700 Elim1Store]: detected not equals via solver [2018-04-12 01:26:02,323 INFO L700 Elim1Store]: detected not equals via solver [2018-04-12 01:26:02,324 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 38 [2018-04-12 01:26:02,324 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-12 01:26:02,330 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-12 01:26:02,330 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:26, output treesize:32 [2018-04-12 01:26:02,365 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 30 [2018-04-12 01:26:02,367 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-04-12 01:26:02,367 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-12 01:26:02,371 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-12 01:26:02,378 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-04-12 01:26:02,378 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:43, output treesize:39 [2018-04-12 01:26:02,405 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 38 treesize of output 37 [2018-04-12 01:26:02,407 INFO L700 Elim1Store]: detected not equals via solver [2018-04-12 01:26:02,407 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 23 [2018-04-12 01:26:02,408 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-12 01:26:02,414 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-12 01:26:02,422 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2018-04-12 01:26:02,422 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:52, output treesize:48 [2018-04-12 01:26:02,497 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 71 treesize of output 48 [2018-04-12 01:26:02,500 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 10 [2018-04-12 01:26:02,500 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-12 01:26:02,517 INFO L700 Elim1Store]: detected not equals via solver [2018-04-12 01:26:02,519 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 16 [2018-04-12 01:26:02,519 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-04-12 01:26:02,526 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-04-12 01:26:02,532 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2018-04-12 01:26:02,533 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 4 variables, input treesize:76, output treesize:24 [2018-04-12 01:26:02,587 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-12 01:26:02,617 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-04-12 01:26:02,617 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 11] total 22 [2018-04-12 01:26:02,617 INFO L442 AbstractCegarLoop]: Interpolant automaton has 23 states [2018-04-12 01:26:02,617 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2018-04-12 01:26:02,617 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=89, Invalid=417, Unknown=0, NotChecked=0, Total=506 [2018-04-12 01:26:02,617 INFO L87 Difference]: Start difference. First operand 347 states and 386 transitions. Second operand 23 states. [2018-04-12 01:26:03,753 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-12 01:26:03,753 INFO L93 Difference]: Finished difference Result 410 states and 446 transitions. [2018-04-12 01:26:03,753 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2018-04-12 01:26:03,753 INFO L78 Accepts]: Start accepts. Automaton has 23 states. Word has length 56 [2018-04-12 01:26:03,753 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-12 01:26:03,754 INFO L225 Difference]: With dead ends: 410 [2018-04-12 01:26:03,754 INFO L226 Difference]: Without dead ends: 410 [2018-04-12 01:26:03,755 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 96 GetRequests, 49 SyntacticMatches, 1 SemanticMatches, 46 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 512 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=515, Invalid=1741, Unknown=0, NotChecked=0, Total=2256 [2018-04-12 01:26:03,755 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 410 states. [2018-04-12 01:26:03,757 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 410 to 357. [2018-04-12 01:26:03,757 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 357 states. [2018-04-12 01:26:03,757 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 357 states to 357 states and 399 transitions. [2018-04-12 01:26:03,757 INFO L78 Accepts]: Start accepts. Automaton has 357 states and 399 transitions. Word has length 56 [2018-04-12 01:26:03,757 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-12 01:26:03,758 INFO L459 AbstractCegarLoop]: Abstraction has 357 states and 399 transitions. [2018-04-12 01:26:03,758 INFO L460 AbstractCegarLoop]: Interpolant automaton has 23 states. [2018-04-12 01:26:03,758 INFO L276 IsEmpty]: Start isEmpty. Operand 357 states and 399 transitions. [2018-04-12 01:26:03,758 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2018-04-12 01:26:03,758 INFO L347 BasicCegarLoop]: Found error trace [2018-04-12 01:26:03,758 INFO L355 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-12 01:26:03,758 INFO L408 AbstractCegarLoop]: === Iteration 25 === [mainErr51RequiresViolation, mainErr69RequiresViolation, mainErr26RequiresViolation, mainErr54RequiresViolation, mainErr66RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr31RequiresViolation, mainErr46RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr58RequiresViolation, mainErr62RequiresViolation, mainErr15RequiresViolation, mainErr49RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr55RequiresViolation, mainErr65RequiresViolation, mainErr17RequiresViolation, mainErr42RequiresViolation, mainErr71AssertViolationMEMORY_FREE, mainErr30RequiresViolation, mainErr11RequiresViolation, mainErr57RequiresViolation, mainErr63RequiresViolation, mainErr24RequiresViolation, mainErr44RequiresViolation, mainErr10RequiresViolation, mainErr43RequiresViolation, mainErr4RequiresViolation, mainErr50RequiresViolation, mainErr72EnsuresViolationMEMORY_LEAK, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr61RequiresViolation, mainErr59RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr70AssertViolationMEMORY_FREE, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr56RequiresViolation, mainErr64RequiresViolation, mainErr48RequiresViolation, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr52RequiresViolation, mainErr68RequiresViolation, mainErr45RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr60RequiresViolation, mainErr9RequiresViolation, mainErr67RequiresViolation, mainErr53RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr34RequiresViolation, mainErr47RequiresViolation, mainErr14RequiresViolation, mainErr40RequiresViolation]=== [2018-04-12 01:26:03,758 INFO L82 PathProgramCache]: Analyzing trace with hash -1257449239, now seen corresponding path program 1 times [2018-04-12 01:26:03,758 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-04-12 01:26:03,758 INFO L68 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-04-12 01:26:03,759 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-12 01:26:03,759 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-12 01:26:03,759 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-12 01:26:03,768 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-12 01:26:03,769 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-12 01:26:04,250 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-12 01:26:04,250 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-04-12 01:26:04,250 INFO L213 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 11 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 11 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-04-12 01:26:04,256 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-12 01:26:04,277 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-12 01:26:04,279 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-12 01:26:04,320 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-04-12 01:26:04,320 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-12 01:26:04,328 INFO L700 Elim1Store]: detected not equals via solver [2018-04-12 01:26:04,328 INFO L700 Elim1Store]: detected not equals via solver [2018-04-12 01:26:04,329 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 4 [2018-04-12 01:26:04,329 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-12 01:26:04,334 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-12 01:26:04,334 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:26, output treesize:19 [2018-04-12 01:26:04,355 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 8 [2018-04-12 01:26:04,357 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-04-12 01:26:04,357 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-12 01:26:04,358 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-12 01:26:04,367 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 8 [2018-04-12 01:26:04,369 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-04-12 01:26:04,369 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-04-12 01:26:04,370 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-12 01:26:04,376 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-04-12 01:26:04,376 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 3 variables, input treesize:43, output treesize:36 [2018-04-12 01:26:04,421 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 60 treesize of output 64 [2018-04-12 01:26:04,424 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 13 [2018-04-12 01:26:04,424 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-12 01:26:04,439 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-12 01:26:04,452 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-12 01:26:04,453 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 13 [2018-04-12 01:26:04,454 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-04-12 01:26:04,457 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-12 01:26:04,465 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-04-12 01:26:04,465 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 3 variables, input treesize:78, output treesize:62 [2018-04-12 01:26:04,552 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 82 treesize of output 72 [2018-04-12 01:26:04,560 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 2 case distinctions, treesize of input 20 treesize of output 31 [2018-04-12 01:26:04,560 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 2 xjuncts. [2018-04-12 01:26:04,572 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-04-12 01:26:04,596 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 81 treesize of output 68 [2018-04-12 01:26:04,602 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 2 case distinctions, treesize of input 20 treesize of output 31 [2018-04-12 01:26:04,603 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 2 xjuncts. [2018-04-12 01:26:04,624 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-04-12 01:26:04,628 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 73 treesize of output 60 [2018-04-12 01:26:04,630 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 17 [2018-04-12 01:26:04,630 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2018-04-12 01:26:04,636 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-12 01:26:04,657 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-2 vars, End of recursive call: 3 dim-0 vars, and 2 xjuncts. [2018-04-12 01:26:04,657 INFO L202 ElimStorePlain]: Needed 7 recursive calls to eliminate 4 variables, input treesize:94, output treesize:135 [2018-04-12 01:26:20,712 WARN L148 SmtUtils]: Spent 16026ms on a formula simplification that was a NOOP. DAG size: 49 Received shutdown request... [2018-04-12 01:26:34,778 INFO L175 TraceCheckSpWp]: Timeout while computing interpolants [2018-04-12 01:26:34,779 WARN L519 AbstractCegarLoop]: Verification canceled [2018-04-12 01:26:34,782 WARN L197 ceAbstractionStarter]: Timeout [2018-04-12 01:26:34,783 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 12.04 01:26:34 BoogieIcfgContainer [2018-04-12 01:26:34,783 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-04-12 01:26:34,783 INFO L168 Benchmark]: Toolchain (without parser) took 871923.27 ms. Allocated memory was 469.8 MB in the beginning and 605.6 MB in the end (delta: 135.8 MB). Free memory was 402.5 MB in the beginning and 543.6 MB in the end (delta: -141.1 MB). There was no memory consumed. Max. memory is 5.3 GB. [2018-04-12 01:26:34,784 INFO L168 Benchmark]: CDTParser took 0.10 ms. Allocated memory is still 469.8 MB. Free memory is still 430.3 MB. There was no memory consumed. Max. memory is 5.3 GB. [2018-04-12 01:26:34,784 INFO L168 Benchmark]: CACSL2BoogieTranslator took 251.40 ms. Allocated memory is still 469.8 MB. Free memory was 402.5 MB in the beginning and 369.5 MB in the end (delta: 33.0 MB). Peak memory consumption was 33.0 MB. Max. memory is 5.3 GB. [2018-04-12 01:26:34,784 INFO L168 Benchmark]: Boogie Preprocessor took 47.15 ms. Allocated memory is still 469.8 MB. Free memory is still 369.5 MB. There was no memory consumed. Max. memory is 5.3 GB. [2018-04-12 01:26:34,784 INFO L168 Benchmark]: RCFGBuilder took 599.26 ms. Allocated memory was 469.8 MB in the beginning and 586.2 MB in the end (delta: 116.4 MB). Free memory was 369.5 MB in the beginning and 485.9 MB in the end (delta: -116.5 MB). Peak memory consumption was 40.0 MB. Max. memory is 5.3 GB. [2018-04-12 01:26:34,784 INFO L168 Benchmark]: TraceAbstraction took 871022.40 ms. Allocated memory was 586.2 MB in the beginning and 605.6 MB in the end (delta: 19.4 MB). Free memory was 485.9 MB in the beginning and 543.6 MB in the end (delta: -57.6 MB). There was no memory consumed. Max. memory is 5.3 GB. [2018-04-12 01:26:34,785 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 469.8 MB. Free memory is still 430.3 MB. There was no memory consumed. Max. memory is 5.3 GB. * CACSL2BoogieTranslator took 251.40 ms. Allocated memory is still 469.8 MB. Free memory was 402.5 MB in the beginning and 369.5 MB in the end (delta: 33.0 MB). Peak memory consumption was 33.0 MB. Max. memory is 5.3 GB. * Boogie Preprocessor took 47.15 ms. Allocated memory is still 469.8 MB. Free memory is still 369.5 MB. There was no memory consumed. Max. memory is 5.3 GB. * RCFGBuilder took 599.26 ms. Allocated memory was 469.8 MB in the beginning and 586.2 MB in the end (delta: 116.4 MB). Free memory was 369.5 MB in the beginning and 485.9 MB in the end (delta: -116.5 MB). Peak memory consumption was 40.0 MB. Max. memory is 5.3 GB. * TraceAbstraction took 871022.40 ms. Allocated memory was 586.2 MB in the beginning and 605.6 MB in the end (delta: 19.4 MB). Free memory was 485.9 MB in the beginning and 543.6 MB in the end (delta: -57.6 MB). There was no memory consumed. Max. memory is 5.3 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - TimeoutResultAtElement [Line: 1041]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 1041). Cancelled while BasicCegarLoop was analyzing trace of length 57 with TraceHistMax 2, while TraceCheckSpWp was constructing forward predicates, while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 49. - TimeoutResultAtElement [Line: 1067]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 1067). Cancelled while BasicCegarLoop was analyzing trace of length 57 with TraceHistMax 2, while TraceCheckSpWp was constructing forward predicates, while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 49. - TimeoutResultAtElement [Line: 1021]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 1021). Cancelled while BasicCegarLoop was analyzing trace of length 57 with TraceHistMax 2, while TraceCheckSpWp was constructing forward predicates, while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 49. - TimeoutResultAtElement [Line: 1048]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 1048). Cancelled while BasicCegarLoop was analyzing trace of length 57 with TraceHistMax 2, while TraceCheckSpWp was constructing forward predicates, while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 49. - TimeoutResultAtElement [Line: 1060]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 1060). Cancelled while BasicCegarLoop was analyzing trace of length 57 with TraceHistMax 2, while TraceCheckSpWp was constructing forward predicates, while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 49. - TimeoutResultAtElement [Line: 1011]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 1011). Cancelled while BasicCegarLoop was analyzing trace of length 57 with TraceHistMax 2, while TraceCheckSpWp was constructing forward predicates, while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 49. - TimeoutResultAtElement [Line: 1019]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 1019). Cancelled while BasicCegarLoop was analyzing trace of length 57 with TraceHistMax 2, while TraceCheckSpWp was constructing forward predicates, while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 49. - TimeoutResultAtElement [Line: 1033]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 1033). Cancelled while BasicCegarLoop was analyzing trace of length 57 with TraceHistMax 2, while TraceCheckSpWp was constructing forward predicates, while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 49. - TimeoutResultAtElement [Line: 987]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 987). Cancelled while BasicCegarLoop was analyzing trace of length 57 with TraceHistMax 2, while TraceCheckSpWp was constructing forward predicates, while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 49. - TimeoutResultAtElement [Line: 1026]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 1026). Cancelled while BasicCegarLoop was analyzing trace of length 57 with TraceHistMax 2, while TraceCheckSpWp was constructing forward predicates, while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 49. - TimeoutResultAtElement [Line: 1040]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 1040). Cancelled while BasicCegarLoop was analyzing trace of length 57 with TraceHistMax 2, while TraceCheckSpWp was constructing forward predicates, while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 49. - TimeoutResultAtElement [Line: 1024]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 1024). Cancelled while BasicCegarLoop was analyzing trace of length 57 with TraceHistMax 2, while TraceCheckSpWp was constructing forward predicates, while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 49. - TimeoutResultAtElement [Line: 988]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 988). Cancelled while BasicCegarLoop was analyzing trace of length 57 with TraceHistMax 2, while TraceCheckSpWp was constructing forward predicates, while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 49. - TimeoutResultAtElement [Line: 1051]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 1051). Cancelled while BasicCegarLoop was analyzing trace of length 57 with TraceHistMax 2, while TraceCheckSpWp was constructing forward predicates, while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 49. - TimeoutResultAtElement [Line: 1057]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 1057). Cancelled while BasicCegarLoop was analyzing trace of length 57 with TraceHistMax 2, while TraceCheckSpWp was constructing forward predicates, while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 49. - TimeoutResultAtElement [Line: 1001]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 1001). Cancelled while BasicCegarLoop was analyzing trace of length 57 with TraceHistMax 2, while TraceCheckSpWp was constructing forward predicates, while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 49. - TimeoutResultAtElement [Line: 1041]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 1041). Cancelled while BasicCegarLoop was analyzing trace of length 57 with TraceHistMax 2, while TraceCheckSpWp was constructing forward predicates, while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 49. - TimeoutResultAtElement [Line: 1000]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 1000). Cancelled while BasicCegarLoop was analyzing trace of length 57 with TraceHistMax 2, while TraceCheckSpWp was constructing forward predicates, while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 49. - TimeoutResultAtElement [Line: 998]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 998). Cancelled while BasicCegarLoop was analyzing trace of length 57 with TraceHistMax 2, while TraceCheckSpWp was constructing forward predicates, while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 49. - TimeoutResultAtElement [Line: 1031]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 1031). Cancelled while BasicCegarLoop was analyzing trace of length 57 with TraceHistMax 2, while TraceCheckSpWp was constructing forward predicates, while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 49. - TimeoutResultAtElement [Line: 1048]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 1048). Cancelled while BasicCegarLoop was analyzing trace of length 57 with TraceHistMax 2, while TraceCheckSpWp was constructing forward predicates, while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 49. - TimeoutResultAtElement [Line: 1058]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 1058). Cancelled while BasicCegarLoop was analyzing trace of length 57 with TraceHistMax 2, while TraceCheckSpWp was constructing forward predicates, while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 49. - TimeoutResultAtElement [Line: 1009]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 1009). Cancelled while BasicCegarLoop was analyzing trace of length 57 with TraceHistMax 2, while TraceCheckSpWp was constructing forward predicates, while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 49. - TimeoutResultAtElement [Line: 1036]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 1036). Cancelled while BasicCegarLoop was analyzing trace of length 57 with TraceHistMax 2, while TraceCheckSpWp was constructing forward predicates, while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 49. - TimeoutResultAtElement [Line: 1068]: Timeout (TraceAbstraction) Unable to prove that free always succeeds (line 1068). Cancelled while BasicCegarLoop was analyzing trace of length 57 with TraceHistMax 2, while TraceCheckSpWp was constructing forward predicates, while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 49. - TimeoutResultAtElement [Line: 1026]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 1026). Cancelled while BasicCegarLoop was analyzing trace of length 57 with TraceHistMax 2, while TraceCheckSpWp was constructing forward predicates, while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 49. - TimeoutResultAtElement [Line: 999]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 999). Cancelled while BasicCegarLoop was analyzing trace of length 57 with TraceHistMax 2, while TraceCheckSpWp was constructing forward predicates, while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 49. - TimeoutResultAtElement [Line: 1050]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 1050). Cancelled while BasicCegarLoop was analyzing trace of length 57 with TraceHistMax 2, while TraceCheckSpWp was constructing forward predicates, while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 49. - TimeoutResultAtElement [Line: 1057]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 1057). Cancelled while BasicCegarLoop was analyzing trace of length 57 with TraceHistMax 2, while TraceCheckSpWp was constructing forward predicates, while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 49. - TimeoutResultAtElement [Line: 1019]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 1019). Cancelled while BasicCegarLoop was analyzing trace of length 57 with TraceHistMax 2, while TraceCheckSpWp was constructing forward predicates, while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 49. - TimeoutResultAtElement [Line: 1040]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 1040). Cancelled while BasicCegarLoop was analyzing trace of length 57 with TraceHistMax 2, while TraceCheckSpWp was constructing forward predicates, while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 49. - TimeoutResultAtElement [Line: 999]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 999). Cancelled while BasicCegarLoop was analyzing trace of length 57 with TraceHistMax 2, while TraceCheckSpWp was constructing forward predicates, while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 49. - TimeoutResultAtElement [Line: 1036]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 1036). Cancelled while BasicCegarLoop was analyzing trace of length 57 with TraceHistMax 2, while TraceCheckSpWp was constructing forward predicates, while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 49. - TimeoutResultAtElement [Line: 989]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 989). Cancelled while BasicCegarLoop was analyzing trace of length 57 with TraceHistMax 2, while TraceCheckSpWp was constructing forward predicates, while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 49. - TimeoutResultAtElement [Line: 1041]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 1041). Cancelled while BasicCegarLoop was analyzing trace of length 57 with TraceHistMax 2, while TraceCheckSpWp was constructing forward predicates, while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 49. - TimeoutResultAtElement [Line: 983]: Timeout (TraceAbstraction) Unable to prove that all allocated memory was freed (line 983). Cancelled while BasicCegarLoop was analyzing trace of length 57 with TraceHistMax 2, while TraceCheckSpWp was constructing forward predicates, while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 49. - TimeoutResultAtElement [Line: 1032]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 1032). Cancelled while BasicCegarLoop was analyzing trace of length 57 with TraceHistMax 2, while TraceCheckSpWp was constructing forward predicates, while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 49. - TimeoutResultAtElement [Line: 989]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 989). Cancelled while BasicCegarLoop was analyzing trace of length 57 with TraceHistMax 2, while TraceCheckSpWp was constructing forward predicates, while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 49. - TimeoutResultAtElement [Line: 1000]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 1000). Cancelled while BasicCegarLoop was analyzing trace of length 57 with TraceHistMax 2, while TraceCheckSpWp was constructing forward predicates, while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 49. - TimeoutResultAtElement [Line: 1032]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 1032). Cancelled while BasicCegarLoop was analyzing trace of length 57 with TraceHistMax 2, while TraceCheckSpWp was constructing forward predicates, while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 49. - TimeoutResultAtElement [Line: 1053]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 1053). Cancelled while BasicCegarLoop was analyzing trace of length 57 with TraceHistMax 2, while TraceCheckSpWp was constructing forward predicates, while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 49. - TimeoutResultAtElement [Line: 1051]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 1051). Cancelled while BasicCegarLoop was analyzing trace of length 57 with TraceHistMax 2, while TraceCheckSpWp was constructing forward predicates, while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 49. - TimeoutResultAtElement [Line: 1024]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 1024). Cancelled while BasicCegarLoop was analyzing trace of length 57 with TraceHistMax 2, while TraceCheckSpWp was constructing forward predicates, while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 49. - TimeoutResultAtElement [Line: 1027]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 1027). Cancelled while BasicCegarLoop was analyzing trace of length 57 with TraceHistMax 2, while TraceCheckSpWp was constructing forward predicates, while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 49. - TimeoutResultAtElement [Line: 1068]: Timeout (TraceAbstraction) Unable to prove that free always succeeds (line 1068). Cancelled while BasicCegarLoop was analyzing trace of length 57 with TraceHistMax 2, while TraceCheckSpWp was constructing forward predicates, while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 49. - TimeoutResultAtElement [Line: 1019]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 1019). Cancelled while BasicCegarLoop was analyzing trace of length 57 with TraceHistMax 2, while TraceCheckSpWp was constructing forward predicates, while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 49. - TimeoutResultAtElement [Line: 1034]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 1034). Cancelled while BasicCegarLoop was analyzing trace of length 57 with TraceHistMax 2, while TraceCheckSpWp was constructing forward predicates, while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 49. - TimeoutResultAtElement [Line: 1050]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 1050). Cancelled while BasicCegarLoop was analyzing trace of length 57 with TraceHistMax 2, while TraceCheckSpWp was constructing forward predicates, while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 49. - TimeoutResultAtElement [Line: 1058]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 1058). Cancelled while BasicCegarLoop was analyzing trace of length 57 with TraceHistMax 2, while TraceCheckSpWp was constructing forward predicates, while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 49. - TimeoutResultAtElement [Line: 1041]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 1041). Cancelled while BasicCegarLoop was analyzing trace of length 57 with TraceHistMax 2, while TraceCheckSpWp was constructing forward predicates, while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 49. - TimeoutResultAtElement [Line: 1033]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 1033). Cancelled while BasicCegarLoop was analyzing trace of length 57 with TraceHistMax 2, while TraceCheckSpWp was constructing forward predicates, while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 49. - TimeoutResultAtElement [Line: 1009]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 1009). Cancelled while BasicCegarLoop was analyzing trace of length 57 with TraceHistMax 2, while TraceCheckSpWp was constructing forward predicates, while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 49. - TimeoutResultAtElement [Line: 1019]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 1019). Cancelled while BasicCegarLoop was analyzing trace of length 57 with TraceHistMax 2, while TraceCheckSpWp was constructing forward predicates, while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 49. - TimeoutResultAtElement [Line: 988]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 988). Cancelled while BasicCegarLoop was analyzing trace of length 57 with TraceHistMax 2, while TraceCheckSpWp was constructing forward predicates, while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 49. - TimeoutResultAtElement [Line: 1042]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 1042). Cancelled while BasicCegarLoop was analyzing trace of length 57 with TraceHistMax 2, while TraceCheckSpWp was constructing forward predicates, while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 49. - TimeoutResultAtElement [Line: 1067]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 1067). Cancelled while BasicCegarLoop was analyzing trace of length 57 with TraceHistMax 2, while TraceCheckSpWp was constructing forward predicates, while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 49. - TimeoutResultAtElement [Line: 1040]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 1040). Cancelled while BasicCegarLoop was analyzing trace of length 57 with TraceHistMax 2, while TraceCheckSpWp was constructing forward predicates, while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 49. - TimeoutResultAtElement [Line: 1011]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 1011). Cancelled while BasicCegarLoop was analyzing trace of length 57 with TraceHistMax 2, while TraceCheckSpWp was constructing forward predicates, while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 49. - TimeoutResultAtElement [Line: 1019]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 1019). Cancelled while BasicCegarLoop was analyzing trace of length 57 with TraceHistMax 2, while TraceCheckSpWp was constructing forward predicates, while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 49. - TimeoutResultAtElement [Line: 1027]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 1027). Cancelled while BasicCegarLoop was analyzing trace of length 57 with TraceHistMax 2, while TraceCheckSpWp was constructing forward predicates, while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 49. - TimeoutResultAtElement [Line: 1021]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 1021). Cancelled while BasicCegarLoop was analyzing trace of length 57 with TraceHistMax 2, while TraceCheckSpWp was constructing forward predicates, while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 49. - TimeoutResultAtElement [Line: 987]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 987). Cancelled while BasicCegarLoop was analyzing trace of length 57 with TraceHistMax 2, while TraceCheckSpWp was constructing forward predicates, while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 49. - TimeoutResultAtElement [Line: 1053]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 1053). Cancelled while BasicCegarLoop was analyzing trace of length 57 with TraceHistMax 2, while TraceCheckSpWp was constructing forward predicates, while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 49. - TimeoutResultAtElement [Line: 999]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 999). Cancelled while BasicCegarLoop was analyzing trace of length 57 with TraceHistMax 2, while TraceCheckSpWp was constructing forward predicates, while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 49. - TimeoutResultAtElement [Line: 1060]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 1060). Cancelled while BasicCegarLoop was analyzing trace of length 57 with TraceHistMax 2, while TraceCheckSpWp was constructing forward predicates, while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 49. - TimeoutResultAtElement [Line: 1042]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 1042). Cancelled while BasicCegarLoop was analyzing trace of length 57 with TraceHistMax 2, while TraceCheckSpWp was constructing forward predicates, while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 49. - TimeoutResultAtElement [Line: 998]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 998). Cancelled while BasicCegarLoop was analyzing trace of length 57 with TraceHistMax 2, while TraceCheckSpWp was constructing forward predicates, while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 49. - TimeoutResultAtElement [Line: 1019]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 1019). Cancelled while BasicCegarLoop was analyzing trace of length 57 with TraceHistMax 2, while TraceCheckSpWp was constructing forward predicates, while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 49. - TimeoutResultAtElement [Line: 999]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 999). Cancelled while BasicCegarLoop was analyzing trace of length 57 with TraceHistMax 2, while TraceCheckSpWp was constructing forward predicates, while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 49. - TimeoutResultAtElement [Line: 1031]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 1031). Cancelled while BasicCegarLoop was analyzing trace of length 57 with TraceHistMax 2, while TraceCheckSpWp was constructing forward predicates, while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 49. - TimeoutResultAtElement [Line: 1040]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 1040). Cancelled while BasicCegarLoop was analyzing trace of length 57 with TraceHistMax 2, while TraceCheckSpWp was constructing forward predicates, while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 49. - TimeoutResultAtElement [Line: 1001]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 1001). Cancelled while BasicCegarLoop was analyzing trace of length 57 with TraceHistMax 2, while TraceCheckSpWp was constructing forward predicates, while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 49. - TimeoutResultAtElement [Line: 1034]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 1034). Cancelled while BasicCegarLoop was analyzing trace of length 57 with TraceHistMax 2, while TraceCheckSpWp was constructing forward predicates, while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 49. - StatisticsResult: Ultimate Automizer benchmark data CFG has 3 procedures, 185 locations, 73 error locations. TIMEOUT Result, 870.9s OverallTime, 25 OverallIterations, 3 TraceHistogramMax, 709.8s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 2939 SDtfs, 17211 SDslu, 17325 SDs, 0 SdLazy, 23278 SolverSat, 2186 SolverUnsat, 63 SolverUnknown, 0 SolverNotchecked, 13.5s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 1054 GetRequests, 383 SyntacticMatches, 15 SemanticMatches, 656 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9941 ImplicationChecksByTransitivity, 819.7s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=357occurred in iteration=24, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s AbstIntTime, 0 AbstIntIterations, 0 AbstIntStrong, NaN AbsIntWeakeningRatio, NaN AbsIntAvgWeakeningVarsNumRemoved, NaN AbsIntAvgWeakenedConjuncts, 0.0s DumpTime, AutomataMinimizationStatistics: 0.1s AutomataMinimizationTime, 24 MinimizatonAttempts, 1883 StatesRemovedByMinimization, 22 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.3s SatisfiabilityAnalysisTime, 129.1s InterpolantComputationTime, 1326 NumberOfCodeBlocks, 1326 NumberOfCodeBlocksAsserted, 33 NumberOfCheckSat, 1293 ConstructedInterpolants, 154 QuantifiedInterpolants, 1378394 SizeOfPredicates, 131 NumberOfNonLiveVariables, 1785 ConjunctsInSsa, 316 ConjunctsInUnsatCore, 33 InterpolantComputations, 16 PerfectInterpolantSequences, 33/160 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate could not prove your program: Timeout Written .csv to /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/dll-sorted_true-unreach-call_true-valid-memsafety.i_svcomp-DerefFreeMemtrack-32bit-Automizer_Camel.epf_AutomizerC.xml/Csv-Benchmark-0-2018-04-12_01-26-34-792.csv Written .csv to /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/dll-sorted_true-unreach-call_true-valid-memsafety.i_svcomp-DerefFreeMemtrack-32bit-Automizer_Camel.epf_AutomizerC.xml/Csv-TraceAbstractionBenchmarks-0-2018-04-12_01-26-34-792.csv Completed graceful shutdown