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_false-unreach-call_false-valid-deref.i -------------------------------------------------------------------------------- This is Ultimate 0.1.23-666feb3-m [2018-04-11 12:43:23,670 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-04-11 12:43:23,672 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-04-11 12:43:23,684 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-04-11 12:43:23,684 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-04-11 12:43:23,685 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-04-11 12:43:23,685 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-04-11 12:43:23,687 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-04-11 12:43:23,689 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-04-11 12:43:23,689 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-04-11 12:43:23,690 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-04-11 12:43:23,690 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-04-11 12:43:23,691 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-04-11 12:43:23,692 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-04-11 12:43:23,693 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-04-11 12:43:23,694 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-04-11 12:43:23,695 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-04-11 12:43:23,697 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-04-11 12:43:23,698 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-04-11 12:43:23,699 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-04-11 12:43:23,700 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-04-11 12:43:23,701 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-04-11 12:43:23,701 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-04-11 12:43:23,702 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-04-11 12:43:23,702 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-04-11 12:43:23,703 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-04-11 12:43:23,703 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-04-11 12:43:23,704 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-04-11 12:43:23,705 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-04-11 12:43:23,705 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-04-11 12:43:23,705 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-04-11 12:43:23,706 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:43:23,725 INFO L110 SettingsManager]: Loading preferences was successful [2018-04-11 12:43:23,725 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-04-11 12:43:23,726 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-04-11 12:43:23,726 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-04-11 12:43:23,726 INFO L133 SettingsManager]: * Use SBE=true [2018-04-11 12:43:23,726 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-04-11 12:43:23,726 INFO L133 SettingsManager]: * sizeof long=4 [2018-04-11 12:43:23,726 INFO L133 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2018-04-11 12:43:23,726 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-04-11 12:43:23,727 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-04-11 12:43:23,727 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-04-11 12:43:23,727 INFO L133 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2018-04-11 12:43:23,727 INFO L133 SettingsManager]: * Bitprecise bitfields=true [2018-04-11 12:43:23,727 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-04-11 12:43:23,727 INFO L133 SettingsManager]: * sizeof long double=12 [2018-04-11 12:43:23,727 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-04-11 12:43:23,727 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-04-11 12:43:23,727 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-04-11 12:43:23,727 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-04-11 12:43:23,728 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-04-11 12:43:23,728 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-04-11 12:43:23,728 INFO L133 SettingsManager]: * Interpolant automaton=TWOTRACK [2018-04-11 12:43:23,728 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-04-11 12:43:23,728 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:43:23,754 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-04-11 12:43:23,764 INFO L266 ainManager$Toolchain]: [Toolchain 1]: Parser(s) successfully (re)initialized [2018-04-11 12:43:23,767 INFO L222 ainManager$Toolchain]: [Toolchain 1]: Toolchain data selected. [2018-04-11 12:43:23,768 INFO L271 PluginConnector]: Initializing CDTParser... [2018-04-11 12:43:23,768 INFO L276 PluginConnector]: CDTParser initialized [2018-04-11 12:43:23,769 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/forester-heap/sll-01_false-unreach-call_false-valid-deref.i [2018-04-11 12:43:24,058 INFO L225 CDTParser]: Created temporary CDT project at /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/data/FLAGe26382cf6 [2018-04-11 12:43:24,203 INFO L287 CDTParser]: IsIndexed: true [2018-04-11 12:43:24,203 INFO L288 CDTParser]: Found 1 translation units. [2018-04-11 12:43:24,203 INFO L168 CDTParser]: Scanning sll-01_false-unreach-call_false-valid-deref.i [2018-04-11 12:43:24,211 INFO L210 ultiparseSymbolTable]: Include resolver: [2018-04-11 12:43:24,211 INFO L215 ultiparseSymbolTable]: [2018-04-11 12:43:24,211 INFO L218 ultiparseSymbolTable]: Function table: [2018-04-11 12:43:24,211 INFO L221 ultiparseSymbolTable]: Function definition of null ('main') in sll-01_false-unreach-call_false-valid-deref.i [2018-04-11 12:43:24,211 INFO L227 ultiparseSymbolTable]: Global variable table: [2018-04-11 12:43:24,211 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fsll____false_unreach_call_false_valid_deref_i____time_t in sll-01_false-unreach-call_false-valid-deref.i [2018-04-11 12:43:24,211 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fsll____false_unreach_call_false_valid_deref_i____timer_t in sll-01_false-unreach-call_false-valid-deref.i [2018-04-11 12:43:24,211 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fsll____false_unreach_call_false_valid_deref_i__pthread_mutexattr_t in sll-01_false-unreach-call_false-valid-deref.i [2018-04-11 12:43:24,212 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fsll____false_unreach_call_false_valid_deref_i____intptr_t in sll-01_false-unreach-call_false-valid-deref.i [2018-04-11 12:43:24,212 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fsll____false_unreach_call_false_valid_deref_i__idtype_t in sll-01_false-unreach-call_false-valid-deref.i [2018-04-11 12:43:24,212 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fsll____false_unreach_call_false_valid_deref_i__size_t in sll-01_false-unreach-call_false-valid-deref.i [2018-04-11 12:43:24,212 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fsll____false_unreach_call_false_valid_deref_i____mode_t in sll-01_false-unreach-call_false-valid-deref.i [2018-04-11 12:43:24,212 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fsll____false_unreach_call_false_valid_deref_i__pthread_mutex_t in sll-01_false-unreach-call_false-valid-deref.i [2018-04-11 12:43:24,212 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fsll____false_unreach_call_false_valid_deref_i__fsfilcnt_t in sll-01_false-unreach-call_false-valid-deref.i [2018-04-11 12:43:24,212 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fsll____false_unreach_call_false_valid_deref_i__u_int in sll-01_false-unreach-call_false-valid-deref.i [2018-04-11 12:43:24,212 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fsll____false_unreach_call_false_valid_deref_i__int8_t in sll-01_false-unreach-call_false-valid-deref.i [2018-04-11 12:43:24,212 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fsll____false_unreach_call_false_valid_deref_i____fsfilcnt_t in sll-01_false-unreach-call_false-valid-deref.i [2018-04-11 12:43:24,212 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fsll____false_unreach_call_false_valid_deref_i__caddr_t in sll-01_false-unreach-call_false-valid-deref.i [2018-04-11 12:43:24,212 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fsll____false_unreach_call_false_valid_deref_i__u_int64_t in sll-01_false-unreach-call_false-valid-deref.i [2018-04-11 12:43:24,212 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fsll____false_unreach_call_false_valid_deref_i__u_short in sll-01_false-unreach-call_false-valid-deref.i [2018-04-11 12:43:24,212 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fsll____false_unreach_call_false_valid_deref_i__time_t in sll-01_false-unreach-call_false-valid-deref.i [2018-04-11 12:43:24,212 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fsll____false_unreach_call_false_valid_deref_i__div_t in sll-01_false-unreach-call_false-valid-deref.i [2018-04-11 12:43:24,212 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fsll____false_unreach_call_false_valid_deref_i__off_t in sll-01_false-unreach-call_false-valid-deref.i [2018-04-11 12:43:24,212 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fsll____false_unreach_call_false_valid_deref_i____suseconds_t in sll-01_false-unreach-call_false-valid-deref.i [2018-04-11 12:43:24,213 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fsll____false_unreach_call_false_valid_deref_i__ldiv_t in sll-01_false-unreach-call_false-valid-deref.i [2018-04-11 12:43:24,213 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fsll____false_unreach_call_false_valid_deref_i____fsfilcnt64_t in sll-01_false-unreach-call_false-valid-deref.i [2018-04-11 12:43:24,213 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fsll____false_unreach_call_false_valid_deref_i__ino_t in sll-01_false-unreach-call_false-valid-deref.i [2018-04-11 12:43:24,213 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fsll____false_unreach_call_false_valid_deref_i____uint32_t in sll-01_false-unreach-call_false-valid-deref.i [2018-04-11 12:43:24,213 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fsll____false_unreach_call_false_valid_deref_i____socklen_t in sll-01_false-unreach-call_false-valid-deref.i [2018-04-11 12:43:24,213 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fsll____false_unreach_call_false_valid_deref_i__lldiv_t in sll-01_false-unreach-call_false-valid-deref.i [2018-04-11 12:43:24,213 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fsll____false_unreach_call_false_valid_deref_i____rlim_t in sll-01_false-unreach-call_false-valid-deref.i [2018-04-11 12:43:24,213 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fsll____false_unreach_call_false_valid_deref_i__uid_t in sll-01_false-unreach-call_false-valid-deref.i [2018-04-11 12:43:24,213 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fsll____false_unreach_call_false_valid_deref_i__pthread_rwlock_t in sll-01_false-unreach-call_false-valid-deref.i [2018-04-11 12:43:24,213 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fsll____false_unreach_call_false_valid_deref_i__register_t in sll-01_false-unreach-call_false-valid-deref.i [2018-04-11 12:43:24,213 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fsll____false_unreach_call_false_valid_deref_i__int16_t in sll-01_false-unreach-call_false-valid-deref.i [2018-04-11 12:43:24,213 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fsll____false_unreach_call_false_valid_deref_i__pthread_key_t in sll-01_false-unreach-call_false-valid-deref.i [2018-04-11 12:43:24,213 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fsll____false_unreach_call_false_valid_deref_i____fsblkcnt_t in sll-01_false-unreach-call_false-valid-deref.i [2018-04-11 12:43:24,213 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fsll____false_unreach_call_false_valid_deref_i__pthread_attr_t in sll-01_false-unreach-call_false-valid-deref.i [2018-04-11 12:43:24,213 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fsll____false_unreach_call_false_valid_deref_i____off64_t in sll-01_false-unreach-call_false-valid-deref.i [2018-04-11 12:43:24,213 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fsll____false_unreach_call_false_valid_deref_i____sig_atomic_t in sll-01_false-unreach-call_false-valid-deref.i [2018-04-11 12:43:24,213 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fsll____false_unreach_call_false_valid_deref_i____uid_t in sll-01_false-unreach-call_false-valid-deref.i [2018-04-11 12:43:24,214 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fsll____false_unreach_call_false_valid_deref_i____uint64_t in sll-01_false-unreach-call_false-valid-deref.i [2018-04-11 12:43:24,214 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fsll____false_unreach_call_false_valid_deref_i____syscall_ulong_t in sll-01_false-unreach-call_false-valid-deref.i [2018-04-11 12:43:24,214 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fsll____false_unreach_call_false_valid_deref_i____fsword_t in sll-01_false-unreach-call_false-valid-deref.i [2018-04-11 12:43:24,214 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fsll____false_unreach_call_false_valid_deref_i__uint in sll-01_false-unreach-call_false-valid-deref.i [2018-04-11 12:43:24,214 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fsll____false_unreach_call_false_valid_deref_i__sigset_t in sll-01_false-unreach-call_false-valid-deref.i [2018-04-11 12:43:24,214 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fsll____false_unreach_call_false_valid_deref_i__nlink_t in sll-01_false-unreach-call_false-valid-deref.i [2018-04-11 12:43:24,214 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fsll____false_unreach_call_false_valid_deref_i__ssize_t in sll-01_false-unreach-call_false-valid-deref.i [2018-04-11 12:43:24,214 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fsll____false_unreach_call_false_valid_deref_i____u_char in sll-01_false-unreach-call_false-valid-deref.i [2018-04-11 12:43:24,214 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fsll____false_unreach_call_false_valid_deref_i____fsblkcnt64_t in sll-01_false-unreach-call_false-valid-deref.i [2018-04-11 12:43:24,214 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fsll____false_unreach_call_false_valid_deref_i____nlink_t in sll-01_false-unreach-call_false-valid-deref.i [2018-04-11 12:43:24,215 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fsll____false_unreach_call_false_valid_deref_i____pthread_slist_t in sll-01_false-unreach-call_false-valid-deref.i [2018-04-11 12:43:24,215 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fsll____false_unreach_call_false_valid_deref_i____int32_t in sll-01_false-unreach-call_false-valid-deref.i [2018-04-11 12:43:24,215 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fsll____false_unreach_call_false_valid_deref_i__pthread_rwlockattr_t in sll-01_false-unreach-call_false-valid-deref.i [2018-04-11 12:43:24,215 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fsll____false_unreach_call_false_valid_deref_i____blkcnt64_t in sll-01_false-unreach-call_false-valid-deref.i [2018-04-11 12:43:24,215 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fsll____false_unreach_call_false_valid_deref_i__fsblkcnt_t in sll-01_false-unreach-call_false-valid-deref.i [2018-04-11 12:43:24,215 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fsll____false_unreach_call_false_valid_deref_i__int32_t in sll-01_false-unreach-call_false-valid-deref.i [2018-04-11 12:43:24,215 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fsll____false_unreach_call_false_valid_deref_i__u_int32_t in sll-01_false-unreach-call_false-valid-deref.i [2018-04-11 12:43:24,215 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fsll____false_unreach_call_false_valid_deref_i____id_t in sll-01_false-unreach-call_false-valid-deref.i [2018-04-11 12:43:24,215 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fsll____false_unreach_call_false_valid_deref_i__pthread_t in sll-01_false-unreach-call_false-valid-deref.i [2018-04-11 12:43:24,215 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fsll____false_unreach_call_false_valid_deref_i__u_int8_t in sll-01_false-unreach-call_false-valid-deref.i [2018-04-11 12:43:24,216 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fsll____false_unreach_call_false_valid_deref_i__key_t in sll-01_false-unreach-call_false-valid-deref.i [2018-04-11 12:43:24,216 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fsll____false_unreach_call_false_valid_deref_i____fd_mask in sll-01_false-unreach-call_false-valid-deref.i [2018-04-11 12:43:24,216 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fsll____false_unreach_call_false_valid_deref_i____ssize_t in sll-01_false-unreach-call_false-valid-deref.i [2018-04-11 12:43:24,216 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fsll____false_unreach_call_false_valid_deref_i__timer_t in sll-01_false-unreach-call_false-valid-deref.i [2018-04-11 12:43:24,216 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fsll____false_unreach_call_false_valid_deref_i__clockid_t in sll-01_false-unreach-call_false-valid-deref.i [2018-04-11 12:43:24,216 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fsll____false_unreach_call_false_valid_deref_i____ino_t in sll-01_false-unreach-call_false-valid-deref.i [2018-04-11 12:43:24,216 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fsll____false_unreach_call_false_valid_deref_i____syscall_slong_t in sll-01_false-unreach-call_false-valid-deref.i [2018-04-11 12:43:24,216 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fsll____false_unreach_call_false_valid_deref_i____u_quad_t in sll-01_false-unreach-call_false-valid-deref.i [2018-04-11 12:43:24,216 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fsll____false_unreach_call_false_valid_deref_i____pid_t in sll-01_false-unreach-call_false-valid-deref.i [2018-04-11 12:43:24,216 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fsll____false_unreach_call_false_valid_deref_i__ushort in sll-01_false-unreach-call_false-valid-deref.i [2018-04-11 12:43:24,216 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fsll____false_unreach_call_false_valid_deref_i____gid_t in sll-01_false-unreach-call_false-valid-deref.i [2018-04-11 12:43:24,217 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fsll____false_unreach_call_false_valid_deref_i__u_long in sll-01_false-unreach-call_false-valid-deref.i [2018-04-11 12:43:24,217 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fsll____false_unreach_call_false_valid_deref_i____off_t in sll-01_false-unreach-call_false-valid-deref.i [2018-04-11 12:43:24,217 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fsll____false_unreach_call_false_valid_deref_i__fd_mask in sll-01_false-unreach-call_false-valid-deref.i [2018-04-11 12:43:24,217 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fsll____false_unreach_call_false_valid_deref_i__pthread_barrier_t in sll-01_false-unreach-call_false-valid-deref.i [2018-04-11 12:43:24,217 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fsll____false_unreach_call_false_valid_deref_i____uint16_t in sll-01_false-unreach-call_false-valid-deref.i [2018-04-11 12:43:24,217 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fsll____false_unreach_call_false_valid_deref_i____sigset_t in sll-01_false-unreach-call_false-valid-deref.i [2018-04-11 12:43:24,217 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fsll____false_unreach_call_false_valid_deref_i____fsid_t in sll-01_false-unreach-call_false-valid-deref.i [2018-04-11 12:43:24,217 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fsll____false_unreach_call_false_valid_deref_i__int64_t in sll-01_false-unreach-call_false-valid-deref.i [2018-04-11 12:43:24,217 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fsll____false_unreach_call_false_valid_deref_i____quad_t in sll-01_false-unreach-call_false-valid-deref.i [2018-04-11 12:43:24,217 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fsll____false_unreach_call_false_valid_deref_i____ino64_t in sll-01_false-unreach-call_false-valid-deref.i [2018-04-11 12:43:24,217 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fsll____false_unreach_call_false_valid_deref_i____uint8_t in sll-01_false-unreach-call_false-valid-deref.i [2018-04-11 12:43:24,218 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fsll____false_unreach_call_false_valid_deref_i____key_t in sll-01_false-unreach-call_false-valid-deref.i [2018-04-11 12:43:24,218 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fsll____false_unreach_call_false_valid_deref_i__pthread_spinlock_t in sll-01_false-unreach-call_false-valid-deref.i [2018-04-11 12:43:24,218 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fsll____false_unreach_call_false_valid_deref_i__id_t in sll-01_false-unreach-call_false-valid-deref.i [2018-04-11 12:43:24,218 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fsll____false_unreach_call_false_valid_deref_i____useconds_t in sll-01_false-unreach-call_false-valid-deref.i [2018-04-11 12:43:24,218 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fsll____false_unreach_call_false_valid_deref_i____u_long in sll-01_false-unreach-call_false-valid-deref.i [2018-04-11 12:43:24,218 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fsll____false_unreach_call_false_valid_deref_i__dev_t in sll-01_false-unreach-call_false-valid-deref.i [2018-04-11 12:43:24,218 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fsll____false_unreach_call_false_valid_deref_i____int16_t in sll-01_false-unreach-call_false-valid-deref.i [2018-04-11 12:43:24,218 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fsll____false_unreach_call_false_valid_deref_i__wchar_t in sll-01_false-unreach-call_false-valid-deref.i [2018-04-11 12:43:24,218 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fsll____false_unreach_call_false_valid_deref_i____blkcnt_t in sll-01_false-unreach-call_false-valid-deref.i [2018-04-11 12:43:24,218 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fsll____false_unreach_call_false_valid_deref_i__pthread_cond_t in sll-01_false-unreach-call_false-valid-deref.i [2018-04-11 12:43:24,218 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fsll____false_unreach_call_false_valid_deref_i__pthread_barrierattr_t in sll-01_false-unreach-call_false-valid-deref.i [2018-04-11 12:43:24,218 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fsll____false_unreach_call_false_valid_deref_i__u_int16_t in sll-01_false-unreach-call_false-valid-deref.i [2018-04-11 12:43:24,218 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fsll____false_unreach_call_false_valid_deref_i____u_int in sll-01_false-unreach-call_false-valid-deref.i [2018-04-11 12:43:24,219 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fsll____false_unreach_call_false_valid_deref_i__u_char in sll-01_false-unreach-call_false-valid-deref.i [2018-04-11 12:43:24,219 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fsll____false_unreach_call_false_valid_deref_i__blkcnt_t in sll-01_false-unreach-call_false-valid-deref.i [2018-04-11 12:43:24,219 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fsll____false_unreach_call_false_valid_deref_i__quad_t in sll-01_false-unreach-call_false-valid-deref.i [2018-04-11 12:43:24,219 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fsll____false_unreach_call_false_valid_deref_i____clockid_t in sll-01_false-unreach-call_false-valid-deref.i [2018-04-11 12:43:24,219 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fsll____false_unreach_call_false_valid_deref_i____caddr_t in sll-01_false-unreach-call_false-valid-deref.i [2018-04-11 12:43:24,219 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fsll____false_unreach_call_false_valid_deref_i__u_quad_t in sll-01_false-unreach-call_false-valid-deref.i [2018-04-11 12:43:24,219 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fsll____false_unreach_call_false_valid_deref_i____int64_t in sll-01_false-unreach-call_false-valid-deref.i [2018-04-11 12:43:24,219 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fsll____false_unreach_call_false_valid_deref_i____blksize_t in sll-01_false-unreach-call_false-valid-deref.i [2018-04-11 12:43:24,219 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fsll____false_unreach_call_false_valid_deref_i__pthread_once_t in sll-01_false-unreach-call_false-valid-deref.i [2018-04-11 12:43:24,219 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fsll____false_unreach_call_false_valid_deref_i__blksize_t in sll-01_false-unreach-call_false-valid-deref.i [2018-04-11 12:43:24,219 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fsll____false_unreach_call_false_valid_deref_i____qaddr_t in sll-01_false-unreach-call_false-valid-deref.i [2018-04-11 12:43:24,219 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fsll____false_unreach_call_false_valid_deref_i____rlim64_t in sll-01_false-unreach-call_false-valid-deref.i [2018-04-11 12:43:24,219 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fsll____false_unreach_call_false_valid_deref_i__loff_t in sll-01_false-unreach-call_false-valid-deref.i [2018-04-11 12:43:24,219 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fsll____false_unreach_call_false_valid_deref_i__SLL in sll-01_false-unreach-call_false-valid-deref.i [2018-04-11 12:43:24,219 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fsll____false_unreach_call_false_valid_deref_i____daddr_t in sll-01_false-unreach-call_false-valid-deref.i [2018-04-11 12:43:24,219 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fsll____false_unreach_call_false_valid_deref_i__gid_t in sll-01_false-unreach-call_false-valid-deref.i [2018-04-11 12:43:24,219 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fsll____false_unreach_call_false_valid_deref_i__ulong in sll-01_false-unreach-call_false-valid-deref.i [2018-04-11 12:43:24,219 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fsll____false_unreach_call_false_valid_deref_i____clock_t in sll-01_false-unreach-call_false-valid-deref.i [2018-04-11 12:43:24,219 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fsll____false_unreach_call_false_valid_deref_i__pid_t in sll-01_false-unreach-call_false-valid-deref.i [2018-04-11 12:43:24,219 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fsll____false_unreach_call_false_valid_deref_i__pthread_condattr_t in sll-01_false-unreach-call_false-valid-deref.i [2018-04-11 12:43:24,220 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fsll____false_unreach_call_false_valid_deref_i__fd_set in sll-01_false-unreach-call_false-valid-deref.i [2018-04-11 12:43:24,220 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fsll____false_unreach_call_false_valid_deref_i__daddr_t in sll-01_false-unreach-call_false-valid-deref.i [2018-04-11 12:43:24,220 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fsll____false_unreach_call_false_valid_deref_i____u_short in sll-01_false-unreach-call_false-valid-deref.i [2018-04-11 12:43:24,220 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fsll____false_unreach_call_false_valid_deref_i__fsid_t in sll-01_false-unreach-call_false-valid-deref.i [2018-04-11 12:43:24,220 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fsll____false_unreach_call_false_valid_deref_i__clock_t in sll-01_false-unreach-call_false-valid-deref.i [2018-04-11 12:43:24,220 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fsll____false_unreach_call_false_valid_deref_i__mode_t in sll-01_false-unreach-call_false-valid-deref.i [2018-04-11 12:43:24,220 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fsll____false_unreach_call_false_valid_deref_i__suseconds_t in sll-01_false-unreach-call_false-valid-deref.i [2018-04-11 12:43:24,220 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fsll____false_unreach_call_false_valid_deref_i____int8_t in sll-01_false-unreach-call_false-valid-deref.i [2018-04-11 12:43:24,220 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fsll____false_unreach_call_false_valid_deref_i____dev_t in sll-01_false-unreach-call_false-valid-deref.i [2018-04-11 12:43:24,220 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fsll____false_unreach_call_false_valid_deref_i____loff_t in sll-01_false-unreach-call_false-valid-deref.i [2018-04-11 12:43:24,232 INFO L330 CDTParser]: Deleted temporary CDT project at /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/data/FLAGe26382cf6 [2018-04-11 12:43:24,236 INFO L304 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-04-11 12:43:24,237 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2018-04-11 12:43:24,238 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-04-11 12:43:24,238 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-04-11 12:43:24,243 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-04-11 12:43:24,244 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 11.04 12:43:24" (1/1) ... [2018-04-11 12:43:24,246 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@67cf35de and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.04 12:43:24, skipping insertion in model container [2018-04-11 12:43:24,246 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 11.04 12:43:24" (1/1) ... [2018-04-11 12:43:24,261 INFO L167 Dispatcher]: Using SV-COMP mode [2018-04-11 12:43:24,288 INFO L167 Dispatcher]: Using SV-COMP mode [2018-04-11 12:43:24,426 INFO L175 PostProcessor]: Settings: Checked method=main [2018-04-11 12:43:24,462 INFO L175 PostProcessor]: Settings: Checked method=main [2018-04-11 12:43:24,467 INFO L100 SccComputation]: Graph consists of 0 InCaSumBalls and 112 non ball SCCs. Number of states in SCCs 112. [2018-04-11 12:43:24,503 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.04 12:43:24 WrapperNode [2018-04-11 12:43:24,503 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-04-11 12:43:24,504 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-04-11 12:43:24,504 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-04-11 12:43:24,504 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-04-11 12:43:24,515 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.04 12:43:24" (1/1) ... [2018-04-11 12:43:24,516 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.04 12:43:24" (1/1) ... [2018-04-11 12:43:24,529 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.04 12:43:24" (1/1) ... [2018-04-11 12:43:24,529 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.04 12:43:24" (1/1) ... [2018-04-11 12:43:24,539 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.04 12:43:24" (1/1) ... [2018-04-11 12:43:24,545 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.04 12:43:24" (1/1) ... [2018-04-11 12:43:24,548 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.04 12:43:24" (1/1) ... [2018-04-11 12:43:24,552 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-04-11 12:43:24,552 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-04-11 12:43:24,553 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-04-11 12:43:24,553 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-04-11 12:43:24,553 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.04 12:43:24" (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:43:24,637 INFO L136 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-04-11 12:43:24,637 INFO L136 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-04-11 12:43:24,638 INFO L136 BoogieDeclarations]: Found implementation of procedure main [2018-04-11 12:43:24,638 INFO L128 BoogieDeclarations]: Found specification of procedure __ctype_get_mb_cur_max [2018-04-11 12:43:24,638 INFO L128 BoogieDeclarations]: Found specification of procedure atof [2018-04-11 12:43:24,638 INFO L128 BoogieDeclarations]: Found specification of procedure atoi [2018-04-11 12:43:24,638 INFO L128 BoogieDeclarations]: Found specification of procedure atol [2018-04-11 12:43:24,638 INFO L128 BoogieDeclarations]: Found specification of procedure atoll [2018-04-11 12:43:24,638 INFO L128 BoogieDeclarations]: Found specification of procedure strtod [2018-04-11 12:43:24,638 INFO L128 BoogieDeclarations]: Found specification of procedure strtof [2018-04-11 12:43:24,638 INFO L128 BoogieDeclarations]: Found specification of procedure strtold [2018-04-11 12:43:24,638 INFO L128 BoogieDeclarations]: Found specification of procedure strtol [2018-04-11 12:43:24,638 INFO L128 BoogieDeclarations]: Found specification of procedure strtoul [2018-04-11 12:43:24,639 INFO L128 BoogieDeclarations]: Found specification of procedure strtoq [2018-04-11 12:43:24,639 INFO L128 BoogieDeclarations]: Found specification of procedure strtouq [2018-04-11 12:43:24,639 INFO L128 BoogieDeclarations]: Found specification of procedure strtoll [2018-04-11 12:43:24,639 INFO L128 BoogieDeclarations]: Found specification of procedure strtoull [2018-04-11 12:43:24,639 INFO L128 BoogieDeclarations]: Found specification of procedure l64a [2018-04-11 12:43:24,639 INFO L128 BoogieDeclarations]: Found specification of procedure a64l [2018-04-11 12:43:24,639 INFO L128 BoogieDeclarations]: Found specification of procedure select [2018-04-11 12:43:24,639 INFO L128 BoogieDeclarations]: Found specification of procedure pselect [2018-04-11 12:43:24,639 INFO L128 BoogieDeclarations]: Found specification of procedure gnu_dev_major [2018-04-11 12:43:24,639 INFO L128 BoogieDeclarations]: Found specification of procedure gnu_dev_minor [2018-04-11 12:43:24,640 INFO L128 BoogieDeclarations]: Found specification of procedure gnu_dev_makedev [2018-04-11 12:43:24,640 INFO L128 BoogieDeclarations]: Found specification of procedure random [2018-04-11 12:43:24,640 INFO L128 BoogieDeclarations]: Found specification of procedure srandom [2018-04-11 12:43:24,640 INFO L128 BoogieDeclarations]: Found specification of procedure initstate [2018-04-11 12:43:24,640 INFO L128 BoogieDeclarations]: Found specification of procedure setstate [2018-04-11 12:43:24,640 INFO L128 BoogieDeclarations]: Found specification of procedure random_r [2018-04-11 12:43:24,640 INFO L128 BoogieDeclarations]: Found specification of procedure srandom_r [2018-04-11 12:43:24,640 INFO L128 BoogieDeclarations]: Found specification of procedure initstate_r [2018-04-11 12:43:24,640 INFO L128 BoogieDeclarations]: Found specification of procedure setstate_r [2018-04-11 12:43:24,640 INFO L128 BoogieDeclarations]: Found specification of procedure rand [2018-04-11 12:43:24,640 INFO L128 BoogieDeclarations]: Found specification of procedure srand [2018-04-11 12:43:24,641 INFO L128 BoogieDeclarations]: Found specification of procedure rand_r [2018-04-11 12:43:24,641 INFO L128 BoogieDeclarations]: Found specification of procedure drand48 [2018-04-11 12:43:24,641 INFO L128 BoogieDeclarations]: Found specification of procedure erand48 [2018-04-11 12:43:24,641 INFO L128 BoogieDeclarations]: Found specification of procedure lrand48 [2018-04-11 12:43:24,641 INFO L128 BoogieDeclarations]: Found specification of procedure nrand48 [2018-04-11 12:43:24,641 INFO L128 BoogieDeclarations]: Found specification of procedure mrand48 [2018-04-11 12:43:24,641 INFO L128 BoogieDeclarations]: Found specification of procedure jrand48 [2018-04-11 12:43:24,641 INFO L128 BoogieDeclarations]: Found specification of procedure srand48 [2018-04-11 12:43:24,641 INFO L128 BoogieDeclarations]: Found specification of procedure seed48 [2018-04-11 12:43:24,641 INFO L128 BoogieDeclarations]: Found specification of procedure lcong48 [2018-04-11 12:43:24,642 INFO L128 BoogieDeclarations]: Found specification of procedure drand48_r [2018-04-11 12:43:24,642 INFO L128 BoogieDeclarations]: Found specification of procedure erand48_r [2018-04-11 12:43:24,642 INFO L128 BoogieDeclarations]: Found specification of procedure lrand48_r [2018-04-11 12:43:24,642 INFO L128 BoogieDeclarations]: Found specification of procedure nrand48_r [2018-04-11 12:43:24,642 INFO L128 BoogieDeclarations]: Found specification of procedure mrand48_r [2018-04-11 12:43:24,642 INFO L128 BoogieDeclarations]: Found specification of procedure jrand48_r [2018-04-11 12:43:24,642 INFO L128 BoogieDeclarations]: Found specification of procedure srand48_r [2018-04-11 12:43:24,642 INFO L128 BoogieDeclarations]: Found specification of procedure seed48_r [2018-04-11 12:43:24,642 INFO L128 BoogieDeclarations]: Found specification of procedure lcong48_r [2018-04-11 12:43:24,643 INFO L128 BoogieDeclarations]: Found specification of procedure malloc [2018-04-11 12:43:24,643 INFO L128 BoogieDeclarations]: Found specification of procedure calloc [2018-04-11 12:43:24,643 INFO L128 BoogieDeclarations]: Found specification of procedure realloc [2018-04-11 12:43:24,643 INFO L128 BoogieDeclarations]: Found specification of procedure free [2018-04-11 12:43:24,643 INFO L128 BoogieDeclarations]: Found specification of procedure cfree [2018-04-11 12:43:24,643 INFO L128 BoogieDeclarations]: Found specification of procedure alloca [2018-04-11 12:43:24,643 INFO L128 BoogieDeclarations]: Found specification of procedure valloc [2018-04-11 12:43:24,643 INFO L128 BoogieDeclarations]: Found specification of procedure posix_memalign [2018-04-11 12:43:24,643 INFO L128 BoogieDeclarations]: Found specification of procedure aligned_alloc [2018-04-11 12:43:24,643 INFO L128 BoogieDeclarations]: Found specification of procedure abort [2018-04-11 12:43:24,644 INFO L128 BoogieDeclarations]: Found specification of procedure atexit [2018-04-11 12:43:24,644 INFO L128 BoogieDeclarations]: Found specification of procedure at_quick_exit [2018-04-11 12:43:24,644 INFO L128 BoogieDeclarations]: Found specification of procedure on_exit [2018-04-11 12:43:24,644 INFO L128 BoogieDeclarations]: Found specification of procedure exit [2018-04-11 12:43:24,644 INFO L128 BoogieDeclarations]: Found specification of procedure quick_exit [2018-04-11 12:43:24,644 INFO L128 BoogieDeclarations]: Found specification of procedure _Exit [2018-04-11 12:43:24,644 INFO L128 BoogieDeclarations]: Found specification of procedure getenv [2018-04-11 12:43:24,644 INFO L128 BoogieDeclarations]: Found specification of procedure putenv [2018-04-11 12:43:24,644 INFO L128 BoogieDeclarations]: Found specification of procedure setenv [2018-04-11 12:43:24,644 INFO L128 BoogieDeclarations]: Found specification of procedure unsetenv [2018-04-11 12:43:24,644 INFO L128 BoogieDeclarations]: Found specification of procedure clearenv [2018-04-11 12:43:24,644 INFO L128 BoogieDeclarations]: Found specification of procedure mktemp [2018-04-11 12:43:24,644 INFO L128 BoogieDeclarations]: Found specification of procedure mkstemp [2018-04-11 12:43:24,644 INFO L128 BoogieDeclarations]: Found specification of procedure mkstemps [2018-04-11 12:43:24,645 INFO L128 BoogieDeclarations]: Found specification of procedure mkdtemp [2018-04-11 12:43:24,645 INFO L128 BoogieDeclarations]: Found specification of procedure system [2018-04-11 12:43:24,645 INFO L128 BoogieDeclarations]: Found specification of procedure realpath [2018-04-11 12:43:24,645 INFO L128 BoogieDeclarations]: Found specification of procedure bsearch [2018-04-11 12:43:24,645 INFO L128 BoogieDeclarations]: Found specification of procedure qsort [2018-04-11 12:43:24,645 INFO L128 BoogieDeclarations]: Found specification of procedure abs [2018-04-11 12:43:24,645 INFO L128 BoogieDeclarations]: Found specification of procedure labs [2018-04-11 12:43:24,645 INFO L128 BoogieDeclarations]: Found specification of procedure llabs [2018-04-11 12:43:24,645 INFO L128 BoogieDeclarations]: Found specification of procedure div [2018-04-11 12:43:24,645 INFO L128 BoogieDeclarations]: Found specification of procedure ldiv [2018-04-11 12:43:24,645 INFO L128 BoogieDeclarations]: Found specification of procedure lldiv [2018-04-11 12:43:24,645 INFO L128 BoogieDeclarations]: Found specification of procedure ecvt [2018-04-11 12:43:24,645 INFO L128 BoogieDeclarations]: Found specification of procedure fcvt [2018-04-11 12:43:24,645 INFO L128 BoogieDeclarations]: Found specification of procedure gcvt [2018-04-11 12:43:24,645 INFO L128 BoogieDeclarations]: Found specification of procedure qecvt [2018-04-11 12:43:24,645 INFO L128 BoogieDeclarations]: Found specification of procedure qfcvt [2018-04-11 12:43:24,645 INFO L128 BoogieDeclarations]: Found specification of procedure qgcvt [2018-04-11 12:43:24,646 INFO L128 BoogieDeclarations]: Found specification of procedure ecvt_r [2018-04-11 12:43:24,646 INFO L128 BoogieDeclarations]: Found specification of procedure fcvt_r [2018-04-11 12:43:24,646 INFO L128 BoogieDeclarations]: Found specification of procedure qecvt_r [2018-04-11 12:43:24,646 INFO L128 BoogieDeclarations]: Found specification of procedure qfcvt_r [2018-04-11 12:43:24,646 INFO L128 BoogieDeclarations]: Found specification of procedure mblen [2018-04-11 12:43:24,646 INFO L128 BoogieDeclarations]: Found specification of procedure mbtowc [2018-04-11 12:43:24,646 INFO L128 BoogieDeclarations]: Found specification of procedure wctomb [2018-04-11 12:43:24,646 INFO L128 BoogieDeclarations]: Found specification of procedure mbstowcs [2018-04-11 12:43:24,646 INFO L128 BoogieDeclarations]: Found specification of procedure wcstombs [2018-04-11 12:43:24,646 INFO L128 BoogieDeclarations]: Found specification of procedure rpmatch [2018-04-11 12:43:24,647 INFO L128 BoogieDeclarations]: Found specification of procedure getsubopt [2018-04-11 12:43:24,647 INFO L128 BoogieDeclarations]: Found specification of procedure getloadavg [2018-04-11 12:43:24,647 INFO L128 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2018-04-11 12:43:24,647 INFO L128 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2018-04-11 12:43:24,647 INFO L128 BoogieDeclarations]: Found specification of procedure main [2018-04-11 12:43:24,647 INFO L128 BoogieDeclarations]: Found specification of procedure #Ultimate.alloc [2018-04-11 12:43:24,647 INFO L128 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2018-04-11 12:43:24,647 INFO L128 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2018-04-11 12:43:24,647 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2018-04-11 12:43:24,647 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-04-11 12:43:24,647 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-04-11 12:43:25,147 INFO L259 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-04-11 12:43:25,147 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.04 12:43:25 BoogieIcfgContainer [2018-04-11 12:43:25,148 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-04-11 12:43:25,148 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-04-11 12:43:25,148 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-04-11 12:43:25,150 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-04-11 12:43:25,150 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 11.04 12:43:24" (1/3) ... [2018-04-11 12:43:25,150 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5cc38d13 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 11.04 12:43:25, skipping insertion in model container [2018-04-11 12:43:25,151 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.04 12:43:24" (2/3) ... [2018-04-11 12:43:25,151 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5cc38d13 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 11.04 12:43:25, skipping insertion in model container [2018-04-11 12:43:25,151 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.04 12:43:25" (3/3) ... [2018-04-11 12:43:25,152 INFO L107 eAbstractionObserver]: Analyzing ICFG sll-01_false-unreach-call_false-valid-deref.i [2018-04-11 12:43:25,157 INFO L131 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-04-11 12:43:25,162 INFO L143 ceAbstractionStarter]: Appying trace abstraction to program that has 65 error locations. [2018-04-11 12:43:25,185 INFO L128 ementStrategyFactory]: Using default assertion order modulation [2018-04-11 12:43:25,186 INFO L369 AbstractCegarLoop]: Interprodecural is true [2018-04-11 12:43:25,186 INFO L370 AbstractCegarLoop]: Hoare is false [2018-04-11 12:43:25,186 INFO L371 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-04-11 12:43:25,186 INFO L372 AbstractCegarLoop]: Backedges is TWOTRACK [2018-04-11 12:43:25,186 INFO L373 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-04-11 12:43:25,186 INFO L374 AbstractCegarLoop]: Difference is false [2018-04-11 12:43:25,186 INFO L375 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-04-11 12:43:25,186 INFO L380 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-04-11 12:43:25,187 INFO L87 2NestedWordAutomaton]: Mode: main mode - execution starts in main procedure [2018-04-11 12:43:25,198 INFO L276 IsEmpty]: Start isEmpty. Operand 192 states. [2018-04-11 12:43:25,205 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2018-04-11 12:43:25,205 INFO L347 BasicCegarLoop]: Found error trace [2018-04-11 12:43:25,206 INFO L355 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2018-04-11 12:43:25,206 INFO L408 AbstractCegarLoop]: === Iteration 1 === [mainErr51RequiresViolation, mainErr26RequiresViolation, mainErr54RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr31RequiresViolation, mainErr46RequiresViolation, mainErr29RequiresViolation, mainErr58AssertViolationMEMORY_FREE, mainErr3RequiresViolation, mainErr15RequiresViolation, mainErr49RequiresViolation, mainErr63AssertViolationMEMORY_FREE, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr55RequiresViolation, mainErr17RequiresViolation, mainErr42RequiresViolation, mainErr30RequiresViolation, mainErr11RequiresViolation, mainErr57RequiresViolation, mainErr24RequiresViolation, mainErr44RequiresViolation, mainErr10RequiresViolation, mainErr43RequiresViolation, mainErr4RequiresViolation, mainErr50RequiresViolation, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr59AssertViolationMEMORY_FREE, mainErr36RequiresViolation, mainErr61RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr56RequiresViolation, mainErr62AssertViolationMEMORY_FREE, mainErr64EnsuresViolationMEMORY_LEAK, mainErr48RequiresViolation, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr52RequiresViolation, mainErr45RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr60RequiresViolation, mainErr9RequiresViolation, mainErr53RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr34RequiresViolation, mainErr47RequiresViolation, mainErr14RequiresViolation, mainErr40RequiresViolation]=== [2018-04-11 12:43:25,209 INFO L82 PathProgramCache]: Analyzing trace with hash 424313087, now seen corresponding path program 1 times [2018-04-11 12:43:25,210 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-04-11 12:43:25,210 INFO L68 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-04-11 12:43:25,243 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 12:43:25,243 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-11 12:43:25,243 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 12:43:25,263 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-11 12:43:25,269 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-11 12:43:25,318 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:43:25,319 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-04-11 12:43:25,319 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-04-11 12:43:25,320 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-04-11 12:43:25,328 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-04-11 12:43:25,329 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-04-11 12:43:25,331 INFO L87 Difference]: Start difference. First operand 192 states. Second operand 4 states. [2018-04-11 12:43:25,522 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-11 12:43:25,522 INFO L93 Difference]: Finished difference Result 223 states and 235 transitions. [2018-04-11 12:43:25,522 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-04-11 12:43:25,523 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 8 [2018-04-11 12:43:25,524 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-11 12:43:25,534 INFO L225 Difference]: With dead ends: 223 [2018-04-11 12:43:25,534 INFO L226 Difference]: Without dead ends: 219 [2018-04-11 12:43:25,535 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:43:25,547 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 219 states. [2018-04-11 12:43:25,565 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 219 to 185. [2018-04-11 12:43:25,566 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 185 states. [2018-04-11 12:43:25,568 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 185 states to 185 states and 198 transitions. [2018-04-11 12:43:25,569 INFO L78 Accepts]: Start accepts. Automaton has 185 states and 198 transitions. Word has length 8 [2018-04-11 12:43:25,569 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-11 12:43:25,570 INFO L459 AbstractCegarLoop]: Abstraction has 185 states and 198 transitions. [2018-04-11 12:43:25,570 INFO L460 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-04-11 12:43:25,570 INFO L276 IsEmpty]: Start isEmpty. Operand 185 states and 198 transitions. [2018-04-11 12:43:25,570 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2018-04-11 12:43:25,570 INFO L347 BasicCegarLoop]: Found error trace [2018-04-11 12:43:25,570 INFO L355 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2018-04-11 12:43:25,570 INFO L408 AbstractCegarLoop]: === Iteration 2 === [mainErr51RequiresViolation, mainErr26RequiresViolation, mainErr54RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr31RequiresViolation, mainErr46RequiresViolation, mainErr29RequiresViolation, mainErr58AssertViolationMEMORY_FREE, mainErr3RequiresViolation, mainErr15RequiresViolation, mainErr49RequiresViolation, mainErr63AssertViolationMEMORY_FREE, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr55RequiresViolation, mainErr17RequiresViolation, mainErr42RequiresViolation, mainErr30RequiresViolation, mainErr11RequiresViolation, mainErr57RequiresViolation, mainErr24RequiresViolation, mainErr44RequiresViolation, mainErr10RequiresViolation, mainErr43RequiresViolation, mainErr4RequiresViolation, mainErr50RequiresViolation, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr59AssertViolationMEMORY_FREE, mainErr36RequiresViolation, mainErr61RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr56RequiresViolation, mainErr62AssertViolationMEMORY_FREE, mainErr64EnsuresViolationMEMORY_LEAK, mainErr48RequiresViolation, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr52RequiresViolation, mainErr45RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr60RequiresViolation, mainErr9RequiresViolation, mainErr53RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr34RequiresViolation, mainErr47RequiresViolation, mainErr14RequiresViolation, mainErr40RequiresViolation]=== [2018-04-11 12:43:25,570 INFO L82 PathProgramCache]: Analyzing trace with hash 424313088, now seen corresponding path program 1 times [2018-04-11 12:43:25,570 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-04-11 12:43:25,571 INFO L68 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-04-11 12:43:25,572 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 12:43:25,572 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-11 12:43:25,572 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 12:43:25,583 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-11 12:43:25,584 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-11 12:43:25,638 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:43:25,638 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-04-11 12:43:25,638 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-04-11 12:43:25,639 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-04-11 12:43:25,639 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-04-11 12:43:25,639 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-04-11 12:43:25,639 INFO L87 Difference]: Start difference. First operand 185 states and 198 transitions. Second operand 4 states. [2018-04-11 12:43:25,766 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-11 12:43:25,766 INFO L93 Difference]: Finished difference Result 212 states and 224 transitions. [2018-04-11 12:43:25,766 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-04-11 12:43:25,766 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 8 [2018-04-11 12:43:25,766 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-11 12:43:25,767 INFO L225 Difference]: With dead ends: 212 [2018-04-11 12:43:25,767 INFO L226 Difference]: Without dead ends: 212 [2018-04-11 12:43:25,768 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:43:25,768 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 212 states. [2018-04-11 12:43:25,772 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 212 to 199. [2018-04-11 12:43:25,772 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 199 states. [2018-04-11 12:43:25,774 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 199 states to 199 states and 219 transitions. [2018-04-11 12:43:25,774 INFO L78 Accepts]: Start accepts. Automaton has 199 states and 219 transitions. Word has length 8 [2018-04-11 12:43:25,774 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-11 12:43:25,774 INFO L459 AbstractCegarLoop]: Abstraction has 199 states and 219 transitions. [2018-04-11 12:43:25,774 INFO L460 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-04-11 12:43:25,774 INFO L276 IsEmpty]: Start isEmpty. Operand 199 states and 219 transitions. [2018-04-11 12:43:25,774 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2018-04-11 12:43:25,774 INFO L347 BasicCegarLoop]: Found error trace [2018-04-11 12:43:25,774 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:43:25,775 INFO L408 AbstractCegarLoop]: === Iteration 3 === [mainErr51RequiresViolation, mainErr26RequiresViolation, mainErr54RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr31RequiresViolation, mainErr46RequiresViolation, mainErr29RequiresViolation, mainErr58AssertViolationMEMORY_FREE, mainErr3RequiresViolation, mainErr15RequiresViolation, mainErr49RequiresViolation, mainErr63AssertViolationMEMORY_FREE, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr55RequiresViolation, mainErr17RequiresViolation, mainErr42RequiresViolation, mainErr30RequiresViolation, mainErr11RequiresViolation, mainErr57RequiresViolation, mainErr24RequiresViolation, mainErr44RequiresViolation, mainErr10RequiresViolation, mainErr43RequiresViolation, mainErr4RequiresViolation, mainErr50RequiresViolation, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr59AssertViolationMEMORY_FREE, mainErr36RequiresViolation, mainErr61RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr56RequiresViolation, mainErr62AssertViolationMEMORY_FREE, mainErr64EnsuresViolationMEMORY_LEAK, mainErr48RequiresViolation, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr52RequiresViolation, mainErr45RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr60RequiresViolation, mainErr9RequiresViolation, mainErr53RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr34RequiresViolation, mainErr47RequiresViolation, mainErr14RequiresViolation, mainErr40RequiresViolation]=== [2018-04-11 12:43:25,775 INFO L82 PathProgramCache]: Analyzing trace with hash -840809059, now seen corresponding path program 1 times [2018-04-11 12:43:25,775 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-04-11 12:43:25,775 INFO L68 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-04-11 12:43:25,776 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 12:43:25,776 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-11 12:43:25,776 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 12:43:25,784 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-11 12:43:25,785 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-11 12:43:25,814 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:43:25,814 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-04-11 12:43:25,814 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-04-11 12:43:25,815 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-04-11 12:43:25,815 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-04-11 12:43:25,815 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-04-11 12:43:25,815 INFO L87 Difference]: Start difference. First operand 199 states and 219 transitions. Second operand 5 states. [2018-04-11 12:43:26,091 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-11 12:43:26,091 INFO L93 Difference]: Finished difference Result 339 states and 368 transitions. [2018-04-11 12:43:26,093 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-04-11 12:43:26,093 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 17 [2018-04-11 12:43:26,093 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-11 12:43:26,095 INFO L225 Difference]: With dead ends: 339 [2018-04-11 12:43:26,095 INFO L226 Difference]: Without dead ends: 339 [2018-04-11 12:43:26,095 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:43:26,095 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 339 states. [2018-04-11 12:43:26,103 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 339 to 198. [2018-04-11 12:43:26,103 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 198 states. [2018-04-11 12:43:26,104 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 198 states to 198 states and 218 transitions. [2018-04-11 12:43:26,104 INFO L78 Accepts]: Start accepts. Automaton has 198 states and 218 transitions. Word has length 17 [2018-04-11 12:43:26,105 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-11 12:43:26,105 INFO L459 AbstractCegarLoop]: Abstraction has 198 states and 218 transitions. [2018-04-11 12:43:26,105 INFO L460 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-04-11 12:43:26,105 INFO L276 IsEmpty]: Start isEmpty. Operand 198 states and 218 transitions. [2018-04-11 12:43:26,105 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2018-04-11 12:43:26,105 INFO L347 BasicCegarLoop]: Found error trace [2018-04-11 12:43:26,105 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:43:26,105 INFO L408 AbstractCegarLoop]: === Iteration 4 === [mainErr51RequiresViolation, mainErr26RequiresViolation, mainErr54RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr31RequiresViolation, mainErr46RequiresViolation, mainErr29RequiresViolation, mainErr58AssertViolationMEMORY_FREE, mainErr3RequiresViolation, mainErr15RequiresViolation, mainErr49RequiresViolation, mainErr63AssertViolationMEMORY_FREE, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr55RequiresViolation, mainErr17RequiresViolation, mainErr42RequiresViolation, mainErr30RequiresViolation, mainErr11RequiresViolation, mainErr57RequiresViolation, mainErr24RequiresViolation, mainErr44RequiresViolation, mainErr10RequiresViolation, mainErr43RequiresViolation, mainErr4RequiresViolation, mainErr50RequiresViolation, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr59AssertViolationMEMORY_FREE, mainErr36RequiresViolation, mainErr61RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr56RequiresViolation, mainErr62AssertViolationMEMORY_FREE, mainErr64EnsuresViolationMEMORY_LEAK, mainErr48RequiresViolation, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr52RequiresViolation, mainErr45RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr60RequiresViolation, mainErr9RequiresViolation, mainErr53RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr34RequiresViolation, mainErr47RequiresViolation, mainErr14RequiresViolation, mainErr40RequiresViolation]=== [2018-04-11 12:43:26,106 INFO L82 PathProgramCache]: Analyzing trace with hash -840809058, now seen corresponding path program 1 times [2018-04-11 12:43:26,106 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-04-11 12:43:26,106 INFO L68 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-04-11 12:43:26,107 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 12:43:26,107 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-11 12:43:26,107 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 12:43:26,117 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-11 12:43:26,118 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-11 12:43:26,150 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:43:26,150 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-04-11 12:43:26,150 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-04-11 12:43:26,150 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-04-11 12:43:26,150 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-04-11 12:43:26,151 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-04-11 12:43:26,151 INFO L87 Difference]: Start difference. First operand 198 states and 218 transitions. Second operand 5 states. [2018-04-11 12:43:26,365 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-11 12:43:26,365 INFO L93 Difference]: Finished difference Result 370 states and 409 transitions. [2018-04-11 12:43:26,365 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-04-11 12:43:26,365 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 17 [2018-04-11 12:43:26,365 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-11 12:43:26,366 INFO L225 Difference]: With dead ends: 370 [2018-04-11 12:43:26,366 INFO L226 Difference]: Without dead ends: 370 [2018-04-11 12:43:26,366 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:43:26,367 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 370 states. [2018-04-11 12:43:26,376 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 370 to 197. [2018-04-11 12:43:26,377 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 197 states. [2018-04-11 12:43:26,378 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 197 states to 197 states and 217 transitions. [2018-04-11 12:43:26,378 INFO L78 Accepts]: Start accepts. Automaton has 197 states and 217 transitions. Word has length 17 [2018-04-11 12:43:26,378 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-11 12:43:26,378 INFO L459 AbstractCegarLoop]: Abstraction has 197 states and 217 transitions. [2018-04-11 12:43:26,378 INFO L460 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-04-11 12:43:26,378 INFO L276 IsEmpty]: Start isEmpty. Operand 197 states and 217 transitions. [2018-04-11 12:43:26,379 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2018-04-11 12:43:26,379 INFO L347 BasicCegarLoop]: Found error trace [2018-04-11 12:43:26,379 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:43:26,379 INFO L408 AbstractCegarLoop]: === Iteration 5 === [mainErr51RequiresViolation, mainErr26RequiresViolation, mainErr54RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr31RequiresViolation, mainErr46RequiresViolation, mainErr29RequiresViolation, mainErr58AssertViolationMEMORY_FREE, mainErr3RequiresViolation, mainErr15RequiresViolation, mainErr49RequiresViolation, mainErr63AssertViolationMEMORY_FREE, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr55RequiresViolation, mainErr17RequiresViolation, mainErr42RequiresViolation, mainErr30RequiresViolation, mainErr11RequiresViolation, mainErr57RequiresViolation, mainErr24RequiresViolation, mainErr44RequiresViolation, mainErr10RequiresViolation, mainErr43RequiresViolation, mainErr4RequiresViolation, mainErr50RequiresViolation, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr59AssertViolationMEMORY_FREE, mainErr36RequiresViolation, mainErr61RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr56RequiresViolation, mainErr62AssertViolationMEMORY_FREE, mainErr64EnsuresViolationMEMORY_LEAK, mainErr48RequiresViolation, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr52RequiresViolation, mainErr45RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr60RequiresViolation, mainErr9RequiresViolation, mainErr53RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr34RequiresViolation, mainErr47RequiresViolation, mainErr14RequiresViolation, mainErr40RequiresViolation]=== [2018-04-11 12:43:26,379 INFO L82 PathProgramCache]: Analyzing trace with hash -293392460, now seen corresponding path program 1 times [2018-04-11 12:43:26,379 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-04-11 12:43:26,379 INFO L68 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-04-11 12:43:26,381 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 12:43:26,381 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-11 12:43:26,381 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 12:43:26,396 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-11 12:43:26,397 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-11 12:43:26,473 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:43:26,473 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-04-11 12:43:26,473 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-04-11 12:43:26,474 INFO L442 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-04-11 12:43:26,474 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-04-11 12:43:26,474 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2018-04-11 12:43:26,474 INFO L87 Difference]: Start difference. First operand 197 states and 217 transitions. Second operand 8 states. [2018-04-11 12:43:26,872 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-11 12:43:26,873 INFO L93 Difference]: Finished difference Result 342 states and 369 transitions. [2018-04-11 12:43:26,873 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-04-11 12:43:26,873 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 20 [2018-04-11 12:43:26,873 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-11 12:43:26,874 INFO L225 Difference]: With dead ends: 342 [2018-04-11 12:43:26,875 INFO L226 Difference]: Without dead ends: 342 [2018-04-11 12:43:26,875 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:43:26,875 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 342 states. [2018-04-11 12:43:26,879 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 342 to 196. [2018-04-11 12:43:26,879 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 196 states. [2018-04-11 12:43:26,880 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 196 states to 196 states and 216 transitions. [2018-04-11 12:43:26,880 INFO L78 Accepts]: Start accepts. Automaton has 196 states and 216 transitions. Word has length 20 [2018-04-11 12:43:26,881 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-11 12:43:26,881 INFO L459 AbstractCegarLoop]: Abstraction has 196 states and 216 transitions. [2018-04-11 12:43:26,881 INFO L460 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-04-11 12:43:26,881 INFO L276 IsEmpty]: Start isEmpty. Operand 196 states and 216 transitions. [2018-04-11 12:43:26,882 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2018-04-11 12:43:26,882 INFO L347 BasicCegarLoop]: Found error trace [2018-04-11 12:43:26,882 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:43:26,882 INFO L408 AbstractCegarLoop]: === Iteration 6 === [mainErr51RequiresViolation, mainErr26RequiresViolation, mainErr54RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr31RequiresViolation, mainErr46RequiresViolation, mainErr29RequiresViolation, mainErr58AssertViolationMEMORY_FREE, mainErr3RequiresViolation, mainErr15RequiresViolation, mainErr49RequiresViolation, mainErr63AssertViolationMEMORY_FREE, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr55RequiresViolation, mainErr17RequiresViolation, mainErr42RequiresViolation, mainErr30RequiresViolation, mainErr11RequiresViolation, mainErr57RequiresViolation, mainErr24RequiresViolation, mainErr44RequiresViolation, mainErr10RequiresViolation, mainErr43RequiresViolation, mainErr4RequiresViolation, mainErr50RequiresViolation, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr59AssertViolationMEMORY_FREE, mainErr36RequiresViolation, mainErr61RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr56RequiresViolation, mainErr62AssertViolationMEMORY_FREE, mainErr64EnsuresViolationMEMORY_LEAK, mainErr48RequiresViolation, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr52RequiresViolation, mainErr45RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr60RequiresViolation, mainErr9RequiresViolation, mainErr53RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr34RequiresViolation, mainErr47RequiresViolation, mainErr14RequiresViolation, mainErr40RequiresViolation]=== [2018-04-11 12:43:26,883 INFO L82 PathProgramCache]: Analyzing trace with hash -293392459, now seen corresponding path program 1 times [2018-04-11 12:43:26,883 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-04-11 12:43:26,883 INFO L68 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-04-11 12:43:26,884 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 12:43:26,884 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-11 12:43:26,884 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 12:43:26,896 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-11 12:43:26,897 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-11 12:43:26,975 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:43:26,975 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-04-11 12:43:26,975 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-04-11 12:43:26,976 INFO L442 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-04-11 12:43:26,976 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-04-11 12:43:26,976 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2018-04-11 12:43:26,977 INFO L87 Difference]: Start difference. First operand 196 states and 216 transitions. Second operand 8 states. [2018-04-11 12:43:27,605 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-11 12:43:27,605 INFO L93 Difference]: Finished difference Result 344 states and 371 transitions. [2018-04-11 12:43:27,605 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-04-11 12:43:27,605 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 20 [2018-04-11 12:43:27,606 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-11 12:43:27,607 INFO L225 Difference]: With dead ends: 344 [2018-04-11 12:43:27,607 INFO L226 Difference]: Without dead ends: 344 [2018-04-11 12:43:27,607 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:43:27,608 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 344 states. [2018-04-11 12:43:27,611 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 344 to 195. [2018-04-11 12:43:27,611 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 195 states. [2018-04-11 12:43:27,612 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 195 states to 195 states and 215 transitions. [2018-04-11 12:43:27,612 INFO L78 Accepts]: Start accepts. Automaton has 195 states and 215 transitions. Word has length 20 [2018-04-11 12:43:27,612 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-11 12:43:27,612 INFO L459 AbstractCegarLoop]: Abstraction has 195 states and 215 transitions. [2018-04-11 12:43:27,612 INFO L460 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-04-11 12:43:27,612 INFO L276 IsEmpty]: Start isEmpty. Operand 195 states and 215 transitions. [2018-04-11 12:43:27,613 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2018-04-11 12:43:27,613 INFO L347 BasicCegarLoop]: Found error trace [2018-04-11 12:43:27,613 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:43:27,613 INFO L408 AbstractCegarLoop]: === Iteration 7 === [mainErr51RequiresViolation, mainErr26RequiresViolation, mainErr54RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr31RequiresViolation, mainErr46RequiresViolation, mainErr29RequiresViolation, mainErr58AssertViolationMEMORY_FREE, mainErr3RequiresViolation, mainErr15RequiresViolation, mainErr49RequiresViolation, mainErr63AssertViolationMEMORY_FREE, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr55RequiresViolation, mainErr17RequiresViolation, mainErr42RequiresViolation, mainErr30RequiresViolation, mainErr11RequiresViolation, mainErr57RequiresViolation, mainErr24RequiresViolation, mainErr44RequiresViolation, mainErr10RequiresViolation, mainErr43RequiresViolation, mainErr4RequiresViolation, mainErr50RequiresViolation, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr59AssertViolationMEMORY_FREE, mainErr36RequiresViolation, mainErr61RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr56RequiresViolation, mainErr62AssertViolationMEMORY_FREE, mainErr64EnsuresViolationMEMORY_LEAK, mainErr48RequiresViolation, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr52RequiresViolation, mainErr45RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr60RequiresViolation, mainErr9RequiresViolation, mainErr53RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr34RequiresViolation, mainErr47RequiresViolation, mainErr14RequiresViolation, mainErr40RequiresViolation]=== [2018-04-11 12:43:27,613 INFO L82 PathProgramCache]: Analyzing trace with hash 671159677, now seen corresponding path program 1 times [2018-04-11 12:43:27,613 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-04-11 12:43:27,614 INFO L68 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-04-11 12:43:27,615 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 12:43:27,615 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-11 12:43:27,615 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 12:43:27,622 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-11 12:43:27,623 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-11 12:43:27,653 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:43:27,653 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-04-11 12:43:27,653 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-04-11 12:43:27,654 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-04-11 12:43:27,654 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-04-11 12:43:27,654 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-04-11 12:43:27,654 INFO L87 Difference]: Start difference. First operand 195 states and 215 transitions. Second operand 5 states. [2018-04-11 12:43:27,742 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-11 12:43:27,742 INFO L93 Difference]: Finished difference Result 292 states and 318 transitions. [2018-04-11 12:43:27,742 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-04-11 12:43:27,742 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 26 [2018-04-11 12:43:27,743 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-11 12:43:27,743 INFO L225 Difference]: With dead ends: 292 [2018-04-11 12:43:27,743 INFO L226 Difference]: Without dead ends: 292 [2018-04-11 12:43:27,744 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:43:27,744 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 292 states. [2018-04-11 12:43:27,747 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 292 to 199. [2018-04-11 12:43:27,747 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 199 states. [2018-04-11 12:43:27,748 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 199 states to 199 states and 219 transitions. [2018-04-11 12:43:27,748 INFO L78 Accepts]: Start accepts. Automaton has 199 states and 219 transitions. Word has length 26 [2018-04-11 12:43:27,748 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-11 12:43:27,748 INFO L459 AbstractCegarLoop]: Abstraction has 199 states and 219 transitions. [2018-04-11 12:43:27,748 INFO L460 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-04-11 12:43:27,749 INFO L276 IsEmpty]: Start isEmpty. Operand 199 states and 219 transitions. [2018-04-11 12:43:27,749 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2018-04-11 12:43:27,749 INFO L347 BasicCegarLoop]: Found error trace [2018-04-11 12:43:27,749 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:43:27,749 INFO L408 AbstractCegarLoop]: === Iteration 8 === [mainErr51RequiresViolation, mainErr26RequiresViolation, mainErr54RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr31RequiresViolation, mainErr46RequiresViolation, mainErr29RequiresViolation, mainErr58AssertViolationMEMORY_FREE, mainErr3RequiresViolation, mainErr15RequiresViolation, mainErr49RequiresViolation, mainErr63AssertViolationMEMORY_FREE, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr55RequiresViolation, mainErr17RequiresViolation, mainErr42RequiresViolation, mainErr30RequiresViolation, mainErr11RequiresViolation, mainErr57RequiresViolation, mainErr24RequiresViolation, mainErr44RequiresViolation, mainErr10RequiresViolation, mainErr43RequiresViolation, mainErr4RequiresViolation, mainErr50RequiresViolation, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr59AssertViolationMEMORY_FREE, mainErr36RequiresViolation, mainErr61RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr56RequiresViolation, mainErr62AssertViolationMEMORY_FREE, mainErr64EnsuresViolationMEMORY_LEAK, mainErr48RequiresViolation, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr52RequiresViolation, mainErr45RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr60RequiresViolation, mainErr9RequiresViolation, mainErr53RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr34RequiresViolation, mainErr47RequiresViolation, mainErr14RequiresViolation, mainErr40RequiresViolation]=== [2018-04-11 12:43:27,750 INFO L82 PathProgramCache]: Analyzing trace with hash -903005022, now seen corresponding path program 1 times [2018-04-11 12:43:27,750 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-04-11 12:43:27,750 INFO L68 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-04-11 12:43:27,751 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 12:43:27,751 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-11 12:43:27,751 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 12:43:27,758 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-11 12:43:27,759 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-11 12:43:27,785 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:43:27,785 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-04-11 12:43:27,785 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-04-11 12:43:27,786 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-04-11 12:43:27,786 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-04-11 12:43:27,786 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-04-11 12:43:27,786 INFO L87 Difference]: Start difference. First operand 199 states and 219 transitions. Second operand 4 states. [2018-04-11 12:43:27,866 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-11 12:43:27,866 INFO L93 Difference]: Finished difference Result 203 states and 220 transitions. [2018-04-11 12:43:27,866 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-04-11 12:43:27,866 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 28 [2018-04-11 12:43:27,866 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-11 12:43:27,867 INFO L225 Difference]: With dead ends: 203 [2018-04-11 12:43:27,867 INFO L226 Difference]: Without dead ends: 203 [2018-04-11 12:43:27,867 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:43:27,867 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 203 states. [2018-04-11 12:43:27,868 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 203 to 191. [2018-04-11 12:43:27,869 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 191 states. [2018-04-11 12:43:27,869 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 191 states to 191 states and 211 transitions. [2018-04-11 12:43:27,869 INFO L78 Accepts]: Start accepts. Automaton has 191 states and 211 transitions. Word has length 28 [2018-04-11 12:43:27,869 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-11 12:43:27,869 INFO L459 AbstractCegarLoop]: Abstraction has 191 states and 211 transitions. [2018-04-11 12:43:27,869 INFO L460 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-04-11 12:43:27,869 INFO L276 IsEmpty]: Start isEmpty. Operand 191 states and 211 transitions. [2018-04-11 12:43:27,870 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2018-04-11 12:43:27,870 INFO L347 BasicCegarLoop]: Found error trace [2018-04-11 12:43:27,870 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:43:27,870 INFO L408 AbstractCegarLoop]: === Iteration 9 === [mainErr51RequiresViolation, mainErr26RequiresViolation, mainErr54RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr31RequiresViolation, mainErr46RequiresViolation, mainErr29RequiresViolation, mainErr58AssertViolationMEMORY_FREE, mainErr3RequiresViolation, mainErr15RequiresViolation, mainErr49RequiresViolation, mainErr63AssertViolationMEMORY_FREE, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr55RequiresViolation, mainErr17RequiresViolation, mainErr42RequiresViolation, mainErr30RequiresViolation, mainErr11RequiresViolation, mainErr57RequiresViolation, mainErr24RequiresViolation, mainErr44RequiresViolation, mainErr10RequiresViolation, mainErr43RequiresViolation, mainErr4RequiresViolation, mainErr50RequiresViolation, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr59AssertViolationMEMORY_FREE, mainErr36RequiresViolation, mainErr61RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr56RequiresViolation, mainErr62AssertViolationMEMORY_FREE, mainErr64EnsuresViolationMEMORY_LEAK, mainErr48RequiresViolation, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr52RequiresViolation, mainErr45RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr60RequiresViolation, mainErr9RequiresViolation, mainErr53RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr34RequiresViolation, mainErr47RequiresViolation, mainErr14RequiresViolation, mainErr40RequiresViolation]=== [2018-04-11 12:43:27,870 INFO L82 PathProgramCache]: Analyzing trace with hash -903005021, now seen corresponding path program 1 times [2018-04-11 12:43:27,870 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-04-11 12:43:27,870 INFO L68 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-04-11 12:43:27,871 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 12:43:27,871 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-11 12:43:27,871 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 12:43:27,876 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-11 12:43:27,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:43:27,933 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:43:27,933 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-04-11 12:43:27,933 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-04-11 12:43:27,933 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-04-11 12:43:27,933 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-04-11 12:43:27,934 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2018-04-11 12:43:27,934 INFO L87 Difference]: Start difference. First operand 191 states and 211 transitions. Second operand 7 states. [2018-04-11 12:43:28,124 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-11 12:43:28,124 INFO L93 Difference]: Finished difference Result 250 states and 267 transitions. [2018-04-11 12:43:28,124 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-04-11 12:43:28,124 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 28 [2018-04-11 12:43:28,124 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-11 12:43:28,125 INFO L225 Difference]: With dead ends: 250 [2018-04-11 12:43:28,125 INFO L226 Difference]: Without dead ends: 250 [2018-04-11 12:43:28,125 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:43:28,125 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 250 states. [2018-04-11 12:43:28,128 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 250 to 221. [2018-04-11 12:43:28,128 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 221 states. [2018-04-11 12:43:28,129 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 221 states to 221 states and 252 transitions. [2018-04-11 12:43:28,129 INFO L78 Accepts]: Start accepts. Automaton has 221 states and 252 transitions. Word has length 28 [2018-04-11 12:43:28,129 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-11 12:43:28,129 INFO L459 AbstractCegarLoop]: Abstraction has 221 states and 252 transitions. [2018-04-11 12:43:28,130 INFO L460 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-04-11 12:43:28,130 INFO L276 IsEmpty]: Start isEmpty. Operand 221 states and 252 transitions. [2018-04-11 12:43:28,130 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2018-04-11 12:43:28,130 INFO L347 BasicCegarLoop]: Found error trace [2018-04-11 12:43:28,130 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:43:28,131 INFO L408 AbstractCegarLoop]: === Iteration 10 === [mainErr51RequiresViolation, mainErr26RequiresViolation, mainErr54RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr31RequiresViolation, mainErr46RequiresViolation, mainErr29RequiresViolation, mainErr58AssertViolationMEMORY_FREE, mainErr3RequiresViolation, mainErr15RequiresViolation, mainErr49RequiresViolation, mainErr63AssertViolationMEMORY_FREE, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr55RequiresViolation, mainErr17RequiresViolation, mainErr42RequiresViolation, mainErr30RequiresViolation, mainErr11RequiresViolation, mainErr57RequiresViolation, mainErr24RequiresViolation, mainErr44RequiresViolation, mainErr10RequiresViolation, mainErr43RequiresViolation, mainErr4RequiresViolation, mainErr50RequiresViolation, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr59AssertViolationMEMORY_FREE, mainErr36RequiresViolation, mainErr61RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr56RequiresViolation, mainErr62AssertViolationMEMORY_FREE, mainErr64EnsuresViolationMEMORY_LEAK, mainErr48RequiresViolation, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr52RequiresViolation, mainErr45RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr60RequiresViolation, mainErr9RequiresViolation, mainErr53RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr34RequiresViolation, mainErr47RequiresViolation, mainErr14RequiresViolation, mainErr40RequiresViolation]=== [2018-04-11 12:43:28,131 INFO L82 PathProgramCache]: Analyzing trace with hash -2042365947, now seen corresponding path program 1 times [2018-04-11 12:43:28,131 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-04-11 12:43:28,131 INFO L68 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-04-11 12:43:28,132 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 12:43:28,132 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-11 12:43:28,132 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 12:43:28,140 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-11 12:43:28,141 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-11 12:43:28,169 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:43:28,169 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-04-11 12:43:28,169 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-04-11 12:43:28,170 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-04-11 12:43:28,170 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-04-11 12:43:28,170 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-04-11 12:43:28,170 INFO L87 Difference]: Start difference. First operand 221 states and 252 transitions. Second operand 6 states. [2018-04-11 12:43:28,340 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-11 12:43:28,340 INFO L93 Difference]: Finished difference Result 321 states and 369 transitions. [2018-04-11 12:43:28,340 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-04-11 12:43:28,340 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 31 [2018-04-11 12:43:28,340 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-11 12:43:28,341 INFO L225 Difference]: With dead ends: 321 [2018-04-11 12:43:28,341 INFO L226 Difference]: Without dead ends: 321 [2018-04-11 12:43:28,341 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:43:28,342 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 321 states. [2018-04-11 12:43:28,345 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 321 to 220. [2018-04-11 12:43:28,345 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 220 states. [2018-04-11 12:43:28,345 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 220 states to 220 states and 251 transitions. [2018-04-11 12:43:28,346 INFO L78 Accepts]: Start accepts. Automaton has 220 states and 251 transitions. Word has length 31 [2018-04-11 12:43:28,346 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-11 12:43:28,346 INFO L459 AbstractCegarLoop]: Abstraction has 220 states and 251 transitions. [2018-04-11 12:43:28,346 INFO L460 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-04-11 12:43:28,346 INFO L276 IsEmpty]: Start isEmpty. Operand 220 states and 251 transitions. [2018-04-11 12:43:28,347 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2018-04-11 12:43:28,347 INFO L347 BasicCegarLoop]: Found error trace [2018-04-11 12:43:28,347 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:43:28,347 INFO L408 AbstractCegarLoop]: === Iteration 11 === [mainErr51RequiresViolation, mainErr26RequiresViolation, mainErr54RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr31RequiresViolation, mainErr46RequiresViolation, mainErr29RequiresViolation, mainErr58AssertViolationMEMORY_FREE, mainErr3RequiresViolation, mainErr15RequiresViolation, mainErr49RequiresViolation, mainErr63AssertViolationMEMORY_FREE, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr55RequiresViolation, mainErr17RequiresViolation, mainErr42RequiresViolation, mainErr30RequiresViolation, mainErr11RequiresViolation, mainErr57RequiresViolation, mainErr24RequiresViolation, mainErr44RequiresViolation, mainErr10RequiresViolation, mainErr43RequiresViolation, mainErr4RequiresViolation, mainErr50RequiresViolation, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr59AssertViolationMEMORY_FREE, mainErr36RequiresViolation, mainErr61RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr56RequiresViolation, mainErr62AssertViolationMEMORY_FREE, mainErr64EnsuresViolationMEMORY_LEAK, mainErr48RequiresViolation, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr52RequiresViolation, mainErr45RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr60RequiresViolation, mainErr9RequiresViolation, mainErr53RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr34RequiresViolation, mainErr47RequiresViolation, mainErr14RequiresViolation, mainErr40RequiresViolation]=== [2018-04-11 12:43:28,347 INFO L82 PathProgramCache]: Analyzing trace with hash -2042365946, now seen corresponding path program 1 times [2018-04-11 12:43:28,347 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-04-11 12:43:28,347 INFO L68 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-04-11 12:43:28,348 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 12:43:28,348 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-11 12:43:28,349 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 12:43:28,356 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-11 12:43:28,357 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-11 12:43:28,411 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:43:28,412 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-04-11 12:43:28,412 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-04-11 12:43:28,412 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-04-11 12:43:28,412 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-04-11 12:43:28,412 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-04-11 12:43:28,413 INFO L87 Difference]: Start difference. First operand 220 states and 251 transitions. Second operand 6 states. [2018-04-11 12:43:28,629 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-11 12:43:28,629 INFO L93 Difference]: Finished difference Result 345 states and 401 transitions. [2018-04-11 12:43:28,629 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-04-11 12:43:28,629 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 31 [2018-04-11 12:43:28,629 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-11 12:43:28,630 INFO L225 Difference]: With dead ends: 345 [2018-04-11 12:43:28,630 INFO L226 Difference]: Without dead ends: 345 [2018-04-11 12:43:28,630 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:43:28,631 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 345 states. [2018-04-11 12:43:28,632 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 345 to 205. [2018-04-11 12:43:28,632 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 205 states. [2018-04-11 12:43:28,633 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 205 states to 205 states and 235 transitions. [2018-04-11 12:43:28,633 INFO L78 Accepts]: Start accepts. Automaton has 205 states and 235 transitions. Word has length 31 [2018-04-11 12:43:28,633 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-11 12:43:28,633 INFO L459 AbstractCegarLoop]: Abstraction has 205 states and 235 transitions. [2018-04-11 12:43:28,633 INFO L460 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-04-11 12:43:28,633 INFO L276 IsEmpty]: Start isEmpty. Operand 205 states and 235 transitions. [2018-04-11 12:43:28,634 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2018-04-11 12:43:28,634 INFO L347 BasicCegarLoop]: Found error trace [2018-04-11 12:43:28,634 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:43:28,634 INFO L408 AbstractCegarLoop]: === Iteration 12 === [mainErr51RequiresViolation, mainErr26RequiresViolation, mainErr54RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr31RequiresViolation, mainErr46RequiresViolation, mainErr29RequiresViolation, mainErr58AssertViolationMEMORY_FREE, mainErr3RequiresViolation, mainErr15RequiresViolation, mainErr49RequiresViolation, mainErr63AssertViolationMEMORY_FREE, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr55RequiresViolation, mainErr17RequiresViolation, mainErr42RequiresViolation, mainErr30RequiresViolation, mainErr11RequiresViolation, mainErr57RequiresViolation, mainErr24RequiresViolation, mainErr44RequiresViolation, mainErr10RequiresViolation, mainErr43RequiresViolation, mainErr4RequiresViolation, mainErr50RequiresViolation, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr59AssertViolationMEMORY_FREE, mainErr36RequiresViolation, mainErr61RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr56RequiresViolation, mainErr62AssertViolationMEMORY_FREE, mainErr64EnsuresViolationMEMORY_LEAK, mainErr48RequiresViolation, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr52RequiresViolation, mainErr45RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr60RequiresViolation, mainErr9RequiresViolation, mainErr53RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr34RequiresViolation, mainErr47RequiresViolation, mainErr14RequiresViolation, mainErr40RequiresViolation]=== [2018-04-11 12:43:28,634 INFO L82 PathProgramCache]: Analyzing trace with hash -1748046544, now seen corresponding path program 1 times [2018-04-11 12:43:28,634 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-04-11 12:43:28,634 INFO L68 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-04-11 12:43:28,635 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 12:43:28,635 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-11 12:43:28,635 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 12:43:28,640 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-11 12:43:28,640 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-11 12:43:28,669 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:43:28,670 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-04-11 12:43:28,670 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-04-11 12:43:28,670 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-04-11 12:43:28,670 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-04-11 12:43:28,670 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-04-11 12:43:28,670 INFO L87 Difference]: Start difference. First operand 205 states and 235 transitions. Second operand 5 states. [2018-04-11 12:43:28,764 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-11 12:43:28,765 INFO L93 Difference]: Finished difference Result 230 states and 246 transitions. [2018-04-11 12:43:28,765 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-04-11 12:43:28,765 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 36 [2018-04-11 12:43:28,765 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-11 12:43:28,766 INFO L225 Difference]: With dead ends: 230 [2018-04-11 12:43:28,766 INFO L226 Difference]: Without dead ends: 230 [2018-04-11 12:43:28,766 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:43:28,767 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 230 states. [2018-04-11 12:43:28,769 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 230 to 205. [2018-04-11 12:43:28,769 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 205 states. [2018-04-11 12:43:28,770 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 205 states to 205 states and 233 transitions. [2018-04-11 12:43:28,770 INFO L78 Accepts]: Start accepts. Automaton has 205 states and 233 transitions. Word has length 36 [2018-04-11 12:43:28,771 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-11 12:43:28,771 INFO L459 AbstractCegarLoop]: Abstraction has 205 states and 233 transitions. [2018-04-11 12:43:28,771 INFO L460 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-04-11 12:43:28,771 INFO L276 IsEmpty]: Start isEmpty. Operand 205 states and 233 transitions. [2018-04-11 12:43:28,772 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2018-04-11 12:43:28,772 INFO L347 BasicCegarLoop]: Found error trace [2018-04-11 12:43:28,772 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:43:28,772 INFO L408 AbstractCegarLoop]: === Iteration 13 === [mainErr51RequiresViolation, mainErr26RequiresViolation, mainErr54RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr31RequiresViolation, mainErr46RequiresViolation, mainErr29RequiresViolation, mainErr58AssertViolationMEMORY_FREE, mainErr3RequiresViolation, mainErr15RequiresViolation, mainErr49RequiresViolation, mainErr63AssertViolationMEMORY_FREE, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr55RequiresViolation, mainErr17RequiresViolation, mainErr42RequiresViolation, mainErr30RequiresViolation, mainErr11RequiresViolation, mainErr57RequiresViolation, mainErr24RequiresViolation, mainErr44RequiresViolation, mainErr10RequiresViolation, mainErr43RequiresViolation, mainErr4RequiresViolation, mainErr50RequiresViolation, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr59AssertViolationMEMORY_FREE, mainErr36RequiresViolation, mainErr61RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr56RequiresViolation, mainErr62AssertViolationMEMORY_FREE, mainErr64EnsuresViolationMEMORY_LEAK, mainErr48RequiresViolation, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr52RequiresViolation, mainErr45RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr60RequiresViolation, mainErr9RequiresViolation, mainErr53RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr34RequiresViolation, mainErr47RequiresViolation, mainErr14RequiresViolation, mainErr40RequiresViolation]=== [2018-04-11 12:43:28,772 INFO L82 PathProgramCache]: Analyzing trace with hash 1817891105, now seen corresponding path program 1 times [2018-04-11 12:43:28,772 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-04-11 12:43:28,772 INFO L68 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-04-11 12:43:28,773 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 12:43:28,774 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-11 12:43:28,774 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 12:43:28,781 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-11 12:43:28,782 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-11 12:43:28,863 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:43:28,863 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-04-11 12:43:28,863 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2018-04-11 12:43:28,864 INFO L442 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-04-11 12:43:28,864 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-04-11 12:43:28,864 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2018-04-11 12:43:28,864 INFO L87 Difference]: Start difference. First operand 205 states and 233 transitions. Second operand 8 states. [2018-04-11 12:43:29,130 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-11 12:43:29,130 INFO L93 Difference]: Finished difference Result 315 states and 351 transitions. [2018-04-11 12:43:29,130 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-04-11 12:43:29,130 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 42 [2018-04-11 12:43:29,131 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-11 12:43:29,131 INFO L225 Difference]: With dead ends: 315 [2018-04-11 12:43:29,131 INFO L226 Difference]: Without dead ends: 315 [2018-04-11 12:43:29,131 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 16 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=49, Invalid=133, Unknown=0, NotChecked=0, Total=182 [2018-04-11 12:43:29,132 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 315 states. [2018-04-11 12:43:29,134 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 315 to 221. [2018-04-11 12:43:29,134 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 221 states. [2018-04-11 12:43:29,135 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 221 states to 221 states and 250 transitions. [2018-04-11 12:43:29,135 INFO L78 Accepts]: Start accepts. Automaton has 221 states and 250 transitions. Word has length 42 [2018-04-11 12:43:29,135 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-11 12:43:29,135 INFO L459 AbstractCegarLoop]: Abstraction has 221 states and 250 transitions. [2018-04-11 12:43:29,135 INFO L460 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-04-11 12:43:29,135 INFO L276 IsEmpty]: Start isEmpty. Operand 221 states and 250 transitions. [2018-04-11 12:43:29,136 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2018-04-11 12:43:29,136 INFO L347 BasicCegarLoop]: Found error trace [2018-04-11 12:43:29,136 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:43:29,136 INFO L408 AbstractCegarLoop]: === Iteration 14 === [mainErr51RequiresViolation, mainErr26RequiresViolation, mainErr54RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr31RequiresViolation, mainErr46RequiresViolation, mainErr29RequiresViolation, mainErr58AssertViolationMEMORY_FREE, mainErr3RequiresViolation, mainErr15RequiresViolation, mainErr49RequiresViolation, mainErr63AssertViolationMEMORY_FREE, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr55RequiresViolation, mainErr17RequiresViolation, mainErr42RequiresViolation, mainErr30RequiresViolation, mainErr11RequiresViolation, mainErr57RequiresViolation, mainErr24RequiresViolation, mainErr44RequiresViolation, mainErr10RequiresViolation, mainErr43RequiresViolation, mainErr4RequiresViolation, mainErr50RequiresViolation, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr59AssertViolationMEMORY_FREE, mainErr36RequiresViolation, mainErr61RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr56RequiresViolation, mainErr62AssertViolationMEMORY_FREE, mainErr64EnsuresViolationMEMORY_LEAK, mainErr48RequiresViolation, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr52RequiresViolation, mainErr45RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr60RequiresViolation, mainErr9RequiresViolation, mainErr53RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr34RequiresViolation, mainErr47RequiresViolation, mainErr14RequiresViolation, mainErr40RequiresViolation]=== [2018-04-11 12:43:29,137 INFO L82 PathProgramCache]: Analyzing trace with hash -729312829, now seen corresponding path program 1 times [2018-04-11 12:43:29,137 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-04-11 12:43:29,137 INFO L68 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-04-11 12:43:29,138 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 12:43:29,138 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-11 12:43:29,138 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 12:43:29,146 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-11 12:43:29,147 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-11 12:43:29,219 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:43:29,220 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-04-11 12:43:29,220 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-04-11 12:43:29,220 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-04-11 12:43:29,220 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-04-11 12:43:29,220 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-04-11 12:43:29,220 INFO L87 Difference]: Start difference. First operand 221 states and 250 transitions. Second operand 5 states. [2018-04-11 12:43:29,432 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-11 12:43:29,432 INFO L93 Difference]: Finished difference Result 379 states and 434 transitions. [2018-04-11 12:43:29,432 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-04-11 12:43:29,432 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 43 [2018-04-11 12:43:29,433 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-11 12:43:29,434 INFO L225 Difference]: With dead ends: 379 [2018-04-11 12:43:29,434 INFO L226 Difference]: Without dead ends: 379 [2018-04-11 12:43:29,434 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:43:29,434 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 379 states. [2018-04-11 12:43:29,437 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 379 to 220. [2018-04-11 12:43:29,437 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 220 states. [2018-04-11 12:43:29,438 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 220 states to 220 states and 249 transitions. [2018-04-11 12:43:29,438 INFO L78 Accepts]: Start accepts. Automaton has 220 states and 249 transitions. Word has length 43 [2018-04-11 12:43:29,438 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-11 12:43:29,438 INFO L459 AbstractCegarLoop]: Abstraction has 220 states and 249 transitions. [2018-04-11 12:43:29,438 INFO L460 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-04-11 12:43:29,438 INFO L276 IsEmpty]: Start isEmpty. Operand 220 states and 249 transitions. [2018-04-11 12:43:29,440 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2018-04-11 12:43:29,440 INFO L347 BasicCegarLoop]: Found error trace [2018-04-11 12:43:29,440 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:43:29,440 INFO L408 AbstractCegarLoop]: === Iteration 15 === [mainErr51RequiresViolation, mainErr26RequiresViolation, mainErr54RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr31RequiresViolation, mainErr46RequiresViolation, mainErr29RequiresViolation, mainErr58AssertViolationMEMORY_FREE, mainErr3RequiresViolation, mainErr15RequiresViolation, mainErr49RequiresViolation, mainErr63AssertViolationMEMORY_FREE, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr55RequiresViolation, mainErr17RequiresViolation, mainErr42RequiresViolation, mainErr30RequiresViolation, mainErr11RequiresViolation, mainErr57RequiresViolation, mainErr24RequiresViolation, mainErr44RequiresViolation, mainErr10RequiresViolation, mainErr43RequiresViolation, mainErr4RequiresViolation, mainErr50RequiresViolation, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr59AssertViolationMEMORY_FREE, mainErr36RequiresViolation, mainErr61RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr56RequiresViolation, mainErr62AssertViolationMEMORY_FREE, mainErr64EnsuresViolationMEMORY_LEAK, mainErr48RequiresViolation, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr52RequiresViolation, mainErr45RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr60RequiresViolation, mainErr9RequiresViolation, mainErr53RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr34RequiresViolation, mainErr47RequiresViolation, mainErr14RequiresViolation, mainErr40RequiresViolation]=== [2018-04-11 12:43:29,440 INFO L82 PathProgramCache]: Analyzing trace with hash -729312830, now seen corresponding path program 1 times [2018-04-11 12:43:29,440 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-04-11 12:43:29,440 INFO L68 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-04-11 12:43:29,441 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 12:43:29,441 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-11 12:43:29,441 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 12:43:29,451 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-11 12:43:29,452 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-11 12:43:29,479 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-11 12:43:29,480 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-04-11 12:43:29,480 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-04-11 12:43:29,480 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-04-11 12:43:29,480 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-04-11 12:43:29,480 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-04-11 12:43:29,480 INFO L87 Difference]: Start difference. First operand 220 states and 249 transitions. Second operand 5 states. [2018-04-11 12:43:29,653 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-11 12:43:29,654 INFO L93 Difference]: Finished difference Result 343 states and 391 transitions. [2018-04-11 12:43:29,654 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-04-11 12:43:29,654 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 43 [2018-04-11 12:43:29,654 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-11 12:43:29,655 INFO L225 Difference]: With dead ends: 343 [2018-04-11 12:43:29,655 INFO L226 Difference]: Without dead ends: 343 [2018-04-11 12:43:29,655 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:43:29,655 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 343 states. [2018-04-11 12:43:29,658 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 343 to 219. [2018-04-11 12:43:29,658 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 219 states. [2018-04-11 12:43:29,658 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 219 states to 219 states and 248 transitions. [2018-04-11 12:43:29,663 INFO L78 Accepts]: Start accepts. Automaton has 219 states and 248 transitions. Word has length 43 [2018-04-11 12:43:29,663 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-11 12:43:29,663 INFO L459 AbstractCegarLoop]: Abstraction has 219 states and 248 transitions. [2018-04-11 12:43:29,663 INFO L460 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-04-11 12:43:29,663 INFO L276 IsEmpty]: Start isEmpty. Operand 219 states and 248 transitions. [2018-04-11 12:43:29,664 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2018-04-11 12:43:29,664 INFO L347 BasicCegarLoop]: Found error trace [2018-04-11 12:43:29,664 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:43:29,664 INFO L408 AbstractCegarLoop]: === Iteration 16 === [mainErr51RequiresViolation, mainErr26RequiresViolation, mainErr54RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr31RequiresViolation, mainErr46RequiresViolation, mainErr29RequiresViolation, mainErr58AssertViolationMEMORY_FREE, mainErr3RequiresViolation, mainErr15RequiresViolation, mainErr49RequiresViolation, mainErr63AssertViolationMEMORY_FREE, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr55RequiresViolation, mainErr17RequiresViolation, mainErr42RequiresViolation, mainErr30RequiresViolation, mainErr11RequiresViolation, mainErr57RequiresViolation, mainErr24RequiresViolation, mainErr44RequiresViolation, mainErr10RequiresViolation, mainErr43RequiresViolation, mainErr4RequiresViolation, mainErr50RequiresViolation, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr59AssertViolationMEMORY_FREE, mainErr36RequiresViolation, mainErr61RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr56RequiresViolation, mainErr62AssertViolationMEMORY_FREE, mainErr64EnsuresViolationMEMORY_LEAK, mainErr48RequiresViolation, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr52RequiresViolation, mainErr45RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr60RequiresViolation, mainErr9RequiresViolation, mainErr53RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr34RequiresViolation, mainErr47RequiresViolation, mainErr14RequiresViolation, mainErr40RequiresViolation]=== [2018-04-11 12:43:29,664 INFO L82 PathProgramCache]: Analyzing trace with hash -345024793, now seen corresponding path program 1 times [2018-04-11 12:43:29,664 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-04-11 12:43:29,664 INFO L68 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-04-11 12:43:29,665 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 12:43:29,665 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-11 12:43:29,665 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 12:43:29,673 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-11 12:43:29,674 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-11 12:43:29,751 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:43:29,751 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-04-11 12:43:29,751 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:43:29,761 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-11 12:43:29,784 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-11 12:43:29,791 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-11 12:43:29,853 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:43:29,856 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:43:29,856 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 12:43:29,859 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 12:43:29,868 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:43:29,870 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:43:29,870 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-04-11 12:43:29,872 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 12:43:29,877 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-04-11 12:43:29,878 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 2 variables, input treesize:29, output treesize:21 [2018-04-11 12:43:29,898 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:43:29,901 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 12:43:29,902 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:43:29,903 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 12:43:29,908 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 12:43:29,921 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:43:29,924 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 12:43:29,925 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:43:29,925 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-04-11 12:43:29,936 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 12:43:29,945 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-04-11 12:43:29,945 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 2 variables, input treesize:47, output treesize:39 [2018-04-11 12:43:29,993 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:43:29,995 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 12:43:29,996 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 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:43:29,996 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 12:43:29,999 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 12:43:30,009 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:43:30,013 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 12:43:30,014 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:43:30,014 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-04-11 12:43:30,016 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 12:43:30,022 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:43:30,022 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 4 variables, input treesize:53, output treesize:7 [2018-04-11 12:43:30,039 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:43:30,068 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-04-11 12:43:30,068 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 9] total 11 [2018-04-11 12:43:30,069 INFO L442 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-04-11 12:43:30,069 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-04-11 12:43:30,069 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=85, Unknown=0, NotChecked=0, Total=110 [2018-04-11 12:43:30,069 INFO L87 Difference]: Start difference. First operand 219 states and 248 transitions. Second operand 11 states. [2018-04-11 12:43:30,518 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-11 12:43:30,519 INFO L93 Difference]: Finished difference Result 362 states and 393 transitions. [2018-04-11 12:43:30,549 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2018-04-11 12:43:30,549 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 44 [2018-04-11 12:43:30,549 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-11 12:43:30,550 INFO L225 Difference]: With dead ends: 362 [2018-04-11 12:43:30,550 INFO L226 Difference]: Without dead ends: 362 [2018-04-11 12:43:30,550 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 64 GetRequests, 40 SyntacticMatches, 3 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 66 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=140, Invalid=366, Unknown=0, NotChecked=0, Total=506 [2018-04-11 12:43:30,551 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 362 states. [2018-04-11 12:43:30,554 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 362 to 256. [2018-04-11 12:43:30,555 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 256 states. [2018-04-11 12:43:30,555 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 256 states to 256 states and 297 transitions. [2018-04-11 12:43:30,556 INFO L78 Accepts]: Start accepts. Automaton has 256 states and 297 transitions. Word has length 44 [2018-04-11 12:43:30,556 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-11 12:43:30,556 INFO L459 AbstractCegarLoop]: Abstraction has 256 states and 297 transitions. [2018-04-11 12:43:30,556 INFO L460 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-04-11 12:43:30,556 INFO L276 IsEmpty]: Start isEmpty. Operand 256 states and 297 transitions. [2018-04-11 12:43:30,556 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2018-04-11 12:43:30,556 INFO L347 BasicCegarLoop]: Found error trace [2018-04-11 12:43:30,557 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:43:30,557 INFO L408 AbstractCegarLoop]: === Iteration 17 === [mainErr51RequiresViolation, mainErr26RequiresViolation, mainErr54RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr31RequiresViolation, mainErr46RequiresViolation, mainErr29RequiresViolation, mainErr58AssertViolationMEMORY_FREE, mainErr3RequiresViolation, mainErr15RequiresViolation, mainErr49RequiresViolation, mainErr63AssertViolationMEMORY_FREE, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr55RequiresViolation, mainErr17RequiresViolation, mainErr42RequiresViolation, mainErr30RequiresViolation, mainErr11RequiresViolation, mainErr57RequiresViolation, mainErr24RequiresViolation, mainErr44RequiresViolation, mainErr10RequiresViolation, mainErr43RequiresViolation, mainErr4RequiresViolation, mainErr50RequiresViolation, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr59AssertViolationMEMORY_FREE, mainErr36RequiresViolation, mainErr61RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr56RequiresViolation, mainErr62AssertViolationMEMORY_FREE, mainErr64EnsuresViolationMEMORY_LEAK, mainErr48RequiresViolation, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr52RequiresViolation, mainErr45RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr60RequiresViolation, mainErr9RequiresViolation, mainErr53RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr34RequiresViolation, mainErr47RequiresViolation, mainErr14RequiresViolation, mainErr40RequiresViolation]=== [2018-04-11 12:43:30,557 INFO L82 PathProgramCache]: Analyzing trace with hash 1281162052, now seen corresponding path program 1 times [2018-04-11 12:43:30,557 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-04-11 12:43:30,557 INFO L68 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-04-11 12:43:30,558 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 12:43:30,558 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-11 12:43:30,558 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 12:43:30,569 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-11 12:43:30,570 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-11 12:43:30,644 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:43:30,645 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-04-11 12:43:30,645 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-04-11 12:43:30,645 INFO L442 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-04-11 12:43:30,645 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-04-11 12:43:30,645 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2018-04-11 12:43:30,645 INFO L87 Difference]: Start difference. First operand 256 states and 297 transitions. Second operand 8 states. [2018-04-11 12:43:30,964 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-11 12:43:30,965 INFO L93 Difference]: Finished difference Result 273 states and 316 transitions. [2018-04-11 12:43:30,965 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-04-11 12:43:30,965 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 46 [2018-04-11 12:43:30,965 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-11 12:43:30,966 INFO L225 Difference]: With dead ends: 273 [2018-04-11 12:43:30,966 INFO L226 Difference]: Without dead ends: 273 [2018-04-11 12:43:30,966 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:43:30,966 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 273 states. [2018-04-11 12:43:30,969 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 273 to 255. [2018-04-11 12:43:30,969 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 255 states. [2018-04-11 12:43:30,970 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 255 states to 255 states and 296 transitions. [2018-04-11 12:43:30,970 INFO L78 Accepts]: Start accepts. Automaton has 255 states and 296 transitions. Word has length 46 [2018-04-11 12:43:30,970 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-11 12:43:30,970 INFO L459 AbstractCegarLoop]: Abstraction has 255 states and 296 transitions. [2018-04-11 12:43:30,970 INFO L460 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-04-11 12:43:30,970 INFO L276 IsEmpty]: Start isEmpty. Operand 255 states and 296 transitions. [2018-04-11 12:43:30,971 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2018-04-11 12:43:30,971 INFO L347 BasicCegarLoop]: Found error trace [2018-04-11 12:43:30,971 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:43:30,971 INFO L408 AbstractCegarLoop]: === Iteration 18 === [mainErr51RequiresViolation, mainErr26RequiresViolation, mainErr54RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr31RequiresViolation, mainErr46RequiresViolation, mainErr29RequiresViolation, mainErr58AssertViolationMEMORY_FREE, mainErr3RequiresViolation, mainErr15RequiresViolation, mainErr49RequiresViolation, mainErr63AssertViolationMEMORY_FREE, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr55RequiresViolation, mainErr17RequiresViolation, mainErr42RequiresViolation, mainErr30RequiresViolation, mainErr11RequiresViolation, mainErr57RequiresViolation, mainErr24RequiresViolation, mainErr44RequiresViolation, mainErr10RequiresViolation, mainErr43RequiresViolation, mainErr4RequiresViolation, mainErr50RequiresViolation, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr59AssertViolationMEMORY_FREE, mainErr36RequiresViolation, mainErr61RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr56RequiresViolation, mainErr62AssertViolationMEMORY_FREE, mainErr64EnsuresViolationMEMORY_LEAK, mainErr48RequiresViolation, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr52RequiresViolation, mainErr45RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr60RequiresViolation, mainErr9RequiresViolation, mainErr53RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr34RequiresViolation, mainErr47RequiresViolation, mainErr14RequiresViolation, mainErr40RequiresViolation]=== [2018-04-11 12:43:30,971 INFO L82 PathProgramCache]: Analyzing trace with hash 1281162053, now seen corresponding path program 1 times [2018-04-11 12:43:30,971 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-04-11 12:43:30,971 INFO L68 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-04-11 12:43:30,972 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 12:43:30,972 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-11 12:43:30,972 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 12:43:30,981 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-11 12:43:30,982 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-11 12:43:31,078 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:43:31,078 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-04-11 12:43:31,078 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-04-11 12:43:31,078 INFO L442 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-04-11 12:43:31,079 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-04-11 12:43:31,079 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2018-04-11 12:43:31,079 INFO L87 Difference]: Start difference. First operand 255 states and 296 transitions. Second operand 8 states. [2018-04-11 12:43:31,344 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-11 12:43:31,344 INFO L93 Difference]: Finished difference Result 272 states and 315 transitions. [2018-04-11 12:43:31,344 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-04-11 12:43:31,344 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 46 [2018-04-11 12:43:31,345 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-11 12:43:31,345 INFO L225 Difference]: With dead ends: 272 [2018-04-11 12:43:31,345 INFO L226 Difference]: Without dead ends: 272 [2018-04-11 12:43:31,345 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:43:31,346 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 272 states. [2018-04-11 12:43:31,347 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 272 to 254. [2018-04-11 12:43:31,347 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 254 states. [2018-04-11 12:43:31,348 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 254 states to 254 states and 295 transitions. [2018-04-11 12:43:31,348 INFO L78 Accepts]: Start accepts. Automaton has 254 states and 295 transitions. Word has length 46 [2018-04-11 12:43:31,348 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-11 12:43:31,348 INFO L459 AbstractCegarLoop]: Abstraction has 254 states and 295 transitions. [2018-04-11 12:43:31,348 INFO L460 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-04-11 12:43:31,348 INFO L276 IsEmpty]: Start isEmpty. Operand 254 states and 295 transitions. [2018-04-11 12:43:31,348 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2018-04-11 12:43:31,348 INFO L347 BasicCegarLoop]: Found error trace [2018-04-11 12:43:31,348 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:43:31,348 INFO L408 AbstractCegarLoop]: === Iteration 19 === [mainErr51RequiresViolation, mainErr26RequiresViolation, mainErr54RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr31RequiresViolation, mainErr46RequiresViolation, mainErr29RequiresViolation, mainErr58AssertViolationMEMORY_FREE, mainErr3RequiresViolation, mainErr15RequiresViolation, mainErr49RequiresViolation, mainErr63AssertViolationMEMORY_FREE, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr55RequiresViolation, mainErr17RequiresViolation, mainErr42RequiresViolation, mainErr30RequiresViolation, mainErr11RequiresViolation, mainErr57RequiresViolation, mainErr24RequiresViolation, mainErr44RequiresViolation, mainErr10RequiresViolation, mainErr43RequiresViolation, mainErr4RequiresViolation, mainErr50RequiresViolation, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr59AssertViolationMEMORY_FREE, mainErr36RequiresViolation, mainErr61RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr56RequiresViolation, mainErr62AssertViolationMEMORY_FREE, mainErr64EnsuresViolationMEMORY_LEAK, mainErr48RequiresViolation, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr52RequiresViolation, mainErr45RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr60RequiresViolation, mainErr9RequiresViolation, mainErr53RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr34RequiresViolation, mainErr47RequiresViolation, mainErr14RequiresViolation, mainErr40RequiresViolation]=== [2018-04-11 12:43:31,349 INFO L82 PathProgramCache]: Analyzing trace with hash 1091008626, now seen corresponding path program 1 times [2018-04-11 12:43:31,349 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-04-11 12:43:31,349 INFO L68 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-04-11 12:43:31,349 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 12:43:31,349 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-11 12:43:31,350 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 12:43:31,358 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-11 12:43:31,359 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-11 12:43:31,606 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:43:31,606 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-04-11 12:43:31,607 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [16] imperfect sequences [] total 16 [2018-04-11 12:43:31,607 INFO L442 AbstractCegarLoop]: Interpolant automaton has 17 states [2018-04-11 12:43:31,607 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2018-04-11 12:43:31,607 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=53, Invalid=219, Unknown=0, NotChecked=0, Total=272 [2018-04-11 12:43:31,607 INFO L87 Difference]: Start difference. First operand 254 states and 295 transitions. Second operand 17 states. [2018-04-11 12:43:32,765 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-11 12:43:32,765 INFO L93 Difference]: Finished difference Result 563 states and 613 transitions. [2018-04-11 12:43:32,765 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2018-04-11 12:43:32,765 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 47 [2018-04-11 12:43:32,765 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-11 12:43:32,768 INFO L225 Difference]: With dead ends: 563 [2018-04-11 12:43:32,768 INFO L226 Difference]: Without dead ends: 563 [2018-04-11 12:43:32,768 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 39 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 37 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 216 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=392, Invalid=1090, Unknown=0, NotChecked=0, Total=1482 [2018-04-11 12:43:32,769 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 563 states. [2018-04-11 12:43:32,774 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 563 to 260. [2018-04-11 12:43:32,774 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 260 states. [2018-04-11 12:43:32,775 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 260 states to 260 states and 300 transitions. [2018-04-11 12:43:32,775 INFO L78 Accepts]: Start accepts. Automaton has 260 states and 300 transitions. Word has length 47 [2018-04-11 12:43:32,775 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-11 12:43:32,775 INFO L459 AbstractCegarLoop]: Abstraction has 260 states and 300 transitions. [2018-04-11 12:43:32,775 INFO L460 AbstractCegarLoop]: Interpolant automaton has 17 states. [2018-04-11 12:43:32,775 INFO L276 IsEmpty]: Start isEmpty. Operand 260 states and 300 transitions. [2018-04-11 12:43:32,776 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2018-04-11 12:43:32,776 INFO L347 BasicCegarLoop]: Found error trace [2018-04-11 12:43:32,776 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:43:32,776 INFO L408 AbstractCegarLoop]: === Iteration 20 === [mainErr51RequiresViolation, mainErr26RequiresViolation, mainErr54RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr31RequiresViolation, mainErr46RequiresViolation, mainErr29RequiresViolation, mainErr58AssertViolationMEMORY_FREE, mainErr3RequiresViolation, mainErr15RequiresViolation, mainErr49RequiresViolation, mainErr63AssertViolationMEMORY_FREE, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr55RequiresViolation, mainErr17RequiresViolation, mainErr42RequiresViolation, mainErr30RequiresViolation, mainErr11RequiresViolation, mainErr57RequiresViolation, mainErr24RequiresViolation, mainErr44RequiresViolation, mainErr10RequiresViolation, mainErr43RequiresViolation, mainErr4RequiresViolation, mainErr50RequiresViolation, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr59AssertViolationMEMORY_FREE, mainErr36RequiresViolation, mainErr61RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr56RequiresViolation, mainErr62AssertViolationMEMORY_FREE, mainErr64EnsuresViolationMEMORY_LEAK, mainErr48RequiresViolation, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr52RequiresViolation, mainErr45RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr60RequiresViolation, mainErr9RequiresViolation, mainErr53RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr34RequiresViolation, mainErr47RequiresViolation, mainErr14RequiresViolation, mainErr40RequiresViolation]=== [2018-04-11 12:43:32,776 INFO L82 PathProgramCache]: Analyzing trace with hash 1091008627, now seen corresponding path program 1 times [2018-04-11 12:43:32,776 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-04-11 12:43:32,776 INFO L68 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-04-11 12:43:32,777 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 12:43:32,778 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-11 12:43:32,778 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 12:43:32,788 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-11 12:43:32,789 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-11 12:43:33,038 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:43:33,039 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-04-11 12:43:33,039 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [16] imperfect sequences [] total 16 [2018-04-11 12:43:33,039 INFO L442 AbstractCegarLoop]: Interpolant automaton has 17 states [2018-04-11 12:43:33,039 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2018-04-11 12:43:33,039 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=53, Invalid=219, Unknown=0, NotChecked=0, Total=272 [2018-04-11 12:43:33,039 INFO L87 Difference]: Start difference. First operand 260 states and 300 transitions. Second operand 17 states. [2018-04-11 12:43:34,280 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-11 12:43:34,280 INFO L93 Difference]: Finished difference Result 628 states and 680 transitions. [2018-04-11 12:43:34,280 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2018-04-11 12:43:34,280 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 47 [2018-04-11 12:43:34,280 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-11 12:43:34,281 INFO L225 Difference]: With dead ends: 628 [2018-04-11 12:43:34,281 INFO L226 Difference]: Without dead ends: 628 [2018-04-11 12:43:34,282 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 44 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 41 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 343 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=472, Invalid=1334, Unknown=0, NotChecked=0, Total=1806 [2018-04-11 12:43:34,282 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 628 states. [2018-04-11 12:43:34,286 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 628 to 267. [2018-04-11 12:43:34,287 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 267 states. [2018-04-11 12:43:34,287 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 267 states to 267 states and 306 transitions. [2018-04-11 12:43:34,287 INFO L78 Accepts]: Start accepts. Automaton has 267 states and 306 transitions. Word has length 47 [2018-04-11 12:43:34,287 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-11 12:43:34,288 INFO L459 AbstractCegarLoop]: Abstraction has 267 states and 306 transitions. [2018-04-11 12:43:34,288 INFO L460 AbstractCegarLoop]: Interpolant automaton has 17 states. [2018-04-11 12:43:34,288 INFO L276 IsEmpty]: Start isEmpty. Operand 267 states and 306 transitions. [2018-04-11 12:43:34,288 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2018-04-11 12:43:34,288 INFO L347 BasicCegarLoop]: Found error trace [2018-04-11 12:43:34,288 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:43:34,288 INFO L408 AbstractCegarLoop]: === Iteration 21 === [mainErr51RequiresViolation, mainErr26RequiresViolation, mainErr54RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr31RequiresViolation, mainErr46RequiresViolation, mainErr29RequiresViolation, mainErr58AssertViolationMEMORY_FREE, mainErr3RequiresViolation, mainErr15RequiresViolation, mainErr49RequiresViolation, mainErr63AssertViolationMEMORY_FREE, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr55RequiresViolation, mainErr17RequiresViolation, mainErr42RequiresViolation, mainErr30RequiresViolation, mainErr11RequiresViolation, mainErr57RequiresViolation, mainErr24RequiresViolation, mainErr44RequiresViolation, mainErr10RequiresViolation, mainErr43RequiresViolation, mainErr4RequiresViolation, mainErr50RequiresViolation, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr59AssertViolationMEMORY_FREE, mainErr36RequiresViolation, mainErr61RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr56RequiresViolation, mainErr62AssertViolationMEMORY_FREE, mainErr64EnsuresViolationMEMORY_LEAK, mainErr48RequiresViolation, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr52RequiresViolation, mainErr45RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr60RequiresViolation, mainErr9RequiresViolation, mainErr53RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr34RequiresViolation, mainErr47RequiresViolation, mainErr14RequiresViolation, mainErr40RequiresViolation]=== [2018-04-11 12:43:34,289 INFO L82 PathProgramCache]: Analyzing trace with hash 1441929363, now seen corresponding path program 1 times [2018-04-11 12:43:34,289 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-04-11 12:43:34,289 INFO L68 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-04-11 12:43:34,290 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 12:43:34,290 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-11 12:43:34,290 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 12:43:34,296 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-11 12:43:34,296 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-11 12:43:34,360 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:43:34,361 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-04-11 12:43:34,361 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-04-11 12:43:34,361 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-04-11 12:43:34,361 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-04-11 12:43:34,361 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2018-04-11 12:43:34,362 INFO L87 Difference]: Start difference. First operand 267 states and 306 transitions. Second operand 7 states. [2018-04-11 12:43:34,561 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-11 12:43:34,561 INFO L93 Difference]: Finished difference Result 287 states and 326 transitions. [2018-04-11 12:43:34,561 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-04-11 12:43:34,562 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 53 [2018-04-11 12:43:34,562 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-11 12:43:34,563 INFO L225 Difference]: With dead ends: 287 [2018-04-11 12:43:34,563 INFO L226 Difference]: Without dead ends: 287 [2018-04-11 12:43:34,563 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:43:34,563 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 287 states. [2018-04-11 12:43:34,566 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 287 to 279. [2018-04-11 12:43:34,566 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 279 states. [2018-04-11 12:43:34,567 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 279 states to 279 states and 318 transitions. [2018-04-11 12:43:34,567 INFO L78 Accepts]: Start accepts. Automaton has 279 states and 318 transitions. Word has length 53 [2018-04-11 12:43:34,567 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-11 12:43:34,567 INFO L459 AbstractCegarLoop]: Abstraction has 279 states and 318 transitions. [2018-04-11 12:43:34,567 INFO L460 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-04-11 12:43:34,567 INFO L276 IsEmpty]: Start isEmpty. Operand 279 states and 318 transitions. [2018-04-11 12:43:34,568 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2018-04-11 12:43:34,568 INFO L347 BasicCegarLoop]: Found error trace [2018-04-11 12:43:34,568 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-11 12:43:34,568 INFO L408 AbstractCegarLoop]: === Iteration 22 === [mainErr51RequiresViolation, mainErr26RequiresViolation, mainErr54RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr31RequiresViolation, mainErr46RequiresViolation, mainErr29RequiresViolation, mainErr58AssertViolationMEMORY_FREE, mainErr3RequiresViolation, mainErr15RequiresViolation, mainErr49RequiresViolation, mainErr63AssertViolationMEMORY_FREE, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr55RequiresViolation, mainErr17RequiresViolation, mainErr42RequiresViolation, mainErr30RequiresViolation, mainErr11RequiresViolation, mainErr57RequiresViolation, mainErr24RequiresViolation, mainErr44RequiresViolation, mainErr10RequiresViolation, mainErr43RequiresViolation, mainErr4RequiresViolation, mainErr50RequiresViolation, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr59AssertViolationMEMORY_FREE, mainErr36RequiresViolation, mainErr61RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr56RequiresViolation, mainErr62AssertViolationMEMORY_FREE, mainErr64EnsuresViolationMEMORY_LEAK, mainErr48RequiresViolation, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr52RequiresViolation, mainErr45RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr60RequiresViolation, mainErr9RequiresViolation, mainErr53RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr34RequiresViolation, mainErr47RequiresViolation, mainErr14RequiresViolation, mainErr40RequiresViolation]=== [2018-04-11 12:43:34,568 INFO L82 PathProgramCache]: Analyzing trace with hash 1874786911, now seen corresponding path program 1 times [2018-04-11 12:43:34,569 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-04-11 12:43:34,569 INFO L68 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-04-11 12:43:34,570 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 12:43:34,570 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-11 12:43:34,570 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 12:43:34,581 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-04-11 12:43:34,593 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-04-11 12:43:34,611 INFO L421 BasicCegarLoop]: Counterexample might be feasible [2018-04-11 12:43:34,640 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 11.04 12:43:34 BoogieIcfgContainer [2018-04-11 12:43:34,640 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-04-11 12:43:34,641 INFO L168 Benchmark]: Toolchain (without parser) took 10404.65 ms. Allocated memory was 397.9 MB in the beginning and 808.5 MB in the end (delta: 410.5 MB). Free memory was 332.7 MB in the beginning and 515.3 MB in the end (delta: -182.6 MB). Peak memory consumption was 227.9 MB. Max. memory is 5.3 GB. [2018-04-11 12:43:34,642 INFO L168 Benchmark]: CDTParser took 0.18 ms. Allocated memory is still 397.9 MB. Free memory is still 358.0 MB. There was no memory consumed. Max. memory is 5.3 GB. [2018-04-11 12:43:34,642 INFO L168 Benchmark]: CACSL2BoogieTranslator took 265.85 ms. Allocated memory is still 397.9 MB. Free memory was 330.7 MB in the beginning and 304.2 MB in the end (delta: 26.5 MB). Peak memory consumption was 26.5 MB. Max. memory is 5.3 GB. [2018-04-11 12:43:34,642 INFO L168 Benchmark]: Boogie Preprocessor took 48.50 ms. Allocated memory is still 397.9 MB. Free memory was 304.2 MB in the beginning and 300.2 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:43:34,643 INFO L168 Benchmark]: RCFGBuilder took 595.15 ms. Allocated memory was 397.9 MB in the beginning and 599.3 MB in the end (delta: 201.3 MB). Free memory was 300.2 MB in the beginning and 506.5 MB in the end (delta: -206.2 MB). Peak memory consumption was 24.7 MB. Max. memory is 5.3 GB. [2018-04-11 12:43:34,643 INFO L168 Benchmark]: TraceAbstraction took 9492.07 ms. Allocated memory was 599.3 MB in the beginning and 808.5 MB in the end (delta: 209.2 MB). Free memory was 506.5 MB in the beginning and 515.3 MB in the end (delta: -8.8 MB). Peak memory consumption was 200.4 MB. Max. memory is 5.3 GB. [2018-04-11 12:43:34,644 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.18 ms. Allocated memory is still 397.9 MB. Free memory is still 358.0 MB. There was no memory consumed. Max. memory is 5.3 GB. * CACSL2BoogieTranslator took 265.85 ms. Allocated memory is still 397.9 MB. Free memory was 330.7 MB in the beginning and 304.2 MB in the end (delta: 26.5 MB). Peak memory consumption was 26.5 MB. Max. memory is 5.3 GB. * Boogie Preprocessor took 48.50 ms. Allocated memory is still 397.9 MB. Free memory was 304.2 MB in the beginning and 300.2 MB in the end (delta: 4.0 MB). Peak memory consumption was 4.0 MB. Max. memory is 5.3 GB. * RCFGBuilder took 595.15 ms. Allocated memory was 397.9 MB in the beginning and 599.3 MB in the end (delta: 201.3 MB). Free memory was 300.2 MB in the beginning and 506.5 MB in the end (delta: -206.2 MB). Peak memory consumption was 24.7 MB. Max. memory is 5.3 GB. * TraceAbstraction took 9492.07 ms. Allocated memory was 599.3 MB in the beginning and 808.5 MB in the end (delta: 209.2 MB). Free memory was 506.5 MB in the beginning and 515.3 MB in the end (delta: -8.8 MB). Peak memory consumption was 200.4 MB. Max. memory is 5.3 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - CounterExampleResult [Line: 1029]: pointer dereference may fail pointer dereference may fail We found a FailurePath: [L991] EXPR, FCALL malloc(sizeof(SLL)) VAL [malloc(sizeof(SLL))={11:0}] [L991] SLL* list = malloc(sizeof(SLL)); VAL [list={11:0}, malloc(sizeof(SLL))={11:0}] [L992] FCALL list->next = ((void*)0) VAL [list={11:0}, malloc(sizeof(SLL))={11:0}] [L993] COND FALSE !(!(list != ((void*)0))) VAL [list={11:0}, malloc(sizeof(SLL))={11:0}] [L993] COND FALSE !(0) VAL [list={11:0}, malloc(sizeof(SLL))={11:0}] [L993] COND FALSE !(__VERIFIER_nondet_int()) [L993] EXPR, FCALL malloc(sizeof(SLL)) VAL [list={11:0}, malloc(sizeof(SLL))={9:0}, malloc(sizeof(SLL))={11:0}] [L993] FCALL list->inner = malloc(sizeof(SLL)) VAL [list={11:0}, malloc(sizeof(SLL))={9:0}, malloc(sizeof(SLL))={11:0}] [L993] EXPR, FCALL list->inner VAL [list={11:0}, list->inner={9:0}, malloc(sizeof(SLL))={9:0}, malloc(sizeof(SLL))={11:0}] [L993] FCALL list->inner->next = ((void*)0) VAL [list={11:0}, list->inner={9:0}, malloc(sizeof(SLL))={9:0}, malloc(sizeof(SLL))={11:0}] [L993] EXPR, FCALL list->inner VAL [list={11:0}, list->inner={9:0}, malloc(sizeof(SLL))={9:0}, malloc(sizeof(SLL))={11:0}] [L993] FCALL list->inner->inner = ((void*)0) VAL [list={11:0}, list->inner={9:0}, malloc(sizeof(SLL))={9:0}, malloc(sizeof(SLL))={11:0}] [L993] EXPR, FCALL list->inner VAL [list={11:0}, list->inner={9:0}, malloc(sizeof(SLL))={9:0}, malloc(sizeof(SLL))={11:0}] [L993] EXPR list->inner != ((void*)0) || list->inner == ((void*)0) VAL [list={11:0}, list->inner={9:0}, list->inner != ((void*)0) || list->inner == ((void*)0)=1, malloc(sizeof(SLL))={9:0}, malloc(sizeof(SLL))={11:0}] [L993] COND TRUE, EXPR list->inner != ((void*)0) || list->inner == ((void*)0) VAL [list={11:0}, list->inner={9:0}, list->inner != ((void*)0) || list->inner == ((void*)0)=1, malloc(sizeof(SLL))={9:0}, malloc(sizeof(SLL))={11:0}] [L993] COND FALSE !(!(list->inner != ((void*)0) || list->inner == ((void*)0))) [L993] COND FALSE !(0) VAL [list={11:0}, malloc(sizeof(SLL))={9:0}, malloc(sizeof(SLL))={11:0}] [L995] SLL* end = list; VAL [end={11:0}, list={11:0}, malloc(sizeof(SLL))={9:0}, malloc(sizeof(SLL))={11:0}] [L998] COND FALSE !(__VERIFIER_nondet_int()) [L1008] end = ((void*)0) [L1009] end = list VAL [end={11:0}, list={11:0}, malloc(sizeof(SLL))={9:0}, malloc(sizeof(SLL))={11:0}] [L1012] COND FALSE !(!(((void*)0) != end)) VAL [end={11:0}, list={11:0}, malloc(sizeof(SLL))={9:0}, malloc(sizeof(SLL))={11:0}] [L1012] COND FALSE !(0) VAL [end={11:0}, list={11:0}, malloc(sizeof(SLL))={9:0}, malloc(sizeof(SLL))={11:0}] [L1014] COND TRUE ((void*)0) != end [L1016] int len = 0; VAL [end={11:0}, len=0, list={11:0}, malloc(sizeof(SLL))={9:0}, malloc(sizeof(SLL))={11:0}] [L1017] EXPR, FCALL end->inner VAL [end={11:0}, end->inner={9:0}, len=0, list={11:0}, malloc(sizeof(SLL))={9:0}, malloc(sizeof(SLL))={11:0}] [L1017] SLL* inner = end->inner; [L1018] COND TRUE ((void*)0) != inner VAL [end={11:0}, inner={9:0}, len=0, list={11:0}, malloc(sizeof(SLL))={9:0}, malloc(sizeof(SLL))={11:0}] [L1020] COND TRUE len == 0 [L1021] len = 1 VAL [end={11:0}, inner={9:0}, len=1, list={11:0}, malloc(sizeof(SLL))={9:0}, malloc(sizeof(SLL))={11:0}] [L1024] COND FALSE !(!(((void*)0) != inner)) VAL [end={11:0}, inner={9:0}, len=1, list={11:0}, malloc(sizeof(SLL))={9:0}, malloc(sizeof(SLL))={11:0}] [L1024] COND FALSE !(0) VAL [end={11:0}, inner={9:0}, len=1, list={11:0}, malloc(sizeof(SLL))={9:0}, malloc(sizeof(SLL))={11:0}] [L1025] EXPR, FCALL inner->inner VAL [end={11:0}, inner={9:0}, inner->inner={0:0}, len=1, list={11:0}, malloc(sizeof(SLL))={9:0}, malloc(sizeof(SLL))={11:0}] [L1025] COND FALSE !(!(((void*)0) == inner->inner)) [L1025] COND FALSE !(0) VAL [end={11:0}, inner={9:0}, len=1, list={11:0}, malloc(sizeof(SLL))={9:0}, malloc(sizeof(SLL))={11:0}] [L1026] EXPR, FCALL inner->next VAL [end={11:0}, inner={9:0}, inner->next={0:0}, len=1, list={11:0}, malloc(sizeof(SLL))={9:0}, malloc(sizeof(SLL))={11:0}] [L1026] COND FALSE !(!(((void*)0) == inner->next)) [L1026] COND FALSE !(0) VAL [end={11:0}, inner={9:0}, len=1, list={11:0}, malloc(sizeof(SLL))={9:0}, malloc(sizeof(SLL))={11:0}] [L1027] EXPR, FCALL inner->inner VAL [end={11:0}, inner={9:0}, inner->inner={0:0}, len=1, list={11:0}, malloc(sizeof(SLL))={9:0}, malloc(sizeof(SLL))={11:0}] [L1027] inner = inner->inner [L1028] COND TRUE len == 1 VAL [end={11:0}, inner={0:0}, len=1, list={11:0}, malloc(sizeof(SLL))={9:0}, malloc(sizeof(SLL))={11:0}] [L1029] FCALL inner->inner - StatisticsResult: Ultimate Automizer benchmark data CFG has 3 procedures, 192 locations, 65 error locations. UNSAFE Result, 9.4s OverallTime, 22 OverallIterations, 2 TraceHistogramMax, 7.0s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 3575 SDtfs, 7781 SDslu, 11702 SDs, 0 SdLazy, 8430 SolverSat, 396 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 4.0s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 312 GetRequests, 74 SyntacticMatches, 7 SemanticMatches, 231 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 684 ImplicationChecksByTransitivity, 2.8s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=279occurred in iteration=21, 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, 21 MinimizatonAttempts, 2247 StatesRemovedByMinimization, 21 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.1s SatisfiabilityAnalysisTime, 1.7s InterpolantComputationTime, 782 NumberOfCodeBlocks, 782 NumberOfCodeBlocksAsserted, 23 NumberOfCheckSat, 703 ConstructedInterpolants, 0 QuantifiedInterpolants, 227593 SizeOfPredicates, 9 NumberOfNonLiveVariables, 137 ConjunctsInSsa, 20 ConjunctsInUnsatCore, 22 InterpolantComputations, 20 PerfectInterpolantSequences, 4/8 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be incorrect! Written .csv to /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/sll-01_false-unreach-call_false-valid-deref.i_svcomp-DerefFreeMemtrack-32bit-Automizer_Camel.epf_AutomizerC.xml/Csv-Benchmark-0-2018-04-11_12-43-34-650.csv Written .csv to /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/sll-01_false-unreach-call_false-valid-deref.i_svcomp-DerefFreeMemtrack-32bit-Automizer_Camel.epf_AutomizerC.xml/Csv-TraceAbstractionBenchmarks-0-2018-04-11_12-43-34-650.csv Received shutdown request...