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/sll-01_true-unreach-call_true-valid-memsafety.i -------------------------------------------------------------------------------- This is Ultimate 0.1.23-666feb3-m [2018-04-11 12:26:36,366 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-04-11 12:26:36,367 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-04-11 12:26:36,380 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-04-11 12:26:36,381 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-04-11 12:26:36,381 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-04-11 12:26:36,382 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-04-11 12:26:36,383 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-04-11 12:26:36,385 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-04-11 12:26:36,385 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-04-11 12:26:36,386 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-04-11 12:26:36,386 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-04-11 12:26:36,387 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-04-11 12:26:36,388 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-04-11 12:26:36,389 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-04-11 12:26:36,390 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-04-11 12:26:36,392 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-04-11 12:26:36,393 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-04-11 12:26:36,394 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-04-11 12:26:36,395 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-04-11 12:26:36,396 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-04-11 12:26:36,396 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-04-11 12:26:36,396 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-04-11 12:26:36,397 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-04-11 12:26:36,398 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-04-11 12:26:36,399 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-04-11 12:26:36,399 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-04-11 12:26:36,400 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-04-11 12:26:36,400 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-04-11 12:26:36,400 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-04-11 12:26:36,400 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-04-11 12:26:36,401 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-11 12:26:36,420 INFO L110 SettingsManager]: Loading preferences was successful [2018-04-11 12:26:36,420 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-04-11 12:26:36,421 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-04-11 12:26:36,421 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-04-11 12:26:36,421 INFO L133 SettingsManager]: * Use SBE=true [2018-04-11 12:26:36,422 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-04-11 12:26:36,422 INFO L133 SettingsManager]: * sizeof long=4 [2018-04-11 12:26:36,422 INFO L133 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2018-04-11 12:26:36,422 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-04-11 12:26:36,422 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-04-11 12:26:36,422 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-04-11 12:26:36,422 INFO L133 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2018-04-11 12:26:36,422 INFO L133 SettingsManager]: * Bitprecise bitfields=true [2018-04-11 12:26:36,422 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-04-11 12:26:36,422 INFO L133 SettingsManager]: * sizeof long double=12 [2018-04-11 12:26:36,423 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-04-11 12:26:36,423 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-04-11 12:26:36,423 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-04-11 12:26:36,423 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-04-11 12:26:36,423 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-04-11 12:26:36,423 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-04-11 12:26:36,423 INFO L133 SettingsManager]: * Interpolant automaton=TWOTRACK [2018-04-11 12:26:36,423 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-04-11 12:26:36,423 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Bitprecise bitfields -> false [2018-04-11 12:26:36,450 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-04-11 12:26:36,457 INFO L266 ainManager$Toolchain]: [Toolchain 1]: Parser(s) successfully (re)initialized [2018-04-11 12:26:36,460 INFO L222 ainManager$Toolchain]: [Toolchain 1]: Toolchain data selected. [2018-04-11 12:26:36,461 INFO L271 PluginConnector]: Initializing CDTParser... [2018-04-11 12:26:36,461 INFO L276 PluginConnector]: CDTParser initialized [2018-04-11 12:26:36,462 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/forester-heap/sll-01_true-unreach-call_true-valid-memsafety.i [2018-04-11 12:26:36,756 INFO L225 CDTParser]: Created temporary CDT project at /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/data/FLAG5f3a95fb3 [2018-04-11 12:26:36,913 INFO L287 CDTParser]: IsIndexed: true [2018-04-11 12:26:36,913 INFO L288 CDTParser]: Found 1 translation units. [2018-04-11 12:26:36,913 INFO L168 CDTParser]: Scanning sll-01_true-unreach-call_true-valid-memsafety.i [2018-04-11 12:26:36,921 INFO L210 ultiparseSymbolTable]: Include resolver: [2018-04-11 12:26:36,922 INFO L215 ultiparseSymbolTable]: [2018-04-11 12:26:36,922 INFO L218 ultiparseSymbolTable]: Function table: [2018-04-11 12:26:36,922 INFO L221 ultiparseSymbolTable]: Function definition of null ('main') in sll-01_true-unreach-call_true-valid-memsafety.i [2018-04-11 12:26:36,922 INFO L227 ultiparseSymbolTable]: Global variable table: [2018-04-11 12:26:36,922 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fsll____true_unreach_call_true_valid_memsafety_i__u_int32_t in sll-01_true-unreach-call_true-valid-memsafety.i [2018-04-11 12:26:36,922 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fsll____true_unreach_call_true_valid_memsafety_i__u_quad_t in sll-01_true-unreach-call_true-valid-memsafety.i [2018-04-11 12:26:36,922 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fsll____true_unreach_call_true_valid_memsafety_i__ulong in sll-01_true-unreach-call_true-valid-memsafety.i [2018-04-11 12:26:36,922 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fsll____true_unreach_call_true_valid_memsafety_i__blkcnt_t in sll-01_true-unreach-call_true-valid-memsafety.i [2018-04-11 12:26:36,923 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fsll____true_unreach_call_true_valid_memsafety_i__u_char in sll-01_true-unreach-call_true-valid-memsafety.i [2018-04-11 12:26:36,923 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fsll____true_unreach_call_true_valid_memsafety_i____caddr_t in sll-01_true-unreach-call_true-valid-memsafety.i [2018-04-11 12:26:36,923 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fsll____true_unreach_call_true_valid_memsafety_i__int16_t in sll-01_true-unreach-call_true-valid-memsafety.i [2018-04-11 12:26:36,923 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fsll____true_unreach_call_true_valid_memsafety_i__pthread_barrierattr_t in sll-01_true-unreach-call_true-valid-memsafety.i [2018-04-11 12:26:36,923 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fsll____true_unreach_call_true_valid_memsafety_i____dev_t in sll-01_true-unreach-call_true-valid-memsafety.i [2018-04-11 12:26:36,923 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fsll____true_unreach_call_true_valid_memsafety_i____fsblkcnt_t in sll-01_true-unreach-call_true-valid-memsafety.i [2018-04-11 12:26:36,923 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fsll____true_unreach_call_true_valid_memsafety_i__lldiv_t in sll-01_true-unreach-call_true-valid-memsafety.i [2018-04-11 12:26:36,923 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fsll____true_unreach_call_true_valid_memsafety_i__clock_t in sll-01_true-unreach-call_true-valid-memsafety.i [2018-04-11 12:26:36,923 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fsll____true_unreach_call_true_valid_memsafety_i__fd_set in sll-01_true-unreach-call_true-valid-memsafety.i [2018-04-11 12:26:36,923 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fsll____true_unreach_call_true_valid_memsafety_i__uid_t in sll-01_true-unreach-call_true-valid-memsafety.i [2018-04-11 12:26:36,923 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fsll____true_unreach_call_true_valid_memsafety_i__pthread_rwlock_t in sll-01_true-unreach-call_true-valid-memsafety.i [2018-04-11 12:26:36,924 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fsll____true_unreach_call_true_valid_memsafety_i____uint32_t in sll-01_true-unreach-call_true-valid-memsafety.i [2018-04-11 12:26:36,924 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fsll____true_unreach_call_true_valid_memsafety_i__pthread_rwlockattr_t in sll-01_true-unreach-call_true-valid-memsafety.i [2018-04-11 12:26:36,924 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fsll____true_unreach_call_true_valid_memsafety_i__pthread_key_t in sll-01_true-unreach-call_true-valid-memsafety.i [2018-04-11 12:26:36,924 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fsll____true_unreach_call_true_valid_memsafety_i____fsid_t in sll-01_true-unreach-call_true-valid-memsafety.i [2018-04-11 12:26:36,924 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fsll____true_unreach_call_true_valid_memsafety_i__div_t in sll-01_true-unreach-call_true-valid-memsafety.i [2018-04-11 12:26:36,924 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fsll____true_unreach_call_true_valid_memsafety_i____ino_t in sll-01_true-unreach-call_true-valid-memsafety.i [2018-04-11 12:26:36,924 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fsll____true_unreach_call_true_valid_memsafety_i____u_long in sll-01_true-unreach-call_true-valid-memsafety.i [2018-04-11 12:26:36,924 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fsll____true_unreach_call_true_valid_memsafety_i____int16_t in sll-01_true-unreach-call_true-valid-memsafety.i [2018-04-11 12:26:36,924 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fsll____true_unreach_call_true_valid_memsafety_i____ino64_t in sll-01_true-unreach-call_true-valid-memsafety.i [2018-04-11 12:26:36,924 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fsll____true_unreach_call_true_valid_memsafety_i__blksize_t in sll-01_true-unreach-call_true-valid-memsafety.i [2018-04-11 12:26:36,924 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fsll____true_unreach_call_true_valid_memsafety_i__caddr_t in sll-01_true-unreach-call_true-valid-memsafety.i [2018-04-11 12:26:36,924 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fsll____true_unreach_call_true_valid_memsafety_i__sigset_t in sll-01_true-unreach-call_true-valid-memsafety.i [2018-04-11 12:26:36,924 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fsll____true_unreach_call_true_valid_memsafety_i____blkcnt_t in sll-01_true-unreach-call_true-valid-memsafety.i [2018-04-11 12:26:36,924 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fsll____true_unreach_call_true_valid_memsafety_i__int64_t in sll-01_true-unreach-call_true-valid-memsafety.i [2018-04-11 12:26:36,924 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fsll____true_unreach_call_true_valid_memsafety_i____sigset_t in sll-01_true-unreach-call_true-valid-memsafety.i [2018-04-11 12:26:36,924 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fsll____true_unreach_call_true_valid_memsafety_i____loff_t in sll-01_true-unreach-call_true-valid-memsafety.i [2018-04-11 12:26:36,925 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fsll____true_unreach_call_true_valid_memsafety_i__pthread_mutex_t in sll-01_true-unreach-call_true-valid-memsafety.i [2018-04-11 12:26:36,925 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fsll____true_unreach_call_true_valid_memsafety_i____clock_t in sll-01_true-unreach-call_true-valid-memsafety.i [2018-04-11 12:26:36,925 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fsll____true_unreach_call_true_valid_memsafety_i__fsid_t in sll-01_true-unreach-call_true-valid-memsafety.i [2018-04-11 12:26:36,925 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fsll____true_unreach_call_true_valid_memsafety_i__ushort in sll-01_true-unreach-call_true-valid-memsafety.i [2018-04-11 12:26:36,925 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fsll____true_unreach_call_true_valid_memsafety_i__SLL in sll-01_true-unreach-call_true-valid-memsafety.i [2018-04-11 12:26:36,925 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fsll____true_unreach_call_true_valid_memsafety_i____key_t in sll-01_true-unreach-call_true-valid-memsafety.i [2018-04-11 12:26:36,925 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fsll____true_unreach_call_true_valid_memsafety_i__time_t in sll-01_true-unreach-call_true-valid-memsafety.i [2018-04-11 12:26:36,925 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fsll____true_unreach_call_true_valid_memsafety_i____syscall_slong_t in sll-01_true-unreach-call_true-valid-memsafety.i [2018-04-11 12:26:36,925 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fsll____true_unreach_call_true_valid_memsafety_i__u_long in sll-01_true-unreach-call_true-valid-memsafety.i [2018-04-11 12:26:36,925 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fsll____true_unreach_call_true_valid_memsafety_i____useconds_t in sll-01_true-unreach-call_true-valid-memsafety.i [2018-04-11 12:26:36,926 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fsll____true_unreach_call_true_valid_memsafety_i__suseconds_t in sll-01_true-unreach-call_true-valid-memsafety.i [2018-04-11 12:26:36,926 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fsll____true_unreach_call_true_valid_memsafety_i____u_short in sll-01_true-unreach-call_true-valid-memsafety.i [2018-04-11 12:26:36,926 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fsll____true_unreach_call_true_valid_memsafety_i__mode_t in sll-01_true-unreach-call_true-valid-memsafety.i [2018-04-11 12:26:36,926 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fsll____true_unreach_call_true_valid_memsafety_i__ino_t in sll-01_true-unreach-call_true-valid-memsafety.i [2018-04-11 12:26:36,926 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fsll____true_unreach_call_true_valid_memsafety_i__daddr_t in sll-01_true-unreach-call_true-valid-memsafety.i [2018-04-11 12:26:36,926 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fsll____true_unreach_call_true_valid_memsafety_i__u_int64_t in sll-01_true-unreach-call_true-valid-memsafety.i [2018-04-11 12:26:36,926 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fsll____true_unreach_call_true_valid_memsafety_i____fsfilcnt64_t in sll-01_true-unreach-call_true-valid-memsafety.i [2018-04-11 12:26:36,926 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fsll____true_unreach_call_true_valid_memsafety_i__pthread_condattr_t in sll-01_true-unreach-call_true-valid-memsafety.i [2018-04-11 12:26:36,926 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fsll____true_unreach_call_true_valid_memsafety_i__ldiv_t in sll-01_true-unreach-call_true-valid-memsafety.i [2018-04-11 12:26:36,926 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fsll____true_unreach_call_true_valid_memsafety_i____int64_t in sll-01_true-unreach-call_true-valid-memsafety.i [2018-04-11 12:26:36,926 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fsll____true_unreach_call_true_valid_memsafety_i__int8_t in sll-01_true-unreach-call_true-valid-memsafety.i [2018-04-11 12:26:36,927 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fsll____true_unreach_call_true_valid_memsafety_i__loff_t in sll-01_true-unreach-call_true-valid-memsafety.i [2018-04-11 12:26:36,927 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fsll____true_unreach_call_true_valid_memsafety_i____uint8_t in sll-01_true-unreach-call_true-valid-memsafety.i [2018-04-11 12:26:36,927 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fsll____true_unreach_call_true_valid_memsafety_i____time_t in sll-01_true-unreach-call_true-valid-memsafety.i [2018-04-11 12:26:36,927 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fsll____true_unreach_call_true_valid_memsafety_i____qaddr_t in sll-01_true-unreach-call_true-valid-memsafety.i [2018-04-11 12:26:36,927 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fsll____true_unreach_call_true_valid_memsafety_i____blksize_t in sll-01_true-unreach-call_true-valid-memsafety.i [2018-04-11 12:26:36,927 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fsll____true_unreach_call_true_valid_memsafety_i____fsfilcnt_t in sll-01_true-unreach-call_true-valid-memsafety.i [2018-04-11 12:26:36,927 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fsll____true_unreach_call_true_valid_memsafety_i____daddr_t in sll-01_true-unreach-call_true-valid-memsafety.i [2018-04-11 12:26:36,927 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fsll____true_unreach_call_true_valid_memsafety_i____uint16_t in sll-01_true-unreach-call_true-valid-memsafety.i [2018-04-11 12:26:36,927 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fsll____true_unreach_call_true_valid_memsafety_i____rlim64_t in sll-01_true-unreach-call_true-valid-memsafety.i [2018-04-11 12:26:36,928 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fsll____true_unreach_call_true_valid_memsafety_i____fsblkcnt64_t in sll-01_true-unreach-call_true-valid-memsafety.i [2018-04-11 12:26:36,928 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fsll____true_unreach_call_true_valid_memsafety_i____fsword_t in sll-01_true-unreach-call_true-valid-memsafety.i [2018-04-11 12:26:36,928 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fsll____true_unreach_call_true_valid_memsafety_i____uint64_t in sll-01_true-unreach-call_true-valid-memsafety.i [2018-04-11 12:26:36,928 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fsll____true_unreach_call_true_valid_memsafety_i__pthread_once_t in sll-01_true-unreach-call_true-valid-memsafety.i [2018-04-11 12:26:36,928 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fsll____true_unreach_call_true_valid_memsafety_i____int8_t in sll-01_true-unreach-call_true-valid-memsafety.i [2018-04-11 12:26:36,928 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fsll____true_unreach_call_true_valid_memsafety_i__ssize_t in sll-01_true-unreach-call_true-valid-memsafety.i [2018-04-11 12:26:36,928 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fsll____true_unreach_call_true_valid_memsafety_i____uid_t in sll-01_true-unreach-call_true-valid-memsafety.i [2018-04-11 12:26:36,928 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fsll____true_unreach_call_true_valid_memsafety_i____nlink_t in sll-01_true-unreach-call_true-valid-memsafety.i [2018-04-11 12:26:36,928 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fsll____true_unreach_call_true_valid_memsafety_i____sig_atomic_t in sll-01_true-unreach-call_true-valid-memsafety.i [2018-04-11 12:26:36,928 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fsll____true_unreach_call_true_valid_memsafety_i__pthread_attr_t in sll-01_true-unreach-call_true-valid-memsafety.i [2018-04-11 12:26:36,928 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fsll____true_unreach_call_true_valid_memsafety_i__timer_t in sll-01_true-unreach-call_true-valid-memsafety.i [2018-04-11 12:26:36,928 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fsll____true_unreach_call_true_valid_memsafety_i__register_t in sll-01_true-unreach-call_true-valid-memsafety.i [2018-04-11 12:26:36,929 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fsll____true_unreach_call_true_valid_memsafety_i__pid_t in sll-01_true-unreach-call_true-valid-memsafety.i [2018-04-11 12:26:36,929 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fsll____true_unreach_call_true_valid_memsafety_i__uint in sll-01_true-unreach-call_true-valid-memsafety.i [2018-04-11 12:26:36,929 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fsll____true_unreach_call_true_valid_memsafety_i__int32_t in sll-01_true-unreach-call_true-valid-memsafety.i [2018-04-11 12:26:36,929 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fsll____true_unreach_call_true_valid_memsafety_i____socklen_t in sll-01_true-unreach-call_true-valid-memsafety.i [2018-04-11 12:26:36,929 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fsll____true_unreach_call_true_valid_memsafety_i__fsfilcnt_t in sll-01_true-unreach-call_true-valid-memsafety.i [2018-04-11 12:26:36,929 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fsll____true_unreach_call_true_valid_memsafety_i____blkcnt64_t in sll-01_true-unreach-call_true-valid-memsafety.i [2018-04-11 12:26:36,929 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fsll____true_unreach_call_true_valid_memsafety_i____u_int in sll-01_true-unreach-call_true-valid-memsafety.i [2018-04-11 12:26:36,929 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fsll____true_unreach_call_true_valid_memsafety_i__off_t in sll-01_true-unreach-call_true-valid-memsafety.i [2018-04-11 12:26:36,929 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fsll____true_unreach_call_true_valid_memsafety_i__nlink_t in sll-01_true-unreach-call_true-valid-memsafety.i [2018-04-11 12:26:36,929 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fsll____true_unreach_call_true_valid_memsafety_i__gid_t in sll-01_true-unreach-call_true-valid-memsafety.i [2018-04-11 12:26:36,929 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fsll____true_unreach_call_true_valid_memsafety_i____intptr_t in sll-01_true-unreach-call_true-valid-memsafety.i [2018-04-11 12:26:36,930 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fsll____true_unreach_call_true_valid_memsafety_i__u_short in sll-01_true-unreach-call_true-valid-memsafety.i [2018-04-11 12:26:36,930 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fsll____true_unreach_call_true_valid_memsafety_i__dev_t in sll-01_true-unreach-call_true-valid-memsafety.i [2018-04-11 12:26:36,930 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fsll____true_unreach_call_true_valid_memsafety_i__pthread_spinlock_t in sll-01_true-unreach-call_true-valid-memsafety.i [2018-04-11 12:26:36,930 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fsll____true_unreach_call_true_valid_memsafety_i__id_t in sll-01_true-unreach-call_true-valid-memsafety.i [2018-04-11 12:26:36,930 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fsll____true_unreach_call_true_valid_memsafety_i____mode_t in sll-01_true-unreach-call_true-valid-memsafety.i [2018-04-11 12:26:36,930 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fsll____true_unreach_call_true_valid_memsafety_i____rlim_t in sll-01_true-unreach-call_true-valid-memsafety.i [2018-04-11 12:26:36,930 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fsll____true_unreach_call_true_valid_memsafety_i__key_t in sll-01_true-unreach-call_true-valid-memsafety.i [2018-04-11 12:26:36,930 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fsll____true_unreach_call_true_valid_memsafety_i__fd_mask in sll-01_true-unreach-call_true-valid-memsafety.i [2018-04-11 12:26:36,930 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fsll____true_unreach_call_true_valid_memsafety_i__quad_t in sll-01_true-unreach-call_true-valid-memsafety.i [2018-04-11 12:26:36,930 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fsll____true_unreach_call_true_valid_memsafety_i__size_t in sll-01_true-unreach-call_true-valid-memsafety.i [2018-04-11 12:26:36,930 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fsll____true_unreach_call_true_valid_memsafety_i____int32_t in sll-01_true-unreach-call_true-valid-memsafety.i [2018-04-11 12:26:36,930 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fsll____true_unreach_call_true_valid_memsafety_i__u_int16_t in sll-01_true-unreach-call_true-valid-memsafety.i [2018-04-11 12:26:36,930 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fsll____true_unreach_call_true_valid_memsafety_i__pthread_cond_t in sll-01_true-unreach-call_true-valid-memsafety.i [2018-04-11 12:26:36,930 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fsll____true_unreach_call_true_valid_memsafety_i____u_quad_t in sll-01_true-unreach-call_true-valid-memsafety.i [2018-04-11 12:26:36,930 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fsll____true_unreach_call_true_valid_memsafety_i__pthread_barrier_t in sll-01_true-unreach-call_true-valid-memsafety.i [2018-04-11 12:26:36,930 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fsll____true_unreach_call_true_valid_memsafety_i____pthread_slist_t in sll-01_true-unreach-call_true-valid-memsafety.i [2018-04-11 12:26:36,930 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fsll____true_unreach_call_true_valid_memsafety_i____clockid_t in sll-01_true-unreach-call_true-valid-memsafety.i [2018-04-11 12:26:36,931 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fsll____true_unreach_call_true_valid_memsafety_i__clockid_t in sll-01_true-unreach-call_true-valid-memsafety.i [2018-04-11 12:26:36,931 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fsll____true_unreach_call_true_valid_memsafety_i____off_t in sll-01_true-unreach-call_true-valid-memsafety.i [2018-04-11 12:26:36,931 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fsll____true_unreach_call_true_valid_memsafety_i____ssize_t in sll-01_true-unreach-call_true-valid-memsafety.i [2018-04-11 12:26:36,931 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fsll____true_unreach_call_true_valid_memsafety_i__idtype_t in sll-01_true-unreach-call_true-valid-memsafety.i [2018-04-11 12:26:36,931 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fsll____true_unreach_call_true_valid_memsafety_i__wchar_t in sll-01_true-unreach-call_true-valid-memsafety.i [2018-04-11 12:26:36,931 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fsll____true_unreach_call_true_valid_memsafety_i____id_t in sll-01_true-unreach-call_true-valid-memsafety.i [2018-04-11 12:26:36,931 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fsll____true_unreach_call_true_valid_memsafety_i____quad_t in sll-01_true-unreach-call_true-valid-memsafety.i [2018-04-11 12:26:36,931 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fsll____true_unreach_call_true_valid_memsafety_i____fd_mask in sll-01_true-unreach-call_true-valid-memsafety.i [2018-04-11 12:26:36,931 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fsll____true_unreach_call_true_valid_memsafety_i____syscall_ulong_t in sll-01_true-unreach-call_true-valid-memsafety.i [2018-04-11 12:26:36,931 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fsll____true_unreach_call_true_valid_memsafety_i____u_char in sll-01_true-unreach-call_true-valid-memsafety.i [2018-04-11 12:26:36,931 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fsll____true_unreach_call_true_valid_memsafety_i__pthread_t in sll-01_true-unreach-call_true-valid-memsafety.i [2018-04-11 12:26:36,931 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fsll____true_unreach_call_true_valid_memsafety_i__u_int8_t in sll-01_true-unreach-call_true-valid-memsafety.i [2018-04-11 12:26:36,931 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fsll____true_unreach_call_true_valid_memsafety_i____off64_t in sll-01_true-unreach-call_true-valid-memsafety.i [2018-04-11 12:26:36,931 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fsll____true_unreach_call_true_valid_memsafety_i____suseconds_t in sll-01_true-unreach-call_true-valid-memsafety.i [2018-04-11 12:26:36,932 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fsll____true_unreach_call_true_valid_memsafety_i____timer_t in sll-01_true-unreach-call_true-valid-memsafety.i [2018-04-11 12:26:36,932 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fsll____true_unreach_call_true_valid_memsafety_i____pid_t in sll-01_true-unreach-call_true-valid-memsafety.i [2018-04-11 12:26:36,932 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fsll____true_unreach_call_true_valid_memsafety_i__fsblkcnt_t in sll-01_true-unreach-call_true-valid-memsafety.i [2018-04-11 12:26:36,932 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fsll____true_unreach_call_true_valid_memsafety_i____gid_t in sll-01_true-unreach-call_true-valid-memsafety.i [2018-04-11 12:26:36,932 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fsll____true_unreach_call_true_valid_memsafety_i__pthread_mutexattr_t in sll-01_true-unreach-call_true-valid-memsafety.i [2018-04-11 12:26:36,932 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fsll____true_unreach_call_true_valid_memsafety_i__u_int in sll-01_true-unreach-call_true-valid-memsafety.i [2018-04-11 12:26:36,946 INFO L330 CDTParser]: Deleted temporary CDT project at /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/data/FLAG5f3a95fb3 [2018-04-11 12:26:36,950 INFO L304 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-04-11 12:26:36,951 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2018-04-11 12:26:36,952 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-04-11 12:26:36,952 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-04-11 12:26:36,955 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-04-11 12:26:36,956 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 11.04 12:26:36" (1/1) ... [2018-04-11 12:26:36,958 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@4a1e4247 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.04 12:26:36, skipping insertion in model container [2018-04-11 12:26:36,958 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 11.04 12:26:36" (1/1) ... [2018-04-11 12:26:36,969 INFO L167 Dispatcher]: Using SV-COMP mode [2018-04-11 12:26:36,994 INFO L167 Dispatcher]: Using SV-COMP mode [2018-04-11 12:26:37,148 INFO L175 PostProcessor]: Settings: Checked method=main [2018-04-11 12:26:37,189 INFO L175 PostProcessor]: Settings: Checked method=main [2018-04-11 12:26:37,194 INFO L100 SccComputation]: Graph consists of 0 InCaSumBalls and 112 non ball SCCs. Number of states in SCCs 112. [2018-04-11 12:26:37,229 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.04 12:26:37 WrapperNode [2018-04-11 12:26:37,229 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-04-11 12:26:37,229 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-04-11 12:26:37,230 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-04-11 12:26:37,230 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-04-11 12:26:37,240 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.04 12:26:37" (1/1) ... [2018-04-11 12:26:37,240 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.04 12:26:37" (1/1) ... [2018-04-11 12:26:37,252 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.04 12:26:37" (1/1) ... [2018-04-11 12:26:37,252 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.04 12:26:37" (1/1) ... [2018-04-11 12:26:37,262 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.04 12:26:37" (1/1) ... [2018-04-11 12:26:37,269 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.04 12:26:37" (1/1) ... [2018-04-11 12:26:37,271 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.04 12:26:37" (1/1) ... [2018-04-11 12:26:37,277 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-04-11 12:26:37,277 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-04-11 12:26:37,278 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-04-11 12:26:37,278 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-04-11 12:26:37,279 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.04 12:26:37" (1/1) ... No working directory specified, using /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-04-11 12:26:37,374 INFO L136 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-04-11 12:26:37,375 INFO L136 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-04-11 12:26:37,375 INFO L136 BoogieDeclarations]: Found implementation of procedure main [2018-04-11 12:26:37,375 INFO L128 BoogieDeclarations]: Found specification of procedure __ctype_get_mb_cur_max [2018-04-11 12:26:37,375 INFO L128 BoogieDeclarations]: Found specification of procedure atof [2018-04-11 12:26:37,375 INFO L128 BoogieDeclarations]: Found specification of procedure atoi [2018-04-11 12:26:37,375 INFO L128 BoogieDeclarations]: Found specification of procedure atol [2018-04-11 12:26:37,375 INFO L128 BoogieDeclarations]: Found specification of procedure atoll [2018-04-11 12:26:37,376 INFO L128 BoogieDeclarations]: Found specification of procedure strtod [2018-04-11 12:26:37,376 INFO L128 BoogieDeclarations]: Found specification of procedure strtof [2018-04-11 12:26:37,376 INFO L128 BoogieDeclarations]: Found specification of procedure strtold [2018-04-11 12:26:37,376 INFO L128 BoogieDeclarations]: Found specification of procedure strtol [2018-04-11 12:26:37,376 INFO L128 BoogieDeclarations]: Found specification of procedure strtoul [2018-04-11 12:26:37,376 INFO L128 BoogieDeclarations]: Found specification of procedure strtoq [2018-04-11 12:26:37,376 INFO L128 BoogieDeclarations]: Found specification of procedure strtouq [2018-04-11 12:26:37,376 INFO L128 BoogieDeclarations]: Found specification of procedure strtoll [2018-04-11 12:26:37,376 INFO L128 BoogieDeclarations]: Found specification of procedure strtoull [2018-04-11 12:26:37,377 INFO L128 BoogieDeclarations]: Found specification of procedure l64a [2018-04-11 12:26:37,377 INFO L128 BoogieDeclarations]: Found specification of procedure a64l [2018-04-11 12:26:37,377 INFO L128 BoogieDeclarations]: Found specification of procedure select [2018-04-11 12:26:37,377 INFO L128 BoogieDeclarations]: Found specification of procedure pselect [2018-04-11 12:26:37,377 INFO L128 BoogieDeclarations]: Found specification of procedure gnu_dev_major [2018-04-11 12:26:37,377 INFO L128 BoogieDeclarations]: Found specification of procedure gnu_dev_minor [2018-04-11 12:26:37,377 INFO L128 BoogieDeclarations]: Found specification of procedure gnu_dev_makedev [2018-04-11 12:26:37,377 INFO L128 BoogieDeclarations]: Found specification of procedure random [2018-04-11 12:26:37,377 INFO L128 BoogieDeclarations]: Found specification of procedure srandom [2018-04-11 12:26:37,378 INFO L128 BoogieDeclarations]: Found specification of procedure initstate [2018-04-11 12:26:37,378 INFO L128 BoogieDeclarations]: Found specification of procedure setstate [2018-04-11 12:26:37,378 INFO L128 BoogieDeclarations]: Found specification of procedure random_r [2018-04-11 12:26:37,378 INFO L128 BoogieDeclarations]: Found specification of procedure srandom_r [2018-04-11 12:26:37,378 INFO L128 BoogieDeclarations]: Found specification of procedure initstate_r [2018-04-11 12:26:37,378 INFO L128 BoogieDeclarations]: Found specification of procedure setstate_r [2018-04-11 12:26:37,378 INFO L128 BoogieDeclarations]: Found specification of procedure rand [2018-04-11 12:26:37,378 INFO L128 BoogieDeclarations]: Found specification of procedure srand [2018-04-11 12:26:37,378 INFO L128 BoogieDeclarations]: Found specification of procedure rand_r [2018-04-11 12:26:37,379 INFO L128 BoogieDeclarations]: Found specification of procedure drand48 [2018-04-11 12:26:37,379 INFO L128 BoogieDeclarations]: Found specification of procedure erand48 [2018-04-11 12:26:37,379 INFO L128 BoogieDeclarations]: Found specification of procedure lrand48 [2018-04-11 12:26:37,379 INFO L128 BoogieDeclarations]: Found specification of procedure nrand48 [2018-04-11 12:26:37,379 INFO L128 BoogieDeclarations]: Found specification of procedure mrand48 [2018-04-11 12:26:37,379 INFO L128 BoogieDeclarations]: Found specification of procedure jrand48 [2018-04-11 12:26:37,379 INFO L128 BoogieDeclarations]: Found specification of procedure srand48 [2018-04-11 12:26:37,379 INFO L128 BoogieDeclarations]: Found specification of procedure seed48 [2018-04-11 12:26:37,380 INFO L128 BoogieDeclarations]: Found specification of procedure lcong48 [2018-04-11 12:26:37,380 INFO L128 BoogieDeclarations]: Found specification of procedure drand48_r [2018-04-11 12:26:37,380 INFO L128 BoogieDeclarations]: Found specification of procedure erand48_r [2018-04-11 12:26:37,380 INFO L128 BoogieDeclarations]: Found specification of procedure lrand48_r [2018-04-11 12:26:37,380 INFO L128 BoogieDeclarations]: Found specification of procedure nrand48_r [2018-04-11 12:26:37,380 INFO L128 BoogieDeclarations]: Found specification of procedure mrand48_r [2018-04-11 12:26:37,380 INFO L128 BoogieDeclarations]: Found specification of procedure jrand48_r [2018-04-11 12:26:37,380 INFO L128 BoogieDeclarations]: Found specification of procedure srand48_r [2018-04-11 12:26:37,380 INFO L128 BoogieDeclarations]: Found specification of procedure seed48_r [2018-04-11 12:26:37,381 INFO L128 BoogieDeclarations]: Found specification of procedure lcong48_r [2018-04-11 12:26:37,381 INFO L128 BoogieDeclarations]: Found specification of procedure malloc [2018-04-11 12:26:37,381 INFO L128 BoogieDeclarations]: Found specification of procedure calloc [2018-04-11 12:26:37,381 INFO L128 BoogieDeclarations]: Found specification of procedure realloc [2018-04-11 12:26:37,381 INFO L128 BoogieDeclarations]: Found specification of procedure free [2018-04-11 12:26:37,381 INFO L128 BoogieDeclarations]: Found specification of procedure cfree [2018-04-11 12:26:37,381 INFO L128 BoogieDeclarations]: Found specification of procedure alloca [2018-04-11 12:26:37,381 INFO L128 BoogieDeclarations]: Found specification of procedure valloc [2018-04-11 12:26:37,381 INFO L128 BoogieDeclarations]: Found specification of procedure posix_memalign [2018-04-11 12:26:37,381 INFO L128 BoogieDeclarations]: Found specification of procedure aligned_alloc [2018-04-11 12:26:37,382 INFO L128 BoogieDeclarations]: Found specification of procedure abort [2018-04-11 12:26:37,382 INFO L128 BoogieDeclarations]: Found specification of procedure atexit [2018-04-11 12:26:37,382 INFO L128 BoogieDeclarations]: Found specification of procedure at_quick_exit [2018-04-11 12:26:37,382 INFO L128 BoogieDeclarations]: Found specification of procedure on_exit [2018-04-11 12:26:37,382 INFO L128 BoogieDeclarations]: Found specification of procedure exit [2018-04-11 12:26:37,382 INFO L128 BoogieDeclarations]: Found specification of procedure quick_exit [2018-04-11 12:26:37,382 INFO L128 BoogieDeclarations]: Found specification of procedure _Exit [2018-04-11 12:26:37,382 INFO L128 BoogieDeclarations]: Found specification of procedure getenv [2018-04-11 12:26:37,382 INFO L128 BoogieDeclarations]: Found specification of procedure putenv [2018-04-11 12:26:37,383 INFO L128 BoogieDeclarations]: Found specification of procedure setenv [2018-04-11 12:26:37,383 INFO L128 BoogieDeclarations]: Found specification of procedure unsetenv [2018-04-11 12:26:37,383 INFO L128 BoogieDeclarations]: Found specification of procedure clearenv [2018-04-11 12:26:37,383 INFO L128 BoogieDeclarations]: Found specification of procedure mktemp [2018-04-11 12:26:37,383 INFO L128 BoogieDeclarations]: Found specification of procedure mkstemp [2018-04-11 12:26:37,383 INFO L128 BoogieDeclarations]: Found specification of procedure mkstemps [2018-04-11 12:26:37,383 INFO L128 BoogieDeclarations]: Found specification of procedure mkdtemp [2018-04-11 12:26:37,383 INFO L128 BoogieDeclarations]: Found specification of procedure system [2018-04-11 12:26:37,383 INFO L128 BoogieDeclarations]: Found specification of procedure realpath [2018-04-11 12:26:37,383 INFO L128 BoogieDeclarations]: Found specification of procedure bsearch [2018-04-11 12:26:37,384 INFO L128 BoogieDeclarations]: Found specification of procedure qsort [2018-04-11 12:26:37,384 INFO L128 BoogieDeclarations]: Found specification of procedure abs [2018-04-11 12:26:37,384 INFO L128 BoogieDeclarations]: Found specification of procedure labs [2018-04-11 12:26:37,384 INFO L128 BoogieDeclarations]: Found specification of procedure llabs [2018-04-11 12:26:37,384 INFO L128 BoogieDeclarations]: Found specification of procedure div [2018-04-11 12:26:37,384 INFO L128 BoogieDeclarations]: Found specification of procedure ldiv [2018-04-11 12:26:37,384 INFO L128 BoogieDeclarations]: Found specification of procedure lldiv [2018-04-11 12:26:37,384 INFO L128 BoogieDeclarations]: Found specification of procedure ecvt [2018-04-11 12:26:37,384 INFO L128 BoogieDeclarations]: Found specification of procedure fcvt [2018-04-11 12:26:37,385 INFO L128 BoogieDeclarations]: Found specification of procedure gcvt [2018-04-11 12:26:37,385 INFO L128 BoogieDeclarations]: Found specification of procedure qecvt [2018-04-11 12:26:37,385 INFO L128 BoogieDeclarations]: Found specification of procedure qfcvt [2018-04-11 12:26:37,385 INFO L128 BoogieDeclarations]: Found specification of procedure qgcvt [2018-04-11 12:26:37,385 INFO L128 BoogieDeclarations]: Found specification of procedure ecvt_r [2018-04-11 12:26:37,385 INFO L128 BoogieDeclarations]: Found specification of procedure fcvt_r [2018-04-11 12:26:37,385 INFO L128 BoogieDeclarations]: Found specification of procedure qecvt_r [2018-04-11 12:26:37,385 INFO L128 BoogieDeclarations]: Found specification of procedure qfcvt_r [2018-04-11 12:26:37,386 INFO L128 BoogieDeclarations]: Found specification of procedure mblen [2018-04-11 12:26:37,386 INFO L128 BoogieDeclarations]: Found specification of procedure mbtowc [2018-04-11 12:26:37,386 INFO L128 BoogieDeclarations]: Found specification of procedure wctomb [2018-04-11 12:26:37,386 INFO L128 BoogieDeclarations]: Found specification of procedure mbstowcs [2018-04-11 12:26:37,386 INFO L128 BoogieDeclarations]: Found specification of procedure wcstombs [2018-04-11 12:26:37,386 INFO L128 BoogieDeclarations]: Found specification of procedure rpmatch [2018-04-11 12:26:37,386 INFO L128 BoogieDeclarations]: Found specification of procedure getsubopt [2018-04-11 12:26:37,386 INFO L128 BoogieDeclarations]: Found specification of procedure getloadavg [2018-04-11 12:26:37,386 INFO L128 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2018-04-11 12:26:37,386 INFO L128 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2018-04-11 12:26:37,387 INFO L128 BoogieDeclarations]: Found specification of procedure main [2018-04-11 12:26:37,387 INFO L128 BoogieDeclarations]: Found specification of procedure #Ultimate.alloc [2018-04-11 12:26:37,387 INFO L128 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2018-04-11 12:26:37,387 INFO L128 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2018-04-11 12:26:37,387 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2018-04-11 12:26:37,387 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-04-11 12:26:37,387 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-04-11 12:26:37,865 INFO L259 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-04-11 12:26:37,865 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.04 12:26:37 BoogieIcfgContainer [2018-04-11 12:26:37,865 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-04-11 12:26:37,866 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-04-11 12:26:37,866 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-04-11 12:26:37,868 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-04-11 12:26:37,868 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 11.04 12:26:36" (1/3) ... [2018-04-11 12:26:37,868 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@a3a241c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 11.04 12:26:37, skipping insertion in model container [2018-04-11 12:26:37,868 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.04 12:26:37" (2/3) ... [2018-04-11 12:26:37,868 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@a3a241c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 11.04 12:26:37, skipping insertion in model container [2018-04-11 12:26:37,869 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.04 12:26:37" (3/3) ... [2018-04-11 12:26:37,870 INFO L107 eAbstractionObserver]: Analyzing ICFG sll-01_true-unreach-call_true-valid-memsafety.i [2018-04-11 12:26:37,875 INFO L131 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-04-11 12:26:37,879 INFO L143 ceAbstractionStarter]: Appying trace abstraction to program that has 63 error locations. [2018-04-11 12:26:37,902 INFO L128 ementStrategyFactory]: Using default assertion order modulation [2018-04-11 12:26:37,902 INFO L369 AbstractCegarLoop]: Interprodecural is true [2018-04-11 12:26:37,902 INFO L370 AbstractCegarLoop]: Hoare is false [2018-04-11 12:26:37,902 INFO L371 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-04-11 12:26:37,902 INFO L372 AbstractCegarLoop]: Backedges is TWOTRACK [2018-04-11 12:26:37,902 INFO L373 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-04-11 12:26:37,902 INFO L374 AbstractCegarLoop]: Difference is false [2018-04-11 12:26:37,902 INFO L375 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-04-11 12:26:37,903 INFO L380 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-04-11 12:26:37,903 INFO L87 2NestedWordAutomaton]: Mode: main mode - execution starts in main procedure [2018-04-11 12:26:37,914 INFO L276 IsEmpty]: Start isEmpty. Operand 187 states. [2018-04-11 12:26:37,919 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2018-04-11 12:26:37,919 INFO L347 BasicCegarLoop]: Found error trace [2018-04-11 12:26:37,919 INFO L355 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2018-04-11 12:26:37,919 INFO L408 AbstractCegarLoop]: === Iteration 1 === [mainErr51RequiresViolation, mainErr26RequiresViolation, mainErr54RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr31RequiresViolation, mainErr46RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr58RequiresViolation, mainErr15RequiresViolation, mainErr49RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr55RequiresViolation, mainErr17RequiresViolation, mainErr42RequiresViolation, mainErr62EnsuresViolationMEMORY_LEAK, mainErr30RequiresViolation, mainErr56AssertViolationMEMORY_FREE, mainErr11RequiresViolation, mainErr61AssertViolationMEMORY_FREE, mainErr24RequiresViolation, mainErr44RequiresViolation, mainErr10RequiresViolation, mainErr43RequiresViolation, mainErr4RequiresViolation, mainErr50RequiresViolation, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr59RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr48RequiresViolation, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr52RequiresViolation, mainErr45RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr57AssertViolationMEMORY_FREE, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr60AssertViolationMEMORY_FREE, mainErr9RequiresViolation, mainErr53RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr34RequiresViolation, mainErr47RequiresViolation, mainErr14RequiresViolation, mainErr40RequiresViolation]=== [2018-04-11 12:26:37,922 INFO L82 PathProgramCache]: Analyzing trace with hash 166545801, now seen corresponding path program 1 times [2018-04-11 12:26:37,923 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-04-11 12:26:37,923 INFO L68 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-04-11 12:26:37,955 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 12:26:37,956 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-11 12:26:37,956 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 12:26:37,977 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-11 12:26:37,984 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-11 12:26:38,021 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-11 12:26:38,022 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-04-11 12:26:38,022 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-04-11 12:26:38,023 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-04-11 12:26:38,031 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-04-11 12:26:38,031 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-04-11 12:26:38,033 INFO L87 Difference]: Start difference. First operand 187 states. Second operand 4 states. [2018-04-11 12:26:38,236 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-11 12:26:38,236 INFO L93 Difference]: Finished difference Result 218 states and 229 transitions. [2018-04-11 12:26:38,236 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-04-11 12:26:38,238 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 8 [2018-04-11 12:26:38,238 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-11 12:26:38,248 INFO L225 Difference]: With dead ends: 218 [2018-04-11 12:26:38,248 INFO L226 Difference]: Without dead ends: 214 [2018-04-11 12:26:38,250 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-04-11 12:26:38,270 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 214 states. [2018-04-11 12:26:38,294 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 214 to 180. [2018-04-11 12:26:38,295 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 180 states. [2018-04-11 12:26:38,296 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 180 states to 180 states and 192 transitions. [2018-04-11 12:26:38,297 INFO L78 Accepts]: Start accepts. Automaton has 180 states and 192 transitions. Word has length 8 [2018-04-11 12:26:38,297 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-11 12:26:38,297 INFO L459 AbstractCegarLoop]: Abstraction has 180 states and 192 transitions. [2018-04-11 12:26:38,297 INFO L460 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-04-11 12:26:38,298 INFO L276 IsEmpty]: Start isEmpty. Operand 180 states and 192 transitions. [2018-04-11 12:26:38,298 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2018-04-11 12:26:38,298 INFO L347 BasicCegarLoop]: Found error trace [2018-04-11 12:26:38,298 INFO L355 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2018-04-11 12:26:38,298 INFO L408 AbstractCegarLoop]: === Iteration 2 === [mainErr51RequiresViolation, mainErr26RequiresViolation, mainErr54RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr31RequiresViolation, mainErr46RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr58RequiresViolation, mainErr15RequiresViolation, mainErr49RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr55RequiresViolation, mainErr17RequiresViolation, mainErr42RequiresViolation, mainErr62EnsuresViolationMEMORY_LEAK, mainErr30RequiresViolation, mainErr56AssertViolationMEMORY_FREE, mainErr11RequiresViolation, mainErr61AssertViolationMEMORY_FREE, mainErr24RequiresViolation, mainErr44RequiresViolation, mainErr10RequiresViolation, mainErr43RequiresViolation, mainErr4RequiresViolation, mainErr50RequiresViolation, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr59RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr48RequiresViolation, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr52RequiresViolation, mainErr45RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr57AssertViolationMEMORY_FREE, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr60AssertViolationMEMORY_FREE, mainErr9RequiresViolation, mainErr53RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr34RequiresViolation, mainErr47RequiresViolation, mainErr14RequiresViolation, mainErr40RequiresViolation]=== [2018-04-11 12:26:38,298 INFO L82 PathProgramCache]: Analyzing trace with hash 166545802, now seen corresponding path program 1 times [2018-04-11 12:26:38,298 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-04-11 12:26:38,298 INFO L68 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-04-11 12:26:38,299 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 12:26:38,300 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-11 12:26:38,300 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 12:26:38,312 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-11 12:26:38,313 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-11 12:26:38,345 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-11 12:26:38,345 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-04-11 12:26:38,345 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-04-11 12:26:38,346 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-04-11 12:26:38,346 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-04-11 12:26:38,346 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-04-11 12:26:38,347 INFO L87 Difference]: Start difference. First operand 180 states and 192 transitions. Second operand 4 states. [2018-04-11 12:26:38,476 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-11 12:26:38,476 INFO L93 Difference]: Finished difference Result 207 states and 218 transitions. [2018-04-11 12:26:38,477 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-04-11 12:26:38,477 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 8 [2018-04-11 12:26:38,477 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-11 12:26:38,478 INFO L225 Difference]: With dead ends: 207 [2018-04-11 12:26:38,478 INFO L226 Difference]: Without dead ends: 207 [2018-04-11 12:26:38,478 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-04-11 12:26:38,479 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 207 states. [2018-04-11 12:26:38,485 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 207 to 194. [2018-04-11 12:26:38,485 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 194 states. [2018-04-11 12:26:38,487 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 194 states to 194 states and 213 transitions. [2018-04-11 12:26:38,487 INFO L78 Accepts]: Start accepts. Automaton has 194 states and 213 transitions. Word has length 8 [2018-04-11 12:26:38,487 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-11 12:26:38,487 INFO L459 AbstractCegarLoop]: Abstraction has 194 states and 213 transitions. [2018-04-11 12:26:38,487 INFO L460 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-04-11 12:26:38,487 INFO L276 IsEmpty]: Start isEmpty. Operand 194 states and 213 transitions. [2018-04-11 12:26:38,488 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2018-04-11 12:26:38,488 INFO L347 BasicCegarLoop]: Found error trace [2018-04-11 12:26:38,488 INFO L355 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-11 12:26:38,488 INFO L408 AbstractCegarLoop]: === Iteration 3 === [mainErr51RequiresViolation, mainErr26RequiresViolation, mainErr54RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr31RequiresViolation, mainErr46RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr58RequiresViolation, mainErr15RequiresViolation, mainErr49RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr55RequiresViolation, mainErr17RequiresViolation, mainErr42RequiresViolation, mainErr62EnsuresViolationMEMORY_LEAK, mainErr30RequiresViolation, mainErr56AssertViolationMEMORY_FREE, mainErr11RequiresViolation, mainErr61AssertViolationMEMORY_FREE, mainErr24RequiresViolation, mainErr44RequiresViolation, mainErr10RequiresViolation, mainErr43RequiresViolation, mainErr4RequiresViolation, mainErr50RequiresViolation, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr59RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr48RequiresViolation, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr52RequiresViolation, mainErr45RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr57AssertViolationMEMORY_FREE, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr60AssertViolationMEMORY_FREE, mainErr9RequiresViolation, mainErr53RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr34RequiresViolation, mainErr47RequiresViolation, mainErr14RequiresViolation, mainErr40RequiresViolation]=== [2018-04-11 12:26:38,488 INFO L82 PathProgramCache]: Analyzing trace with hash -2089322413, now seen corresponding path program 1 times [2018-04-11 12:26:38,489 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-04-11 12:26:38,489 INFO L68 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-04-11 12:26:38,490 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 12:26:38,490 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-11 12:26:38,490 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 12:26:38,503 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-11 12:26:38,504 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-11 12:26:38,535 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-11 12:26:38,535 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-04-11 12:26:38,535 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-04-11 12:26:38,535 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-04-11 12:26:38,535 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-04-11 12:26:38,536 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-04-11 12:26:38,536 INFO L87 Difference]: Start difference. First operand 194 states and 213 transitions. Second operand 5 states. [2018-04-11 12:26:38,784 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-11 12:26:38,784 INFO L93 Difference]: Finished difference Result 329 states and 356 transitions. [2018-04-11 12:26:38,784 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-04-11 12:26:38,784 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 17 [2018-04-11 12:26:38,784 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-11 12:26:38,785 INFO L225 Difference]: With dead ends: 329 [2018-04-11 12:26:38,785 INFO L226 Difference]: Without dead ends: 329 [2018-04-11 12:26:38,786 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-11 12:26:38,786 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 329 states. [2018-04-11 12:26:38,792 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 329 to 193. [2018-04-11 12:26:38,792 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 193 states. [2018-04-11 12:26:38,793 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 193 states to 193 states and 212 transitions. [2018-04-11 12:26:38,794 INFO L78 Accepts]: Start accepts. Automaton has 193 states and 212 transitions. Word has length 17 [2018-04-11 12:26:38,794 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-11 12:26:38,794 INFO L459 AbstractCegarLoop]: Abstraction has 193 states and 212 transitions. [2018-04-11 12:26:38,794 INFO L460 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-04-11 12:26:38,794 INFO L276 IsEmpty]: Start isEmpty. Operand 193 states and 212 transitions. [2018-04-11 12:26:38,794 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2018-04-11 12:26:38,795 INFO L347 BasicCegarLoop]: Found error trace [2018-04-11 12:26:38,795 INFO L355 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-11 12:26:38,795 INFO L408 AbstractCegarLoop]: === Iteration 4 === [mainErr51RequiresViolation, mainErr26RequiresViolation, mainErr54RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr31RequiresViolation, mainErr46RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr58RequiresViolation, mainErr15RequiresViolation, mainErr49RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr55RequiresViolation, mainErr17RequiresViolation, mainErr42RequiresViolation, mainErr62EnsuresViolationMEMORY_LEAK, mainErr30RequiresViolation, mainErr56AssertViolationMEMORY_FREE, mainErr11RequiresViolation, mainErr61AssertViolationMEMORY_FREE, mainErr24RequiresViolation, mainErr44RequiresViolation, mainErr10RequiresViolation, mainErr43RequiresViolation, mainErr4RequiresViolation, mainErr50RequiresViolation, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr59RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr48RequiresViolation, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr52RequiresViolation, mainErr45RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr57AssertViolationMEMORY_FREE, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr60AssertViolationMEMORY_FREE, mainErr9RequiresViolation, mainErr53RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr34RequiresViolation, mainErr47RequiresViolation, mainErr14RequiresViolation, mainErr40RequiresViolation]=== [2018-04-11 12:26:38,795 INFO L82 PathProgramCache]: Analyzing trace with hash -2089322412, now seen corresponding path program 1 times [2018-04-11 12:26:38,795 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-04-11 12:26:38,795 INFO L68 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-04-11 12:26:38,796 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 12:26:38,796 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-11 12:26:38,797 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 12:26:38,807 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-11 12:26:38,808 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-11 12:26:38,848 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-11 12:26:38,849 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-04-11 12:26:38,849 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-04-11 12:26:38,849 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-04-11 12:26:38,849 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-04-11 12:26:38,849 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-04-11 12:26:38,850 INFO L87 Difference]: Start difference. First operand 193 states and 212 transitions. Second operand 5 states. [2018-04-11 12:26:39,060 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-11 12:26:39,060 INFO L93 Difference]: Finished difference Result 360 states and 397 transitions. [2018-04-11 12:26:39,060 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-04-11 12:26:39,061 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 17 [2018-04-11 12:26:39,061 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-11 12:26:39,062 INFO L225 Difference]: With dead ends: 360 [2018-04-11 12:26:39,062 INFO L226 Difference]: Without dead ends: 360 [2018-04-11 12:26:39,062 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-11 12:26:39,062 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 360 states. [2018-04-11 12:26:39,065 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 360 to 192. [2018-04-11 12:26:39,065 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 192 states. [2018-04-11 12:26:39,066 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 192 states to 192 states and 211 transitions. [2018-04-11 12:26:39,066 INFO L78 Accepts]: Start accepts. Automaton has 192 states and 211 transitions. Word has length 17 [2018-04-11 12:26:39,066 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-11 12:26:39,066 INFO L459 AbstractCegarLoop]: Abstraction has 192 states and 211 transitions. [2018-04-11 12:26:39,066 INFO L460 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-04-11 12:26:39,066 INFO L276 IsEmpty]: Start isEmpty. Operand 192 states and 211 transitions. [2018-04-11 12:26:39,067 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2018-04-11 12:26:39,067 INFO L347 BasicCegarLoop]: Found error trace [2018-04-11 12:26:39,067 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] [2018-04-11 12:26:39,067 INFO L408 AbstractCegarLoop]: === Iteration 5 === [mainErr51RequiresViolation, mainErr26RequiresViolation, mainErr54RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr31RequiresViolation, mainErr46RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr58RequiresViolation, mainErr15RequiresViolation, mainErr49RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr55RequiresViolation, mainErr17RequiresViolation, mainErr42RequiresViolation, mainErr62EnsuresViolationMEMORY_LEAK, mainErr30RequiresViolation, mainErr56AssertViolationMEMORY_FREE, mainErr11RequiresViolation, mainErr61AssertViolationMEMORY_FREE, mainErr24RequiresViolation, mainErr44RequiresViolation, mainErr10RequiresViolation, mainErr43RequiresViolation, mainErr4RequiresViolation, mainErr50RequiresViolation, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr59RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr48RequiresViolation, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr52RequiresViolation, mainErr45RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr57AssertViolationMEMORY_FREE, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr60AssertViolationMEMORY_FREE, mainErr9RequiresViolation, mainErr53RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr34RequiresViolation, mainErr47RequiresViolation, mainErr14RequiresViolation, mainErr40RequiresViolation]=== [2018-04-11 12:26:39,067 INFO L82 PathProgramCache]: Analyzing trace with hash -337938114, now seen corresponding path program 1 times [2018-04-11 12:26:39,067 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-04-11 12:26:39,067 INFO L68 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-04-11 12:26:39,068 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 12:26:39,068 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-11 12:26:39,068 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 12:26:39,078 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-11 12:26:39,079 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-11 12:26:39,154 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-11 12:26:39,154 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-04-11 12:26:39,154 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-04-11 12:26:39,155 INFO L442 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-04-11 12:26:39,155 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-04-11 12:26:39,155 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2018-04-11 12:26:39,155 INFO L87 Difference]: Start difference. First operand 192 states and 211 transitions. Second operand 8 states. [2018-04-11 12:26:39,527 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-11 12:26:39,528 INFO L93 Difference]: Finished difference Result 332 states and 357 transitions. [2018-04-11 12:26:39,528 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-04-11 12:26:39,528 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 20 [2018-04-11 12:26:39,528 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-11 12:26:39,529 INFO L225 Difference]: With dead ends: 332 [2018-04-11 12:26:39,529 INFO L226 Difference]: Without dead ends: 332 [2018-04-11 12:26:39,529 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=51, Invalid=105, Unknown=0, NotChecked=0, Total=156 [2018-04-11 12:26:39,530 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 332 states. [2018-04-11 12:26:39,532 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 332 to 191. [2018-04-11 12:26:39,532 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 191 states. [2018-04-11 12:26:39,533 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 191 states to 191 states and 210 transitions. [2018-04-11 12:26:39,534 INFO L78 Accepts]: Start accepts. Automaton has 191 states and 210 transitions. Word has length 20 [2018-04-11 12:26:39,534 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-11 12:26:39,534 INFO L459 AbstractCegarLoop]: Abstraction has 191 states and 210 transitions. [2018-04-11 12:26:39,534 INFO L460 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-04-11 12:26:39,534 INFO L276 IsEmpty]: Start isEmpty. Operand 191 states and 210 transitions. [2018-04-11 12:26:39,535 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2018-04-11 12:26:39,535 INFO L347 BasicCegarLoop]: Found error trace [2018-04-11 12:26:39,535 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] [2018-04-11 12:26:39,535 INFO L408 AbstractCegarLoop]: === Iteration 6 === [mainErr51RequiresViolation, mainErr26RequiresViolation, mainErr54RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr31RequiresViolation, mainErr46RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr58RequiresViolation, mainErr15RequiresViolation, mainErr49RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr55RequiresViolation, mainErr17RequiresViolation, mainErr42RequiresViolation, mainErr62EnsuresViolationMEMORY_LEAK, mainErr30RequiresViolation, mainErr56AssertViolationMEMORY_FREE, mainErr11RequiresViolation, mainErr61AssertViolationMEMORY_FREE, mainErr24RequiresViolation, mainErr44RequiresViolation, mainErr10RequiresViolation, mainErr43RequiresViolation, mainErr4RequiresViolation, mainErr50RequiresViolation, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr59RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr48RequiresViolation, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr52RequiresViolation, mainErr45RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr57AssertViolationMEMORY_FREE, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr60AssertViolationMEMORY_FREE, mainErr9RequiresViolation, mainErr53RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr34RequiresViolation, mainErr47RequiresViolation, mainErr14RequiresViolation, mainErr40RequiresViolation]=== [2018-04-11 12:26:39,535 INFO L82 PathProgramCache]: Analyzing trace with hash -337938113, now seen corresponding path program 1 times [2018-04-11 12:26:39,535 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-04-11 12:26:39,535 INFO L68 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-04-11 12:26:39,537 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 12:26:39,537 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-11 12:26:39,537 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 12:26:39,549 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-11 12:26:39,550 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-11 12:26:39,622 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-11 12:26:39,622 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-04-11 12:26:39,623 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-04-11 12:26:39,623 INFO L442 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-04-11 12:26:39,623 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-04-11 12:26:39,623 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2018-04-11 12:26:39,623 INFO L87 Difference]: Start difference. First operand 191 states and 210 transitions. Second operand 8 states. [2018-04-11 12:26:40,055 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-11 12:26:40,055 INFO L93 Difference]: Finished difference Result 334 states and 359 transitions. [2018-04-11 12:26:40,055 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-04-11 12:26:40,056 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 20 [2018-04-11 12:26:40,056 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-11 12:26:40,057 INFO L225 Difference]: With dead ends: 334 [2018-04-11 12:26:40,057 INFO L226 Difference]: Without dead ends: 334 [2018-04-11 12:26:40,057 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=51, Invalid=105, Unknown=0, NotChecked=0, Total=156 [2018-04-11 12:26:40,057 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 334 states. [2018-04-11 12:26:40,059 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 334 to 190. [2018-04-11 12:26:40,059 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 190 states. [2018-04-11 12:26:40,060 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 190 states to 190 states and 209 transitions. [2018-04-11 12:26:40,060 INFO L78 Accepts]: Start accepts. Automaton has 190 states and 209 transitions. Word has length 20 [2018-04-11 12:26:40,060 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-11 12:26:40,060 INFO L459 AbstractCegarLoop]: Abstraction has 190 states and 209 transitions. [2018-04-11 12:26:40,061 INFO L460 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-04-11 12:26:40,061 INFO L276 IsEmpty]: Start isEmpty. Operand 190 states and 209 transitions. [2018-04-11 12:26:40,061 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2018-04-11 12:26:40,061 INFO L347 BasicCegarLoop]: Found error trace [2018-04-11 12:26:40,061 INFO L355 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-11 12:26:40,061 INFO L408 AbstractCegarLoop]: === Iteration 7 === [mainErr51RequiresViolation, mainErr26RequiresViolation, mainErr54RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr31RequiresViolation, mainErr46RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr58RequiresViolation, mainErr15RequiresViolation, mainErr49RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr55RequiresViolation, mainErr17RequiresViolation, mainErr42RequiresViolation, mainErr62EnsuresViolationMEMORY_LEAK, mainErr30RequiresViolation, mainErr56AssertViolationMEMORY_FREE, mainErr11RequiresViolation, mainErr61AssertViolationMEMORY_FREE, mainErr24RequiresViolation, mainErr44RequiresViolation, mainErr10RequiresViolation, mainErr43RequiresViolation, mainErr4RequiresViolation, mainErr50RequiresViolation, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr59RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr48RequiresViolation, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr52RequiresViolation, mainErr45RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr57AssertViolationMEMORY_FREE, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr60AssertViolationMEMORY_FREE, mainErr9RequiresViolation, mainErr53RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr34RequiresViolation, mainErr47RequiresViolation, mainErr14RequiresViolation, mainErr40RequiresViolation]=== [2018-04-11 12:26:40,062 INFO L82 PathProgramCache]: Analyzing trace with hash -296054905, now seen corresponding path program 1 times [2018-04-11 12:26:40,062 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-04-11 12:26:40,062 INFO L68 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-04-11 12:26:40,063 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 12:26:40,063 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-11 12:26:40,063 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 12:26:40,071 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-11 12:26:40,072 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-11 12:26:40,117 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-11 12:26:40,117 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-04-11 12:26:40,117 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-04-11 12:26:40,118 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-04-11 12:26:40,118 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-04-11 12:26:40,118 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-04-11 12:26:40,118 INFO L87 Difference]: Start difference. First operand 190 states and 209 transitions. Second operand 5 states. [2018-04-11 12:26:40,206 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-11 12:26:40,206 INFO L93 Difference]: Finished difference Result 282 states and 306 transitions. [2018-04-11 12:26:40,207 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-04-11 12:26:40,207 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 26 [2018-04-11 12:26:40,207 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-11 12:26:40,208 INFO L225 Difference]: With dead ends: 282 [2018-04-11 12:26:40,208 INFO L226 Difference]: Without dead ends: 282 [2018-04-11 12:26:40,208 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-11 12:26:40,209 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 282 states. [2018-04-11 12:26:40,211 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 282 to 194. [2018-04-11 12:26:40,211 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 194 states. [2018-04-11 12:26:40,212 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 194 states to 194 states and 213 transitions. [2018-04-11 12:26:40,212 INFO L78 Accepts]: Start accepts. Automaton has 194 states and 213 transitions. Word has length 26 [2018-04-11 12:26:40,212 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-11 12:26:40,213 INFO L459 AbstractCegarLoop]: Abstraction has 194 states and 213 transitions. [2018-04-11 12:26:40,213 INFO L460 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-04-11 12:26:40,213 INFO L276 IsEmpty]: Start isEmpty. Operand 194 states and 213 transitions. [2018-04-11 12:26:40,213 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2018-04-11 12:26:40,213 INFO L347 BasicCegarLoop]: Found error trace [2018-04-11 12:26:40,213 INFO L355 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-11 12:26:40,214 INFO L408 AbstractCegarLoop]: === Iteration 8 === [mainErr51RequiresViolation, mainErr26RequiresViolation, mainErr54RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr31RequiresViolation, mainErr46RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr58RequiresViolation, mainErr15RequiresViolation, mainErr49RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr55RequiresViolation, mainErr17RequiresViolation, mainErr42RequiresViolation, mainErr62EnsuresViolationMEMORY_LEAK, mainErr30RequiresViolation, mainErr56AssertViolationMEMORY_FREE, mainErr11RequiresViolation, mainErr61AssertViolationMEMORY_FREE, mainErr24RequiresViolation, mainErr44RequiresViolation, mainErr10RequiresViolation, mainErr43RequiresViolation, mainErr4RequiresViolation, mainErr50RequiresViolation, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr59RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr48RequiresViolation, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr52RequiresViolation, mainErr45RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr57AssertViolationMEMORY_FREE, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr60AssertViolationMEMORY_FREE, mainErr9RequiresViolation, mainErr53RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr34RequiresViolation, mainErr47RequiresViolation, mainErr14RequiresViolation, mainErr40RequiresViolation]=== [2018-04-11 12:26:40,214 INFO L82 PathProgramCache]: Analyzing trace with hash 1611684908, now seen corresponding path program 1 times [2018-04-11 12:26:40,214 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-04-11 12:26:40,214 INFO L68 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-04-11 12:26:40,215 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 12:26:40,215 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-11 12:26:40,215 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 12:26:40,222 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-11 12:26:40,222 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-11 12:26:40,245 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-11 12:26:40,246 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-04-11 12:26:40,246 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-04-11 12:26:40,246 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-04-11 12:26:40,246 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-04-11 12:26:40,246 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-04-11 12:26:40,246 INFO L87 Difference]: Start difference. First operand 194 states and 213 transitions. Second operand 4 states. [2018-04-11 12:26:40,319 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-11 12:26:40,319 INFO L93 Difference]: Finished difference Result 198 states and 214 transitions. [2018-04-11 12:26:40,320 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-04-11 12:26:40,320 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 28 [2018-04-11 12:26:40,320 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-11 12:26:40,320 INFO L225 Difference]: With dead ends: 198 [2018-04-11 12:26:40,320 INFO L226 Difference]: Without dead ends: 198 [2018-04-11 12:26:40,321 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-11 12:26:40,321 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 198 states. [2018-04-11 12:26:40,323 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 198 to 186. [2018-04-11 12:26:40,323 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 186 states. [2018-04-11 12:26:40,324 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 186 states to 186 states and 205 transitions. [2018-04-11 12:26:40,324 INFO L78 Accepts]: Start accepts. Automaton has 186 states and 205 transitions. Word has length 28 [2018-04-11 12:26:40,324 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-11 12:26:40,324 INFO L459 AbstractCegarLoop]: Abstraction has 186 states and 205 transitions. [2018-04-11 12:26:40,324 INFO L460 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-04-11 12:26:40,324 INFO L276 IsEmpty]: Start isEmpty. Operand 186 states and 205 transitions. [2018-04-11 12:26:40,325 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2018-04-11 12:26:40,325 INFO L347 BasicCegarLoop]: Found error trace [2018-04-11 12:26:40,325 INFO L355 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-11 12:26:40,325 INFO L408 AbstractCegarLoop]: === Iteration 9 === [mainErr51RequiresViolation, mainErr26RequiresViolation, mainErr54RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr31RequiresViolation, mainErr46RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr58RequiresViolation, mainErr15RequiresViolation, mainErr49RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr55RequiresViolation, mainErr17RequiresViolation, mainErr42RequiresViolation, mainErr62EnsuresViolationMEMORY_LEAK, mainErr30RequiresViolation, mainErr56AssertViolationMEMORY_FREE, mainErr11RequiresViolation, mainErr61AssertViolationMEMORY_FREE, mainErr24RequiresViolation, mainErr44RequiresViolation, mainErr10RequiresViolation, mainErr43RequiresViolation, mainErr4RequiresViolation, mainErr50RequiresViolation, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr59RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr48RequiresViolation, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr52RequiresViolation, mainErr45RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr57AssertViolationMEMORY_FREE, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr60AssertViolationMEMORY_FREE, mainErr9RequiresViolation, mainErr53RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr34RequiresViolation, mainErr47RequiresViolation, mainErr14RequiresViolation, mainErr40RequiresViolation]=== [2018-04-11 12:26:40,325 INFO L82 PathProgramCache]: Analyzing trace with hash 1611684909, now seen corresponding path program 1 times [2018-04-11 12:26:40,326 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-04-11 12:26:40,326 INFO L68 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-04-11 12:26:40,327 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 12:26:40,327 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-11 12:26:40,327 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 12:26:40,334 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-11 12:26:40,335 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-11 12:26:40,414 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-11 12:26:40,414 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-04-11 12:26:40,414 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-04-11 12:26:40,415 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-04-11 12:26:40,415 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-04-11 12:26:40,415 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2018-04-11 12:26:40,415 INFO L87 Difference]: Start difference. First operand 186 states and 205 transitions. Second operand 7 states. [2018-04-11 12:26:40,607 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-11 12:26:40,607 INFO L93 Difference]: Finished difference Result 240 states and 255 transitions. [2018-04-11 12:26:40,607 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-04-11 12:26:40,607 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 28 [2018-04-11 12:26:40,607 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-11 12:26:40,608 INFO L225 Difference]: With dead ends: 240 [2018-04-11 12:26:40,608 INFO L226 Difference]: Without dead ends: 240 [2018-04-11 12:26:40,608 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=32, Invalid=58, Unknown=0, NotChecked=0, Total=90 [2018-04-11 12:26:40,608 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 240 states. [2018-04-11 12:26:40,610 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 240 to 213. [2018-04-11 12:26:40,610 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 213 states. [2018-04-11 12:26:40,611 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 213 states to 213 states and 240 transitions. [2018-04-11 12:26:40,611 INFO L78 Accepts]: Start accepts. Automaton has 213 states and 240 transitions. Word has length 28 [2018-04-11 12:26:40,611 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-11 12:26:40,611 INFO L459 AbstractCegarLoop]: Abstraction has 213 states and 240 transitions. [2018-04-11 12:26:40,611 INFO L460 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-04-11 12:26:40,611 INFO L276 IsEmpty]: Start isEmpty. Operand 213 states and 240 transitions. [2018-04-11 12:26:40,611 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2018-04-11 12:26:40,611 INFO L347 BasicCegarLoop]: Found error trace [2018-04-11 12:26:40,611 INFO L355 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-11 12:26:40,612 INFO L408 AbstractCegarLoop]: === Iteration 10 === [mainErr51RequiresViolation, mainErr26RequiresViolation, mainErr54RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr31RequiresViolation, mainErr46RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr58RequiresViolation, mainErr15RequiresViolation, mainErr49RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr55RequiresViolation, mainErr17RequiresViolation, mainErr42RequiresViolation, mainErr62EnsuresViolationMEMORY_LEAK, mainErr30RequiresViolation, mainErr56AssertViolationMEMORY_FREE, mainErr11RequiresViolation, mainErr61AssertViolationMEMORY_FREE, mainErr24RequiresViolation, mainErr44RequiresViolation, mainErr10RequiresViolation, mainErr43RequiresViolation, mainErr4RequiresViolation, mainErr50RequiresViolation, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr59RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr48RequiresViolation, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr52RequiresViolation, mainErr45RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr57AssertViolationMEMORY_FREE, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr60AssertViolationMEMORY_FREE, mainErr9RequiresViolation, mainErr53RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr34RequiresViolation, mainErr47RequiresViolation, mainErr14RequiresViolation, mainErr40RequiresViolation]=== [2018-04-11 12:26:40,612 INFO L82 PathProgramCache]: Analyzing trace with hash 265761851, now seen corresponding path program 1 times [2018-04-11 12:26:40,612 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-04-11 12:26:40,612 INFO L68 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-04-11 12:26:40,612 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 12:26:40,612 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-11 12:26:40,613 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 12:26:40,618 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-11 12:26:40,619 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-11 12:26:40,641 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-11 12:26:40,642 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-04-11 12:26:40,642 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-04-11 12:26:40,642 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-04-11 12:26:40,642 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-04-11 12:26:40,642 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-04-11 12:26:40,642 INFO L87 Difference]: Start difference. First operand 213 states and 240 transitions. Second operand 6 states. [2018-04-11 12:26:40,862 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-11 12:26:40,862 INFO L93 Difference]: Finished difference Result 305 states and 345 transitions. [2018-04-11 12:26:40,863 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-04-11 12:26:40,863 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 31 [2018-04-11 12:26:40,863 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-11 12:26:40,863 INFO L225 Difference]: With dead ends: 305 [2018-04-11 12:26:40,863 INFO L226 Difference]: Without dead ends: 305 [2018-04-11 12:26:40,864 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2018-04-11 12:26:40,864 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 305 states. [2018-04-11 12:26:40,867 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 305 to 212. [2018-04-11 12:26:40,867 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 212 states. [2018-04-11 12:26:40,867 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 212 states to 212 states and 239 transitions. [2018-04-11 12:26:40,868 INFO L78 Accepts]: Start accepts. Automaton has 212 states and 239 transitions. Word has length 31 [2018-04-11 12:26:40,868 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-11 12:26:40,868 INFO L459 AbstractCegarLoop]: Abstraction has 212 states and 239 transitions. [2018-04-11 12:26:40,868 INFO L460 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-04-11 12:26:40,868 INFO L276 IsEmpty]: Start isEmpty. Operand 212 states and 239 transitions. [2018-04-11 12:26:40,868 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2018-04-11 12:26:40,869 INFO L347 BasicCegarLoop]: Found error trace [2018-04-11 12:26:40,869 INFO L355 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-11 12:26:40,869 INFO L408 AbstractCegarLoop]: === Iteration 11 === [mainErr51RequiresViolation, mainErr26RequiresViolation, mainErr54RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr31RequiresViolation, mainErr46RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr58RequiresViolation, mainErr15RequiresViolation, mainErr49RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr55RequiresViolation, mainErr17RequiresViolation, mainErr42RequiresViolation, mainErr62EnsuresViolationMEMORY_LEAK, mainErr30RequiresViolation, mainErr56AssertViolationMEMORY_FREE, mainErr11RequiresViolation, mainErr61AssertViolationMEMORY_FREE, mainErr24RequiresViolation, mainErr44RequiresViolation, mainErr10RequiresViolation, mainErr43RequiresViolation, mainErr4RequiresViolation, mainErr50RequiresViolation, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr59RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr48RequiresViolation, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr52RequiresViolation, mainErr45RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr57AssertViolationMEMORY_FREE, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr60AssertViolationMEMORY_FREE, mainErr9RequiresViolation, mainErr53RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr34RequiresViolation, mainErr47RequiresViolation, mainErr14RequiresViolation, mainErr40RequiresViolation]=== [2018-04-11 12:26:40,869 INFO L82 PathProgramCache]: Analyzing trace with hash 265761852, now seen corresponding path program 1 times [2018-04-11 12:26:40,869 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-04-11 12:26:40,869 INFO L68 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-04-11 12:26:40,870 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 12:26:40,870 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-11 12:26:40,870 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 12:26:40,876 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-11 12:26:40,877 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-11 12:26:40,929 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-11 12:26:40,929 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-04-11 12:26:40,929 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-04-11 12:26:40,929 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-04-11 12:26:40,930 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-04-11 12:26:40,930 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-04-11 12:26:40,930 INFO L87 Difference]: Start difference. First operand 212 states and 239 transitions. Second operand 6 states. [2018-04-11 12:26:41,209 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-11 12:26:41,209 INFO L93 Difference]: Finished difference Result 329 states and 377 transitions. [2018-04-11 12:26:41,210 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-04-11 12:26:41,210 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 31 [2018-04-11 12:26:41,210 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-11 12:26:41,211 INFO L225 Difference]: With dead ends: 329 [2018-04-11 12:26:41,212 INFO L226 Difference]: Without dead ends: 329 [2018-04-11 12:26:41,212 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=40, Invalid=70, Unknown=0, NotChecked=0, Total=110 [2018-04-11 12:26:41,212 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 329 states. [2018-04-11 12:26:41,215 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 329 to 197. [2018-04-11 12:26:41,215 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 197 states. [2018-04-11 12:26:41,216 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 197 states to 197 states and 223 transitions. [2018-04-11 12:26:41,216 INFO L78 Accepts]: Start accepts. Automaton has 197 states and 223 transitions. Word has length 31 [2018-04-11 12:26:41,216 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-11 12:26:41,216 INFO L459 AbstractCegarLoop]: Abstraction has 197 states and 223 transitions. [2018-04-11 12:26:41,216 INFO L460 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-04-11 12:26:41,216 INFO L276 IsEmpty]: Start isEmpty. Operand 197 states and 223 transitions. [2018-04-11 12:26:41,217 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2018-04-11 12:26:41,217 INFO L347 BasicCegarLoop]: Found error trace [2018-04-11 12:26:41,217 INFO L355 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-11 12:26:41,217 INFO L408 AbstractCegarLoop]: === Iteration 12 === [mainErr51RequiresViolation, mainErr26RequiresViolation, mainErr54RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr31RequiresViolation, mainErr46RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr58RequiresViolation, mainErr15RequiresViolation, mainErr49RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr55RequiresViolation, mainErr17RequiresViolation, mainErr42RequiresViolation, mainErr62EnsuresViolationMEMORY_LEAK, mainErr30RequiresViolation, mainErr56AssertViolationMEMORY_FREE, mainErr11RequiresViolation, mainErr61AssertViolationMEMORY_FREE, mainErr24RequiresViolation, mainErr44RequiresViolation, mainErr10RequiresViolation, mainErr43RequiresViolation, mainErr4RequiresViolation, mainErr50RequiresViolation, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr59RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr48RequiresViolation, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr52RequiresViolation, mainErr45RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr57AssertViolationMEMORY_FREE, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr60AssertViolationMEMORY_FREE, mainErr9RequiresViolation, mainErr53RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr34RequiresViolation, mainErr47RequiresViolation, mainErr14RequiresViolation, mainErr40RequiresViolation]=== [2018-04-11 12:26:41,217 INFO L82 PathProgramCache]: Analyzing trace with hash -788385734, now seen corresponding path program 1 times [2018-04-11 12:26:41,217 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-04-11 12:26:41,218 INFO L68 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-04-11 12:26:41,219 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 12:26:41,219 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-11 12:26:41,219 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 12:26:41,224 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-11 12:26:41,225 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-11 12:26:41,260 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-11 12:26:41,260 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-04-11 12:26:41,260 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-04-11 12:26:41,261 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-04-11 12:26:41,261 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-04-11 12:26:41,261 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-04-11 12:26:41,261 INFO L87 Difference]: Start difference. First operand 197 states and 223 transitions. Second operand 5 states. [2018-04-11 12:26:41,325 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-11 12:26:41,326 INFO L93 Difference]: Finished difference Result 220 states and 234 transitions. [2018-04-11 12:26:41,326 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-04-11 12:26:41,326 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 36 [2018-04-11 12:26:41,326 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-11 12:26:41,327 INFO L225 Difference]: With dead ends: 220 [2018-04-11 12:26:41,327 INFO L226 Difference]: Without dead ends: 220 [2018-04-11 12:26:41,327 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2018-04-11 12:26:41,327 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 220 states. [2018-04-11 12:26:41,330 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 220 to 197. [2018-04-11 12:26:41,330 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 197 states. [2018-04-11 12:26:41,331 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 197 states to 197 states and 221 transitions. [2018-04-11 12:26:41,331 INFO L78 Accepts]: Start accepts. Automaton has 197 states and 221 transitions. Word has length 36 [2018-04-11 12:26:41,331 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-11 12:26:41,331 INFO L459 AbstractCegarLoop]: Abstraction has 197 states and 221 transitions. [2018-04-11 12:26:41,331 INFO L460 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-04-11 12:26:41,331 INFO L276 IsEmpty]: Start isEmpty. Operand 197 states and 221 transitions. [2018-04-11 12:26:41,332 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2018-04-11 12:26:41,332 INFO L347 BasicCegarLoop]: Found error trace [2018-04-11 12:26:41,332 INFO L355 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-11 12:26:41,332 INFO L408 AbstractCegarLoop]: === Iteration 13 === [mainErr51RequiresViolation, mainErr26RequiresViolation, mainErr54RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr31RequiresViolation, mainErr46RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr58RequiresViolation, mainErr15RequiresViolation, mainErr49RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr55RequiresViolation, mainErr17RequiresViolation, mainErr42RequiresViolation, mainErr62EnsuresViolationMEMORY_LEAK, mainErr30RequiresViolation, mainErr56AssertViolationMEMORY_FREE, mainErr11RequiresViolation, mainErr61AssertViolationMEMORY_FREE, mainErr24RequiresViolation, mainErr44RequiresViolation, mainErr10RequiresViolation, mainErr43RequiresViolation, mainErr4RequiresViolation, mainErr50RequiresViolation, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr59RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr48RequiresViolation, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr52RequiresViolation, mainErr45RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr57AssertViolationMEMORY_FREE, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr60AssertViolationMEMORY_FREE, mainErr9RequiresViolation, mainErr53RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr34RequiresViolation, mainErr47RequiresViolation, mainErr14RequiresViolation, mainErr40RequiresViolation]=== [2018-04-11 12:26:41,333 INFO L82 PathProgramCache]: Analyzing trace with hash 2065889067, now seen corresponding path program 1 times [2018-04-11 12:26:41,333 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-04-11 12:26:41,333 INFO L68 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-04-11 12:26:41,334 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 12:26:41,334 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-11 12:26:41,334 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 12:26:41,341 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-11 12:26:41,341 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-11 12:26:41,417 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-11 12:26:41,418 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-04-11 12:26:41,418 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2018-04-11 12:26:41,418 INFO L442 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-04-11 12:26:41,418 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-04-11 12:26:41,418 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2018-04-11 12:26:41,418 INFO L87 Difference]: Start difference. First operand 197 states and 221 transitions. Second operand 8 states. [2018-04-11 12:26:41,654 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-11 12:26:41,654 INFO L93 Difference]: Finished difference Result 302 states and 333 transitions. [2018-04-11 12:26:41,654 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-04-11 12:26:41,654 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 42 [2018-04-11 12:26:41,654 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-11 12:26:41,655 INFO L225 Difference]: With dead ends: 302 [2018-04-11 12:26:41,655 INFO L226 Difference]: Without dead ends: 302 [2018-04-11 12:26:41,656 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 16 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=49, Invalid=133, Unknown=0, NotChecked=0, Total=182 [2018-04-11 12:26:41,656 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 302 states. [2018-04-11 12:26:41,659 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 302 to 213. [2018-04-11 12:26:41,659 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 213 states. [2018-04-11 12:26:41,660 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 213 states to 213 states and 238 transitions. [2018-04-11 12:26:41,660 INFO L78 Accepts]: Start accepts. Automaton has 213 states and 238 transitions. Word has length 42 [2018-04-11 12:26:41,660 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-11 12:26:41,660 INFO L459 AbstractCegarLoop]: Abstraction has 213 states and 238 transitions. [2018-04-11 12:26:41,660 INFO L460 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-04-11 12:26:41,660 INFO L276 IsEmpty]: Start isEmpty. Operand 213 states and 238 transitions. [2018-04-11 12:26:41,661 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2018-04-11 12:26:41,661 INFO L347 BasicCegarLoop]: Found error trace [2018-04-11 12:26:41,661 INFO L355 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-11 12:26:41,661 INFO L408 AbstractCegarLoop]: === Iteration 14 === [mainErr51RequiresViolation, mainErr26RequiresViolation, mainErr54RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr31RequiresViolation, mainErr46RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr58RequiresViolation, mainErr15RequiresViolation, mainErr49RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr55RequiresViolation, mainErr17RequiresViolation, mainErr42RequiresViolation, mainErr62EnsuresViolationMEMORY_LEAK, mainErr30RequiresViolation, mainErr56AssertViolationMEMORY_FREE, mainErr11RequiresViolation, mainErr61AssertViolationMEMORY_FREE, mainErr24RequiresViolation, mainErr44RequiresViolation, mainErr10RequiresViolation, mainErr43RequiresViolation, mainErr4RequiresViolation, mainErr50RequiresViolation, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr59RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr48RequiresViolation, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr52RequiresViolation, mainErr45RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr57AssertViolationMEMORY_FREE, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr60AssertViolationMEMORY_FREE, mainErr9RequiresViolation, mainErr53RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr34RequiresViolation, mainErr47RequiresViolation, mainErr14RequiresViolation, mainErr40RequiresViolation]=== [2018-04-11 12:26:41,661 INFO L82 PathProgramCache]: Analyzing trace with hash -1631310599, now seen corresponding path program 1 times [2018-04-11 12:26:41,661 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-04-11 12:26:41,661 INFO L68 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-04-11 12:26:41,662 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 12:26:41,662 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-11 12:26:41,663 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 12:26:41,670 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-11 12:26:41,671 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-11 12:26:41,724 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-11 12:26:41,725 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-04-11 12:26:41,725 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-04-11 12:26:41,725 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-04-11 12:26:41,725 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-04-11 12:26:41,725 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-04-11 12:26:41,725 INFO L87 Difference]: Start difference. First operand 213 states and 238 transitions. Second operand 5 states. [2018-04-11 12:26:41,902 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-11 12:26:41,902 INFO L93 Difference]: Finished difference Result 363 states and 410 transitions. [2018-04-11 12:26:41,902 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-04-11 12:26:41,902 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 43 [2018-04-11 12:26:41,902 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-11 12:26:41,904 INFO L225 Difference]: With dead ends: 363 [2018-04-11 12:26:41,904 INFO L226 Difference]: Without dead ends: 363 [2018-04-11 12:26:41,904 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-11 12:26:41,904 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 363 states. [2018-04-11 12:26:41,907 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 363 to 212. [2018-04-11 12:26:41,907 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 212 states. [2018-04-11 12:26:41,908 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 212 states to 212 states and 237 transitions. [2018-04-11 12:26:41,908 INFO L78 Accepts]: Start accepts. Automaton has 212 states and 237 transitions. Word has length 43 [2018-04-11 12:26:41,909 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-11 12:26:41,909 INFO L459 AbstractCegarLoop]: Abstraction has 212 states and 237 transitions. [2018-04-11 12:26:41,909 INFO L460 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-04-11 12:26:41,909 INFO L276 IsEmpty]: Start isEmpty. Operand 212 states and 237 transitions. [2018-04-11 12:26:41,909 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2018-04-11 12:26:41,909 INFO L347 BasicCegarLoop]: Found error trace [2018-04-11 12:26:41,910 INFO L355 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-11 12:26:41,910 INFO L408 AbstractCegarLoop]: === Iteration 15 === [mainErr51RequiresViolation, mainErr26RequiresViolation, mainErr54RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr31RequiresViolation, mainErr46RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr58RequiresViolation, mainErr15RequiresViolation, mainErr49RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr55RequiresViolation, mainErr17RequiresViolation, mainErr42RequiresViolation, mainErr62EnsuresViolationMEMORY_LEAK, mainErr30RequiresViolation, mainErr56AssertViolationMEMORY_FREE, mainErr11RequiresViolation, mainErr61AssertViolationMEMORY_FREE, mainErr24RequiresViolation, mainErr44RequiresViolation, mainErr10RequiresViolation, mainErr43RequiresViolation, mainErr4RequiresViolation, mainErr50RequiresViolation, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr59RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr48RequiresViolation, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr52RequiresViolation, mainErr45RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr57AssertViolationMEMORY_FREE, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr60AssertViolationMEMORY_FREE, mainErr9RequiresViolation, mainErr53RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr34RequiresViolation, mainErr47RequiresViolation, mainErr14RequiresViolation, mainErr40RequiresViolation]=== [2018-04-11 12:26:41,910 INFO L82 PathProgramCache]: Analyzing trace with hash -1631310600, now seen corresponding path program 1 times [2018-04-11 12:26:41,910 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-04-11 12:26:41,910 INFO L68 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-04-11 12:26:41,911 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 12:26:41,911 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-11 12:26:41,911 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 12:26:41,930 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-11 12:26:41,930 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-11 12:26:41,968 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-11 12:26:41,968 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-04-11 12:26:41,968 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-04-11 12:26:41,968 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-04-11 12:26:41,968 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-04-11 12:26:41,968 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-04-11 12:26:41,969 INFO L87 Difference]: Start difference. First operand 212 states and 237 transitions. Second operand 5 states. [2018-04-11 12:26:42,130 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-11 12:26:42,131 INFO L93 Difference]: Finished difference Result 327 states and 367 transitions. [2018-04-11 12:26:42,131 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-04-11 12:26:42,131 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 43 [2018-04-11 12:26:42,131 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-11 12:26:42,132 INFO L225 Difference]: With dead ends: 327 [2018-04-11 12:26:42,132 INFO L226 Difference]: Without dead ends: 327 [2018-04-11 12:26:42,132 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-11 12:26:42,133 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 327 states. [2018-04-11 12:26:42,135 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 327 to 211. [2018-04-11 12:26:42,136 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 211 states. [2018-04-11 12:26:42,136 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 211 states to 211 states and 236 transitions. [2018-04-11 12:26:42,137 INFO L78 Accepts]: Start accepts. Automaton has 211 states and 236 transitions. Word has length 43 [2018-04-11 12:26:42,137 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-11 12:26:42,137 INFO L459 AbstractCegarLoop]: Abstraction has 211 states and 236 transitions. [2018-04-11 12:26:42,137 INFO L460 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-04-11 12:26:42,137 INFO L276 IsEmpty]: Start isEmpty. Operand 211 states and 236 transitions. [2018-04-11 12:26:42,137 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2018-04-11 12:26:42,137 INFO L347 BasicCegarLoop]: Found error trace [2018-04-11 12:26:42,138 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] [2018-04-11 12:26:42,138 INFO L408 AbstractCegarLoop]: === Iteration 16 === [mainErr51RequiresViolation, mainErr26RequiresViolation, mainErr54RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr31RequiresViolation, mainErr46RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr58RequiresViolation, mainErr15RequiresViolation, mainErr49RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr55RequiresViolation, mainErr17RequiresViolation, mainErr42RequiresViolation, mainErr62EnsuresViolationMEMORY_LEAK, mainErr30RequiresViolation, mainErr56AssertViolationMEMORY_FREE, mainErr11RequiresViolation, mainErr61AssertViolationMEMORY_FREE, mainErr24RequiresViolation, mainErr44RequiresViolation, mainErr10RequiresViolation, mainErr43RequiresViolation, mainErr4RequiresViolation, mainErr50RequiresViolation, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr59RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr48RequiresViolation, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr52RequiresViolation, mainErr45RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr57AssertViolationMEMORY_FREE, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr60AssertViolationMEMORY_FREE, mainErr9RequiresViolation, mainErr53RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr34RequiresViolation, mainErr47RequiresViolation, mainErr14RequiresViolation, mainErr40RequiresViolation]=== [2018-04-11 12:26:42,138 INFO L82 PathProgramCache]: Analyzing trace with hash 928654395, now seen corresponding path program 1 times [2018-04-11 12:26:42,138 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-04-11 12:26:42,138 INFO L68 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-04-11 12:26:42,139 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 12:26:42,139 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-11 12:26:42,139 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 12:26:42,145 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-11 12:26:42,145 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-11 12:26:42,221 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-11 12:26:42,221 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-04-11 12:26:42,221 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-11 12:26:42,230 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-11 12:26:42,251 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-11 12:26:42,258 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-11 12:26:42,317 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-11 12:26:42,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 8 treesize of output 7 [2018-04-11 12:26:42,321 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 12:26:42,322 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 12:26:42,331 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-11 12:26:42,333 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-04-11 12:26:42,333 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-04-11 12:26:42,335 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 12:26:42,340 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-04-11 12:26:42,340 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 2 variables, input treesize:29, output treesize:21 [2018-04-11 12:26:42,360 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 16 [2018-04-11 12:26:42,362 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 12:26:42,363 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-11 12:26:42,364 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 12:26:42,368 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 12:26:42,381 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 16 [2018-04-11 12:26:42,383 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 12:26:42,384 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-11 12:26:42,385 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-04-11 12:26:42,389 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 12:26:42,397 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-04-11 12:26:42,397 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 2 variables, input treesize:47, output treesize:39 [2018-04-11 12:26:42,447 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 18 [2018-04-11 12:26:42,450 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 12:26:42,450 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 10 [2018-04-11 12:26:42,451 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 12:26:42,454 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 12:26:42,463 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 18 [2018-04-11 12:26:42,466 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 12:26:42,467 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 10 [2018-04-11 12:26:42,468 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-04-11 12:26:42,471 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 12:26:42,476 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-11 12:26:42,477 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 4 variables, input treesize:53, output treesize:7 [2018-04-11 12:26:42,493 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-11 12:26:42,521 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-04-11 12:26:42,521 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 9] total 11 [2018-04-11 12:26:42,521 INFO L442 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-04-11 12:26:42,521 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-04-11 12:26:42,521 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=85, Unknown=0, NotChecked=0, Total=110 [2018-04-11 12:26:42,522 INFO L87 Difference]: Start difference. First operand 211 states and 236 transitions. Second operand 11 states. [2018-04-11 12:26:43,027 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-11 12:26:43,027 INFO L93 Difference]: Finished difference Result 349 states and 375 transitions. [2018-04-11 12:26:43,028 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2018-04-11 12:26:43,028 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 44 [2018-04-11 12:26:43,028 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-11 12:26:43,029 INFO L225 Difference]: With dead ends: 349 [2018-04-11 12:26:43,029 INFO L226 Difference]: Without dead ends: 349 [2018-04-11 12:26:43,030 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 64 GetRequests, 40 SyntacticMatches, 3 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 66 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=140, Invalid=366, Unknown=0, NotChecked=0, Total=506 [2018-04-11 12:26:43,030 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 349 states. [2018-04-11 12:26:43,034 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 349 to 245. [2018-04-11 12:26:43,034 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 245 states. [2018-04-11 12:26:43,035 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 245 states to 245 states and 279 transitions. [2018-04-11 12:26:43,035 INFO L78 Accepts]: Start accepts. Automaton has 245 states and 279 transitions. Word has length 44 [2018-04-11 12:26:43,035 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-11 12:26:43,035 INFO L459 AbstractCegarLoop]: Abstraction has 245 states and 279 transitions. [2018-04-11 12:26:43,035 INFO L460 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-04-11 12:26:43,035 INFO L276 IsEmpty]: Start isEmpty. Operand 245 states and 279 transitions. [2018-04-11 12:26:43,036 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2018-04-11 12:26:43,036 INFO L347 BasicCegarLoop]: Found error trace [2018-04-11 12:26:43,036 INFO L355 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-11 12:26:43,036 INFO L408 AbstractCegarLoop]: === Iteration 17 === [mainErr51RequiresViolation, mainErr26RequiresViolation, mainErr54RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr31RequiresViolation, mainErr46RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr58RequiresViolation, mainErr15RequiresViolation, mainErr49RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr55RequiresViolation, mainErr17RequiresViolation, mainErr42RequiresViolation, mainErr62EnsuresViolationMEMORY_LEAK, mainErr30RequiresViolation, mainErr56AssertViolationMEMORY_FREE, mainErr11RequiresViolation, mainErr61AssertViolationMEMORY_FREE, mainErr24RequiresViolation, mainErr44RequiresViolation, mainErr10RequiresViolation, mainErr43RequiresViolation, mainErr4RequiresViolation, mainErr50RequiresViolation, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr59RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr48RequiresViolation, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr52RequiresViolation, mainErr45RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr57AssertViolationMEMORY_FREE, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr60AssertViolationMEMORY_FREE, mainErr9RequiresViolation, mainErr53RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr34RequiresViolation, mainErr47RequiresViolation, mainErr14RequiresViolation, mainErr40RequiresViolation]=== [2018-04-11 12:26:43,036 INFO L82 PathProgramCache]: Analyzing trace with hash -819000242, now seen corresponding path program 1 times [2018-04-11 12:26:43,037 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-04-11 12:26:43,037 INFO L68 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-04-11 12:26:43,038 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 12:26:43,038 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-11 12:26:43,038 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 12:26:43,049 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-11 12:26:43,050 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-11 12:26:43,112 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-11 12:26:43,112 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-04-11 12:26:43,112 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-04-11 12:26:43,113 INFO L442 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-04-11 12:26:43,113 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-04-11 12:26:43,113 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2018-04-11 12:26:43,113 INFO L87 Difference]: Start difference. First operand 245 states and 279 transitions. Second operand 8 states. [2018-04-11 12:26:43,390 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-11 12:26:43,390 INFO L93 Difference]: Finished difference Result 262 states and 298 transitions. [2018-04-11 12:26:43,390 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-04-11 12:26:43,391 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 46 [2018-04-11 12:26:43,391 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-11 12:26:43,392 INFO L225 Difference]: With dead ends: 262 [2018-04-11 12:26:43,392 INFO L226 Difference]: Without dead ends: 262 [2018-04-11 12:26:43,392 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=51, Invalid=105, Unknown=0, NotChecked=0, Total=156 [2018-04-11 12:26:43,392 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 262 states. [2018-04-11 12:26:43,396 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 262 to 244. [2018-04-11 12:26:43,396 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 244 states. [2018-04-11 12:26:43,396 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 244 states to 244 states and 278 transitions. [2018-04-11 12:26:43,397 INFO L78 Accepts]: Start accepts. Automaton has 244 states and 278 transitions. Word has length 46 [2018-04-11 12:26:43,397 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-11 12:26:43,397 INFO L459 AbstractCegarLoop]: Abstraction has 244 states and 278 transitions. [2018-04-11 12:26:43,397 INFO L460 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-04-11 12:26:43,397 INFO L276 IsEmpty]: Start isEmpty. Operand 244 states and 278 transitions. [2018-04-11 12:26:43,397 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2018-04-11 12:26:43,398 INFO L347 BasicCegarLoop]: Found error trace [2018-04-11 12:26:43,398 INFO L355 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-11 12:26:43,398 INFO L408 AbstractCegarLoop]: === Iteration 18 === [mainErr51RequiresViolation, mainErr26RequiresViolation, mainErr54RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr31RequiresViolation, mainErr46RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr58RequiresViolation, mainErr15RequiresViolation, mainErr49RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr55RequiresViolation, mainErr17RequiresViolation, mainErr42RequiresViolation, mainErr62EnsuresViolationMEMORY_LEAK, mainErr30RequiresViolation, mainErr56AssertViolationMEMORY_FREE, mainErr11RequiresViolation, mainErr61AssertViolationMEMORY_FREE, mainErr24RequiresViolation, mainErr44RequiresViolation, mainErr10RequiresViolation, mainErr43RequiresViolation, mainErr4RequiresViolation, mainErr50RequiresViolation, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr59RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr48RequiresViolation, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr52RequiresViolation, mainErr45RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr57AssertViolationMEMORY_FREE, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr60AssertViolationMEMORY_FREE, mainErr9RequiresViolation, mainErr53RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr34RequiresViolation, mainErr47RequiresViolation, mainErr14RequiresViolation, mainErr40RequiresViolation]=== [2018-04-11 12:26:43,398 INFO L82 PathProgramCache]: Analyzing trace with hash -819000241, now seen corresponding path program 1 times [2018-04-11 12:26:43,398 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-04-11 12:26:43,398 INFO L68 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-04-11 12:26:43,399 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 12:26:43,399 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-11 12:26:43,399 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 12:26:43,408 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-11 12:26:43,408 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-11 12:26:43,500 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-11 12:26:43,500 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-04-11 12:26:43,500 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-04-11 12:26:43,500 INFO L442 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-04-11 12:26:43,501 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-04-11 12:26:43,501 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2018-04-11 12:26:43,501 INFO L87 Difference]: Start difference. First operand 244 states and 278 transitions. Second operand 8 states. [2018-04-11 12:26:43,775 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-11 12:26:43,775 INFO L93 Difference]: Finished difference Result 261 states and 297 transitions. [2018-04-11 12:26:43,776 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-04-11 12:26:43,776 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 46 [2018-04-11 12:26:43,776 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-11 12:26:43,777 INFO L225 Difference]: With dead ends: 261 [2018-04-11 12:26:43,777 INFO L226 Difference]: Without dead ends: 261 [2018-04-11 12:26:43,777 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=51, Invalid=105, Unknown=0, NotChecked=0, Total=156 [2018-04-11 12:26:43,778 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 261 states. [2018-04-11 12:26:43,780 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 261 to 243. [2018-04-11 12:26:43,780 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 243 states. [2018-04-11 12:26:43,781 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 243 states to 243 states and 277 transitions. [2018-04-11 12:26:43,781 INFO L78 Accepts]: Start accepts. Automaton has 243 states and 277 transitions. Word has length 46 [2018-04-11 12:26:43,782 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-11 12:26:43,782 INFO L459 AbstractCegarLoop]: Abstraction has 243 states and 277 transitions. [2018-04-11 12:26:43,782 INFO L460 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-04-11 12:26:43,782 INFO L276 IsEmpty]: Start isEmpty. Operand 243 states and 277 transitions. [2018-04-11 12:26:43,782 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2018-04-11 12:26:43,782 INFO L347 BasicCegarLoop]: Found error trace [2018-04-11 12:26:43,782 INFO L355 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-11 12:26:43,783 INFO L408 AbstractCegarLoop]: === Iteration 19 === [mainErr51RequiresViolation, mainErr26RequiresViolation, mainErr54RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr31RequiresViolation, mainErr46RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr58RequiresViolation, mainErr15RequiresViolation, mainErr49RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr55RequiresViolation, mainErr17RequiresViolation, mainErr42RequiresViolation, mainErr62EnsuresViolationMEMORY_LEAK, mainErr30RequiresViolation, mainErr56AssertViolationMEMORY_FREE, mainErr11RequiresViolation, mainErr61AssertViolationMEMORY_FREE, mainErr24RequiresViolation, mainErr44RequiresViolation, mainErr10RequiresViolation, mainErr43RequiresViolation, mainErr4RequiresViolation, mainErr50RequiresViolation, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr59RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr48RequiresViolation, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr52RequiresViolation, mainErr45RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr57AssertViolationMEMORY_FREE, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr60AssertViolationMEMORY_FREE, mainErr9RequiresViolation, mainErr53RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr34RequiresViolation, mainErr47RequiresViolation, mainErr14RequiresViolation, mainErr40RequiresViolation]=== [2018-04-11 12:26:43,783 INFO L82 PathProgramCache]: Analyzing trace with hash 410486952, now seen corresponding path program 1 times [2018-04-11 12:26:43,783 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-04-11 12:26:43,783 INFO L68 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-04-11 12:26:43,784 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 12:26:43,784 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-11 12:26:43,784 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 12:26:43,794 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-11 12:26:43,795 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-11 12:26:44,025 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-11 12:26:44,025 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-04-11 12:26:44,025 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [16] imperfect sequences [] total 16 [2018-04-11 12:26:44,026 INFO L442 AbstractCegarLoop]: Interpolant automaton has 17 states [2018-04-11 12:26:44,026 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2018-04-11 12:26:44,026 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=53, Invalid=219, Unknown=0, NotChecked=0, Total=272 [2018-04-11 12:26:44,026 INFO L87 Difference]: Start difference. First operand 243 states and 277 transitions. Second operand 17 states. [2018-04-11 12:26:45,060 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-11 12:26:45,060 INFO L93 Difference]: Finished difference Result 542 states and 583 transitions. [2018-04-11 12:26:45,060 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2018-04-11 12:26:45,060 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 47 [2018-04-11 12:26:45,060 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-11 12:26:45,063 INFO L225 Difference]: With dead ends: 542 [2018-04-11 12:26:45,063 INFO L226 Difference]: Without dead ends: 542 [2018-04-11 12:26:45,064 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 39 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 37 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 216 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=392, Invalid=1090, Unknown=0, NotChecked=0, Total=1482 [2018-04-11 12:26:45,064 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 542 states. [2018-04-11 12:26:45,070 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 542 to 249. [2018-04-11 12:26:45,070 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 249 states. [2018-04-11 12:26:45,071 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 249 states to 249 states and 282 transitions. [2018-04-11 12:26:45,071 INFO L78 Accepts]: Start accepts. Automaton has 249 states and 282 transitions. Word has length 47 [2018-04-11 12:26:45,071 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-11 12:26:45,072 INFO L459 AbstractCegarLoop]: Abstraction has 249 states and 282 transitions. [2018-04-11 12:26:45,072 INFO L460 AbstractCegarLoop]: Interpolant automaton has 17 states. [2018-04-11 12:26:45,072 INFO L276 IsEmpty]: Start isEmpty. Operand 249 states and 282 transitions. [2018-04-11 12:26:45,072 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2018-04-11 12:26:45,072 INFO L347 BasicCegarLoop]: Found error trace [2018-04-11 12:26:45,072 INFO L355 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-11 12:26:45,072 INFO L408 AbstractCegarLoop]: === Iteration 20 === [mainErr51RequiresViolation, mainErr26RequiresViolation, mainErr54RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr31RequiresViolation, mainErr46RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr58RequiresViolation, mainErr15RequiresViolation, mainErr49RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr55RequiresViolation, mainErr17RequiresViolation, mainErr42RequiresViolation, mainErr62EnsuresViolationMEMORY_LEAK, mainErr30RequiresViolation, mainErr56AssertViolationMEMORY_FREE, mainErr11RequiresViolation, mainErr61AssertViolationMEMORY_FREE, mainErr24RequiresViolation, mainErr44RequiresViolation, mainErr10RequiresViolation, mainErr43RequiresViolation, mainErr4RequiresViolation, mainErr50RequiresViolation, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr59RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr48RequiresViolation, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr52RequiresViolation, mainErr45RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr57AssertViolationMEMORY_FREE, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr60AssertViolationMEMORY_FREE, mainErr9RequiresViolation, mainErr53RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr34RequiresViolation, mainErr47RequiresViolation, mainErr14RequiresViolation, mainErr40RequiresViolation]=== [2018-04-11 12:26:45,073 INFO L82 PathProgramCache]: Analyzing trace with hash 410486953, now seen corresponding path program 1 times [2018-04-11 12:26:45,073 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-04-11 12:26:45,073 INFO L68 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-04-11 12:26:45,073 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 12:26:45,073 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-11 12:26:45,074 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 12:26:45,081 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-11 12:26:45,082 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-11 12:26:45,302 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-11 12:26:45,302 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-04-11 12:26:45,302 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [16] imperfect sequences [] total 16 [2018-04-11 12:26:45,303 INFO L442 AbstractCegarLoop]: Interpolant automaton has 17 states [2018-04-11 12:26:45,303 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2018-04-11 12:26:45,303 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=53, Invalid=219, Unknown=0, NotChecked=0, Total=272 [2018-04-11 12:26:45,303 INFO L87 Difference]: Start difference. First operand 249 states and 282 transitions. Second operand 17 states. [2018-04-11 12:26:46,605 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-11 12:26:46,605 INFO L93 Difference]: Finished difference Result 607 states and 650 transitions. [2018-04-11 12:26:46,605 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2018-04-11 12:26:46,606 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 47 [2018-04-11 12:26:46,606 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-11 12:26:46,607 INFO L225 Difference]: With dead ends: 607 [2018-04-11 12:26:46,607 INFO L226 Difference]: Without dead ends: 607 [2018-04-11 12:26:46,608 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 44 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 41 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 343 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=472, Invalid=1334, Unknown=0, NotChecked=0, Total=1806 [2018-04-11 12:26:46,608 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 607 states. [2018-04-11 12:26:46,612 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 607 to 256. [2018-04-11 12:26:46,612 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 256 states. [2018-04-11 12:26:46,613 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 256 states to 256 states and 288 transitions. [2018-04-11 12:26:46,613 INFO L78 Accepts]: Start accepts. Automaton has 256 states and 288 transitions. Word has length 47 [2018-04-11 12:26:46,614 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-11 12:26:46,614 INFO L459 AbstractCegarLoop]: Abstraction has 256 states and 288 transitions. [2018-04-11 12:26:46,614 INFO L460 AbstractCegarLoop]: Interpolant automaton has 17 states. [2018-04-11 12:26:46,614 INFO L276 IsEmpty]: Start isEmpty. Operand 256 states and 288 transitions. [2018-04-11 12:26:46,614 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2018-04-11 12:26:46,614 INFO L347 BasicCegarLoop]: Found error trace [2018-04-11 12:26:46,614 INFO L355 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-11 12:26:46,615 INFO L408 AbstractCegarLoop]: === Iteration 21 === [mainErr51RequiresViolation, mainErr26RequiresViolation, mainErr54RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr31RequiresViolation, mainErr46RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr58RequiresViolation, mainErr15RequiresViolation, mainErr49RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr55RequiresViolation, mainErr17RequiresViolation, mainErr42RequiresViolation, mainErr62EnsuresViolationMEMORY_LEAK, mainErr30RequiresViolation, mainErr56AssertViolationMEMORY_FREE, mainErr11RequiresViolation, mainErr61AssertViolationMEMORY_FREE, mainErr24RequiresViolation, mainErr44RequiresViolation, mainErr10RequiresViolation, mainErr43RequiresViolation, mainErr4RequiresViolation, mainErr50RequiresViolation, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr59RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr48RequiresViolation, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr52RequiresViolation, mainErr45RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr57AssertViolationMEMORY_FREE, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr60AssertViolationMEMORY_FREE, mainErr9RequiresViolation, mainErr53RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr34RequiresViolation, mainErr47RequiresViolation, mainErr14RequiresViolation, mainErr40RequiresViolation]=== [2018-04-11 12:26:46,615 INFO L82 PathProgramCache]: Analyzing trace with hash 1107305343, now seen corresponding path program 1 times [2018-04-11 12:26:46,615 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-04-11 12:26:46,615 INFO L68 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-04-11 12:26:46,616 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 12:26:46,616 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-11 12:26:46,616 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 12:26:46,622 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-11 12:26:46,622 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-11 12:26:46,688 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2018-04-11 12:26:46,688 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-04-11 12:26:46,688 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-04-11 12:26:46,688 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-04-11 12:26:46,688 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-04-11 12:26:46,689 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2018-04-11 12:26:46,689 INFO L87 Difference]: Start difference. First operand 256 states and 288 transitions. Second operand 7 states. [2018-04-11 12:26:46,866 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-11 12:26:46,867 INFO L93 Difference]: Finished difference Result 276 states and 308 transitions. [2018-04-11 12:26:46,867 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-04-11 12:26:46,867 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 53 [2018-04-11 12:26:46,867 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-11 12:26:46,868 INFO L225 Difference]: With dead ends: 276 [2018-04-11 12:26:46,868 INFO L226 Difference]: Without dead ends: 276 [2018-04-11 12:26:46,868 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=34, Invalid=76, Unknown=0, NotChecked=0, Total=110 [2018-04-11 12:26:46,869 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 276 states. [2018-04-11 12:26:46,871 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 276 to 268. [2018-04-11 12:26:46,871 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 268 states. [2018-04-11 12:26:46,872 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 268 states to 268 states and 300 transitions. [2018-04-11 12:26:46,872 INFO L78 Accepts]: Start accepts. Automaton has 268 states and 300 transitions. Word has length 53 [2018-04-11 12:26:46,872 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-11 12:26:46,872 INFO L459 AbstractCegarLoop]: Abstraction has 268 states and 300 transitions. [2018-04-11 12:26:46,873 INFO L460 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-04-11 12:26:46,873 INFO L276 IsEmpty]: Start isEmpty. Operand 268 states and 300 transitions. [2018-04-11 12:26:46,873 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2018-04-11 12:26:46,873 INFO L347 BasicCegarLoop]: Found error trace [2018-04-11 12:26:46,873 INFO L355 BasicCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-11 12:26:46,873 INFO L408 AbstractCegarLoop]: === Iteration 22 === [mainErr51RequiresViolation, mainErr26RequiresViolation, mainErr54RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr31RequiresViolation, mainErr46RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr58RequiresViolation, mainErr15RequiresViolation, mainErr49RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr55RequiresViolation, mainErr17RequiresViolation, mainErr42RequiresViolation, mainErr62EnsuresViolationMEMORY_LEAK, mainErr30RequiresViolation, mainErr56AssertViolationMEMORY_FREE, mainErr11RequiresViolation, mainErr61AssertViolationMEMORY_FREE, mainErr24RequiresViolation, mainErr44RequiresViolation, mainErr10RequiresViolation, mainErr43RequiresViolation, mainErr4RequiresViolation, mainErr50RequiresViolation, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr59RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr48RequiresViolation, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr52RequiresViolation, mainErr45RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr57AssertViolationMEMORY_FREE, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr60AssertViolationMEMORY_FREE, mainErr9RequiresViolation, mainErr53RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr34RequiresViolation, mainErr47RequiresViolation, mainErr14RequiresViolation, mainErr40RequiresViolation]=== [2018-04-11 12:26:46,874 INFO L82 PathProgramCache]: Analyzing trace with hash 815273570, now seen corresponding path program 1 times [2018-04-11 12:26:46,874 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-04-11 12:26:46,874 INFO L68 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-04-11 12:26:46,875 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 12:26:46,875 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-11 12:26:46,875 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 12:26:46,881 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-11 12:26:46,882 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-11 12:26:46,970 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 1 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-11 12:26:46,970 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-04-11 12:26:46,970 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-11 12:26:46,977 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-11 12:26:46,995 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-11 12:26:46,997 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-11 12:26:47,009 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 10 [2018-04-11 12:26:47,010 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 9 [2018-04-11 12:26:47,010 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 12:26:47,011 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 12:26:47,016 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 10 [2018-04-11 12:26:47,018 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 9 [2018-04-11 12:26:47,018 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-04-11 12:26:47,019 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 12:26:47,022 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-04-11 12:26:47,022 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 2 variables, input treesize:30, output treesize:22 [2018-04-11 12:26:47,123 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 18 [2018-04-11 12:26:47,125 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 12:26:47,126 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 12:26:47,130 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 1 case distinctions, treesize of input 18 treesize of output 21 [2018-04-11 12:26:47,131 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 2 xjuncts. [2018-04-11 12:26:47,151 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-04-11 12:26:47,164 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 18 [2018-04-11 12:26:47,167 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 12:26:47,168 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 12:26:47,175 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 1 case distinctions, treesize of input 18 treesize of output 21 [2018-04-11 12:26:47,176 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 2 xjuncts. [2018-04-11 12:26:47,187 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-04-11 12:26:47,199 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-2 vars, End of recursive call: and 2 xjuncts. [2018-04-11 12:26:47,199 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 4 variables, input treesize:53, output treesize:18 [2018-04-11 12:26:47,257 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 1 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-11 12:26:47,275 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-04-11 12:26:47,275 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 12] total 17 [2018-04-11 12:26:47,275 INFO L442 AbstractCegarLoop]: Interpolant automaton has 17 states [2018-04-11 12:26:47,275 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2018-04-11 12:26:47,275 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=43, Invalid=227, Unknown=2, NotChecked=0, Total=272 [2018-04-11 12:26:47,276 INFO L87 Difference]: Start difference. First operand 268 states and 300 transitions. Second operand 17 states. [2018-04-11 12:26:48,180 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-11 12:26:48,180 INFO L93 Difference]: Finished difference Result 544 states and 580 transitions. [2018-04-11 12:26:48,180 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2018-04-11 12:26:48,180 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 57 [2018-04-11 12:26:48,180 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-11 12:26:48,182 INFO L225 Difference]: With dead ends: 544 [2018-04-11 12:26:48,182 INFO L226 Difference]: Without dead ends: 544 [2018-04-11 12:26:48,182 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 90 GetRequests, 53 SyntacticMatches, 2 SemanticMatches, 35 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 236 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=231, Invalid=1097, Unknown=4, NotChecked=0, Total=1332 [2018-04-11 12:26:48,183 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 544 states. [2018-04-11 12:26:48,187 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 544 to 300. [2018-04-11 12:26:48,187 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 300 states. [2018-04-11 12:26:48,188 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 300 states to 300 states and 339 transitions. [2018-04-11 12:26:48,188 INFO L78 Accepts]: Start accepts. Automaton has 300 states and 339 transitions. Word has length 57 [2018-04-11 12:26:48,188 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-11 12:26:48,188 INFO L459 AbstractCegarLoop]: Abstraction has 300 states and 339 transitions. [2018-04-11 12:26:48,188 INFO L460 AbstractCegarLoop]: Interpolant automaton has 17 states. [2018-04-11 12:26:48,188 INFO L276 IsEmpty]: Start isEmpty. Operand 300 states and 339 transitions. [2018-04-11 12:26:48,189 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2018-04-11 12:26:48,189 INFO L347 BasicCegarLoop]: Found error trace [2018-04-11 12:26:48,189 INFO L355 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-11 12:26:48,189 INFO L408 AbstractCegarLoop]: === Iteration 23 === [mainErr51RequiresViolation, mainErr26RequiresViolation, mainErr54RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr31RequiresViolation, mainErr46RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr58RequiresViolation, mainErr15RequiresViolation, mainErr49RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr55RequiresViolation, mainErr17RequiresViolation, mainErr42RequiresViolation, mainErr62EnsuresViolationMEMORY_LEAK, mainErr30RequiresViolation, mainErr56AssertViolationMEMORY_FREE, mainErr11RequiresViolation, mainErr61AssertViolationMEMORY_FREE, mainErr24RequiresViolation, mainErr44RequiresViolation, mainErr10RequiresViolation, mainErr43RequiresViolation, mainErr4RequiresViolation, mainErr50RequiresViolation, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr59RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr48RequiresViolation, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr52RequiresViolation, mainErr45RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr57AssertViolationMEMORY_FREE, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr60AssertViolationMEMORY_FREE, mainErr9RequiresViolation, mainErr53RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr34RequiresViolation, mainErr47RequiresViolation, mainErr14RequiresViolation, mainErr40RequiresViolation]=== [2018-04-11 12:26:48,189 INFO L82 PathProgramCache]: Analyzing trace with hash 680833506, now seen corresponding path program 1 times [2018-04-11 12:26:48,189 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-04-11 12:26:48,189 INFO L68 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-04-11 12:26:48,190 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 12:26:48,190 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-11 12:26:48,191 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 12:26:48,199 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-11 12:26:48,200 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-11 12:26:48,299 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2018-04-11 12:26:48,299 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-04-11 12:26:48,299 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2018-04-11 12:26:48,300 INFO L442 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-04-11 12:26:48,300 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-04-11 12:26:48,300 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=70, Unknown=0, NotChecked=0, Total=90 [2018-04-11 12:26:48,300 INFO L87 Difference]: Start difference. First operand 300 states and 339 transitions. Second operand 10 states. [2018-04-11 12:26:48,573 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-11 12:26:48,573 INFO L93 Difference]: Finished difference Result 341 states and 376 transitions. [2018-04-11 12:26:48,573 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-04-11 12:26:48,573 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 58 [2018-04-11 12:26:48,573 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-11 12:26:48,574 INFO L225 Difference]: With dead ends: 341 [2018-04-11 12:26:48,574 INFO L226 Difference]: Without dead ends: 341 [2018-04-11 12:26:48,574 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 28 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=89, Invalid=253, Unknown=0, NotChecked=0, Total=342 [2018-04-11 12:26:48,574 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 341 states. [2018-04-11 12:26:48,576 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 341 to 310. [2018-04-11 12:26:48,576 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 310 states. [2018-04-11 12:26:48,577 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 310 states to 310 states and 351 transitions. [2018-04-11 12:26:48,577 INFO L78 Accepts]: Start accepts. Automaton has 310 states and 351 transitions. Word has length 58 [2018-04-11 12:26:48,577 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-11 12:26:48,577 INFO L459 AbstractCegarLoop]: Abstraction has 310 states and 351 transitions. [2018-04-11 12:26:48,577 INFO L460 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-04-11 12:26:48,577 INFO L276 IsEmpty]: Start isEmpty. Operand 310 states and 351 transitions. [2018-04-11 12:26:48,577 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2018-04-11 12:26:48,577 INFO L347 BasicCegarLoop]: Found error trace [2018-04-11 12:26:48,578 INFO L355 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-11 12:26:48,578 INFO L408 AbstractCegarLoop]: === Iteration 24 === [mainErr51RequiresViolation, mainErr26RequiresViolation, mainErr54RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr31RequiresViolation, mainErr46RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr58RequiresViolation, mainErr15RequiresViolation, mainErr49RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr55RequiresViolation, mainErr17RequiresViolation, mainErr42RequiresViolation, mainErr62EnsuresViolationMEMORY_LEAK, mainErr30RequiresViolation, mainErr56AssertViolationMEMORY_FREE, mainErr11RequiresViolation, mainErr61AssertViolationMEMORY_FREE, mainErr24RequiresViolation, mainErr44RequiresViolation, mainErr10RequiresViolation, mainErr43RequiresViolation, mainErr4RequiresViolation, mainErr50RequiresViolation, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr59RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr48RequiresViolation, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr52RequiresViolation, mainErr45RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr57AssertViolationMEMORY_FREE, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr60AssertViolationMEMORY_FREE, mainErr9RequiresViolation, mainErr53RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr34RequiresViolation, mainErr47RequiresViolation, mainErr14RequiresViolation, mainErr40RequiresViolation]=== [2018-04-11 12:26:48,578 INFO L82 PathProgramCache]: Analyzing trace with hash 680833507, now seen corresponding path program 1 times [2018-04-11 12:26:48,578 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-04-11 12:26:48,578 INFO L68 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-04-11 12:26:48,578 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 12:26:48,578 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-11 12:26:48,579 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 12:26:48,586 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-11 12:26:48,587 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-11 12:26:48,809 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2018-04-11 12:26:48,809 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-04-11 12:26:48,809 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2018-04-11 12:26:48,809 INFO L442 AbstractCegarLoop]: Interpolant automaton has 12 states [2018-04-11 12:26:48,809 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2018-04-11 12:26:48,809 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=107, Unknown=0, NotChecked=0, Total=132 [2018-04-11 12:26:48,810 INFO L87 Difference]: Start difference. First operand 310 states and 351 transitions. Second operand 12 states. [2018-04-11 12:26:49,266 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-11 12:26:49,266 INFO L93 Difference]: Finished difference Result 351 states and 382 transitions. [2018-04-11 12:26:49,266 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2018-04-11 12:26:49,266 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 58 [2018-04-11 12:26:49,266 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-11 12:26:49,267 INFO L225 Difference]: With dead ends: 351 [2018-04-11 12:26:49,267 INFO L226 Difference]: Without dead ends: 351 [2018-04-11 12:26:49,267 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 44 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=126, Invalid=380, Unknown=0, NotChecked=0, Total=506 [2018-04-11 12:26:49,267 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 351 states. [2018-04-11 12:26:49,270 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 351 to 310. [2018-04-11 12:26:49,270 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 310 states. [2018-04-11 12:26:49,271 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 310 states to 310 states and 350 transitions. [2018-04-11 12:26:49,271 INFO L78 Accepts]: Start accepts. Automaton has 310 states and 350 transitions. Word has length 58 [2018-04-11 12:26:49,272 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-11 12:26:49,272 INFO L459 AbstractCegarLoop]: Abstraction has 310 states and 350 transitions. [2018-04-11 12:26:49,272 INFO L460 AbstractCegarLoop]: Interpolant automaton has 12 states. [2018-04-11 12:26:49,272 INFO L276 IsEmpty]: Start isEmpty. Operand 310 states and 350 transitions. [2018-04-11 12:26:49,272 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2018-04-11 12:26:49,273 INFO L347 BasicCegarLoop]: Found error trace [2018-04-11 12:26:49,273 INFO L355 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-11 12:26:49,273 INFO L408 AbstractCegarLoop]: === Iteration 25 === [mainErr51RequiresViolation, mainErr26RequiresViolation, mainErr54RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr31RequiresViolation, mainErr46RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr58RequiresViolation, mainErr15RequiresViolation, mainErr49RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr55RequiresViolation, mainErr17RequiresViolation, mainErr42RequiresViolation, mainErr62EnsuresViolationMEMORY_LEAK, mainErr30RequiresViolation, mainErr56AssertViolationMEMORY_FREE, mainErr11RequiresViolation, mainErr61AssertViolationMEMORY_FREE, mainErr24RequiresViolation, mainErr44RequiresViolation, mainErr10RequiresViolation, mainErr43RequiresViolation, mainErr4RequiresViolation, mainErr50RequiresViolation, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr59RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr48RequiresViolation, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr52RequiresViolation, mainErr45RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr57AssertViolationMEMORY_FREE, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr60AssertViolationMEMORY_FREE, mainErr9RequiresViolation, mainErr53RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr34RequiresViolation, mainErr47RequiresViolation, mainErr14RequiresViolation, mainErr40RequiresViolation]=== [2018-04-11 12:26:49,273 INFO L82 PathProgramCache]: Analyzing trace with hash -496321924, now seen corresponding path program 1 times [2018-04-11 12:26:49,273 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-04-11 12:26:49,273 INFO L68 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-04-11 12:26:49,274 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 12:26:49,274 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-11 12:26:49,274 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 12:26:49,281 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-11 12:26:49,282 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-11 12:26:49,348 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2018-04-11 12:26:49,348 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-04-11 12:26:49,348 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-11 12:26:49,356 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-11 12:26:49,379 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-11 12:26:49,382 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-11 12:26:49,427 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2018-04-11 12:26:49,456 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-04-11 12:26:49,456 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 5] total 7 [2018-04-11 12:26:49,456 INFO L442 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-04-11 12:26:49,456 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-04-11 12:26:49,456 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=36, Unknown=4, NotChecked=0, Total=56 [2018-04-11 12:26:49,456 INFO L87 Difference]: Start difference. First operand 310 states and 350 transitions. Second operand 8 states. [2018-04-11 12:26:49,595 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-11 12:26:49,596 INFO L93 Difference]: Finished difference Result 351 states and 391 transitions. [2018-04-11 12:26:49,596 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-04-11 12:26:49,596 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 58 [2018-04-11 12:26:49,596 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-11 12:26:49,597 INFO L225 Difference]: With dead ends: 351 [2018-04-11 12:26:49,597 INFO L226 Difference]: Without dead ends: 319 [2018-04-11 12:26:49,597 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 65 GetRequests, 56 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=34, Invalid=72, Unknown=4, NotChecked=0, Total=110 [2018-04-11 12:26:49,598 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 319 states. [2018-04-11 12:26:49,600 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 319 to 318. [2018-04-11 12:26:49,600 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 318 states. [2018-04-11 12:26:49,601 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 318 states to 318 states and 358 transitions. [2018-04-11 12:26:49,601 INFO L78 Accepts]: Start accepts. Automaton has 318 states and 358 transitions. Word has length 58 [2018-04-11 12:26:49,602 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-11 12:26:49,602 INFO L459 AbstractCegarLoop]: Abstraction has 318 states and 358 transitions. [2018-04-11 12:26:49,602 INFO L460 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-04-11 12:26:49,602 INFO L276 IsEmpty]: Start isEmpty. Operand 318 states and 358 transitions. [2018-04-11 12:26:49,602 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 63 [2018-04-11 12:26:49,602 INFO L347 BasicCegarLoop]: Found error trace [2018-04-11 12:26:49,603 INFO L355 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-11 12:26:49,603 INFO L408 AbstractCegarLoop]: === Iteration 26 === [mainErr51RequiresViolation, mainErr26RequiresViolation, mainErr54RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr31RequiresViolation, mainErr46RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr58RequiresViolation, mainErr15RequiresViolation, mainErr49RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr55RequiresViolation, mainErr17RequiresViolation, mainErr42RequiresViolation, mainErr62EnsuresViolationMEMORY_LEAK, mainErr30RequiresViolation, mainErr56AssertViolationMEMORY_FREE, mainErr11RequiresViolation, mainErr61AssertViolationMEMORY_FREE, mainErr24RequiresViolation, mainErr44RequiresViolation, mainErr10RequiresViolation, mainErr43RequiresViolation, mainErr4RequiresViolation, mainErr50RequiresViolation, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr59RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr48RequiresViolation, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr52RequiresViolation, mainErr45RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr57AssertViolationMEMORY_FREE, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr60AssertViolationMEMORY_FREE, mainErr9RequiresViolation, mainErr53RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr34RequiresViolation, mainErr47RequiresViolation, mainErr14RequiresViolation, mainErr40RequiresViolation]=== [2018-04-11 12:26:49,603 INFO L82 PathProgramCache]: Analyzing trace with hash -1981068824, now seen corresponding path program 1 times [2018-04-11 12:26:49,603 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-04-11 12:26:49,603 INFO L68 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-04-11 12:26:49,604 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 12:26:49,604 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-11 12:26:49,604 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 12:26:49,614 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-11 12:26:49,614 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-11 12:26:49,791 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2018-04-11 12:26:49,792 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-04-11 12:26:49,792 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2018-04-11 12:26:49,792 INFO L442 AbstractCegarLoop]: Interpolant automaton has 14 states [2018-04-11 12:26:49,792 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2018-04-11 12:26:49,792 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=37, Invalid=145, Unknown=0, NotChecked=0, Total=182 [2018-04-11 12:26:49,792 INFO L87 Difference]: Start difference. First operand 318 states and 358 transitions. Second operand 14 states. [2018-04-11 12:26:50,473 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-11 12:26:50,473 INFO L93 Difference]: Finished difference Result 794 states and 869 transitions. [2018-04-11 12:26:50,473 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 32 states. [2018-04-11 12:26:50,473 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 62 [2018-04-11 12:26:50,474 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-11 12:26:50,476 INFO L225 Difference]: With dead ends: 794 [2018-04-11 12:26:50,476 INFO L226 Difference]: Without dead ends: 794 [2018-04-11 12:26:50,476 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 45 GetRequests, 3 SyntacticMatches, 1 SemanticMatches, 41 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 431 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=451, Invalid=1355, Unknown=0, NotChecked=0, Total=1806 [2018-04-11 12:26:50,477 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 794 states. [2018-04-11 12:26:50,482 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 794 to 433. [2018-04-11 12:26:50,482 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 433 states. [2018-04-11 12:26:50,483 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 433 states to 433 states and 499 transitions. [2018-04-11 12:26:50,483 INFO L78 Accepts]: Start accepts. Automaton has 433 states and 499 transitions. Word has length 62 [2018-04-11 12:26:50,483 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-11 12:26:50,483 INFO L459 AbstractCegarLoop]: Abstraction has 433 states and 499 transitions. [2018-04-11 12:26:50,483 INFO L460 AbstractCegarLoop]: Interpolant automaton has 14 states. [2018-04-11 12:26:50,483 INFO L276 IsEmpty]: Start isEmpty. Operand 433 states and 499 transitions. [2018-04-11 12:26:50,484 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2018-04-11 12:26:50,484 INFO L347 BasicCegarLoop]: Found error trace [2018-04-11 12:26:50,484 INFO L355 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-11 12:26:50,484 INFO L408 AbstractCegarLoop]: === Iteration 27 === [mainErr51RequiresViolation, mainErr26RequiresViolation, mainErr54RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr31RequiresViolation, mainErr46RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr58RequiresViolation, mainErr15RequiresViolation, mainErr49RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr55RequiresViolation, mainErr17RequiresViolation, mainErr42RequiresViolation, mainErr62EnsuresViolationMEMORY_LEAK, mainErr30RequiresViolation, mainErr56AssertViolationMEMORY_FREE, mainErr11RequiresViolation, mainErr61AssertViolationMEMORY_FREE, mainErr24RequiresViolation, mainErr44RequiresViolation, mainErr10RequiresViolation, mainErr43RequiresViolation, mainErr4RequiresViolation, mainErr50RequiresViolation, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr59RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr48RequiresViolation, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr52RequiresViolation, mainErr45RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr57AssertViolationMEMORY_FREE, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr60AssertViolationMEMORY_FREE, mainErr9RequiresViolation, mainErr53RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr34RequiresViolation, mainErr47RequiresViolation, mainErr14RequiresViolation, mainErr40RequiresViolation]=== [2018-04-11 12:26:50,484 INFO L82 PathProgramCache]: Analyzing trace with hash -244403719, now seen corresponding path program 1 times [2018-04-11 12:26:50,484 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-04-11 12:26:50,485 INFO L68 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-04-11 12:26:50,485 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 12:26:50,486 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-11 12:26:50,486 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 12:26:50,492 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-11 12:26:50,493 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-11 12:26:50,562 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2018-04-11 12:26:50,563 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-04-11 12:26:50,563 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-04-11 12:26:50,563 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-04-11 12:26:50,563 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-04-11 12:26:50,563 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2018-04-11 12:26:50,563 INFO L87 Difference]: Start difference. First operand 433 states and 499 transitions. Second operand 7 states. [2018-04-11 12:26:50,707 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-11 12:26:50,707 INFO L93 Difference]: Finished difference Result 456 states and 517 transitions. [2018-04-11 12:26:50,707 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-04-11 12:26:50,707 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 63 [2018-04-11 12:26:50,707 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-11 12:26:50,708 INFO L225 Difference]: With dead ends: 456 [2018-04-11 12:26:50,708 INFO L226 Difference]: Without dead ends: 456 [2018-04-11 12:26:50,708 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=32, Invalid=78, Unknown=0, NotChecked=0, Total=110 [2018-04-11 12:26:50,709 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 456 states. [2018-04-11 12:26:50,711 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 456 to 433. [2018-04-11 12:26:50,711 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 433 states. [2018-04-11 12:26:50,711 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 433 states to 433 states and 498 transitions. [2018-04-11 12:26:50,711 INFO L78 Accepts]: Start accepts. Automaton has 433 states and 498 transitions. Word has length 63 [2018-04-11 12:26:50,712 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-11 12:26:50,712 INFO L459 AbstractCegarLoop]: Abstraction has 433 states and 498 transitions. [2018-04-11 12:26:50,712 INFO L460 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-04-11 12:26:50,712 INFO L276 IsEmpty]: Start isEmpty. Operand 433 states and 498 transitions. [2018-04-11 12:26:50,712 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2018-04-11 12:26:50,712 INFO L347 BasicCegarLoop]: Found error trace [2018-04-11 12:26:50,712 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-11 12:26:50,712 INFO L408 AbstractCegarLoop]: === Iteration 28 === [mainErr51RequiresViolation, mainErr26RequiresViolation, mainErr54RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr31RequiresViolation, mainErr46RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr58RequiresViolation, mainErr15RequiresViolation, mainErr49RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr55RequiresViolation, mainErr17RequiresViolation, mainErr42RequiresViolation, mainErr62EnsuresViolationMEMORY_LEAK, mainErr30RequiresViolation, mainErr56AssertViolationMEMORY_FREE, mainErr11RequiresViolation, mainErr61AssertViolationMEMORY_FREE, mainErr24RequiresViolation, mainErr44RequiresViolation, mainErr10RequiresViolation, mainErr43RequiresViolation, mainErr4RequiresViolation, mainErr50RequiresViolation, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr59RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr48RequiresViolation, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr52RequiresViolation, mainErr45RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr57AssertViolationMEMORY_FREE, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr60AssertViolationMEMORY_FREE, mainErr9RequiresViolation, mainErr53RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr34RequiresViolation, mainErr47RequiresViolation, mainErr14RequiresViolation, mainErr40RequiresViolation]=== [2018-04-11 12:26:50,712 INFO L82 PathProgramCache]: Analyzing trace with hash 935150629, now seen corresponding path program 1 times [2018-04-11 12:26:50,712 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-04-11 12:26:50,713 INFO L68 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-04-11 12:26:50,713 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 12:26:50,713 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-11 12:26:50,713 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 12:26:50,717 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-11 12:26:50,718 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-11 12:26:50,727 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-11 12:26:50,727 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-04-11 12:26:50,727 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-04-11 12:26:50,727 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-04-11 12:26:50,727 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-04-11 12:26:50,727 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-04-11 12:26:50,727 INFO L87 Difference]: Start difference. First operand 433 states and 498 transitions. Second operand 3 states. [2018-04-11 12:26:50,733 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-11 12:26:50,733 INFO L93 Difference]: Finished difference Result 701 states and 812 transitions. [2018-04-11 12:26:50,733 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-04-11 12:26:50,733 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 63 [2018-04-11 12:26:50,733 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-11 12:26:50,734 INFO L225 Difference]: With dead ends: 701 [2018-04-11 12:26:50,734 INFO L226 Difference]: Without dead ends: 701 [2018-04-11 12:26:50,734 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-04-11 12:26:50,735 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 701 states. [2018-04-11 12:26:50,738 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 701 to 525. [2018-04-11 12:26:50,738 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 525 states. [2018-04-11 12:26:50,739 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 525 states to 525 states and 615 transitions. [2018-04-11 12:26:50,739 INFO L78 Accepts]: Start accepts. Automaton has 525 states and 615 transitions. Word has length 63 [2018-04-11 12:26:50,739 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-11 12:26:50,739 INFO L459 AbstractCegarLoop]: Abstraction has 525 states and 615 transitions. [2018-04-11 12:26:50,739 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-04-11 12:26:50,739 INFO L276 IsEmpty]: Start isEmpty. Operand 525 states and 615 transitions. [2018-04-11 12:26:50,740 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2018-04-11 12:26:50,740 INFO L347 BasicCegarLoop]: Found error trace [2018-04-11 12:26:50,740 INFO L355 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-11 12:26:50,740 INFO L408 AbstractCegarLoop]: === Iteration 29 === [mainErr51RequiresViolation, mainErr26RequiresViolation, mainErr54RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr31RequiresViolation, mainErr46RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr58RequiresViolation, mainErr15RequiresViolation, mainErr49RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr55RequiresViolation, mainErr17RequiresViolation, mainErr42RequiresViolation, mainErr62EnsuresViolationMEMORY_LEAK, mainErr30RequiresViolation, mainErr56AssertViolationMEMORY_FREE, mainErr11RequiresViolation, mainErr61AssertViolationMEMORY_FREE, mainErr24RequiresViolation, mainErr44RequiresViolation, mainErr10RequiresViolation, mainErr43RequiresViolation, mainErr4RequiresViolation, mainErr50RequiresViolation, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr59RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr48RequiresViolation, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr52RequiresViolation, mainErr45RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr57AssertViolationMEMORY_FREE, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr60AssertViolationMEMORY_FREE, mainErr9RequiresViolation, mainErr53RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr34RequiresViolation, mainErr47RequiresViolation, mainErr14RequiresViolation, mainErr40RequiresViolation]=== [2018-04-11 12:26:50,740 INFO L82 PathProgramCache]: Analyzing trace with hash 992408931, now seen corresponding path program 1 times [2018-04-11 12:26:50,740 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-04-11 12:26:50,740 INFO L68 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-04-11 12:26:50,741 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 12:26:50,741 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-11 12:26:50,741 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 12:26:50,745 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-11 12:26:50,745 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-11 12:26:50,796 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-11 12:26:50,796 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-04-11 12:26:50,796 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-04-11 12:26:50,796 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-04-11 12:26:50,797 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-04-11 12:26:50,797 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-04-11 12:26:50,797 INFO L87 Difference]: Start difference. First operand 525 states and 615 transitions. Second operand 6 states. [2018-04-11 12:26:50,870 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-11 12:26:50,870 INFO L93 Difference]: Finished difference Result 503 states and 578 transitions. [2018-04-11 12:26:50,871 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-04-11 12:26:50,871 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 63 [2018-04-11 12:26:50,871 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-11 12:26:50,872 INFO L225 Difference]: With dead ends: 503 [2018-04-11 12:26:50,872 INFO L226 Difference]: Without dead ends: 503 [2018-04-11 12:26:50,873 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2018-04-11 12:26:50,873 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 503 states. [2018-04-11 12:26:50,877 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 503 to 428. [2018-04-11 12:26:50,877 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 428 states. [2018-04-11 12:26:50,878 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 428 states to 428 states and 487 transitions. [2018-04-11 12:26:50,878 INFO L78 Accepts]: Start accepts. Automaton has 428 states and 487 transitions. Word has length 63 [2018-04-11 12:26:50,878 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-11 12:26:50,878 INFO L459 AbstractCegarLoop]: Abstraction has 428 states and 487 transitions. [2018-04-11 12:26:50,878 INFO L460 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-04-11 12:26:50,879 INFO L276 IsEmpty]: Start isEmpty. Operand 428 states and 487 transitions. [2018-04-11 12:26:50,879 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2018-04-11 12:26:50,879 INFO L347 BasicCegarLoop]: Found error trace [2018-04-11 12:26:50,879 INFO L355 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-11 12:26:50,879 INFO L408 AbstractCegarLoop]: === Iteration 30 === [mainErr51RequiresViolation, mainErr26RequiresViolation, mainErr54RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr31RequiresViolation, mainErr46RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr58RequiresViolation, mainErr15RequiresViolation, mainErr49RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr55RequiresViolation, mainErr17RequiresViolation, mainErr42RequiresViolation, mainErr62EnsuresViolationMEMORY_LEAK, mainErr30RequiresViolation, mainErr56AssertViolationMEMORY_FREE, mainErr11RequiresViolation, mainErr61AssertViolationMEMORY_FREE, mainErr24RequiresViolation, mainErr44RequiresViolation, mainErr10RequiresViolation, mainErr43RequiresViolation, mainErr4RequiresViolation, mainErr50RequiresViolation, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr59RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr48RequiresViolation, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr52RequiresViolation, mainErr45RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr57AssertViolationMEMORY_FREE, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr60AssertViolationMEMORY_FREE, mainErr9RequiresViolation, mainErr53RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr34RequiresViolation, mainErr47RequiresViolation, mainErr14RequiresViolation, mainErr40RequiresViolation]=== [2018-04-11 12:26:50,880 INFO L82 PathProgramCache]: Analyzing trace with hash -1545552034, now seen corresponding path program 1 times [2018-04-11 12:26:50,880 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-04-11 12:26:50,880 INFO L68 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-04-11 12:26:50,881 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 12:26:50,881 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-11 12:26:50,881 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 12:26:50,889 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-11 12:26:50,890 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-11 12:26:51,007 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2018-04-11 12:26:51,008 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-04-11 12:26:51,008 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2018-04-11 12:26:51,008 INFO L442 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-04-11 12:26:51,008 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-04-11 12:26:51,008 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=86, Unknown=0, NotChecked=0, Total=110 [2018-04-11 12:26:51,008 INFO L87 Difference]: Start difference. First operand 428 states and 487 transitions. Second operand 11 states. [2018-04-11 12:26:51,396 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-11 12:26:51,397 INFO L93 Difference]: Finished difference Result 694 states and 796 transitions. [2018-04-11 12:26:51,397 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2018-04-11 12:26:51,397 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 65 [2018-04-11 12:26:51,397 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-11 12:26:51,398 INFO L225 Difference]: With dead ends: 694 [2018-04-11 12:26:51,398 INFO L226 Difference]: Without dead ends: 694 [2018-04-11 12:26:51,398 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 40 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=121, Invalid=299, Unknown=0, NotChecked=0, Total=420 [2018-04-11 12:26:51,399 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 694 states. [2018-04-11 12:26:51,401 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 694 to 398. [2018-04-11 12:26:51,401 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 398 states. [2018-04-11 12:26:51,402 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 398 states to 398 states and 455 transitions. [2018-04-11 12:26:51,402 INFO L78 Accepts]: Start accepts. Automaton has 398 states and 455 transitions. Word has length 65 [2018-04-11 12:26:51,402 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-11 12:26:51,402 INFO L459 AbstractCegarLoop]: Abstraction has 398 states and 455 transitions. [2018-04-11 12:26:51,402 INFO L460 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-04-11 12:26:51,402 INFO L276 IsEmpty]: Start isEmpty. Operand 398 states and 455 transitions. [2018-04-11 12:26:51,402 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2018-04-11 12:26:51,402 INFO L347 BasicCegarLoop]: Found error trace [2018-04-11 12:26:51,402 INFO L355 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-11 12:26:51,402 INFO L408 AbstractCegarLoop]: === Iteration 31 === [mainErr51RequiresViolation, mainErr26RequiresViolation, mainErr54RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr31RequiresViolation, mainErr46RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr58RequiresViolation, mainErr15RequiresViolation, mainErr49RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr55RequiresViolation, mainErr17RequiresViolation, mainErr42RequiresViolation, mainErr62EnsuresViolationMEMORY_LEAK, mainErr30RequiresViolation, mainErr56AssertViolationMEMORY_FREE, mainErr11RequiresViolation, mainErr61AssertViolationMEMORY_FREE, mainErr24RequiresViolation, mainErr44RequiresViolation, mainErr10RequiresViolation, mainErr43RequiresViolation, mainErr4RequiresViolation, mainErr50RequiresViolation, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr59RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr48RequiresViolation, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr52RequiresViolation, mainErr45RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr57AssertViolationMEMORY_FREE, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr60AssertViolationMEMORY_FREE, mainErr9RequiresViolation, mainErr53RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr34RequiresViolation, mainErr47RequiresViolation, mainErr14RequiresViolation, mainErr40RequiresViolation]=== [2018-04-11 12:26:51,403 INFO L82 PathProgramCache]: Analyzing trace with hash 1982567314, now seen corresponding path program 1 times [2018-04-11 12:26:51,403 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-04-11 12:26:51,403 INFO L68 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-04-11 12:26:51,403 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 12:26:51,403 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-11 12:26:51,403 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 12:26:51,407 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-11 12:26:51,407 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-11 12:26:51,437 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-11 12:26:51,437 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-04-11 12:26:51,437 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-04-11 12:26:51,437 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-04-11 12:26:51,437 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-04-11 12:26:51,437 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-04-11 12:26:51,438 INFO L87 Difference]: Start difference. First operand 398 states and 455 transitions. Second operand 5 states. [2018-04-11 12:26:51,499 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-11 12:26:51,499 INFO L93 Difference]: Finished difference Result 414 states and 471 transitions. [2018-04-11 12:26:51,499 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-04-11 12:26:51,499 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 65 [2018-04-11 12:26:51,499 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-11 12:26:51,500 INFO L225 Difference]: With dead ends: 414 [2018-04-11 12:26:51,500 INFO L226 Difference]: Without dead ends: 414 [2018-04-11 12:26:51,500 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-11 12:26:51,500 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 414 states. [2018-04-11 12:26:51,502 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 414 to 402. [2018-04-11 12:26:51,502 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 402 states. [2018-04-11 12:26:51,503 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 402 states to 402 states and 458 transitions. [2018-04-11 12:26:51,503 INFO L78 Accepts]: Start accepts. Automaton has 402 states and 458 transitions. Word has length 65 [2018-04-11 12:26:51,503 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-11 12:26:51,503 INFO L459 AbstractCegarLoop]: Abstraction has 402 states and 458 transitions. [2018-04-11 12:26:51,503 INFO L460 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-04-11 12:26:51,503 INFO L276 IsEmpty]: Start isEmpty. Operand 402 states and 458 transitions. [2018-04-11 12:26:51,504 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2018-04-11 12:26:51,504 INFO L347 BasicCegarLoop]: Found error trace [2018-04-11 12:26:51,504 INFO L355 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-11 12:26:51,504 INFO L408 AbstractCegarLoop]: === Iteration 32 === [mainErr51RequiresViolation, mainErr26RequiresViolation, mainErr54RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr31RequiresViolation, mainErr46RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr58RequiresViolation, mainErr15RequiresViolation, mainErr49RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr55RequiresViolation, mainErr17RequiresViolation, mainErr42RequiresViolation, mainErr62EnsuresViolationMEMORY_LEAK, mainErr30RequiresViolation, mainErr56AssertViolationMEMORY_FREE, mainErr11RequiresViolation, mainErr61AssertViolationMEMORY_FREE, mainErr24RequiresViolation, mainErr44RequiresViolation, mainErr10RequiresViolation, mainErr43RequiresViolation, mainErr4RequiresViolation, mainErr50RequiresViolation, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr59RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr48RequiresViolation, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr52RequiresViolation, mainErr45RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr57AssertViolationMEMORY_FREE, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr60AssertViolationMEMORY_FREE, mainErr9RequiresViolation, mainErr53RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr34RequiresViolation, mainErr47RequiresViolation, mainErr14RequiresViolation, mainErr40RequiresViolation]=== [2018-04-11 12:26:51,504 INFO L82 PathProgramCache]: Analyzing trace with hash -1390252947, now seen corresponding path program 1 times [2018-04-11 12:26:51,504 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-04-11 12:26:51,504 INFO L68 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-04-11 12:26:51,505 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 12:26:51,505 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-11 12:26:51,505 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 12:26:51,510 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-11 12:26:51,510 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-11 12:26:51,857 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-11 12:26:51,858 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-04-11 12:26:51,858 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-11 12:26:51,863 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-11 12:26:51,875 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-11 12:26:51,878 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-11 12:26:51,943 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 10 [2018-04-11 12:26:51,946 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 9 [2018-04-11 12:26:51,946 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 12:26:51,948 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 12:26:51,958 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 10 [2018-04-11 12:26:51,960 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 9 [2018-04-11 12:26:51,960 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-04-11 12:26:51,962 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 12:26:51,968 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-04-11 12:26:51,969 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 2 variables, input treesize:38, output treesize:30 [2018-04-11 12:26:52,031 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 12:26:52,032 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 12:26:52,033 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 4 [2018-04-11 12:26:52,033 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-11 12:26:52,043 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 12:26:52,043 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:41, output treesize:35 [2018-04-11 12:26:52,079 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 19 [2018-04-11 12:26:52,082 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 12:26:52,084 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-11 12:26:52,085 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 12:26:52,090 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 12:26:52,110 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 19 [2018-04-11 12:26:52,112 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 12:26:52,113 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-11 12:26:52,113 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-04-11 12:26:52,118 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 12:26:52,126 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-11 12:26:52,126 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 4 variables, input treesize:57, output treesize:39 [2018-04-11 12:26:52,193 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 12:26:52,196 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 36 treesize of output 37 [2018-04-11 12:26:52,197 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-04-11 12:26:52,197 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 12:26:52,202 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 12:26:52,211 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 12:26:52,213 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 26 [2018-04-11 12:26:52,214 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 11 [2018-04-11 12:26:52,214 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-04-11 12:26:52,217 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 12:26:52,224 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-04-11 12:26:52,224 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 2 variables, input treesize:62, output treesize:58 [2018-04-11 12:26:52,254 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-11 12:26:52,256 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 12:26:52,256 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 20 treesize of output 31 [2018-04-11 12:26:52,257 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 12:26:52,268 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 12:26:52,283 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 42 treesize of output 37 [2018-04-11 12:26:52,284 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 12:26:52,285 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 20 treesize of output 31 [2018-04-11 12:26:52,285 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-04-11 12:26:52,289 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 12:26:52,297 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-11 12:26:52,297 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 3 variables, input treesize:97, output treesize:81 [2018-04-11 12:26:52,375 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 75 treesize of output 58 [2018-04-11 12:26:52,376 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 12:26:52,377 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 41 treesize of output 30 [2018-04-11 12:26:52,378 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-11 12:26:52,384 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 12:26:52,385 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-11 12:26:52,385 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-04-11 12:26:52,389 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-11 12:26:52,396 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 35 treesize of output 31 [2018-04-11 12:26:52,397 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 3 [2018-04-11 12:26:52,397 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2018-04-11 12:26:52,402 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 12:26:52,402 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-11 12:26:52,402 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2018-04-11 12:26:52,404 INFO L267 ElimStorePlain]: Start of recursive call 5: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 12:26:52,407 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-04-11 12:26:52,407 INFO L202 ElimStorePlain]: Needed 7 recursive calls to eliminate 5 variables, input treesize:99, output treesize:7 [2018-04-11 12:26:52,442 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-11 12:26:52,460 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-04-11 12:26:52,460 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [18, 16] total 30 [2018-04-11 12:26:52,460 INFO L442 AbstractCegarLoop]: Interpolant automaton has 30 states [2018-04-11 12:26:52,460 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 30 interpolants. [2018-04-11 12:26:52,461 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=125, Invalid=745, Unknown=0, NotChecked=0, Total=870 [2018-04-11 12:26:52,461 INFO L87 Difference]: Start difference. First operand 402 states and 458 transitions. Second operand 30 states. [2018-04-11 12:26:54,112 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-11 12:26:54,112 INFO L93 Difference]: Finished difference Result 742 states and 820 transitions. [2018-04-11 12:26:54,112 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 37 states. [2018-04-11 12:26:54,112 INFO L78 Accepts]: Start accepts. Automaton has 30 states. Word has length 67 [2018-04-11 12:26:54,113 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-11 12:26:54,114 INFO L225 Difference]: With dead ends: 742 [2018-04-11 12:26:54,114 INFO L226 Difference]: Without dead ends: 742 [2018-04-11 12:26:54,115 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 120 GetRequests, 55 SyntacticMatches, 3 SemanticMatches, 62 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 963 ImplicationChecksByTransitivity, 1.4s TimeCoverageRelationStatistics Valid=817, Invalid=3214, Unknown=1, NotChecked=0, Total=4032 [2018-04-11 12:26:54,115 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 742 states. [2018-04-11 12:26:54,118 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 742 to 487. [2018-04-11 12:26:54,118 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 487 states. [2018-04-11 12:26:54,118 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 487 states to 487 states and 549 transitions. [2018-04-11 12:26:54,118 INFO L78 Accepts]: Start accepts. Automaton has 487 states and 549 transitions. Word has length 67 [2018-04-11 12:26:54,119 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-11 12:26:54,119 INFO L459 AbstractCegarLoop]: Abstraction has 487 states and 549 transitions. [2018-04-11 12:26:54,119 INFO L460 AbstractCegarLoop]: Interpolant automaton has 30 states. [2018-04-11 12:26:54,119 INFO L276 IsEmpty]: Start isEmpty. Operand 487 states and 549 transitions. [2018-04-11 12:26:54,119 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 70 [2018-04-11 12:26:54,119 INFO L347 BasicCegarLoop]: Found error trace [2018-04-11 12:26:54,119 INFO L355 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-11 12:26:54,119 INFO L408 AbstractCegarLoop]: === Iteration 33 === [mainErr51RequiresViolation, mainErr26RequiresViolation, mainErr54RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr31RequiresViolation, mainErr46RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr58RequiresViolation, mainErr15RequiresViolation, mainErr49RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr55RequiresViolation, mainErr17RequiresViolation, mainErr42RequiresViolation, mainErr62EnsuresViolationMEMORY_LEAK, mainErr30RequiresViolation, mainErr56AssertViolationMEMORY_FREE, mainErr11RequiresViolation, mainErr61AssertViolationMEMORY_FREE, mainErr24RequiresViolation, mainErr44RequiresViolation, mainErr10RequiresViolation, mainErr43RequiresViolation, mainErr4RequiresViolation, mainErr50RequiresViolation, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr59RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr48RequiresViolation, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr52RequiresViolation, mainErr45RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr57AssertViolationMEMORY_FREE, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr60AssertViolationMEMORY_FREE, mainErr9RequiresViolation, mainErr53RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr34RequiresViolation, mainErr47RequiresViolation, mainErr14RequiresViolation, mainErr40RequiresViolation]=== [2018-04-11 12:26:54,120 INFO L82 PathProgramCache]: Analyzing trace with hash 1559864763, now seen corresponding path program 1 times [2018-04-11 12:26:54,120 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-04-11 12:26:54,120 INFO L68 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-04-11 12:26:54,120 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 12:26:54,120 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-11 12:26:54,120 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 12:26:54,125 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-11 12:26:54,125 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-11 12:26:54,344 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2018-04-11 12:26:54,344 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-04-11 12:26:54,344 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2018-04-11 12:26:54,344 INFO L442 AbstractCegarLoop]: Interpolant automaton has 12 states [2018-04-11 12:26:54,344 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2018-04-11 12:26:54,344 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=102, Unknown=0, NotChecked=0, Total=132 [2018-04-11 12:26:54,345 INFO L87 Difference]: Start difference. First operand 487 states and 549 transitions. Second operand 12 states. [2018-04-11 12:26:54,752 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-11 12:26:54,752 INFO L93 Difference]: Finished difference Result 513 states and 569 transitions. [2018-04-11 12:26:54,752 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2018-04-11 12:26:54,752 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 69 [2018-04-11 12:26:54,753 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-11 12:26:54,754 INFO L225 Difference]: With dead ends: 513 [2018-04-11 12:26:54,754 INFO L226 Difference]: Without dead ends: 513 [2018-04-11 12:26:54,754 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 2 SyntacticMatches, 2 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 89 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=175, Invalid=425, Unknown=0, NotChecked=0, Total=600 [2018-04-11 12:26:54,754 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 513 states. [2018-04-11 12:26:54,757 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 513 to 497. [2018-04-11 12:26:54,757 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 497 states. [2018-04-11 12:26:54,757 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 497 states to 497 states and 559 transitions. [2018-04-11 12:26:54,757 INFO L78 Accepts]: Start accepts. Automaton has 497 states and 559 transitions. Word has length 69 [2018-04-11 12:26:54,757 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-11 12:26:54,757 INFO L459 AbstractCegarLoop]: Abstraction has 497 states and 559 transitions. [2018-04-11 12:26:54,758 INFO L460 AbstractCegarLoop]: Interpolant automaton has 12 states. [2018-04-11 12:26:54,758 INFO L276 IsEmpty]: Start isEmpty. Operand 497 states and 559 transitions. [2018-04-11 12:26:54,758 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 70 [2018-04-11 12:26:54,758 INFO L347 BasicCegarLoop]: Found error trace [2018-04-11 12:26:54,758 INFO L355 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-11 12:26:54,758 INFO L408 AbstractCegarLoop]: === Iteration 34 === [mainErr51RequiresViolation, mainErr26RequiresViolation, mainErr54RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr31RequiresViolation, mainErr46RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr58RequiresViolation, mainErr15RequiresViolation, mainErr49RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr55RequiresViolation, mainErr17RequiresViolation, mainErr42RequiresViolation, mainErr62EnsuresViolationMEMORY_LEAK, mainErr30RequiresViolation, mainErr56AssertViolationMEMORY_FREE, mainErr11RequiresViolation, mainErr61AssertViolationMEMORY_FREE, mainErr24RequiresViolation, mainErr44RequiresViolation, mainErr10RequiresViolation, mainErr43RequiresViolation, mainErr4RequiresViolation, mainErr50RequiresViolation, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr59RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr48RequiresViolation, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr52RequiresViolation, mainErr45RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr57AssertViolationMEMORY_FREE, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr60AssertViolationMEMORY_FREE, mainErr9RequiresViolation, mainErr53RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr34RequiresViolation, mainErr47RequiresViolation, mainErr14RequiresViolation, mainErr40RequiresViolation]=== [2018-04-11 12:26:54,758 INFO L82 PathProgramCache]: Analyzing trace with hash -414101251, now seen corresponding path program 1 times [2018-04-11 12:26:54,758 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-04-11 12:26:54,758 INFO L68 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-04-11 12:26:54,759 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 12:26:54,759 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-11 12:26:54,759 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 12:26:54,765 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-11 12:26:54,766 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-11 12:26:54,895 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-11 12:26:54,895 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-04-11 12:26:54,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 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-11 12:26:54,902 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-11 12:26:54,932 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-11 12:26:54,935 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-11 12:26:54,944 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 12:26:54,945 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 12:26:54,945 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 21 [2018-04-11 12:26:54,945 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-11 12:26:54,952 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 12:26:54,952 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:23, output treesize:21 [2018-04-11 12:26:54,970 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 8 [2018-04-11 12:26:54,972 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-11 12:26:54,972 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 12:26:54,973 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 12:26:54,980 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-11 12:26:54,981 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:32, output treesize:29 [2018-04-11 12:26:55,035 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 12:26:55,037 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 37 [2018-04-11 12:26:55,039 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-11 12:26:55,039 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 12:26:55,043 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 12:26:55,048 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-04-11 12:26:55,048 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:41, output treesize:37 [2018-04-11 12:26:55,077 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 50 treesize of output 40 [2018-04-11 12:26:55,079 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 12:26:55,079 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 20 treesize of output 31 [2018-04-11 12:26:55,080 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 12:26:55,085 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 12:26:55,091 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-04-11 12:26:55,091 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:55, output treesize:47 [2018-04-11 12:26:55,184 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 49 treesize of output 31 [2018-04-11 12:26:55,187 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 12:26:55,188 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-11 12:26:55,188 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 12:26:55,194 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-11 12:26:55,194 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-04-11 12:26:55,197 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 12:26:55,201 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-04-11 12:26:55,201 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 4 variables, input treesize:54, output treesize:15 [2018-04-11 12:26:55,262 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-11 12:26:55,287 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-04-11 12:26:55,287 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 12] total 21 [2018-04-11 12:26:55,287 INFO L442 AbstractCegarLoop]: Interpolant automaton has 22 states [2018-04-11 12:26:55,287 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2018-04-11 12:26:55,288 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=81, Invalid=381, Unknown=0, NotChecked=0, Total=462 [2018-04-11 12:26:55,288 INFO L87 Difference]: Start difference. First operand 497 states and 559 transitions. Second operand 22 states. [2018-04-11 12:26:55,899 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-11 12:26:55,899 INFO L93 Difference]: Finished difference Result 599 states and 646 transitions. [2018-04-11 12:26:55,899 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2018-04-11 12:26:55,899 INFO L78 Accepts]: Start accepts. Automaton has 22 states. Word has length 69 [2018-04-11 12:26:55,899 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-11 12:26:55,900 INFO L225 Difference]: With dead ends: 599 [2018-04-11 12:26:55,900 INFO L226 Difference]: Without dead ends: 599 [2018-04-11 12:26:55,901 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 91 GetRequests, 59 SyntacticMatches, 2 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 210 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=216, Invalid=776, Unknown=0, NotChecked=0, Total=992 [2018-04-11 12:26:55,901 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 599 states. [2018-04-11 12:26:55,903 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 599 to 498. [2018-04-11 12:26:55,903 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 498 states. [2018-04-11 12:26:55,904 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 498 states to 498 states and 561 transitions. [2018-04-11 12:26:55,904 INFO L78 Accepts]: Start accepts. Automaton has 498 states and 561 transitions. Word has length 69 [2018-04-11 12:26:55,904 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-11 12:26:55,904 INFO L459 AbstractCegarLoop]: Abstraction has 498 states and 561 transitions. [2018-04-11 12:26:55,904 INFO L460 AbstractCegarLoop]: Interpolant automaton has 22 states. [2018-04-11 12:26:55,904 INFO L276 IsEmpty]: Start isEmpty. Operand 498 states and 561 transitions. [2018-04-11 12:26:55,905 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 70 [2018-04-11 12:26:55,905 INFO L347 BasicCegarLoop]: Found error trace [2018-04-11 12:26:55,905 INFO L355 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-11 12:26:55,905 INFO L408 AbstractCegarLoop]: === Iteration 35 === [mainErr51RequiresViolation, mainErr26RequiresViolation, mainErr54RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr31RequiresViolation, mainErr46RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr58RequiresViolation, mainErr15RequiresViolation, mainErr49RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr55RequiresViolation, mainErr17RequiresViolation, mainErr42RequiresViolation, mainErr62EnsuresViolationMEMORY_LEAK, mainErr30RequiresViolation, mainErr56AssertViolationMEMORY_FREE, mainErr11RequiresViolation, mainErr61AssertViolationMEMORY_FREE, mainErr24RequiresViolation, mainErr44RequiresViolation, mainErr10RequiresViolation, mainErr43RequiresViolation, mainErr4RequiresViolation, mainErr50RequiresViolation, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr59RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr48RequiresViolation, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr52RequiresViolation, mainErr45RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr57AssertViolationMEMORY_FREE, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr60AssertViolationMEMORY_FREE, mainErr9RequiresViolation, mainErr53RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr34RequiresViolation, mainErr47RequiresViolation, mainErr14RequiresViolation, mainErr40RequiresViolation]=== [2018-04-11 12:26:55,905 INFO L82 PathProgramCache]: Analyzing trace with hash -414101250, now seen corresponding path program 1 times [2018-04-11 12:26:55,905 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-04-11 12:26:55,905 INFO L68 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-04-11 12:26:55,905 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 12:26:55,905 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-11 12:26:55,906 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 12:26:55,911 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-11 12:26:55,912 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-11 12:26:56,070 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-11 12:26:56,070 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-04-11 12:26:56,071 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-11 12:26:56,076 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-11 12:26:56,100 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-11 12:26:56,103 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-11 12:26:56,112 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 12:26:56,113 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 12:26:56,113 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 4 [2018-04-11 12:26:56,113 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-11 12:26:56,118 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-11 12:26:56,118 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 12:26:56,122 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 12:26:56,123 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:26, output treesize:19 [2018-04-11 12:26:56,128 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 8 [2018-04-11 12:26:56,129 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-11 12:26:56,129 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 12:26:56,131 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 12:26:56,147 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 8 [2018-04-11 12:26:56,148 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-11 12:26:56,148 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-04-11 12:26:56,149 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 12:26:56,155 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-11 12:26:56,156 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 3 variables, input treesize:38, output treesize:31 [2018-04-11 12:26:56,196 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 12:26:56,199 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 24 [2018-04-11 12:26:56,200 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 11 [2018-04-11 12:26:56,200 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 12:26:56,204 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 12:26:56,212 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 12:26:56,215 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 47 treesize of output 48 [2018-04-11 12:26:56,216 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-11 12:26:56,216 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-04-11 12:26:56,221 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 12:26:56,226 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-04-11 12:26:56,226 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 2 variables, input treesize:54, output treesize:50 [2018-04-11 12:26:56,247 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-11 12:26:56,249 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 12:26:56,249 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 20 treesize of output 31 [2018-04-11 12:26:56,250 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 12:26:56,258 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 12:26:56,269 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 40 treesize of output 35 [2018-04-11 12:26:56,272 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 12:26:56,272 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 20 treesize of output 31 [2018-04-11 12:26:56,272 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-04-11 12:26:56,277 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 12:26:56,284 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-11 12:26:56,284 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 3 variables, input treesize:89, output treesize:73 [2018-04-11 12:26:56,344 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 73 treesize of output 51 [2018-04-11 12:26:56,345 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-11 12:26:56,366 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 12:26:56,400 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 12:26:56,400 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-11 12:26:56,401 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-04-11 12:26:56,408 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 12:26:56,428 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 31 treesize of output 27 [2018-04-11 12:26:56,430 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-11 12:26:56,430 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2018-04-11 12:26:56,437 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 12:26:56,437 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-11 12:26:56,438 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2018-04-11 12:26:56,440 INFO L267 ElimStorePlain]: Start of recursive call 5: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 12:26:56,444 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-04-11 12:26:56,445 INFO L202 ElimStorePlain]: Needed 7 recursive calls to eliminate 5 variables, input treesize:87, output treesize:9 [2018-04-11 12:26:56,488 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-11 12:26:56,515 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-04-11 12:26:56,515 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 12] total 17 [2018-04-11 12:26:56,515 INFO L442 AbstractCegarLoop]: Interpolant automaton has 18 states [2018-04-11 12:26:56,516 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2018-04-11 12:26:56,516 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=49, Invalid=257, Unknown=0, NotChecked=0, Total=306 [2018-04-11 12:26:56,516 INFO L87 Difference]: Start difference. First operand 498 states and 561 transitions. Second operand 18 states. [2018-04-11 12:26:57,268 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-11 12:26:57,269 INFO L93 Difference]: Finished difference Result 580 states and 627 transitions. [2018-04-11 12:26:57,269 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2018-04-11 12:26:57,269 INFO L78 Accepts]: Start accepts. Automaton has 18 states. Word has length 69 [2018-04-11 12:26:57,269 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-11 12:26:57,270 INFO L225 Difference]: With dead ends: 580 [2018-04-11 12:26:57,270 INFO L226 Difference]: Without dead ends: 580 [2018-04-11 12:26:57,270 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 93 GetRequests, 60 SyntacticMatches, 5 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 162 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=160, Invalid=707, Unknown=3, NotChecked=0, Total=870 [2018-04-11 12:26:57,270 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 580 states. [2018-04-11 12:26:57,272 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 580 to 521. [2018-04-11 12:26:57,272 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 521 states. [2018-04-11 12:26:57,273 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 521 states to 521 states and 589 transitions. [2018-04-11 12:26:57,273 INFO L78 Accepts]: Start accepts. Automaton has 521 states and 589 transitions. Word has length 69 [2018-04-11 12:26:57,273 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-11 12:26:57,273 INFO L459 AbstractCegarLoop]: Abstraction has 521 states and 589 transitions. [2018-04-11 12:26:57,273 INFO L460 AbstractCegarLoop]: Interpolant automaton has 18 states. [2018-04-11 12:26:57,273 INFO L276 IsEmpty]: Start isEmpty. Operand 521 states and 589 transitions. [2018-04-11 12:26:57,274 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 73 [2018-04-11 12:26:57,274 INFO L347 BasicCegarLoop]: Found error trace [2018-04-11 12:26:57,274 INFO L355 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-11 12:26:57,274 INFO L408 AbstractCegarLoop]: === Iteration 36 === [mainErr51RequiresViolation, mainErr26RequiresViolation, mainErr54RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr31RequiresViolation, mainErr46RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr58RequiresViolation, mainErr15RequiresViolation, mainErr49RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr55RequiresViolation, mainErr17RequiresViolation, mainErr42RequiresViolation, mainErr62EnsuresViolationMEMORY_LEAK, mainErr30RequiresViolation, mainErr56AssertViolationMEMORY_FREE, mainErr11RequiresViolation, mainErr61AssertViolationMEMORY_FREE, mainErr24RequiresViolation, mainErr44RequiresViolation, mainErr10RequiresViolation, mainErr43RequiresViolation, mainErr4RequiresViolation, mainErr50RequiresViolation, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr59RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr48RequiresViolation, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr52RequiresViolation, mainErr45RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr57AssertViolationMEMORY_FREE, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr60AssertViolationMEMORY_FREE, mainErr9RequiresViolation, mainErr53RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr34RequiresViolation, mainErr47RequiresViolation, mainErr14RequiresViolation, mainErr40RequiresViolation]=== [2018-04-11 12:26:57,274 INFO L82 PathProgramCache]: Analyzing trace with hash -176123504, now seen corresponding path program 1 times [2018-04-11 12:26:57,274 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-04-11 12:26:57,274 INFO L68 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-04-11 12:26:57,275 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 12:26:57,275 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-11 12:26:57,275 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 12:26:57,283 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-11 12:26:57,284 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-11 12:26:57,639 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-11 12:26:57,639 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-04-11 12:26:57,639 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-11 12:26:57,644 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-11 12:26:57,662 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-11 12:26:57,665 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-11 12:26:57,721 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 12:26:57,721 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 12:26:57,722 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 21 [2018-04-11 12:26:57,722 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-11 12:26:57,726 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 12:26:57,727 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:20, output treesize:18 [2018-04-11 12:26:57,747 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 10 [2018-04-11 12:26:57,748 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 9 [2018-04-11 12:26:57,748 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 12:26:57,749 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 12:26:57,752 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-11 12:26:57,753 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:31, output treesize:30 [2018-04-11 12:26:57,782 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 45 treesize of output 39 [2018-04-11 12:26:57,783 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-11 12:26:57,783 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 12:26:57,786 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 12:26:57,791 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-04-11 12:26:57,791 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:53, output treesize:43 [2018-04-11 12:26:57,836 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 60 treesize of output 46 [2018-04-11 12:26:57,839 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 29 [2018-04-11 12:26:57,839 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 12:26:57,843 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 12:26:57,850 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-11 12:26:57,850 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:68, output treesize:58 [2018-04-11 12:27:03,900 WARN L151 SmtUtils]: Spent 2012ms on a formula simplification. DAG size of input: 28 DAG size of output 24 [2018-04-11 12:27:03,933 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 12:27:03,934 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 12:27:03,934 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 12:27:03,935 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 52 [2018-04-11 12:27:03,935 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-11 12:27:03,945 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-04-11 12:27:03,945 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:62, output treesize:70 [2018-04-11 12:27:03,983 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 58 treesize of output 61 [2018-04-11 12:27:03,985 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 12:27:03,985 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 5 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 55 treesize of output 70 [2018-04-11 12:27:03,985 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 12:27:03,991 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 12:27:04,001 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-04-11 12:27:04,001 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:81, output treesize:82 [2018-04-11 12:27:04,119 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 12:27:04,123 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 86 treesize of output 100 [2018-04-11 12:27:04,125 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-11 12:27:04,125 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 12:27:04,134 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 12:27:04,144 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-04-11 12:27:04,144 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:94, output treesize:86 [2018-04-11 12:27:04,199 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 100 treesize of output 93 [2018-04-11 12:27:04,201 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 12:27:04,202 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 20 treesize of output 31 [2018-04-11 12:27:04,202 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 12:27:04,210 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 12:27:04,221 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-11 12:27:04,221 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:108, output treesize:100 [2018-04-11 12:27:04,547 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 91 treesize of output 64 [2018-04-11 12:27:04,550 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 4 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 40 treesize of output 23 [2018-04-11 12:27:04,551 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-11 12:27:04,564 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-11 12:27:04,564 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-04-11 12:27:04,574 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 12:27:04,575 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-11 12:27:04,575 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-04-11 12:27:04,580 INFO L267 ElimStorePlain]: Start of recursive call 2: 3 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-04-11 12:27:04,586 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-11 12:27:04,586 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 4 variables, input treesize:96, output treesize:28 [2018-04-11 12:27:04,718 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-11 12:27:04,745 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-04-11 12:27:04,745 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [19, 20] total 36 [2018-04-11 12:27:04,746 INFO L442 AbstractCegarLoop]: Interpolant automaton has 37 states [2018-04-11 12:27:04,746 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 37 interpolants. [2018-04-11 12:27:04,746 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=207, Invalid=1122, Unknown=3, NotChecked=0, Total=1332 [2018-04-11 12:27:04,746 INFO L87 Difference]: Start difference. First operand 521 states and 589 transitions. Second operand 37 states. [2018-04-11 12:27:21,105 WARN L151 SmtUtils]: Spent 2020ms on a formula simplification. DAG size of input: 38 DAG size of output 33 [2018-04-11 12:27:29,494 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-11 12:27:29,495 INFO L93 Difference]: Finished difference Result 879 states and 973 transitions. [2018-04-11 12:27:29,495 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 34 states. [2018-04-11 12:27:29,495 INFO L78 Accepts]: Start accepts. Automaton has 37 states. Word has length 72 [2018-04-11 12:27:29,495 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-11 12:27:29,496 INFO L225 Difference]: With dead ends: 879 [2018-04-11 12:27:29,496 INFO L226 Difference]: Without dead ends: 879 [2018-04-11 12:27:29,497 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 124 GetRequests, 55 SyntacticMatches, 3 SemanticMatches, 66 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1049 ImplicationChecksByTransitivity, 24.2s TimeCoverageRelationStatistics Valid=920, Invalid=3622, Unknown=14, NotChecked=0, Total=4556 [2018-04-11 12:27:29,498 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 879 states. [2018-04-11 12:27:29,500 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 879 to 521. [2018-04-11 12:27:29,501 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 521 states. [2018-04-11 12:27:29,501 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 521 states to 521 states and 588 transitions. [2018-04-11 12:27:29,501 INFO L78 Accepts]: Start accepts. Automaton has 521 states and 588 transitions. Word has length 72 [2018-04-11 12:27:29,501 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-11 12:27:29,501 INFO L459 AbstractCegarLoop]: Abstraction has 521 states and 588 transitions. [2018-04-11 12:27:29,501 INFO L460 AbstractCegarLoop]: Interpolant automaton has 37 states. [2018-04-11 12:27:29,501 INFO L276 IsEmpty]: Start isEmpty. Operand 521 states and 588 transitions. [2018-04-11 12:27:29,502 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 73 [2018-04-11 12:27:29,502 INFO L347 BasicCegarLoop]: Found error trace [2018-04-11 12:27:29,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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-11 12:27:29,502 INFO L408 AbstractCegarLoop]: === Iteration 37 === [mainErr51RequiresViolation, mainErr26RequiresViolation, mainErr54RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr31RequiresViolation, mainErr46RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr58RequiresViolation, mainErr15RequiresViolation, mainErr49RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr55RequiresViolation, mainErr17RequiresViolation, mainErr42RequiresViolation, mainErr62EnsuresViolationMEMORY_LEAK, mainErr30RequiresViolation, mainErr56AssertViolationMEMORY_FREE, mainErr11RequiresViolation, mainErr61AssertViolationMEMORY_FREE, mainErr24RequiresViolation, mainErr44RequiresViolation, mainErr10RequiresViolation, mainErr43RequiresViolation, mainErr4RequiresViolation, mainErr50RequiresViolation, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr59RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr48RequiresViolation, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr52RequiresViolation, mainErr45RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr57AssertViolationMEMORY_FREE, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr60AssertViolationMEMORY_FREE, mainErr9RequiresViolation, mainErr53RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr34RequiresViolation, mainErr47RequiresViolation, mainErr14RequiresViolation, mainErr40RequiresViolation]=== [2018-04-11 12:27:29,502 INFO L82 PathProgramCache]: Analyzing trace with hash -176123503, now seen corresponding path program 1 times [2018-04-11 12:27:29,502 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-04-11 12:27:29,502 INFO L68 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-04-11 12:27:29,503 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 12:27:29,503 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-11 12:27:29,503 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 12:27:29,518 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-11 12:27:29,519 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-11 12:27:30,264 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-11 12:27:30,264 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-04-11 12:27:30,264 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-11 12:27:30,269 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-11 12:27:30,285 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-11 12:27:30,288 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-11 12:27:30,328 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 12:27:30,328 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 12:27:30,329 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 21 [2018-04-11 12:27:30,329 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-11 12:27:30,338 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-11 12:27:30,338 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 12:27:30,345 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 12:27:30,345 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:32, output treesize:29 [2018-04-11 12:27:30,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, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 10 [2018-04-11 12:27:30,368 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 9 [2018-04-11 12:27:30,369 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 12:27:30,370 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 12:27:30,378 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 10 [2018-04-11 12:27:30,379 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 9 [2018-04-11 12:27:30,379 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-04-11 12:27:30,380 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 12:27:30,387 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-11 12:27:30,387 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 3 variables, input treesize:52, output treesize:53 [2018-04-11 12:27:30,439 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 34 [2018-04-11 12:27:30,440 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-11 12:27:30,441 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 12:27:30,444 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 12:27:30,456 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 69 treesize of output 63 [2018-04-11 12:27:30,457 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 13 [2018-04-11 12:27:30,458 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-04-11 12:27:30,462 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 12:27:30,472 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-11 12:27:30,472 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 3 variables, input treesize:99, output treesize:79 [2018-04-11 12:27:30,546 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 48 treesize of output 41 [2018-04-11 12:27:30,558 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 29 [2018-04-11 12:27:30,558 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 12:27:30,563 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 12:27:30,579 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 99 treesize of output 85 [2018-04-11 12:27:30,581 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 29 [2018-04-11 12:27:30,581 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-04-11 12:27:30,588 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 12:27:30,600 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-11 12:27:30,600 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 4 variables, input treesize:129, output treesize:109 [2018-04-11 12:27:34,709 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 12:27:34,709 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 12:27:34,710 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 12:27:34,710 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 22 treesize of output 25 [2018-04-11 12:27:34,710 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-11 12:27:34,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, 3 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 27 [2018-04-11 12:27:34,723 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 12:27:34,736 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-11 12:27:34,736 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:100, output treesize:92 [2018-04-11 12:27:34,781 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 36 treesize of output 44 [2018-04-11 12:27:34,783 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 12:27:34,784 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-11 12:27:34,784 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 12:27:34,791 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 12:27:34,813 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 73 treesize of output 74 [2018-04-11 12:27:34,815 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 12:27:34,815 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 5 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 68 treesize of output 85 [2018-04-11 12:27:34,816 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-04-11 12:27:34,824 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 12:27:34,839 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 2 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-04-11 12:27:34,839 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 5 variables, input treesize:114, output treesize:104 [2018-04-11 12:27:34,993 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 12:27:34,998 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 36 treesize of output 61 [2018-04-11 12:27:35,000 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 11 [2018-04-11 12:27:35,000 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 12:27:35,006 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 12:27:35,024 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 12:27:35,029 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 112 treesize of output 126 [2018-04-11 12:27:35,031 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-04-11 12:27:35,031 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-04-11 12:27:35,044 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 12:27:35,059 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-11 12:27:35,059 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 3 variables, input treesize:127, output treesize:119 [2018-04-11 12:27:35,121 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 147 treesize of output 140 [2018-04-11 12:27:35,123 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 12:27:35,124 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 20 treesize of output 31 [2018-04-11 12:27:35,124 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 12:27:35,140 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 12:27:35,165 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 57 treesize of output 76 [2018-04-11 12:27:35,167 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 12:27:35,168 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 20 treesize of output 31 [2018-04-11 12:27:35,168 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-04-11 12:27:35,176 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 12:27:35,192 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-11 12:27:35,193 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 4 variables, input treesize:162, output treesize:146 [2018-04-11 12:27:35,356 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 140 treesize of output 105 [2018-04-11 12:27:35,358 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-11 12:27:35,358 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 12:27:35,381 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 12:27:35,381 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-11 12:27:35,382 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-04-11 12:27:35,392 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 4 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 81 treesize of output 54 [2018-04-11 12:27:35,392 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-04-11 12:27:35,401 INFO L267 ElimStorePlain]: Start of recursive call 2: 3 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-04-11 12:27:35,414 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 44 treesize of output 46 [2018-04-11 12:27:35,415 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-11 12:27:35,415 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2018-04-11 12:27:35,421 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 12:27:35,422 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-11 12:27:35,422 INFO L267 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 1 xjuncts. [2018-04-11 12:27:35,425 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 3 [2018-04-11 12:27:35,425 INFO L267 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 1 xjuncts. [2018-04-11 12:27:35,426 INFO L267 ElimStorePlain]: Start of recursive call 6: 3 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 12:27:35,432 INFO L267 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 2 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-04-11 12:27:35,432 INFO L202 ElimStorePlain]: Needed 9 recursive calls to eliminate 6 variables, input treesize:164, output treesize:18 [2018-04-11 12:27:35,523 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-11 12:27:35,540 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-04-11 12:27:35,540 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [21, 20] total 40 [2018-04-11 12:27:35,540 INFO L442 AbstractCegarLoop]: Interpolant automaton has 41 states [2018-04-11 12:27:35,540 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 41 interpolants. [2018-04-11 12:27:35,541 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=210, Invalid=1427, Unknown=3, NotChecked=0, Total=1640 [2018-04-11 12:27:35,541 INFO L87 Difference]: Start difference. First operand 521 states and 588 transitions. Second operand 41 states. [2018-04-11 12:27:38,136 WARN L151 SmtUtils]: Spent 2045ms on a formula simplification. DAG size of input: 74 DAG size of output 52 [2018-04-11 12:27:40,168 WARN L151 SmtUtils]: Spent 109ms on a formula simplification. DAG size of input: 164 DAG size of output 84 [2018-04-11 12:27:40,345 WARN L151 SmtUtils]: Spent 115ms on a formula simplification. DAG size of input: 164 DAG size of output 84 [2018-04-11 12:27:42,098 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-11 12:27:42,098 INFO L93 Difference]: Finished difference Result 1073 states and 1185 transitions. [2018-04-11 12:27:42,098 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 49 states. [2018-04-11 12:27:42,098 INFO L78 Accepts]: Start accepts. Automaton has 41 states. Word has length 72 [2018-04-11 12:27:42,098 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-11 12:27:42,100 INFO L225 Difference]: With dead ends: 1073 [2018-04-11 12:27:42,100 INFO L226 Difference]: Without dead ends: 1073 [2018-04-11 12:27:42,101 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 143 GetRequests, 55 SyntacticMatches, 3 SemanticMatches, 85 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2084 ImplicationChecksByTransitivity, 9.8s TimeCoverageRelationStatistics Valid=1402, Invalid=6077, Unknown=3, NotChecked=0, Total=7482 [2018-04-11 12:27:42,101 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1073 states. [2018-04-11 12:27:42,105 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1073 to 521. [2018-04-11 12:27:42,105 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 521 states. [2018-04-11 12:27:42,105 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 521 states to 521 states and 585 transitions. [2018-04-11 12:27:42,106 INFO L78 Accepts]: Start accepts. Automaton has 521 states and 585 transitions. Word has length 72 [2018-04-11 12:27:42,106 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-11 12:27:42,106 INFO L459 AbstractCegarLoop]: Abstraction has 521 states and 585 transitions. [2018-04-11 12:27:42,106 INFO L460 AbstractCegarLoop]: Interpolant automaton has 41 states. [2018-04-11 12:27:42,106 INFO L276 IsEmpty]: Start isEmpty. Operand 521 states and 585 transitions. [2018-04-11 12:27:42,106 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 75 [2018-04-11 12:27:42,106 INFO L347 BasicCegarLoop]: Found error trace [2018-04-11 12:27:42,106 INFO L355 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-11 12:27:42,106 INFO L408 AbstractCegarLoop]: === Iteration 38 === [mainErr51RequiresViolation, mainErr26RequiresViolation, mainErr54RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr31RequiresViolation, mainErr46RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr58RequiresViolation, mainErr15RequiresViolation, mainErr49RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr55RequiresViolation, mainErr17RequiresViolation, mainErr42RequiresViolation, mainErr62EnsuresViolationMEMORY_LEAK, mainErr30RequiresViolation, mainErr56AssertViolationMEMORY_FREE, mainErr11RequiresViolation, mainErr61AssertViolationMEMORY_FREE, mainErr24RequiresViolation, mainErr44RequiresViolation, mainErr10RequiresViolation, mainErr43RequiresViolation, mainErr4RequiresViolation, mainErr50RequiresViolation, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr59RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr48RequiresViolation, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr52RequiresViolation, mainErr45RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr57AssertViolationMEMORY_FREE, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr60AssertViolationMEMORY_FREE, mainErr9RequiresViolation, mainErr53RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr34RequiresViolation, mainErr47RequiresViolation, mainErr14RequiresViolation, mainErr40RequiresViolation]=== [2018-04-11 12:27:42,107 INFO L82 PathProgramCache]: Analyzing trace with hash -556281749, now seen corresponding path program 1 times [2018-04-11 12:27:42,107 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-04-11 12:27:42,107 INFO L68 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-04-11 12:27:42,107 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 12:27:42,107 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-11 12:27:42,107 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 12:27:42,115 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-11 12:27:42,116 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-11 12:27:42,492 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-11 12:27:42,492 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-04-11 12:27:42,492 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-11 12:27:42,500 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-11 12:27:42,519 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-11 12:27:42,521 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-11 12:27:42,527 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 12:27:42,530 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 12:27:42,531 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 21 [2018-04-11 12:27:42,531 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-11 12:27:42,537 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 12:27:42,538 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:23, output treesize:21 [2018-04-11 12:27:42,558 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 8 [2018-04-11 12:27:42,559 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-11 12:27:42,559 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 12:27:42,560 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 12:27:42,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-11 12:27:42,566 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:32, output treesize:29 [2018-04-11 12:27:42,637 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 12:27:42,639 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 36 treesize of output 37 [2018-04-11 12:27:42,641 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-11 12:27:42,641 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 12:27:42,645 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 12:27:42,650 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-04-11 12:27:42,650 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:41, output treesize:37 [2018-04-11 12:27:42,671 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 12:27:42,672 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 12:27:42,672 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 12:27:42,673 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 21 [2018-04-11 12:27:42,673 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-11 12:27:42,677 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 12:27:42,677 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:42, output treesize:35 [2018-04-11 12:27:42,698 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 12:27:42,700 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 44 treesize of output 43 [2018-04-11 12:27:42,702 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 12:27:42,703 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 3 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-11 12:27:42,703 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 12:27:42,709 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 12:27:42,716 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-11 12:27:42,716 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:53, output treesize:52 [2018-04-11 12:27:42,763 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 12:27:42,768 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 70 treesize of output 78 [2018-04-11 12:27:42,769 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-11 12:27:42,769 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 12:27:42,776 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 12:27:42,783 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-04-11 12:27:42,784 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:75, output treesize:61 [2018-04-11 12:27:42,859 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 111 treesize of output 80 [2018-04-11 12:27:42,861 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 26 treesize of output 37 [2018-04-11 12:27:42,861 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 12:27:42,868 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 12:27:42,875 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-2 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2018-04-11 12:27:42,875 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:111, output treesize:97 [2018-04-11 12:27:46,957 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 104 treesize of output 61 [2018-04-11 12:27:46,959 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 29 treesize of output 18 [2018-04-11 12:27:46,959 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 12:27:46,967 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 1 [2018-04-11 12:27:46,967 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-04-11 12:27:46,973 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 12:27:46,974 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 15 [2018-04-11 12:27:46,974 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-04-11 12:27:46,977 INFO L267 ElimStorePlain]: Start of recursive call 2: 3 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 12:27:46,978 INFO L267 ElimStorePlain]: Start of recursive call 1: 5 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-04-11 12:27:46,979 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 6 variables, input treesize:104, output treesize:5 [2018-04-11 12:27:46,995 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-11 12:27:47,013 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-04-11 12:27:47,013 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [20, 17] total 32 [2018-04-11 12:27:47,013 INFO L442 AbstractCegarLoop]: Interpolant automaton has 33 states [2018-04-11 12:27:47,013 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 33 interpolants. [2018-04-11 12:27:47,014 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=151, Invalid=903, Unknown=2, NotChecked=0, Total=1056 [2018-04-11 12:27:47,014 INFO L87 Difference]: Start difference. First operand 521 states and 585 transitions. Second operand 33 states. [2018-04-11 12:28:06,130 WARN L151 SmtUtils]: Spent 4134ms on a formula simplification. DAG size of input: 89 DAG size of output 67 [2018-04-11 12:28:16,262 WARN L151 SmtUtils]: Spent 4096ms on a formula simplification. DAG size of input: 77 DAG size of output 63 [2018-04-11 12:28:29,496 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-11 12:28:29,496 INFO L93 Difference]: Finished difference Result 727 states and 792 transitions. [2018-04-11 12:28:29,496 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 32 states. [2018-04-11 12:28:29,496 INFO L78 Accepts]: Start accepts. Automaton has 33 states. Word has length 74 [2018-04-11 12:28:29,496 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-11 12:28:29,498 INFO L225 Difference]: With dead ends: 727 [2018-04-11 12:28:29,498 INFO L226 Difference]: Without dead ends: 727 [2018-04-11 12:28:29,498 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 122 GetRequests, 63 SyntacticMatches, 3 SemanticMatches, 56 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 805 ImplicationChecksByTransitivity, 39.6s TimeCoverageRelationStatistics Valid=669, Invalid=2622, Unknown=15, NotChecked=0, Total=3306 [2018-04-11 12:28:29,499 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 727 states. [2018-04-11 12:28:29,501 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 727 to 582. [2018-04-11 12:28:29,501 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 582 states. [2018-04-11 12:28:29,502 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 582 states to 582 states and 656 transitions. [2018-04-11 12:28:29,502 INFO L78 Accepts]: Start accepts. Automaton has 582 states and 656 transitions. Word has length 74 [2018-04-11 12:28:29,502 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-11 12:28:29,502 INFO L459 AbstractCegarLoop]: Abstraction has 582 states and 656 transitions. [2018-04-11 12:28:29,502 INFO L460 AbstractCegarLoop]: Interpolant automaton has 33 states. [2018-04-11 12:28:29,503 INFO L276 IsEmpty]: Start isEmpty. Operand 582 states and 656 transitions. [2018-04-11 12:28:29,503 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 75 [2018-04-11 12:28:29,503 INFO L347 BasicCegarLoop]: Found error trace [2018-04-11 12:28:29,503 INFO L355 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-11 12:28:29,504 INFO L408 AbstractCegarLoop]: === Iteration 39 === [mainErr51RequiresViolation, mainErr26RequiresViolation, mainErr54RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr31RequiresViolation, mainErr46RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr58RequiresViolation, mainErr15RequiresViolation, mainErr49RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr55RequiresViolation, mainErr17RequiresViolation, mainErr42RequiresViolation, mainErr62EnsuresViolationMEMORY_LEAK, mainErr30RequiresViolation, mainErr56AssertViolationMEMORY_FREE, mainErr11RequiresViolation, mainErr61AssertViolationMEMORY_FREE, mainErr24RequiresViolation, mainErr44RequiresViolation, mainErr10RequiresViolation, mainErr43RequiresViolation, mainErr4RequiresViolation, mainErr50RequiresViolation, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr59RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr48RequiresViolation, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr52RequiresViolation, mainErr45RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr57AssertViolationMEMORY_FREE, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr60AssertViolationMEMORY_FREE, mainErr9RequiresViolation, mainErr53RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr34RequiresViolation, mainErr47RequiresViolation, mainErr14RequiresViolation, mainErr40RequiresViolation]=== [2018-04-11 12:28:29,504 INFO L82 PathProgramCache]: Analyzing trace with hash -556281748, now seen corresponding path program 1 times [2018-04-11 12:28:29,504 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-04-11 12:28:29,504 INFO L68 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-04-11 12:28:29,505 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 12:28:29,505 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-11 12:28:29,505 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 12:28:29,517 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-11 12:28:29,517 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-11 12:28:29,989 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-11 12:28:29,989 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-04-11 12:28:29,989 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-11 12:28:29,995 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-11 12:28:30,026 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-11 12:28:30,029 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-11 12:28:30,072 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 12:28:30,073 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 12:28:30,073 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 21 [2018-04-11 12:28:30,074 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-11 12:28:30,082 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 12:28:30,083 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:26, output treesize:24 [2018-04-11 12:28:30,113 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-11 12:28:30,115 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-11 12:28:30,115 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 12:28:30,117 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 12:28:30,129 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-11 12:28:30,131 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-11 12:28:30,131 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-04-11 12:28:30,133 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 12:28:30,143 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-11 12:28:30,143 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 3 variables, input treesize:43, output treesize:36 [2018-04-11 12:28:30,240 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 12:28:30,245 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 24 [2018-04-11 12:28:30,247 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 11 [2018-04-11 12:28:30,247 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 12:28:30,253 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 12:28:30,269 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 12:28:30,273 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 47 treesize of output 48 [2018-04-11 12:28:30,276 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-11 12:28:30,277 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-04-11 12:28:30,286 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 12:28:30,298 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-04-11 12:28:30,299 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 2 variables, input treesize:62, output treesize:58 [2018-04-11 12:28:30,340 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 12:28:30,340 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 12:28:30,341 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 12:28:30,341 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 21 [2018-04-11 12:28:30,341 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-11 12:28:30,350 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 12:28:30,350 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:63, output treesize:56 [2018-04-11 12:28:30,380 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 12:28:30,383 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 55 treesize of output 54 [2018-04-11 12:28:30,385 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 12:28:30,386 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 3 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-11 12:28:30,386 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 12:28:30,395 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 12:28:30,412 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 32 treesize of output 38 [2018-04-11 12:28:30,414 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 12:28:30,415 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 20 treesize of output 31 [2018-04-11 12:28:30,415 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-04-11 12:28:30,429 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 12:28:30,439 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-11 12:28:30,440 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 4 variables, input treesize:89, output treesize:75 [2018-04-11 12:28:30,505 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 42 treesize of output 65 [2018-04-11 12:28:30,508 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-11 12:28:30,508 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 12:28:30,513 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 12:28:30,527 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 12:28:30,531 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 94 treesize of output 102 [2018-04-11 12:28:30,533 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-11 12:28:30,533 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-04-11 12:28:30,543 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 12:28:30,555 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-11 12:28:30,555 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 3 variables, input treesize:121, output treesize:97 [2018-04-11 12:28:30,651 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 174 treesize of output 131 [2018-04-11 12:28:30,654 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 26 treesize of output 37 [2018-04-11 12:28:30,654 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 12:28:30,671 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 12:28:30,706 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 69 treesize of output 84 [2018-04-11 12:28:30,709 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 26 treesize of output 37 [2018-04-11 12:28:30,709 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-04-11 12:28:30,716 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 12:28:30,732 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 2 dim-2 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2018-04-11 12:28:30,732 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 5 variables, input treesize:184, output treesize:156 [2018-04-11 12:28:34,848 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 96 [2018-04-11 12:28:34,849 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 40 treesize of output 27 [2018-04-11 12:28:34,849 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 12:28:34,861 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 12:28:34,862 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 46 treesize of output 31 [2018-04-11 12:28:34,862 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-11 12:28:34,875 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 1 [2018-04-11 12:28:34,875 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-04-11 12:28:34,893 INFO L267 ElimStorePlain]: Start of recursive call 2: 3 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-04-11 12:28:34,904 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 38 treesize of output 40 [2018-04-11 12:28:34,906 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-11 12:28:34,906 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2018-04-11 12:28:34,913 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 1 [2018-04-11 12:28:34,913 INFO L267 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 1 xjuncts. [2018-04-11 12:28:34,916 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-11 12:28:34,916 INFO L267 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 1 xjuncts. [2018-04-11 12:28:34,917 INFO L267 ElimStorePlain]: Start of recursive call 6: 3 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 12:28:34,922 INFO L267 ElimStorePlain]: Start of recursive call 1: 5 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-04-11 12:28:34,922 INFO L202 ElimStorePlain]: Needed 9 recursive calls to eliminate 7 variables, input treesize:170, output treesize:9 [2018-04-11 12:28:34,988 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-11 12:28:35,005 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-04-11 12:28:35,005 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [20, 17] total 36 [2018-04-11 12:28:35,006 INFO L442 AbstractCegarLoop]: Interpolant automaton has 37 states [2018-04-11 12:28:35,006 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 37 interpolants. [2018-04-11 12:28:35,006 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=121, Invalid=1209, Unknown=2, NotChecked=0, Total=1332 [2018-04-11 12:28:35,006 INFO L87 Difference]: Start difference. First operand 582 states and 656 transitions. Second operand 37 states. [2018-04-11 12:28:40,013 WARN L151 SmtUtils]: Spent 140ms on a formula simplification. DAG size of input: 87 DAG size of output 64 [2018-04-11 12:28:54,330 WARN L151 SmtUtils]: Spent 4058ms on a formula simplification. DAG size of input: 109 DAG size of output 76 [2018-04-11 12:29:20,304 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-11 12:29:20,304 INFO L93 Difference]: Finished difference Result 766 states and 825 transitions. [2018-04-11 12:29:20,304 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 36 states. [2018-04-11 12:29:20,304 INFO L78 Accepts]: Start accepts. Automaton has 37 states. Word has length 74 [2018-04-11 12:29:20,305 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-11 12:29:20,306 INFO L225 Difference]: With dead ends: 766 [2018-04-11 12:29:20,306 INFO L226 Difference]: Without dead ends: 766 [2018-04-11 12:29:20,307 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 130 GetRequests, 60 SyntacticMatches, 2 SemanticMatches, 68 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 989 ImplicationChecksByTransitivity, 42.5s TimeCoverageRelationStatistics Valid=810, Invalid=4002, Unknown=18, NotChecked=0, Total=4830 [2018-04-11 12:29:20,307 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 766 states. [2018-04-11 12:29:20,309 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 766 to 605. [2018-04-11 12:29:20,310 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 605 states. [2018-04-11 12:29:20,310 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 605 states to 605 states and 684 transitions. [2018-04-11 12:29:20,310 INFO L78 Accepts]: Start accepts. Automaton has 605 states and 684 transitions. Word has length 74 [2018-04-11 12:29:20,310 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-11 12:29:20,310 INFO L459 AbstractCegarLoop]: Abstraction has 605 states and 684 transitions. [2018-04-11 12:29:20,310 INFO L460 AbstractCegarLoop]: Interpolant automaton has 37 states. [2018-04-11 12:29:20,311 INFO L276 IsEmpty]: Start isEmpty. Operand 605 states and 684 transitions. [2018-04-11 12:29:20,311 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 78 [2018-04-11 12:29:20,311 INFO L347 BasicCegarLoop]: Found error trace [2018-04-11 12:29:20,311 INFO L355 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-11 12:29:20,311 INFO L408 AbstractCegarLoop]: === Iteration 40 === [mainErr51RequiresViolation, mainErr26RequiresViolation, mainErr54RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr31RequiresViolation, mainErr46RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr58RequiresViolation, mainErr15RequiresViolation, mainErr49RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr55RequiresViolation, mainErr17RequiresViolation, mainErr42RequiresViolation, mainErr62EnsuresViolationMEMORY_LEAK, mainErr30RequiresViolation, mainErr56AssertViolationMEMORY_FREE, mainErr11RequiresViolation, mainErr61AssertViolationMEMORY_FREE, mainErr24RequiresViolation, mainErr44RequiresViolation, mainErr10RequiresViolation, mainErr43RequiresViolation, mainErr4RequiresViolation, mainErr50RequiresViolation, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr59RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr48RequiresViolation, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr52RequiresViolation, mainErr45RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr57AssertViolationMEMORY_FREE, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr60AssertViolationMEMORY_FREE, mainErr9RequiresViolation, mainErr53RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr34RequiresViolation, mainErr47RequiresViolation, mainErr14RequiresViolation, mainErr40RequiresViolation]=== [2018-04-11 12:29:20,311 INFO L82 PathProgramCache]: Analyzing trace with hash -286750696, now seen corresponding path program 1 times [2018-04-11 12:29:20,311 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-04-11 12:29:20,311 INFO L68 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-04-11 12:29:20,312 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 12:29:20,312 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-11 12:29:20,312 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 12:29:20,324 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-11 12:29:20,325 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-11 12:29:21,111 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-11 12:29:21,111 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-04-11 12:29:21,112 INFO L213 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 12 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 12 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-04-11 12:29:21,117 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-11 12:29:21,139 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-11 12:29:21,141 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-11 12:29:21,176 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 12:29:21,176 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 12:29:21,177 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 21 [2018-04-11 12:29:21,177 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-11 12:29:21,182 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 12:29:21,182 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:20, output treesize:18 [2018-04-11 12:29:21,209 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 10 [2018-04-11 12:29:21,211 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 9 [2018-04-11 12:29:21,211 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 12:29:21,212 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 12:29:21,217 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-11 12:29:21,217 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:31, output treesize:30 [2018-04-11 12:29:21,276 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 45 treesize of output 39 [2018-04-11 12:29:21,278 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-11 12:29:21,303 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 12:29:21,313 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 12:29:21,327 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-04-11 12:29:21,328 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:53, output treesize:43 [2018-04-11 12:29:21,445 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 60 treesize of output 46 [2018-04-11 12:29:21,448 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 29 [2018-04-11 12:29:21,448 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 12:29:21,455 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 12:29:21,465 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-11 12:29:21,466 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:68, output treesize:58 [2018-04-11 12:29:27,514 WARN L151 SmtUtils]: Spent 2011ms on a formula simplification. DAG size of input: 28 DAG size of output 24 [2018-04-11 12:29:27,553 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 12:29:27,553 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 12:29:27,554 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 12:29:27,554 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 52 [2018-04-11 12:29:27,554 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-11 12:29:27,570 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-04-11 12:29:27,570 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:62, output treesize:70 [2018-04-11 12:29:27,614 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 58 treesize of output 61 [2018-04-11 12:29:27,616 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 12:29:27,616 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 5 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 55 treesize of output 70 [2018-04-11 12:29:27,616 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 12:29:27,622 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 12:29:27,631 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-04-11 12:29:27,632 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:81, output treesize:82 [2018-04-11 12:29:27,755 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 12:29:27,759 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 86 treesize of output 100 [2018-04-11 12:29:27,760 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-11 12:29:27,761 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 12:29:27,769 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 12:29:27,778 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-04-11 12:29:27,778 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:94, output treesize:86 [2018-04-11 12:29:27,833 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 12:29:27,834 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 12:29:27,834 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 12:29:27,835 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 12:29:27,835 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 7 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 37 treesize of output 91 [2018-04-11 12:29:27,836 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-11 12:29:27,853 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-04-11 12:29:27,853 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:97, output treesize:113 [2018-04-11 12:29:27,915 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 12:29:27,920 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 5 disjoint index pairs (out of 3 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 109 treesize of output 111 [2018-04-11 12:29:27,922 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 12:29:27,924 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 4 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 23 [2018-04-11 12:29:27,924 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 12:29:27,936 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 12:29:27,951 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-04-11 12:29:27,951 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:126, output treesize:137 [2018-04-11 12:29:28,084 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 12:29:28,095 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 6 disjoint index pairs (out of 6 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 152 treesize of output 163 [2018-04-11 12:29:28,097 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-11 12:29:28,097 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 12:29:28,112 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 12:29:28,127 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-11 12:29:28,127 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:160, output treesize:150 [2018-04-11 12:29:28,291 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 6 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 196 treesize of output 160 [2018-04-11 12:29:28,294 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 26 treesize of output 37 [2018-04-11 12:29:28,295 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 12:29:28,314 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 12:29:28,330 INFO L267 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-2 vars, End of recursive call: 4 dim-0 vars, and 1 xjuncts. [2018-04-11 12:29:28,330 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 5 variables, input treesize:204, output treesize:190 [2018-04-11 12:29:32,651 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 6 disjoint index pairs (out of 6 index pairs), introduced 6 new quantified variables, introduced 0 case distinctions, treesize of input 179 treesize of output 113 [2018-04-11 12:29:32,653 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 1 [2018-04-11 12:29:32,654 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 12:29:32,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-11 12:29:32,665 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-04-11 12:29:32,675 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 12:29:32,676 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 4 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 43 treesize of output 28 [2018-04-11 12:29:32,677 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-04-11 12:29:32,686 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 6 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 52 treesize of output 31 [2018-04-11 12:29:32,687 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-11 12:29:32,694 INFO L267 ElimStorePlain]: Start of recursive call 2: 4 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2018-04-11 12:29:32,702 INFO L267 ElimStorePlain]: Start of recursive call 1: 5 dim-0 vars, 1 dim-2 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2018-04-11 12:29:32,702 INFO L202 ElimStorePlain]: Needed 6 recursive calls to eliminate 6 variables, input treesize:184, output treesize:45 [2018-04-11 12:29:32,825 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-11 12:29:32,842 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-04-11 12:29:32,842 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [31, 25] total 54 [2018-04-11 12:29:32,842 INFO L442 AbstractCegarLoop]: Interpolant automaton has 55 states [2018-04-11 12:29:32,842 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 55 interpolants. [2018-04-11 12:29:32,843 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=451, Invalid=2512, Unknown=7, NotChecked=0, Total=2970 [2018-04-11 12:29:32,843 INFO L87 Difference]: Start difference. First operand 605 states and 684 transitions. Second operand 55 states. [2018-04-11 12:29:49,481 WARN L151 SmtUtils]: Spent 2035ms on a formula simplification. DAG size of input: 52 DAG size of output 40 Received shutdown request... [2018-04-11 12:29:59,452 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 32 states. [2018-04-11 12:29:59,452 WARN L519 AbstractCegarLoop]: Verification canceled [2018-04-11 12:29:59,455 WARN L197 ceAbstractionStarter]: Timeout [2018-04-11 12:29:59,455 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 11.04 12:29:59 BoogieIcfgContainer [2018-04-11 12:29:59,455 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-04-11 12:29:59,456 INFO L168 Benchmark]: Toolchain (without parser) took 202505.27 ms. Allocated memory was 403.7 MB in the beginning and 912.3 MB in the end (delta: 508.6 MB). Free memory was 336.1 MB in the beginning and 451.7 MB in the end (delta: -115.6 MB). Peak memory consumption was 392.9 MB. Max. memory is 5.3 GB. [2018-04-11 12:29:59,456 INFO L168 Benchmark]: CDTParser took 0.09 ms. Allocated memory is still 403.7 MB. Free memory is still 364.2 MB. There was no memory consumed. Max. memory is 5.3 GB. [2018-04-11 12:29:59,456 INFO L168 Benchmark]: CACSL2BoogieTranslator took 277.75 ms. Allocated memory is still 403.7 MB. Free memory was 336.1 MB in the beginning and 309.6 MB in the end (delta: 26.4 MB). Peak memory consumption was 26.4 MB. Max. memory is 5.3 GB. [2018-04-11 12:29:59,457 INFO L168 Benchmark]: Boogie Preprocessor took 47.70 ms. Allocated memory is still 403.7 MB. Free memory was 309.6 MB in the beginning and 305.7 MB in the end (delta: 4.0 MB). Peak memory consumption was 4.0 MB. Max. memory is 5.3 GB. [2018-04-11 12:29:59,457 INFO L168 Benchmark]: RCFGBuilder took 587.90 ms. Allocated memory was 403.7 MB in the beginning and 594.5 MB in the end (delta: 190.8 MB). Free memory was 305.7 MB in the beginning and 504.1 MB in the end (delta: -198.5 MB). Peak memory consumption was 24.1 MB. Max. memory is 5.3 GB. [2018-04-11 12:29:59,457 INFO L168 Benchmark]: TraceAbstraction took 201589.36 ms. Allocated memory was 594.5 MB in the beginning and 912.3 MB in the end (delta: 317.7 MB). Free memory was 504.1 MB in the beginning and 451.7 MB in the end (delta: 52.4 MB). Peak memory consumption was 370.1 MB. Max. memory is 5.3 GB. [2018-04-11 12:29:59,458 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.09 ms. Allocated memory is still 403.7 MB. Free memory is still 364.2 MB. There was no memory consumed. Max. memory is 5.3 GB. * CACSL2BoogieTranslator took 277.75 ms. Allocated memory is still 403.7 MB. Free memory was 336.1 MB in the beginning and 309.6 MB in the end (delta: 26.4 MB). Peak memory consumption was 26.4 MB. Max. memory is 5.3 GB. * Boogie Preprocessor took 47.70 ms. Allocated memory is still 403.7 MB. Free memory was 309.6 MB in the beginning and 305.7 MB in the end (delta: 4.0 MB). Peak memory consumption was 4.0 MB. Max. memory is 5.3 GB. * RCFGBuilder took 587.90 ms. Allocated memory was 403.7 MB in the beginning and 594.5 MB in the end (delta: 190.8 MB). Free memory was 305.7 MB in the beginning and 504.1 MB in the end (delta: -198.5 MB). Peak memory consumption was 24.1 MB. Max. memory is 5.3 GB. * TraceAbstraction took 201589.36 ms. Allocated memory was 594.5 MB in the beginning and 912.3 MB in the end (delta: 317.7 MB). Free memory was 504.1 MB in the beginning and 451.7 MB in the end (delta: 52.4 MB). Peak memory consumption was 370.1 MB. Max. memory is 5.3 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - TimeoutResultAtElement [Line: 1037]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 1037). Cancelled while BasicCegarLoop was constructing difference of abstraction (605states) and interpolant automaton (currently 32 states, 55 states before enhancement), while PredicateComparison was comparing new predicate (quantified with 0quantifier alternations) to 84 known predicates. - TimeoutResultAtElement [Line: 1005]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 1005). Cancelled while BasicCegarLoop was constructing difference of abstraction (605states) and interpolant automaton (currently 32 states, 55 states before enhancement), while PredicateComparison was comparing new predicate (quantified with 0quantifier alternations) to 84 known predicates. - TimeoutResultAtElement [Line: 1043]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 1043). Cancelled while BasicCegarLoop was constructing difference of abstraction (605states) and interpolant automaton (currently 32 states, 55 states before enhancement), while PredicateComparison was comparing new predicate (quantified with 0quantifier alternations) to 84 known predicates. - TimeoutResultAtElement [Line: 1001]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 1001). Cancelled while BasicCegarLoop was constructing difference of abstraction (605states) and interpolant automaton (currently 32 states, 55 states before enhancement), while PredicateComparison was comparing new predicate (quantified with 0quantifier alternations) to 84 known predicates. - TimeoutResultAtElement [Line: 1003]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 1003). Cancelled while BasicCegarLoop was constructing difference of abstraction (605states) and interpolant automaton (currently 32 states, 55 states before enhancement), while PredicateComparison was comparing new predicate (quantified with 0quantifier alternations) to 84 known predicates. - TimeoutResultAtElement [Line: 1005]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 1005). Cancelled while BasicCegarLoop was constructing difference of abstraction (605states) and interpolant automaton (currently 32 states, 55 states before enhancement), while PredicateComparison was comparing new predicate (quantified with 0quantifier alternations) to 84 known predicates. - TimeoutResultAtElement [Line: 992]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 992). Cancelled while BasicCegarLoop was constructing difference of abstraction (605states) and interpolant automaton (currently 32 states, 55 states before enhancement), while PredicateComparison was comparing new predicate (quantified with 0quantifier alternations) to 84 known predicates. - TimeoutResultAtElement [Line: 1005]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 1005). Cancelled while BasicCegarLoop was constructing difference of abstraction (605states) and interpolant automaton (currently 32 states, 55 states before enhancement), while PredicateComparison was comparing new predicate (quantified with 0quantifier alternations) to 84 known predicates. - TimeoutResultAtElement [Line: 1027]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 1027). Cancelled while BasicCegarLoop was constructing difference of abstraction (605states) and interpolant automaton (currently 32 states, 55 states before enhancement), while PredicateComparison was comparing new predicate (quantified with 0quantifier alternations) to 84 known predicates. - TimeoutResultAtElement [Line: 1005]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 1005). Cancelled while BasicCegarLoop was constructing difference of abstraction (605states) and interpolant automaton (currently 32 states, 55 states before enhancement), while PredicateComparison was comparing new predicate (quantified with 0quantifier alternations) to 84 known predicates. - TimeoutResultAtElement [Line: 993]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 993). Cancelled while BasicCegarLoop was constructing difference of abstraction (605states) and interpolant automaton (currently 32 states, 55 states before enhancement), while PredicateComparison was comparing new predicate (quantified with 0quantifier alternations) to 84 known predicates. - TimeoutResultAtElement [Line: 1047]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 1047). Cancelled while BasicCegarLoop was constructing difference of abstraction (605states) and interpolant automaton (currently 32 states, 55 states before enhancement), while PredicateComparison was comparing new predicate (quantified with 0quantifier alternations) to 84 known predicates. - TimeoutResultAtElement [Line: 993]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 993). Cancelled while BasicCegarLoop was constructing difference of abstraction (605states) and interpolant automaton (currently 32 states, 55 states before enhancement), while PredicateComparison was comparing new predicate (quantified with 0quantifier alternations) to 84 known predicates. - TimeoutResultAtElement [Line: 1031]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 1031). Cancelled while BasicCegarLoop was constructing difference of abstraction (605states) and interpolant automaton (currently 32 states, 55 states before enhancement), while PredicateComparison was comparing new predicate (quantified with 0quantifier alternations) to 84 known predicates. - TimeoutResultAtElement [Line: 993]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 993). Cancelled while BasicCegarLoop was constructing difference of abstraction (605states) and interpolant automaton (currently 32 states, 55 states before enhancement), while PredicateComparison was comparing new predicate (quantified with 0quantifier alternations) to 84 known predicates. - TimeoutResultAtElement [Line: 993]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 993). Cancelled while BasicCegarLoop was constructing difference of abstraction (605states) and interpolant automaton (currently 32 states, 55 states before enhancement), while PredicateComparison was comparing new predicate (quantified with 0quantifier alternations) to 84 known predicates. - TimeoutResultAtElement [Line: 1005]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 1005). Cancelled while BasicCegarLoop was constructing difference of abstraction (605states) and interpolant automaton (currently 32 states, 55 states before enhancement), while PredicateComparison was comparing new predicate (quantified with 0quantifier alternations) to 84 known predicates. - TimeoutResultAtElement [Line: 1043]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 1043). Cancelled while BasicCegarLoop was constructing difference of abstraction (605states) and interpolant automaton (currently 32 states, 55 states before enhancement), while PredicateComparison was comparing new predicate (quantified with 0quantifier alternations) to 84 known predicates. - TimeoutResultAtElement [Line: 993]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 993). Cancelled while BasicCegarLoop was constructing difference of abstraction (605states) and interpolant automaton (currently 32 states, 55 states before enhancement), while PredicateComparison was comparing new predicate (quantified with 0quantifier alternations) to 84 known predicates. - TimeoutResultAtElement [Line: 1025]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 1025). Cancelled while BasicCegarLoop was constructing difference of abstraction (605states) and interpolant automaton (currently 32 states, 55 states before enhancement), while PredicateComparison was comparing new predicate (quantified with 0quantifier alternations) to 84 known predicates. - TimeoutResultAtElement [Line: 988]: Timeout (TraceAbstraction) Unable to prove that all allocated memory was freed (line 988). Cancelled while BasicCegarLoop was constructing difference of abstraction (605states) and interpolant automaton (currently 32 states, 55 states before enhancement), while PredicateComparison was comparing new predicate (quantified with 0quantifier alternations) to 84 known predicates. - TimeoutResultAtElement [Line: 1005]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 1005). Cancelled while BasicCegarLoop was constructing difference of abstraction (605states) and interpolant automaton (currently 32 states, 55 states before enhancement), while PredicateComparison was comparing new predicate (quantified with 0quantifier alternations) to 84 known predicates. - TimeoutResultAtElement [Line: 1044]: Timeout (TraceAbstraction) Unable to prove that free always succeeds (line 1044). Cancelled while BasicCegarLoop was constructing difference of abstraction (605states) and interpolant automaton (currently 32 states, 55 states before enhancement), while PredicateComparison was comparing new predicate (quantified with 0quantifier alternations) to 84 known predicates. - TimeoutResultAtElement [Line: 993]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 993). Cancelled while BasicCegarLoop was constructing difference of abstraction (605states) and interpolant automaton (currently 32 states, 55 states before enhancement), while PredicateComparison was comparing new predicate (quantified with 0quantifier alternations) to 84 known predicates. - TimeoutResultAtElement [Line: 1048]: Timeout (TraceAbstraction) Unable to prove that free always succeeds (line 1048). Cancelled while BasicCegarLoop was constructing difference of abstraction (605states) and interpolant automaton (currently 32 states, 55 states before enhancement), while PredicateComparison was comparing new predicate (quantified with 0quantifier alternations) to 84 known predicates. - TimeoutResultAtElement [Line: 1005]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 1005). Cancelled while BasicCegarLoop was constructing difference of abstraction (605states) and interpolant automaton (currently 32 states, 55 states before enhancement), while PredicateComparison was comparing new predicate (quantified with 0quantifier alternations) to 84 known predicates. - TimeoutResultAtElement [Line: 1026]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 1026). Cancelled while BasicCegarLoop was constructing difference of abstraction (605states) and interpolant automaton (currently 32 states, 55 states before enhancement), while PredicateComparison was comparing new predicate (quantified with 0quantifier alternations) to 84 known predicates. - TimeoutResultAtElement [Line: 993]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 993). Cancelled while BasicCegarLoop was constructing difference of abstraction (605states) and interpolant automaton (currently 32 states, 55 states before enhancement), while PredicateComparison was comparing new predicate (quantified with 0quantifier alternations) to 84 known predicates. - TimeoutResultAtElement [Line: 1025]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 1025). Cancelled while BasicCegarLoop was constructing difference of abstraction (605states) and interpolant automaton (currently 32 states, 55 states before enhancement), while PredicateComparison was comparing new predicate (quantified with 0quantifier alternations) to 84 known predicates. - TimeoutResultAtElement [Line: 993]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 993). Cancelled while BasicCegarLoop was constructing difference of abstraction (605states) and interpolant automaton (currently 32 states, 55 states before enhancement), while PredicateComparison was comparing new predicate (quantified with 0quantifier alternations) to 84 known predicates. - TimeoutResultAtElement [Line: 1037]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 1037). Cancelled while BasicCegarLoop was constructing difference of abstraction (605states) and interpolant automaton (currently 32 states, 55 states before enhancement), while PredicateComparison was comparing new predicate (quantified with 0quantifier alternations) to 84 known predicates. - TimeoutResultAtElement [Line: 1005]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 1005). Cancelled while BasicCegarLoop was constructing difference of abstraction (605states) and interpolant automaton (currently 32 states, 55 states before enhancement), while PredicateComparison was comparing new predicate (quantified with 0quantifier alternations) to 84 known predicates. - TimeoutResultAtElement [Line: 993]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 993). Cancelled while BasicCegarLoop was constructing difference of abstraction (605states) and interpolant automaton (currently 32 states, 55 states before enhancement), while PredicateComparison was comparing new predicate (quantified with 0quantifier alternations) to 84 known predicates. - TimeoutResultAtElement [Line: 993]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 993). Cancelled while BasicCegarLoop was constructing difference of abstraction (605states) and interpolant automaton (currently 32 states, 55 states before enhancement), while PredicateComparison was comparing new predicate (quantified with 0quantifier alternations) to 84 known predicates. - TimeoutResultAtElement [Line: 1005]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 1005). Cancelled while BasicCegarLoop was constructing difference of abstraction (605states) and interpolant automaton (currently 32 states, 55 states before enhancement), while PredicateComparison was comparing new predicate (quantified with 0quantifier alternations) to 84 known predicates. - TimeoutResultAtElement [Line: 1047]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 1047). Cancelled while BasicCegarLoop was constructing difference of abstraction (605states) and interpolant automaton (currently 32 states, 55 states before enhancement), while PredicateComparison was comparing new predicate (quantified with 0quantifier alternations) to 84 known predicates. - TimeoutResultAtElement [Line: 1005]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 1005). Cancelled while BasicCegarLoop was constructing difference of abstraction (605states) and interpolant automaton (currently 32 states, 55 states before enhancement), while PredicateComparison was comparing new predicate (quantified with 0quantifier alternations) to 84 known predicates. - TimeoutResultAtElement [Line: 1005]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 1005). Cancelled while BasicCegarLoop was constructing difference of abstraction (605states) and interpolant automaton (currently 32 states, 55 states before enhancement), while PredicateComparison was comparing new predicate (quantified with 0quantifier alternations) to 84 known predicates. - TimeoutResultAtElement [Line: 1002]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 1002). Cancelled while BasicCegarLoop was constructing difference of abstraction (605states) and interpolant automaton (currently 32 states, 55 states before enhancement), while PredicateComparison was comparing new predicate (quantified with 0quantifier alternations) to 84 known predicates. - TimeoutResultAtElement [Line: 1017]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 1017). Cancelled while BasicCegarLoop was constructing difference of abstraction (605states) and interpolant automaton (currently 32 states, 55 states before enhancement), while PredicateComparison was comparing new predicate (quantified with 0quantifier alternations) to 84 known predicates. - TimeoutResultAtElement [Line: 1031]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 1031). Cancelled while BasicCegarLoop was constructing difference of abstraction (605states) and interpolant automaton (currently 32 states, 55 states before enhancement), while PredicateComparison was comparing new predicate (quantified with 0quantifier alternations) to 84 known predicates. - TimeoutResultAtElement [Line: 1005]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 1005). Cancelled while BasicCegarLoop was constructing difference of abstraction (605states) and interpolant automaton (currently 32 states, 55 states before enhancement), while PredicateComparison was comparing new predicate (quantified with 0quantifier alternations) to 84 known predicates. - TimeoutResultAtElement [Line: 993]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 993). Cancelled while BasicCegarLoop was constructing difference of abstraction (605states) and interpolant automaton (currently 32 states, 55 states before enhancement), while PredicateComparison was comparing new predicate (quantified with 0quantifier alternations) to 84 known predicates. - TimeoutResultAtElement [Line: 1005]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 1005). Cancelled while BasicCegarLoop was constructing difference of abstraction (605states) and interpolant automaton (currently 32 states, 55 states before enhancement), while PredicateComparison was comparing new predicate (quantified with 0quantifier alternations) to 84 known predicates. - TimeoutResultAtElement [Line: 993]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 993). Cancelled while BasicCegarLoop was constructing difference of abstraction (605states) and interpolant automaton (currently 32 states, 55 states before enhancement), while PredicateComparison was comparing new predicate (quantified with 0quantifier alternations) to 84 known predicates. - TimeoutResultAtElement [Line: 1042]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 1042). Cancelled while BasicCegarLoop was constructing difference of abstraction (605states) and interpolant automaton (currently 32 states, 55 states before enhancement), while PredicateComparison was comparing new predicate (quantified with 0quantifier alternations) to 84 known predicates. - TimeoutResultAtElement [Line: 1026]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 1026). Cancelled while BasicCegarLoop was constructing difference of abstraction (605states) and interpolant automaton (currently 32 states, 55 states before enhancement), while PredicateComparison was comparing new predicate (quantified with 0quantifier alternations) to 84 known predicates. - TimeoutResultAtElement [Line: 1001]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 1001). Cancelled while BasicCegarLoop was constructing difference of abstraction (605states) and interpolant automaton (currently 32 states, 55 states before enhancement), while PredicateComparison was comparing new predicate (quantified with 0quantifier alternations) to 84 known predicates. - TimeoutResultAtElement [Line: 1003]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 1003). Cancelled while BasicCegarLoop was constructing difference of abstraction (605states) and interpolant automaton (currently 32 states, 55 states before enhancement), while PredicateComparison was comparing new predicate (quantified with 0quantifier alternations) to 84 known predicates. - TimeoutResultAtElement [Line: 1005]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 1005). Cancelled while BasicCegarLoop was constructing difference of abstraction (605states) and interpolant automaton (currently 32 states, 55 states before enhancement), while PredicateComparison was comparing new predicate (quantified with 0quantifier alternations) to 84 known predicates. - TimeoutResultAtElement [Line: 1044]: Timeout (TraceAbstraction) Unable to prove that free always succeeds (line 1044). Cancelled while BasicCegarLoop was constructing difference of abstraction (605states) and interpolant automaton (currently 32 states, 55 states before enhancement), while PredicateComparison was comparing new predicate (quantified with 0quantifier alternations) to 84 known predicates. - TimeoutResultAtElement [Line: 1005]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 1005). Cancelled while BasicCegarLoop was constructing difference of abstraction (605states) and interpolant automaton (currently 32 states, 55 states before enhancement), while PredicateComparison was comparing new predicate (quantified with 0quantifier alternations) to 84 known predicates. - TimeoutResultAtElement [Line: 992]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 992). Cancelled while BasicCegarLoop was constructing difference of abstraction (605states) and interpolant automaton (currently 32 states, 55 states before enhancement), while PredicateComparison was comparing new predicate (quantified with 0quantifier alternations) to 84 known predicates. - TimeoutResultAtElement [Line: 1048]: Timeout (TraceAbstraction) Unable to prove that free always succeeds (line 1048). Cancelled while BasicCegarLoop was constructing difference of abstraction (605states) and interpolant automaton (currently 32 states, 55 states before enhancement), while PredicateComparison was comparing new predicate (quantified with 0quantifier alternations) to 84 known predicates. - TimeoutResultAtElement [Line: 993]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 993). Cancelled while BasicCegarLoop was constructing difference of abstraction (605states) and interpolant automaton (currently 32 states, 55 states before enhancement), while PredicateComparison was comparing new predicate (quantified with 0quantifier alternations) to 84 known predicates. - TimeoutResultAtElement [Line: 1042]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 1042). Cancelled while BasicCegarLoop was constructing difference of abstraction (605states) and interpolant automaton (currently 32 states, 55 states before enhancement), while PredicateComparison was comparing new predicate (quantified with 0quantifier alternations) to 84 known predicates. - TimeoutResultAtElement [Line: 993]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 993). Cancelled while BasicCegarLoop was constructing difference of abstraction (605states) and interpolant automaton (currently 32 states, 55 states before enhancement), while PredicateComparison was comparing new predicate (quantified with 0quantifier alternations) to 84 known predicates. - TimeoutResultAtElement [Line: 1002]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 1002). Cancelled while BasicCegarLoop was constructing difference of abstraction (605states) and interpolant automaton (currently 32 states, 55 states before enhancement), while PredicateComparison was comparing new predicate (quantified with 0quantifier alternations) to 84 known predicates. - TimeoutResultAtElement [Line: 993]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 993). Cancelled while BasicCegarLoop was constructing difference of abstraction (605states) and interpolant automaton (currently 32 states, 55 states before enhancement), while PredicateComparison was comparing new predicate (quantified with 0quantifier alternations) to 84 known predicates. - TimeoutResultAtElement [Line: 1005]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 1005). Cancelled while BasicCegarLoop was constructing difference of abstraction (605states) and interpolant automaton (currently 32 states, 55 states before enhancement), while PredicateComparison was comparing new predicate (quantified with 0quantifier alternations) to 84 known predicates. - TimeoutResultAtElement [Line: 1027]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 1027). Cancelled while BasicCegarLoop was constructing difference of abstraction (605states) and interpolant automaton (currently 32 states, 55 states before enhancement), while PredicateComparison was comparing new predicate (quantified with 0quantifier alternations) to 84 known predicates. - TimeoutResultAtElement [Line: 993]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 993). Cancelled while BasicCegarLoop was constructing difference of abstraction (605states) and interpolant automaton (currently 32 states, 55 states before enhancement), while PredicateComparison was comparing new predicate (quantified with 0quantifier alternations) to 84 known predicates. - TimeoutResultAtElement [Line: 1017]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 1017). Cancelled while BasicCegarLoop was constructing difference of abstraction (605states) and interpolant automaton (currently 32 states, 55 states before enhancement), while PredicateComparison was comparing new predicate (quantified with 0quantifier alternations) to 84 known predicates. - StatisticsResult: Ultimate Automizer benchmark data CFG has 3 procedures, 187 locations, 63 error locations. TIMEOUT Result, 201.5s OverallTime, 40 OverallIterations, 2 TraceHistogramMax, 159.0s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 6197 SDtfs, 24662 SDslu, 37848 SDs, 0 SdLazy, 29489 SolverSat, 1865 SolverUnsat, 53 SolverUnknown, 0 SolverNotchecked, 39.6s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 1596 GetRequests, 666 SyntacticMatches, 36 SemanticMatches, 893 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9446 ImplicationChecksByTransitivity, 153.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=605occurred in iteration=39, 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, 39 MinimizatonAttempts, 5066 StatesRemovedByMinimization, 39 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.4s SatisfiabilityAnalysisTime, 41.0s InterpolantComputationTime, 2669 NumberOfCodeBlocks, 2669 NumberOfCodeBlocksAsserted, 51 NumberOfCheckSat, 2618 ConstructedInterpolants, 310 QuantifiedInterpolants, 3689076 SizeOfPredicates, 149 NumberOfNonLiveVariables, 2288 ConjunctsInSsa, 379 ConjunctsInUnsatCore, 51 InterpolantComputations, 29 PerfectInterpolantSequences, 45/133 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/sll-01_true-unreach-call_true-valid-memsafety.i_svcomp-DerefFreeMemtrack-32bit-Automizer_Camel.epf_AutomizerC.xml/Csv-Benchmark-0-2018-04-11_12-29-59-463.csv Written .csv to /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/sll-01_true-unreach-call_true-valid-memsafety.i_svcomp-DerefFreeMemtrack-32bit-Automizer_Camel.epf_AutomizerC.xml/Csv-TraceAbstractionBenchmarks-0-2018-04-11_12-29-59-463.csv Completed graceful shutdown