java -Xmx6000000000 -jar ./plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data ./data --generate-csv --csv-dir ../../../releaseScripts/default/UAutomizer-linux/csv --cacsl2boogietranslator.bitprecise.bitfields false -tc ../../../trunk/examples/toolchains/AutomizerC.xml -s ../../../trunk/examples/settings/cade18-smtinterpol/svcomp-DerefFreeMemtrack-32bit-Automizer_SmtInterpol_Array.epf -i ../../../trunk/examples/svcomp/forester-heap/sll-simple-white-blue_true-unreach-call_false-valid-memtrack.i -------------------------------------------------------------------------------- This is Ultimate 0.1.23-666feb3-m [2018-04-11 14:28:38,352 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-04-11 14:28:38,353 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-04-11 14:28:38,365 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-04-11 14:28:38,365 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-04-11 14:28:38,366 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-04-11 14:28:38,366 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-04-11 14:28:38,368 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-04-11 14:28:38,370 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-04-11 14:28:38,370 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-04-11 14:28:38,371 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-04-11 14:28:38,371 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-04-11 14:28:38,372 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-04-11 14:28:38,373 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-04-11 14:28:38,374 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-04-11 14:28:38,375 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-04-11 14:28:38,377 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-04-11 14:28:38,378 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-04-11 14:28:38,379 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-04-11 14:28:38,380 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-04-11 14:28:38,382 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-04-11 14:28:38,382 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-04-11 14:28:38,382 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-04-11 14:28:38,383 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-04-11 14:28:38,384 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-04-11 14:28:38,385 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-04-11 14:28:38,385 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-04-11 14:28:38,385 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-04-11 14:28:38,386 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-04-11 14:28:38,386 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-04-11 14:28:38,387 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-04-11 14:28:38,387 INFO L98 SettingsManager]: Beginning loading settings from /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/cade18-smtinterpol/svcomp-DerefFreeMemtrack-32bit-Automizer_SmtInterpol_Array.epf [2018-04-11 14:28:38,406 INFO L110 SettingsManager]: Loading preferences was successful [2018-04-11 14:28:38,406 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-04-11 14:28:38,407 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-04-11 14:28:38,408 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-04-11 14:28:38,408 INFO L133 SettingsManager]: * Use SBE=true [2018-04-11 14:28:38,408 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-04-11 14:28:38,408 INFO L133 SettingsManager]: * sizeof long=4 [2018-04-11 14:28:38,408 INFO L133 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2018-04-11 14:28:38,408 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-04-11 14:28:38,408 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-04-11 14:28:38,408 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-04-11 14:28:38,408 INFO L133 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2018-04-11 14:28:38,408 INFO L133 SettingsManager]: * Bitprecise bitfields=true [2018-04-11 14:28:38,409 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-04-11 14:28:38,409 INFO L133 SettingsManager]: * sizeof long double=12 [2018-04-11 14:28:38,409 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-04-11 14:28:38,409 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-04-11 14:28:38,409 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-04-11 14:28:38,409 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-04-11 14:28:38,409 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-04-11 14:28:38,409 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-04-11 14:28:38,409 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=Craig_TreeInterpolation Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Bitprecise bitfields -> false [2018-04-11 14:28:38,435 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-04-11 14:28:38,443 INFO L266 ainManager$Toolchain]: [Toolchain 1]: Parser(s) successfully (re)initialized [2018-04-11 14:28:38,446 INFO L222 ainManager$Toolchain]: [Toolchain 1]: Toolchain data selected. [2018-04-11 14:28:38,447 INFO L271 PluginConnector]: Initializing CDTParser... [2018-04-11 14:28:38,447 INFO L276 PluginConnector]: CDTParser initialized [2018-04-11 14:28:38,448 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/forester-heap/sll-simple-white-blue_true-unreach-call_false-valid-memtrack.i [2018-04-11 14:28:38,727 INFO L225 CDTParser]: Created temporary CDT project at /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/data/FLAG9e68240f6 [2018-04-11 14:28:38,869 INFO L287 CDTParser]: IsIndexed: true [2018-04-11 14:28:38,870 INFO L288 CDTParser]: Found 1 translation units. [2018-04-11 14:28:38,870 INFO L168 CDTParser]: Scanning sll-simple-white-blue_true-unreach-call_false-valid-memtrack.i [2018-04-11 14:28:38,878 INFO L210 ultiparseSymbolTable]: Include resolver: [2018-04-11 14:28:38,878 INFO L215 ultiparseSymbolTable]: [2018-04-11 14:28:38,878 INFO L218 ultiparseSymbolTable]: Function table: [2018-04-11 14:28:38,878 INFO L221 ultiparseSymbolTable]: Function definition of null ('main') in sll-simple-white-blue_true-unreach-call_false-valid-memtrack.i [2018-04-11 14:28:38,879 INFO L227 ultiparseSymbolTable]: Global variable table: [2018-04-11 14:28:38,879 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fsll_simple_white_blue_true_unreach_call_false_valid_memtrack_i__pthread_rwlockattr_t in sll-simple-white-blue_true-unreach-call_false-valid-memtrack.i [2018-04-11 14:28:38,879 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fsll_simple_white_blue_true_unreach_call_false_valid_memtrack_i____gid_t in sll-simple-white-blue_true-unreach-call_false-valid-memtrack.i [2018-04-11 14:28:38,879 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fsll_simple_white_blue_true_unreach_call_false_valid_memtrack_i____uint16_t in sll-simple-white-blue_true-unreach-call_false-valid-memtrack.i [2018-04-11 14:28:38,879 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fsll_simple_white_blue_true_unreach_call_false_valid_memtrack_i__clock_t in sll-simple-white-blue_true-unreach-call_false-valid-memtrack.i [2018-04-11 14:28:38,879 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fsll_simple_white_blue_true_unreach_call_false_valid_memtrack_i__u_char in sll-simple-white-blue_true-unreach-call_false-valid-memtrack.i [2018-04-11 14:28:38,879 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fsll_simple_white_blue_true_unreach_call_false_valid_memtrack_i____int16_t in sll-simple-white-blue_true-unreach-call_false-valid-memtrack.i [2018-04-11 14:28:38,879 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fsll_simple_white_blue_true_unreach_call_false_valid_memtrack_i____u_long in sll-simple-white-blue_true-unreach-call_false-valid-memtrack.i [2018-04-11 14:28:38,880 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fsll_simple_white_blue_true_unreach_call_false_valid_memtrack_i__blkcnt_t in sll-simple-white-blue_true-unreach-call_false-valid-memtrack.i [2018-04-11 14:28:38,880 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fsll_simple_white_blue_true_unreach_call_false_valid_memtrack_i__daddr_t in sll-simple-white-blue_true-unreach-call_false-valid-memtrack.i [2018-04-11 14:28:38,880 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fsll_simple_white_blue_true_unreach_call_false_valid_memtrack_i____loff_t in sll-simple-white-blue_true-unreach-call_false-valid-memtrack.i [2018-04-11 14:28:38,880 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fsll_simple_white_blue_true_unreach_call_false_valid_memtrack_i__suseconds_t in sll-simple-white-blue_true-unreach-call_false-valid-memtrack.i [2018-04-11 14:28:38,880 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fsll_simple_white_blue_true_unreach_call_false_valid_memtrack_i__u_int32_t in sll-simple-white-blue_true-unreach-call_false-valid-memtrack.i [2018-04-11 14:28:38,880 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fsll_simple_white_blue_true_unreach_call_false_valid_memtrack_i____sigset_t in sll-simple-white-blue_true-unreach-call_false-valid-memtrack.i [2018-04-11 14:28:38,880 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fsll_simple_white_blue_true_unreach_call_false_valid_memtrack_i__fd_mask in sll-simple-white-blue_true-unreach-call_false-valid-memtrack.i [2018-04-11 14:28:38,880 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fsll_simple_white_blue_true_unreach_call_false_valid_memtrack_i__sigset_t in sll-simple-white-blue_true-unreach-call_false-valid-memtrack.i [2018-04-11 14:28:38,880 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fsll_simple_white_blue_true_unreach_call_false_valid_memtrack_i____ino_t in sll-simple-white-blue_true-unreach-call_false-valid-memtrack.i [2018-04-11 14:28:38,880 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fsll_simple_white_blue_true_unreach_call_false_valid_memtrack_i__pthread_spinlock_t in sll-simple-white-blue_true-unreach-call_false-valid-memtrack.i [2018-04-11 14:28:38,881 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fsll_simple_white_blue_true_unreach_call_false_valid_memtrack_i__SLL in sll-simple-white-blue_true-unreach-call_false-valid-memtrack.i [2018-04-11 14:28:38,881 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fsll_simple_white_blue_true_unreach_call_false_valid_memtrack_i____caddr_t in sll-simple-white-blue_true-unreach-call_false-valid-memtrack.i [2018-04-11 14:28:38,881 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fsll_simple_white_blue_true_unreach_call_false_valid_memtrack_i____off_t in sll-simple-white-blue_true-unreach-call_false-valid-memtrack.i [2018-04-11 14:28:38,881 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fsll_simple_white_blue_true_unreach_call_false_valid_memtrack_i____ino64_t in sll-simple-white-blue_true-unreach-call_false-valid-memtrack.i [2018-04-11 14:28:38,881 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fsll_simple_white_blue_true_unreach_call_false_valid_memtrack_i__u_long in sll-simple-white-blue_true-unreach-call_false-valid-memtrack.i [2018-04-11 14:28:38,881 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fsll_simple_white_blue_true_unreach_call_false_valid_memtrack_i____fsid_t in sll-simple-white-blue_true-unreach-call_false-valid-memtrack.i [2018-04-11 14:28:38,881 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fsll_simple_white_blue_true_unreach_call_false_valid_memtrack_i__ulong in sll-simple-white-blue_true-unreach-call_false-valid-memtrack.i [2018-04-11 14:28:38,881 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fsll_simple_white_blue_true_unreach_call_false_valid_memtrack_i____uint32_t in sll-simple-white-blue_true-unreach-call_false-valid-memtrack.i [2018-04-11 14:28:38,881 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fsll_simple_white_blue_true_unreach_call_false_valid_memtrack_i__uid_t in sll-simple-white-blue_true-unreach-call_false-valid-memtrack.i [2018-04-11 14:28:38,881 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fsll_simple_white_blue_true_unreach_call_false_valid_memtrack_i__fsblkcnt_t in sll-simple-white-blue_true-unreach-call_false-valid-memtrack.i [2018-04-11 14:28:38,882 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fsll_simple_white_blue_true_unreach_call_false_valid_memtrack_i__lldiv_t in sll-simple-white-blue_true-unreach-call_false-valid-memtrack.i [2018-04-11 14:28:38,882 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fsll_simple_white_blue_true_unreach_call_false_valid_memtrack_i__wchar_t in sll-simple-white-blue_true-unreach-call_false-valid-memtrack.i [2018-04-11 14:28:38,882 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fsll_simple_white_blue_true_unreach_call_false_valid_memtrack_i__int16_t in sll-simple-white-blue_true-unreach-call_false-valid-memtrack.i [2018-04-11 14:28:38,882 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fsll_simple_white_blue_true_unreach_call_false_valid_memtrack_i__blksize_t in sll-simple-white-blue_true-unreach-call_false-valid-memtrack.i [2018-04-11 14:28:38,882 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fsll_simple_white_blue_true_unreach_call_false_valid_memtrack_i____clockid_t in sll-simple-white-blue_true-unreach-call_false-valid-memtrack.i [2018-04-11 14:28:38,882 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fsll_simple_white_blue_true_unreach_call_false_valid_memtrack_i__clockid_t in sll-simple-white-blue_true-unreach-call_false-valid-memtrack.i [2018-04-11 14:28:38,882 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fsll_simple_white_blue_true_unreach_call_false_valid_memtrack_i____pthread_slist_t in sll-simple-white-blue_true-unreach-call_false-valid-memtrack.i [2018-04-11 14:28:38,882 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fsll_simple_white_blue_true_unreach_call_false_valid_memtrack_i____int32_t in sll-simple-white-blue_true-unreach-call_false-valid-memtrack.i [2018-04-11 14:28:38,882 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fsll_simple_white_blue_true_unreach_call_false_valid_memtrack_i____syscall_ulong_t in sll-simple-white-blue_true-unreach-call_false-valid-memtrack.i [2018-04-11 14:28:38,883 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fsll_simple_white_blue_true_unreach_call_false_valid_memtrack_i____sig_atomic_t in sll-simple-white-blue_true-unreach-call_false-valid-memtrack.i [2018-04-11 14:28:38,883 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fsll_simple_white_blue_true_unreach_call_false_valid_memtrack_i__div_t in sll-simple-white-blue_true-unreach-call_false-valid-memtrack.i [2018-04-11 14:28:38,883 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fsll_simple_white_blue_true_unreach_call_false_valid_memtrack_i__pthread_t in sll-simple-white-blue_true-unreach-call_false-valid-memtrack.i [2018-04-11 14:28:38,883 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fsll_simple_white_blue_true_unreach_call_false_valid_memtrack_i____id_t in sll-simple-white-blue_true-unreach-call_false-valid-memtrack.i [2018-04-11 14:28:38,883 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fsll_simple_white_blue_true_unreach_call_false_valid_memtrack_i____fd_mask in sll-simple-white-blue_true-unreach-call_false-valid-memtrack.i [2018-04-11 14:28:38,883 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fsll_simple_white_blue_true_unreach_call_false_valid_memtrack_i__quad_t in sll-simple-white-blue_true-unreach-call_false-valid-memtrack.i [2018-04-11 14:28:38,883 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fsll_simple_white_blue_true_unreach_call_false_valid_memtrack_i__u_int8_t in sll-simple-white-blue_true-unreach-call_false-valid-memtrack.i [2018-04-11 14:28:38,883 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fsll_simple_white_blue_true_unreach_call_false_valid_memtrack_i__u_int16_t in sll-simple-white-blue_true-unreach-call_false-valid-memtrack.i [2018-04-11 14:28:38,883 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fsll_simple_white_blue_true_unreach_call_false_valid_memtrack_i__pthread_cond_t in sll-simple-white-blue_true-unreach-call_false-valid-memtrack.i [2018-04-11 14:28:38,884 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fsll_simple_white_blue_true_unreach_call_false_valid_memtrack_i____fsblkcnt64_t in sll-simple-white-blue_true-unreach-call_false-valid-memtrack.i [2018-04-11 14:28:38,884 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fsll_simple_white_blue_true_unreach_call_false_valid_memtrack_i____pid_t in sll-simple-white-blue_true-unreach-call_false-valid-memtrack.i [2018-04-11 14:28:38,884 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fsll_simple_white_blue_true_unreach_call_false_valid_memtrack_i____rlim_t in sll-simple-white-blue_true-unreach-call_false-valid-memtrack.i [2018-04-11 14:28:38,884 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fsll_simple_white_blue_true_unreach_call_false_valid_memtrack_i____timer_t in sll-simple-white-blue_true-unreach-call_false-valid-memtrack.i [2018-04-11 14:28:38,884 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fsll_simple_white_blue_true_unreach_call_false_valid_memtrack_i__pthread_mutexattr_t in sll-simple-white-blue_true-unreach-call_false-valid-memtrack.i [2018-04-11 14:28:38,884 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fsll_simple_white_blue_true_unreach_call_false_valid_memtrack_i__pthread_attr_t in sll-simple-white-blue_true-unreach-call_false-valid-memtrack.i [2018-04-11 14:28:38,884 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fsll_simple_white_blue_true_unreach_call_false_valid_memtrack_i__u_int in sll-simple-white-blue_true-unreach-call_false-valid-memtrack.i [2018-04-11 14:28:38,884 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fsll_simple_white_blue_true_unreach_call_false_valid_memtrack_i____u_char in sll-simple-white-blue_true-unreach-call_false-valid-memtrack.i [2018-04-11 14:28:38,884 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fsll_simple_white_blue_true_unreach_call_false_valid_memtrack_i____u_quad_t in sll-simple-white-blue_true-unreach-call_false-valid-memtrack.i [2018-04-11 14:28:38,884 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fsll_simple_white_blue_true_unreach_call_false_valid_memtrack_i__pthread_barrier_t in sll-simple-white-blue_true-unreach-call_false-valid-memtrack.i [2018-04-11 14:28:38,885 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fsll_simple_white_blue_true_unreach_call_false_valid_memtrack_i____quad_t in sll-simple-white-blue_true-unreach-call_false-valid-memtrack.i [2018-04-11 14:28:38,885 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fsll_simple_white_blue_true_unreach_call_false_valid_memtrack_i____off64_t in sll-simple-white-blue_true-unreach-call_false-valid-memtrack.i [2018-04-11 14:28:38,885 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fsll_simple_white_blue_true_unreach_call_false_valid_memtrack_i____suseconds_t in sll-simple-white-blue_true-unreach-call_false-valid-memtrack.i [2018-04-11 14:28:38,885 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fsll_simple_white_blue_true_unreach_call_false_valid_memtrack_i____fsfilcnt64_t in sll-simple-white-blue_true-unreach-call_false-valid-memtrack.i [2018-04-11 14:28:38,885 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fsll_simple_white_blue_true_unreach_call_false_valid_memtrack_i__u_int64_t in sll-simple-white-blue_true-unreach-call_false-valid-memtrack.i [2018-04-11 14:28:38,885 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fsll_simple_white_blue_true_unreach_call_false_valid_memtrack_i____blkcnt64_t in sll-simple-white-blue_true-unreach-call_false-valid-memtrack.i [2018-04-11 14:28:38,885 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fsll_simple_white_blue_true_unreach_call_false_valid_memtrack_i__pid_t in sll-simple-white-blue_true-unreach-call_false-valid-memtrack.i [2018-04-11 14:28:38,885 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fsll_simple_white_blue_true_unreach_call_false_valid_memtrack_i__ldiv_t in sll-simple-white-blue_true-unreach-call_false-valid-memtrack.i [2018-04-11 14:28:38,885 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fsll_simple_white_blue_true_unreach_call_false_valid_memtrack_i__ino_t in sll-simple-white-blue_true-unreach-call_false-valid-memtrack.i [2018-04-11 14:28:38,885 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fsll_simple_white_blue_true_unreach_call_false_valid_memtrack_i__fsfilcnt_t in sll-simple-white-blue_true-unreach-call_false-valid-memtrack.i [2018-04-11 14:28:38,886 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fsll_simple_white_blue_true_unreach_call_false_valid_memtrack_i____ssize_t in sll-simple-white-blue_true-unreach-call_false-valid-memtrack.i [2018-04-11 14:28:38,886 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fsll_simple_white_blue_true_unreach_call_false_valid_memtrack_i____socklen_t in sll-simple-white-blue_true-unreach-call_false-valid-memtrack.i [2018-04-11 14:28:38,886 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fsll_simple_white_blue_true_unreach_call_false_valid_memtrack_i____mode_t in sll-simple-white-blue_true-unreach-call_false-valid-memtrack.i [2018-04-11 14:28:38,886 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fsll_simple_white_blue_true_unreach_call_false_valid_memtrack_i__int32_t in sll-simple-white-blue_true-unreach-call_false-valid-memtrack.i [2018-04-11 14:28:38,886 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fsll_simple_white_blue_true_unreach_call_false_valid_memtrack_i__idtype_t in sll-simple-white-blue_true-unreach-call_false-valid-memtrack.i [2018-04-11 14:28:38,886 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fsll_simple_white_blue_true_unreach_call_false_valid_memtrack_i____int8_t in sll-simple-white-blue_true-unreach-call_false-valid-memtrack.i [2018-04-11 14:28:38,886 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fsll_simple_white_blue_true_unreach_call_false_valid_memtrack_i____nlink_t in sll-simple-white-blue_true-unreach-call_false-valid-memtrack.i [2018-04-11 14:28:38,886 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fsll_simple_white_blue_true_unreach_call_false_valid_memtrack_i____intptr_t in sll-simple-white-blue_true-unreach-call_false-valid-memtrack.i [2018-04-11 14:28:38,886 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fsll_simple_white_blue_true_unreach_call_false_valid_memtrack_i__timer_t in sll-simple-white-blue_true-unreach-call_false-valid-memtrack.i [2018-04-11 14:28:38,886 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fsll_simple_white_blue_true_unreach_call_false_valid_memtrack_i__size_t in sll-simple-white-blue_true-unreach-call_false-valid-memtrack.i [2018-04-11 14:28:38,887 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fsll_simple_white_blue_true_unreach_call_false_valid_memtrack_i__off_t in sll-simple-white-blue_true-unreach-call_false-valid-memtrack.i [2018-04-11 14:28:38,887 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fsll_simple_white_blue_true_unreach_call_false_valid_memtrack_i__key_t in sll-simple-white-blue_true-unreach-call_false-valid-memtrack.i [2018-04-11 14:28:38,887 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fsll_simple_white_blue_true_unreach_call_false_valid_memtrack_i____uint64_t in sll-simple-white-blue_true-unreach-call_false-valid-memtrack.i [2018-04-11 14:28:38,887 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fsll_simple_white_blue_true_unreach_call_false_valid_memtrack_i__pthread_once_t in sll-simple-white-blue_true-unreach-call_false-valid-memtrack.i [2018-04-11 14:28:38,887 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fsll_simple_white_blue_true_unreach_call_false_valid_memtrack_i____fsword_t in sll-simple-white-blue_true-unreach-call_false-valid-memtrack.i [2018-04-11 14:28:38,887 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fsll_simple_white_blue_true_unreach_call_false_valid_memtrack_i__caddr_t in sll-simple-white-blue_true-unreach-call_false-valid-memtrack.i [2018-04-11 14:28:38,887 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fsll_simple_white_blue_true_unreach_call_false_valid_memtrack_i__mode_t in sll-simple-white-blue_true-unreach-call_false-valid-memtrack.i [2018-04-11 14:28:38,887 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fsll_simple_white_blue_true_unreach_call_false_valid_memtrack_i____u_short in sll-simple-white-blue_true-unreach-call_false-valid-memtrack.i [2018-04-11 14:28:38,887 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fsll_simple_white_blue_true_unreach_call_false_valid_memtrack_i__nlink_t in sll-simple-white-blue_true-unreach-call_false-valid-memtrack.i [2018-04-11 14:28:38,887 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fsll_simple_white_blue_true_unreach_call_false_valid_memtrack_i__u_short in sll-simple-white-blue_true-unreach-call_false-valid-memtrack.i [2018-04-11 14:28:38,887 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fsll_simple_white_blue_true_unreach_call_false_valid_memtrack_i____uid_t in sll-simple-white-blue_true-unreach-call_false-valid-memtrack.i [2018-04-11 14:28:38,887 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fsll_simple_white_blue_true_unreach_call_false_valid_memtrack_i__gid_t in sll-simple-white-blue_true-unreach-call_false-valid-memtrack.i [2018-04-11 14:28:38,888 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fsll_simple_white_blue_true_unreach_call_false_valid_memtrack_i__ssize_t in sll-simple-white-blue_true-unreach-call_false-valid-memtrack.i [2018-04-11 14:28:38,888 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fsll_simple_white_blue_true_unreach_call_false_valid_memtrack_i__uint in sll-simple-white-blue_true-unreach-call_false-valid-memtrack.i [2018-04-11 14:28:38,888 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fsll_simple_white_blue_true_unreach_call_false_valid_memtrack_i__loff_t in sll-simple-white-blue_true-unreach-call_false-valid-memtrack.i [2018-04-11 14:28:38,888 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fsll_simple_white_blue_true_unreach_call_false_valid_memtrack_i____useconds_t in sll-simple-white-blue_true-unreach-call_false-valid-memtrack.i [2018-04-11 14:28:38,888 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fsll_simple_white_blue_true_unreach_call_false_valid_memtrack_i__fd_set in sll-simple-white-blue_true-unreach-call_false-valid-memtrack.i [2018-04-11 14:28:38,888 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fsll_simple_white_blue_true_unreach_call_false_valid_memtrack_i__pthread_condattr_t in sll-simple-white-blue_true-unreach-call_false-valid-memtrack.i [2018-04-11 14:28:38,888 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fsll_simple_white_blue_true_unreach_call_false_valid_memtrack_i__dev_t in sll-simple-white-blue_true-unreach-call_false-valid-memtrack.i [2018-04-11 14:28:38,888 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fsll_simple_white_blue_true_unreach_call_false_valid_memtrack_i____rlim64_t in sll-simple-white-blue_true-unreach-call_false-valid-memtrack.i [2018-04-11 14:28:38,888 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fsll_simple_white_blue_true_unreach_call_false_valid_memtrack_i____blksize_t in sll-simple-white-blue_true-unreach-call_false-valid-memtrack.i [2018-04-11 14:28:38,888 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fsll_simple_white_blue_true_unreach_call_false_valid_memtrack_i__id_t in sll-simple-white-blue_true-unreach-call_false-valid-memtrack.i [2018-04-11 14:28:38,888 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fsll_simple_white_blue_true_unreach_call_false_valid_memtrack_i____qaddr_t in sll-simple-white-blue_true-unreach-call_false-valid-memtrack.i [2018-04-11 14:28:38,888 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fsll_simple_white_blue_true_unreach_call_false_valid_memtrack_i____clock_t in sll-simple-white-blue_true-unreach-call_false-valid-memtrack.i [2018-04-11 14:28:38,888 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fsll_simple_white_blue_true_unreach_call_false_valid_memtrack_i__pthread_key_t in sll-simple-white-blue_true-unreach-call_false-valid-memtrack.i [2018-04-11 14:28:38,888 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fsll_simple_white_blue_true_unreach_call_false_valid_memtrack_i____dev_t in sll-simple-white-blue_true-unreach-call_false-valid-memtrack.i [2018-04-11 14:28:38,888 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fsll_simple_white_blue_true_unreach_call_false_valid_memtrack_i____fsblkcnt_t in sll-simple-white-blue_true-unreach-call_false-valid-memtrack.i [2018-04-11 14:28:38,888 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fsll_simple_white_blue_true_unreach_call_false_valid_memtrack_i__fsid_t in sll-simple-white-blue_true-unreach-call_false-valid-memtrack.i [2018-04-11 14:28:38,888 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fsll_simple_white_blue_true_unreach_call_false_valid_memtrack_i____u_int in sll-simple-white-blue_true-unreach-call_false-valid-memtrack.i [2018-04-11 14:28:38,889 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fsll_simple_white_blue_true_unreach_call_false_valid_memtrack_i____blkcnt_t in sll-simple-white-blue_true-unreach-call_false-valid-memtrack.i [2018-04-11 14:28:38,889 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fsll_simple_white_blue_true_unreach_call_false_valid_memtrack_i__time_t in sll-simple-white-blue_true-unreach-call_false-valid-memtrack.i [2018-04-11 14:28:38,889 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fsll_simple_white_blue_true_unreach_call_false_valid_memtrack_i__pthread_rwlock_t in sll-simple-white-blue_true-unreach-call_false-valid-memtrack.i [2018-04-11 14:28:38,889 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fsll_simple_white_blue_true_unreach_call_false_valid_memtrack_i__pthread_mutex_t in sll-simple-white-blue_true-unreach-call_false-valid-memtrack.i [2018-04-11 14:28:38,889 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fsll_simple_white_blue_true_unreach_call_false_valid_memtrack_i____fsfilcnt_t in sll-simple-white-blue_true-unreach-call_false-valid-memtrack.i [2018-04-11 14:28:38,889 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fsll_simple_white_blue_true_unreach_call_false_valid_memtrack_i____syscall_slong_t in sll-simple-white-blue_true-unreach-call_false-valid-memtrack.i [2018-04-11 14:28:38,889 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fsll_simple_white_blue_true_unreach_call_false_valid_memtrack_i__pthread_barrierattr_t in sll-simple-white-blue_true-unreach-call_false-valid-memtrack.i [2018-04-11 14:28:38,889 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fsll_simple_white_blue_true_unreach_call_false_valid_memtrack_i__register_t in sll-simple-white-blue_true-unreach-call_false-valid-memtrack.i [2018-04-11 14:28:38,889 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fsll_simple_white_blue_true_unreach_call_false_valid_memtrack_i__int64_t in sll-simple-white-blue_true-unreach-call_false-valid-memtrack.i [2018-04-11 14:28:38,889 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fsll_simple_white_blue_true_unreach_call_false_valid_memtrack_i____daddr_t in sll-simple-white-blue_true-unreach-call_false-valid-memtrack.i [2018-04-11 14:28:38,889 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fsll_simple_white_blue_true_unreach_call_false_valid_memtrack_i____int64_t in sll-simple-white-blue_true-unreach-call_false-valid-memtrack.i [2018-04-11 14:28:38,889 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fsll_simple_white_blue_true_unreach_call_false_valid_memtrack_i__int8_t in sll-simple-white-blue_true-unreach-call_false-valid-memtrack.i [2018-04-11 14:28:38,889 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fsll_simple_white_blue_true_unreach_call_false_valid_memtrack_i____time_t in sll-simple-white-blue_true-unreach-call_false-valid-memtrack.i [2018-04-11 14:28:38,889 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fsll_simple_white_blue_true_unreach_call_false_valid_memtrack_i____uint8_t in sll-simple-white-blue_true-unreach-call_false-valid-memtrack.i [2018-04-11 14:28:38,889 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fsll_simple_white_blue_true_unreach_call_false_valid_memtrack_i____key_t in sll-simple-white-blue_true-unreach-call_false-valid-memtrack.i [2018-04-11 14:28:38,889 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fsll_simple_white_blue_true_unreach_call_false_valid_memtrack_i__u_quad_t in sll-simple-white-blue_true-unreach-call_false-valid-memtrack.i [2018-04-11 14:28:38,889 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fsll_simple_white_blue_true_unreach_call_false_valid_memtrack_i__ushort in sll-simple-white-blue_true-unreach-call_false-valid-memtrack.i [2018-04-11 14:28:38,901 INFO L330 CDTParser]: Deleted temporary CDT project at /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/data/FLAG9e68240f6 [2018-04-11 14:28:38,905 INFO L304 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-04-11 14:28:38,906 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2018-04-11 14:28:38,907 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-04-11 14:28:38,907 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-04-11 14:28:38,911 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-04-11 14:28:38,912 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 11.04 02:28:38" (1/1) ... [2018-04-11 14:28:38,913 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@7c3622a7 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.04 02:28:38, skipping insertion in model container [2018-04-11 14:28:38,913 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 11.04 02:28:38" (1/1) ... [2018-04-11 14:28:38,925 INFO L167 Dispatcher]: Using SV-COMP mode [2018-04-11 14:28:38,947 INFO L167 Dispatcher]: Using SV-COMP mode [2018-04-11 14:28:39,077 INFO L175 PostProcessor]: Settings: Checked method=main [2018-04-11 14:28:39,115 INFO L175 PostProcessor]: Settings: Checked method=main [2018-04-11 14:28:39,121 INFO L100 SccComputation]: Graph consists of 0 InCaSumBalls and 115 non ball SCCs. Number of states in SCCs 115. [2018-04-11 14:28:39,156 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.04 02:28:39 WrapperNode [2018-04-11 14:28:39,156 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-04-11 14:28:39,157 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-04-11 14:28:39,157 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-04-11 14:28:39,157 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-04-11 14:28:39,166 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.04 02:28:39" (1/1) ... [2018-04-11 14:28:39,166 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.04 02:28:39" (1/1) ... [2018-04-11 14:28:39,177 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.04 02:28:39" (1/1) ... [2018-04-11 14:28:39,177 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.04 02:28:39" (1/1) ... [2018-04-11 14:28:39,186 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.04 02:28:39" (1/1) ... [2018-04-11 14:28:39,192 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.04 02:28:39" (1/1) ... [2018-04-11 14:28:39,194 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.04 02:28:39" (1/1) ... [2018-04-11 14:28:39,197 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-04-11 14:28:39,198 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-04-11 14:28:39,198 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-04-11 14:28:39,198 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-04-11 14:28:39,199 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.04 02:28:39" (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 14:28:39,295 INFO L136 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-04-11 14:28:39,295 INFO L136 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-04-11 14:28:39,295 INFO L136 BoogieDeclarations]: Found implementation of procedure main [2018-04-11 14:28:39,295 INFO L128 BoogieDeclarations]: Found specification of procedure __ctype_get_mb_cur_max [2018-04-11 14:28:39,295 INFO L128 BoogieDeclarations]: Found specification of procedure atof [2018-04-11 14:28:39,295 INFO L128 BoogieDeclarations]: Found specification of procedure atoi [2018-04-11 14:28:39,295 INFO L128 BoogieDeclarations]: Found specification of procedure atol [2018-04-11 14:28:39,295 INFO L128 BoogieDeclarations]: Found specification of procedure atoll [2018-04-11 14:28:39,295 INFO L128 BoogieDeclarations]: Found specification of procedure strtod [2018-04-11 14:28:39,296 INFO L128 BoogieDeclarations]: Found specification of procedure strtof [2018-04-11 14:28:39,296 INFO L128 BoogieDeclarations]: Found specification of procedure strtold [2018-04-11 14:28:39,296 INFO L128 BoogieDeclarations]: Found specification of procedure strtol [2018-04-11 14:28:39,296 INFO L128 BoogieDeclarations]: Found specification of procedure strtoul [2018-04-11 14:28:39,296 INFO L128 BoogieDeclarations]: Found specification of procedure strtoq [2018-04-11 14:28:39,296 INFO L128 BoogieDeclarations]: Found specification of procedure strtouq [2018-04-11 14:28:39,296 INFO L128 BoogieDeclarations]: Found specification of procedure strtoll [2018-04-11 14:28:39,296 INFO L128 BoogieDeclarations]: Found specification of procedure strtoull [2018-04-11 14:28:39,296 INFO L128 BoogieDeclarations]: Found specification of procedure l64a [2018-04-11 14:28:39,296 INFO L128 BoogieDeclarations]: Found specification of procedure a64l [2018-04-11 14:28:39,296 INFO L128 BoogieDeclarations]: Found specification of procedure select [2018-04-11 14:28:39,296 INFO L128 BoogieDeclarations]: Found specification of procedure pselect [2018-04-11 14:28:39,297 INFO L128 BoogieDeclarations]: Found specification of procedure gnu_dev_major [2018-04-11 14:28:39,297 INFO L128 BoogieDeclarations]: Found specification of procedure gnu_dev_minor [2018-04-11 14:28:39,297 INFO L128 BoogieDeclarations]: Found specification of procedure gnu_dev_makedev [2018-04-11 14:28:39,297 INFO L128 BoogieDeclarations]: Found specification of procedure random [2018-04-11 14:28:39,297 INFO L128 BoogieDeclarations]: Found specification of procedure srandom [2018-04-11 14:28:39,297 INFO L128 BoogieDeclarations]: Found specification of procedure initstate [2018-04-11 14:28:39,297 INFO L128 BoogieDeclarations]: Found specification of procedure setstate [2018-04-11 14:28:39,297 INFO L128 BoogieDeclarations]: Found specification of procedure random_r [2018-04-11 14:28:39,297 INFO L128 BoogieDeclarations]: Found specification of procedure srandom_r [2018-04-11 14:28:39,298 INFO L128 BoogieDeclarations]: Found specification of procedure initstate_r [2018-04-11 14:28:39,298 INFO L128 BoogieDeclarations]: Found specification of procedure setstate_r [2018-04-11 14:28:39,298 INFO L128 BoogieDeclarations]: Found specification of procedure rand [2018-04-11 14:28:39,298 INFO L128 BoogieDeclarations]: Found specification of procedure srand [2018-04-11 14:28:39,298 INFO L128 BoogieDeclarations]: Found specification of procedure rand_r [2018-04-11 14:28:39,298 INFO L128 BoogieDeclarations]: Found specification of procedure drand48 [2018-04-11 14:28:39,298 INFO L128 BoogieDeclarations]: Found specification of procedure erand48 [2018-04-11 14:28:39,298 INFO L128 BoogieDeclarations]: Found specification of procedure lrand48 [2018-04-11 14:28:39,299 INFO L128 BoogieDeclarations]: Found specification of procedure nrand48 [2018-04-11 14:28:39,299 INFO L128 BoogieDeclarations]: Found specification of procedure mrand48 [2018-04-11 14:28:39,299 INFO L128 BoogieDeclarations]: Found specification of procedure jrand48 [2018-04-11 14:28:39,299 INFO L128 BoogieDeclarations]: Found specification of procedure srand48 [2018-04-11 14:28:39,299 INFO L128 BoogieDeclarations]: Found specification of procedure seed48 [2018-04-11 14:28:39,299 INFO L128 BoogieDeclarations]: Found specification of procedure lcong48 [2018-04-11 14:28:39,299 INFO L128 BoogieDeclarations]: Found specification of procedure drand48_r [2018-04-11 14:28:39,299 INFO L128 BoogieDeclarations]: Found specification of procedure erand48_r [2018-04-11 14:28:39,299 INFO L128 BoogieDeclarations]: Found specification of procedure lrand48_r [2018-04-11 14:28:39,299 INFO L128 BoogieDeclarations]: Found specification of procedure nrand48_r [2018-04-11 14:28:39,300 INFO L128 BoogieDeclarations]: Found specification of procedure mrand48_r [2018-04-11 14:28:39,300 INFO L128 BoogieDeclarations]: Found specification of procedure jrand48_r [2018-04-11 14:28:39,300 INFO L128 BoogieDeclarations]: Found specification of procedure srand48_r [2018-04-11 14:28:39,300 INFO L128 BoogieDeclarations]: Found specification of procedure seed48_r [2018-04-11 14:28:39,300 INFO L128 BoogieDeclarations]: Found specification of procedure lcong48_r [2018-04-11 14:28:39,300 INFO L128 BoogieDeclarations]: Found specification of procedure malloc [2018-04-11 14:28:39,300 INFO L128 BoogieDeclarations]: Found specification of procedure calloc [2018-04-11 14:28:39,300 INFO L128 BoogieDeclarations]: Found specification of procedure realloc [2018-04-11 14:28:39,300 INFO L128 BoogieDeclarations]: Found specification of procedure free [2018-04-11 14:28:39,301 INFO L128 BoogieDeclarations]: Found specification of procedure cfree [2018-04-11 14:28:39,301 INFO L128 BoogieDeclarations]: Found specification of procedure alloca [2018-04-11 14:28:39,301 INFO L128 BoogieDeclarations]: Found specification of procedure valloc [2018-04-11 14:28:39,301 INFO L128 BoogieDeclarations]: Found specification of procedure posix_memalign [2018-04-11 14:28:39,301 INFO L128 BoogieDeclarations]: Found specification of procedure aligned_alloc [2018-04-11 14:28:39,301 INFO L128 BoogieDeclarations]: Found specification of procedure abort [2018-04-11 14:28:39,301 INFO L128 BoogieDeclarations]: Found specification of procedure atexit [2018-04-11 14:28:39,301 INFO L128 BoogieDeclarations]: Found specification of procedure at_quick_exit [2018-04-11 14:28:39,301 INFO L128 BoogieDeclarations]: Found specification of procedure on_exit [2018-04-11 14:28:39,301 INFO L128 BoogieDeclarations]: Found specification of procedure exit [2018-04-11 14:28:39,301 INFO L128 BoogieDeclarations]: Found specification of procedure quick_exit [2018-04-11 14:28:39,302 INFO L128 BoogieDeclarations]: Found specification of procedure _Exit [2018-04-11 14:28:39,302 INFO L128 BoogieDeclarations]: Found specification of procedure getenv [2018-04-11 14:28:39,302 INFO L128 BoogieDeclarations]: Found specification of procedure putenv [2018-04-11 14:28:39,302 INFO L128 BoogieDeclarations]: Found specification of procedure setenv [2018-04-11 14:28:39,302 INFO L128 BoogieDeclarations]: Found specification of procedure unsetenv [2018-04-11 14:28:39,302 INFO L128 BoogieDeclarations]: Found specification of procedure clearenv [2018-04-11 14:28:39,302 INFO L128 BoogieDeclarations]: Found specification of procedure mktemp [2018-04-11 14:28:39,302 INFO L128 BoogieDeclarations]: Found specification of procedure mkstemp [2018-04-11 14:28:39,302 INFO L128 BoogieDeclarations]: Found specification of procedure mkstemps [2018-04-11 14:28:39,302 INFO L128 BoogieDeclarations]: Found specification of procedure mkdtemp [2018-04-11 14:28:39,303 INFO L128 BoogieDeclarations]: Found specification of procedure system [2018-04-11 14:28:39,303 INFO L128 BoogieDeclarations]: Found specification of procedure realpath [2018-04-11 14:28:39,303 INFO L128 BoogieDeclarations]: Found specification of procedure bsearch [2018-04-11 14:28:39,303 INFO L128 BoogieDeclarations]: Found specification of procedure qsort [2018-04-11 14:28:39,303 INFO L128 BoogieDeclarations]: Found specification of procedure abs [2018-04-11 14:28:39,303 INFO L128 BoogieDeclarations]: Found specification of procedure labs [2018-04-11 14:28:39,303 INFO L128 BoogieDeclarations]: Found specification of procedure llabs [2018-04-11 14:28:39,303 INFO L128 BoogieDeclarations]: Found specification of procedure div [2018-04-11 14:28:39,303 INFO L128 BoogieDeclarations]: Found specification of procedure ldiv [2018-04-11 14:28:39,303 INFO L128 BoogieDeclarations]: Found specification of procedure lldiv [2018-04-11 14:28:39,303 INFO L128 BoogieDeclarations]: Found specification of procedure ecvt [2018-04-11 14:28:39,304 INFO L128 BoogieDeclarations]: Found specification of procedure fcvt [2018-04-11 14:28:39,304 INFO L128 BoogieDeclarations]: Found specification of procedure gcvt [2018-04-11 14:28:39,304 INFO L128 BoogieDeclarations]: Found specification of procedure qecvt [2018-04-11 14:28:39,304 INFO L128 BoogieDeclarations]: Found specification of procedure qfcvt [2018-04-11 14:28:39,304 INFO L128 BoogieDeclarations]: Found specification of procedure qgcvt [2018-04-11 14:28:39,304 INFO L128 BoogieDeclarations]: Found specification of procedure ecvt_r [2018-04-11 14:28:39,304 INFO L128 BoogieDeclarations]: Found specification of procedure fcvt_r [2018-04-11 14:28:39,304 INFO L128 BoogieDeclarations]: Found specification of procedure qecvt_r [2018-04-11 14:28:39,304 INFO L128 BoogieDeclarations]: Found specification of procedure qfcvt_r [2018-04-11 14:28:39,304 INFO L128 BoogieDeclarations]: Found specification of procedure mblen [2018-04-11 14:28:39,305 INFO L128 BoogieDeclarations]: Found specification of procedure mbtowc [2018-04-11 14:28:39,305 INFO L128 BoogieDeclarations]: Found specification of procedure wctomb [2018-04-11 14:28:39,305 INFO L128 BoogieDeclarations]: Found specification of procedure mbstowcs [2018-04-11 14:28:39,305 INFO L128 BoogieDeclarations]: Found specification of procedure wcstombs [2018-04-11 14:28:39,305 INFO L128 BoogieDeclarations]: Found specification of procedure rpmatch [2018-04-11 14:28:39,305 INFO L128 BoogieDeclarations]: Found specification of procedure getsubopt [2018-04-11 14:28:39,305 INFO L128 BoogieDeclarations]: Found specification of procedure getloadavg [2018-04-11 14:28:39,305 INFO L128 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2018-04-11 14:28:39,305 INFO L128 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2018-04-11 14:28:39,305 INFO L128 BoogieDeclarations]: Found specification of procedure main [2018-04-11 14:28:39,305 INFO L128 BoogieDeclarations]: Found specification of procedure #Ultimate.alloc [2018-04-11 14:28:39,306 INFO L128 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2018-04-11 14:28:39,306 INFO L128 BoogieDeclarations]: Found specification of procedure write~int [2018-04-11 14:28:39,306 INFO L128 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2018-04-11 14:28:39,306 INFO L128 BoogieDeclarations]: Found specification of procedure read~int [2018-04-11 14:28:39,306 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2018-04-11 14:28:39,306 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-04-11 14:28:39,306 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-04-11 14:28:39,306 INFO L128 BoogieDeclarations]: Found specification of procedure write~unchecked~int [2018-04-11 14:28:39,668 INFO L259 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-04-11 14:28:39,669 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.04 02:28:39 BoogieIcfgContainer [2018-04-11 14:28:39,669 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-04-11 14:28:39,670 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-04-11 14:28:39,670 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-04-11 14:28:39,672 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-04-11 14:28:39,673 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 11.04 02:28:38" (1/3) ... [2018-04-11 14:28:39,673 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@124029f6 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 11.04 02:28:39, skipping insertion in model container [2018-04-11 14:28:39,673 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.04 02:28:39" (2/3) ... [2018-04-11 14:28:39,674 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@124029f6 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 11.04 02:28:39, skipping insertion in model container [2018-04-11 14:28:39,674 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.04 02:28:39" (3/3) ... [2018-04-11 14:28:39,675 INFO L107 eAbstractionObserver]: Analyzing ICFG sll-simple-white-blue_true-unreach-call_false-valid-memtrack.i [2018-04-11 14:28:39,683 INFO L131 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:Craig_TreeInterpolation Determinization: PREDICATE_ABSTRACTION [2018-04-11 14:28:39,690 INFO L143 ceAbstractionStarter]: Appying trace abstraction to program that has 43 error locations. [2018-04-11 14:28:39,723 INFO L128 ementStrategyFactory]: Using default assertion order modulation [2018-04-11 14:28:39,724 INFO L369 AbstractCegarLoop]: Interprodecural is true [2018-04-11 14:28:39,724 INFO L370 AbstractCegarLoop]: Hoare is false [2018-04-11 14:28:39,724 INFO L371 AbstractCegarLoop]: Compute interpolants for Craig_TreeInterpolation [2018-04-11 14:28:39,724 INFO L372 AbstractCegarLoop]: Backedges is CANONICAL [2018-04-11 14:28:39,724 INFO L373 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-04-11 14:28:39,724 INFO L374 AbstractCegarLoop]: Difference is false [2018-04-11 14:28:39,724 INFO L375 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-04-11 14:28:39,724 INFO L380 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-04-11 14:28:39,725 INFO L87 2NestedWordAutomaton]: Mode: main mode - execution starts in main procedure [2018-04-11 14:28:39,736 INFO L276 IsEmpty]: Start isEmpty. Operand 111 states. [2018-04-11 14:28:39,744 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2018-04-11 14:28:39,744 INFO L347 BasicCegarLoop]: Found error trace [2018-04-11 14:28:39,744 INFO L355 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2018-04-11 14:28:39,745 INFO L408 AbstractCegarLoop]: === Iteration 1 === [mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr42EnsuresViolationMEMORY_LEAK, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr21RequiresViolation, mainErr31RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr39RequiresViolation, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr12RequiresViolation, mainErr40AssertViolationMEMORY_FREE, mainErr41AssertViolationMEMORY_FREE, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr9RequiresViolation, mainErr30RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr34RequiresViolation, mainErr4RequiresViolation, mainErr14RequiresViolation, mainErr37RequiresViolation]=== [2018-04-11 14:28:39,747 INFO L82 PathProgramCache]: Analyzing trace with hash -1982669053, now seen corresponding path program 1 times [2018-04-11 14:28:39,789 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-04-11 14:28:39,812 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-11 14:28:39,818 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-11 14:28:39,860 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 14:28:39,862 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-04-11 14:28:39,862 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-04-11 14:28:39,863 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-04-11 14:28:39,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 14:28:39,863 INFO L182 omatonBuilderFactory]: Interpolants [114#true, 115#false, 116#(= 1 (select |#valid| |main_#t~malloc0.base|)), 117#(= 1 (select |#valid| main_~head~0.base))] [2018-04-11 14:28:39,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 14:28:39,864 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-04-11 14:28:39,874 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-04-11 14:28:39,874 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-04-11 14:28:39,876 INFO L87 Difference]: Start difference. First operand 111 states. Second operand 4 states. [2018-04-11 14:28:40,049 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-11 14:28:40,049 INFO L93 Difference]: Finished difference Result 156 states and 166 transitions. [2018-04-11 14:28:40,050 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-04-11 14:28:40,051 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 8 [2018-04-11 14:28:40,051 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-11 14:28:40,060 INFO L225 Difference]: With dead ends: 156 [2018-04-11 14:28:40,061 INFO L226 Difference]: Without dead ends: 147 [2018-04-11 14:28:40,062 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 14:28:40,074 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 147 states. [2018-04-11 14:28:40,088 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 147 to 103. [2018-04-11 14:28:40,089 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 103 states. [2018-04-11 14:28:40,091 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 103 states to 103 states and 109 transitions. [2018-04-11 14:28:40,093 INFO L78 Accepts]: Start accepts. Automaton has 103 states and 109 transitions. Word has length 8 [2018-04-11 14:28:40,093 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-11 14:28:40,093 INFO L459 AbstractCegarLoop]: Abstraction has 103 states and 109 transitions. [2018-04-11 14:28:40,093 INFO L460 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-04-11 14:28:40,093 INFO L276 IsEmpty]: Start isEmpty. Operand 103 states and 109 transitions. [2018-04-11 14:28:40,094 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2018-04-11 14:28:40,094 INFO L347 BasicCegarLoop]: Found error trace [2018-04-11 14:28:40,094 INFO L355 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2018-04-11 14:28:40,094 INFO L408 AbstractCegarLoop]: === Iteration 2 === [mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr42EnsuresViolationMEMORY_LEAK, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr21RequiresViolation, mainErr31RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr39RequiresViolation, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr12RequiresViolation, mainErr40AssertViolationMEMORY_FREE, mainErr41AssertViolationMEMORY_FREE, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr9RequiresViolation, mainErr30RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr34RequiresViolation, mainErr4RequiresViolation, mainErr14RequiresViolation, mainErr37RequiresViolation]=== [2018-04-11 14:28:40,094 INFO L82 PathProgramCache]: Analyzing trace with hash -1982669052, now seen corresponding path program 1 times [2018-04-11 14:28:40,096 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-04-11 14:28:40,108 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-11 14:28:40,110 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-11 14:28:40,149 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 14:28:40,150 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-04-11 14:28:40,150 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-04-11 14:28:40,150 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-04-11 14:28:40,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 14:28:40,150 INFO L182 omatonBuilderFactory]: Interpolants [379#true, 380#false, 381#(and (= 8 (select |#length| |main_#t~malloc0.base|)) (= 0 |main_#t~malloc0.offset|)), 382#(and (= 8 (select |#length| main_~head~0.base)) (= main_~head~0.offset 0))] [2018-04-11 14:28:40,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 14:28:40,151 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-04-11 14:28:40,152 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-04-11 14:28:40,152 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-04-11 14:28:40,152 INFO L87 Difference]: Start difference. First operand 103 states and 109 transitions. Second operand 4 states. [2018-04-11 14:28:40,242 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-11 14:28:40,242 INFO L93 Difference]: Finished difference Result 131 states and 139 transitions. [2018-04-11 14:28:40,242 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-04-11 14:28:40,242 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 8 [2018-04-11 14:28:40,242 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-11 14:28:40,243 INFO L225 Difference]: With dead ends: 131 [2018-04-11 14:28:40,243 INFO L226 Difference]: Without dead ends: 131 [2018-04-11 14:28:40,245 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 14:28:40,246 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 131 states. [2018-04-11 14:28:40,250 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 131 to 101. [2018-04-11 14:28:40,250 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 101 states. [2018-04-11 14:28:40,251 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 101 states to 101 states and 107 transitions. [2018-04-11 14:28:40,251 INFO L78 Accepts]: Start accepts. Automaton has 101 states and 107 transitions. Word has length 8 [2018-04-11 14:28:40,252 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-11 14:28:40,252 INFO L459 AbstractCegarLoop]: Abstraction has 101 states and 107 transitions. [2018-04-11 14:28:40,252 INFO L460 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-04-11 14:28:40,252 INFO L276 IsEmpty]: Start isEmpty. Operand 101 states and 107 transitions. [2018-04-11 14:28:40,252 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2018-04-11 14:28:40,252 INFO L347 BasicCegarLoop]: Found error trace [2018-04-11 14:28:40,252 INFO L355 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-11 14:28:40,253 INFO L408 AbstractCegarLoop]: === Iteration 3 === [mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr42EnsuresViolationMEMORY_LEAK, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr21RequiresViolation, mainErr31RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr39RequiresViolation, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr12RequiresViolation, mainErr40AssertViolationMEMORY_FREE, mainErr41AssertViolationMEMORY_FREE, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr9RequiresViolation, mainErr30RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr34RequiresViolation, mainErr4RequiresViolation, mainErr14RequiresViolation, mainErr37RequiresViolation]=== [2018-04-11 14:28:40,253 INFO L82 PathProgramCache]: Analyzing trace with hash -1611689904, now seen corresponding path program 1 times [2018-04-11 14:28:40,254 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-04-11 14:28:40,269 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-11 14:28:40,269 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-11 14:28:40,306 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 14:28:40,306 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-04-11 14:28:40,306 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-04-11 14:28:40,306 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-04-11 14:28:40,307 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 14:28:40,307 INFO L182 omatonBuilderFactory]: Interpolants [617#true, 618#false, 619#(= 1 (select |#valid| main_~head~0.base)), 620#(= 1 (select |#valid| main_~x~0.base))] [2018-04-11 14:28:40,307 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 14:28:40,307 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-04-11 14:28:40,307 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-04-11 14:28:40,307 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-04-11 14:28:40,308 INFO L87 Difference]: Start difference. First operand 101 states and 107 transitions. Second operand 4 states. [2018-04-11 14:28:40,445 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-11 14:28:40,445 INFO L93 Difference]: Finished difference Result 107 states and 113 transitions. [2018-04-11 14:28:40,445 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-04-11 14:28:40,445 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 15 [2018-04-11 14:28:40,445 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-11 14:28:40,446 INFO L225 Difference]: With dead ends: 107 [2018-04-11 14:28:40,446 INFO L226 Difference]: Without dead ends: 107 [2018-04-11 14:28:40,446 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 14:28:40,446 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 107 states. [2018-04-11 14:28:40,449 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 107 to 99. [2018-04-11 14:28:40,449 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 99 states. [2018-04-11 14:28:40,450 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 99 states to 99 states and 110 transitions. [2018-04-11 14:28:40,450 INFO L78 Accepts]: Start accepts. Automaton has 99 states and 110 transitions. Word has length 15 [2018-04-11 14:28:40,450 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-11 14:28:40,450 INFO L459 AbstractCegarLoop]: Abstraction has 99 states and 110 transitions. [2018-04-11 14:28:40,450 INFO L460 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-04-11 14:28:40,450 INFO L276 IsEmpty]: Start isEmpty. Operand 99 states and 110 transitions. [2018-04-11 14:28:40,450 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2018-04-11 14:28:40,450 INFO L347 BasicCegarLoop]: Found error trace [2018-04-11 14:28:40,450 INFO L355 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-11 14:28:40,451 INFO L408 AbstractCegarLoop]: === Iteration 4 === [mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr42EnsuresViolationMEMORY_LEAK, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr21RequiresViolation, mainErr31RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr39RequiresViolation, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr12RequiresViolation, mainErr40AssertViolationMEMORY_FREE, mainErr41AssertViolationMEMORY_FREE, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr9RequiresViolation, mainErr30RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr34RequiresViolation, mainErr4RequiresViolation, mainErr14RequiresViolation, mainErr37RequiresViolation]=== [2018-04-11 14:28:40,451 INFO L82 PathProgramCache]: Analyzing trace with hash -1611689903, now seen corresponding path program 1 times [2018-04-11 14:28:40,451 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-04-11 14:28:40,459 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-11 14:28:40,459 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-11 14:28:40,511 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 14:28:40,512 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-04-11 14:28:40,512 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-04-11 14:28:40,512 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-04-11 14:28:40,512 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 14:28:40,512 INFO L182 omatonBuilderFactory]: Interpolants [832#(and (= 0 main_~head~0.offset) (= 8 (select |#length| main_~head~0.base))), 833#(and (= 8 (select |#length| main_~x~0.base)) (= main_~x~0.offset 0)), 829#true, 830#false, 831#(and (= 8 (select |#length| |main_#t~malloc0.base|)) (= 0 |main_#t~malloc0.offset|))] [2018-04-11 14:28:40,512 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 14:28:40,513 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-04-11 14:28:40,513 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-04-11 14:28:40,513 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-04-11 14:28:40,513 INFO L87 Difference]: Start difference. First operand 99 states and 110 transitions. Second operand 5 states. [2018-04-11 14:28:40,691 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-11 14:28:40,691 INFO L93 Difference]: Finished difference Result 165 states and 182 transitions. [2018-04-11 14:28:40,691 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-04-11 14:28:40,691 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 15 [2018-04-11 14:28:40,692 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-11 14:28:40,692 INFO L225 Difference]: With dead ends: 165 [2018-04-11 14:28:40,693 INFO L226 Difference]: Without dead ends: 165 [2018-04-11 14:28:40,693 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 14:28:40,693 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 165 states. [2018-04-11 14:28:40,698 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 165 to 139. [2018-04-11 14:28:40,698 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 139 states. [2018-04-11 14:28:40,699 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 139 states to 139 states and 163 transitions. [2018-04-11 14:28:40,699 INFO L78 Accepts]: Start accepts. Automaton has 139 states and 163 transitions. Word has length 15 [2018-04-11 14:28:40,700 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-11 14:28:40,700 INFO L459 AbstractCegarLoop]: Abstraction has 139 states and 163 transitions. [2018-04-11 14:28:40,700 INFO L460 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-04-11 14:28:40,700 INFO L276 IsEmpty]: Start isEmpty. Operand 139 states and 163 transitions. [2018-04-11 14:28:40,700 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2018-04-11 14:28:40,701 INFO L347 BasicCegarLoop]: Found error trace [2018-04-11 14:28:40,701 INFO L355 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-11 14:28:40,701 INFO L408 AbstractCegarLoop]: === Iteration 5 === [mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr42EnsuresViolationMEMORY_LEAK, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr21RequiresViolation, mainErr31RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr39RequiresViolation, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr12RequiresViolation, mainErr40AssertViolationMEMORY_FREE, mainErr41AssertViolationMEMORY_FREE, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr9RequiresViolation, mainErr30RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr34RequiresViolation, mainErr4RequiresViolation, mainErr14RequiresViolation, mainErr37RequiresViolation]=== [2018-04-11 14:28:40,701 INFO L82 PathProgramCache]: Analyzing trace with hash -455507554, now seen corresponding path program 1 times [2018-04-11 14:28:40,703 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-04-11 14:28:40,710 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-11 14:28:40,711 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-11 14:28:40,732 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 14:28:40,732 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-04-11 14:28:40,732 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-04-11 14:28:40,732 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-04-11 14:28:40,732 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 14:28:40,732 INFO L182 omatonBuilderFactory]: Interpolants [1142#true, 1143#false, 1144#(= 1 (select |#valid| |main_#t~malloc5.base|)), 1145#(= 1 (select |#valid| main_~x~0.base))] [2018-04-11 14:28:40,732 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 14:28:40,733 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-04-11 14:28:40,733 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-04-11 14:28:40,733 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-04-11 14:28:40,733 INFO L87 Difference]: Start difference. First operand 139 states and 163 transitions. Second operand 4 states. [2018-04-11 14:28:40,820 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-11 14:28:40,820 INFO L93 Difference]: Finished difference Result 156 states and 171 transitions. [2018-04-11 14:28:40,820 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-04-11 14:28:40,820 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 18 [2018-04-11 14:28:40,820 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-11 14:28:40,821 INFO L225 Difference]: With dead ends: 156 [2018-04-11 14:28:40,821 INFO L226 Difference]: Without dead ends: 156 [2018-04-11 14:28:40,821 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 14:28:40,821 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 156 states. [2018-04-11 14:28:40,828 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 156 to 138. [2018-04-11 14:28:40,828 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 138 states. [2018-04-11 14:28:40,829 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 138 states to 138 states and 162 transitions. [2018-04-11 14:28:40,830 INFO L78 Accepts]: Start accepts. Automaton has 138 states and 162 transitions. Word has length 18 [2018-04-11 14:28:40,830 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-11 14:28:40,830 INFO L459 AbstractCegarLoop]: Abstraction has 138 states and 162 transitions. [2018-04-11 14:28:40,830 INFO L460 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-04-11 14:28:40,830 INFO L276 IsEmpty]: Start isEmpty. Operand 138 states and 162 transitions. [2018-04-11 14:28:40,831 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2018-04-11 14:28:40,831 INFO L347 BasicCegarLoop]: Found error trace [2018-04-11 14:28:40,831 INFO L355 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-11 14:28:40,831 INFO L408 AbstractCegarLoop]: === Iteration 6 === [mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr42EnsuresViolationMEMORY_LEAK, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr21RequiresViolation, mainErr31RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr39RequiresViolation, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr12RequiresViolation, mainErr40AssertViolationMEMORY_FREE, mainErr41AssertViolationMEMORY_FREE, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr9RequiresViolation, mainErr30RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr34RequiresViolation, mainErr4RequiresViolation, mainErr14RequiresViolation, mainErr37RequiresViolation]=== [2018-04-11 14:28:40,831 INFO L82 PathProgramCache]: Analyzing trace with hash -455507553, now seen corresponding path program 1 times [2018-04-11 14:28:40,832 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-04-11 14:28:40,841 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-11 14:28:40,841 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-11 14:28:40,869 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 14:28:40,869 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-04-11 14:28:40,869 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-04-11 14:28:40,869 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-04-11 14:28:40,870 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 14:28:40,870 INFO L182 omatonBuilderFactory]: Interpolants [1442#true, 1443#false, 1444#(and (= 0 |main_#t~malloc5.offset|) (= 8 (select |#length| |main_#t~malloc5.base|))), 1445#(and (= 8 (select |#length| main_~x~0.base)) (= main_~x~0.offset 0))] [2018-04-11 14:28:40,870 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 14:28:40,870 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-04-11 14:28:40,870 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-04-11 14:28:40,870 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-04-11 14:28:40,870 INFO L87 Difference]: Start difference. First operand 138 states and 162 transitions. Second operand 4 states. [2018-04-11 14:28:40,942 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-11 14:28:40,942 INFO L93 Difference]: Finished difference Result 158 states and 175 transitions. [2018-04-11 14:28:40,943 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-04-11 14:28:40,943 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 18 [2018-04-11 14:28:40,943 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-11 14:28:40,943 INFO L225 Difference]: With dead ends: 158 [2018-04-11 14:28:40,943 INFO L226 Difference]: Without dead ends: 158 [2018-04-11 14:28:40,943 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 14:28:40,944 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 158 states. [2018-04-11 14:28:40,946 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 158 to 136. [2018-04-11 14:28:40,947 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 136 states. [2018-04-11 14:28:40,948 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 136 states to 136 states and 160 transitions. [2018-04-11 14:28:40,948 INFO L78 Accepts]: Start accepts. Automaton has 136 states and 160 transitions. Word has length 18 [2018-04-11 14:28:40,948 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-11 14:28:40,948 INFO L459 AbstractCegarLoop]: Abstraction has 136 states and 160 transitions. [2018-04-11 14:28:40,948 INFO L460 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-04-11 14:28:40,948 INFO L276 IsEmpty]: Start isEmpty. Operand 136 states and 160 transitions. [2018-04-11 14:28:40,949 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2018-04-11 14:28:40,949 INFO L347 BasicCegarLoop]: Found error trace [2018-04-11 14:28:40,949 INFO L355 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-11 14:28:40,949 INFO L408 AbstractCegarLoop]: === Iteration 7 === [mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr42EnsuresViolationMEMORY_LEAK, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr21RequiresViolation, mainErr31RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr39RequiresViolation, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr12RequiresViolation, mainErr40AssertViolationMEMORY_FREE, mainErr41AssertViolationMEMORY_FREE, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr9RequiresViolation, mainErr30RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr34RequiresViolation, mainErr4RequiresViolation, mainErr14RequiresViolation, mainErr37RequiresViolation]=== [2018-04-11 14:28:40,949 INFO L82 PathProgramCache]: Analyzing trace with hash -414531954, now seen corresponding path program 1 times [2018-04-11 14:28:40,950 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-04-11 14:28:40,959 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-11 14:28:40,960 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-11 14:28:41,000 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 14:28:41,000 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-04-11 14:28:41,000 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-04-11 14:28:41,000 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-04-11 14:28:41,000 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 14:28:41,000 INFO L182 omatonBuilderFactory]: Interpolants [1744#(and (= 0 |main_#t~malloc2.offset|) (= 8 (select |#length| |main_#t~malloc2.base|))), 1745#(and (= 8 (select |#length| (select (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset))) (= 0 (select (select |#memory_$Pointer$.offset| main_~x~0.base) main_~x~0.offset))), 1746#(and (= 8 (select |#length| |main_#t~mem3.base|)) (= 0 |main_#t~mem3.offset|)), 1747#(and (= 8 (select |#length| main_~x~0.base)) (= main_~x~0.offset 0)), 1742#true, 1743#false] [2018-04-11 14:28:41,000 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 14:28:41,001 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-04-11 14:28:41,001 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-04-11 14:28:41,001 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-04-11 14:28:41,001 INFO L87 Difference]: Start difference. First operand 136 states and 160 transitions. Second operand 6 states. [2018-04-11 14:28:41,220 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-11 14:28:41,220 INFO L93 Difference]: Finished difference Result 239 states and 285 transitions. [2018-04-11 14:28:41,220 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-04-11 14:28:41,220 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 18 [2018-04-11 14:28:41,221 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-11 14:28:41,221 INFO L225 Difference]: With dead ends: 239 [2018-04-11 14:28:41,221 INFO L226 Difference]: Without dead ends: 239 [2018-04-11 14:28:41,222 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 14:28:41,222 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 239 states. [2018-04-11 14:28:41,225 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 239 to 126. [2018-04-11 14:28:41,225 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 126 states. [2018-04-11 14:28:41,226 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 126 states to 126 states and 149 transitions. [2018-04-11 14:28:41,227 INFO L78 Accepts]: Start accepts. Automaton has 126 states and 149 transitions. Word has length 18 [2018-04-11 14:28:41,227 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-11 14:28:41,227 INFO L459 AbstractCegarLoop]: Abstraction has 126 states and 149 transitions. [2018-04-11 14:28:41,227 INFO L460 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-04-11 14:28:41,227 INFO L276 IsEmpty]: Start isEmpty. Operand 126 states and 149 transitions. [2018-04-11 14:28:41,227 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2018-04-11 14:28:41,228 INFO L347 BasicCegarLoop]: Found error trace [2018-04-11 14:28:41,228 INFO L355 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-11 14:28:41,228 INFO L408 AbstractCegarLoop]: === Iteration 8 === [mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr42EnsuresViolationMEMORY_LEAK, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr21RequiresViolation, mainErr31RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr39RequiresViolation, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr12RequiresViolation, mainErr40AssertViolationMEMORY_FREE, mainErr41AssertViolationMEMORY_FREE, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr9RequiresViolation, mainErr30RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr34RequiresViolation, mainErr4RequiresViolation, mainErr14RequiresViolation, mainErr37RequiresViolation]=== [2018-04-11 14:28:41,228 INFO L82 PathProgramCache]: Analyzing trace with hash -414531955, now seen corresponding path program 1 times [2018-04-11 14:28:41,229 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-04-11 14:28:41,236 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-11 14:28:41,237 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-11 14:28:41,260 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-11 14:28:41,260 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-04-11 14:28:41,260 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-04-11 14:28:41,260 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-04-11 14:28:41,260 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-11 14:28:41,260 INFO L182 omatonBuilderFactory]: Interpolants [2128#(= 1 (select |#valid| |main_#t~mem3.base|)), 2129#(= 1 (select |#valid| main_~x~0.base)), 2124#true, 2125#false, 2126#(= 1 (select |#valid| |main_#t~malloc2.base|)), 2127#(= 1 (select |#valid| (select (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset)))] [2018-04-11 14:28:41,261 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 14:28:41,261 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-04-11 14:28:41,261 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-04-11 14:28:41,261 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-04-11 14:28:41,261 INFO L87 Difference]: Start difference. First operand 126 states and 149 transitions. Second operand 6 states. [2018-04-11 14:28:41,430 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-11 14:28:41,430 INFO L93 Difference]: Finished difference Result 228 states and 271 transitions. [2018-04-11 14:28:41,430 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-04-11 14:28:41,430 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 18 [2018-04-11 14:28:41,430 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-11 14:28:41,431 INFO L225 Difference]: With dead ends: 228 [2018-04-11 14:28:41,431 INFO L226 Difference]: Without dead ends: 228 [2018-04-11 14:28:41,431 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 14:28:41,432 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 228 states. [2018-04-11 14:28:41,434 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 228 to 125. [2018-04-11 14:28:41,434 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 125 states. [2018-04-11 14:28:41,435 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 125 states to 125 states and 148 transitions. [2018-04-11 14:28:41,435 INFO L78 Accepts]: Start accepts. Automaton has 125 states and 148 transitions. Word has length 18 [2018-04-11 14:28:41,435 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-11 14:28:41,435 INFO L459 AbstractCegarLoop]: Abstraction has 125 states and 148 transitions. [2018-04-11 14:28:41,435 INFO L460 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-04-11 14:28:41,435 INFO L276 IsEmpty]: Start isEmpty. Operand 125 states and 148 transitions. [2018-04-11 14:28:41,436 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2018-04-11 14:28:41,436 INFO L347 BasicCegarLoop]: Found error trace [2018-04-11 14:28:41,436 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] [2018-04-11 14:28:41,436 INFO L408 AbstractCegarLoop]: === Iteration 9 === [mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr42EnsuresViolationMEMORY_LEAK, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr21RequiresViolation, mainErr31RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr39RequiresViolation, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr12RequiresViolation, mainErr40AssertViolationMEMORY_FREE, mainErr41AssertViolationMEMORY_FREE, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr9RequiresViolation, mainErr30RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr34RequiresViolation, mainErr4RequiresViolation, mainErr14RequiresViolation, mainErr37RequiresViolation]=== [2018-04-11 14:28:41,437 INFO L82 PathProgramCache]: Analyzing trace with hash -1233727545, now seen corresponding path program 1 times [2018-04-11 14:28:41,438 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-04-11 14:28:41,445 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-11 14:28:41,446 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-11 14:28:41,486 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-11 14:28:41,486 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-04-11 14:28:41,486 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-04-11 14:28:41,486 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-04-11 14:28:41,487 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 14:28:41,487 INFO L182 omatonBuilderFactory]: Interpolants [2490#true, 2491#false, 2492#(and (= 0 (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset)) (= 0 (select (select |#memory_$Pointer$.offset| main_~head~0.base) main_~head~0.offset))), 2493#(and (= 0 (select (select |#memory_$Pointer$.offset| main_~x~0.base) main_~x~0.offset)) (= 0 (select (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset))), 2494#(and (= |main_#t~mem8.base| 0) (= |main_#t~mem8.offset| 0))] [2018-04-11 14:28:41,487 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-11 14:28:41,487 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-04-11 14:28:41,487 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-04-11 14:28:41,487 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-04-11 14:28:41,487 INFO L87 Difference]: Start difference. First operand 125 states and 148 transitions. Second operand 5 states. [2018-04-11 14:28:41,556 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-11 14:28:41,556 INFO L93 Difference]: Finished difference Result 143 states and 168 transitions. [2018-04-11 14:28:41,557 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-04-11 14:28:41,557 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 23 [2018-04-11 14:28:41,557 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-11 14:28:41,557 INFO L225 Difference]: With dead ends: 143 [2018-04-11 14:28:41,557 INFO L226 Difference]: Without dead ends: 143 [2018-04-11 14:28:41,558 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 14:28:41,558 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 143 states. [2018-04-11 14:28:41,559 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 143 to 133. [2018-04-11 14:28:41,559 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 133 states. [2018-04-11 14:28:41,560 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 133 states to 133 states and 158 transitions. [2018-04-11 14:28:41,560 INFO L78 Accepts]: Start accepts. Automaton has 133 states and 158 transitions. Word has length 23 [2018-04-11 14:28:41,560 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-11 14:28:41,560 INFO L459 AbstractCegarLoop]: Abstraction has 133 states and 158 transitions. [2018-04-11 14:28:41,560 INFO L460 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-04-11 14:28:41,560 INFO L276 IsEmpty]: Start isEmpty. Operand 133 states and 158 transitions. [2018-04-11 14:28:41,560 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2018-04-11 14:28:41,561 INFO L347 BasicCegarLoop]: Found error trace [2018-04-11 14:28:41,561 INFO L355 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-11 14:28:41,561 INFO L408 AbstractCegarLoop]: === Iteration 10 === [mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr42EnsuresViolationMEMORY_LEAK, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr21RequiresViolation, mainErr31RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr39RequiresViolation, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr12RequiresViolation, mainErr40AssertViolationMEMORY_FREE, mainErr41AssertViolationMEMORY_FREE, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr9RequiresViolation, mainErr30RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr34RequiresViolation, mainErr4RequiresViolation, mainErr14RequiresViolation, mainErr37RequiresViolation]=== [2018-04-11 14:28:41,561 INFO L82 PathProgramCache]: Analyzing trace with hash 1788148930, now seen corresponding path program 1 times [2018-04-11 14:28:41,561 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-04-11 14:28:41,569 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-11 14:28:41,570 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-11 14:28:41,617 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 14:28:41,617 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-04-11 14:28:41,617 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-04-11 14:28:41,617 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-04-11 14:28:41,618 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 14:28:41,618 INFO L182 omatonBuilderFactory]: Interpolants [2775#true, 2776#false, 2777#(and (= 0 |main_#t~malloc5.offset|) (= 8 (select |#length| |main_#t~malloc5.base|))), 2778#(and (= 8 (select |#length| main_~x~0.base)) (= 0 main_~x~0.offset)), 2779#(and (= 0 main_~head~0.offset) (= 8 (select |#length| main_~head~0.base)))] [2018-04-11 14:28:41,618 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 14:28:41,618 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-04-11 14:28:41,618 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-04-11 14:28:41,618 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-04-11 14:28:41,619 INFO L87 Difference]: Start difference. First operand 133 states and 158 transitions. Second operand 5 states. [2018-04-11 14:28:41,761 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-11 14:28:41,761 INFO L93 Difference]: Finished difference Result 169 states and 184 transitions. [2018-04-11 14:28:41,762 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-04-11 14:28:41,762 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 23 [2018-04-11 14:28:41,762 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-11 14:28:41,763 INFO L225 Difference]: With dead ends: 169 [2018-04-11 14:28:41,763 INFO L226 Difference]: Without dead ends: 169 [2018-04-11 14:28:41,763 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 1 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 14:28:41,763 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 169 states. [2018-04-11 14:28:41,765 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 169 to 111. [2018-04-11 14:28:41,765 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 111 states. [2018-04-11 14:28:41,765 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 111 states to 111 states and 123 transitions. [2018-04-11 14:28:41,766 INFO L78 Accepts]: Start accepts. Automaton has 111 states and 123 transitions. Word has length 23 [2018-04-11 14:28:41,766 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-11 14:28:41,766 INFO L459 AbstractCegarLoop]: Abstraction has 111 states and 123 transitions. [2018-04-11 14:28:41,766 INFO L460 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-04-11 14:28:41,766 INFO L276 IsEmpty]: Start isEmpty. Operand 111 states and 123 transitions. [2018-04-11 14:28:41,767 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2018-04-11 14:28:41,767 INFO L347 BasicCegarLoop]: Found error trace [2018-04-11 14:28:41,767 INFO L355 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-11 14:28:41,767 INFO L408 AbstractCegarLoop]: === Iteration 11 === [mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr42EnsuresViolationMEMORY_LEAK, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr21RequiresViolation, mainErr31RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr39RequiresViolation, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr12RequiresViolation, mainErr40AssertViolationMEMORY_FREE, mainErr41AssertViolationMEMORY_FREE, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr9RequiresViolation, mainErr30RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr34RequiresViolation, mainErr4RequiresViolation, mainErr14RequiresViolation, mainErr37RequiresViolation]=== [2018-04-11 14:28:41,767 INFO L82 PathProgramCache]: Analyzing trace with hash 1692504881, now seen corresponding path program 1 times [2018-04-11 14:28:41,768 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-04-11 14:28:41,776 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-11 14:28:41,776 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-11 14:28:41,849 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-11 14:28:41,849 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-04-11 14:28:41,849 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9] total 9 [2018-04-11 14:28:41,849 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-04-11 14:28:41,849 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 14:28:41,849 INFO L182 omatonBuilderFactory]: Interpolants [3072#(= 1 (select |#valid| (select (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset))), 3073#(= 1 (select |#valid| (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset))), 3074#(= 1 (select |#valid| |main_#t~mem12.base|)), 3075#(= 1 (select |#valid| main_~x~0.base)), 3066#true, 3067#false, 3068#(= 1 (select |#valid| main_~head~0.base)), 3069#(or (= main_~head~0.base |main_#t~malloc5.base|) (= 1 (select |#valid| main_~head~0.base))), 3070#(or (= 1 (select |#valid| main_~head~0.base)) (= main_~x~0.base main_~head~0.base)), 3071#(and (= 1 (select |#valid| main_~x~0.base)) (= 1 (select |#valid| main_~head~0.base)))] [2018-04-11 14:28:41,849 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-11 14:28:41,849 INFO L442 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-04-11 14:28:41,850 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-04-11 14:28:41,850 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=67, Unknown=0, NotChecked=0, Total=90 [2018-04-11 14:28:41,850 INFO L87 Difference]: Start difference. First operand 111 states and 123 transitions. Second operand 10 states. [2018-04-11 14:28:42,070 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-11 14:28:42,070 INFO L93 Difference]: Finished difference Result 155 states and 169 transitions. [2018-04-11 14:28:42,070 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-04-11 14:28:42,071 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 28 [2018-04-11 14:28:42,071 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-11 14:28:42,071 INFO L225 Difference]: With dead ends: 155 [2018-04-11 14:28:42,071 INFO L226 Difference]: Without dead ends: 155 [2018-04-11 14:28:42,072 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 24 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=72, Invalid=138, Unknown=0, NotChecked=0, Total=210 [2018-04-11 14:28:42,072 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 155 states. [2018-04-11 14:28:42,074 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 155 to 117. [2018-04-11 14:28:42,074 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 117 states. [2018-04-11 14:28:42,074 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 117 states to 117 states and 131 transitions. [2018-04-11 14:28:42,075 INFO L78 Accepts]: Start accepts. Automaton has 117 states and 131 transitions. Word has length 28 [2018-04-11 14:28:42,075 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-11 14:28:42,075 INFO L459 AbstractCegarLoop]: Abstraction has 117 states and 131 transitions. [2018-04-11 14:28:42,075 INFO L460 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-04-11 14:28:42,075 INFO L276 IsEmpty]: Start isEmpty. Operand 117 states and 131 transitions. [2018-04-11 14:28:42,075 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2018-04-11 14:28:42,076 INFO L347 BasicCegarLoop]: Found error trace [2018-04-11 14:28:42,076 INFO L355 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-11 14:28:42,076 INFO L408 AbstractCegarLoop]: === Iteration 12 === [mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr42EnsuresViolationMEMORY_LEAK, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr21RequiresViolation, mainErr31RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr39RequiresViolation, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr12RequiresViolation, mainErr40AssertViolationMEMORY_FREE, mainErr41AssertViolationMEMORY_FREE, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr9RequiresViolation, mainErr30RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr34RequiresViolation, mainErr4RequiresViolation, mainErr14RequiresViolation, mainErr37RequiresViolation]=== [2018-04-11 14:28:42,076 INFO L82 PathProgramCache]: Analyzing trace with hash 1692504882, now seen corresponding path program 1 times [2018-04-11 14:28:42,077 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-04-11 14:28:42,085 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-11 14:28:42,085 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-11 14:28:42,185 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-11 14:28:42,185 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-04-11 14:28:42,185 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8] total 8 [2018-04-11 14:28:42,186 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-04-11 14:28:42,186 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 14:28:42,186 INFO L182 omatonBuilderFactory]: Interpolants [3360#(and (= 8 (select |#length| |main_#t~malloc0.base|)) (= 0 |main_#t~malloc0.offset|)), 3361#(and (= 0 main_~head~0.offset) (= 8 (select |#length| main_~head~0.base))), 3362#(and (= 0 main_~head~0.offset) (= 8 (select |#length| main_~head~0.base)) (= 1 (select |#valid| main_~head~0.base))), 3363#(and (= 8 (select |#length| (select (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset))) (= 0 (select (select |#memory_$Pointer$.offset| main_~x~0.base) main_~x~0.offset))), 3364#(and (= 8 (select |#length| (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset))) (= 0 (select (select |#memory_$Pointer$.offset| main_~head~0.base) main_~head~0.offset))), 3365#(and (= 0 |main_#t~mem12.offset|) (= 8 (select |#length| |main_#t~mem12.base|))), 3366#(and (= 8 (select |#length| main_~x~0.base)) (= main_~x~0.offset 0)), 3358#true, 3359#false] [2018-04-11 14:28:42,186 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-11 14:28:42,187 INFO L442 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-04-11 14:28:42,187 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-04-11 14:28:42,187 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2018-04-11 14:28:42,187 INFO L87 Difference]: Start difference. First operand 117 states and 131 transitions. Second operand 9 states. [2018-04-11 14:28:42,579 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-11 14:28:42,579 INFO L93 Difference]: Finished difference Result 180 states and 195 transitions. [2018-04-11 14:28:42,580 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-04-11 14:28:42,580 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 28 [2018-04-11 14:28:42,580 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-11 14:28:42,582 INFO L225 Difference]: With dead ends: 180 [2018-04-11 14:28:42,582 INFO L226 Difference]: Without dead ends: 180 [2018-04-11 14:28:42,582 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 3 SyntacticMatches, 1 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 37 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=73, Invalid=233, Unknown=0, NotChecked=0, Total=306 [2018-04-11 14:28:42,583 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 180 states. [2018-04-11 14:28:42,585 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 180 to 115. [2018-04-11 14:28:42,585 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 115 states. [2018-04-11 14:28:42,586 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 115 states to 115 states and 128 transitions. [2018-04-11 14:28:42,586 INFO L78 Accepts]: Start accepts. Automaton has 115 states and 128 transitions. Word has length 28 [2018-04-11 14:28:42,586 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-11 14:28:42,586 INFO L459 AbstractCegarLoop]: Abstraction has 115 states and 128 transitions. [2018-04-11 14:28:42,586 INFO L460 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-04-11 14:28:42,586 INFO L276 IsEmpty]: Start isEmpty. Operand 115 states and 128 transitions. [2018-04-11 14:28:42,587 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2018-04-11 14:28:42,587 INFO L347 BasicCegarLoop]: Found error trace [2018-04-11 14:28:42,587 INFO L355 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-11 14:28:42,587 INFO L408 AbstractCegarLoop]: === Iteration 13 === [mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr42EnsuresViolationMEMORY_LEAK, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr21RequiresViolation, mainErr31RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr39RequiresViolation, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr12RequiresViolation, mainErr40AssertViolationMEMORY_FREE, mainErr41AssertViolationMEMORY_FREE, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr9RequiresViolation, mainErr30RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr34RequiresViolation, mainErr4RequiresViolation, mainErr14RequiresViolation, mainErr37RequiresViolation]=== [2018-04-11 14:28:42,587 INFO L82 PathProgramCache]: Analyzing trace with hash 877482672, now seen corresponding path program 1 times [2018-04-11 14:28:42,588 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-04-11 14:28:42,596 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-11 14:28:42,597 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-11 14:28:42,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 14:28:42,669 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-04-11 14:28:42,669 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2018-04-11 14:28:42,669 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-04-11 14:28:42,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 14:28:42,670 INFO L182 omatonBuilderFactory]: Interpolants [3680#true, 3681#false, 3682#(= 1 (select |#valid| main_~head~0.base)), 3683#(or (= main_~head~0.base |main_#t~malloc5.base|) (= 1 (select |#valid| main_~head~0.base))), 3684#(or (= 1 (select |#valid| main_~head~0.base)) (= main_~x~0.base main_~head~0.base)), 3685#(and (= 1 (select |#valid| main_~x~0.base)) (= 1 (select |#valid| main_~head~0.base))), 3686#(= 1 (select |#valid| (select (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset))), 3687#(= 1 (select |#valid| (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset))), 3688#(= 1 (select |#valid| |main_#t~mem13.base|)), 3689#(= 1 (select |#valid| main_~x~0.base))] [2018-04-11 14:28:42,670 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 14:28:42,670 INFO L442 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-04-11 14:28:42,670 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-04-11 14:28:42,670 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=67, Unknown=0, NotChecked=0, Total=90 [2018-04-11 14:28:42,670 INFO L87 Difference]: Start difference. First operand 115 states and 128 transitions. Second operand 10 states. [2018-04-11 14:28:42,844 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-11 14:28:42,844 INFO L93 Difference]: Finished difference Result 161 states and 177 transitions. [2018-04-11 14:28:42,844 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-04-11 14:28:42,845 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 29 [2018-04-11 14:28:42,845 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-11 14:28:42,845 INFO L225 Difference]: With dead ends: 161 [2018-04-11 14:28:42,845 INFO L226 Difference]: Without dead ends: 161 [2018-04-11 14:28:42,845 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 25 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=72, Invalid=138, Unknown=0, NotChecked=0, Total=210 [2018-04-11 14:28:42,846 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 161 states. [2018-04-11 14:28:42,847 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 161 to 120. [2018-04-11 14:28:42,847 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 120 states. [2018-04-11 14:28:42,848 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 120 states to 120 states and 135 transitions. [2018-04-11 14:28:42,848 INFO L78 Accepts]: Start accepts. Automaton has 120 states and 135 transitions. Word has length 29 [2018-04-11 14:28:42,848 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-11 14:28:42,848 INFO L459 AbstractCegarLoop]: Abstraction has 120 states and 135 transitions. [2018-04-11 14:28:42,848 INFO L460 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-04-11 14:28:42,848 INFO L276 IsEmpty]: Start isEmpty. Operand 120 states and 135 transitions. [2018-04-11 14:28:42,849 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2018-04-11 14:28:42,849 INFO L347 BasicCegarLoop]: Found error trace [2018-04-11 14:28:42,849 INFO L355 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-11 14:28:42,849 INFO L408 AbstractCegarLoop]: === Iteration 14 === [mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr42EnsuresViolationMEMORY_LEAK, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr21RequiresViolation, mainErr31RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr39RequiresViolation, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr12RequiresViolation, mainErr40AssertViolationMEMORY_FREE, mainErr41AssertViolationMEMORY_FREE, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr9RequiresViolation, mainErr30RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr34RequiresViolation, mainErr4RequiresViolation, mainErr14RequiresViolation, mainErr37RequiresViolation]=== [2018-04-11 14:28:42,849 INFO L82 PathProgramCache]: Analyzing trace with hash 877482673, now seen corresponding path program 1 times [2018-04-11 14:28:42,850 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-04-11 14:28:42,858 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-11 14:28:42,858 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-11 14:28:42,963 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 14:28:42,963 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-04-11 14:28:42,964 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2018-04-11 14:28:42,964 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-04-11 14:28:42,964 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 14:28:42,964 INFO L182 omatonBuilderFactory]: Interpolants [3984#(and (= 0 main_~head~0.offset) (= 8 (select |#length| main_~head~0.base))), 3985#(and (= 0 main_~head~0.offset) (= 8 (select |#length| main_~head~0.base)) (= 1 (select |#valid| main_~head~0.base))), 3986#(and (= 8 (select |#length| (select (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset))) (= 0 (select (select |#memory_$Pointer$.offset| main_~x~0.base) main_~x~0.offset))), 3987#(and (= 8 (select |#length| (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset))) (= 0 (select (select |#memory_$Pointer$.offset| main_~head~0.base) main_~head~0.offset))), 3988#(and (= 8 (select |#length| |main_#t~mem13.base|)) (= 0 |main_#t~mem13.offset|)), 3989#(and (= 8 (select |#length| main_~x~0.base)) (= 0 main_~x~0.offset)), 3981#true, 3982#false, 3983#(and (= 8 (select |#length| |main_#t~malloc0.base|)) (= 0 |main_#t~malloc0.offset|))] [2018-04-11 14:28:42,964 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 14:28:42,964 INFO L442 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-04-11 14:28:42,965 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-04-11 14:28:42,965 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2018-04-11 14:28:42,965 INFO L87 Difference]: Start difference. First operand 120 states and 135 transitions. Second operand 9 states. [2018-04-11 14:28:43,241 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-11 14:28:43,241 INFO L93 Difference]: Finished difference Result 185 states and 201 transitions. [2018-04-11 14:28:43,241 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-04-11 14:28:43,242 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 29 [2018-04-11 14:28:43,242 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-11 14:28:43,242 INFO L225 Difference]: With dead ends: 185 [2018-04-11 14:28:43,242 INFO L226 Difference]: Without dead ends: 185 [2018-04-11 14:28:43,243 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 3 SyntacticMatches, 2 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 39 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=73, Invalid=233, Unknown=0, NotChecked=0, Total=306 [2018-04-11 14:28:43,243 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 185 states. [2018-04-11 14:28:43,245 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 185 to 122. [2018-04-11 14:28:43,245 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 122 states. [2018-04-11 14:28:43,245 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 122 states to 122 states and 136 transitions. [2018-04-11 14:28:43,245 INFO L78 Accepts]: Start accepts. Automaton has 122 states and 136 transitions. Word has length 29 [2018-04-11 14:28:43,245 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-11 14:28:43,245 INFO L459 AbstractCegarLoop]: Abstraction has 122 states and 136 transitions. [2018-04-11 14:28:43,245 INFO L460 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-04-11 14:28:43,245 INFO L276 IsEmpty]: Start isEmpty. Operand 122 states and 136 transitions. [2018-04-11 14:28:43,246 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2018-04-11 14:28:43,246 INFO L347 BasicCegarLoop]: Found error trace [2018-04-11 14:28:43,246 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] [2018-04-11 14:28:43,246 INFO L408 AbstractCegarLoop]: === Iteration 15 === [mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr42EnsuresViolationMEMORY_LEAK, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr21RequiresViolation, mainErr31RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr39RequiresViolation, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr12RequiresViolation, mainErr40AssertViolationMEMORY_FREE, mainErr41AssertViolationMEMORY_FREE, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr9RequiresViolation, mainErr30RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr34RequiresViolation, mainErr4RequiresViolation, mainErr14RequiresViolation, mainErr37RequiresViolation]=== [2018-04-11 14:28:43,246 INFO L82 PathProgramCache]: Analyzing trace with hash 221581916, now seen corresponding path program 1 times [2018-04-11 14:28:43,250 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-04-11 14:28:43,257 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-11 14:28:43,257 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-11 14:28:43,348 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-11 14:28:43,348 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-04-11 14:28:43,348 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2018-04-11 14:28:43,349 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-04-11 14:28:43,349 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 14:28:43,349 INFO L182 omatonBuilderFactory]: Interpolants [4320#(and (= 1 (select (select |#memory_int| main_~head~0.base) (+ main_~x~0.offset 4))) (= main_~head~0.offset main_~x~0.offset) (= main_~head~0.offset 0)), 4321#(and (= 1 (select (select |#memory_int| main_~head~0.base) (+ main_~head~0.offset 4))) (= main_~head~0.offset 0)), 4322#(= 1 (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset 4))), 4323#(= 1 |main_#t~mem11|), 4315#true, 4316#false, 4317#(= 0 |main_#t~malloc0.offset|), 4318#(= main_~head~0.offset 0), 4319#(and (= main_~x~0.offset 0) (= main_~x~0.base main_~head~0.base) (= main_~head~0.offset 0))] [2018-04-11 14:28:43,349 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-11 14:28:43,349 INFO L442 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-04-11 14:28:43,349 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-04-11 14:28:43,349 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2018-04-11 14:28:43,349 INFO L87 Difference]: Start difference. First operand 122 states and 136 transitions. Second operand 9 states. [2018-04-11 14:28:43,577 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-11 14:28:43,577 INFO L93 Difference]: Finished difference Result 199 states and 216 transitions. [2018-04-11 14:28:43,577 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-04-11 14:28:43,578 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 32 [2018-04-11 14:28:43,578 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-11 14:28:43,578 INFO L225 Difference]: With dead ends: 199 [2018-04-11 14:28:43,578 INFO L226 Difference]: Without dead ends: 199 [2018-04-11 14:28:43,579 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 29 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=84, Invalid=188, Unknown=0, NotChecked=0, Total=272 [2018-04-11 14:28:43,579 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 199 states. [2018-04-11 14:28:43,580 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 199 to 126. [2018-04-11 14:28:43,580 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 126 states. [2018-04-11 14:28:43,580 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 126 states to 126 states and 140 transitions. [2018-04-11 14:28:43,581 INFO L78 Accepts]: Start accepts. Automaton has 126 states and 140 transitions. Word has length 32 [2018-04-11 14:28:43,581 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-11 14:28:43,581 INFO L459 AbstractCegarLoop]: Abstraction has 126 states and 140 transitions. [2018-04-11 14:28:43,581 INFO L460 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-04-11 14:28:43,581 INFO L276 IsEmpty]: Start isEmpty. Operand 126 states and 140 transitions. [2018-04-11 14:28:43,581 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2018-04-11 14:28:43,581 INFO L347 BasicCegarLoop]: Found error trace [2018-04-11 14:28:43,581 INFO L355 BasicCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-11 14:28:43,581 INFO L408 AbstractCegarLoop]: === Iteration 16 === [mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr42EnsuresViolationMEMORY_LEAK, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr21RequiresViolation, mainErr31RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr39RequiresViolation, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr12RequiresViolation, mainErr40AssertViolationMEMORY_FREE, mainErr41AssertViolationMEMORY_FREE, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr9RequiresViolation, mainErr30RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr34RequiresViolation, mainErr4RequiresViolation, mainErr14RequiresViolation, mainErr37RequiresViolation]=== [2018-04-11 14:28:43,581 INFO L82 PathProgramCache]: Analyzing trace with hash -1146002921, now seen corresponding path program 1 times [2018-04-11 14:28:43,582 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-04-11 14:28:43,588 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-11 14:28:43,588 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-11 14:28:43,669 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-11 14:28:43,669 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-04-11 14:28:43,669 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [12] total 12 [2018-04-11 14:28:43,669 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-04-11 14:28:43,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 14:28:43,669 INFO L182 omatonBuilderFactory]: Interpolants [4672#(and (= main_~x~0.base (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset)) (not (= main_~x~0.base main_~head~0.base))), 4673#(and (= main_~x~0.base (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset)) (= 1 (select |#valid| main_~x~0.base)) (not (= main_~x~0.base main_~head~0.base))), 4674#(= 1 (select |#valid| (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset))), 4675#(= 1 (select |#valid| (select (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset))), 4676#(= 1 (select |#valid| |main_#t~mem7.base|)), 4677#(= 1 (select |#valid| main_~x~0.base)), 4665#true, 4666#false, 4667#(= 1 (select |#valid| main_~head~0.base)), 4668#(and (= main_~x~0.offset main_~head~0.offset) (= main_~x~0.base main_~head~0.base) (= (select |#valid| main_~x~0.base) 1)), 4669#(and (= main_~x~0.offset main_~head~0.offset) (= main_~x~0.base main_~head~0.base) (not (= main_~x~0.base |main_#t~malloc2.base|))), 4670#(and (not (= main_~x~0.base (select (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset))) (= main_~x~0.offset main_~head~0.offset) (= main_~x~0.base main_~head~0.base)), 4671#(and (not (= main_~head~0.base |main_#t~mem3.base|)) (= |main_#t~mem3.base| (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset)))] [2018-04-11 14:28:43,669 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-11 14:28:43,670 INFO L442 AbstractCegarLoop]: Interpolant automaton has 13 states [2018-04-11 14:28:43,670 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2018-04-11 14:28:43,670 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=128, Unknown=0, NotChecked=0, Total=156 [2018-04-11 14:28:43,670 INFO L87 Difference]: Start difference. First operand 126 states and 140 transitions. Second operand 13 states. [2018-04-11 14:28:44,056 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-11 14:28:44,056 INFO L93 Difference]: Finished difference Result 222 states and 244 transitions. [2018-04-11 14:28:44,056 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2018-04-11 14:28:44,056 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 32 [2018-04-11 14:28:44,057 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-11 14:28:44,057 INFO L225 Difference]: With dead ends: 222 [2018-04-11 14:28:44,057 INFO L226 Difference]: Without dead ends: 222 [2018-04-11 14:28:44,058 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 89 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=144, Invalid=506, Unknown=0, NotChecked=0, Total=650 [2018-04-11 14:28:44,058 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 222 states. [2018-04-11 14:28:44,060 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 222 to 145. [2018-04-11 14:28:44,060 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 145 states. [2018-04-11 14:28:44,061 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 145 states to 145 states and 164 transitions. [2018-04-11 14:28:44,061 INFO L78 Accepts]: Start accepts. Automaton has 145 states and 164 transitions. Word has length 32 [2018-04-11 14:28:44,061 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-11 14:28:44,061 INFO L459 AbstractCegarLoop]: Abstraction has 145 states and 164 transitions. [2018-04-11 14:28:44,061 INFO L460 AbstractCegarLoop]: Interpolant automaton has 13 states. [2018-04-11 14:28:44,061 INFO L276 IsEmpty]: Start isEmpty. Operand 145 states and 164 transitions. [2018-04-11 14:28:44,062 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2018-04-11 14:28:44,062 INFO L347 BasicCegarLoop]: Found error trace [2018-04-11 14:28:44,062 INFO L355 BasicCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-11 14:28:44,062 INFO L408 AbstractCegarLoop]: === Iteration 17 === [mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr42EnsuresViolationMEMORY_LEAK, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr21RequiresViolation, mainErr31RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr39RequiresViolation, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr12RequiresViolation, mainErr40AssertViolationMEMORY_FREE, mainErr41AssertViolationMEMORY_FREE, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr9RequiresViolation, mainErr30RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr34RequiresViolation, mainErr4RequiresViolation, mainErr14RequiresViolation, mainErr37RequiresViolation]=== [2018-04-11 14:28:44,062 INFO L82 PathProgramCache]: Analyzing trace with hash -1146002920, now seen corresponding path program 1 times [2018-04-11 14:28:44,063 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-04-11 14:28:44,071 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-11 14:28:44,072 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-11 14:28:44,202 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-11 14:28:44,202 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-04-11 14:28:44,202 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [11] total 11 [2018-04-11 14:28:44,203 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-04-11 14:28:44,203 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 14:28:44,203 INFO L182 omatonBuilderFactory]: Interpolants [5072#false, 5073#(= 1 (select |#valid| main_~head~0.base)), 5074#(and (= main_~x~0.offset main_~head~0.offset) (= main_~x~0.base main_~head~0.base) (= (select |#valid| main_~x~0.base) 1)), 5075#(and (= 0 |main_#t~malloc2.offset|) (= 8 (select |#length| |main_#t~malloc2.base|)) (= main_~x~0.offset main_~head~0.offset) (= main_~x~0.base main_~head~0.base) (not (= main_~x~0.base |main_#t~malloc2.base|))), 5076#(and (= 8 (select |#length| (select (select |#memory_$Pointer$.base| main_~x~0.base) main_~head~0.offset))) (not (= main_~x~0.base (select (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset))) (= 0 (select (select |#memory_$Pointer$.offset| main_~x~0.base) main_~head~0.offset)) (= main_~x~0.base main_~head~0.base)), 5077#(and (= 8 (select |#length| (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset))) (not (= main_~head~0.base |main_#t~mem3.base|)) (= 0 (select (select |#memory_$Pointer$.offset| main_~head~0.base) main_~head~0.offset))), 5078#(and (= 8 (select |#length| (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset))) (not (= main_~x~0.base main_~head~0.base)) (= 0 (select (select |#memory_$Pointer$.offset| main_~head~0.base) main_~head~0.offset))), 5079#(and (= 8 (select |#length| (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset))) (= 0 (select (select |#memory_$Pointer$.offset| main_~head~0.base) main_~head~0.offset))), 5080#(and (= 8 (select |#length| (select (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset))) (= 0 (select (select |#memory_$Pointer$.offset| main_~x~0.base) main_~x~0.offset))), 5081#(and (= 8 (select |#length| |main_#t~mem7.base|)) (= 0 |main_#t~mem7.offset|)), 5082#(and (= 8 (select |#length| main_~x~0.base)) (= main_~x~0.offset 0)), 5071#true] [2018-04-11 14:28:44,203 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-11 14:28:44,203 INFO L442 AbstractCegarLoop]: Interpolant automaton has 12 states [2018-04-11 14:28:44,203 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2018-04-11 14:28:44,203 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=107, Unknown=0, NotChecked=0, Total=132 [2018-04-11 14:28:44,203 INFO L87 Difference]: Start difference. First operand 145 states and 164 transitions. Second operand 12 states. [2018-04-11 14:28:44,664 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-11 14:28:44,664 INFO L93 Difference]: Finished difference Result 226 states and 251 transitions. [2018-04-11 14:28:44,664 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2018-04-11 14:28:44,664 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 32 [2018-04-11 14:28:44,664 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-11 14:28:44,665 INFO L225 Difference]: With dead ends: 226 [2018-04-11 14:28:44,665 INFO L226 Difference]: Without dead ends: 226 [2018-04-11 14:28:44,665 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 44 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=91, Invalid=329, Unknown=0, NotChecked=0, Total=420 [2018-04-11 14:28:44,665 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 226 states. [2018-04-11 14:28:44,667 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 226 to 153. [2018-04-11 14:28:44,668 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 153 states. [2018-04-11 14:28:44,668 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 153 states to 153 states and 173 transitions. [2018-04-11 14:28:44,668 INFO L78 Accepts]: Start accepts. Automaton has 153 states and 173 transitions. Word has length 32 [2018-04-11 14:28:44,668 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-11 14:28:44,669 INFO L459 AbstractCegarLoop]: Abstraction has 153 states and 173 transitions. [2018-04-11 14:28:44,669 INFO L460 AbstractCegarLoop]: Interpolant automaton has 12 states. [2018-04-11 14:28:44,669 INFO L276 IsEmpty]: Start isEmpty. Operand 153 states and 173 transitions. [2018-04-11 14:28:44,669 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2018-04-11 14:28:44,669 INFO L347 BasicCegarLoop]: Found error trace [2018-04-11 14:28:44,669 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] [2018-04-11 14:28:44,670 INFO L408 AbstractCegarLoop]: === Iteration 18 === [mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr42EnsuresViolationMEMORY_LEAK, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr21RequiresViolation, mainErr31RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr39RequiresViolation, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr12RequiresViolation, mainErr40AssertViolationMEMORY_FREE, mainErr41AssertViolationMEMORY_FREE, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr9RequiresViolation, mainErr30RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr34RequiresViolation, mainErr4RequiresViolation, mainErr14RequiresViolation, mainErr37RequiresViolation]=== [2018-04-11 14:28:44,670 INFO L82 PathProgramCache]: Analyzing trace with hash -1771456283, now seen corresponding path program 1 times [2018-04-11 14:28:44,671 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-04-11 14:28:44,677 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-11 14:28:44,678 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-11 14:28:44,756 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 14:28:44,756 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-04-11 14:28:44,757 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2018-04-11 14:28:44,757 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-04-11 14:28:44,757 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 14:28:44,757 INFO L182 omatonBuilderFactory]: Interpolants [5488#(and (= 0 (select (select |#memory_$Pointer$.offset| main_~x~0.base) main_~x~0.offset)) (= 0 (select (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset))), 5489#(and (= 0 |main_#t~mem13.offset|) (= 0 |main_#t~mem13.base|)), 5490#(and (= 0 main_~x~0.base) (= 0 main_~x~0.offset)), 5480#true, 5481#false, 5482#(and (= main_~x~0.offset main_~head~0.offset) (= main_~x~0.base main_~head~0.base)), 5483#(and (= (select (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset) |main_#t~mem8.base|) (= main_~x~0.offset main_~head~0.offset) (= (select (select |#memory_$Pointer$.offset| main_~x~0.base) main_~x~0.offset) |main_#t~mem8.offset|) (= main_~x~0.base main_~head~0.base)), 5484#(and (= main_~x~0.offset main_~head~0.offset) (= main_~x~0.base main_~head~0.base) (= 0 (select (select |#memory_$Pointer$.offset| main_~x~0.base) main_~x~0.offset)) (= 0 (select (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset))), 5485#(and (= 0 |main_#t~mem9.offset|) (= 0 |main_#t~mem9.base|) (= main_~x~0.offset main_~head~0.offset) (= main_~x~0.base main_~head~0.base)), 5486#(and (= 0 main_~y~0.base) (= main_~x~0.offset main_~head~0.offset) (= 0 main_~y~0.offset) (= main_~x~0.base main_~head~0.base)), 5487#(and (= 0 (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset)) (= 0 (select (select |#memory_$Pointer$.offset| main_~head~0.base) main_~head~0.offset)))] [2018-04-11 14:28:44,757 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 14:28:44,757 INFO L442 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-04-11 14:28:44,757 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-04-11 14:28:44,757 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=85, Unknown=0, NotChecked=0, Total=110 [2018-04-11 14:28:44,757 INFO L87 Difference]: Start difference. First operand 153 states and 173 transitions. Second operand 11 states. [2018-04-11 14:28:44,966 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-11 14:28:44,966 INFO L93 Difference]: Finished difference Result 199 states and 219 transitions. [2018-04-11 14:28:44,966 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2018-04-11 14:28:44,966 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 33 [2018-04-11 14:28:44,966 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-11 14:28:44,967 INFO L225 Difference]: With dead ends: 199 [2018-04-11 14:28:44,967 INFO L226 Difference]: Without dead ends: 199 [2018-04-11 14:28:44,967 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 42 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=72, Invalid=234, Unknown=0, NotChecked=0, Total=306 [2018-04-11 14:28:44,967 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 199 states. [2018-04-11 14:28:44,968 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 199 to 167. [2018-04-11 14:28:44,968 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 167 states. [2018-04-11 14:28:44,969 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 167 states to 167 states and 187 transitions. [2018-04-11 14:28:44,969 INFO L78 Accepts]: Start accepts. Automaton has 167 states and 187 transitions. Word has length 33 [2018-04-11 14:28:44,969 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-11 14:28:44,969 INFO L459 AbstractCegarLoop]: Abstraction has 167 states and 187 transitions. [2018-04-11 14:28:44,969 INFO L460 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-04-11 14:28:44,969 INFO L276 IsEmpty]: Start isEmpty. Operand 167 states and 187 transitions. [2018-04-11 14:28:44,969 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2018-04-11 14:28:44,969 INFO L347 BasicCegarLoop]: Found error trace [2018-04-11 14:28:44,969 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] [2018-04-11 14:28:44,970 INFO L408 AbstractCegarLoop]: === Iteration 19 === [mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr42EnsuresViolationMEMORY_LEAK, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr21RequiresViolation, mainErr31RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr39RequiresViolation, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr12RequiresViolation, mainErr40AssertViolationMEMORY_FREE, mainErr41AssertViolationMEMORY_FREE, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr9RequiresViolation, mainErr30RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr34RequiresViolation, mainErr4RequiresViolation, mainErr14RequiresViolation, mainErr37RequiresViolation]=== [2018-04-11 14:28:44,970 INFO L82 PathProgramCache]: Analyzing trace with hash -776317895, now seen corresponding path program 1 times [2018-04-11 14:28:44,971 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-04-11 14:28:44,976 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-11 14:28:44,976 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-11 14:28:45,016 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 14:28:45,016 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-04-11 14:28:45,017 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2018-04-11 14:28:45,017 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-04-11 14:28:45,017 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 14:28:45,017 INFO L182 omatonBuilderFactory]: Interpolants [5872#false, 5873#(not (= 0 |main_#t~malloc0.base|)), 5874#(not (= 0 main_~head~0.base)), 5875#(not (= 0 (select (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset))), 5876#(not (= 0 (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset))), 5877#(not (= 0 |main_#t~mem13.base|)), 5878#(not (= 0 main_~x~0.base)), 5871#true] [2018-04-11 14:28:45,017 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 14:28:45,017 INFO L442 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-04-11 14:28:45,017 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-04-11 14:28:45,017 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2018-04-11 14:28:45,017 INFO L87 Difference]: Start difference. First operand 167 states and 187 transitions. Second operand 8 states. [2018-04-11 14:28:45,225 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-11 14:28:45,225 INFO L93 Difference]: Finished difference Result 222 states and 243 transitions. [2018-04-11 14:28:45,225 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-04-11 14:28:45,225 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 33 [2018-04-11 14:28:45,225 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-11 14:28:45,226 INFO L225 Difference]: With dead ends: 222 [2018-04-11 14:28:45,226 INFO L226 Difference]: Without dead ends: 222 [2018-04-11 14:28:45,226 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 19 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=53, Invalid=157, Unknown=0, NotChecked=0, Total=210 [2018-04-11 14:28:45,227 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 222 states. [2018-04-11 14:28:45,229 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 222 to 188. [2018-04-11 14:28:45,229 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 188 states. [2018-04-11 14:28:45,230 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 188 states to 188 states and 217 transitions. [2018-04-11 14:28:45,230 INFO L78 Accepts]: Start accepts. Automaton has 188 states and 217 transitions. Word has length 33 [2018-04-11 14:28:45,230 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-11 14:28:45,231 INFO L459 AbstractCegarLoop]: Abstraction has 188 states and 217 transitions. [2018-04-11 14:28:45,231 INFO L460 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-04-11 14:28:45,231 INFO L276 IsEmpty]: Start isEmpty. Operand 188 states and 217 transitions. [2018-04-11 14:28:45,231 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2018-04-11 14:28:45,231 INFO L347 BasicCegarLoop]: Found error trace [2018-04-11 14:28:45,231 INFO L355 BasicCegarLoop]: trace histogram [3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-11 14:28:45,231 INFO L408 AbstractCegarLoop]: === Iteration 20 === [mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr42EnsuresViolationMEMORY_LEAK, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr21RequiresViolation, mainErr31RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr39RequiresViolation, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr12RequiresViolation, mainErr40AssertViolationMEMORY_FREE, mainErr41AssertViolationMEMORY_FREE, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr9RequiresViolation, mainErr30RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr34RequiresViolation, mainErr4RequiresViolation, mainErr14RequiresViolation, mainErr37RequiresViolation]=== [2018-04-11 14:28:45,232 INFO L82 PathProgramCache]: Analyzing trace with hash -1339981119, now seen corresponding path program 2 times [2018-04-11 14:28:45,232 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-04-11 14:28:45,239 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-11 14:28:45,240 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-11 14:28:45,362 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2018-04-11 14:28:45,362 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-04-11 14:28:45,362 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2018-04-11 14:28:45,362 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-04-11 14:28:45,362 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 14:28:45,362 INFO L182 omatonBuilderFactory]: Interpolants [6304#false, 6305#(= 0 |main_#t~malloc0.offset|), 6306#(= main_~head~0.offset 0), 6307#(and (= 0 |main_#t~malloc5.offset|) (= main_~head~0.offset 0)), 6308#(and (= main_~head~0.offset 0) (= 0 main_~x~0.offset)), 6309#(and (= 1 (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset 4))) (= main_~head~0.offset 0) (= 0 main_~x~0.offset)), 6310#(and (= 1 (select (select |#memory_int| main_~x~0.base) (+ 0 4))) (= 0 main_~x~0.offset)), 6311#(and (= 0 main_~head~0.offset) (= 1 (select (select |#memory_int| main_~head~0.base) (+ 0 4)))), 6312#(and (= |main_#t~mem11| (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset 4))) (= 1 (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset 4))) (= main_~x~0.offset 0)), 6303#true] [2018-04-11 14:28:45,362 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2018-04-11 14:28:45,363 INFO L442 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-04-11 14:28:45,363 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-04-11 14:28:45,363 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=66, Unknown=0, NotChecked=0, Total=90 [2018-04-11 14:28:45,363 INFO L87 Difference]: Start difference. First operand 188 states and 217 transitions. Second operand 10 states. [2018-04-11 14:28:45,639 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-11 14:28:45,640 INFO L93 Difference]: Finished difference Result 196 states and 214 transitions. [2018-04-11 14:28:45,640 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2018-04-11 14:28:45,640 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 33 [2018-04-11 14:28:45,640 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-11 14:28:45,641 INFO L225 Difference]: With dead ends: 196 [2018-04-11 14:28:45,641 INFO L226 Difference]: Without dead ends: 196 [2018-04-11 14:28:45,641 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 2 SyntacticMatches, 2 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 50 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=127, Invalid=253, Unknown=0, NotChecked=0, Total=380 [2018-04-11 14:28:45,641 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 196 states. [2018-04-11 14:28:45,644 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 196 to 174. [2018-04-11 14:28:45,644 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 174 states. [2018-04-11 14:28:45,644 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 174 states to 174 states and 196 transitions. [2018-04-11 14:28:45,645 INFO L78 Accepts]: Start accepts. Automaton has 174 states and 196 transitions. Word has length 33 [2018-04-11 14:28:45,645 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-11 14:28:45,645 INFO L459 AbstractCegarLoop]: Abstraction has 174 states and 196 transitions. [2018-04-11 14:28:45,645 INFO L460 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-04-11 14:28:45,645 INFO L276 IsEmpty]: Start isEmpty. Operand 174 states and 196 transitions. [2018-04-11 14:28:45,645 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2018-04-11 14:28:45,645 INFO L347 BasicCegarLoop]: Found error trace [2018-04-11 14:28:45,645 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] [2018-04-11 14:28:45,646 INFO L408 AbstractCegarLoop]: === Iteration 21 === [mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr42EnsuresViolationMEMORY_LEAK, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr21RequiresViolation, mainErr31RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr39RequiresViolation, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr12RequiresViolation, mainErr40AssertViolationMEMORY_FREE, mainErr41AssertViolationMEMORY_FREE, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr9RequiresViolation, mainErr30RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr34RequiresViolation, mainErr4RequiresViolation, mainErr14RequiresViolation, mainErr37RequiresViolation]=== [2018-04-11 14:28:45,646 INFO L82 PathProgramCache]: Analyzing trace with hash -23783762, now seen corresponding path program 1 times [2018-04-11 14:28:45,646 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-04-11 14:28:45,652 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-11 14:28:45,653 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-11 14:28:45,780 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 14:28:45,780 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-04-11 14:28:45,780 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [11] total 11 [2018-04-11 14:28:45,780 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-04-11 14:28:45,780 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 14:28:45,781 INFO L182 omatonBuilderFactory]: Interpolants [6704#false, 6705#(and (= 0 (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset)) (= 1 (select |#valid| main_~head~0.base)) (= 0 (select (select |#memory_$Pointer$.offset| main_~head~0.base) main_~head~0.offset))), 6706#(and (not (= main_~head~0.base |main_#t~malloc5.base|)) (= 0 (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset)) (= 0 (select (select |#memory_$Pointer$.offset| main_~head~0.base) main_~head~0.offset))), 6707#(and (= 0 (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset)) (not (= main_~head~0.base main_~x~0.base)) (= 0 (select (select |#memory_$Pointer$.offset| main_~head~0.base) main_~head~0.offset))), 6708#(and (= 0 (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset)) (select (select |#memory_$Pointer$.offset| main_~x~0.base) main_~x~0.offset))) (= 0 (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset)) (select (select |#memory_$Pointer$.offset| main_~x~0.base) main_~x~0.offset)))), 6709#(and (= 0 (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset)) (select (select |#memory_$Pointer$.offset| main_~head~0.base) main_~head~0.offset))) (= 0 (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset)) (select (select |#memory_$Pointer$.offset| main_~head~0.base) main_~head~0.offset)))), 6710#(and (= 0 (select (select |#memory_$Pointer$.offset| |main_#t~mem13.base|) |main_#t~mem13.offset|)) (= 0 (select (select |#memory_$Pointer$.base| |main_#t~mem13.base|) |main_#t~mem13.offset|))), 6711#(and (= 0 (select (select |#memory_$Pointer$.offset| main_~x~0.base) main_~x~0.offset)) (= 0 (select (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset))), 6712#(and (= 0 |main_#t~mem15.offset|) (= 0 |main_#t~mem15.base|)), 6713#(and (= 0 main_~x~0.base) (= 0 main_~x~0.offset)), 6703#true] [2018-04-11 14:28:45,781 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 14:28:45,781 INFO L442 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-04-11 14:28:45,781 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-04-11 14:28:45,781 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=91, Unknown=0, NotChecked=0, Total=110 [2018-04-11 14:28:45,781 INFO L87 Difference]: Start difference. First operand 174 states and 196 transitions. Second operand 11 states. [2018-04-11 14:28:46,202 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-11 14:28:46,202 INFO L93 Difference]: Finished difference Result 213 states and 235 transitions. [2018-04-11 14:28:46,202 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2018-04-11 14:28:46,202 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 35 [2018-04-11 14:28:46,202 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-11 14:28:46,203 INFO L225 Difference]: With dead ends: 213 [2018-04-11 14:28:46,203 INFO L226 Difference]: Without dead ends: 213 [2018-04-11 14:28:46,203 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 3 SyntacticMatches, 1 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 39 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=72, Invalid=348, Unknown=0, NotChecked=0, Total=420 [2018-04-11 14:28:46,203 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 213 states. [2018-04-11 14:28:46,206 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 213 to 193. [2018-04-11 14:28:46,206 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 193 states. [2018-04-11 14:28:46,207 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 193 states to 193 states and 215 transitions. [2018-04-11 14:28:46,207 INFO L78 Accepts]: Start accepts. Automaton has 193 states and 215 transitions. Word has length 35 [2018-04-11 14:28:46,207 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-11 14:28:46,207 INFO L459 AbstractCegarLoop]: Abstraction has 193 states and 215 transitions. [2018-04-11 14:28:46,207 INFO L460 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-04-11 14:28:46,207 INFO L276 IsEmpty]: Start isEmpty. Operand 193 states and 215 transitions. [2018-04-11 14:28:46,208 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2018-04-11 14:28:46,208 INFO L347 BasicCegarLoop]: Found error trace [2018-04-11 14:28:46,208 INFO L355 BasicCegarLoop]: trace histogram [3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-11 14:28:46,208 INFO L408 AbstractCegarLoop]: === Iteration 22 === [mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr42EnsuresViolationMEMORY_LEAK, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr21RequiresViolation, mainErr31RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr39RequiresViolation, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr12RequiresViolation, mainErr40AssertViolationMEMORY_FREE, mainErr41AssertViolationMEMORY_FREE, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr9RequiresViolation, mainErr30RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr34RequiresViolation, mainErr4RequiresViolation, mainErr14RequiresViolation, mainErr37RequiresViolation]=== [2018-04-11 14:28:46,208 INFO L82 PathProgramCache]: Analyzing trace with hash -1777126719, now seen corresponding path program 2 times [2018-04-11 14:28:46,209 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-04-11 14:28:46,218 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-11 14:28:46,219 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-11 14:28:46,386 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 7 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-11 14:28:46,386 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-04-11 14:28:46,386 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [13] total 13 [2018-04-11 14:28:46,386 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-04-11 14:28:46,387 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 14:28:46,387 INFO L182 omatonBuilderFactory]: Interpolants [7140#true, 7141#false, 7142#(= 1 (select |#valid| main_~head~0.base)), 7143#(and (= main_~x~0.offset main_~head~0.offset) (= main_~x~0.base main_~head~0.base) (= (select |#valid| main_~x~0.base) 1)), 7144#(and (= main_~x~0.offset main_~head~0.offset) (= main_~x~0.base main_~head~0.base) (not (= main_~x~0.base |main_#t~malloc2.base|))), 7145#(and (not (= main_~x~0.base (select (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset))) (= main_~x~0.offset main_~head~0.offset) (= main_~x~0.base main_~head~0.base)), 7146#(and (not (= main_~head~0.base |main_#t~mem3.base|)) (= |main_#t~mem3.offset| (select (select |#memory_$Pointer$.offset| main_~head~0.base) main_~head~0.offset)) (= |main_#t~mem3.base| (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset))), 7147#(and (= main_~x~0.offset (select (select |#memory_$Pointer$.offset| main_~head~0.base) main_~head~0.offset)) (= main_~x~0.base (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset)) (not (= main_~x~0.base main_~head~0.base))), 7148#(and (= 0 (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset)) (select (select |#memory_$Pointer$.offset| main_~head~0.base) main_~head~0.offset))) (= 0 (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset)) (select (select |#memory_$Pointer$.offset| main_~head~0.base) main_~head~0.offset)))), 7149#(and (= 0 (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset)) (select (select |#memory_$Pointer$.offset| main_~x~0.base) main_~x~0.offset))) (= 0 (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset)) (select (select |#memory_$Pointer$.offset| main_~x~0.base) main_~x~0.offset)))), 7150#(and (= 0 (select (select |#memory_$Pointer$.offset| |main_#t~mem7.base|) |main_#t~mem7.offset|)) (= 0 (select (select |#memory_$Pointer$.base| |main_#t~mem7.base|) |main_#t~mem7.offset|))), 7151#(and (= 0 (select (select |#memory_$Pointer$.offset| main_~x~0.base) main_~x~0.offset)) (= 0 (select (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset))), 7152#(and (= |main_#t~mem8.base| 0) (= |main_#t~mem8.offset| 0))] [2018-04-11 14:28:46,387 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 7 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-11 14:28:46,387 INFO L442 AbstractCegarLoop]: Interpolant automaton has 13 states [2018-04-11 14:28:46,387 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2018-04-11 14:28:46,388 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=132, Unknown=0, NotChecked=0, Total=156 [2018-04-11 14:28:46,388 INFO L87 Difference]: Start difference. First operand 193 states and 215 transitions. Second operand 13 states. [2018-04-11 14:28:46,919 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-11 14:28:46,920 INFO L93 Difference]: Finished difference Result 219 states and 236 transitions. [2018-04-11 14:28:46,920 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2018-04-11 14:28:46,920 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 38 [2018-04-11 14:28:46,920 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-11 14:28:46,920 INFO L225 Difference]: With dead ends: 219 [2018-04-11 14:28:46,921 INFO L226 Difference]: Without dead ends: 219 [2018-04-11 14:28:46,921 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 2 SyntacticMatches, 2 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 54 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=101, Invalid=451, Unknown=0, NotChecked=0, Total=552 [2018-04-11 14:28:46,921 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 219 states. [2018-04-11 14:28:46,922 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 219 to 192. [2018-04-11 14:28:46,922 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 192 states. [2018-04-11 14:28:46,923 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 192 states to 192 states and 212 transitions. [2018-04-11 14:28:46,923 INFO L78 Accepts]: Start accepts. Automaton has 192 states and 212 transitions. Word has length 38 [2018-04-11 14:28:46,923 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-11 14:28:46,923 INFO L459 AbstractCegarLoop]: Abstraction has 192 states and 212 transitions. [2018-04-11 14:28:46,923 INFO L460 AbstractCegarLoop]: Interpolant automaton has 13 states. [2018-04-11 14:28:46,923 INFO L276 IsEmpty]: Start isEmpty. Operand 192 states and 212 transitions. [2018-04-11 14:28:46,923 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2018-04-11 14:28:46,923 INFO L347 BasicCegarLoop]: Found error trace [2018-04-11 14:28:46,923 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] [2018-04-11 14:28:46,923 INFO L408 AbstractCegarLoop]: === Iteration 23 === [mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr42EnsuresViolationMEMORY_LEAK, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr21RequiresViolation, mainErr31RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr39RequiresViolation, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr12RequiresViolation, mainErr40AssertViolationMEMORY_FREE, mainErr41AssertViolationMEMORY_FREE, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr9RequiresViolation, mainErr30RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr34RequiresViolation, mainErr4RequiresViolation, mainErr14RequiresViolation, mainErr37RequiresViolation]=== [2018-04-11 14:28:46,924 INFO L82 PathProgramCache]: Analyzing trace with hash -362550985, now seen corresponding path program 1 times [2018-04-11 14:28:46,924 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-04-11 14:28:46,927 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-11 14:28:46,928 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-11 14:28:46,941 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 14:28:46,941 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-04-11 14:28:46,941 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-04-11 14:28:46,941 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-04-11 14:28:46,941 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 14:28:46,941 INFO L182 omatonBuilderFactory]: Interpolants [7586#true, 7587#false, 7588#(not (= 0 |main_#t~malloc5.base|)), 7589#(not (= 0 main_~x~0.base)), 7590#(not (= 0 main_~head~0.base))] [2018-04-11 14:28:46,942 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 14:28:46,942 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-04-11 14:28:46,942 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-04-11 14:28:46,942 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-04-11 14:28:46,942 INFO L87 Difference]: Start difference. First operand 192 states and 212 transitions. Second operand 5 states. [2018-04-11 14:28:47,001 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-11 14:28:47,002 INFO L93 Difference]: Finished difference Result 218 states and 234 transitions. [2018-04-11 14:28:47,002 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-04-11 14:28:47,002 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 39 [2018-04-11 14:28:47,002 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-11 14:28:47,002 INFO L225 Difference]: With dead ends: 218 [2018-04-11 14:28:47,003 INFO L226 Difference]: Without dead ends: 218 [2018-04-11 14:28:47,003 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 3 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 14:28:47,003 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 218 states. [2018-04-11 14:28:47,004 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 218 to 181. [2018-04-11 14:28:47,004 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 181 states. [2018-04-11 14:28:47,004 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 181 states to 181 states and 196 transitions. [2018-04-11 14:28:47,004 INFO L78 Accepts]: Start accepts. Automaton has 181 states and 196 transitions. Word has length 39 [2018-04-11 14:28:47,005 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-11 14:28:47,005 INFO L459 AbstractCegarLoop]: Abstraction has 181 states and 196 transitions. [2018-04-11 14:28:47,005 INFO L460 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-04-11 14:28:47,005 INFO L276 IsEmpty]: Start isEmpty. Operand 181 states and 196 transitions. [2018-04-11 14:28:47,005 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2018-04-11 14:28:47,005 INFO L347 BasicCegarLoop]: Found error trace [2018-04-11 14:28:47,005 INFO L355 BasicCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-11 14:28:47,005 INFO L408 AbstractCegarLoop]: === Iteration 24 === [mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr42EnsuresViolationMEMORY_LEAK, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr21RequiresViolation, mainErr31RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr39RequiresViolation, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr12RequiresViolation, mainErr40AssertViolationMEMORY_FREE, mainErr41AssertViolationMEMORY_FREE, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr9RequiresViolation, mainErr30RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr34RequiresViolation, mainErr4RequiresViolation, mainErr14RequiresViolation, mainErr37RequiresViolation]=== [2018-04-11 14:28:47,005 INFO L82 PathProgramCache]: Analyzing trace with hash 825125319, now seen corresponding path program 3 times [2018-04-11 14:28:47,006 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-04-11 14:28:47,013 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-11 14:28:47,013 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-11 14:28:47,124 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 0 proven. 17 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-11 14:28:47,124 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-04-11 14:28:47,124 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [15] total 15 [2018-04-11 14:28:47,124 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-04-11 14:28:47,124 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 14:28:47,124 INFO L182 omatonBuilderFactory]: Interpolants [8000#(and (= main_~x~0.offset main_~head~0.offset) (= main_~x~0.base main_~head~0.base) (not (= main_~x~0.base |main_#t~malloc2.base|))), 8001#(and (not (= main_~x~0.base (select (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset))) (= main_~x~0.offset main_~head~0.offset) (= main_~x~0.base main_~head~0.base) (= (select |#valid| main_~x~0.base) 1)), 8002#(and (not (= main_~head~0.base |main_#t~mem3.base|)) (= |main_#t~mem3.base| (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset)) (= (select |#valid| main_~head~0.base) 1)), 8003#(and (= main_~x~0.base (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset)) (= (select |#valid| main_~head~0.base) 1) (not (= main_~x~0.base main_~head~0.base))), 8004#(and (= main_~x~0.base (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset)) (not (= main_~x~0.base main_~head~0.base)) (not (= main_~head~0.base |main_#t~malloc2.base|))), 8005#(and (= 1 (select |#valid| (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset))) (not (= main_~head~0.base (select (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset)))), 8006#(and (not (= main_~head~0.base |main_#t~mem3.base|)) (= 1 (select |#valid| (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset)))), 8007#(and (= 1 (select |#valid| (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset))) (not (= main_~x~0.base main_~head~0.base))), 8008#(= 1 (select |#valid| (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset))), 8009#(= 1 (select |#valid| (select (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset))), 8010#(= 1 (select |#valid| |main_#t~mem7.base|)), 8011#(= 1 (select |#valid| main_~x~0.base)), 7996#true, 7997#false, 7998#(= 1 (select |#valid| main_~head~0.base)), 7999#(and (= main_~x~0.offset main_~head~0.offset) (= main_~x~0.base main_~head~0.base) (= (select |#valid| main_~x~0.base) 1))] [2018-04-11 14:28:47,124 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 0 proven. 17 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-11 14:28:47,124 INFO L442 AbstractCegarLoop]: Interpolant automaton has 16 states [2018-04-11 14:28:47,125 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2018-04-11 14:28:47,125 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=39, Invalid=201, Unknown=0, NotChecked=0, Total=240 [2018-04-11 14:28:47,125 INFO L87 Difference]: Start difference. First operand 181 states and 196 transitions. Second operand 16 states. [2018-04-11 14:28:47,713 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-11 14:28:47,713 INFO L93 Difference]: Finished difference Result 285 states and 307 transitions. [2018-04-11 14:28:47,714 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2018-04-11 14:28:47,714 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 41 [2018-04-11 14:28:47,714 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-11 14:28:47,715 INFO L225 Difference]: With dead ends: 285 [2018-04-11 14:28:47,715 INFO L226 Difference]: Without dead ends: 285 [2018-04-11 14:28:47,715 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 35 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 32 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 178 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=233, Invalid=889, Unknown=0, NotChecked=0, Total=1122 [2018-04-11 14:28:47,715 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 285 states. [2018-04-11 14:28:47,717 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 285 to 200. [2018-04-11 14:28:47,717 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 200 states. [2018-04-11 14:28:47,717 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 200 states to 200 states and 220 transitions. [2018-04-11 14:28:47,717 INFO L78 Accepts]: Start accepts. Automaton has 200 states and 220 transitions. Word has length 41 [2018-04-11 14:28:47,717 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-11 14:28:47,717 INFO L459 AbstractCegarLoop]: Abstraction has 200 states and 220 transitions. [2018-04-11 14:28:47,717 INFO L460 AbstractCegarLoop]: Interpolant automaton has 16 states. [2018-04-11 14:28:47,717 INFO L276 IsEmpty]: Start isEmpty. Operand 200 states and 220 transitions. [2018-04-11 14:28:47,718 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2018-04-11 14:28:47,718 INFO L347 BasicCegarLoop]: Found error trace [2018-04-11 14:28:47,718 INFO L355 BasicCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-11 14:28:47,718 INFO L408 AbstractCegarLoop]: === Iteration 25 === [mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr42EnsuresViolationMEMORY_LEAK, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr21RequiresViolation, mainErr31RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr39RequiresViolation, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr12RequiresViolation, mainErr40AssertViolationMEMORY_FREE, mainErr41AssertViolationMEMORY_FREE, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr9RequiresViolation, mainErr30RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr34RequiresViolation, mainErr4RequiresViolation, mainErr14RequiresViolation, mainErr37RequiresViolation]=== [2018-04-11 14:28:47,718 INFO L82 PathProgramCache]: Analyzing trace with hash 825125320, now seen corresponding path program 2 times [2018-04-11 14:28:47,719 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-04-11 14:28:47,728 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-11 14:28:47,728 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-11 14:28:47,881 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 0 proven. 17 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-11 14:28:47,881 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-04-11 14:28:47,881 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [15] total 15 [2018-04-11 14:28:47,881 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-04-11 14:28:47,881 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 14:28:47,881 INFO L182 omatonBuilderFactory]: Interpolants [8544#(and (= 8 (select |#length| (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset))) (not (= main_~x~0.base main_~head~0.base)) (= 0 (select (select |#memory_$Pointer$.offset| main_~head~0.base) main_~head~0.offset))), 8545#(and (= 8 (select |#length| (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset))) (= 0 (select (select |#memory_$Pointer$.offset| main_~head~0.base) main_~head~0.offset))), 8546#(and (= 8 (select |#length| (select (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset))) (= 0 (select (select |#memory_$Pointer$.offset| main_~x~0.base) main_~x~0.offset))), 8547#(and (= 8 (select |#length| |main_#t~mem7.base|)) (= 0 |main_#t~mem7.offset|)), 8548#(and (= 8 (select |#length| main_~x~0.base)) (= main_~x~0.offset 0)), 8533#true, 8534#false, 8535#(= 1 (select |#valid| main_~head~0.base)), 8536#(and (= main_~x~0.offset main_~head~0.offset) (= main_~x~0.base main_~head~0.base) (= (select |#valid| main_~x~0.base) 1)), 8537#(and (= 0 |main_#t~malloc2.offset|) (= 8 (select |#length| |main_#t~malloc2.base|)) (= main_~x~0.offset main_~head~0.offset) (= main_~x~0.base main_~head~0.base) (not (= main_~x~0.base |main_#t~malloc2.base|))), 8538#(and (= 8 (select |#length| (select (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset))) (not (= main_~x~0.base (select (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset))) (= main_~x~0.offset main_~head~0.offset) (= 0 (select (select |#memory_$Pointer$.offset| main_~x~0.base) main_~head~0.offset)) (= main_~x~0.base main_~head~0.base) (= (select |#valid| main_~x~0.base) 1)), 8539#(and (= 8 (select |#length| |main_#t~mem3.base|)) (not (= main_~head~0.base |main_#t~mem3.base|)) (= |main_#t~mem3.base| (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset)) (= (select |#valid| main_~head~0.base) 1) (= 0 (select (select |#memory_$Pointer$.offset| main_~head~0.base) main_~head~0.offset))), 8540#(and (= main_~x~0.base (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset)) (= 8 (select |#length| main_~x~0.base)) (= (select |#valid| main_~head~0.base) 1) (not (= main_~x~0.base main_~head~0.base)) (= 0 (select (select |#memory_$Pointer$.offset| main_~head~0.base) main_~head~0.offset))), 8541#(and (= main_~x~0.base (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset)) (= 8 (select |#length| main_~x~0.base)) (not (= main_~x~0.base main_~head~0.base)) (not (= main_~head~0.base |main_#t~malloc2.base|)) (= 0 (select (select |#memory_$Pointer$.offset| main_~head~0.base) main_~head~0.offset))), 8542#(and (= main_~x~0.base (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset)) (= 8 (select |#length| main_~x~0.base)) (not (= main_~head~0.base (select (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset))) (= 0 (select (select |#memory_$Pointer$.offset| main_~head~0.base) main_~head~0.offset))), 8543#(and (= 8 (select |#length| (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset))) (not (= main_~head~0.base |main_#t~mem3.base|)) (= 0 (select (select |#memory_$Pointer$.offset| main_~head~0.base) main_~head~0.offset)))] [2018-04-11 14:28:47,882 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 0 proven. 17 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-11 14:28:47,882 INFO L442 AbstractCegarLoop]: Interpolant automaton has 16 states [2018-04-11 14:28:47,882 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2018-04-11 14:28:47,882 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=45, Invalid=195, Unknown=0, NotChecked=0, Total=240 [2018-04-11 14:28:47,882 INFO L87 Difference]: Start difference. First operand 200 states and 220 transitions. Second operand 16 states. [2018-04-11 14:28:48,367 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-11 14:28:48,367 INFO L93 Difference]: Finished difference Result 276 states and 300 transitions. [2018-04-11 14:28:48,367 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2018-04-11 14:28:48,367 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 41 [2018-04-11 14:28:48,368 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-11 14:28:48,368 INFO L225 Difference]: With dead ends: 276 [2018-04-11 14:28:48,368 INFO L226 Difference]: Without dead ends: 276 [2018-04-11 14:28:48,369 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 31 GetRequests, 3 SyntacticMatches, 1 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 131 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=161, Invalid=651, Unknown=0, NotChecked=0, Total=812 [2018-04-11 14:28:48,369 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 276 states. [2018-04-11 14:28:48,371 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 276 to 202. [2018-04-11 14:28:48,371 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 202 states. [2018-04-11 14:28:48,372 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 202 states to 202 states and 223 transitions. [2018-04-11 14:28:48,372 INFO L78 Accepts]: Start accepts. Automaton has 202 states and 223 transitions. Word has length 41 [2018-04-11 14:28:48,372 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-11 14:28:48,372 INFO L459 AbstractCegarLoop]: Abstraction has 202 states and 223 transitions. [2018-04-11 14:28:48,372 INFO L460 AbstractCegarLoop]: Interpolant automaton has 16 states. [2018-04-11 14:28:48,372 INFO L276 IsEmpty]: Start isEmpty. Operand 202 states and 223 transitions. [2018-04-11 14:28:48,373 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2018-04-11 14:28:48,373 INFO L347 BasicCegarLoop]: Found error trace [2018-04-11 14:28:48,373 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] [2018-04-11 14:28:48,373 INFO L408 AbstractCegarLoop]: === Iteration 26 === [mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr42EnsuresViolationMEMORY_LEAK, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr21RequiresViolation, mainErr31RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr39RequiresViolation, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr12RequiresViolation, mainErr40AssertViolationMEMORY_FREE, mainErr41AssertViolationMEMORY_FREE, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr9RequiresViolation, mainErr30RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr34RequiresViolation, mainErr4RequiresViolation, mainErr14RequiresViolation, mainErr37RequiresViolation]=== [2018-04-11 14:28:48,373 INFO L82 PathProgramCache]: Analyzing trace with hash 309460647, now seen corresponding path program 1 times [2018-04-11 14:28:48,374 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-04-11 14:28:48,380 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-11 14:28:48,381 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-11 14:28:48,453 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 14:28:48,454 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-04-11 14:28:48,454 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9] total 9 [2018-04-11 14:28:48,454 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-04-11 14:28:48,454 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 14:28:48,454 INFO L182 omatonBuilderFactory]: Interpolants [9056#(and (= (select (select |#memory_$Pointer$.offset| main_~head~0.base) main_~head~0.offset) |main_#t~mem13.offset|) (= (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset) |main_#t~mem13.base|)), 9057#(and (= (select (select |#memory_$Pointer$.offset| main_~head~0.base) main_~head~0.offset) main_~x~0.offset) (= (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset) main_~x~0.base)), 9058#(and (= 0 (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset)) (= 0 (select (select |#memory_$Pointer$.offset| main_~head~0.base) main_~head~0.offset))), 9059#(and (= 0 (select (select |#memory_$Pointer$.offset| main_~x~0.base) main_~x~0.offset)) (= 0 (select (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset))), 9060#(and (= 0 |main_#t~mem16.offset|) (= 0 |main_#t~mem16.base|)), 9061#(and (= 0 main_~x~0.base) (= 0 main_~x~0.offset)), 9053#true, 9054#false, 9055#(and (= main_~x~0.offset main_~head~0.offset) (= main_~x~0.base main_~head~0.base))] [2018-04-11 14:28:48,454 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 14:28:48,454 INFO L442 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-04-11 14:28:48,455 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-04-11 14:28:48,455 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2018-04-11 14:28:48,455 INFO L87 Difference]: Start difference. First operand 202 states and 223 transitions. Second operand 9 states. [2018-04-11 14:28:48,662 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-11 14:28:48,662 INFO L93 Difference]: Finished difference Result 234 states and 255 transitions. [2018-04-11 14:28:48,662 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-04-11 14:28:48,662 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 43 [2018-04-11 14:28:48,662 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-11 14:28:48,663 INFO L225 Difference]: With dead ends: 234 [2018-04-11 14:28:48,663 INFO L226 Difference]: Without dead ends: 234 [2018-04-11 14:28:48,663 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=36, Invalid=120, Unknown=0, NotChecked=0, Total=156 [2018-04-11 14:28:48,663 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 234 states. [2018-04-11 14:28:48,664 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 234 to 217. [2018-04-11 14:28:48,664 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 217 states. [2018-04-11 14:28:48,665 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 217 states to 217 states and 239 transitions. [2018-04-11 14:28:48,665 INFO L78 Accepts]: Start accepts. Automaton has 217 states and 239 transitions. Word has length 43 [2018-04-11 14:28:48,665 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-11 14:28:48,665 INFO L459 AbstractCegarLoop]: Abstraction has 217 states and 239 transitions. [2018-04-11 14:28:48,665 INFO L460 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-04-11 14:28:48,665 INFO L276 IsEmpty]: Start isEmpty. Operand 217 states and 239 transitions. [2018-04-11 14:28:48,665 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2018-04-11 14:28:48,665 INFO L347 BasicCegarLoop]: Found error trace [2018-04-11 14:28:48,666 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] [2018-04-11 14:28:48,666 INFO L408 AbstractCegarLoop]: === Iteration 27 === [mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr42EnsuresViolationMEMORY_LEAK, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr21RequiresViolation, mainErr31RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr39RequiresViolation, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr12RequiresViolation, mainErr40AssertViolationMEMORY_FREE, mainErr41AssertViolationMEMORY_FREE, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr9RequiresViolation, mainErr30RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr34RequiresViolation, mainErr4RequiresViolation, mainErr14RequiresViolation, mainErr37RequiresViolation]=== [2018-04-11 14:28:48,666 INFO L82 PathProgramCache]: Analyzing trace with hash 1398575738, now seen corresponding path program 1 times [2018-04-11 14:28:48,666 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-04-11 14:28:48,672 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-11 14:28:48,673 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-11 14:28:48,822 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-11 14:28:48,822 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-04-11 14:28:48,822 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [14] total 14 [2018-04-11 14:28:48,822 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-04-11 14:28:48,823 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 14:28:48,823 INFO L182 omatonBuilderFactory]: Interpolants [9536#(= 1 (select |#valid| main_~x~0.base)), 9522#true, 9523#false, 9524#(= 1 (select |#valid| main_~head~0.base)), 9525#(and (= main_~x~0.offset main_~head~0.offset) (= main_~x~0.base main_~head~0.base) (= (select |#valid| main_~x~0.base) 1)), 9526#(and (= 1 (select |#valid| |main_#t~malloc2.base|)) (= main_~x~0.offset main_~head~0.offset) (= main_~x~0.base main_~head~0.base) (not (= main_~x~0.base |main_#t~malloc2.base|))), 9527#(and (= 1 (select |#valid| (select (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset))) (not (= main_~x~0.base (select (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset))) (= main_~x~0.offset main_~head~0.offset) (= main_~x~0.base main_~head~0.base)), 9528#(and (not (= main_~head~0.base |main_#t~mem3.base|)) (= 1 (select |#valid| (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset)))), 9529#(and (= 1 (select |#valid| (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset))) (not (= main_~x~0.base main_~head~0.base))), 9530#(= 1 (select |#valid| (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset))), 9531#(and (= 1 (select |#valid| (select (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset))) (= main_~x~0.offset main_~head~0.offset) (= main_~x~0.base main_~head~0.base)), 9532#(and (= 1 (select |#valid| |main_#t~mem9.base|)) (= main_~x~0.offset main_~head~0.offset) (= main_~x~0.base main_~head~0.base)), 9533#(and (= 1 (select |#valid| main_~y~0.base)) (= main_~x~0.offset main_~head~0.offset) (= main_~x~0.base main_~head~0.base)), 9534#(= 1 (select |#valid| (select (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset))), 9535#(= 1 (select |#valid| |main_#t~mem13.base|))] [2018-04-11 14:28:48,823 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-11 14:28:48,823 INFO L442 AbstractCegarLoop]: Interpolant automaton has 15 states [2018-04-11 14:28:48,823 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2018-04-11 14:28:48,823 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=174, Unknown=0, NotChecked=0, Total=210 [2018-04-11 14:28:48,823 INFO L87 Difference]: Start difference. First operand 217 states and 239 transitions. Second operand 15 states. [2018-04-11 14:28:49,306 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-11 14:28:49,307 INFO L93 Difference]: Finished difference Result 286 states and 310 transitions. [2018-04-11 14:28:49,307 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2018-04-11 14:28:49,307 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 43 [2018-04-11 14:28:49,307 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-11 14:28:49,308 INFO L225 Difference]: With dead ends: 286 [2018-04-11 14:28:49,308 INFO L226 Difference]: Without dead ends: 286 [2018-04-11 14:28:49,308 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 35 GetRequests, 5 SyntacticMatches, 1 SemanticMatches, 29 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 138 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=212, Invalid=718, Unknown=0, NotChecked=0, Total=930 [2018-04-11 14:28:49,308 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 286 states. [2018-04-11 14:28:49,310 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 286 to 232. [2018-04-11 14:28:49,310 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 232 states. [2018-04-11 14:28:49,310 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 232 states to 232 states and 256 transitions. [2018-04-11 14:28:49,310 INFO L78 Accepts]: Start accepts. Automaton has 232 states and 256 transitions. Word has length 43 [2018-04-11 14:28:49,310 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-11 14:28:49,310 INFO L459 AbstractCegarLoop]: Abstraction has 232 states and 256 transitions. [2018-04-11 14:28:49,310 INFO L460 AbstractCegarLoop]: Interpolant automaton has 15 states. [2018-04-11 14:28:49,311 INFO L276 IsEmpty]: Start isEmpty. Operand 232 states and 256 transitions. [2018-04-11 14:28:49,311 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2018-04-11 14:28:49,311 INFO L347 BasicCegarLoop]: Found error trace [2018-04-11 14:28:49,311 INFO L355 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-11 14:28:49,311 INFO L408 AbstractCegarLoop]: === Iteration 28 === [mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr42EnsuresViolationMEMORY_LEAK, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr21RequiresViolation, mainErr31RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr39RequiresViolation, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr12RequiresViolation, mainErr40AssertViolationMEMORY_FREE, mainErr41AssertViolationMEMORY_FREE, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr9RequiresViolation, mainErr30RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr34RequiresViolation, mainErr4RequiresViolation, mainErr14RequiresViolation, mainErr37RequiresViolation]=== [2018-04-11 14:28:49,311 INFO L82 PathProgramCache]: Analyzing trace with hash 1398575739, now seen corresponding path program 1 times [2018-04-11 14:28:49,312 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-04-11 14:28:49,319 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-11 14:28:49,319 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-11 14:28:49,503 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-11 14:28:49,503 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-04-11 14:28:49,504 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [15] total 15 [2018-04-11 14:28:49,504 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-04-11 14:28:49,504 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 14:28:49,504 INFO L182 omatonBuilderFactory]: Interpolants [10087#true, 10088#false, 10089#(= 1 (select |#valid| main_~head~0.base)), 10090#(and (= main_~x~0.offset main_~head~0.offset) (= main_~x~0.base main_~head~0.base) (= (select |#valid| main_~x~0.base) 1)), 10091#(and (= 0 |main_#t~malloc2.offset|) (= 8 (select |#length| |main_#t~malloc2.base|)) (= main_~x~0.offset main_~head~0.offset) (= main_~x~0.base main_~head~0.base) (not (= main_~x~0.base |main_#t~malloc2.base|))), 10092#(and (= 8 (select |#length| (select (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset))) (not (= main_~x~0.base (select (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset))) (= main_~x~0.offset main_~head~0.offset) (= 0 (select (select |#memory_$Pointer$.offset| main_~x~0.base) main_~head~0.offset)) (= main_~x~0.base main_~head~0.base)), 10093#(and (= 8 (select |#length| (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset))) (not (= main_~head~0.base |main_#t~mem3.base|)) (= 0 (select (select |#memory_$Pointer$.offset| main_~head~0.base) main_~head~0.offset))), 10094#(and (= 8 (select |#length| (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset))) (not (= main_~x~0.base main_~head~0.base)) (= 0 (select (select |#memory_$Pointer$.offset| main_~head~0.base) main_~head~0.offset))), 10095#(and (= 8 (select |#length| (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset))) (= 0 (select (select |#memory_$Pointer$.offset| main_~head~0.base) main_~head~0.offset))), 10096#(and (= 8 (select |#length| (select (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset))) (= main_~x~0.offset main_~head~0.offset) (= main_~x~0.base main_~head~0.base) (= 0 (select (select |#memory_$Pointer$.offset| main_~x~0.base) main_~x~0.offset))), 10097#(and (= main_~x~0.offset main_~head~0.offset) (= 8 (select |#length| |main_#t~mem9.base|)) (= |main_#t~mem9.offset| (select (select |#memory_$Pointer$.offset| main_~x~0.base) main_~x~0.offset)) (= main_~x~0.base main_~head~0.base) (= 0 (select (select |#memory_$Pointer$.offset| main_~x~0.base) main_~x~0.offset))), 10098#(and (= main_~y~0.offset (select (select |#memory_$Pointer$.offset| main_~x~0.base) main_~x~0.offset)) (= main_~x~0.offset main_~head~0.offset) (= 8 (select |#length| main_~y~0.base)) (= main_~x~0.base main_~head~0.base) (= 0 (select (select |#memory_$Pointer$.offset| main_~x~0.base) main_~x~0.offset))), 10099#(and (= main_~x~0.offset main_~head~0.offset) (= 0 main_~y~0.offset) (= 8 (select |#length| main_~y~0.base)) (= main_~x~0.base main_~head~0.base)), 10100#(and (= 8 (select |#length| (select (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset))) (= 0 (select (select |#memory_$Pointer$.offset| main_~x~0.base) main_~x~0.offset))), 10101#(and (= 8 (select |#length| |main_#t~mem13.base|)) (= 0 |main_#t~mem13.offset|)), 10102#(and (= 8 (select |#length| main_~x~0.base)) (= 0 main_~x~0.offset))] [2018-04-11 14:28:49,504 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-11 14:28:49,504 INFO L442 AbstractCegarLoop]: Interpolant automaton has 16 states [2018-04-11 14:28:49,504 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2018-04-11 14:28:49,505 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=202, Unknown=0, NotChecked=0, Total=240 [2018-04-11 14:28:49,505 INFO L87 Difference]: Start difference. First operand 232 states and 256 transitions. Second operand 16 states. [2018-04-11 14:28:50,108 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-11 14:28:50,108 INFO L93 Difference]: Finished difference Result 309 states and 334 transitions. [2018-04-11 14:28:50,108 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2018-04-11 14:28:50,108 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 43 [2018-04-11 14:28:50,109 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-11 14:28:50,109 INFO L225 Difference]: With dead ends: 309 [2018-04-11 14:28:50,109 INFO L226 Difference]: Without dead ends: 309 [2018-04-11 14:28:50,110 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 31 GetRequests, 4 SyntacticMatches, 2 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 92 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=134, Invalid=568, Unknown=0, NotChecked=0, Total=702 [2018-04-11 14:28:50,110 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 309 states. [2018-04-11 14:28:50,111 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 309 to 231. [2018-04-11 14:28:50,111 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 231 states. [2018-04-11 14:28:50,112 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 231 states to 231 states and 254 transitions. [2018-04-11 14:28:50,112 INFO L78 Accepts]: Start accepts. Automaton has 231 states and 254 transitions. Word has length 43 [2018-04-11 14:28:50,112 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-11 14:28:50,112 INFO L459 AbstractCegarLoop]: Abstraction has 231 states and 254 transitions. [2018-04-11 14:28:50,112 INFO L460 AbstractCegarLoop]: Interpolant automaton has 16 states. [2018-04-11 14:28:50,112 INFO L276 IsEmpty]: Start isEmpty. Operand 231 states and 254 transitions. [2018-04-11 14:28:50,112 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2018-04-11 14:28:50,112 INFO L347 BasicCegarLoop]: Found error trace [2018-04-11 14:28:50,113 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] [2018-04-11 14:28:50,113 INFO L408 AbstractCegarLoop]: === Iteration 29 === [mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr42EnsuresViolationMEMORY_LEAK, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr21RequiresViolation, mainErr31RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr39RequiresViolation, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr12RequiresViolation, mainErr40AssertViolationMEMORY_FREE, mainErr41AssertViolationMEMORY_FREE, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr9RequiresViolation, mainErr30RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr34RequiresViolation, mainErr4RequiresViolation, mainErr14RequiresViolation, mainErr37RequiresViolation]=== [2018-04-11 14:28:50,113 INFO L82 PathProgramCache]: Analyzing trace with hash 1003344041, now seen corresponding path program 1 times [2018-04-11 14:28:50,113 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-04-11 14:28:50,120 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-04-11 14:28:50,129 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-04-11 14:28:50,150 INFO L421 BasicCegarLoop]: Counterexample might be feasible [2018-04-11 14:28:50,164 WARN L343 cessorBacktranslator]: Generated EnsuresSpecification ensures #valid == old(#valid); is not ensure(true) [2018-04-11 14:28:50,178 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 11.04 02:28:50 BoogieIcfgContainer [2018-04-11 14:28:50,178 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-04-11 14:28:50,179 INFO L168 Benchmark]: Toolchain (without parser) took 11273.52 ms. Allocated memory was 401.1 MB in the beginning and 765.5 MB in the end (delta: 364.4 MB). Free memory was 333.9 MB in the beginning and 625.4 MB in the end (delta: -291.5 MB). Peak memory consumption was 72.9 MB. Max. memory is 5.3 GB. [2018-04-11 14:28:50,180 INFO L168 Benchmark]: CDTParser took 0.15 ms. Allocated memory is still 401.1 MB. Free memory is still 359.7 MB. There was no memory consumed. Max. memory is 5.3 GB. [2018-04-11 14:28:50,180 INFO L168 Benchmark]: CACSL2BoogieTranslator took 249.92 ms. Allocated memory is still 401.1 MB. Free memory was 333.9 MB in the beginning and 304.8 MB in the end (delta: 29.1 MB). Peak memory consumption was 29.1 MB. Max. memory is 5.3 GB. [2018-04-11 14:28:50,180 INFO L168 Benchmark]: Boogie Preprocessor took 40.41 ms. Allocated memory is still 401.1 MB. Free memory was 304.8 MB in the beginning and 302.2 MB in the end (delta: 2.6 MB). Peak memory consumption was 2.6 MB. Max. memory is 5.3 GB. [2018-04-11 14:28:50,181 INFO L168 Benchmark]: RCFGBuilder took 471.25 ms. Allocated memory was 401.1 MB in the beginning and 586.7 MB in the end (delta: 185.6 MB). Free memory was 302.2 MB in the beginning and 510.7 MB in the end (delta: -208.5 MB). Peak memory consumption was 22.8 MB. Max. memory is 5.3 GB. [2018-04-11 14:28:50,181 INFO L168 Benchmark]: TraceAbstraction took 10508.64 ms. Allocated memory was 586.7 MB in the beginning and 765.5 MB in the end (delta: 178.8 MB). Free memory was 510.7 MB in the beginning and 625.4 MB in the end (delta: -114.7 MB). Peak memory consumption was 64.1 MB. Max. memory is 5.3 GB. [2018-04-11 14:28:50,182 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.15 ms. Allocated memory is still 401.1 MB. Free memory is still 359.7 MB. There was no memory consumed. Max. memory is 5.3 GB. * CACSL2BoogieTranslator took 249.92 ms. Allocated memory is still 401.1 MB. Free memory was 333.9 MB in the beginning and 304.8 MB in the end (delta: 29.1 MB). Peak memory consumption was 29.1 MB. Max. memory is 5.3 GB. * Boogie Preprocessor took 40.41 ms. Allocated memory is still 401.1 MB. Free memory was 304.8 MB in the beginning and 302.2 MB in the end (delta: 2.6 MB). Peak memory consumption was 2.6 MB. Max. memory is 5.3 GB. * RCFGBuilder took 471.25 ms. Allocated memory was 401.1 MB in the beginning and 586.7 MB in the end (delta: 185.6 MB). Free memory was 302.2 MB in the beginning and 510.7 MB in the end (delta: -208.5 MB). Peak memory consumption was 22.8 MB. Max. memory is 5.3 GB. * TraceAbstraction took 10508.64 ms. Allocated memory was 586.7 MB in the beginning and 765.5 MB in the end (delta: 178.8 MB). Free memory was 510.7 MB in the beginning and 625.4 MB in the end (delta: -114.7 MB). Peak memory consumption was 64.1 MB. Max. memory is 5.3 GB. * Results from de.uni_freiburg.informatik.ultimate.boogie.preprocessor: - GenericResult: Unfinished Backtranslation Generated EnsuresSpecification ensures #valid == old(#valid); is not ensure(true) * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - CounterExampleResult [Line: 985]: not all allocated memory was freed not all allocated memory was freed We found a FailurePath: [L988] EXPR, FCALL malloc(sizeof(SLL)) VAL [malloc(sizeof(SLL))={11:0}] [L988] SLL* head = malloc(sizeof(SLL)); VAL [head={11:0}, malloc(sizeof(SLL))={11:0}] [L989] FCALL head->next = ((void*)0) VAL [head={11:0}, malloc(sizeof(SLL))={11:0}] [L990] FCALL head->data = 0 VAL [head={11:0}, malloc(sizeof(SLL))={11:0}] [L992] SLL* x = head; VAL [head={11:0}, malloc(sizeof(SLL))={11:0}, x={11:0}] [L995] COND FALSE !(__VERIFIER_nondet_int()) [L1005] COND FALSE !(__VERIFIER_nondet_int()) [L1014] x = head VAL [head={11:0}, malloc(sizeof(SLL))={11:0}, x={11:0}] [L1015] FCALL x->next VAL [head={11:0}, malloc(sizeof(SLL))={11:0}, x={11:0}, x->next={0:0}] [L1015] COND FALSE !(x->next) [L1022] EXPR, FCALL x->next VAL [head={11:0}, malloc(sizeof(SLL))={11:0}, x={11:0}, x->next={0:0}] [L1022] SLL* y = x->next; [L1023] EXPR, FCALL malloc(sizeof(SLL)) VAL [head={11:0}, malloc(sizeof(SLL))={11:0}, malloc(sizeof(SLL))={10:0}, x={11:0}, y={0:0}] [L1023] FCALL x->next = malloc(sizeof(SLL)) VAL [head={11:0}, malloc(sizeof(SLL))={11:0}, malloc(sizeof(SLL))={10:0}, x={11:0}, y={0:0}] [L1024] FCALL x->data = 1 VAL [head={11:0}, malloc(sizeof(SLL))={11:0}, malloc(sizeof(SLL))={10:0}, x={11:0}, y={0:0}] [L1025] FCALL x->next = y VAL [head={11:0}, malloc(sizeof(SLL))={11:0}, malloc(sizeof(SLL))={10:0}, x={11:0}, y={0:0}] [L1029] x = head VAL [head={11:0}, malloc(sizeof(SLL))={11:0}, malloc(sizeof(SLL))={10:0}, x={11:0}, y={0:0}] [L1032] EXPR, FCALL x->data VAL [head={11:0}, malloc(sizeof(SLL))={11:0}, malloc(sizeof(SLL))={10:0}, x={11:0}, x->data=1, y={0:0}] [L1032] COND FALSE !(x->data != 1) [L1038] EXPR, FCALL x->next VAL [head={11:0}, malloc(sizeof(SLL))={11:0}, malloc(sizeof(SLL))={10:0}, x={11:0}, x->next={0:0}, y={0:0}] [L1038] x = x->next [L1039] COND FALSE !(\read(*x)) VAL [head={11:0}, malloc(sizeof(SLL))={11:0}, malloc(sizeof(SLL))={10:0}, x={0:0}, y={0:0}] [L1047] x = head VAL [head={11:0}, malloc(sizeof(SLL))={11:0}, malloc(sizeof(SLL))={10:0}, x={11:0}, y={0:0}] [L1048] COND TRUE x != ((void*)0) [L1050] head = x VAL [head={11:0}, malloc(sizeof(SLL))={11:0}, malloc(sizeof(SLL))={10:0}, x={11:0}, y={0:0}] [L1051] EXPR, FCALL x->next VAL [head={11:0}, malloc(sizeof(SLL))={11:0}, malloc(sizeof(SLL))={10:0}, x={11:0}, x->next={0:0}, y={0:0}] [L1051] x = x->next [L1052] free(head) VAL [head={11:0}, malloc(sizeof(SLL))={11:0}, malloc(sizeof(SLL))={10:0}, x={0:0}, y={0:0}] [L1052] free(head) VAL [head={11:0}, malloc(sizeof(SLL))={11:0}, malloc(sizeof(SLL))={10:0}, x={0:0}, y={0:0}] [L1052] FCALL free(head) VAL [head={11:0}, malloc(sizeof(SLL))={11:0}, malloc(sizeof(SLL))={10:0}, x={0:0}, y={0:0}] [L1048] COND FALSE !(x != ((void*)0)) VAL [head={11:0}, malloc(sizeof(SLL))={11:0}, malloc(sizeof(SLL))={10:0}, x={0:0}, y={0:0}] [L1055] return 0; VAL [\result=0, head={11:0}, malloc(sizeof(SLL))={11:0}, malloc(sizeof(SLL))={10:0}, x={0:0}, y={0:0}] - StatisticsResult: Ultimate Automizer benchmark data CFG has 3 procedures, 111 locations, 43 error locations. UNSAFE Result, 10.4s OverallTime, 29 OverallIterations, 3 TraceHistogramMax, 7.6s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 1977 SDtfs, 6043 SDslu, 6713 SDs, 0 SdLazy, 11175 SolverSat, 1072 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 4.5s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 460 GetRequests, 61 SyntacticMatches, 18 SemanticMatches, 381 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1045 ImplicationChecksByTransitivity, 3.3s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=232occurred in iteration=27, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 24/88 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, 28 MinimizatonAttempts, 1342 StatesRemovedByMinimization, 28 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.1s SatisfiabilityAnalysisTime, 2.2s InterpolantComputationTime, 840 NumberOfCodeBlocks, 840 NumberOfCodeBlocksAsserted, 29 NumberOfCheckSat, 768 ConstructedInterpolants, 0 QuantifiedInterpolants, 206816 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 28 InterpolantComputations, 17 PerfectInterpolantSequences, 24/88 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-simple-white-blue_true-unreach-call_false-valid-memtrack.i_svcomp-DerefFreeMemtrack-32bit-Automizer_SmtInterpol_Array.epf_AutomizerC.xml/Csv-Benchmark-0-2018-04-11_14-28-50-188.csv Written .csv to /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/sll-simple-white-blue_true-unreach-call_false-valid-memtrack.i_svcomp-DerefFreeMemtrack-32bit-Automizer_SmtInterpol_Array.epf_AutomizerC.xml/Csv-TraceAbstractionBenchmarks-0-2018-04-11_14-28-50-188.csv Received shutdown request...