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 -tc ../../../trunk/examples/toolchains/AutomizerC.xml -s ../../../trunk/examples/settings/cade18-smtinterpol/svcomp-DerefFreeMemtrack-32bit-Automizer_SmtInterpol_Array.epf -i ../../../trunk/examples/svcomp/ldv-memsafety/memleaks_test22_4_false-valid-memtrack_true-termination.i -------------------------------------------------------------------------------- This is Ultimate 0.1.23-a74eeac-m [2018-02-02 20:35:58,911 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-02-02 20:35:58,913 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-02-02 20:35:58,924 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-02-02 20:35:58,924 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-02-02 20:35:58,925 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-02-02 20:35:58,926 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-02-02 20:35:58,928 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-02-02 20:35:58,929 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-02-02 20:35:58,930 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-02-02 20:35:58,931 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-02-02 20:35:58,931 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-02-02 20:35:58,932 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-02-02 20:35:58,933 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-02-02 20:35:58,934 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-02-02 20:35:58,935 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-02-02 20:35:58,937 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-02-02 20:35:58,939 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-02-02 20:35:58,940 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-02-02 20:35:58,941 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-02-02 20:35:58,943 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-02-02 20:35:58,943 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-02-02 20:35:58,943 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-02-02 20:35:58,944 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-02-02 20:35:58,944 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-02-02 20:35:58,945 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-02-02 20:35:58,946 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-02-02 20:35:58,946 INFO L177 SettingsManager]: PEA to Boogie provides no preferences, ignoring... [2018-02-02 20:35:58,946 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-02-02 20:35:58,946 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-02-02 20:35:58,947 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-02-02 20:35:58,947 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-02-02 20:35:58,956 INFO L110 SettingsManager]: Loading preferences was successful [2018-02-02 20:35:58,957 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-02-02 20:35:58,958 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-02-02 20:35:58,958 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-02-02 20:35:58,958 INFO L133 SettingsManager]: * Use SBE=true [2018-02-02 20:35:58,958 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-02-02 20:35:58,958 INFO L133 SettingsManager]: * sizeof long=4 [2018-02-02 20:35:58,959 INFO L133 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2018-02-02 20:35:58,959 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-02-02 20:35:58,959 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-02-02 20:35:58,959 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-02-02 20:35:58,959 INFO L133 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2018-02-02 20:35:58,959 INFO L133 SettingsManager]: * Bitprecise bitfields=true [2018-02-02 20:35:58,959 INFO L133 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2018-02-02 20:35:58,960 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-02-02 20:35:58,960 INFO L133 SettingsManager]: * sizeof long double=12 [2018-02-02 20:35:58,960 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-02-02 20:35:58,960 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-02-02 20:35:58,960 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-02-02 20:35:58,960 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-02-02 20:35:58,960 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-02-02 20:35:58,961 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-02-02 20:35:58,961 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=Craig_TreeInterpolation [2018-02-02 20:35:58,990 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-02-02 20:35:58,999 INFO L266 ainManager$Toolchain]: [Toolchain 1]: Parser(s) successfully initialized [2018-02-02 20:35:59,001 INFO L222 ainManager$Toolchain]: [Toolchain 1]: Toolchain data selected. [2018-02-02 20:35:59,002 INFO L271 PluginConnector]: Initializing CDTParser... [2018-02-02 20:35:59,002 INFO L276 PluginConnector]: CDTParser initialized [2018-02-02 20:35:59,003 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/ldv-memsafety/memleaks_test22_4_false-valid-memtrack_true-termination.i [2018-02-02 20:35:59,153 INFO L304 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-02-02 20:35:59,154 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2018-02-02 20:35:59,154 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-02-02 20:35:59,155 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-02-02 20:35:59,159 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-02-02 20:35:59,160 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 02.02 08:35:59" (1/1) ... [2018-02-02 20:35:59,162 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@f13972f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.02 08:35:59, skipping insertion in model container [2018-02-02 20:35:59,162 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 02.02 08:35:59" (1/1) ... [2018-02-02 20:35:59,173 INFO L153 Dispatcher]: Using SV-COMP mode [2018-02-02 20:35:59,208 INFO L153 Dispatcher]: Using SV-COMP mode [2018-02-02 20:35:59,307 INFO L450 PostProcessor]: Settings: Checked method=main [2018-02-02 20:35:59,325 INFO L450 PostProcessor]: Settings: Checked method=main [2018-02-02 20:35:59,334 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.02 08:35:59 WrapperNode [2018-02-02 20:35:59,334 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-02-02 20:35:59,335 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-02-02 20:35:59,335 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-02-02 20:35:59,335 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-02-02 20:35:59,348 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.02 08:35:59" (1/1) ... [2018-02-02 20:35:59,348 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.02 08:35:59" (1/1) ... [2018-02-02 20:35:59,359 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.02 08:35:59" (1/1) ... [2018-02-02 20:35:59,359 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.02 08:35:59" (1/1) ... [2018-02-02 20:35:59,364 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.02 08:35:59" (1/1) ... [2018-02-02 20:35:59,367 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.02 08:35:59" (1/1) ... [2018-02-02 20:35:59,368 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.02 08:35:59" (1/1) ... [2018-02-02 20:35:59,371 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-02-02 20:35:59,371 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-02-02 20:35:59,371 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-02-02 20:35:59,372 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-02-02 20:35:59,373 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.02 08:35:59" (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-02-02 20:35:59,408 INFO L136 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-02-02 20:35:59,409 INFO L136 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-02-02 20:35:59,409 INFO L136 BoogieDeclarations]: Found implementation of procedure ##fun~$Pointer$~TO~VOID [2018-02-02 20:35:59,409 INFO L136 BoogieDeclarations]: Found implementation of procedure ldv_malloc [2018-02-02 20:35:59,409 INFO L136 BoogieDeclarations]: Found implementation of procedure LDV_INIT_LIST_HEAD [2018-02-02 20:35:59,409 INFO L136 BoogieDeclarations]: Found implementation of procedure ldv_atomic_add_return [2018-02-02 20:35:59,409 INFO L136 BoogieDeclarations]: Found implementation of procedure ldv_atomic_sub_return [2018-02-02 20:35:59,409 INFO L136 BoogieDeclarations]: Found implementation of procedure ldv_kref_sub [2018-02-02 20:35:59,409 INFO L136 BoogieDeclarations]: Found implementation of procedure ldv_kref_init [2018-02-02 20:35:59,409 INFO L136 BoogieDeclarations]: Found implementation of procedure ldv_kref_get [2018-02-02 20:35:59,409 INFO L136 BoogieDeclarations]: Found implementation of procedure ldv_kref_put [2018-02-02 20:35:59,410 INFO L136 BoogieDeclarations]: Found implementation of procedure ldv_kobject_cleanup [2018-02-02 20:35:59,410 INFO L136 BoogieDeclarations]: Found implementation of procedure ldv_kobject_release [2018-02-02 20:35:59,410 INFO L136 BoogieDeclarations]: Found implementation of procedure ldv_kobject_put [2018-02-02 20:35:59,410 INFO L136 BoogieDeclarations]: Found implementation of procedure ldv_kobject_get [2018-02-02 20:35:59,410 INFO L136 BoogieDeclarations]: Found implementation of procedure ldv_kobject_init_internal [2018-02-02 20:35:59,410 INFO L136 BoogieDeclarations]: Found implementation of procedure ldv_kobject_init [2018-02-02 20:35:59,410 INFO L136 BoogieDeclarations]: Found implementation of procedure ldv_kobject_create [2018-02-02 20:35:59,410 INFO L136 BoogieDeclarations]: Found implementation of procedure f_22_get [2018-02-02 20:35:59,410 INFO L136 BoogieDeclarations]: Found implementation of procedure entry_point [2018-02-02 20:35:59,410 INFO L136 BoogieDeclarations]: Found implementation of procedure main [2018-02-02 20:35:59,410 INFO L128 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2018-02-02 20:35:59,410 INFO L128 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2018-02-02 20:35:59,410 INFO L128 BoogieDeclarations]: Found specification of procedure write~int [2018-02-02 20:35:59,411 INFO L128 BoogieDeclarations]: Found specification of procedure read~int [2018-02-02 20:35:59,411 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.free [2018-02-02 20:35:59,411 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2018-02-02 20:35:59,411 INFO L128 BoogieDeclarations]: Found specification of procedure #Ultimate.alloc [2018-02-02 20:35:59,411 INFO L128 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memset [2018-02-02 20:35:59,411 INFO L136 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memset [2018-02-02 20:35:59,411 INFO L128 BoogieDeclarations]: Found specification of procedure malloc [2018-02-02 20:35:59,411 INFO L128 BoogieDeclarations]: Found specification of procedure free [2018-02-02 20:35:59,411 INFO L128 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2018-02-02 20:35:59,411 INFO L128 BoogieDeclarations]: Found specification of procedure memset [2018-02-02 20:35:59,411 INFO L128 BoogieDeclarations]: Found specification of procedure ldv_malloc [2018-02-02 20:35:59,411 INFO L128 BoogieDeclarations]: Found specification of procedure LDV_INIT_LIST_HEAD [2018-02-02 20:35:59,412 INFO L128 BoogieDeclarations]: Found specification of procedure ldv_atomic_add_return [2018-02-02 20:35:59,412 INFO L128 BoogieDeclarations]: Found specification of procedure ldv_atomic_sub_return [2018-02-02 20:35:59,412 INFO L128 BoogieDeclarations]: Found specification of procedure ldv_kref_sub [2018-02-02 20:35:59,412 INFO L128 BoogieDeclarations]: Found specification of procedure ##fun~$Pointer$~TO~VOID [2018-02-02 20:35:59,412 INFO L128 BoogieDeclarations]: Found specification of procedure ldv_kref_init [2018-02-02 20:35:59,412 INFO L128 BoogieDeclarations]: Found specification of procedure ldv_kref_get [2018-02-02 20:35:59,412 INFO L128 BoogieDeclarations]: Found specification of procedure ldv_kref_put [2018-02-02 20:35:59,412 INFO L128 BoogieDeclarations]: Found specification of procedure ldv_kobject_cleanup [2018-02-02 20:35:59,413 INFO L128 BoogieDeclarations]: Found specification of procedure ldv_kobject_release [2018-02-02 20:35:59,413 INFO L128 BoogieDeclarations]: Found specification of procedure ldv_kobject_put [2018-02-02 20:35:59,413 INFO L128 BoogieDeclarations]: Found specification of procedure ldv_kobject_get [2018-02-02 20:35:59,413 INFO L128 BoogieDeclarations]: Found specification of procedure ldv_kobject_init_internal [2018-02-02 20:35:59,413 INFO L128 BoogieDeclarations]: Found specification of procedure ldv_kobject_init [2018-02-02 20:35:59,413 INFO L128 BoogieDeclarations]: Found specification of procedure ldv_kobject_create [2018-02-02 20:35:59,413 INFO L128 BoogieDeclarations]: Found specification of procedure f_22_get [2018-02-02 20:35:59,413 INFO L128 BoogieDeclarations]: Found specification of procedure entry_point [2018-02-02 20:35:59,413 INFO L128 BoogieDeclarations]: Found specification of procedure main [2018-02-02 20:35:59,413 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-02-02 20:35:59,413 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-02-02 20:35:59,599 WARN L455 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2018-02-02 20:35:59,686 INFO L257 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-02-02 20:35:59,687 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 02.02 08:35:59 BoogieIcfgContainer [2018-02-02 20:35:59,687 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-02-02 20:35:59,688 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-02-02 20:35:59,688 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-02-02 20:35:59,691 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-02-02 20:35:59,691 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 02.02 08:35:59" (1/3) ... [2018-02-02 20:35:59,692 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@62d2119d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 02.02 08:35:59, skipping insertion in model container [2018-02-02 20:35:59,692 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.02 08:35:59" (2/3) ... [2018-02-02 20:35:59,692 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@62d2119d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 02.02 08:35:59, skipping insertion in model container [2018-02-02 20:35:59,692 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 02.02 08:35:59" (3/3) ... [2018-02-02 20:35:59,694 INFO L107 eAbstractionObserver]: Analyzing ICFG memleaks_test22_4_false-valid-memtrack_true-termination.i [2018-02-02 20:35:59,699 INFO L128 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:Craig_TreeInterpolation Determinization: PREDICATE_ABSTRACTION [2018-02-02 20:35:59,705 INFO L140 ceAbstractionStarter]: Appying trace abstraction to program that has 23 error locations. [2018-02-02 20:35:59,728 INFO L322 AbstractCegarLoop]: Interprodecural is true [2018-02-02 20:35:59,728 INFO L323 AbstractCegarLoop]: Hoare is false [2018-02-02 20:35:59,728 INFO L324 AbstractCegarLoop]: Compute interpolants for Craig_TreeInterpolation [2018-02-02 20:35:59,728 INFO L325 AbstractCegarLoop]: Backedges is CANONICAL [2018-02-02 20:35:59,729 INFO L326 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-02-02 20:35:59,729 INFO L327 AbstractCegarLoop]: Difference is false [2018-02-02 20:35:59,729 INFO L328 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-02-02 20:35:59,729 INFO L333 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-02-02 20:35:59,729 INFO L87 2NestedWordAutomaton]: Mode: main mode - execution starts in main procedure [2018-02-02 20:35:59,740 INFO L276 IsEmpty]: Start isEmpty. Operand 146 states. [2018-02-02 20:35:59,748 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2018-02-02 20:35:59,748 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 20:35:59,748 INFO L351 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-02 20:35:59,749 INFO L371 AbstractCegarLoop]: === Iteration 1 === [ldv_kref_initErr0RequiresViolation, ldv_kref_initErr1RequiresViolation, ldv_kobject_createErr0RequiresViolation, ldv_kobject_createErr1RequiresViolation, ldv_atomic_sub_returnErr1RequiresViolation, ldv_atomic_sub_returnErr0RequiresViolation, ldv_atomic_sub_returnErr3RequiresViolation, ldv_atomic_sub_returnErr2RequiresViolation, ldv_atomic_add_returnErr0RequiresViolation, ldv_atomic_add_returnErr1RequiresViolation, ldv_atomic_add_returnErr2RequiresViolation, ldv_atomic_add_returnErr3RequiresViolation, ldv_kobject_cleanupErr4RequiresViolation, ldv_kobject_cleanupErr2RequiresViolation, ldv_kobject_cleanupErr5RequiresViolation, ldv_kobject_cleanupErr3RequiresViolation, ldv_kobject_cleanupErr0RequiresViolation, ldv_kobject_cleanupErr1RequiresViolation, mainErr0EnsuresViolation, LDV_INIT_LIST_HEADErr1RequiresViolation, LDV_INIT_LIST_HEADErr3RequiresViolation, LDV_INIT_LIST_HEADErr2RequiresViolation, LDV_INIT_LIST_HEADErr0RequiresViolation]=== [2018-02-02 20:35:59,751 INFO L82 PathProgramCache]: Analyzing trace with hash -367619766, now seen corresponding path program 1 times [2018-02-02 20:35:59,788 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 20:35:59,821 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 20:35:59,827 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 20:35:59,906 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 20:35:59,908 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-02 20:35:59,908 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-02-02 20:35:59,909 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 20:35:59,909 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 20:35:59,909 INFO L182 omatonBuilderFactory]: Interpolants [149#true, 150#false, 151#(and (= 0 |ldv_malloc_#res.offset|) (= 0 |ldv_malloc_#res.base|)), 152#(and (= 0 |ldv_kobject_create_#t~ret17.base|) (= 0 |ldv_kobject_create_#t~ret17.offset|)), 153#(and (= ldv_kobject_create_~kobj~1.offset 0) (= ldv_kobject_create_~kobj~1.base 0))] [2018-02-02 20:35:59,910 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 20:35:59,960 INFO L409 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-02-02 20:35:59,969 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-02-02 20:35:59,969 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-02-02 20:35:59,971 INFO L87 Difference]: Start difference. First operand 146 states. Second operand 5 states. [2018-02-02 20:36:00,017 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 20:36:00,017 INFO L93 Difference]: Finished difference Result 152 states and 160 transitions. [2018-02-02 20:36:00,018 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-02-02 20:36:00,019 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 17 [2018-02-02 20:36:00,020 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 20:36:00,031 INFO L225 Difference]: With dead ends: 152 [2018-02-02 20:36:00,031 INFO L226 Difference]: Without dead ends: 149 [2018-02-02 20:36:00,032 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-02-02 20:36:00,044 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 149 states. [2018-02-02 20:36:00,063 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 149 to 147. [2018-02-02 20:36:00,064 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 147 states. [2018-02-02 20:36:00,067 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 147 states to 147 states and 155 transitions. [2018-02-02 20:36:00,068 INFO L78 Accepts]: Start accepts. Automaton has 147 states and 155 transitions. Word has length 17 [2018-02-02 20:36:00,068 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 20:36:00,068 INFO L432 AbstractCegarLoop]: Abstraction has 147 states and 155 transitions. [2018-02-02 20:36:00,069 INFO L433 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-02-02 20:36:00,069 INFO L276 IsEmpty]: Start isEmpty. Operand 147 states and 155 transitions. [2018-02-02 20:36:00,069 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2018-02-02 20:36:00,069 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 20:36:00,070 INFO L351 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-02 20:36:00,070 INFO L371 AbstractCegarLoop]: === Iteration 2 === [ldv_kref_initErr0RequiresViolation, ldv_kref_initErr1RequiresViolation, ldv_kobject_createErr0RequiresViolation, ldv_kobject_createErr1RequiresViolation, ldv_atomic_sub_returnErr1RequiresViolation, ldv_atomic_sub_returnErr0RequiresViolation, ldv_atomic_sub_returnErr3RequiresViolation, ldv_atomic_sub_returnErr2RequiresViolation, ldv_atomic_add_returnErr0RequiresViolation, ldv_atomic_add_returnErr1RequiresViolation, ldv_atomic_add_returnErr2RequiresViolation, ldv_atomic_add_returnErr3RequiresViolation, ldv_kobject_cleanupErr4RequiresViolation, ldv_kobject_cleanupErr2RequiresViolation, ldv_kobject_cleanupErr5RequiresViolation, ldv_kobject_cleanupErr3RequiresViolation, ldv_kobject_cleanupErr0RequiresViolation, ldv_kobject_cleanupErr1RequiresViolation, mainErr0EnsuresViolation, LDV_INIT_LIST_HEADErr1RequiresViolation, LDV_INIT_LIST_HEADErr3RequiresViolation, LDV_INIT_LIST_HEADErr2RequiresViolation, LDV_INIT_LIST_HEADErr0RequiresViolation]=== [2018-02-02 20:36:00,070 INFO L82 PathProgramCache]: Analyzing trace with hash -1040907540, now seen corresponding path program 1 times [2018-02-02 20:36:00,072 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 20:36:00,088 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 20:36:00,089 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 20:36:00,143 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 20:36:00,143 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-02 20:36:00,143 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-02-02 20:36:00,144 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 20:36:00,144 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 20:36:00,144 INFO L182 omatonBuilderFactory]: Interpolants [453#true, 454#false, 455#(= 1 (select |#valid| |ldv_malloc_#t~malloc4.base|)), 456#(= 1 (select |#valid| |ldv_malloc_#res.base|)), 457#(= 1 (select |#valid| |ldv_kobject_create_#t~ret17.base|)), 458#(= 1 (select |#valid| ldv_kobject_create_~kobj~1.base))] [2018-02-02 20:36:00,144 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 20:36:00,146 INFO L409 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-02-02 20:36:00,146 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-02-02 20:36:00,146 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-02-02 20:36:00,146 INFO L87 Difference]: Start difference. First operand 147 states and 155 transitions. Second operand 6 states. [2018-02-02 20:36:00,293 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 20:36:00,294 INFO L93 Difference]: Finished difference Result 148 states and 156 transitions. [2018-02-02 20:36:00,294 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-02-02 20:36:00,294 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 19 [2018-02-02 20:36:00,294 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 20:36:00,296 INFO L225 Difference]: With dead ends: 148 [2018-02-02 20:36:00,296 INFO L226 Difference]: Without dead ends: 148 [2018-02-02 20:36:00,297 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2018-02-02 20:36:00,297 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 148 states. [2018-02-02 20:36:00,304 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 148 to 146. [2018-02-02 20:36:00,305 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 146 states. [2018-02-02 20:36:00,307 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 146 states to 146 states and 154 transitions. [2018-02-02 20:36:00,307 INFO L78 Accepts]: Start accepts. Automaton has 146 states and 154 transitions. Word has length 19 [2018-02-02 20:36:00,307 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 20:36:00,307 INFO L432 AbstractCegarLoop]: Abstraction has 146 states and 154 transitions. [2018-02-02 20:36:00,307 INFO L433 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-02-02 20:36:00,308 INFO L276 IsEmpty]: Start isEmpty. Operand 146 states and 154 transitions. [2018-02-02 20:36:00,308 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2018-02-02 20:36:00,308 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 20:36:00,308 INFO L351 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-02 20:36:00,308 INFO L371 AbstractCegarLoop]: === Iteration 3 === [ldv_kref_initErr0RequiresViolation, ldv_kref_initErr1RequiresViolation, ldv_kobject_createErr0RequiresViolation, ldv_kobject_createErr1RequiresViolation, ldv_atomic_sub_returnErr1RequiresViolation, ldv_atomic_sub_returnErr0RequiresViolation, ldv_atomic_sub_returnErr3RequiresViolation, ldv_atomic_sub_returnErr2RequiresViolation, ldv_atomic_add_returnErr0RequiresViolation, ldv_atomic_add_returnErr1RequiresViolation, ldv_atomic_add_returnErr2RequiresViolation, ldv_atomic_add_returnErr3RequiresViolation, ldv_kobject_cleanupErr4RequiresViolation, ldv_kobject_cleanupErr2RequiresViolation, ldv_kobject_cleanupErr5RequiresViolation, ldv_kobject_cleanupErr3RequiresViolation, ldv_kobject_cleanupErr0RequiresViolation, ldv_kobject_cleanupErr1RequiresViolation, mainErr0EnsuresViolation, LDV_INIT_LIST_HEADErr1RequiresViolation, LDV_INIT_LIST_HEADErr3RequiresViolation, LDV_INIT_LIST_HEADErr2RequiresViolation, LDV_INIT_LIST_HEADErr0RequiresViolation]=== [2018-02-02 20:36:00,309 INFO L82 PathProgramCache]: Analyzing trace with hash -1040907539, now seen corresponding path program 1 times [2018-02-02 20:36:00,310 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 20:36:00,324 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 20:36:00,325 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 20:36:00,490 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 20:36:00,491 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-02 20:36:00,491 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-02-02 20:36:00,491 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 20:36:00,491 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 20:36:00,492 INFO L182 omatonBuilderFactory]: Interpolants [755#true, 756#false, 757#(and (or (< 0 (div ldv_malloc_~size 4294967296)) (and (or (<= ldv_malloc_~size |ldv_malloc_#in~size|) (<= (+ (div ldv_malloc_~size 4294967296) 1) 0)) (<= |ldv_malloc_#in~size| ldv_malloc_~size))) (or (<= ldv_malloc_~size |ldv_malloc_#in~size|) (<= (div ldv_malloc_~size 4294967296) 0))), 758#(and (= 0 |ldv_malloc_#t~malloc4.offset|) (or (<= (+ |ldv_malloc_#in~size| 1) 0) (<= |ldv_malloc_#in~size| (select |#length| |ldv_malloc_#t~malloc4.base|)) (<= 2147483648 |ldv_malloc_#in~size|))), 759#(and (= 0 |ldv_malloc_#res.offset|) (or (<= (+ |ldv_malloc_#in~size| 1) 0) (<= |ldv_malloc_#in~size| (select |#length| |ldv_malloc_#res.base|)) (<= 2147483648 |ldv_malloc_#in~size|))), 760#(and (<= 16 (select |#length| |ldv_kobject_create_#t~ret17.base|)) (= 0 |ldv_kobject_create_#t~ret17.offset|)), 761#(and (= ldv_kobject_create_~kobj~1.offset 0) (<= 16 (select |#length| ldv_kobject_create_~kobj~1.base)))] [2018-02-02 20:36:00,492 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 20:36:00,492 INFO L409 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-02-02 20:36:00,492 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-02-02 20:36:00,492 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2018-02-02 20:36:00,493 INFO L87 Difference]: Start difference. First operand 146 states and 154 transitions. Second operand 7 states. [2018-02-02 20:36:00,698 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 20:36:00,698 INFO L93 Difference]: Finished difference Result 147 states and 155 transitions. [2018-02-02 20:36:00,703 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-02-02 20:36:00,703 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 19 [2018-02-02 20:36:00,703 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 20:36:00,705 INFO L225 Difference]: With dead ends: 147 [2018-02-02 20:36:00,705 INFO L226 Difference]: Without dead ends: 147 [2018-02-02 20:36:00,705 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2018-02-02 20:36:00,705 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 147 states. [2018-02-02 20:36:00,710 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 147 to 145. [2018-02-02 20:36:00,710 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 145 states. [2018-02-02 20:36:00,712 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 145 states to 145 states and 153 transitions. [2018-02-02 20:36:00,712 INFO L78 Accepts]: Start accepts. Automaton has 145 states and 153 transitions. Word has length 19 [2018-02-02 20:36:00,712 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 20:36:00,713 INFO L432 AbstractCegarLoop]: Abstraction has 145 states and 153 transitions. [2018-02-02 20:36:00,713 INFO L433 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-02-02 20:36:00,713 INFO L276 IsEmpty]: Start isEmpty. Operand 145 states and 153 transitions. [2018-02-02 20:36:00,714 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2018-02-02 20:36:00,714 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 20:36:00,714 INFO L351 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-02-02 20:36:00,714 INFO L371 AbstractCegarLoop]: === Iteration 4 === [ldv_kref_initErr0RequiresViolation, ldv_kref_initErr1RequiresViolation, ldv_kobject_createErr0RequiresViolation, ldv_kobject_createErr1RequiresViolation, ldv_atomic_sub_returnErr1RequiresViolation, ldv_atomic_sub_returnErr0RequiresViolation, ldv_atomic_sub_returnErr3RequiresViolation, ldv_atomic_sub_returnErr2RequiresViolation, ldv_atomic_add_returnErr0RequiresViolation, ldv_atomic_add_returnErr1RequiresViolation, ldv_atomic_add_returnErr2RequiresViolation, ldv_atomic_add_returnErr3RequiresViolation, ldv_kobject_cleanupErr4RequiresViolation, ldv_kobject_cleanupErr2RequiresViolation, ldv_kobject_cleanupErr5RequiresViolation, ldv_kobject_cleanupErr3RequiresViolation, ldv_kobject_cleanupErr0RequiresViolation, ldv_kobject_cleanupErr1RequiresViolation, mainErr0EnsuresViolation, LDV_INIT_LIST_HEADErr1RequiresViolation, LDV_INIT_LIST_HEADErr3RequiresViolation, LDV_INIT_LIST_HEADErr2RequiresViolation, LDV_INIT_LIST_HEADErr0RequiresViolation]=== [2018-02-02 20:36:00,714 INFO L82 PathProgramCache]: Analyzing trace with hash -1287954832, now seen corresponding path program 1 times [2018-02-02 20:36:00,718 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 20:36:00,732 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 20:36:00,733 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 20:36:00,814 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 20:36:00,814 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-02 20:36:00,814 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2018-02-02 20:36:00,814 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 20:36:00,814 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 20:36:00,814 INFO L182 omatonBuilderFactory]: Interpolants [1058#true, 1059#false, 1060#(and (= 0 |ldv_kobject_create_#res.base|) (= 0 |ldv_kobject_create_#res.offset|)), 1061#(and (= 0 |entry_point_#t~ret20.base|) (= 0 |entry_point_#t~ret20.offset|)), 1062#(and (= 0 entry_point_~kobj~2.base) (= 0 entry_point_~kobj~2.offset)), 1063#(and (= 0 |f_22_get_#in~kobj.offset|) (= 0 |f_22_get_#in~kobj.base|)), 1064#(and (= 0 f_22_get_~kobj.offset) (= 0 f_22_get_~kobj.base)), 1065#(and (= 0 |ldv_kobject_get_#in~kobj.base|) (= 0 |ldv_kobject_get_#in~kobj.offset|)), 1066#(and (= 0 ldv_kobject_get_~kobj.offset) (= ldv_kobject_get_~kobj.base 0))] [2018-02-02 20:36:00,814 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 20:36:00,815 INFO L409 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-02-02 20:36:00,815 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-02-02 20:36:00,815 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2018-02-02 20:36:00,815 INFO L87 Difference]: Start difference. First operand 145 states and 153 transitions. Second operand 9 states. [2018-02-02 20:36:00,883 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 20:36:00,884 INFO L93 Difference]: Finished difference Result 165 states and 174 transitions. [2018-02-02 20:36:00,884 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-02-02 20:36:00,884 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 29 [2018-02-02 20:36:00,884 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 20:36:00,885 INFO L225 Difference]: With dead ends: 165 [2018-02-02 20:36:00,885 INFO L226 Difference]: Without dead ends: 165 [2018-02-02 20:36:00,886 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=23, Invalid=87, Unknown=0, NotChecked=0, Total=110 [2018-02-02 20:36:00,886 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 165 states. [2018-02-02 20:36:00,895 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 165 to 159. [2018-02-02 20:36:00,896 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 159 states. [2018-02-02 20:36:00,897 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 159 states to 159 states and 167 transitions. [2018-02-02 20:36:00,898 INFO L78 Accepts]: Start accepts. Automaton has 159 states and 167 transitions. Word has length 29 [2018-02-02 20:36:00,898 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 20:36:00,898 INFO L432 AbstractCegarLoop]: Abstraction has 159 states and 167 transitions. [2018-02-02 20:36:00,898 INFO L433 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-02-02 20:36:00,898 INFO L276 IsEmpty]: Start isEmpty. Operand 159 states and 167 transitions. [2018-02-02 20:36:00,899 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2018-02-02 20:36:00,899 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 20:36:00,899 INFO L351 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-02 20:36:00,899 INFO L371 AbstractCegarLoop]: === Iteration 5 === [ldv_kref_initErr0RequiresViolation, ldv_kref_initErr1RequiresViolation, ldv_kobject_createErr0RequiresViolation, ldv_kobject_createErr1RequiresViolation, ldv_atomic_sub_returnErr1RequiresViolation, ldv_atomic_sub_returnErr0RequiresViolation, ldv_atomic_sub_returnErr3RequiresViolation, ldv_atomic_sub_returnErr2RequiresViolation, ldv_atomic_add_returnErr0RequiresViolation, ldv_atomic_add_returnErr1RequiresViolation, ldv_atomic_add_returnErr2RequiresViolation, ldv_atomic_add_returnErr3RequiresViolation, ldv_kobject_cleanupErr4RequiresViolation, ldv_kobject_cleanupErr2RequiresViolation, ldv_kobject_cleanupErr5RequiresViolation, ldv_kobject_cleanupErr3RequiresViolation, ldv_kobject_cleanupErr0RequiresViolation, ldv_kobject_cleanupErr1RequiresViolation, mainErr0EnsuresViolation, LDV_INIT_LIST_HEADErr1RequiresViolation, LDV_INIT_LIST_HEADErr3RequiresViolation, LDV_INIT_LIST_HEADErr2RequiresViolation, LDV_INIT_LIST_HEADErr0RequiresViolation]=== [2018-02-02 20:36:00,899 INFO L82 PathProgramCache]: Analyzing trace with hash 1025625474, now seen corresponding path program 1 times [2018-02-02 20:36:00,900 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 20:36:00,912 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 20:36:00,913 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 20:36:00,965 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 20:36:00,965 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-02 20:36:00,966 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2018-02-02 20:36:00,966 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 20:36:00,966 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 20:36:00,966 INFO L182 omatonBuilderFactory]: Interpolants [1395#true, 1396#false, 1397#(= 1 (select |#valid| |#Ultimate.C_memset_#ptr.base|)), 1398#(= 1 (select |#valid| ldv_kobject_create_~kobj~1.base)), 1399#(= 1 (select |#valid| |ldv_kobject_init_#in~kobj.base|)), 1400#(= 1 (select |#valid| ldv_kobject_init_~kobj.base)), 1401#(= 1 (select |#valid| |ldv_kobject_init_internal_#in~kobj.base|)), 1402#(= 1 (select |#valid| ldv_kobject_init_internal_~kobj.base)), 1403#(= 1 (select |#valid| |ldv_kref_init_#in~kref.base|)), 1404#(= 1 (select |#valid| ldv_kref_init_~kref.base))] [2018-02-02 20:36:00,966 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 20:36:00,966 INFO L409 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-02-02 20:36:00,966 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-02-02 20:36:00,967 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=73, Unknown=0, NotChecked=0, Total=90 [2018-02-02 20:36:00,967 INFO L87 Difference]: Start difference. First operand 159 states and 167 transitions. Second operand 10 states. [2018-02-02 20:36:01,128 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 20:36:01,128 INFO L93 Difference]: Finished difference Result 158 states and 166 transitions. [2018-02-02 20:36:01,128 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-02-02 20:36:01,129 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 34 [2018-02-02 20:36:01,129 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 20:36:01,130 INFO L225 Difference]: With dead ends: 158 [2018-02-02 20:36:01,130 INFO L226 Difference]: Without dead ends: 158 [2018-02-02 20:36:01,130 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=29, Invalid=127, Unknown=0, NotChecked=0, Total=156 [2018-02-02 20:36:01,130 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 158 states. [2018-02-02 20:36:01,135 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 158 to 158. [2018-02-02 20:36:01,135 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 158 states. [2018-02-02 20:36:01,136 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 158 states to 158 states and 166 transitions. [2018-02-02 20:36:01,136 INFO L78 Accepts]: Start accepts. Automaton has 158 states and 166 transitions. Word has length 34 [2018-02-02 20:36:01,136 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 20:36:01,136 INFO L432 AbstractCegarLoop]: Abstraction has 158 states and 166 transitions. [2018-02-02 20:36:01,136 INFO L433 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-02-02 20:36:01,137 INFO L276 IsEmpty]: Start isEmpty. Operand 158 states and 166 transitions. [2018-02-02 20:36:01,137 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2018-02-02 20:36:01,137 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 20:36:01,137 INFO L351 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-02 20:36:01,138 INFO L371 AbstractCegarLoop]: === Iteration 6 === [ldv_kref_initErr0RequiresViolation, ldv_kref_initErr1RequiresViolation, ldv_kobject_createErr0RequiresViolation, ldv_kobject_createErr1RequiresViolation, ldv_atomic_sub_returnErr1RequiresViolation, ldv_atomic_sub_returnErr0RequiresViolation, ldv_atomic_sub_returnErr3RequiresViolation, ldv_atomic_sub_returnErr2RequiresViolation, ldv_atomic_add_returnErr0RequiresViolation, ldv_atomic_add_returnErr1RequiresViolation, ldv_atomic_add_returnErr2RequiresViolation, ldv_atomic_add_returnErr3RequiresViolation, ldv_kobject_cleanupErr4RequiresViolation, ldv_kobject_cleanupErr2RequiresViolation, ldv_kobject_cleanupErr5RequiresViolation, ldv_kobject_cleanupErr3RequiresViolation, ldv_kobject_cleanupErr0RequiresViolation, ldv_kobject_cleanupErr1RequiresViolation, mainErr0EnsuresViolation, LDV_INIT_LIST_HEADErr1RequiresViolation, LDV_INIT_LIST_HEADErr3RequiresViolation, LDV_INIT_LIST_HEADErr2RequiresViolation, LDV_INIT_LIST_HEADErr0RequiresViolation]=== [2018-02-02 20:36:01,138 INFO L82 PathProgramCache]: Analyzing trace with hash 1025625475, now seen corresponding path program 1 times [2018-02-02 20:36:01,139 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 20:36:01,149 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 20:36:01,151 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 20:36:01,196 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 20:36:01,196 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-02 20:36:01,196 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-02-02 20:36:01,196 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 20:36:01,197 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 20:36:01,197 INFO L182 omatonBuilderFactory]: Interpolants [1728#false, 1729#(= |#Ultimate.C_memset_#t~loopctr21| 0), 1730#(<= |#Ultimate.C_memset_#amount| 0), 1727#true] [2018-02-02 20:36:01,197 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 20:36:01,197 INFO L409 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-02-02 20:36:01,197 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-02-02 20:36:01,198 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-02-02 20:36:01,198 INFO L87 Difference]: Start difference. First operand 158 states and 166 transitions. Second operand 4 states. [2018-02-02 20:36:01,208 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 20:36:01,209 INFO L93 Difference]: Finished difference Result 161 states and 169 transitions. [2018-02-02 20:36:01,219 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-02-02 20:36:01,219 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 34 [2018-02-02 20:36:01,219 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 20:36:01,220 INFO L225 Difference]: With dead ends: 161 [2018-02-02 20:36:01,220 INFO L226 Difference]: Without dead ends: 159 [2018-02-02 20:36:01,220 INFO L554 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-02-02 20:36:01,221 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 159 states. [2018-02-02 20:36:01,225 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 159 to 159. [2018-02-02 20:36:01,225 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 159 states. [2018-02-02 20:36:01,226 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 159 states to 159 states and 167 transitions. [2018-02-02 20:36:01,226 INFO L78 Accepts]: Start accepts. Automaton has 159 states and 167 transitions. Word has length 34 [2018-02-02 20:36:01,226 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 20:36:01,226 INFO L432 AbstractCegarLoop]: Abstraction has 159 states and 167 transitions. [2018-02-02 20:36:01,226 INFO L433 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-02-02 20:36:01,227 INFO L276 IsEmpty]: Start isEmpty. Operand 159 states and 167 transitions. [2018-02-02 20:36:01,227 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2018-02-02 20:36:01,227 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 20:36:01,227 INFO L351 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-02 20:36:01,228 INFO L371 AbstractCegarLoop]: === Iteration 7 === [ldv_kref_initErr0RequiresViolation, ldv_kref_initErr1RequiresViolation, ldv_kobject_createErr0RequiresViolation, ldv_kobject_createErr1RequiresViolation, ldv_atomic_sub_returnErr1RequiresViolation, ldv_atomic_sub_returnErr0RequiresViolation, ldv_atomic_sub_returnErr3RequiresViolation, ldv_atomic_sub_returnErr2RequiresViolation, ldv_atomic_add_returnErr0RequiresViolation, ldv_atomic_add_returnErr1RequiresViolation, ldv_atomic_add_returnErr2RequiresViolation, ldv_atomic_add_returnErr3RequiresViolation, ldv_kobject_cleanupErr4RequiresViolation, ldv_kobject_cleanupErr2RequiresViolation, ldv_kobject_cleanupErr5RequiresViolation, ldv_kobject_cleanupErr3RequiresViolation, ldv_kobject_cleanupErr0RequiresViolation, ldv_kobject_cleanupErr1RequiresViolation, mainErr0EnsuresViolation, LDV_INIT_LIST_HEADErr1RequiresViolation, LDV_INIT_LIST_HEADErr3RequiresViolation, LDV_INIT_LIST_HEADErr2RequiresViolation, LDV_INIT_LIST_HEADErr0RequiresViolation]=== [2018-02-02 20:36:01,228 INFO L82 PathProgramCache]: Analyzing trace with hash -553427227, now seen corresponding path program 1 times [2018-02-02 20:36:01,229 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 20:36:01,240 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 20:36:01,241 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 20:36:01,281 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 20:36:01,281 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-02 20:36:01,281 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5] total 5 [2018-02-02 20:36:01,281 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 20:36:01,282 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 20:36:01,282 INFO L182 omatonBuilderFactory]: Interpolants [2053#true, 2054#false, 2055#(= |#Ultimate.C_memset_#t~loopctr21| 0), 2056#(<= |#Ultimate.C_memset_#t~loopctr21| 1), 2057#(<= |#Ultimate.C_memset_#amount| 1)] [2018-02-02 20:36:01,282 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 20:36:01,282 INFO L409 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-02-02 20:36:01,282 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-02-02 20:36:01,282 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2018-02-02 20:36:01,282 INFO L87 Difference]: Start difference. First operand 159 states and 167 transitions. Second operand 5 states. [2018-02-02 20:36:01,295 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 20:36:01,295 INFO L93 Difference]: Finished difference Result 162 states and 170 transitions. [2018-02-02 20:36:01,295 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-02-02 20:36:01,295 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 35 [2018-02-02 20:36:01,295 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 20:36:01,296 INFO L225 Difference]: With dead ends: 162 [2018-02-02 20:36:01,296 INFO L226 Difference]: Without dead ends: 160 [2018-02-02 20:36:01,296 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2018-02-02 20:36:01,296 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 160 states. [2018-02-02 20:36:01,300 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 160 to 160. [2018-02-02 20:36:01,300 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 160 states. [2018-02-02 20:36:01,301 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 160 states to 160 states and 168 transitions. [2018-02-02 20:36:01,301 INFO L78 Accepts]: Start accepts. Automaton has 160 states and 168 transitions. Word has length 35 [2018-02-02 20:36:01,301 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 20:36:01,301 INFO L432 AbstractCegarLoop]: Abstraction has 160 states and 168 transitions. [2018-02-02 20:36:01,302 INFO L433 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-02-02 20:36:01,302 INFO L276 IsEmpty]: Start isEmpty. Operand 160 states and 168 transitions. [2018-02-02 20:36:01,303 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2018-02-02 20:36:01,303 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 20:36:01,303 INFO L351 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] [2018-02-02 20:36:01,303 INFO L371 AbstractCegarLoop]: === Iteration 8 === [ldv_kref_initErr0RequiresViolation, ldv_kref_initErr1RequiresViolation, ldv_kobject_createErr0RequiresViolation, ldv_kobject_createErr1RequiresViolation, ldv_atomic_sub_returnErr1RequiresViolation, ldv_atomic_sub_returnErr0RequiresViolation, ldv_atomic_sub_returnErr3RequiresViolation, ldv_atomic_sub_returnErr2RequiresViolation, ldv_atomic_add_returnErr0RequiresViolation, ldv_atomic_add_returnErr1RequiresViolation, ldv_atomic_add_returnErr2RequiresViolation, ldv_atomic_add_returnErr3RequiresViolation, ldv_kobject_cleanupErr4RequiresViolation, ldv_kobject_cleanupErr2RequiresViolation, ldv_kobject_cleanupErr5RequiresViolation, ldv_kobject_cleanupErr3RequiresViolation, ldv_kobject_cleanupErr0RequiresViolation, ldv_kobject_cleanupErr1RequiresViolation, mainErr0EnsuresViolation, LDV_INIT_LIST_HEADErr1RequiresViolation, LDV_INIT_LIST_HEADErr3RequiresViolation, LDV_INIT_LIST_HEADErr2RequiresViolation, LDV_INIT_LIST_HEADErr0RequiresViolation]=== [2018-02-02 20:36:01,303 INFO L82 PathProgramCache]: Analyzing trace with hash 2035546563, now seen corresponding path program 2 times [2018-02-02 20:36:01,304 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 20:36:01,316 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 20:36:01,317 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 20:36:01,359 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 20:36:01,359 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-02 20:36:01,359 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6] total 6 [2018-02-02 20:36:01,359 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 20:36:01,360 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 20:36:01,360 INFO L182 omatonBuilderFactory]: Interpolants [2384#(= |#Ultimate.C_memset_#t~loopctr21| 0), 2385#(<= |#Ultimate.C_memset_#t~loopctr21| 1), 2386#(<= |#Ultimate.C_memset_#t~loopctr21| 2), 2387#(<= |#Ultimate.C_memset_#amount| 2), 2382#true, 2383#false] [2018-02-02 20:36:01,360 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 20:36:01,360 INFO L409 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-02-02 20:36:01,360 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-02-02 20:36:01,360 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2018-02-02 20:36:01,361 INFO L87 Difference]: Start difference. First operand 160 states and 168 transitions. Second operand 6 states. [2018-02-02 20:36:01,380 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 20:36:01,380 INFO L93 Difference]: Finished difference Result 163 states and 171 transitions. [2018-02-02 20:36:01,380 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-02-02 20:36:01,380 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 36 [2018-02-02 20:36:01,381 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 20:36:01,381 INFO L225 Difference]: With dead ends: 163 [2018-02-02 20:36:01,381 INFO L226 Difference]: Without dead ends: 161 [2018-02-02 20:36:01,382 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=16, Invalid=26, Unknown=0, NotChecked=0, Total=42 [2018-02-02 20:36:01,382 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 161 states. [2018-02-02 20:36:01,385 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 161 to 161. [2018-02-02 20:36:01,385 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 161 states. [2018-02-02 20:36:01,386 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 161 states to 161 states and 169 transitions. [2018-02-02 20:36:01,386 INFO L78 Accepts]: Start accepts. Automaton has 161 states and 169 transitions. Word has length 36 [2018-02-02 20:36:01,386 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 20:36:01,386 INFO L432 AbstractCegarLoop]: Abstraction has 161 states and 169 transitions. [2018-02-02 20:36:01,386 INFO L433 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-02-02 20:36:01,386 INFO L276 IsEmpty]: Start isEmpty. Operand 161 states and 169 transitions. [2018-02-02 20:36:01,387 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2018-02-02 20:36:01,387 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 20:36:01,387 INFO L351 BasicCegarLoop]: trace histogram [3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-02-02 20:36:01,387 INFO L371 AbstractCegarLoop]: === Iteration 9 === [ldv_kref_initErr0RequiresViolation, ldv_kref_initErr1RequiresViolation, ldv_kobject_createErr0RequiresViolation, ldv_kobject_createErr1RequiresViolation, ldv_atomic_sub_returnErr1RequiresViolation, ldv_atomic_sub_returnErr0RequiresViolation, ldv_atomic_sub_returnErr3RequiresViolation, ldv_atomic_sub_returnErr2RequiresViolation, ldv_atomic_add_returnErr0RequiresViolation, ldv_atomic_add_returnErr1RequiresViolation, ldv_atomic_add_returnErr2RequiresViolation, ldv_atomic_add_returnErr3RequiresViolation, ldv_kobject_cleanupErr4RequiresViolation, ldv_kobject_cleanupErr2RequiresViolation, ldv_kobject_cleanupErr5RequiresViolation, ldv_kobject_cleanupErr3RequiresViolation, ldv_kobject_cleanupErr0RequiresViolation, ldv_kobject_cleanupErr1RequiresViolation, mainErr0EnsuresViolation, LDV_INIT_LIST_HEADErr1RequiresViolation, LDV_INIT_LIST_HEADErr3RequiresViolation, LDV_INIT_LIST_HEADErr2RequiresViolation, LDV_INIT_LIST_HEADErr0RequiresViolation]=== [2018-02-02 20:36:01,388 INFO L82 PathProgramCache]: Analyzing trace with hash 689355429, now seen corresponding path program 3 times [2018-02-02 20:36:01,388 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 20:36:01,399 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 20:36:01,400 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 20:36:01,440 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 20:36:01,441 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-02 20:36:01,441 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7] total 7 [2018-02-02 20:36:01,441 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 20:36:01,441 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 20:36:01,441 INFO L182 omatonBuilderFactory]: Interpolants [2720#(<= |#Ultimate.C_memset_#amount| 3), 2714#true, 2715#false, 2716#(= |#Ultimate.C_memset_#t~loopctr21| 0), 2717#(<= |#Ultimate.C_memset_#t~loopctr21| 1), 2718#(<= |#Ultimate.C_memset_#t~loopctr21| 2), 2719#(<= |#Ultimate.C_memset_#t~loopctr21| 3)] [2018-02-02 20:36:01,441 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 20:36:01,442 INFO L409 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-02-02 20:36:01,442 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-02-02 20:36:01,442 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2018-02-02 20:36:01,442 INFO L87 Difference]: Start difference. First operand 161 states and 169 transitions. Second operand 7 states. [2018-02-02 20:36:01,463 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 20:36:01,464 INFO L93 Difference]: Finished difference Result 164 states and 172 transitions. [2018-02-02 20:36:01,464 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-02-02 20:36:01,464 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 37 [2018-02-02 20:36:01,465 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 20:36:01,465 INFO L225 Difference]: With dead ends: 164 [2018-02-02 20:36:01,466 INFO L226 Difference]: Without dead ends: 162 [2018-02-02 20:36:01,466 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=35, Unknown=0, NotChecked=0, Total=56 [2018-02-02 20:36:01,466 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 162 states. [2018-02-02 20:36:01,469 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 162 to 162. [2018-02-02 20:36:01,469 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 162 states. [2018-02-02 20:36:01,470 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 162 states to 162 states and 170 transitions. [2018-02-02 20:36:01,471 INFO L78 Accepts]: Start accepts. Automaton has 162 states and 170 transitions. Word has length 37 [2018-02-02 20:36:01,471 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 20:36:01,471 INFO L432 AbstractCegarLoop]: Abstraction has 162 states and 170 transitions. [2018-02-02 20:36:01,471 INFO L433 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-02-02 20:36:01,471 INFO L276 IsEmpty]: Start isEmpty. Operand 162 states and 170 transitions. [2018-02-02 20:36:01,472 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2018-02-02 20:36:01,472 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 20:36:01,472 INFO L351 BasicCegarLoop]: trace histogram [4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-02-02 20:36:01,472 INFO L371 AbstractCegarLoop]: === Iteration 10 === [ldv_kref_initErr0RequiresViolation, ldv_kref_initErr1RequiresViolation, ldv_kobject_createErr0RequiresViolation, ldv_kobject_createErr1RequiresViolation, ldv_atomic_sub_returnErr1RequiresViolation, ldv_atomic_sub_returnErr0RequiresViolation, ldv_atomic_sub_returnErr3RequiresViolation, ldv_atomic_sub_returnErr2RequiresViolation, ldv_atomic_add_returnErr0RequiresViolation, ldv_atomic_add_returnErr1RequiresViolation, ldv_atomic_add_returnErr2RequiresViolation, ldv_atomic_add_returnErr3RequiresViolation, ldv_kobject_cleanupErr4RequiresViolation, ldv_kobject_cleanupErr2RequiresViolation, ldv_kobject_cleanupErr5RequiresViolation, ldv_kobject_cleanupErr3RequiresViolation, ldv_kobject_cleanupErr0RequiresViolation, ldv_kobject_cleanupErr1RequiresViolation, mainErr0EnsuresViolation, LDV_INIT_LIST_HEADErr1RequiresViolation, LDV_INIT_LIST_HEADErr3RequiresViolation, LDV_INIT_LIST_HEADErr2RequiresViolation, LDV_INIT_LIST_HEADErr0RequiresViolation]=== [2018-02-02 20:36:01,472 INFO L82 PathProgramCache]: Analyzing trace with hash 1907103235, now seen corresponding path program 4 times [2018-02-02 20:36:01,473 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 20:36:01,485 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 20:36:01,486 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 20:36:01,547 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 20:36:01,547 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-02 20:36:01,547 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8] total 8 [2018-02-02 20:36:01,547 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 20:36:01,547 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 20:36:01,548 INFO L182 omatonBuilderFactory]: Interpolants [3056#(<= |#Ultimate.C_memset_#amount| 4), 3049#true, 3050#false, 3051#(= |#Ultimate.C_memset_#t~loopctr21| 0), 3052#(<= |#Ultimate.C_memset_#t~loopctr21| 1), 3053#(<= |#Ultimate.C_memset_#t~loopctr21| 2), 3054#(<= |#Ultimate.C_memset_#t~loopctr21| 3), 3055#(<= |#Ultimate.C_memset_#t~loopctr21| 4)] [2018-02-02 20:36:01,548 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 20:36:01,548 INFO L409 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-02-02 20:36:01,548 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-02-02 20:36:01,548 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2018-02-02 20:36:01,548 INFO L87 Difference]: Start difference. First operand 162 states and 170 transitions. Second operand 8 states. [2018-02-02 20:36:01,573 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 20:36:01,573 INFO L93 Difference]: Finished difference Result 165 states and 173 transitions. [2018-02-02 20:36:01,573 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-02-02 20:36:01,574 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 38 [2018-02-02 20:36:01,574 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 20:36:01,575 INFO L225 Difference]: With dead ends: 165 [2018-02-02 20:36:01,575 INFO L226 Difference]: Without dead ends: 163 [2018-02-02 20:36:01,575 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2018-02-02 20:36:01,575 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 163 states. [2018-02-02 20:36:01,578 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 163 to 163. [2018-02-02 20:36:01,578 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 163 states. [2018-02-02 20:36:01,579 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 163 states to 163 states and 171 transitions. [2018-02-02 20:36:01,579 INFO L78 Accepts]: Start accepts. Automaton has 163 states and 171 transitions. Word has length 38 [2018-02-02 20:36:01,579 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 20:36:01,579 INFO L432 AbstractCegarLoop]: Abstraction has 163 states and 171 transitions. [2018-02-02 20:36:01,579 INFO L433 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-02-02 20:36:01,580 INFO L276 IsEmpty]: Start isEmpty. Operand 163 states and 171 transitions. [2018-02-02 20:36:01,580 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2018-02-02 20:36:01,580 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 20:36:01,580 INFO L351 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-02 20:36:01,580 INFO L371 AbstractCegarLoop]: === Iteration 11 === [ldv_kref_initErr0RequiresViolation, ldv_kref_initErr1RequiresViolation, ldv_kobject_createErr0RequiresViolation, ldv_kobject_createErr1RequiresViolation, ldv_atomic_sub_returnErr1RequiresViolation, ldv_atomic_sub_returnErr0RequiresViolation, ldv_atomic_sub_returnErr3RequiresViolation, ldv_atomic_sub_returnErr2RequiresViolation, ldv_atomic_add_returnErr0RequiresViolation, ldv_atomic_add_returnErr1RequiresViolation, ldv_atomic_add_returnErr2RequiresViolation, ldv_atomic_add_returnErr3RequiresViolation, ldv_kobject_cleanupErr4RequiresViolation, ldv_kobject_cleanupErr2RequiresViolation, ldv_kobject_cleanupErr5RequiresViolation, ldv_kobject_cleanupErr3RequiresViolation, ldv_kobject_cleanupErr0RequiresViolation, ldv_kobject_cleanupErr1RequiresViolation, mainErr0EnsuresViolation, LDV_INIT_LIST_HEADErr1RequiresViolation, LDV_INIT_LIST_HEADErr3RequiresViolation, LDV_INIT_LIST_HEADErr2RequiresViolation, LDV_INIT_LIST_HEADErr0RequiresViolation]=== [2018-02-02 20:36:01,581 INFO L82 PathProgramCache]: Analyzing trace with hash -2073429328, now seen corresponding path program 1 times [2018-02-02 20:36:01,581 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 20:36:01,590 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 20:36:01,591 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 20:36:01,641 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 20:36:01,641 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-02 20:36:01,642 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-02-02 20:36:01,642 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 20:36:01,642 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 20:36:01,642 INFO L182 omatonBuilderFactory]: Interpolants [3392#(and (= 0 |ldv_kobject_put_#in~kobj.offset|) (= 0 |ldv_kobject_put_#in~kobj.base|)), 3393#(and (= ldv_kobject_put_~kobj.offset 0) (= 0 ldv_kobject_put_~kobj.base)), 3387#true, 3388#false, 3389#(and (= 0 |ldv_kobject_create_#res.base|) (= 0 |ldv_kobject_create_#res.offset|)), 3390#(and (= 0 |entry_point_#t~ret20.base|) (= 0 |entry_point_#t~ret20.offset|)), 3391#(and (= 0 entry_point_~kobj~2.base) (= 0 entry_point_~kobj~2.offset))] [2018-02-02 20:36:01,642 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 20:36:01,643 INFO L409 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-02-02 20:36:01,643 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-02-02 20:36:01,643 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2018-02-02 20:36:01,643 INFO L87 Difference]: Start difference. First operand 163 states and 171 transitions. Second operand 7 states. [2018-02-02 20:36:01,702 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 20:36:01,703 INFO L93 Difference]: Finished difference Result 172 states and 180 transitions. [2018-02-02 20:36:01,703 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-02-02 20:36:01,703 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 40 [2018-02-02 20:36:01,703 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 20:36:01,704 INFO L225 Difference]: With dead ends: 172 [2018-02-02 20:36:01,704 INFO L226 Difference]: Without dead ends: 172 [2018-02-02 20:36:01,704 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2018-02-02 20:36:01,705 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 172 states. [2018-02-02 20:36:01,708 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 172 to 168. [2018-02-02 20:36:01,708 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 168 states. [2018-02-02 20:36:01,709 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 168 states to 168 states and 176 transitions. [2018-02-02 20:36:01,709 INFO L78 Accepts]: Start accepts. Automaton has 168 states and 176 transitions. Word has length 40 [2018-02-02 20:36:01,709 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 20:36:01,709 INFO L432 AbstractCegarLoop]: Abstraction has 168 states and 176 transitions. [2018-02-02 20:36:01,709 INFO L433 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-02-02 20:36:01,709 INFO L276 IsEmpty]: Start isEmpty. Operand 168 states and 176 transitions. [2018-02-02 20:36:01,710 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2018-02-02 20:36:01,710 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 20:36:01,710 INFO L351 BasicCegarLoop]: trace histogram [5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-02-02 20:36:01,710 INFO L371 AbstractCegarLoop]: === Iteration 12 === [ldv_kref_initErr0RequiresViolation, ldv_kref_initErr1RequiresViolation, ldv_kobject_createErr0RequiresViolation, ldv_kobject_createErr1RequiresViolation, ldv_atomic_sub_returnErr1RequiresViolation, ldv_atomic_sub_returnErr0RequiresViolation, ldv_atomic_sub_returnErr3RequiresViolation, ldv_atomic_sub_returnErr2RequiresViolation, ldv_atomic_add_returnErr0RequiresViolation, ldv_atomic_add_returnErr1RequiresViolation, ldv_atomic_add_returnErr2RequiresViolation, ldv_atomic_add_returnErr3RequiresViolation, ldv_kobject_cleanupErr4RequiresViolation, ldv_kobject_cleanupErr2RequiresViolation, ldv_kobject_cleanupErr5RequiresViolation, ldv_kobject_cleanupErr3RequiresViolation, ldv_kobject_cleanupErr0RequiresViolation, ldv_kobject_cleanupErr1RequiresViolation, mainErr0EnsuresViolation, LDV_INIT_LIST_HEADErr1RequiresViolation, LDV_INIT_LIST_HEADErr3RequiresViolation, LDV_INIT_LIST_HEADErr2RequiresViolation, LDV_INIT_LIST_HEADErr0RequiresViolation]=== [2018-02-02 20:36:01,710 INFO L82 PathProgramCache]: Analyzing trace with hash 1002579557, now seen corresponding path program 5 times [2018-02-02 20:36:01,711 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 20:36:01,721 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 20:36:01,722 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 20:36:01,771 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 15 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 20:36:01,772 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-02 20:36:01,772 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9] total 9 [2018-02-02 20:36:01,772 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 20:36:01,772 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 20:36:01,772 INFO L182 omatonBuilderFactory]: Interpolants [3744#(<= |#Ultimate.C_memset_#amount| 5), 3736#true, 3737#false, 3738#(= |#Ultimate.C_memset_#t~loopctr21| 0), 3739#(<= |#Ultimate.C_memset_#t~loopctr21| 1), 3740#(<= |#Ultimate.C_memset_#t~loopctr21| 2), 3741#(<= |#Ultimate.C_memset_#t~loopctr21| 3), 3742#(<= |#Ultimate.C_memset_#t~loopctr21| 4), 3743#(<= |#Ultimate.C_memset_#t~loopctr21| 5)] [2018-02-02 20:36:01,773 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 15 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 20:36:01,773 INFO L409 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-02-02 20:36:01,773 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-02-02 20:36:01,773 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2018-02-02 20:36:01,773 INFO L87 Difference]: Start difference. First operand 168 states and 176 transitions. Second operand 9 states. [2018-02-02 20:36:01,830 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 20:36:01,830 INFO L93 Difference]: Finished difference Result 171 states and 179 transitions. [2018-02-02 20:36:01,831 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-02-02 20:36:01,831 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 39 [2018-02-02 20:36:01,831 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 20:36:01,832 INFO L225 Difference]: With dead ends: 171 [2018-02-02 20:36:01,832 INFO L226 Difference]: Without dead ends: 169 [2018-02-02 20:36:01,832 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=34, Invalid=56, Unknown=0, NotChecked=0, Total=90 [2018-02-02 20:36:01,835 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 169 states. [2018-02-02 20:36:01,838 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 169 to 169. [2018-02-02 20:36:01,838 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 169 states. [2018-02-02 20:36:01,840 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 169 states to 169 states and 177 transitions. [2018-02-02 20:36:01,840 INFO L78 Accepts]: Start accepts. Automaton has 169 states and 177 transitions. Word has length 39 [2018-02-02 20:36:01,840 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 20:36:01,840 INFO L432 AbstractCegarLoop]: Abstraction has 169 states and 177 transitions. [2018-02-02 20:36:01,840 INFO L433 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-02-02 20:36:01,841 INFO L276 IsEmpty]: Start isEmpty. Operand 169 states and 177 transitions. [2018-02-02 20:36:01,841 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2018-02-02 20:36:01,841 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 20:36:01,841 INFO L351 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-02 20:36:01,841 INFO L371 AbstractCegarLoop]: === Iteration 13 === [ldv_kref_initErr0RequiresViolation, ldv_kref_initErr1RequiresViolation, ldv_kobject_createErr0RequiresViolation, ldv_kobject_createErr1RequiresViolation, ldv_atomic_sub_returnErr1RequiresViolation, ldv_atomic_sub_returnErr0RequiresViolation, ldv_atomic_sub_returnErr3RequiresViolation, ldv_atomic_sub_returnErr2RequiresViolation, ldv_atomic_add_returnErr0RequiresViolation, ldv_atomic_add_returnErr1RequiresViolation, ldv_atomic_add_returnErr2RequiresViolation, ldv_atomic_add_returnErr3RequiresViolation, ldv_kobject_cleanupErr4RequiresViolation, ldv_kobject_cleanupErr2RequiresViolation, ldv_kobject_cleanupErr5RequiresViolation, ldv_kobject_cleanupErr3RequiresViolation, ldv_kobject_cleanupErr0RequiresViolation, ldv_kobject_cleanupErr1RequiresViolation, mainErr0EnsuresViolation, LDV_INIT_LIST_HEADErr1RequiresViolation, LDV_INIT_LIST_HEADErr3RequiresViolation, LDV_INIT_LIST_HEADErr2RequiresViolation, LDV_INIT_LIST_HEADErr0RequiresViolation]=== [2018-02-02 20:36:01,842 INFO L82 PathProgramCache]: Analyzing trace with hash 2040053740, now seen corresponding path program 1 times [2018-02-02 20:36:01,843 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 20:36:01,853 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 20:36:01,854 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 20:36:01,903 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 20:36:01,903 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-02 20:36:01,903 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-02-02 20:36:01,915 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 20:36:01,915 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 20:36:01,915 INFO L182 omatonBuilderFactory]: Interpolants [4087#true, 4088#false, 4089#(= |#valid| |old(#valid)|)] [2018-02-02 20:36:01,916 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 20:36:01,916 INFO L409 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-02-02 20:36:01,916 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-02-02 20:36:01,916 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-02-02 20:36:01,916 INFO L87 Difference]: Start difference. First operand 169 states and 177 transitions. Second operand 3 states. [2018-02-02 20:36:02,020 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 20:36:02,020 INFO L93 Difference]: Finished difference Result 185 states and 194 transitions. [2018-02-02 20:36:02,020 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-02-02 20:36:02,020 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 38 [2018-02-02 20:36:02,020 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 20:36:02,021 INFO L225 Difference]: With dead ends: 185 [2018-02-02 20:36:02,021 INFO L226 Difference]: Without dead ends: 173 [2018-02-02 20:36:02,021 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-02-02 20:36:02,021 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 173 states. [2018-02-02 20:36:02,025 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 173 to 165. [2018-02-02 20:36:02,025 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 165 states. [2018-02-02 20:36:02,026 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 165 states to 165 states and 172 transitions. [2018-02-02 20:36:02,026 INFO L78 Accepts]: Start accepts. Automaton has 165 states and 172 transitions. Word has length 38 [2018-02-02 20:36:02,027 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 20:36:02,027 INFO L432 AbstractCegarLoop]: Abstraction has 165 states and 172 transitions. [2018-02-02 20:36:02,027 INFO L433 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-02-02 20:36:02,027 INFO L276 IsEmpty]: Start isEmpty. Operand 165 states and 172 transitions. [2018-02-02 20:36:02,027 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2018-02-02 20:36:02,027 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 20:36:02,028 INFO L351 BasicCegarLoop]: trace histogram [6, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-02-02 20:36:02,028 INFO L371 AbstractCegarLoop]: === Iteration 14 === [ldv_kref_initErr0RequiresViolation, ldv_kref_initErr1RequiresViolation, ldv_kobject_createErr0RequiresViolation, ldv_kobject_createErr1RequiresViolation, ldv_atomic_sub_returnErr1RequiresViolation, ldv_atomic_sub_returnErr0RequiresViolation, ldv_atomic_sub_returnErr3RequiresViolation, ldv_atomic_sub_returnErr2RequiresViolation, ldv_atomic_add_returnErr0RequiresViolation, ldv_atomic_add_returnErr1RequiresViolation, ldv_atomic_add_returnErr2RequiresViolation, ldv_atomic_add_returnErr3RequiresViolation, ldv_kobject_cleanupErr4RequiresViolation, ldv_kobject_cleanupErr2RequiresViolation, ldv_kobject_cleanupErr5RequiresViolation, ldv_kobject_cleanupErr3RequiresViolation, ldv_kobject_cleanupErr0RequiresViolation, ldv_kobject_cleanupErr1RequiresViolation, mainErr0EnsuresViolation, LDV_INIT_LIST_HEADErr1RequiresViolation, LDV_INIT_LIST_HEADErr3RequiresViolation, LDV_INIT_LIST_HEADErr2RequiresViolation, LDV_INIT_LIST_HEADErr0RequiresViolation]=== [2018-02-02 20:36:02,028 INFO L82 PathProgramCache]: Analyzing trace with hash -1267850685, now seen corresponding path program 6 times [2018-02-02 20:36:02,029 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 20:36:02,039 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 20:36:02,040 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 20:36:02,079 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 0 proven. 21 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 20:36:02,079 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-02 20:36:02,079 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10] total 10 [2018-02-02 20:36:02,080 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 20:36:02,080 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 20:36:02,080 INFO L182 omatonBuilderFactory]: Interpolants [4448#(<= |#Ultimate.C_memset_#t~loopctr21| 6), 4449#(<= |#Ultimate.C_memset_#amount| 6), 4440#true, 4441#false, 4442#(= |#Ultimate.C_memset_#t~loopctr21| 0), 4443#(<= |#Ultimate.C_memset_#t~loopctr21| 1), 4444#(<= |#Ultimate.C_memset_#t~loopctr21| 2), 4445#(<= |#Ultimate.C_memset_#t~loopctr21| 3), 4446#(<= |#Ultimate.C_memset_#t~loopctr21| 4), 4447#(<= |#Ultimate.C_memset_#t~loopctr21| 5)] [2018-02-02 20:36:02,080 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 0 proven. 21 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 20:36:02,080 INFO L409 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-02-02 20:36:02,081 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-02-02 20:36:02,081 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2018-02-02 20:36:02,081 INFO L87 Difference]: Start difference. First operand 165 states and 172 transitions. Second operand 10 states. [2018-02-02 20:36:02,103 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 20:36:02,104 INFO L93 Difference]: Finished difference Result 168 states and 175 transitions. [2018-02-02 20:36:02,104 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-02-02 20:36:02,104 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 40 [2018-02-02 20:36:02,104 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 20:36:02,105 INFO L225 Difference]: With dead ends: 168 [2018-02-02 20:36:02,105 INFO L226 Difference]: Without dead ends: 166 [2018-02-02 20:36:02,105 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=42, Invalid=68, Unknown=0, NotChecked=0, Total=110 [2018-02-02 20:36:02,105 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 166 states. [2018-02-02 20:36:02,107 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 166 to 166. [2018-02-02 20:36:02,107 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 166 states. [2018-02-02 20:36:02,108 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 166 states to 166 states and 173 transitions. [2018-02-02 20:36:02,108 INFO L78 Accepts]: Start accepts. Automaton has 166 states and 173 transitions. Word has length 40 [2018-02-02 20:36:02,108 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 20:36:02,108 INFO L432 AbstractCegarLoop]: Abstraction has 166 states and 173 transitions. [2018-02-02 20:36:02,108 INFO L433 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-02-02 20:36:02,108 INFO L276 IsEmpty]: Start isEmpty. Operand 166 states and 173 transitions. [2018-02-02 20:36:02,109 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2018-02-02 20:36:02,109 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 20:36:02,109 INFO L351 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-02 20:36:02,109 INFO L371 AbstractCegarLoop]: === Iteration 15 === [ldv_kref_initErr0RequiresViolation, ldv_kref_initErr1RequiresViolation, ldv_kobject_createErr0RequiresViolation, ldv_kobject_createErr1RequiresViolation, ldv_atomic_sub_returnErr1RequiresViolation, ldv_atomic_sub_returnErr0RequiresViolation, ldv_atomic_sub_returnErr3RequiresViolation, ldv_atomic_sub_returnErr2RequiresViolation, ldv_atomic_add_returnErr0RequiresViolation, ldv_atomic_add_returnErr1RequiresViolation, ldv_atomic_add_returnErr2RequiresViolation, ldv_atomic_add_returnErr3RequiresViolation, ldv_kobject_cleanupErr4RequiresViolation, ldv_kobject_cleanupErr2RequiresViolation, ldv_kobject_cleanupErr5RequiresViolation, ldv_kobject_cleanupErr3RequiresViolation, ldv_kobject_cleanupErr0RequiresViolation, ldv_kobject_cleanupErr1RequiresViolation, mainErr0EnsuresViolation, LDV_INIT_LIST_HEADErr1RequiresViolation, LDV_INIT_LIST_HEADErr3RequiresViolation, LDV_INIT_LIST_HEADErr2RequiresViolation, LDV_INIT_LIST_HEADErr0RequiresViolation]=== [2018-02-02 20:36:02,109 INFO L82 PathProgramCache]: Analyzing trace with hash 8062858, now seen corresponding path program 1 times [2018-02-02 20:36:02,110 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 20:36:02,114 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 20:36:02,115 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 20:36:02,132 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 20:36:02,132 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-02 20:36:02,132 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-02-02 20:36:02,132 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 20:36:02,132 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 20:36:02,132 INFO L182 omatonBuilderFactory]: Interpolants [4786#true, 4787#false, 4788#(not (= |ldv_malloc_#t~malloc4.base| 0)), 4789#(not (= |ldv_malloc_#res.base| 0)), 4790#(not (= |ldv_kobject_create_#t~ret17.base| 0)), 4791#(not (= ldv_kobject_create_~kobj~1.base 0))] [2018-02-02 20:36:02,132 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 20:36:02,133 INFO L409 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-02-02 20:36:02,133 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-02-02 20:36:02,133 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-02-02 20:36:02,133 INFO L87 Difference]: Start difference. First operand 166 states and 173 transitions. Second operand 6 states. [2018-02-02 20:36:02,146 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 20:36:02,146 INFO L93 Difference]: Finished difference Result 147 states and 153 transitions. [2018-02-02 20:36:02,146 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-02-02 20:36:02,147 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 40 [2018-02-02 20:36:02,147 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 20:36:02,147 INFO L225 Difference]: With dead ends: 147 [2018-02-02 20:36:02,147 INFO L226 Difference]: Without dead ends: 147 [2018-02-02 20:36:02,148 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2018-02-02 20:36:02,148 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 147 states. [2018-02-02 20:36:02,149 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 147 to 147. [2018-02-02 20:36:02,149 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 147 states. [2018-02-02 20:36:02,150 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 147 states to 147 states and 153 transitions. [2018-02-02 20:36:02,150 INFO L78 Accepts]: Start accepts. Automaton has 147 states and 153 transitions. Word has length 40 [2018-02-02 20:36:02,150 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 20:36:02,150 INFO L432 AbstractCegarLoop]: Abstraction has 147 states and 153 transitions. [2018-02-02 20:36:02,150 INFO L433 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-02-02 20:36:02,150 INFO L276 IsEmpty]: Start isEmpty. Operand 147 states and 153 transitions. [2018-02-02 20:36:02,150 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2018-02-02 20:36:02,151 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 20:36:02,151 INFO L351 BasicCegarLoop]: trace histogram [7, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-02-02 20:36:02,151 INFO L371 AbstractCegarLoop]: === Iteration 16 === [ldv_kref_initErr0RequiresViolation, ldv_kref_initErr1RequiresViolation, ldv_kobject_createErr0RequiresViolation, ldv_kobject_createErr1RequiresViolation, ldv_atomic_sub_returnErr1RequiresViolation, ldv_atomic_sub_returnErr0RequiresViolation, ldv_atomic_sub_returnErr3RequiresViolation, ldv_atomic_sub_returnErr2RequiresViolation, ldv_atomic_add_returnErr0RequiresViolation, ldv_atomic_add_returnErr1RequiresViolation, ldv_atomic_add_returnErr2RequiresViolation, ldv_atomic_add_returnErr3RequiresViolation, ldv_kobject_cleanupErr4RequiresViolation, ldv_kobject_cleanupErr2RequiresViolation, ldv_kobject_cleanupErr5RequiresViolation, ldv_kobject_cleanupErr3RequiresViolation, ldv_kobject_cleanupErr0RequiresViolation, ldv_kobject_cleanupErr1RequiresViolation, mainErr0EnsuresViolation, LDV_INIT_LIST_HEADErr1RequiresViolation, LDV_INIT_LIST_HEADErr3RequiresViolation, LDV_INIT_LIST_HEADErr2RequiresViolation, LDV_INIT_LIST_HEADErr0RequiresViolation]=== [2018-02-02 20:36:02,151 INFO L82 PathProgramCache]: Analyzing trace with hash 1363255845, now seen corresponding path program 7 times [2018-02-02 20:36:02,152 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 20:36:02,163 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 20:36:02,164 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 20:36:02,222 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 0 proven. 28 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 20:36:02,222 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-02 20:36:02,222 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [11] total 11 [2018-02-02 20:36:02,222 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 20:36:02,222 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 20:36:02,223 INFO L182 omatonBuilderFactory]: Interpolants [5088#true, 5089#false, 5090#(= |#Ultimate.C_memset_#t~loopctr21| 0), 5091#(<= |#Ultimate.C_memset_#t~loopctr21| 1), 5092#(<= |#Ultimate.C_memset_#t~loopctr21| 2), 5093#(<= |#Ultimate.C_memset_#t~loopctr21| 3), 5094#(<= |#Ultimate.C_memset_#t~loopctr21| 4), 5095#(<= |#Ultimate.C_memset_#t~loopctr21| 5), 5096#(<= |#Ultimate.C_memset_#t~loopctr21| 6), 5097#(<= |#Ultimate.C_memset_#t~loopctr21| 7), 5098#(<= |#Ultimate.C_memset_#amount| 7)] [2018-02-02 20:36:02,223 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 0 proven. 28 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 20:36:02,223 INFO L409 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-02-02 20:36:02,223 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-02-02 20:36:02,223 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=63, Unknown=0, NotChecked=0, Total=110 [2018-02-02 20:36:02,223 INFO L87 Difference]: Start difference. First operand 147 states and 153 transitions. Second operand 11 states. [2018-02-02 20:36:02,245 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 20:36:02,245 INFO L93 Difference]: Finished difference Result 150 states and 156 transitions. [2018-02-02 20:36:02,246 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-02-02 20:36:02,246 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 41 [2018-02-02 20:36:02,246 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 20:36:02,247 INFO L225 Difference]: With dead ends: 150 [2018-02-02 20:36:02,247 INFO L226 Difference]: Without dead ends: 148 [2018-02-02 20:36:02,247 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=51, Invalid=81, Unknown=0, NotChecked=0, Total=132 [2018-02-02 20:36:02,247 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 148 states. [2018-02-02 20:36:02,251 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 148 to 148. [2018-02-02 20:36:02,252 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 148 states. [2018-02-02 20:36:02,252 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 148 states to 148 states and 154 transitions. [2018-02-02 20:36:02,253 INFO L78 Accepts]: Start accepts. Automaton has 148 states and 154 transitions. Word has length 41 [2018-02-02 20:36:02,253 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 20:36:02,253 INFO L432 AbstractCegarLoop]: Abstraction has 148 states and 154 transitions. [2018-02-02 20:36:02,253 INFO L433 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-02-02 20:36:02,253 INFO L276 IsEmpty]: Start isEmpty. Operand 148 states and 154 transitions. [2018-02-02 20:36:02,253 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2018-02-02 20:36:02,254 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 20:36:02,254 INFO L351 BasicCegarLoop]: trace histogram [8, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-02-02 20:36:02,254 INFO L371 AbstractCegarLoop]: === Iteration 17 === [ldv_kref_initErr0RequiresViolation, ldv_kref_initErr1RequiresViolation, ldv_kobject_createErr0RequiresViolation, ldv_kobject_createErr1RequiresViolation, ldv_atomic_sub_returnErr1RequiresViolation, ldv_atomic_sub_returnErr0RequiresViolation, ldv_atomic_sub_returnErr3RequiresViolation, ldv_atomic_sub_returnErr2RequiresViolation, ldv_atomic_add_returnErr0RequiresViolation, ldv_atomic_add_returnErr1RequiresViolation, ldv_atomic_add_returnErr2RequiresViolation, ldv_atomic_add_returnErr3RequiresViolation, ldv_kobject_cleanupErr4RequiresViolation, ldv_kobject_cleanupErr2RequiresViolation, ldv_kobject_cleanupErr5RequiresViolation, ldv_kobject_cleanupErr3RequiresViolation, ldv_kobject_cleanupErr0RequiresViolation, ldv_kobject_cleanupErr1RequiresViolation, mainErr0EnsuresViolation, LDV_INIT_LIST_HEADErr1RequiresViolation, LDV_INIT_LIST_HEADErr3RequiresViolation, LDV_INIT_LIST_HEADErr2RequiresViolation, LDV_INIT_LIST_HEADErr0RequiresViolation]=== [2018-02-02 20:36:02,254 INFO L82 PathProgramCache]: Analyzing trace with hash 1323179651, now seen corresponding path program 8 times [2018-02-02 20:36:02,255 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 20:36:02,266 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 20:36:02,267 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 20:36:02,351 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 36 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 20:36:02,351 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-02 20:36:02,351 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [12] total 12 [2018-02-02 20:36:02,351 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 20:36:02,352 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 20:36:02,352 INFO L182 omatonBuilderFactory]: Interpolants [5408#(<= |#Ultimate.C_memset_#t~loopctr21| 7), 5409#(<= |#Ultimate.C_memset_#t~loopctr21| 8), 5410#(<= |#Ultimate.C_memset_#amount| 8), 5399#true, 5400#false, 5401#(= |#Ultimate.C_memset_#t~loopctr21| 0), 5402#(<= |#Ultimate.C_memset_#t~loopctr21| 1), 5403#(<= |#Ultimate.C_memset_#t~loopctr21| 2), 5404#(<= |#Ultimate.C_memset_#t~loopctr21| 3), 5405#(<= |#Ultimate.C_memset_#t~loopctr21| 4), 5406#(<= |#Ultimate.C_memset_#t~loopctr21| 5), 5407#(<= |#Ultimate.C_memset_#t~loopctr21| 6)] [2018-02-02 20:36:02,352 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 36 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 20:36:02,352 INFO L409 AbstractCegarLoop]: Interpolant automaton has 12 states [2018-02-02 20:36:02,352 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2018-02-02 20:36:02,352 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=75, Unknown=0, NotChecked=0, Total=132 [2018-02-02 20:36:02,352 INFO L87 Difference]: Start difference. First operand 148 states and 154 transitions. Second operand 12 states. [2018-02-02 20:36:02,375 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 20:36:02,376 INFO L93 Difference]: Finished difference Result 151 states and 157 transitions. [2018-02-02 20:36:02,376 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-02-02 20:36:02,376 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 42 [2018-02-02 20:36:02,376 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 20:36:02,377 INFO L225 Difference]: With dead ends: 151 [2018-02-02 20:36:02,377 INFO L226 Difference]: Without dead ends: 149 [2018-02-02 20:36:02,378 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=61, Invalid=95, Unknown=0, NotChecked=0, Total=156 [2018-02-02 20:36:02,378 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 149 states. [2018-02-02 20:36:02,380 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 149 to 149. [2018-02-02 20:36:02,380 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 149 states. [2018-02-02 20:36:02,381 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 149 states to 149 states and 155 transitions. [2018-02-02 20:36:02,381 INFO L78 Accepts]: Start accepts. Automaton has 149 states and 155 transitions. Word has length 42 [2018-02-02 20:36:02,381 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 20:36:02,382 INFO L432 AbstractCegarLoop]: Abstraction has 149 states and 155 transitions. [2018-02-02 20:36:02,382 INFO L433 AbstractCegarLoop]: Interpolant automaton has 12 states. [2018-02-02 20:36:02,382 INFO L276 IsEmpty]: Start isEmpty. Operand 149 states and 155 transitions. [2018-02-02 20:36:02,382 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2018-02-02 20:36:02,382 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 20:36:02,382 INFO L351 BasicCegarLoop]: trace histogram [9, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-02-02 20:36:02,382 INFO L371 AbstractCegarLoop]: === Iteration 18 === [ldv_kref_initErr0RequiresViolation, ldv_kref_initErr1RequiresViolation, ldv_kobject_createErr0RequiresViolation, ldv_kobject_createErr1RequiresViolation, ldv_atomic_sub_returnErr1RequiresViolation, ldv_atomic_sub_returnErr0RequiresViolation, ldv_atomic_sub_returnErr3RequiresViolation, ldv_atomic_sub_returnErr2RequiresViolation, ldv_atomic_add_returnErr0RequiresViolation, ldv_atomic_add_returnErr1RequiresViolation, ldv_atomic_add_returnErr2RequiresViolation, ldv_atomic_add_returnErr3RequiresViolation, ldv_kobject_cleanupErr4RequiresViolation, ldv_kobject_cleanupErr2RequiresViolation, ldv_kobject_cleanupErr5RequiresViolation, ldv_kobject_cleanupErr3RequiresViolation, ldv_kobject_cleanupErr0RequiresViolation, ldv_kobject_cleanupErr1RequiresViolation, mainErr0EnsuresViolation, LDV_INIT_LIST_HEADErr1RequiresViolation, LDV_INIT_LIST_HEADErr3RequiresViolation, LDV_INIT_LIST_HEADErr2RequiresViolation, LDV_INIT_LIST_HEADErr0RequiresViolation]=== [2018-02-02 20:36:02,383 INFO L82 PathProgramCache]: Analyzing trace with hash 80817637, now seen corresponding path program 9 times [2018-02-02 20:36:02,383 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 20:36:02,395 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 20:36:02,396 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 20:36:02,486 INFO L134 CoverageAnalysis]: Checked inductivity of 45 backedges. 0 proven. 45 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 20:36:02,486 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-02 20:36:02,486 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [13] total 13 [2018-02-02 20:36:02,486 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 20:36:02,486 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 20:36:02,487 INFO L182 omatonBuilderFactory]: Interpolants [5713#true, 5714#false, 5715#(= |#Ultimate.C_memset_#t~loopctr21| 0), 5716#(<= |#Ultimate.C_memset_#t~loopctr21| 1), 5717#(<= |#Ultimate.C_memset_#t~loopctr21| 2), 5718#(<= |#Ultimate.C_memset_#t~loopctr21| 3), 5719#(<= |#Ultimate.C_memset_#t~loopctr21| 4), 5720#(<= |#Ultimate.C_memset_#t~loopctr21| 5), 5721#(<= |#Ultimate.C_memset_#t~loopctr21| 6), 5722#(<= |#Ultimate.C_memset_#t~loopctr21| 7), 5723#(<= |#Ultimate.C_memset_#t~loopctr21| 8), 5724#(<= |#Ultimate.C_memset_#t~loopctr21| 9), 5725#(<= |#Ultimate.C_memset_#amount| 9)] [2018-02-02 20:36:02,487 INFO L134 CoverageAnalysis]: Checked inductivity of 45 backedges. 0 proven. 45 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 20:36:02,487 INFO L409 AbstractCegarLoop]: Interpolant automaton has 13 states [2018-02-02 20:36:02,487 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2018-02-02 20:36:02,487 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=68, Invalid=88, Unknown=0, NotChecked=0, Total=156 [2018-02-02 20:36:02,487 INFO L87 Difference]: Start difference. First operand 149 states and 155 transitions. Second operand 13 states. [2018-02-02 20:36:02,516 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 20:36:02,516 INFO L93 Difference]: Finished difference Result 152 states and 158 transitions. [2018-02-02 20:36:02,516 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2018-02-02 20:36:02,516 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 43 [2018-02-02 20:36:02,516 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 20:36:02,517 INFO L225 Difference]: With dead ends: 152 [2018-02-02 20:36:02,517 INFO L226 Difference]: Without dead ends: 150 [2018-02-02 20:36:02,517 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=72, Invalid=110, Unknown=0, NotChecked=0, Total=182 [2018-02-02 20:36:02,517 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 150 states. [2018-02-02 20:36:02,519 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 150 to 150. [2018-02-02 20:36:02,519 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 150 states. [2018-02-02 20:36:02,519 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 150 states to 150 states and 156 transitions. [2018-02-02 20:36:02,520 INFO L78 Accepts]: Start accepts. Automaton has 150 states and 156 transitions. Word has length 43 [2018-02-02 20:36:02,520 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 20:36:02,520 INFO L432 AbstractCegarLoop]: Abstraction has 150 states and 156 transitions. [2018-02-02 20:36:02,520 INFO L433 AbstractCegarLoop]: Interpolant automaton has 13 states. [2018-02-02 20:36:02,520 INFO L276 IsEmpty]: Start isEmpty. Operand 150 states and 156 transitions. [2018-02-02 20:36:02,520 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2018-02-02 20:36:02,520 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 20:36:02,520 INFO L351 BasicCegarLoop]: trace histogram [10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-02-02 20:36:02,520 INFO L371 AbstractCegarLoop]: === Iteration 19 === [ldv_kref_initErr0RequiresViolation, ldv_kref_initErr1RequiresViolation, ldv_kobject_createErr0RequiresViolation, ldv_kobject_createErr1RequiresViolation, ldv_atomic_sub_returnErr1RequiresViolation, ldv_atomic_sub_returnErr0RequiresViolation, ldv_atomic_sub_returnErr3RequiresViolation, ldv_atomic_sub_returnErr2RequiresViolation, ldv_atomic_add_returnErr0RequiresViolation, ldv_atomic_add_returnErr1RequiresViolation, ldv_atomic_add_returnErr2RequiresViolation, ldv_atomic_add_returnErr3RequiresViolation, ldv_kobject_cleanupErr4RequiresViolation, ldv_kobject_cleanupErr2RequiresViolation, ldv_kobject_cleanupErr5RequiresViolation, ldv_kobject_cleanupErr3RequiresViolation, ldv_kobject_cleanupErr0RequiresViolation, ldv_kobject_cleanupErr1RequiresViolation, mainErr0EnsuresViolation, LDV_INIT_LIST_HEADErr1RequiresViolation, LDV_INIT_LIST_HEADErr3RequiresViolation, LDV_INIT_LIST_HEADErr2RequiresViolation, LDV_INIT_LIST_HEADErr0RequiresViolation]=== [2018-02-02 20:36:02,521 INFO L82 PathProgramCache]: Analyzing trace with hash 222300867, now seen corresponding path program 10 times [2018-02-02 20:36:02,521 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 20:36:02,530 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 20:36:02,530 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 20:36:02,594 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 0 proven. 55 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 20:36:02,594 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-02 20:36:02,594 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [14] total 14 [2018-02-02 20:36:02,594 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 20:36:02,594 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 20:36:02,595 INFO L182 omatonBuilderFactory]: Interpolants [6030#true, 6031#false, 6032#(= |#Ultimate.C_memset_#t~loopctr21| 0), 6033#(<= |#Ultimate.C_memset_#t~loopctr21| 1), 6034#(<= |#Ultimate.C_memset_#t~loopctr21| 2), 6035#(<= |#Ultimate.C_memset_#t~loopctr21| 3), 6036#(<= |#Ultimate.C_memset_#t~loopctr21| 4), 6037#(<= |#Ultimate.C_memset_#t~loopctr21| 5), 6038#(<= |#Ultimate.C_memset_#t~loopctr21| 6), 6039#(<= |#Ultimate.C_memset_#t~loopctr21| 7), 6040#(<= |#Ultimate.C_memset_#t~loopctr21| 8), 6041#(<= |#Ultimate.C_memset_#t~loopctr21| 9), 6042#(<= |#Ultimate.C_memset_#t~loopctr21| 10), 6043#(<= |#Ultimate.C_memset_#amount| 10)] [2018-02-02 20:36:02,595 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 0 proven. 55 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 20:36:02,595 INFO L409 AbstractCegarLoop]: Interpolant automaton has 14 states [2018-02-02 20:36:02,595 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2018-02-02 20:36:02,595 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=80, Invalid=102, Unknown=0, NotChecked=0, Total=182 [2018-02-02 20:36:02,595 INFO L87 Difference]: Start difference. First operand 150 states and 156 transitions. Second operand 14 states. [2018-02-02 20:36:02,619 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 20:36:02,619 INFO L93 Difference]: Finished difference Result 153 states and 159 transitions. [2018-02-02 20:36:02,619 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2018-02-02 20:36:02,619 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 44 [2018-02-02 20:36:02,619 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 20:36:02,620 INFO L225 Difference]: With dead ends: 153 [2018-02-02 20:36:02,620 INFO L226 Difference]: Without dead ends: 151 [2018-02-02 20:36:02,620 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=84, Invalid=126, Unknown=0, NotChecked=0, Total=210 [2018-02-02 20:36:02,620 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 151 states. [2018-02-02 20:36:02,621 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 151 to 151. [2018-02-02 20:36:02,621 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 151 states. [2018-02-02 20:36:02,622 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 151 states to 151 states and 157 transitions. [2018-02-02 20:36:02,622 INFO L78 Accepts]: Start accepts. Automaton has 151 states and 157 transitions. Word has length 44 [2018-02-02 20:36:02,622 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 20:36:02,622 INFO L432 AbstractCegarLoop]: Abstraction has 151 states and 157 transitions. [2018-02-02 20:36:02,622 INFO L433 AbstractCegarLoop]: Interpolant automaton has 14 states. [2018-02-02 20:36:02,622 INFO L276 IsEmpty]: Start isEmpty. Operand 151 states and 157 transitions. [2018-02-02 20:36:02,622 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2018-02-02 20:36:02,622 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 20:36:02,622 INFO L351 BasicCegarLoop]: trace histogram [11, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-02-02 20:36:02,623 INFO L371 AbstractCegarLoop]: === Iteration 20 === [ldv_kref_initErr0RequiresViolation, ldv_kref_initErr1RequiresViolation, ldv_kobject_createErr0RequiresViolation, ldv_kobject_createErr1RequiresViolation, ldv_atomic_sub_returnErr1RequiresViolation, ldv_atomic_sub_returnErr0RequiresViolation, ldv_atomic_sub_returnErr3RequiresViolation, ldv_atomic_sub_returnErr2RequiresViolation, ldv_atomic_add_returnErr0RequiresViolation, ldv_atomic_add_returnErr1RequiresViolation, ldv_atomic_add_returnErr2RequiresViolation, ldv_atomic_add_returnErr3RequiresViolation, ldv_kobject_cleanupErr4RequiresViolation, ldv_kobject_cleanupErr2RequiresViolation, ldv_kobject_cleanupErr5RequiresViolation, ldv_kobject_cleanupErr3RequiresViolation, ldv_kobject_cleanupErr0RequiresViolation, ldv_kobject_cleanupErr1RequiresViolation, mainErr0EnsuresViolation, LDV_INIT_LIST_HEADErr1RequiresViolation, LDV_INIT_LIST_HEADErr3RequiresViolation, LDV_INIT_LIST_HEADErr2RequiresViolation, LDV_INIT_LIST_HEADErr0RequiresViolation]=== [2018-02-02 20:36:02,623 INFO L82 PathProgramCache]: Analyzing trace with hash 313313701, now seen corresponding path program 11 times [2018-02-02 20:36:02,623 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 20:36:02,630 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 20:36:02,631 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 20:36:02,832 INFO L134 CoverageAnalysis]: Checked inductivity of 66 backedges. 0 proven. 66 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 20:36:02,832 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-02 20:36:02,833 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [15] total 15 [2018-02-02 20:36:02,833 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 20:36:02,833 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 20:36:02,833 INFO L182 omatonBuilderFactory]: Interpolants [6350#true, 6351#false, 6352#(= |#Ultimate.C_memset_#t~loopctr21| 0), 6353#(<= |#Ultimate.C_memset_#t~loopctr21| 1), 6354#(<= |#Ultimate.C_memset_#t~loopctr21| 2), 6355#(<= |#Ultimate.C_memset_#t~loopctr21| 3), 6356#(<= |#Ultimate.C_memset_#t~loopctr21| 4), 6357#(<= |#Ultimate.C_memset_#t~loopctr21| 5), 6358#(<= |#Ultimate.C_memset_#t~loopctr21| 6), 6359#(<= |#Ultimate.C_memset_#t~loopctr21| 7), 6360#(<= |#Ultimate.C_memset_#t~loopctr21| 8), 6361#(<= |#Ultimate.C_memset_#t~loopctr21| 9), 6362#(<= |#Ultimate.C_memset_#t~loopctr21| 10), 6363#(<= |#Ultimate.C_memset_#t~loopctr21| 11), 6364#(<= |#Ultimate.C_memset_#amount| 11)] [2018-02-02 20:36:02,833 INFO L134 CoverageAnalysis]: Checked inductivity of 66 backedges. 0 proven. 66 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 20:36:02,833 INFO L409 AbstractCegarLoop]: Interpolant automaton has 15 states [2018-02-02 20:36:02,833 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2018-02-02 20:36:02,833 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=93, Invalid=117, Unknown=0, NotChecked=0, Total=210 [2018-02-02 20:36:02,833 INFO L87 Difference]: Start difference. First operand 151 states and 157 transitions. Second operand 15 states. [2018-02-02 20:36:02,868 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 20:36:02,868 INFO L93 Difference]: Finished difference Result 154 states and 160 transitions. [2018-02-02 20:36:02,869 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2018-02-02 20:36:02,869 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 45 [2018-02-02 20:36:02,869 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 20:36:02,869 INFO L225 Difference]: With dead ends: 154 [2018-02-02 20:36:02,869 INFO L226 Difference]: Without dead ends: 152 [2018-02-02 20:36:02,870 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=97, Invalid=143, Unknown=0, NotChecked=0, Total=240 [2018-02-02 20:36:02,870 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 152 states. [2018-02-02 20:36:02,871 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 152 to 152. [2018-02-02 20:36:02,872 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 152 states. [2018-02-02 20:36:02,872 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 152 states to 152 states and 158 transitions. [2018-02-02 20:36:02,872 INFO L78 Accepts]: Start accepts. Automaton has 152 states and 158 transitions. Word has length 45 [2018-02-02 20:36:02,872 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 20:36:02,872 INFO L432 AbstractCegarLoop]: Abstraction has 152 states and 158 transitions. [2018-02-02 20:36:02,872 INFO L433 AbstractCegarLoop]: Interpolant automaton has 15 states. [2018-02-02 20:36:02,872 INFO L276 IsEmpty]: Start isEmpty. Operand 152 states and 158 transitions. [2018-02-02 20:36:02,872 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2018-02-02 20:36:02,872 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 20:36:02,873 INFO L351 BasicCegarLoop]: trace histogram [12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-02-02 20:36:02,873 INFO L371 AbstractCegarLoop]: === Iteration 21 === [ldv_kref_initErr0RequiresViolation, ldv_kref_initErr1RequiresViolation, ldv_kobject_createErr0RequiresViolation, ldv_kobject_createErr1RequiresViolation, ldv_atomic_sub_returnErr1RequiresViolation, ldv_atomic_sub_returnErr0RequiresViolation, ldv_atomic_sub_returnErr3RequiresViolation, ldv_atomic_sub_returnErr2RequiresViolation, ldv_atomic_add_returnErr0RequiresViolation, ldv_atomic_add_returnErr1RequiresViolation, ldv_atomic_add_returnErr2RequiresViolation, ldv_atomic_add_returnErr3RequiresViolation, ldv_kobject_cleanupErr4RequiresViolation, ldv_kobject_cleanupErr2RequiresViolation, ldv_kobject_cleanupErr5RequiresViolation, ldv_kobject_cleanupErr3RequiresViolation, ldv_kobject_cleanupErr0RequiresViolation, ldv_kobject_cleanupErr1RequiresViolation, mainErr0EnsuresViolation, LDV_INIT_LIST_HEADErr1RequiresViolation, LDV_INIT_LIST_HEADErr3RequiresViolation, LDV_INIT_LIST_HEADErr2RequiresViolation, LDV_INIT_LIST_HEADErr0RequiresViolation]=== [2018-02-02 20:36:02,873 INFO L82 PathProgramCache]: Analyzing trace with hash -1160255741, now seen corresponding path program 12 times [2018-02-02 20:36:02,874 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 20:36:02,884 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 20:36:02,885 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 20:36:02,965 INFO L134 CoverageAnalysis]: Checked inductivity of 78 backedges. 0 proven. 78 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 20:36:02,966 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-02 20:36:02,966 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [16] total 16 [2018-02-02 20:36:02,966 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 20:36:02,966 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 20:36:02,966 INFO L182 omatonBuilderFactory]: Interpolants [6688#(<= |#Ultimate.C_memset_#amount| 12), 6673#true, 6674#false, 6675#(= |#Ultimate.C_memset_#t~loopctr21| 0), 6676#(<= |#Ultimate.C_memset_#t~loopctr21| 1), 6677#(<= |#Ultimate.C_memset_#t~loopctr21| 2), 6678#(<= |#Ultimate.C_memset_#t~loopctr21| 3), 6679#(<= |#Ultimate.C_memset_#t~loopctr21| 4), 6680#(<= |#Ultimate.C_memset_#t~loopctr21| 5), 6681#(<= |#Ultimate.C_memset_#t~loopctr21| 6), 6682#(<= |#Ultimate.C_memset_#t~loopctr21| 7), 6683#(<= |#Ultimate.C_memset_#t~loopctr21| 8), 6684#(<= |#Ultimate.C_memset_#t~loopctr21| 9), 6685#(<= |#Ultimate.C_memset_#t~loopctr21| 10), 6686#(<= |#Ultimate.C_memset_#t~loopctr21| 11), 6687#(<= |#Ultimate.C_memset_#t~loopctr21| 12)] [2018-02-02 20:36:02,966 INFO L134 CoverageAnalysis]: Checked inductivity of 78 backedges. 0 proven. 78 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 20:36:02,966 INFO L409 AbstractCegarLoop]: Interpolant automaton has 16 states [2018-02-02 20:36:02,967 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2018-02-02 20:36:02,967 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=107, Invalid=133, Unknown=0, NotChecked=0, Total=240 [2018-02-02 20:36:02,967 INFO L87 Difference]: Start difference. First operand 152 states and 158 transitions. Second operand 16 states. [2018-02-02 20:36:02,996 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 20:36:02,996 INFO L93 Difference]: Finished difference Result 155 states and 161 transitions. [2018-02-02 20:36:02,996 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2018-02-02 20:36:02,996 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 46 [2018-02-02 20:36:02,996 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 20:36:02,997 INFO L225 Difference]: With dead ends: 155 [2018-02-02 20:36:02,997 INFO L226 Difference]: Without dead ends: 153 [2018-02-02 20:36:02,997 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=111, Invalid=161, Unknown=0, NotChecked=0, Total=272 [2018-02-02 20:36:02,997 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 153 states. [2018-02-02 20:36:02,998 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 153 to 153. [2018-02-02 20:36:02,998 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 153 states. [2018-02-02 20:36:02,999 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 153 states to 153 states and 159 transitions. [2018-02-02 20:36:02,999 INFO L78 Accepts]: Start accepts. Automaton has 153 states and 159 transitions. Word has length 46 [2018-02-02 20:36:02,999 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 20:36:02,999 INFO L432 AbstractCegarLoop]: Abstraction has 153 states and 159 transitions. [2018-02-02 20:36:02,999 INFO L433 AbstractCegarLoop]: Interpolant automaton has 16 states. [2018-02-02 20:36:02,999 INFO L276 IsEmpty]: Start isEmpty. Operand 153 states and 159 transitions. [2018-02-02 20:36:02,999 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2018-02-02 20:36:03,000 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 20:36:03,000 INFO L351 BasicCegarLoop]: trace histogram [13, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-02-02 20:36:03,000 INFO L371 AbstractCegarLoop]: === Iteration 22 === [ldv_kref_initErr0RequiresViolation, ldv_kref_initErr1RequiresViolation, ldv_kobject_createErr0RequiresViolation, ldv_kobject_createErr1RequiresViolation, ldv_atomic_sub_returnErr1RequiresViolation, ldv_atomic_sub_returnErr0RequiresViolation, ldv_atomic_sub_returnErr3RequiresViolation, ldv_atomic_sub_returnErr2RequiresViolation, ldv_atomic_add_returnErr0RequiresViolation, ldv_atomic_add_returnErr1RequiresViolation, ldv_atomic_add_returnErr2RequiresViolation, ldv_atomic_add_returnErr3RequiresViolation, ldv_kobject_cleanupErr4RequiresViolation, ldv_kobject_cleanupErr2RequiresViolation, ldv_kobject_cleanupErr5RequiresViolation, ldv_kobject_cleanupErr3RequiresViolation, ldv_kobject_cleanupErr0RequiresViolation, ldv_kobject_cleanupErr1RequiresViolation, mainErr0EnsuresViolation, LDV_INIT_LIST_HEADErr1RequiresViolation, LDV_INIT_LIST_HEADErr3RequiresViolation, LDV_INIT_LIST_HEADErr2RequiresViolation, LDV_INIT_LIST_HEADErr0RequiresViolation]=== [2018-02-02 20:36:03,000 INFO L82 PathProgramCache]: Analyzing trace with hash 403731813, now seen corresponding path program 13 times [2018-02-02 20:36:03,001 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 20:36:03,008 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 20:36:03,009 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 20:36:03,109 INFO L134 CoverageAnalysis]: Checked inductivity of 91 backedges. 0 proven. 91 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 20:36:03,109 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-02 20:36:03,110 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [17] total 17 [2018-02-02 20:36:03,110 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 20:36:03,110 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 20:36:03,110 INFO L182 omatonBuilderFactory]: Interpolants [7008#(<= |#Ultimate.C_memset_#t~loopctr21| 7), 7009#(<= |#Ultimate.C_memset_#t~loopctr21| 8), 7010#(<= |#Ultimate.C_memset_#t~loopctr21| 9), 7011#(<= |#Ultimate.C_memset_#t~loopctr21| 10), 7012#(<= |#Ultimate.C_memset_#t~loopctr21| 11), 7013#(<= |#Ultimate.C_memset_#t~loopctr21| 12), 7014#(<= |#Ultimate.C_memset_#t~loopctr21| 13), 7015#(<= |#Ultimate.C_memset_#amount| 13), 6999#true, 7000#false, 7001#(= |#Ultimate.C_memset_#t~loopctr21| 0), 7002#(<= |#Ultimate.C_memset_#t~loopctr21| 1), 7003#(<= |#Ultimate.C_memset_#t~loopctr21| 2), 7004#(<= |#Ultimate.C_memset_#t~loopctr21| 3), 7005#(<= |#Ultimate.C_memset_#t~loopctr21| 4), 7006#(<= |#Ultimate.C_memset_#t~loopctr21| 5), 7007#(<= |#Ultimate.C_memset_#t~loopctr21| 6)] [2018-02-02 20:36:03,110 INFO L134 CoverageAnalysis]: Checked inductivity of 91 backedges. 0 proven. 91 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 20:36:03,111 INFO L409 AbstractCegarLoop]: Interpolant automaton has 17 states [2018-02-02 20:36:03,111 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2018-02-02 20:36:03,111 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=122, Invalid=150, Unknown=0, NotChecked=0, Total=272 [2018-02-02 20:36:03,113 INFO L87 Difference]: Start difference. First operand 153 states and 159 transitions. Second operand 17 states. [2018-02-02 20:36:03,183 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 20:36:03,183 INFO L93 Difference]: Finished difference Result 156 states and 162 transitions. [2018-02-02 20:36:03,185 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2018-02-02 20:36:03,185 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 47 [2018-02-02 20:36:03,186 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 20:36:03,186 INFO L225 Difference]: With dead ends: 156 [2018-02-02 20:36:03,186 INFO L226 Difference]: Without dead ends: 154 [2018-02-02 20:36:03,187 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 13 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=126, Invalid=180, Unknown=0, NotChecked=0, Total=306 [2018-02-02 20:36:03,187 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 154 states. [2018-02-02 20:36:03,189 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 154 to 154. [2018-02-02 20:36:03,189 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 154 states. [2018-02-02 20:36:03,190 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 154 states to 154 states and 160 transitions. [2018-02-02 20:36:03,190 INFO L78 Accepts]: Start accepts. Automaton has 154 states and 160 transitions. Word has length 47 [2018-02-02 20:36:03,190 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 20:36:03,190 INFO L432 AbstractCegarLoop]: Abstraction has 154 states and 160 transitions. [2018-02-02 20:36:03,190 INFO L433 AbstractCegarLoop]: Interpolant automaton has 17 states. [2018-02-02 20:36:03,190 INFO L276 IsEmpty]: Start isEmpty. Operand 154 states and 160 transitions. [2018-02-02 20:36:03,191 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2018-02-02 20:36:03,191 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 20:36:03,191 INFO L351 BasicCegarLoop]: trace histogram [14, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-02-02 20:36:03,191 INFO L371 AbstractCegarLoop]: === Iteration 23 === [ldv_kref_initErr0RequiresViolation, ldv_kref_initErr1RequiresViolation, ldv_kobject_createErr0RequiresViolation, ldv_kobject_createErr1RequiresViolation, ldv_atomic_sub_returnErr1RequiresViolation, ldv_atomic_sub_returnErr0RequiresViolation, ldv_atomic_sub_returnErr3RequiresViolation, ldv_atomic_sub_returnErr2RequiresViolation, ldv_atomic_add_returnErr0RequiresViolation, ldv_atomic_add_returnErr1RequiresViolation, ldv_atomic_add_returnErr2RequiresViolation, ldv_atomic_add_returnErr3RequiresViolation, ldv_kobject_cleanupErr4RequiresViolation, ldv_kobject_cleanupErr2RequiresViolation, ldv_kobject_cleanupErr5RequiresViolation, ldv_kobject_cleanupErr3RequiresViolation, ldv_kobject_cleanupErr0RequiresViolation, ldv_kobject_cleanupErr1RequiresViolation, mainErr0EnsuresViolation, LDV_INIT_LIST_HEADErr1RequiresViolation, LDV_INIT_LIST_HEADErr3RequiresViolation, LDV_INIT_LIST_HEADErr2RequiresViolation, LDV_INIT_LIST_HEADErr0RequiresViolation]=== [2018-02-02 20:36:03,191 INFO L82 PathProgramCache]: Analyzing trace with hash 1642705731, now seen corresponding path program 14 times [2018-02-02 20:36:03,192 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 20:36:03,204 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 20:36:03,205 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 20:36:03,440 INFO L134 CoverageAnalysis]: Checked inductivity of 105 backedges. 0 proven. 105 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 20:36:03,441 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-02 20:36:03,441 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [18] total 18 [2018-02-02 20:36:03,441 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 20:36:03,441 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 20:36:03,441 INFO L182 omatonBuilderFactory]: Interpolants [7328#true, 7329#false, 7330#(= |#Ultimate.C_memset_#t~loopctr21| 0), 7331#(<= |#Ultimate.C_memset_#t~loopctr21| 1), 7332#(<= |#Ultimate.C_memset_#t~loopctr21| 2), 7333#(<= |#Ultimate.C_memset_#t~loopctr21| 3), 7334#(<= |#Ultimate.C_memset_#t~loopctr21| 4), 7335#(<= |#Ultimate.C_memset_#t~loopctr21| 5), 7336#(<= |#Ultimate.C_memset_#t~loopctr21| 6), 7337#(<= |#Ultimate.C_memset_#t~loopctr21| 7), 7338#(<= |#Ultimate.C_memset_#t~loopctr21| 8), 7339#(<= |#Ultimate.C_memset_#t~loopctr21| 9), 7340#(<= |#Ultimate.C_memset_#t~loopctr21| 10), 7341#(<= |#Ultimate.C_memset_#t~loopctr21| 11), 7342#(<= |#Ultimate.C_memset_#t~loopctr21| 12), 7343#(<= |#Ultimate.C_memset_#t~loopctr21| 13), 7344#(<= |#Ultimate.C_memset_#t~loopctr21| 14), 7345#(<= |#Ultimate.C_memset_#amount| 14)] [2018-02-02 20:36:03,442 INFO L134 CoverageAnalysis]: Checked inductivity of 105 backedges. 0 proven. 105 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 20:36:03,442 INFO L409 AbstractCegarLoop]: Interpolant automaton has 18 states [2018-02-02 20:36:03,442 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2018-02-02 20:36:03,442 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=138, Invalid=168, Unknown=0, NotChecked=0, Total=306 [2018-02-02 20:36:03,442 INFO L87 Difference]: Start difference. First operand 154 states and 160 transitions. Second operand 18 states. [2018-02-02 20:36:03,482 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 20:36:03,482 INFO L93 Difference]: Finished difference Result 157 states and 163 transitions. [2018-02-02 20:36:03,483 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2018-02-02 20:36:03,483 INFO L78 Accepts]: Start accepts. Automaton has 18 states. Word has length 48 [2018-02-02 20:36:03,483 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 20:36:03,484 INFO L225 Difference]: With dead ends: 157 [2018-02-02 20:36:03,484 INFO L226 Difference]: Without dead ends: 155 [2018-02-02 20:36:03,484 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 14 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=142, Invalid=200, Unknown=0, NotChecked=0, Total=342 [2018-02-02 20:36:03,484 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 155 states. [2018-02-02 20:36:03,486 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 155 to 155. [2018-02-02 20:36:03,486 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 155 states. [2018-02-02 20:36:03,487 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 155 states to 155 states and 161 transitions. [2018-02-02 20:36:03,487 INFO L78 Accepts]: Start accepts. Automaton has 155 states and 161 transitions. Word has length 48 [2018-02-02 20:36:03,487 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 20:36:03,487 INFO L432 AbstractCegarLoop]: Abstraction has 155 states and 161 transitions. [2018-02-02 20:36:03,487 INFO L433 AbstractCegarLoop]: Interpolant automaton has 18 states. [2018-02-02 20:36:03,487 INFO L276 IsEmpty]: Start isEmpty. Operand 155 states and 161 transitions. [2018-02-02 20:36:03,488 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2018-02-02 20:36:03,488 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 20:36:03,488 INFO L351 BasicCegarLoop]: trace histogram [15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-02-02 20:36:03,488 INFO L371 AbstractCegarLoop]: === Iteration 24 === [ldv_kref_initErr0RequiresViolation, ldv_kref_initErr1RequiresViolation, ldv_kobject_createErr0RequiresViolation, ldv_kobject_createErr1RequiresViolation, ldv_atomic_sub_returnErr1RequiresViolation, ldv_atomic_sub_returnErr0RequiresViolation, ldv_atomic_sub_returnErr3RequiresViolation, ldv_atomic_sub_returnErr2RequiresViolation, ldv_atomic_add_returnErr0RequiresViolation, ldv_atomic_add_returnErr1RequiresViolation, ldv_atomic_add_returnErr2RequiresViolation, ldv_atomic_add_returnErr3RequiresViolation, ldv_kobject_cleanupErr4RequiresViolation, ldv_kobject_cleanupErr2RequiresViolation, ldv_kobject_cleanupErr5RequiresViolation, ldv_kobject_cleanupErr3RequiresViolation, ldv_kobject_cleanupErr0RequiresViolation, ldv_kobject_cleanupErr1RequiresViolation, mainErr0EnsuresViolation, LDV_INIT_LIST_HEADErr1RequiresViolation, LDV_INIT_LIST_HEADErr3RequiresViolation, LDV_INIT_LIST_HEADErr2RequiresViolation, LDV_INIT_LIST_HEADErr0RequiresViolation]=== [2018-02-02 20:36:03,488 INFO L82 PathProgramCache]: Analyzing trace with hash 1396191525, now seen corresponding path program 15 times [2018-02-02 20:36:03,489 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 20:36:03,501 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 20:36:03,501 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 20:36:03,634 INFO L134 CoverageAnalysis]: Checked inductivity of 120 backedges. 0 proven. 120 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 20:36:03,634 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-02 20:36:03,634 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [19] total 19 [2018-02-02 20:36:03,634 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 20:36:03,635 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 20:36:03,635 INFO L182 omatonBuilderFactory]: Interpolants [7660#true, 7661#false, 7662#(= |#Ultimate.C_memset_#t~loopctr21| 0), 7663#(<= |#Ultimate.C_memset_#t~loopctr21| 1), 7664#(<= |#Ultimate.C_memset_#t~loopctr21| 2), 7665#(<= |#Ultimate.C_memset_#t~loopctr21| 3), 7666#(<= |#Ultimate.C_memset_#t~loopctr21| 4), 7667#(<= |#Ultimate.C_memset_#t~loopctr21| 5), 7668#(<= |#Ultimate.C_memset_#t~loopctr21| 6), 7669#(<= |#Ultimate.C_memset_#t~loopctr21| 7), 7670#(<= |#Ultimate.C_memset_#t~loopctr21| 8), 7671#(<= |#Ultimate.C_memset_#t~loopctr21| 9), 7672#(<= |#Ultimate.C_memset_#t~loopctr21| 10), 7673#(<= |#Ultimate.C_memset_#t~loopctr21| 11), 7674#(<= |#Ultimate.C_memset_#t~loopctr21| 12), 7675#(<= |#Ultimate.C_memset_#t~loopctr21| 13), 7676#(<= |#Ultimate.C_memset_#t~loopctr21| 14), 7677#(<= |#Ultimate.C_memset_#t~loopctr21| 15), 7678#(<= |#Ultimate.C_memset_#amount| 15)] [2018-02-02 20:36:03,635 INFO L134 CoverageAnalysis]: Checked inductivity of 120 backedges. 0 proven. 120 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 20:36:03,635 INFO L409 AbstractCegarLoop]: Interpolant automaton has 19 states [2018-02-02 20:36:03,635 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2018-02-02 20:36:03,636 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=155, Invalid=187, Unknown=0, NotChecked=0, Total=342 [2018-02-02 20:36:03,636 INFO L87 Difference]: Start difference. First operand 155 states and 161 transitions. Second operand 19 states. [2018-02-02 20:36:03,697 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 20:36:03,697 INFO L93 Difference]: Finished difference Result 158 states and 164 transitions. [2018-02-02 20:36:03,697 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2018-02-02 20:36:03,697 INFO L78 Accepts]: Start accepts. Automaton has 19 states. Word has length 49 [2018-02-02 20:36:03,698 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 20:36:03,698 INFO L225 Difference]: With dead ends: 158 [2018-02-02 20:36:03,698 INFO L226 Difference]: Without dead ends: 156 [2018-02-02 20:36:03,699 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=159, Invalid=221, Unknown=0, NotChecked=0, Total=380 [2018-02-02 20:36:03,699 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 156 states. [2018-02-02 20:36:03,701 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 156 to 156. [2018-02-02 20:36:03,701 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 156 states. [2018-02-02 20:36:03,702 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 156 states to 156 states and 162 transitions. [2018-02-02 20:36:03,702 INFO L78 Accepts]: Start accepts. Automaton has 156 states and 162 transitions. Word has length 49 [2018-02-02 20:36:03,702 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 20:36:03,702 INFO L432 AbstractCegarLoop]: Abstraction has 156 states and 162 transitions. [2018-02-02 20:36:03,702 INFO L433 AbstractCegarLoop]: Interpolant automaton has 19 states. [2018-02-02 20:36:03,703 INFO L276 IsEmpty]: Start isEmpty. Operand 156 states and 162 transitions. [2018-02-02 20:36:03,703 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2018-02-02 20:36:03,703 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 20:36:03,703 INFO L351 BasicCegarLoop]: trace histogram [16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-02-02 20:36:03,703 INFO L371 AbstractCegarLoop]: === Iteration 25 === [ldv_kref_initErr0RequiresViolation, ldv_kref_initErr1RequiresViolation, ldv_kobject_createErr0RequiresViolation, ldv_kobject_createErr1RequiresViolation, ldv_atomic_sub_returnErr1RequiresViolation, ldv_atomic_sub_returnErr0RequiresViolation, ldv_atomic_sub_returnErr3RequiresViolation, ldv_atomic_sub_returnErr2RequiresViolation, ldv_atomic_add_returnErr0RequiresViolation, ldv_atomic_add_returnErr1RequiresViolation, ldv_atomic_add_returnErr2RequiresViolation, ldv_atomic_add_returnErr3RequiresViolation, ldv_kobject_cleanupErr4RequiresViolation, ldv_kobject_cleanupErr2RequiresViolation, ldv_kobject_cleanupErr5RequiresViolation, ldv_kobject_cleanupErr3RequiresViolation, ldv_kobject_cleanupErr0RequiresViolation, ldv_kobject_cleanupErr1RequiresViolation, mainErr0EnsuresViolation, LDV_INIT_LIST_HEADErr1RequiresViolation, LDV_INIT_LIST_HEADErr3RequiresViolation, LDV_INIT_LIST_HEADErr2RequiresViolation, LDV_INIT_LIST_HEADErr0RequiresViolation]=== [2018-02-02 20:36:03,703 INFO L82 PathProgramCache]: Analyzing trace with hash -1950781565, now seen corresponding path program 16 times [2018-02-02 20:36:03,704 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 20:36:03,719 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 20:36:03,720 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 20:36:03,920 INFO L134 CoverageAnalysis]: Checked inductivity of 136 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 136 trivial. 0 not checked. [2018-02-02 20:36:03,920 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-02 20:36:03,920 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2018-02-02 20:36:03,920 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 20:36:03,921 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 20:36:03,921 INFO L182 omatonBuilderFactory]: Interpolants [8000#(= 0 ldv_kobject_create_~kobj~1.offset), 8001#(or (<= (+ |#Ultimate.C_memset_#ptr.offset| |#Ultimate.C_memset_#amount|) (select |#length| |#Ultimate.C_memset_#ptr.base|)) (not (= |#Ultimate.C_memset_#ptr.offset| 0))), 8002#(and (= 0 ldv_kobject_create_~kobj~1.offset) (<= 16 (select |#length| ldv_kobject_create_~kobj~1.base))), 8003#(and (= 0 |ldv_kobject_init_#in~kobj.offset|) (<= 16 (select |#length| |ldv_kobject_init_#in~kobj.base|))), 8004#(and (= 0 ldv_kobject_init_~kobj.offset) (<= 16 (select |#length| ldv_kobject_init_~kobj.base))), 8005#(and (<= 16 (select |#length| |ldv_kobject_init_internal_#in~kobj.base|)) (= 0 |ldv_kobject_init_internal_#in~kobj.offset|)), 8006#(and (<= 16 (select |#length| ldv_kobject_init_internal_~kobj.base)) (= ldv_kobject_init_internal_~kobj.offset 0)), 8007#(and (<= (+ |ldv_kref_init_#in~kref.offset| 4) (select |#length| |ldv_kref_init_#in~kref.base|)) (<= 12 |ldv_kref_init_#in~kref.offset|)), 8008#(and (<= 12 ldv_kref_init_~kref.offset) (<= (+ ldv_kref_init_~kref.offset 4) (select |#length| ldv_kref_init_~kref.base))), 7995#true, 7996#false, 7997#(= 0 |ldv_malloc_#t~malloc4.offset|), 7998#(= 0 |ldv_malloc_#res.offset|), 7999#(= 0 |ldv_kobject_create_#t~ret17.offset|)] [2018-02-02 20:36:03,921 INFO L134 CoverageAnalysis]: Checked inductivity of 136 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 136 trivial. 0 not checked. [2018-02-02 20:36:03,921 INFO L409 AbstractCegarLoop]: Interpolant automaton has 14 states [2018-02-02 20:36:03,922 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2018-02-02 20:36:03,922 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=156, Unknown=0, NotChecked=0, Total=182 [2018-02-02 20:36:03,922 INFO L87 Difference]: Start difference. First operand 156 states and 162 transitions. Second operand 14 states. [2018-02-02 20:36:04,358 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 20:36:04,358 INFO L93 Difference]: Finished difference Result 155 states and 161 transitions. [2018-02-02 20:36:04,359 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2018-02-02 20:36:04,359 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 50 [2018-02-02 20:36:04,359 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 20:36:04,360 INFO L225 Difference]: With dead ends: 155 [2018-02-02 20:36:04,360 INFO L226 Difference]: Without dead ends: 155 [2018-02-02 20:36:04,360 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 16 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=42, Invalid=264, Unknown=0, NotChecked=0, Total=306 [2018-02-02 20:36:04,360 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 155 states. [2018-02-02 20:36:04,362 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 155 to 155. [2018-02-02 20:36:04,363 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 155 states. [2018-02-02 20:36:04,363 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 155 states to 155 states and 161 transitions. [2018-02-02 20:36:04,363 INFO L78 Accepts]: Start accepts. Automaton has 155 states and 161 transitions. Word has length 50 [2018-02-02 20:36:04,364 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 20:36:04,364 INFO L432 AbstractCegarLoop]: Abstraction has 155 states and 161 transitions. [2018-02-02 20:36:04,364 INFO L433 AbstractCegarLoop]: Interpolant automaton has 14 states. [2018-02-02 20:36:04,364 INFO L276 IsEmpty]: Start isEmpty. Operand 155 states and 161 transitions. [2018-02-02 20:36:04,364 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2018-02-02 20:36:04,364 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 20:36:04,365 INFO L351 BasicCegarLoop]: trace histogram [16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-02-02 20:36:04,365 INFO L371 AbstractCegarLoop]: === Iteration 26 === [ldv_kref_initErr0RequiresViolation, ldv_kref_initErr1RequiresViolation, ldv_kobject_createErr0RequiresViolation, ldv_kobject_createErr1RequiresViolation, ldv_atomic_sub_returnErr1RequiresViolation, ldv_atomic_sub_returnErr0RequiresViolation, ldv_atomic_sub_returnErr3RequiresViolation, ldv_atomic_sub_returnErr2RequiresViolation, ldv_atomic_add_returnErr0RequiresViolation, ldv_atomic_add_returnErr1RequiresViolation, ldv_atomic_add_returnErr2RequiresViolation, ldv_atomic_add_returnErr3RequiresViolation, ldv_kobject_cleanupErr4RequiresViolation, ldv_kobject_cleanupErr2RequiresViolation, ldv_kobject_cleanupErr5RequiresViolation, ldv_kobject_cleanupErr3RequiresViolation, ldv_kobject_cleanupErr0RequiresViolation, ldv_kobject_cleanupErr1RequiresViolation, mainErr0EnsuresViolation, LDV_INIT_LIST_HEADErr1RequiresViolation, LDV_INIT_LIST_HEADErr3RequiresViolation, LDV_INIT_LIST_HEADErr2RequiresViolation, LDV_INIT_LIST_HEADErr0RequiresViolation]=== [2018-02-02 20:36:04,365 INFO L82 PathProgramCache]: Analyzing trace with hash 707098664, now seen corresponding path program 1 times [2018-02-02 20:36:04,366 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 20:36:04,382 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 20:36:04,386 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 20:36:04,470 INFO L134 CoverageAnalysis]: Checked inductivity of 136 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 136 trivial. 0 not checked. [2018-02-02 20:36:04,471 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-02 20:36:04,471 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2018-02-02 20:36:04,471 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 20:36:04,471 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 20:36:04,472 INFO L182 omatonBuilderFactory]: Interpolants [8336#(= 1 (select |#valid| LDV_INIT_LIST_HEAD_~list.base)), 8327#true, 8328#false, 8329#(= 1 (select |#valid| |#Ultimate.C_memset_#ptr.base|)), 8330#(= 1 (select |#valid| ldv_kobject_create_~kobj~1.base)), 8331#(= 1 (select |#valid| |ldv_kobject_init_#in~kobj.base|)), 8332#(= 1 (select |#valid| ldv_kobject_init_~kobj.base)), 8333#(= 1 (select |#valid| |ldv_kobject_init_internal_#in~kobj.base|)), 8334#(= 1 (select |#valid| ldv_kobject_init_internal_~kobj.base)), 8335#(= 1 (select |#valid| |LDV_INIT_LIST_HEAD_#in~list.base|))] [2018-02-02 20:36:04,472 INFO L134 CoverageAnalysis]: Checked inductivity of 136 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 136 trivial. 0 not checked. [2018-02-02 20:36:04,472 INFO L409 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-02-02 20:36:04,472 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-02-02 20:36:04,472 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=73, Unknown=0, NotChecked=0, Total=90 [2018-02-02 20:36:04,473 INFO L87 Difference]: Start difference. First operand 155 states and 161 transitions. Second operand 10 states. [2018-02-02 20:36:04,627 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 20:36:04,627 INFO L93 Difference]: Finished difference Result 153 states and 159 transitions. [2018-02-02 20:36:04,628 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-02-02 20:36:04,628 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 55 [2018-02-02 20:36:04,628 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 20:36:04,628 INFO L225 Difference]: With dead ends: 153 [2018-02-02 20:36:04,629 INFO L226 Difference]: Without dead ends: 153 [2018-02-02 20:36:04,629 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=29, Invalid=127, Unknown=0, NotChecked=0, Total=156 [2018-02-02 20:36:04,629 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 153 states. [2018-02-02 20:36:04,631 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 153 to 153. [2018-02-02 20:36:04,631 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 153 states. [2018-02-02 20:36:04,632 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 153 states to 153 states and 159 transitions. [2018-02-02 20:36:04,632 INFO L78 Accepts]: Start accepts. Automaton has 153 states and 159 transitions. Word has length 55 [2018-02-02 20:36:04,632 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 20:36:04,632 INFO L432 AbstractCegarLoop]: Abstraction has 153 states and 159 transitions. [2018-02-02 20:36:04,632 INFO L433 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-02-02 20:36:04,632 INFO L276 IsEmpty]: Start isEmpty. Operand 153 states and 159 transitions. [2018-02-02 20:36:04,633 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2018-02-02 20:36:04,633 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 20:36:04,633 INFO L351 BasicCegarLoop]: trace histogram [16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-02-02 20:36:04,633 INFO L371 AbstractCegarLoop]: === Iteration 27 === [ldv_kref_initErr0RequiresViolation, ldv_kref_initErr1RequiresViolation, ldv_kobject_createErr0RequiresViolation, ldv_kobject_createErr1RequiresViolation, ldv_atomic_sub_returnErr1RequiresViolation, ldv_atomic_sub_returnErr0RequiresViolation, ldv_atomic_sub_returnErr3RequiresViolation, ldv_atomic_sub_returnErr2RequiresViolation, ldv_atomic_add_returnErr0RequiresViolation, ldv_atomic_add_returnErr1RequiresViolation, ldv_atomic_add_returnErr2RequiresViolation, ldv_atomic_add_returnErr3RequiresViolation, ldv_kobject_cleanupErr4RequiresViolation, ldv_kobject_cleanupErr2RequiresViolation, ldv_kobject_cleanupErr5RequiresViolation, ldv_kobject_cleanupErr3RequiresViolation, ldv_kobject_cleanupErr0RequiresViolation, ldv_kobject_cleanupErr1RequiresViolation, mainErr0EnsuresViolation, LDV_INIT_LIST_HEADErr1RequiresViolation, LDV_INIT_LIST_HEADErr3RequiresViolation, LDV_INIT_LIST_HEADErr2RequiresViolation, LDV_INIT_LIST_HEADErr0RequiresViolation]=== [2018-02-02 20:36:04,633 INFO L82 PathProgramCache]: Analyzing trace with hash 707098665, now seen corresponding path program 1 times [2018-02-02 20:36:04,634 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 20:36:04,648 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 20:36:04,649 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 20:36:04,795 INFO L134 CoverageAnalysis]: Checked inductivity of 136 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 136 trivial. 0 not checked. [2018-02-02 20:36:04,795 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-02 20:36:04,795 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2018-02-02 20:36:04,795 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 20:36:04,796 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 20:36:04,796 INFO L182 omatonBuilderFactory]: Interpolants [8649#true, 8650#false, 8651#(= 0 |ldv_malloc_#t~malloc4.offset|), 8652#(= 0 |ldv_malloc_#res.offset|), 8653#(= 0 |ldv_kobject_create_#t~ret17.offset|), 8654#(= 0 ldv_kobject_create_~kobj~1.offset), 8655#(or (<= (+ |#Ultimate.C_memset_#ptr.offset| |#Ultimate.C_memset_#amount|) (select |#length| |#Ultimate.C_memset_#ptr.base|)) (not (= |#Ultimate.C_memset_#ptr.offset| 0))), 8656#(and (= 0 ldv_kobject_create_~kobj~1.offset) (<= 16 (select |#length| ldv_kobject_create_~kobj~1.base))), 8657#(and (= 0 |ldv_kobject_init_#in~kobj.offset|) (<= 16 (select |#length| |ldv_kobject_init_#in~kobj.base|))), 8658#(and (= 0 ldv_kobject_init_~kobj.offset) (<= 16 (select |#length| ldv_kobject_init_~kobj.base))), 8659#(and (<= 16 (select |#length| |ldv_kobject_init_internal_#in~kobj.base|)) (= 0 |ldv_kobject_init_internal_#in~kobj.offset|)), 8660#(and (<= 16 (select |#length| ldv_kobject_init_internal_~kobj.base)) (= ldv_kobject_init_internal_~kobj.offset 0)), 8661#(and (<= 4 |LDV_INIT_LIST_HEAD_#in~list.offset|) (<= (+ |LDV_INIT_LIST_HEAD_#in~list.offset| 12) (select |#length| |LDV_INIT_LIST_HEAD_#in~list.base|))), 8662#(and (<= (+ LDV_INIT_LIST_HEAD_~list.offset 12) (select |#length| LDV_INIT_LIST_HEAD_~list.base)) (<= 4 LDV_INIT_LIST_HEAD_~list.offset))] [2018-02-02 20:36:04,796 INFO L134 CoverageAnalysis]: Checked inductivity of 136 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 136 trivial. 0 not checked. [2018-02-02 20:36:04,796 INFO L409 AbstractCegarLoop]: Interpolant automaton has 14 states [2018-02-02 20:36:04,797 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2018-02-02 20:36:04,797 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=156, Unknown=0, NotChecked=0, Total=182 [2018-02-02 20:36:04,797 INFO L87 Difference]: Start difference. First operand 153 states and 159 transitions. Second operand 14 states. [2018-02-02 20:36:05,053 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 20:36:05,053 INFO L93 Difference]: Finished difference Result 151 states and 157 transitions. [2018-02-02 20:36:05,053 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2018-02-02 20:36:05,053 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 55 [2018-02-02 20:36:05,053 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 20:36:05,054 INFO L225 Difference]: With dead ends: 151 [2018-02-02 20:36:05,054 INFO L226 Difference]: Without dead ends: 151 [2018-02-02 20:36:05,054 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 16 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=42, Invalid=264, Unknown=0, NotChecked=0, Total=306 [2018-02-02 20:36:05,054 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 151 states. [2018-02-02 20:36:05,055 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 151 to 151. [2018-02-02 20:36:05,056 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 151 states. [2018-02-02 20:36:05,056 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 151 states to 151 states and 157 transitions. [2018-02-02 20:36:05,056 INFO L78 Accepts]: Start accepts. Automaton has 151 states and 157 transitions. Word has length 55 [2018-02-02 20:36:05,057 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 20:36:05,057 INFO L432 AbstractCegarLoop]: Abstraction has 151 states and 157 transitions. [2018-02-02 20:36:05,057 INFO L433 AbstractCegarLoop]: Interpolant automaton has 14 states. [2018-02-02 20:36:05,057 INFO L276 IsEmpty]: Start isEmpty. Operand 151 states and 157 transitions. [2018-02-02 20:36:05,057 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2018-02-02 20:36:05,057 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 20:36:05,057 INFO L351 BasicCegarLoop]: trace histogram [16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-02-02 20:36:05,057 INFO L371 AbstractCegarLoop]: === Iteration 28 === [ldv_kref_initErr0RequiresViolation, ldv_kref_initErr1RequiresViolation, ldv_kobject_createErr0RequiresViolation, ldv_kobject_createErr1RequiresViolation, ldv_atomic_sub_returnErr1RequiresViolation, ldv_atomic_sub_returnErr0RequiresViolation, ldv_atomic_sub_returnErr3RequiresViolation, ldv_atomic_sub_returnErr2RequiresViolation, ldv_atomic_add_returnErr0RequiresViolation, ldv_atomic_add_returnErr1RequiresViolation, ldv_atomic_add_returnErr2RequiresViolation, ldv_atomic_add_returnErr3RequiresViolation, ldv_kobject_cleanupErr4RequiresViolation, ldv_kobject_cleanupErr2RequiresViolation, ldv_kobject_cleanupErr5RequiresViolation, ldv_kobject_cleanupErr3RequiresViolation, ldv_kobject_cleanupErr0RequiresViolation, ldv_kobject_cleanupErr1RequiresViolation, mainErr0EnsuresViolation, LDV_INIT_LIST_HEADErr1RequiresViolation, LDV_INIT_LIST_HEADErr3RequiresViolation, LDV_INIT_LIST_HEADErr2RequiresViolation, LDV_INIT_LIST_HEADErr0RequiresViolation]=== [2018-02-02 20:36:05,058 INFO L82 PathProgramCache]: Analyzing trace with hash -911390024, now seen corresponding path program 1 times [2018-02-02 20:36:05,059 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 20:36:05,069 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 20:36:05,070 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 20:36:05,125 INFO L134 CoverageAnalysis]: Checked inductivity of 136 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 136 trivial. 0 not checked. [2018-02-02 20:36:05,126 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-02 20:36:05,126 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2018-02-02 20:36:05,126 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 20:36:05,126 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 20:36:05,126 INFO L182 omatonBuilderFactory]: Interpolants [8976#(not (= |ldv_malloc_#res.base| 0)), 8977#(not (= |ldv_kobject_create_#t~ret17.base| 0)), 8978#(not (= ldv_kobject_create_~kobj~1.base 0)), 8979#(= ldv_kobject_init_~kobj.base |ldv_kobject_init_#in~kobj.base|), 8980#(= 0 |ldv_kobject_init_#in~kobj.base|), 8973#true, 8974#false, 8975#(not (= |ldv_malloc_#t~malloc4.base| 0))] [2018-02-02 20:36:05,127 INFO L134 CoverageAnalysis]: Checked inductivity of 136 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 136 trivial. 0 not checked. [2018-02-02 20:36:05,127 INFO L409 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-02-02 20:36:05,127 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-02-02 20:36:05,127 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2018-02-02 20:36:05,127 INFO L87 Difference]: Start difference. First operand 151 states and 157 transitions. Second operand 8 states. [2018-02-02 20:36:05,177 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 20:36:05,177 INFO L93 Difference]: Finished difference Result 153 states and 158 transitions. [2018-02-02 20:36:05,177 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-02-02 20:36:05,178 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 60 [2018-02-02 20:36:05,178 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 20:36:05,178 INFO L225 Difference]: With dead ends: 153 [2018-02-02 20:36:05,178 INFO L226 Difference]: Without dead ends: 151 [2018-02-02 20:36:05,178 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=69, Unknown=0, NotChecked=0, Total=90 [2018-02-02 20:36:05,178 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 151 states. [2018-02-02 20:36:05,179 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 151 to 151. [2018-02-02 20:36:05,180 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 151 states. [2018-02-02 20:36:05,180 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 151 states to 151 states and 156 transitions. [2018-02-02 20:36:05,180 INFO L78 Accepts]: Start accepts. Automaton has 151 states and 156 transitions. Word has length 60 [2018-02-02 20:36:05,180 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 20:36:05,180 INFO L432 AbstractCegarLoop]: Abstraction has 151 states and 156 transitions. [2018-02-02 20:36:05,180 INFO L433 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-02-02 20:36:05,180 INFO L276 IsEmpty]: Start isEmpty. Operand 151 states and 156 transitions. [2018-02-02 20:36:05,180 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2018-02-02 20:36:05,180 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 20:36:05,181 INFO L351 BasicCegarLoop]: trace histogram [16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-02-02 20:36:05,181 INFO L371 AbstractCegarLoop]: === Iteration 29 === [ldv_kref_initErr0RequiresViolation, ldv_kref_initErr1RequiresViolation, ldv_kobject_createErr0RequiresViolation, ldv_kobject_createErr1RequiresViolation, ldv_atomic_sub_returnErr1RequiresViolation, ldv_atomic_sub_returnErr0RequiresViolation, ldv_atomic_sub_returnErr3RequiresViolation, ldv_atomic_sub_returnErr2RequiresViolation, ldv_atomic_add_returnErr0RequiresViolation, ldv_atomic_add_returnErr1RequiresViolation, ldv_atomic_add_returnErr2RequiresViolation, ldv_atomic_add_returnErr3RequiresViolation, ldv_kobject_cleanupErr4RequiresViolation, ldv_kobject_cleanupErr2RequiresViolation, ldv_kobject_cleanupErr5RequiresViolation, ldv_kobject_cleanupErr3RequiresViolation, ldv_kobject_cleanupErr0RequiresViolation, ldv_kobject_cleanupErr1RequiresViolation, mainErr0EnsuresViolation, LDV_INIT_LIST_HEADErr1RequiresViolation, LDV_INIT_LIST_HEADErr3RequiresViolation, LDV_INIT_LIST_HEADErr2RequiresViolation, LDV_INIT_LIST_HEADErr0RequiresViolation]=== [2018-02-02 20:36:05,181 INFO L82 PathProgramCache]: Analyzing trace with hash -1034172991, now seen corresponding path program 1 times [2018-02-02 20:36:05,181 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 20:36:05,189 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 20:36:05,190 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 20:36:05,238 INFO L134 CoverageAnalysis]: Checked inductivity of 136 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 136 trivial. 0 not checked. [2018-02-02 20:36:05,238 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-02 20:36:05,238 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2018-02-02 20:36:05,239 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 20:36:05,239 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 20:36:05,239 INFO L182 omatonBuilderFactory]: Interpolants [9296#(= ldv_kobject_init_internal_~kobj.base |ldv_kobject_init_internal_#in~kobj.base|), 9297#(= 0 |ldv_kobject_init_internal_#in~kobj.base|), 9298#(= 0 |ldv_kobject_init_#in~kobj.base|), 9289#true, 9290#false, 9291#(not (= |ldv_malloc_#t~malloc4.base| 0)), 9292#(not (= |ldv_malloc_#res.base| 0)), 9293#(not (= |ldv_kobject_create_#t~ret17.base| 0)), 9294#(not (= ldv_kobject_create_~kobj~1.base 0)), 9295#(= ldv_kobject_init_~kobj.base |ldv_kobject_init_#in~kobj.base|)] [2018-02-02 20:36:05,239 INFO L134 CoverageAnalysis]: Checked inductivity of 136 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 136 trivial. 0 not checked. [2018-02-02 20:36:05,239 INFO L409 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-02-02 20:36:05,239 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-02-02 20:36:05,239 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=73, Unknown=0, NotChecked=0, Total=90 [2018-02-02 20:36:05,240 INFO L87 Difference]: Start difference. First operand 151 states and 156 transitions. Second operand 10 states. [2018-02-02 20:36:05,294 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 20:36:05,294 INFO L93 Difference]: Finished difference Result 155 states and 159 transitions. [2018-02-02 20:36:05,295 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-02-02 20:36:05,295 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 65 [2018-02-02 20:36:05,295 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 20:36:05,296 INFO L225 Difference]: With dead ends: 155 [2018-02-02 20:36:05,296 INFO L226 Difference]: Without dead ends: 151 [2018-02-02 20:36:05,296 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=29, Invalid=127, Unknown=0, NotChecked=0, Total=156 [2018-02-02 20:36:05,296 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 151 states. [2018-02-02 20:36:05,298 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 151 to 151. [2018-02-02 20:36:05,298 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 151 states. [2018-02-02 20:36:05,299 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 151 states to 151 states and 155 transitions. [2018-02-02 20:36:05,299 INFO L78 Accepts]: Start accepts. Automaton has 151 states and 155 transitions. Word has length 65 [2018-02-02 20:36:05,299 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 20:36:05,299 INFO L432 AbstractCegarLoop]: Abstraction has 151 states and 155 transitions. [2018-02-02 20:36:05,299 INFO L433 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-02-02 20:36:05,299 INFO L276 IsEmpty]: Start isEmpty. Operand 151 states and 155 transitions. [2018-02-02 20:36:05,300 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 77 [2018-02-02 20:36:05,300 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 20:36:05,300 INFO L351 BasicCegarLoop]: trace histogram [16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-02-02 20:36:05,300 INFO L371 AbstractCegarLoop]: === Iteration 30 === [ldv_kref_initErr0RequiresViolation, ldv_kref_initErr1RequiresViolation, ldv_kobject_createErr0RequiresViolation, ldv_kobject_createErr1RequiresViolation, ldv_atomic_sub_returnErr1RequiresViolation, ldv_atomic_sub_returnErr0RequiresViolation, ldv_atomic_sub_returnErr3RequiresViolation, ldv_atomic_sub_returnErr2RequiresViolation, ldv_atomic_add_returnErr0RequiresViolation, ldv_atomic_add_returnErr1RequiresViolation, ldv_atomic_add_returnErr2RequiresViolation, ldv_atomic_add_returnErr3RequiresViolation, ldv_kobject_cleanupErr4RequiresViolation, ldv_kobject_cleanupErr2RequiresViolation, ldv_kobject_cleanupErr5RequiresViolation, ldv_kobject_cleanupErr3RequiresViolation, ldv_kobject_cleanupErr0RequiresViolation, ldv_kobject_cleanupErr1RequiresViolation, mainErr0EnsuresViolation, LDV_INIT_LIST_HEADErr1RequiresViolation, LDV_INIT_LIST_HEADErr3RequiresViolation, LDV_INIT_LIST_HEADErr2RequiresViolation, LDV_INIT_LIST_HEADErr0RequiresViolation]=== [2018-02-02 20:36:05,300 INFO L82 PathProgramCache]: Analyzing trace with hash -1536531717, now seen corresponding path program 1 times [2018-02-02 20:36:05,301 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 20:36:05,314 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 20:36:05,315 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 20:36:05,436 INFO L134 CoverageAnalysis]: Checked inductivity of 136 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 136 trivial. 0 not checked. [2018-02-02 20:36:05,437 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-02 20:36:05,437 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2018-02-02 20:36:05,437 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 20:36:05,437 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 20:36:05,437 INFO L182 omatonBuilderFactory]: Interpolants [9611#true, 9612#false, 9613#(= 1 (select |#valid| |#Ultimate.C_memset_#ptr.base|)), 9614#(= 1 (select |#valid| ldv_kobject_create_~kobj~1.base)), 9615#(= 1 (select |#valid| |ldv_kobject_create_#res.base|)), 9616#(= 1 (select |#valid| |entry_point_#t~ret20.base|)), 9617#(= 1 (select |#valid| entry_point_~kobj~2.base)), 9618#(= 1 (select |#valid| |f_22_get_#in~kobj.base|)), 9619#(= 1 (select |#valid| f_22_get_~kobj.base)), 9620#(= 1 (select |#valid| |ldv_kobject_get_#in~kobj.base|)), 9621#(= 1 (select |#valid| ldv_kobject_get_~kobj.base)), 9622#(= 1 (select |#valid| |ldv_kref_get_#in~kref.base|)), 9623#(= 1 (select |#valid| ldv_kref_get_~kref.base)), 9624#(= 1 (select |#valid| |ldv_atomic_add_return_#in~v.base|)), 9625#(= 1 (select |#valid| ldv_atomic_add_return_~v.base))] [2018-02-02 20:36:05,437 INFO L134 CoverageAnalysis]: Checked inductivity of 136 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 136 trivial. 0 not checked. [2018-02-02 20:36:05,438 INFO L409 AbstractCegarLoop]: Interpolant automaton has 15 states [2018-02-02 20:36:05,438 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2018-02-02 20:36:05,438 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=183, Unknown=0, NotChecked=0, Total=210 [2018-02-02 20:36:05,438 INFO L87 Difference]: Start difference. First operand 151 states and 155 transitions. Second operand 15 states. [2018-02-02 20:36:05,684 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 20:36:05,684 INFO L93 Difference]: Finished difference Result 149 states and 153 transitions. [2018-02-02 20:36:05,684 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2018-02-02 20:36:05,684 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 76 [2018-02-02 20:36:05,685 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 20:36:05,685 INFO L225 Difference]: With dead ends: 149 [2018-02-02 20:36:05,685 INFO L226 Difference]: Without dead ends: 149 [2018-02-02 20:36:05,686 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=47, Invalid=333, Unknown=0, NotChecked=0, Total=380 [2018-02-02 20:36:05,686 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 149 states. [2018-02-02 20:36:05,688 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 149 to 149. [2018-02-02 20:36:05,688 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 149 states. [2018-02-02 20:36:05,689 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 149 states to 149 states and 153 transitions. [2018-02-02 20:36:05,689 INFO L78 Accepts]: Start accepts. Automaton has 149 states and 153 transitions. Word has length 76 [2018-02-02 20:36:05,689 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 20:36:05,689 INFO L432 AbstractCegarLoop]: Abstraction has 149 states and 153 transitions. [2018-02-02 20:36:05,689 INFO L433 AbstractCegarLoop]: Interpolant automaton has 15 states. [2018-02-02 20:36:05,689 INFO L276 IsEmpty]: Start isEmpty. Operand 149 states and 153 transitions. [2018-02-02 20:36:05,690 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 77 [2018-02-02 20:36:05,690 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 20:36:05,690 INFO L351 BasicCegarLoop]: trace histogram [16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-02-02 20:36:05,690 INFO L371 AbstractCegarLoop]: === Iteration 31 === [ldv_kref_initErr0RequiresViolation, ldv_kref_initErr1RequiresViolation, ldv_kobject_createErr0RequiresViolation, ldv_kobject_createErr1RequiresViolation, ldv_atomic_sub_returnErr1RequiresViolation, ldv_atomic_sub_returnErr0RequiresViolation, ldv_atomic_sub_returnErr3RequiresViolation, ldv_atomic_sub_returnErr2RequiresViolation, ldv_atomic_add_returnErr0RequiresViolation, ldv_atomic_add_returnErr1RequiresViolation, ldv_atomic_add_returnErr2RequiresViolation, ldv_atomic_add_returnErr3RequiresViolation, ldv_kobject_cleanupErr4RequiresViolation, ldv_kobject_cleanupErr2RequiresViolation, ldv_kobject_cleanupErr5RequiresViolation, ldv_kobject_cleanupErr3RequiresViolation, ldv_kobject_cleanupErr0RequiresViolation, ldv_kobject_cleanupErr1RequiresViolation, mainErr0EnsuresViolation, LDV_INIT_LIST_HEADErr1RequiresViolation, LDV_INIT_LIST_HEADErr3RequiresViolation, LDV_INIT_LIST_HEADErr2RequiresViolation, LDV_INIT_LIST_HEADErr0RequiresViolation]=== [2018-02-02 20:36:05,690 INFO L82 PathProgramCache]: Analyzing trace with hash -1536531716, now seen corresponding path program 1 times [2018-02-02 20:36:05,691 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 20:36:05,705 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 20:36:05,705 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 20:36:05,982 INFO L134 CoverageAnalysis]: Checked inductivity of 136 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 136 trivial. 0 not checked. [2018-02-02 20:36:05,982 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-02 20:36:05,982 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [18] imperfect sequences [] total 18 [2018-02-02 20:36:05,982 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 20:36:05,983 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 20:36:05,983 INFO L182 omatonBuilderFactory]: Interpolants [9952#(and (<= 12 ldv_atomic_add_return_~v.offset) (<= (+ ldv_atomic_add_return_~v.offset 4) (select |#length| ldv_atomic_add_return_~v.base))), 9934#true, 9935#false, 9936#(= 0 |ldv_malloc_#t~malloc4.offset|), 9937#(= 0 |ldv_malloc_#res.offset|), 9938#(= 0 |ldv_kobject_create_#t~ret17.offset|), 9939#(= 0 ldv_kobject_create_~kobj~1.offset), 9940#(or (<= (+ |#Ultimate.C_memset_#ptr.offset| |#Ultimate.C_memset_#amount|) (select |#length| |#Ultimate.C_memset_#ptr.base|)) (not (= |#Ultimate.C_memset_#ptr.offset| 0))), 9941#(and (= 0 ldv_kobject_create_~kobj~1.offset) (<= 16 (select |#length| ldv_kobject_create_~kobj~1.base))), 9942#(and (= 0 |ldv_kobject_create_#res.offset|) (<= 16 (select |#length| |ldv_kobject_create_#res.base|))), 9943#(and (<= 16 (select |#length| |entry_point_#t~ret20.base|)) (= 0 |entry_point_#t~ret20.offset|)), 9944#(and (= 0 entry_point_~kobj~2.offset) (<= 16 (select |#length| entry_point_~kobj~2.base))), 9945#(and (= 0 |f_22_get_#in~kobj.offset|) (<= 16 (select |#length| |f_22_get_#in~kobj.base|))), 9946#(and (= 0 f_22_get_~kobj.offset) (<= 16 (select |#length| f_22_get_~kobj.base))), 9947#(and (<= 16 (select |#length| |ldv_kobject_get_#in~kobj.base|)) (= 0 |ldv_kobject_get_#in~kobj.offset|)), 9948#(and (<= 16 (select |#length| ldv_kobject_get_~kobj.base)) (= ldv_kobject_get_~kobj.offset 0)), 9949#(and (<= 12 |ldv_kref_get_#in~kref.offset|) (<= (+ |ldv_kref_get_#in~kref.offset| 4) (select |#length| |ldv_kref_get_#in~kref.base|))), 9950#(and (<= 12 ldv_kref_get_~kref.offset) (<= (+ ldv_kref_get_~kref.offset 4) (select |#length| ldv_kref_get_~kref.base))), 9951#(and (<= 12 |ldv_atomic_add_return_#in~v.offset|) (<= (+ |ldv_atomic_add_return_#in~v.offset| 4) (select |#length| |ldv_atomic_add_return_#in~v.base|)))] [2018-02-02 20:36:05,983 INFO L134 CoverageAnalysis]: Checked inductivity of 136 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 136 trivial. 0 not checked. [2018-02-02 20:36:05,983 INFO L409 AbstractCegarLoop]: Interpolant automaton has 19 states [2018-02-02 20:36:05,983 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2018-02-02 20:36:05,983 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=306, Unknown=0, NotChecked=0, Total=342 [2018-02-02 20:36:05,983 INFO L87 Difference]: Start difference. First operand 149 states and 153 transitions. Second operand 19 states. [2018-02-02 20:36:06,278 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 20:36:06,278 INFO L93 Difference]: Finished difference Result 147 states and 151 transitions. [2018-02-02 20:36:06,278 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2018-02-02 20:36:06,279 INFO L78 Accepts]: Start accepts. Automaton has 19 states. Word has length 76 [2018-02-02 20:36:06,279 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 20:36:06,279 INFO L225 Difference]: With dead ends: 147 [2018-02-02 20:36:06,279 INFO L226 Difference]: Without dead ends: 147 [2018-02-02 20:36:06,280 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 31 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=61, Invalid=539, Unknown=0, NotChecked=0, Total=600 [2018-02-02 20:36:06,280 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 147 states. [2018-02-02 20:36:06,281 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 147 to 147. [2018-02-02 20:36:06,281 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 147 states. [2018-02-02 20:36:06,281 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 147 states to 147 states and 151 transitions. [2018-02-02 20:36:06,281 INFO L78 Accepts]: Start accepts. Automaton has 147 states and 151 transitions. Word has length 76 [2018-02-02 20:36:06,282 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 20:36:06,282 INFO L432 AbstractCegarLoop]: Abstraction has 147 states and 151 transitions. [2018-02-02 20:36:06,282 INFO L433 AbstractCegarLoop]: Interpolant automaton has 19 states. [2018-02-02 20:36:06,282 INFO L276 IsEmpty]: Start isEmpty. Operand 147 states and 151 transitions. [2018-02-02 20:36:06,282 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 88 [2018-02-02 20:36:06,282 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 20:36:06,282 INFO L351 BasicCegarLoop]: trace histogram [16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-02-02 20:36:06,282 INFO L371 AbstractCegarLoop]: === Iteration 32 === [ldv_kref_initErr0RequiresViolation, ldv_kref_initErr1RequiresViolation, ldv_kobject_createErr0RequiresViolation, ldv_kobject_createErr1RequiresViolation, ldv_atomic_sub_returnErr1RequiresViolation, ldv_atomic_sub_returnErr0RequiresViolation, ldv_atomic_sub_returnErr3RequiresViolation, ldv_atomic_sub_returnErr2RequiresViolation, ldv_atomic_add_returnErr0RequiresViolation, ldv_atomic_add_returnErr1RequiresViolation, ldv_atomic_add_returnErr2RequiresViolation, ldv_atomic_add_returnErr3RequiresViolation, ldv_kobject_cleanupErr4RequiresViolation, ldv_kobject_cleanupErr2RequiresViolation, ldv_kobject_cleanupErr5RequiresViolation, ldv_kobject_cleanupErr3RequiresViolation, ldv_kobject_cleanupErr0RequiresViolation, ldv_kobject_cleanupErr1RequiresViolation, mainErr0EnsuresViolation, LDV_INIT_LIST_HEADErr1RequiresViolation, LDV_INIT_LIST_HEADErr3RequiresViolation, LDV_INIT_LIST_HEADErr2RequiresViolation, LDV_INIT_LIST_HEADErr0RequiresViolation]=== [2018-02-02 20:36:06,282 INFO L82 PathProgramCache]: Analyzing trace with hash 1139097925, now seen corresponding path program 1 times [2018-02-02 20:36:06,283 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 20:36:06,292 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 20:36:06,292 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 20:36:06,367 INFO L134 CoverageAnalysis]: Checked inductivity of 136 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 136 trivial. 0 not checked. [2018-02-02 20:36:06,368 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-02 20:36:06,368 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2018-02-02 20:36:06,368 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 20:36:06,368 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 20:36:06,369 INFO L182 omatonBuilderFactory]: Interpolants [10259#true, 10260#false, 10261#(not (= |ldv_malloc_#t~malloc4.base| 0)), 10262#(not (= |ldv_malloc_#res.base| 0)), 10263#(not (= |ldv_kobject_create_#t~ret17.base| 0)), 10264#(not (= ldv_kobject_create_~kobj~1.base 0)), 10265#(not (= |ldv_kobject_create_#res.base| 0)), 10266#(not (= |entry_point_#t~ret20.base| 0)), 10267#(not (= entry_point_~kobj~2.base 0)), 10268#(= f_22_get_~kobj.base |f_22_get_#in~kobj.base|), 10269#(= ldv_kobject_get_~kobj.base |ldv_kobject_get_#in~kobj.base|), 10270#(= 0 |ldv_kobject_get_#in~kobj.base|), 10271#(= 0 |f_22_get_#in~kobj.base|)] [2018-02-02 20:36:06,369 INFO L134 CoverageAnalysis]: Checked inductivity of 136 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 136 trivial. 0 not checked. [2018-02-02 20:36:06,369 INFO L409 AbstractCegarLoop]: Interpolant automaton has 13 states [2018-02-02 20:36:06,369 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2018-02-02 20:36:06,369 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=133, Unknown=0, NotChecked=0, Total=156 [2018-02-02 20:36:06,369 INFO L87 Difference]: Start difference. First operand 147 states and 151 transitions. Second operand 13 states. [2018-02-02 20:36:06,423 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 20:36:06,423 INFO L93 Difference]: Finished difference Result 153 states and 156 transitions. [2018-02-02 20:36:06,424 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2018-02-02 20:36:06,424 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 87 [2018-02-02 20:36:06,424 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 20:36:06,424 INFO L225 Difference]: With dead ends: 153 [2018-02-02 20:36:06,424 INFO L226 Difference]: Without dead ends: 147 [2018-02-02 20:36:06,425 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=39, Invalid=233, Unknown=0, NotChecked=0, Total=272 [2018-02-02 20:36:06,425 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 147 states. [2018-02-02 20:36:06,427 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 147 to 147. [2018-02-02 20:36:06,427 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 147 states. [2018-02-02 20:36:06,427 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 147 states to 147 states and 150 transitions. [2018-02-02 20:36:06,427 INFO L78 Accepts]: Start accepts. Automaton has 147 states and 150 transitions. Word has length 87 [2018-02-02 20:36:06,428 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 20:36:06,428 INFO L432 AbstractCegarLoop]: Abstraction has 147 states and 150 transitions. [2018-02-02 20:36:06,428 INFO L433 AbstractCegarLoop]: Interpolant automaton has 13 states. [2018-02-02 20:36:06,428 INFO L276 IsEmpty]: Start isEmpty. Operand 147 states and 150 transitions. [2018-02-02 20:36:06,428 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 101 [2018-02-02 20:36:06,428 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 20:36:06,429 INFO L351 BasicCegarLoop]: trace histogram [16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-02-02 20:36:06,429 INFO L371 AbstractCegarLoop]: === Iteration 33 === [ldv_kref_initErr0RequiresViolation, ldv_kref_initErr1RequiresViolation, ldv_kobject_createErr0RequiresViolation, ldv_kobject_createErr1RequiresViolation, ldv_atomic_sub_returnErr1RequiresViolation, ldv_atomic_sub_returnErr0RequiresViolation, ldv_atomic_sub_returnErr3RequiresViolation, ldv_atomic_sub_returnErr2RequiresViolation, ldv_atomic_add_returnErr0RequiresViolation, ldv_atomic_add_returnErr1RequiresViolation, ldv_atomic_add_returnErr2RequiresViolation, ldv_atomic_add_returnErr3RequiresViolation, ldv_kobject_cleanupErr4RequiresViolation, ldv_kobject_cleanupErr2RequiresViolation, ldv_kobject_cleanupErr5RequiresViolation, ldv_kobject_cleanupErr3RequiresViolation, ldv_kobject_cleanupErr0RequiresViolation, ldv_kobject_cleanupErr1RequiresViolation, mainErr0EnsuresViolation, LDV_INIT_LIST_HEADErr1RequiresViolation, LDV_INIT_LIST_HEADErr3RequiresViolation, LDV_INIT_LIST_HEADErr2RequiresViolation, LDV_INIT_LIST_HEADErr0RequiresViolation]=== [2018-02-02 20:36:06,429 INFO L82 PathProgramCache]: Analyzing trace with hash -1269942985, now seen corresponding path program 1 times [2018-02-02 20:36:06,429 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 20:36:06,445 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 20:36:06,446 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 20:36:06,672 INFO L134 CoverageAnalysis]: Checked inductivity of 136 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 136 trivial. 0 not checked. [2018-02-02 20:36:06,672 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-02 20:36:06,673 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [19] imperfect sequences [] total 19 [2018-02-02 20:36:06,673 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 20:36:06,673 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 20:36:06,673 INFO L182 omatonBuilderFactory]: Interpolants [10592#(= 1 (select |#valid| |ldv_kobject_put_#in~kobj.base|)), 10593#(= 1 (select |#valid| ldv_kobject_put_~kobj.base)), 10594#(= 1 (select |#valid| |ldv_kref_put_#in~kref.base|)), 10595#(= 1 (select |#valid| ldv_kref_put_~kref.base)), 10596#(= 1 (select |#valid| |ldv_kref_sub_#in~kref.base|)), 10597#(= 1 (select |#valid| ldv_kref_sub_~kref.base)), 10598#(= 1 (select |#valid| |ldv_atomic_sub_return_#in~v.base|)), 10599#(= 1 (select |#valid| ldv_atomic_sub_return_~v.base)), 10580#true, 10581#false, 10582#(= f_22_get_~kobj.base |f_22_get_#in~kobj.base|), 10583#(= ldv_kobject_get_~kobj.base |ldv_kobject_get_#in~kobj.base|), 10584#(= ldv_kref_get_~kref.base |ldv_kref_get_#in~kref.base|), 10585#(= ldv_atomic_add_return_~v.base |ldv_atomic_add_return_#in~v.base|), 10586#(and (= 1 (select |#valid| ldv_atomic_add_return_~v.base)) (= ldv_atomic_add_return_~v.base |ldv_atomic_add_return_#in~v.base|)), 10587#(= 1 (select |#valid| |ldv_atomic_add_return_#in~v.base|)), 10588#(= 1 (select |#valid| |ldv_kref_get_#in~kref.base|)), 10589#(= 1 (select |#valid| |ldv_kobject_get_#in~kobj.base|)), 10590#(= 1 (select |#valid| |f_22_get_#in~kobj.base|)), 10591#(= 1 (select |#valid| entry_point_~kobj~2.base))] [2018-02-02 20:36:06,674 INFO L134 CoverageAnalysis]: Checked inductivity of 136 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 136 trivial. 0 not checked. [2018-02-02 20:36:06,674 INFO L409 AbstractCegarLoop]: Interpolant automaton has 20 states [2018-02-02 20:36:06,674 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2018-02-02 20:36:06,674 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=39, Invalid=341, Unknown=0, NotChecked=0, Total=380 [2018-02-02 20:36:06,674 INFO L87 Difference]: Start difference. First operand 147 states and 150 transitions. Second operand 20 states. [2018-02-02 20:36:06,985 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 20:36:06,985 INFO L93 Difference]: Finished difference Result 154 states and 157 transitions. [2018-02-02 20:36:06,985 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2018-02-02 20:36:06,985 INFO L78 Accepts]: Start accepts. Automaton has 20 states. Word has length 100 [2018-02-02 20:36:06,986 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 20:36:06,986 INFO L225 Difference]: With dead ends: 154 [2018-02-02 20:36:06,986 INFO L226 Difference]: Without dead ends: 154 [2018-02-02 20:36:06,987 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 53 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=67, Invalid=635, Unknown=0, NotChecked=0, Total=702 [2018-02-02 20:36:06,987 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 154 states. [2018-02-02 20:36:06,988 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 154 to 145. [2018-02-02 20:36:06,989 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 145 states. [2018-02-02 20:36:06,989 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 145 states to 145 states and 148 transitions. [2018-02-02 20:36:06,989 INFO L78 Accepts]: Start accepts. Automaton has 145 states and 148 transitions. Word has length 100 [2018-02-02 20:36:06,989 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 20:36:06,989 INFO L432 AbstractCegarLoop]: Abstraction has 145 states and 148 transitions. [2018-02-02 20:36:06,990 INFO L433 AbstractCegarLoop]: Interpolant automaton has 20 states. [2018-02-02 20:36:06,990 INFO L276 IsEmpty]: Start isEmpty. Operand 145 states and 148 transitions. [2018-02-02 20:36:06,990 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 101 [2018-02-02 20:36:06,990 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 20:36:06,990 INFO L351 BasicCegarLoop]: trace histogram [16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-02-02 20:36:06,990 INFO L371 AbstractCegarLoop]: === Iteration 34 === [ldv_kref_initErr0RequiresViolation, ldv_kref_initErr1RequiresViolation, ldv_kobject_createErr0RequiresViolation, ldv_kobject_createErr1RequiresViolation, ldv_atomic_sub_returnErr1RequiresViolation, ldv_atomic_sub_returnErr0RequiresViolation, ldv_atomic_sub_returnErr3RequiresViolation, ldv_atomic_sub_returnErr2RequiresViolation, ldv_atomic_add_returnErr0RequiresViolation, ldv_atomic_add_returnErr1RequiresViolation, ldv_atomic_add_returnErr2RequiresViolation, ldv_atomic_add_returnErr3RequiresViolation, ldv_kobject_cleanupErr4RequiresViolation, ldv_kobject_cleanupErr2RequiresViolation, ldv_kobject_cleanupErr5RequiresViolation, ldv_kobject_cleanupErr3RequiresViolation, ldv_kobject_cleanupErr0RequiresViolation, ldv_kobject_cleanupErr1RequiresViolation, mainErr0EnsuresViolation, LDV_INIT_LIST_HEADErr1RequiresViolation, LDV_INIT_LIST_HEADErr3RequiresViolation, LDV_INIT_LIST_HEADErr2RequiresViolation, LDV_INIT_LIST_HEADErr0RequiresViolation]=== [2018-02-02 20:36:06,991 INFO L82 PathProgramCache]: Analyzing trace with hash -1269942984, now seen corresponding path program 1 times [2018-02-02 20:36:06,991 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 20:36:07,006 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 20:36:07,007 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 20:36:07,284 INFO L134 CoverageAnalysis]: Checked inductivity of 136 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 136 trivial. 0 not checked. [2018-02-02 20:36:07,284 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-02 20:36:07,284 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [18] imperfect sequences [] total 18 [2018-02-02 20:36:07,285 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 20:36:07,285 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 20:36:07,285 INFO L182 omatonBuilderFactory]: Interpolants [10913#true, 10914#false, 10915#(= 0 |ldv_malloc_#t~malloc4.offset|), 10916#(= 0 |ldv_malloc_#res.offset|), 10917#(= 0 |ldv_kobject_create_#t~ret17.offset|), 10918#(= 0 ldv_kobject_create_~kobj~1.offset), 10919#(or (<= (+ |#Ultimate.C_memset_#ptr.offset| |#Ultimate.C_memset_#amount|) (select |#length| |#Ultimate.C_memset_#ptr.base|)) (not (= |#Ultimate.C_memset_#ptr.offset| 0))), 10920#(and (= 0 ldv_kobject_create_~kobj~1.offset) (<= 16 (select |#length| ldv_kobject_create_~kobj~1.base))), 10921#(and (= 0 |ldv_kobject_create_#res.offset|) (<= 16 (select |#length| |ldv_kobject_create_#res.base|))), 10922#(and (<= 16 (select |#length| |entry_point_#t~ret20.base|)) (= 0 |entry_point_#t~ret20.offset|)), 10923#(and (= 0 entry_point_~kobj~2.offset) (<= 16 (select |#length| entry_point_~kobj~2.base))), 10924#(and (<= 16 (select |#length| |ldv_kobject_put_#in~kobj.base|)) (= 0 |ldv_kobject_put_#in~kobj.offset|)), 10925#(and (= ldv_kobject_put_~kobj.offset 0) (<= 16 (select |#length| ldv_kobject_put_~kobj.base))), 10926#(and (<= 12 |ldv_kref_put_#in~kref.offset|) (<= (+ |ldv_kref_put_#in~kref.offset| 4) (select |#length| |ldv_kref_put_#in~kref.base|))), 10927#(and (<= 12 ldv_kref_put_~kref.offset) (<= (+ ldv_kref_put_~kref.offset 4) (select |#length| ldv_kref_put_~kref.base))), 10928#(and (<= (+ |ldv_kref_sub_#in~kref.offset| 4) (select |#length| |ldv_kref_sub_#in~kref.base|)) (<= 12 |ldv_kref_sub_#in~kref.offset|)), 10929#(and (<= (+ ldv_kref_sub_~kref.offset 4) (select |#length| ldv_kref_sub_~kref.base)) (<= 12 ldv_kref_sub_~kref.offset)), 10930#(and (<= (+ |ldv_atomic_sub_return_#in~v.offset| 4) (select |#length| |ldv_atomic_sub_return_#in~v.base|)) (<= 12 |ldv_atomic_sub_return_#in~v.offset|)), 10931#(and (<= (+ ldv_atomic_sub_return_~v.offset 4) (select |#length| ldv_atomic_sub_return_~v.base)) (<= 12 ldv_atomic_sub_return_~v.offset))] [2018-02-02 20:36:07,285 INFO L134 CoverageAnalysis]: Checked inductivity of 136 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 136 trivial. 0 not checked. [2018-02-02 20:36:07,286 INFO L409 AbstractCegarLoop]: Interpolant automaton has 19 states [2018-02-02 20:36:07,286 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2018-02-02 20:36:07,286 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=306, Unknown=0, NotChecked=0, Total=342 [2018-02-02 20:36:07,286 INFO L87 Difference]: Start difference. First operand 145 states and 148 transitions. Second operand 19 states. [2018-02-02 20:36:07,655 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 20:36:07,655 INFO L93 Difference]: Finished difference Result 143 states and 146 transitions. [2018-02-02 20:36:07,655 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2018-02-02 20:36:07,655 INFO L78 Accepts]: Start accepts. Automaton has 19 states. Word has length 100 [2018-02-02 20:36:07,655 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 20:36:07,656 INFO L225 Difference]: With dead ends: 143 [2018-02-02 20:36:07,656 INFO L226 Difference]: Without dead ends: 143 [2018-02-02 20:36:07,656 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 31 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=61, Invalid=539, Unknown=0, NotChecked=0, Total=600 [2018-02-02 20:36:07,656 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 143 states. [2018-02-02 20:36:07,657 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 143 to 143. [2018-02-02 20:36:07,657 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 143 states. [2018-02-02 20:36:07,658 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 143 states to 143 states and 146 transitions. [2018-02-02 20:36:07,658 INFO L78 Accepts]: Start accepts. Automaton has 143 states and 146 transitions. Word has length 100 [2018-02-02 20:36:07,658 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 20:36:07,658 INFO L432 AbstractCegarLoop]: Abstraction has 143 states and 146 transitions. [2018-02-02 20:36:07,658 INFO L433 AbstractCegarLoop]: Interpolant automaton has 19 states. [2018-02-02 20:36:07,658 INFO L276 IsEmpty]: Start isEmpty. Operand 143 states and 146 transitions. [2018-02-02 20:36:07,658 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 99 [2018-02-02 20:36:07,659 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 20:36:07,659 INFO L351 BasicCegarLoop]: trace histogram [16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-02-02 20:36:07,659 INFO L371 AbstractCegarLoop]: === Iteration 35 === [ldv_kref_initErr0RequiresViolation, ldv_kref_initErr1RequiresViolation, ldv_kobject_createErr0RequiresViolation, ldv_kobject_createErr1RequiresViolation, ldv_atomic_sub_returnErr1RequiresViolation, ldv_atomic_sub_returnErr0RequiresViolation, ldv_atomic_sub_returnErr3RequiresViolation, ldv_atomic_sub_returnErr2RequiresViolation, ldv_atomic_add_returnErr0RequiresViolation, ldv_atomic_add_returnErr1RequiresViolation, ldv_atomic_add_returnErr2RequiresViolation, ldv_atomic_add_returnErr3RequiresViolation, ldv_kobject_cleanupErr4RequiresViolation, ldv_kobject_cleanupErr2RequiresViolation, ldv_kobject_cleanupErr5RequiresViolation, ldv_kobject_cleanupErr3RequiresViolation, ldv_kobject_cleanupErr0RequiresViolation, ldv_kobject_cleanupErr1RequiresViolation, mainErr0EnsuresViolation, LDV_INIT_LIST_HEADErr1RequiresViolation, LDV_INIT_LIST_HEADErr3RequiresViolation, LDV_INIT_LIST_HEADErr2RequiresViolation, LDV_INIT_LIST_HEADErr0RequiresViolation]=== [2018-02-02 20:36:07,659 INFO L82 PathProgramCache]: Analyzing trace with hash -1467486157, now seen corresponding path program 1 times [2018-02-02 20:36:07,659 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 20:36:07,667 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 20:36:07,667 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 20:36:07,720 INFO L134 CoverageAnalysis]: Checked inductivity of 136 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 136 trivial. 0 not checked. [2018-02-02 20:36:07,720 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-02 20:36:07,720 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2018-02-02 20:36:07,720 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 20:36:07,721 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 20:36:07,721 INFO L182 omatonBuilderFactory]: Interpolants [11232#(not (= |ldv_malloc_#t~malloc4.base| 0)), 11233#(not (= |ldv_malloc_#res.base| 0)), 11234#(not (= |ldv_kobject_create_#t~ret17.base| 0)), 11235#(not (= ldv_kobject_create_~kobj~1.base 0)), 11236#(not (= |ldv_kobject_create_#res.base| 0)), 11237#(not (= |entry_point_#t~ret20.base| 0)), 11238#(not (= entry_point_~kobj~2.base 0)), 11239#(= ldv_kobject_put_~kobj.base |ldv_kobject_put_#in~kobj.base|), 11240#(= 0 |ldv_kobject_put_#in~kobj.base|), 11230#true, 11231#false] [2018-02-02 20:36:07,721 INFO L134 CoverageAnalysis]: Checked inductivity of 136 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 136 trivial. 0 not checked. [2018-02-02 20:36:07,721 INFO L409 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-02-02 20:36:07,721 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-02-02 20:36:07,722 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=91, Unknown=0, NotChecked=0, Total=110 [2018-02-02 20:36:07,722 INFO L87 Difference]: Start difference. First operand 143 states and 146 transitions. Second operand 11 states. [2018-02-02 20:36:07,755 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 20:36:07,755 INFO L93 Difference]: Finished difference Result 145 states and 147 transitions. [2018-02-02 20:36:07,756 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-02-02 20:36:07,756 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 98 [2018-02-02 20:36:07,756 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 20:36:07,756 INFO L225 Difference]: With dead ends: 145 [2018-02-02 20:36:07,756 INFO L226 Difference]: Without dead ends: 143 [2018-02-02 20:36:07,756 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=31, Invalid=151, Unknown=0, NotChecked=0, Total=182 [2018-02-02 20:36:07,757 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 143 states. [2018-02-02 20:36:07,757 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 143 to 143. [2018-02-02 20:36:07,757 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 143 states. [2018-02-02 20:36:07,758 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 143 states to 143 states and 145 transitions. [2018-02-02 20:36:07,758 INFO L78 Accepts]: Start accepts. Automaton has 143 states and 145 transitions. Word has length 98 [2018-02-02 20:36:07,758 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 20:36:07,758 INFO L432 AbstractCegarLoop]: Abstraction has 143 states and 145 transitions. [2018-02-02 20:36:07,758 INFO L433 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-02-02 20:36:07,758 INFO L276 IsEmpty]: Start isEmpty. Operand 143 states and 145 transitions. [2018-02-02 20:36:07,758 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 115 [2018-02-02 20:36:07,758 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 20:36:07,759 INFO L351 BasicCegarLoop]: trace histogram [16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-02-02 20:36:07,759 INFO L371 AbstractCegarLoop]: === Iteration 36 === [ldv_kref_initErr0RequiresViolation, ldv_kref_initErr1RequiresViolation, ldv_kobject_createErr0RequiresViolation, ldv_kobject_createErr1RequiresViolation, ldv_atomic_sub_returnErr1RequiresViolation, ldv_atomic_sub_returnErr0RequiresViolation, ldv_atomic_sub_returnErr3RequiresViolation, ldv_atomic_sub_returnErr2RequiresViolation, ldv_atomic_add_returnErr0RequiresViolation, ldv_atomic_add_returnErr1RequiresViolation, ldv_atomic_add_returnErr2RequiresViolation, ldv_atomic_add_returnErr3RequiresViolation, ldv_kobject_cleanupErr4RequiresViolation, ldv_kobject_cleanupErr2RequiresViolation, ldv_kobject_cleanupErr5RequiresViolation, ldv_kobject_cleanupErr3RequiresViolation, ldv_kobject_cleanupErr0RequiresViolation, ldv_kobject_cleanupErr1RequiresViolation, mainErr0EnsuresViolation, LDV_INIT_LIST_HEADErr1RequiresViolation, LDV_INIT_LIST_HEADErr3RequiresViolation, LDV_INIT_LIST_HEADErr2RequiresViolation, LDV_INIT_LIST_HEADErr0RequiresViolation]=== [2018-02-02 20:36:07,759 INFO L82 PathProgramCache]: Analyzing trace with hash 1545932879, now seen corresponding path program 1 times [2018-02-02 20:36:07,759 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 20:36:07,769 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 20:36:07,770 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 20:36:08,013 INFO L134 CoverageAnalysis]: Checked inductivity of 136 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 136 trivial. 0 not checked. [2018-02-02 20:36:08,013 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-02 20:36:08,013 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [23] imperfect sequences [] total 23 [2018-02-02 20:36:08,013 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 20:36:08,014 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 20:36:08,014 INFO L182 omatonBuilderFactory]: Interpolants [11552#(= 1 (select |#valid| ldv_kref_sub_~kref.base)), 11553#(= 1 (select |#valid| |##fun~$Pointer$~TO~VOID_#in~kref.base|)), 11554#(= 1 (select |#valid| |##fun~$Pointer$~TO~VOID_#~kref.base|)), 11555#(= 1 (select |#valid| |ldv_kobject_release_#in~kref.base|)), 11556#(= 1 (select |#valid| ldv_kobject_release_~kobj~0.base)), 11557#(= 1 (select |#valid| |ldv_kobject_cleanup_#in~kobj.base|)), 11558#(= 1 (select |#valid| ldv_kobject_cleanup_~kobj.base)), 11535#true, 11536#false, 11537#(= f_22_get_~kobj.base |f_22_get_#in~kobj.base|), 11538#(= ldv_kobject_get_~kobj.base |ldv_kobject_get_#in~kobj.base|), 11539#(= ldv_kref_get_~kref.base |ldv_kref_get_#in~kref.base|), 11540#(= ldv_atomic_add_return_~v.base |ldv_atomic_add_return_#in~v.base|), 11541#(and (= 1 (select |#valid| ldv_atomic_add_return_~v.base)) (= ldv_atomic_add_return_~v.base |ldv_atomic_add_return_#in~v.base|)), 11542#(= 1 (select |#valid| |ldv_atomic_add_return_#in~v.base|)), 11543#(= 1 (select |#valid| |ldv_kref_get_#in~kref.base|)), 11544#(= 1 (select |#valid| |ldv_kobject_get_#in~kobj.base|)), 11545#(= 1 (select |#valid| |f_22_get_#in~kobj.base|)), 11546#(= 1 (select |#valid| entry_point_~kobj~2.base)), 11547#(= 1 (select |#valid| |ldv_kobject_put_#in~kobj.base|)), 11548#(= 1 (select |#valid| ldv_kobject_put_~kobj.base)), 11549#(= 1 (select |#valid| |ldv_kref_put_#in~kref.base|)), 11550#(= 1 (select |#valid| ldv_kref_put_~kref.base)), 11551#(= 1 (select |#valid| |ldv_kref_sub_#in~kref.base|))] [2018-02-02 20:36:08,014 INFO L134 CoverageAnalysis]: Checked inductivity of 136 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 136 trivial. 0 not checked. [2018-02-02 20:36:08,014 INFO L409 AbstractCegarLoop]: Interpolant automaton has 24 states [2018-02-02 20:36:08,014 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2018-02-02 20:36:08,014 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=505, Unknown=0, NotChecked=0, Total=552 [2018-02-02 20:36:08,014 INFO L87 Difference]: Start difference. First operand 143 states and 145 transitions. Second operand 24 states. [2018-02-02 20:36:08,411 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 20:36:08,411 INFO L93 Difference]: Finished difference Result 146 states and 148 transitions. [2018-02-02 20:36:08,411 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2018-02-02 20:36:08,412 INFO L78 Accepts]: Start accepts. Automaton has 24 states. Word has length 114 [2018-02-02 20:36:08,412 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 20:36:08,412 INFO L225 Difference]: With dead ends: 146 [2018-02-02 20:36:08,412 INFO L226 Difference]: Without dead ends: 146 [2018-02-02 20:36:08,413 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 32 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 31 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 78 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=83, Invalid=973, Unknown=0, NotChecked=0, Total=1056 [2018-02-02 20:36:08,413 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 146 states. [2018-02-02 20:36:08,414 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 146 to 141. [2018-02-02 20:36:08,414 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 141 states. [2018-02-02 20:36:08,414 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 141 states to 141 states and 143 transitions. [2018-02-02 20:36:08,414 INFO L78 Accepts]: Start accepts. Automaton has 141 states and 143 transitions. Word has length 114 [2018-02-02 20:36:08,415 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 20:36:08,415 INFO L432 AbstractCegarLoop]: Abstraction has 141 states and 143 transitions. [2018-02-02 20:36:08,415 INFO L433 AbstractCegarLoop]: Interpolant automaton has 24 states. [2018-02-02 20:36:08,415 INFO L276 IsEmpty]: Start isEmpty. Operand 141 states and 143 transitions. [2018-02-02 20:36:08,415 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 115 [2018-02-02 20:36:08,415 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 20:36:08,415 INFO L351 BasicCegarLoop]: trace histogram [16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-02-02 20:36:08,415 INFO L371 AbstractCegarLoop]: === Iteration 37 === [ldv_kref_initErr0RequiresViolation, ldv_kref_initErr1RequiresViolation, ldv_kobject_createErr0RequiresViolation, ldv_kobject_createErr1RequiresViolation, ldv_atomic_sub_returnErr1RequiresViolation, ldv_atomic_sub_returnErr0RequiresViolation, ldv_atomic_sub_returnErr3RequiresViolation, ldv_atomic_sub_returnErr2RequiresViolation, ldv_atomic_add_returnErr0RequiresViolation, ldv_atomic_add_returnErr1RequiresViolation, ldv_atomic_add_returnErr2RequiresViolation, ldv_atomic_add_returnErr3RequiresViolation, ldv_kobject_cleanupErr4RequiresViolation, ldv_kobject_cleanupErr2RequiresViolation, ldv_kobject_cleanupErr5RequiresViolation, ldv_kobject_cleanupErr3RequiresViolation, ldv_kobject_cleanupErr0RequiresViolation, ldv_kobject_cleanupErr1RequiresViolation, mainErr0EnsuresViolation, LDV_INIT_LIST_HEADErr1RequiresViolation, LDV_INIT_LIST_HEADErr3RequiresViolation, LDV_INIT_LIST_HEADErr2RequiresViolation, LDV_INIT_LIST_HEADErr0RequiresViolation]=== [2018-02-02 20:36:08,415 INFO L82 PathProgramCache]: Analyzing trace with hash 1545932880, now seen corresponding path program 1 times [2018-02-02 20:36:08,416 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 20:36:08,428 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 20:36:08,428 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 20:36:08,792 INFO L134 CoverageAnalysis]: Checked inductivity of 136 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 136 trivial. 0 not checked. [2018-02-02 20:36:08,792 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-02 20:36:08,792 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [22] imperfect sequences [] total 22 [2018-02-02 20:36:08,792 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 20:36:08,792 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 20:36:08,792 INFO L182 omatonBuilderFactory]: Interpolants [11872#(and (= 0 |ldv_kobject_create_#res.offset|) (<= 16 (select |#length| |ldv_kobject_create_#res.base|))), 11873#(and (<= 16 (select |#length| |entry_point_#t~ret20.base|)) (= 0 |entry_point_#t~ret20.offset|)), 11874#(and (= 0 entry_point_~kobj~2.offset) (<= 16 (select |#length| entry_point_~kobj~2.base))), 11875#(and (<= 16 (select |#length| |ldv_kobject_put_#in~kobj.base|)) (= 0 |ldv_kobject_put_#in~kobj.offset|)), 11876#(and (= ldv_kobject_put_~kobj.offset 0) (<= 16 (select |#length| ldv_kobject_put_~kobj.base))), 11877#(and (<= 12 |ldv_kref_put_#in~kref.offset|) (<= (+ |ldv_kref_put_#in~kref.offset| 4) (select |#length| |ldv_kref_put_#in~kref.base|))), 11878#(and (<= 12 ldv_kref_put_~kref.offset) (<= (+ ldv_kref_put_~kref.offset 4) (select |#length| ldv_kref_put_~kref.base))), 11879#(and (<= (+ |ldv_kref_sub_#in~kref.offset| 4) (select |#length| |ldv_kref_sub_#in~kref.base|)) (<= 12 |ldv_kref_sub_#in~kref.offset|)), 11880#(and (<= (+ ldv_kref_sub_~kref.offset 4) (select |#length| ldv_kref_sub_~kref.base)) (<= 12 ldv_kref_sub_~kref.offset)), 11881#(and (<= 12 |##fun~$Pointer$~TO~VOID_#in~kref.offset|) (<= (+ |##fun~$Pointer$~TO~VOID_#in~kref.offset| 4) (select |#length| |##fun~$Pointer$~TO~VOID_#in~kref.base|))), 11882#(and (<= 12 |##fun~$Pointer$~TO~VOID_#~kref.offset|) (<= (+ |##fun~$Pointer$~TO~VOID_#~kref.offset| 4) (select |#length| |##fun~$Pointer$~TO~VOID_#~kref.base|))), 11883#(and (<= 12 |ldv_kobject_release_#in~kref.offset|) (<= (+ |ldv_kobject_release_#in~kref.offset| 4) (select |#length| |ldv_kobject_release_#in~kref.base|))), 11884#(and (<= (+ ldv_kobject_release_~kobj~0.offset 16) (select |#length| ldv_kobject_release_~kobj~0.base)) (<= 0 ldv_kobject_release_~kobj~0.offset)), 11885#(and (<= (+ |ldv_kobject_cleanup_#in~kobj.offset| 16) (select |#length| |ldv_kobject_cleanup_#in~kobj.base|)) (<= 0 |ldv_kobject_cleanup_#in~kobj.offset|)), 11886#(and (<= 0 ldv_kobject_cleanup_~kobj.offset) (<= (+ ldv_kobject_cleanup_~kobj.offset 16) (select |#length| ldv_kobject_cleanup_~kobj.base))), 11864#true, 11865#false, 11866#(= 0 |ldv_malloc_#t~malloc4.offset|), 11867#(= 0 |ldv_malloc_#res.offset|), 11868#(= 0 |ldv_kobject_create_#t~ret17.offset|), 11869#(= 0 ldv_kobject_create_~kobj~1.offset), 11870#(or (<= (+ |#Ultimate.C_memset_#ptr.offset| |#Ultimate.C_memset_#amount|) (select |#length| |#Ultimate.C_memset_#ptr.base|)) (not (= |#Ultimate.C_memset_#ptr.offset| 0))), 11871#(and (= 0 ldv_kobject_create_~kobj~1.offset) (<= 16 (select |#length| ldv_kobject_create_~kobj~1.base)))] [2018-02-02 20:36:08,792 INFO L134 CoverageAnalysis]: Checked inductivity of 136 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 136 trivial. 0 not checked. [2018-02-02 20:36:08,793 INFO L409 AbstractCegarLoop]: Interpolant automaton has 23 states [2018-02-02 20:36:08,793 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2018-02-02 20:36:08,793 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=44, Invalid=462, Unknown=0, NotChecked=0, Total=506 [2018-02-02 20:36:08,793 INFO L87 Difference]: Start difference. First operand 141 states and 143 transitions. Second operand 23 states. [2018-02-02 20:36:09,257 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 20:36:09,257 INFO L93 Difference]: Finished difference Result 140 states and 142 transitions. [2018-02-02 20:36:09,257 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2018-02-02 20:36:09,257 INFO L78 Accepts]: Start accepts. Automaton has 23 states. Word has length 114 [2018-02-02 20:36:09,258 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 20:36:09,258 INFO L225 Difference]: With dead ends: 140 [2018-02-02 20:36:09,258 INFO L226 Difference]: Without dead ends: 140 [2018-02-02 20:36:09,258 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 31 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 29 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 50 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=77, Invalid=853, Unknown=0, NotChecked=0, Total=930 [2018-02-02 20:36:09,258 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 140 states. [2018-02-02 20:36:09,259 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 140 to 140. [2018-02-02 20:36:09,259 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 140 states. [2018-02-02 20:36:09,260 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 140 states to 140 states and 142 transitions. [2018-02-02 20:36:09,260 INFO L78 Accepts]: Start accepts. Automaton has 140 states and 142 transitions. Word has length 114 [2018-02-02 20:36:09,260 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 20:36:09,260 INFO L432 AbstractCegarLoop]: Abstraction has 140 states and 142 transitions. [2018-02-02 20:36:09,260 INFO L433 AbstractCegarLoop]: Interpolant automaton has 23 states. [2018-02-02 20:36:09,260 INFO L276 IsEmpty]: Start isEmpty. Operand 140 states and 142 transitions. [2018-02-02 20:36:09,260 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 117 [2018-02-02 20:36:09,260 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 20:36:09,260 INFO L351 BasicCegarLoop]: trace histogram [16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-02-02 20:36:09,261 INFO L371 AbstractCegarLoop]: === Iteration 38 === [ldv_kref_initErr0RequiresViolation, ldv_kref_initErr1RequiresViolation, ldv_kobject_createErr0RequiresViolation, ldv_kobject_createErr1RequiresViolation, ldv_atomic_sub_returnErr1RequiresViolation, ldv_atomic_sub_returnErr0RequiresViolation, ldv_atomic_sub_returnErr3RequiresViolation, ldv_atomic_sub_returnErr2RequiresViolation, ldv_atomic_add_returnErr0RequiresViolation, ldv_atomic_add_returnErr1RequiresViolation, ldv_atomic_add_returnErr2RequiresViolation, ldv_atomic_add_returnErr3RequiresViolation, ldv_kobject_cleanupErr4RequiresViolation, ldv_kobject_cleanupErr2RequiresViolation, ldv_kobject_cleanupErr5RequiresViolation, ldv_kobject_cleanupErr3RequiresViolation, ldv_kobject_cleanupErr0RequiresViolation, ldv_kobject_cleanupErr1RequiresViolation, mainErr0EnsuresViolation, LDV_INIT_LIST_HEADErr1RequiresViolation, LDV_INIT_LIST_HEADErr3RequiresViolation, LDV_INIT_LIST_HEADErr2RequiresViolation, LDV_INIT_LIST_HEADErr0RequiresViolation]=== [2018-02-02 20:36:09,261 INFO L82 PathProgramCache]: Analyzing trace with hash -417185232, now seen corresponding path program 1 times [2018-02-02 20:36:09,261 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 20:36:09,271 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 20:36:09,272 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 20:36:09,507 INFO L134 CoverageAnalysis]: Checked inductivity of 136 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 136 trivial. 0 not checked. [2018-02-02 20:36:09,507 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-02 20:36:09,507 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [21] imperfect sequences [] total 21 [2018-02-02 20:36:09,508 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 20:36:09,508 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 20:36:09,508 INFO L182 omatonBuilderFactory]: Interpolants [12192#(= 0 |ldv_kobject_put_#in~kobj.offset|), 12193#(= ldv_kobject_put_~kobj.offset 0), 12194#(<= |ldv_kref_put_#in~kref.offset| 12), 12195#(<= ldv_kref_put_~kref.offset 12), 12196#(<= |ldv_kref_sub_#in~kref.offset| 12), 12197#(<= ldv_kref_sub_~kref.offset 12), 12198#(<= |##fun~$Pointer$~TO~VOID_#in~kref.offset| 12), 12199#(<= |##fun~$Pointer$~TO~VOID_#~kref.offset| 12), 12200#(<= |ldv_kobject_release_#in~kref.offset| 12), 12201#(<= ldv_kobject_release_~kobj~0.offset 0), 12202#(<= |ldv_kobject_cleanup_#in~kobj.offset| 0), 12203#(<= ldv_kobject_cleanup_~kobj.offset 0), 12204#(and (<= 0 ldv_kobject_cleanup_~kobj.offset) (<= ldv_kobject_cleanup_~kobj.offset 0)), 12183#true, 12184#false, 12185#(= 0 |ldv_malloc_#t~malloc4.offset|), 12186#(= 0 |ldv_malloc_#res.offset|), 12187#(= 0 |ldv_kobject_create_#t~ret17.offset|), 12188#(= 0 ldv_kobject_create_~kobj~1.offset), 12189#(= 0 |ldv_kobject_create_#res.offset|), 12190#(= 0 |entry_point_#t~ret20.offset|), 12191#(= 0 entry_point_~kobj~2.offset)] [2018-02-02 20:36:09,508 INFO L134 CoverageAnalysis]: Checked inductivity of 136 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 136 trivial. 0 not checked. [2018-02-02 20:36:09,508 INFO L409 AbstractCegarLoop]: Interpolant automaton has 22 states [2018-02-02 20:36:09,508 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2018-02-02 20:36:09,509 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=42, Invalid=420, Unknown=0, NotChecked=0, Total=462 [2018-02-02 20:36:09,509 INFO L87 Difference]: Start difference. First operand 140 states and 142 transitions. Second operand 22 states. [2018-02-02 20:36:09,735 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 20:36:09,735 INFO L93 Difference]: Finished difference Result 139 states and 141 transitions. [2018-02-02 20:36:09,735 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2018-02-02 20:36:09,735 INFO L78 Accepts]: Start accepts. Automaton has 22 states. Word has length 116 [2018-02-02 20:36:09,736 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 20:36:09,736 INFO L225 Difference]: With dead ends: 139 [2018-02-02 20:36:09,736 INFO L226 Difference]: Without dead ends: 139 [2018-02-02 20:36:09,737 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 31 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 29 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 42 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=80, Invalid=850, Unknown=0, NotChecked=0, Total=930 [2018-02-02 20:36:09,737 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 139 states. [2018-02-02 20:36:09,739 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 139 to 139. [2018-02-02 20:36:09,739 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 139 states. [2018-02-02 20:36:09,739 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 139 states to 139 states and 141 transitions. [2018-02-02 20:36:09,740 INFO L78 Accepts]: Start accepts. Automaton has 139 states and 141 transitions. Word has length 116 [2018-02-02 20:36:09,740 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 20:36:09,740 INFO L432 AbstractCegarLoop]: Abstraction has 139 states and 141 transitions. [2018-02-02 20:36:09,740 INFO L433 AbstractCegarLoop]: Interpolant automaton has 22 states. [2018-02-02 20:36:09,740 INFO L276 IsEmpty]: Start isEmpty. Operand 139 states and 141 transitions. [2018-02-02 20:36:09,741 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 119 [2018-02-02 20:36:09,741 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 20:36:09,741 INFO L351 BasicCegarLoop]: trace histogram [16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-02-02 20:36:09,741 INFO L371 AbstractCegarLoop]: === Iteration 39 === [ldv_kref_initErr0RequiresViolation, ldv_kref_initErr1RequiresViolation, ldv_kobject_createErr0RequiresViolation, ldv_kobject_createErr1RequiresViolation, ldv_atomic_sub_returnErr1RequiresViolation, ldv_atomic_sub_returnErr0RequiresViolation, ldv_atomic_sub_returnErr3RequiresViolation, ldv_atomic_sub_returnErr2RequiresViolation, ldv_atomic_add_returnErr0RequiresViolation, ldv_atomic_add_returnErr1RequiresViolation, ldv_atomic_add_returnErr2RequiresViolation, ldv_atomic_add_returnErr3RequiresViolation, ldv_kobject_cleanupErr4RequiresViolation, ldv_kobject_cleanupErr2RequiresViolation, ldv_kobject_cleanupErr5RequiresViolation, ldv_kobject_cleanupErr3RequiresViolation, ldv_kobject_cleanupErr0RequiresViolation, ldv_kobject_cleanupErr1RequiresViolation, mainErr0EnsuresViolation, LDV_INIT_LIST_HEADErr1RequiresViolation, LDV_INIT_LIST_HEADErr3RequiresViolation, LDV_INIT_LIST_HEADErr2RequiresViolation, LDV_INIT_LIST_HEADErr0RequiresViolation]=== [2018-02-02 20:36:09,741 INFO L82 PathProgramCache]: Analyzing trace with hash -1483046767, now seen corresponding path program 1 times [2018-02-02 20:36:09,742 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 20:36:09,822 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 20:36:09,823 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 20:36:11,431 INFO L134 CoverageAnalysis]: Checked inductivity of 136 backedges. 16 proven. 0 refuted. 0 times theorem prover too weak. 120 trivial. 0 not checked. [2018-02-02 20:36:11,431 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-02 20:36:11,431 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [49] imperfect sequences [] total 49 [2018-02-02 20:36:11,431 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 20:36:11,432 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 20:36:11,432 INFO L182 omatonBuilderFactory]: Interpolants [12544#(and (= ldv_atomic_sub_return_~i |ldv_atomic_sub_return_#in~i|) (<= ldv_atomic_sub_return_~v.offset |ldv_atomic_sub_return_#in~v.offset|) (<= |ldv_atomic_sub_return_#in~v.offset| ldv_atomic_sub_return_~v.offset) (= |#memory_int| |old(#memory_int)|) (= ldv_atomic_sub_return_~v.base |ldv_atomic_sub_return_#in~v.base|)), 12545#(and (= ldv_atomic_sub_return_~i |ldv_atomic_sub_return_#in~i|) (<= ldv_atomic_sub_return_~v.offset |ldv_atomic_sub_return_#in~v.offset|) (<= |ldv_atomic_sub_return_#in~v.offset| ldv_atomic_sub_return_~v.offset) (= (select (select |#memory_int| ldv_atomic_sub_return_~v.base) ldv_atomic_sub_return_~v.offset) |ldv_atomic_sub_return_#t~mem9|) (= |#memory_int| |old(#memory_int)|) (= ldv_atomic_sub_return_~v.base |ldv_atomic_sub_return_#in~v.base|)), 12546#(and (<= (select (select |#memory_int| ldv_atomic_sub_return_~v.base) ldv_atomic_sub_return_~v.offset) (+ |ldv_atomic_sub_return_#in~i| ldv_atomic_sub_return_~temp~1)) (<= ldv_atomic_sub_return_~v.offset |ldv_atomic_sub_return_#in~v.offset|) (<= |ldv_atomic_sub_return_#in~v.offset| ldv_atomic_sub_return_~v.offset) (= |#memory_int| |old(#memory_int)|) (= ldv_atomic_sub_return_~v.base |ldv_atomic_sub_return_#in~v.base|)), 12547#(<= (select (select |old(#memory_int)| |ldv_atomic_sub_return_#in~v.base|) (- (- |ldv_atomic_sub_return_#in~v.offset|))) (+ |ldv_atomic_sub_return_#in~i| ldv_atomic_sub_return_~temp~1)), 12548#(<= (select (select |old(#memory_int)| |ldv_atomic_sub_return_#in~v.base|) (- (- |ldv_atomic_sub_return_#in~v.offset|))) (+ |ldv_atomic_sub_return_#in~i| |ldv_atomic_sub_return_#res|)), 12549#(<= 1 |ldv_kref_sub_#t~ret11|), 12501#true, 12502#false, 12503#(= 0 |ldv_malloc_#t~malloc4.offset|), 12504#(= 0 |ldv_malloc_#res.offset|), 12505#(= 0 |ldv_kobject_create_#t~ret17.offset|), 12506#(= 0 ldv_kobject_create_~kobj~1.offset), 12507#(or (not (= |#Ultimate.C_memset_#ptr.offset| 0)) (<= |#Ultimate.C_memset_#t~loopctr21| |#Ultimate.C_memset_#amount|)), 12508#(and (= |ldv_kobject_init_#in~kobj.offset| ldv_kobject_init_~kobj.offset) (= ldv_kobject_init_~kobj.base |ldv_kobject_init_#in~kobj.base|)), 12509#(and (or (= ldv_kobject_init_internal_~kobj.offset |ldv_kobject_init_internal_#in~kobj.offset|) (= ldv_kobject_init_internal_~kobj.offset 0)) (or (not (= ldv_kobject_init_internal_~kobj.offset 0)) (= ldv_kobject_init_internal_~kobj.base |ldv_kobject_init_internal_#in~kobj.base|))), 12510#(and (or (= ldv_kobject_init_internal_~kobj.offset 0) (not (= |ldv_kobject_init_internal_#in~kobj.offset| 0))) (or (not (= ldv_kobject_init_internal_~kobj.offset 0)) (= ldv_kobject_init_internal_~kobj.base |ldv_kobject_init_internal_#in~kobj.base|))), 12511#(and (<= ldv_kref_init_~kref.offset |ldv_kref_init_#in~kref.offset|) (<= |ldv_kref_init_#in~kref.offset| ldv_kref_init_~kref.offset) (= ldv_kref_init_~kref.base |ldv_kref_init_#in~kref.base|)), 12512#(= 1 (select (select |#memory_int| |ldv_kref_init_#in~kref.base|) (- (- |ldv_kref_init_#in~kref.offset|)))), 12513#(and (or (and (= 1 (select (select |#memory_int| ldv_kobject_init_internal_~kobj.base) (- (+ (- ldv_kobject_init_internal_~kobj.offset) (- 12))))) (= ldv_kobject_init_internal_~kobj.base |ldv_kobject_init_internal_#in~kobj.base|)) (not (= ldv_kobject_init_internal_~kobj.offset 0))) (or (= ldv_kobject_init_internal_~kobj.offset 0) (not (= |ldv_kobject_init_internal_#in~kobj.offset| 0)))), 12514#(= |#memory_int| |old(#memory_int)|), 12515#(and (= LDV_INIT_LIST_HEAD_~list.base |LDV_INIT_LIST_HEAD_#in~list.base|) (= |#memory_int| |old(#memory_int)|) (<= LDV_INIT_LIST_HEAD_~list.offset |LDV_INIT_LIST_HEAD_#in~list.offset|)), 12516#(and (= LDV_INIT_LIST_HEAD_~list.base |LDV_INIT_LIST_HEAD_#in~list.base|) (= (store (select |old(#memory_int)| LDV_INIT_LIST_HEAD_~list.base) LDV_INIT_LIST_HEAD_~list.offset (select (select |#memory_int| LDV_INIT_LIST_HEAD_~list.base) LDV_INIT_LIST_HEAD_~list.offset)) (select |#memory_int| LDV_INIT_LIST_HEAD_~list.base)) (<= LDV_INIT_LIST_HEAD_~list.offset |LDV_INIT_LIST_HEAD_#in~list.offset|)), 12517#(and (or (<= (@diff (select |old(#memory_int)| |LDV_INIT_LIST_HEAD_#in~list.base|) (select |#memory_int| |LDV_INIT_LIST_HEAD_#in~list.base|)) (+ |LDV_INIT_LIST_HEAD_#in~list.offset| 4)) (= (select |old(#memory_int)| |LDV_INIT_LIST_HEAD_#in~list.base|) (select |#memory_int| |LDV_INIT_LIST_HEAD_#in~list.base|))) (= (store (store (select |old(#memory_int)| |LDV_INIT_LIST_HEAD_#in~list.base|) (@diff (select |old(#memory_int)| |LDV_INIT_LIST_HEAD_#in~list.base|) (select |#memory_int| |LDV_INIT_LIST_HEAD_#in~list.base|)) (select (select |#memory_int| |LDV_INIT_LIST_HEAD_#in~list.base|) (@diff (select |old(#memory_int)| |LDV_INIT_LIST_HEAD_#in~list.base|) (select |#memory_int| |LDV_INIT_LIST_HEAD_#in~list.base|)))) (@diff (store (select |old(#memory_int)| |LDV_INIT_LIST_HEAD_#in~list.base|) (@diff (select |old(#memory_int)| |LDV_INIT_LIST_HEAD_#in~list.base|) (select |#memory_int| |LDV_INIT_LIST_HEAD_#in~list.base|)) (select (select |#memory_int| |LDV_INIT_LIST_HEAD_#in~list.base|) (@diff (select |old(#memory_int)| |LDV_INIT_LIST_HEAD_#in~list.base|) (select |#memory_int| |LDV_INIT_LIST_HEAD_#in~list.base|)))) (select |#memory_int| |LDV_INIT_LIST_HEAD_#in~list.base|)) (select (select |#memory_int| |LDV_INIT_LIST_HEAD_#in~list.base|) (@diff (store (select |old(#memory_int)| |LDV_INIT_LIST_HEAD_#in~list.base|) (@diff (select |old(#memory_int)| |LDV_INIT_LIST_HEAD_#in~list.base|) (select |#memory_int| |LDV_INIT_LIST_HEAD_#in~list.base|)) (select (select |#memory_int| |LDV_INIT_LIST_HEAD_#in~list.base|) (@diff (select |old(#memory_int)| |LDV_INIT_LIST_HEAD_#in~list.base|) (select |#memory_int| |LDV_INIT_LIST_HEAD_#in~list.base|)))) (select |#memory_int| |LDV_INIT_LIST_HEAD_#in~list.base|)))) (select |#memory_int| |LDV_INIT_LIST_HEAD_#in~list.base|)) (or (= (store (select |old(#memory_int)| |LDV_INIT_LIST_HEAD_#in~list.base|) (@diff (select |old(#memory_int)| |LDV_INIT_LIST_HEAD_#in~list.base|) (select |#memory_int| |LDV_INIT_LIST_HEAD_#in~list.base|)) (select (select |#memory_int| |LDV_INIT_LIST_HEAD_#in~list.base|) (@diff (select |old(#memory_int)| |LDV_INIT_LIST_HEAD_#in~list.base|) (select |#memory_int| |LDV_INIT_LIST_HEAD_#in~list.base|)))) (select |#memory_int| |LDV_INIT_LIST_HEAD_#in~list.base|)) (<= (@diff (store (select |old(#memory_int)| |LDV_INIT_LIST_HEAD_#in~list.base|) (@diff (select |old(#memory_int)| |LDV_INIT_LIST_HEAD_#in~list.base|) (select |#memory_int| |LDV_INIT_LIST_HEAD_#in~list.base|)) (select (select |#memory_int| |LDV_INIT_LIST_HEAD_#in~list.base|) (@diff (select |old(#memory_int)| |LDV_INIT_LIST_HEAD_#in~list.base|) (select |#memory_int| |LDV_INIT_LIST_HEAD_#in~list.base|)))) (select |#memory_int| |LDV_INIT_LIST_HEAD_#in~list.base|)) (+ |LDV_INIT_LIST_HEAD_#in~list.offset| 4)))), 12518#(or (= 1 (select (select |#memory_int| |ldv_kobject_init_internal_#in~kobj.base|) (- (- 12)))) (not (= |ldv_kobject_init_internal_#in~kobj.offset| 0))), 12519#(or (= 1 (select (select |#memory_int| |ldv_kobject_init_#in~kobj.base|) (- (- 12)))) (not (= |ldv_kobject_init_#in~kobj.offset| 0))), 12520#(and (= 0 ldv_kobject_create_~kobj~1.offset) (= 1 (select (select |#memory_int| ldv_kobject_create_~kobj~1.base) 12))), 12521#(and (= 1 (select (select |#memory_int| |ldv_kobject_create_#res.base|) 12)) (= 0 |ldv_kobject_create_#res.offset|)), 12522#(and (= 0 |entry_point_#t~ret20.offset|) (= 1 (select (select |#memory_int| |entry_point_#t~ret20.base|) 12))), 12523#(and (= 0 entry_point_~kobj~2.offset) (= 1 (select (select |#memory_int| entry_point_~kobj~2.base) 12))), 12524#(and (= |f_22_get_#in~kobj.base| f_22_get_~kobj.base) (= |#memory_int| |old(#memory_int)|) (= f_22_get_~kobj.offset |f_22_get_#in~kobj.offset|)), 12525#(and (or (and (= ldv_kobject_get_~kobj.base |ldv_kobject_get_#in~kobj.base|) (= |#memory_int| |old(#memory_int)|)) (not (= ldv_kobject_get_~kobj.offset 0))) (or (= ldv_kobject_get_~kobj.offset |ldv_kobject_get_#in~kobj.offset|) (= ldv_kobject_get_~kobj.offset 0))), 12526#(and (or (and (= ldv_kobject_get_~kobj.base |ldv_kobject_get_#in~kobj.base|) (= |#memory_int| |old(#memory_int)|)) (not (= ldv_kobject_get_~kobj.offset 0))) (or (not (= 0 |ldv_kobject_get_#in~kobj.offset|)) (= ldv_kobject_get_~kobj.offset 0))), 12527#(and (<= ldv_kref_get_~kref.offset |ldv_kref_get_#in~kref.offset|) (= |#memory_int| |old(#memory_int)|) (= ldv_kref_get_~kref.base |ldv_kref_get_#in~kref.base|) (<= |ldv_kref_get_#in~kref.offset| ldv_kref_get_~kref.offset)), 12528#(and (<= |ldv_atomic_add_return_#in~v.offset| ldv_atomic_add_return_~v.offset) (<= ldv_atomic_add_return_~v.offset |ldv_atomic_add_return_#in~v.offset|) (or (= |ldv_atomic_add_return_#in~i| ldv_atomic_add_return_~i) (= ldv_atomic_add_return_~i 1)) (or (and (= |#memory_int| |old(#memory_int)|) (= ldv_atomic_add_return_~v.base |ldv_atomic_add_return_#in~v.base|)) (not (= ldv_atomic_add_return_~i 1)))), 12529#(and (or (not (= ldv_atomic_add_return_~i 1)) (and (or (= (select (select |#memory_int| ldv_atomic_add_return_~v.base) ldv_atomic_add_return_~v.offset) |ldv_atomic_add_return_#t~mem7|) (= |ldv_atomic_add_return_#t~mem7| 1)) (= |#memory_int| |old(#memory_int)|) (= ldv_atomic_add_return_~v.base |ldv_atomic_add_return_#in~v.base|))) (<= |ldv_atomic_add_return_#in~v.offset| ldv_atomic_add_return_~v.offset) (<= ldv_atomic_add_return_~v.offset |ldv_atomic_add_return_#in~v.offset|) (or (= |ldv_atomic_add_return_#in~i| ldv_atomic_add_return_~i) (= ldv_atomic_add_return_~i 1))), 12530#(and (or (not (= |ldv_atomic_add_return_#in~i| 1)) (and (or (<= 2 ldv_atomic_add_return_~temp~0) (not (= (select (select |#memory_int| ldv_atomic_add_return_~v.base) ldv_atomic_add_return_~v.offset) 1))) (= |#memory_int| |old(#memory_int)|) (= ldv_atomic_add_return_~v.base |ldv_atomic_add_return_#in~v.base|))) (<= |ldv_atomic_add_return_#in~v.offset| ldv_atomic_add_return_~v.offset) (<= ldv_atomic_add_return_~v.offset |ldv_atomic_add_return_#in~v.offset|)), 12531#(or (not (= |ldv_atomic_add_return_#in~i| 1)) (and (<= 2 ldv_atomic_add_return_~temp~0) (= ldv_atomic_add_return_~temp~0 (select (select |#memory_int| |ldv_atomic_add_return_#in~v.base|) (- (- |ldv_atomic_add_return_#in~v.offset|))))) (not (= (select (select |old(#memory_int)| |ldv_atomic_add_return_#in~v.base|) (- (- |ldv_atomic_add_return_#in~v.offset|))) 1))), 12532#(or (not (= |ldv_atomic_add_return_#in~i| 1)) (<= 2 (select (select |#memory_int| |ldv_atomic_add_return_#in~v.base|) (- (- |ldv_atomic_add_return_#in~v.offset|)))) (not (= (select (select |old(#memory_int)| |ldv_atomic_add_return_#in~v.base|) (- (- |ldv_atomic_add_return_#in~v.offset|))) 1))), 12533#(or (not (= (select (select |old(#memory_int)| |ldv_kref_get_#in~kref.base|) (- (- |ldv_kref_get_#in~kref.offset|))) 1)) (<= 2 (select (select |#memory_int| |ldv_kref_get_#in~kref.base|) (- (- |ldv_kref_get_#in~kref.offset|))))), 12534#(and (or (<= 2 (select (select |#memory_int| |ldv_kobject_get_#in~kobj.base|) (- (+ (- ldv_kobject_get_~kobj.offset) (- 12))))) (not (= (select (select |old(#memory_int)| |ldv_kobject_get_#in~kobj.base|) (- (+ (- ldv_kobject_get_~kobj.offset) (- 12)))) 1)) (not (= ldv_kobject_get_~kobj.offset 0))) (or (not (= 0 |ldv_kobject_get_#in~kobj.offset|)) (= ldv_kobject_get_~kobj.offset 0))), 12535#(or (not (= 0 |ldv_kobject_get_#in~kobj.offset|)) (<= 2 (select (select |#memory_int| |ldv_kobject_get_#in~kobj.base|) (- (- 12)))) (not (= (select (select |old(#memory_int)| |ldv_kobject_get_#in~kobj.base|) (- (- 12))) 1))), 12536#(or (<= 2 (select (select |#memory_int| |f_22_get_#in~kobj.base|) (- (- 12)))) (not (= 0 |f_22_get_#in~kobj.offset|)) (not (= (select (select |old(#memory_int)| |f_22_get_#in~kobj.base|) (- (- 12))) 1))), 12537#(and (<= 2 (select (select |#memory_int| entry_point_~kobj~2.base) 12)) (= 0 entry_point_~kobj~2.offset)), 12538#(and (<= 2 (select (select |#memory_int| |ldv_kobject_put_#in~kobj.base|) 12)) (= 0 |ldv_kobject_put_#in~kobj.offset|)), 12539#(and (= ldv_kobject_put_~kobj.offset 0) (<= 2 (select (select |#memory_int| ldv_kobject_put_~kobj.base) 12))), 12540#(<= 2 (select (select |#memory_int| |ldv_kref_put_#in~kref.base|) |ldv_kref_put_#in~kref.offset|)), 12541#(<= 2 (select (select |#memory_int| ldv_kref_put_~kref.base) ldv_kref_put_~kref.offset)), 12542#(and (<= 2 (select (select |#memory_int| |ldv_kref_sub_#in~kref.base|) |ldv_kref_sub_#in~kref.offset|)) (= 1 |ldv_kref_sub_#in~count|)), 12543#(and (= ldv_kref_sub_~count 1) (<= 2 (select (select |#memory_int| ldv_kref_sub_~kref.base) ldv_kref_sub_~kref.offset)))] [2018-02-02 20:36:11,432 INFO L134 CoverageAnalysis]: Checked inductivity of 136 backedges. 16 proven. 0 refuted. 0 times theorem prover too weak. 120 trivial. 0 not checked. [2018-02-02 20:36:11,432 INFO L409 AbstractCegarLoop]: Interpolant automaton has 49 states [2018-02-02 20:36:11,432 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 49 interpolants. [2018-02-02 20:36:11,433 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=120, Invalid=2232, Unknown=0, NotChecked=0, Total=2352 [2018-02-02 20:36:11,433 INFO L87 Difference]: Start difference. First operand 139 states and 141 transitions. Second operand 49 states. [2018-02-02 20:36:13,085 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 20:36:13,086 INFO L93 Difference]: Finished difference Result 119 states and 119 transitions. [2018-02-02 20:36:13,086 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 45 states. [2018-02-02 20:36:13,086 INFO L78 Accepts]: Start accepts. Automaton has 49 states. Word has length 118 [2018-02-02 20:36:13,086 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 20:36:13,087 INFO L225 Difference]: With dead ends: 119 [2018-02-02 20:36:13,087 INFO L226 Difference]: Without dead ends: 119 [2018-02-02 20:36:13,088 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 84 GetRequests, 9 SyntacticMatches, 5 SemanticMatches, 70 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 717 ImplicationChecksByTransitivity, 1.7s TimeCoverageRelationStatistics Valid=249, Invalid=4863, Unknown=0, NotChecked=0, Total=5112 [2018-02-02 20:36:13,089 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 119 states. [2018-02-02 20:36:13,090 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 119 to 119. [2018-02-02 20:36:13,090 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 119 states. [2018-02-02 20:36:13,091 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 119 states to 119 states and 119 transitions. [2018-02-02 20:36:13,091 INFO L78 Accepts]: Start accepts. Automaton has 119 states and 119 transitions. Word has length 118 [2018-02-02 20:36:13,091 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 20:36:13,091 INFO L432 AbstractCegarLoop]: Abstraction has 119 states and 119 transitions. [2018-02-02 20:36:13,091 INFO L433 AbstractCegarLoop]: Interpolant automaton has 49 states. [2018-02-02 20:36:13,091 INFO L276 IsEmpty]: Start isEmpty. Operand 119 states and 119 transitions. [2018-02-02 20:36:13,092 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 119 [2018-02-02 20:36:13,092 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 20:36:13,092 INFO L351 BasicCegarLoop]: trace histogram [16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-02-02 20:36:13,092 INFO L371 AbstractCegarLoop]: === Iteration 40 === [ldv_kref_initErr0RequiresViolation, ldv_kref_initErr1RequiresViolation, ldv_kobject_createErr0RequiresViolation, ldv_kobject_createErr1RequiresViolation, ldv_atomic_sub_returnErr1RequiresViolation, ldv_atomic_sub_returnErr0RequiresViolation, ldv_atomic_sub_returnErr3RequiresViolation, ldv_atomic_sub_returnErr2RequiresViolation, ldv_atomic_add_returnErr0RequiresViolation, ldv_atomic_add_returnErr1RequiresViolation, ldv_atomic_add_returnErr2RequiresViolation, ldv_atomic_add_returnErr3RequiresViolation, ldv_kobject_cleanupErr4RequiresViolation, ldv_kobject_cleanupErr2RequiresViolation, ldv_kobject_cleanupErr5RequiresViolation, ldv_kobject_cleanupErr3RequiresViolation, ldv_kobject_cleanupErr0RequiresViolation, ldv_kobject_cleanupErr1RequiresViolation, mainErr0EnsuresViolation, LDV_INIT_LIST_HEADErr1RequiresViolation, LDV_INIT_LIST_HEADErr3RequiresViolation, LDV_INIT_LIST_HEADErr2RequiresViolation, LDV_INIT_LIST_HEADErr0RequiresViolation]=== [2018-02-02 20:36:13,093 INFO L82 PathProgramCache]: Analyzing trace with hash 222269482, now seen corresponding path program 1 times [2018-02-02 20:36:13,094 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 20:36:13,142 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-02-02 20:36:13,187 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-02-02 20:36:13,230 INFO L410 BasicCegarLoop]: Counterexample might be feasible [2018-02-02 20:36:13,246 WARN L343 cessorBacktranslator]: Generated EnsuresSpecification free ensures #res.base == #ptr.base && #res.offset == #ptr.offset; is not ensure(true) [2018-02-02 20:36:13,252 WARN L343 cessorBacktranslator]: Generated EnsuresSpecification ensures #valid == old(#valid); is not ensure(true) [2018-02-02 20:36:13,269 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 02.02 08:36:13 BoogieIcfgContainer [2018-02-02 20:36:13,269 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-02-02 20:36:13,270 INFO L168 Benchmark]: Toolchain (without parser) took 14116.10 ms. Allocated memory was 396.4 MB in the beginning and 1.0 GB in the end (delta: 649.1 MB). Free memory was 353.1 MB in the beginning and 854.7 MB in the end (delta: -501.6 MB). Peak memory consumption was 147.5 MB. Max. memory is 5.3 GB. [2018-02-02 20:36:13,271 INFO L168 Benchmark]: CDTParser took 0.13 ms. Allocated memory is still 396.4 MB. Free memory is still 359.7 MB. There was no memory consumed. Max. memory is 5.3 GB. [2018-02-02 20:36:13,271 INFO L168 Benchmark]: CACSL2BoogieTranslator took 180.23 ms. Allocated memory is still 396.4 MB. Free memory was 353.1 MB in the beginning and 338.5 MB in the end (delta: 14.5 MB). Peak memory consumption was 14.5 MB. Max. memory is 5.3 GB. [2018-02-02 20:36:13,271 INFO L168 Benchmark]: Boogie Preprocessor took 35.65 ms. Allocated memory is still 396.4 MB. Free memory was 338.5 MB in the beginning and 337.2 MB in the end (delta: 1.3 MB). Peak memory consumption was 1.3 MB. Max. memory is 5.3 GB. [2018-02-02 20:36:13,271 INFO L168 Benchmark]: RCFGBuilder took 316.36 ms. Allocated memory is still 396.4 MB. Free memory was 337.2 MB in the beginning and 298.7 MB in the end (delta: 38.5 MB). Peak memory consumption was 38.5 MB. Max. memory is 5.3 GB. [2018-02-02 20:36:13,271 INFO L168 Benchmark]: TraceAbstraction took 13581.00 ms. Allocated memory was 396.4 MB in the beginning and 1.0 GB in the end (delta: 649.1 MB). Free memory was 298.7 MB in the beginning and 854.7 MB in the end (delta: -555.9 MB). Peak memory consumption was 93.1 MB. Max. memory is 5.3 GB. [2018-02-02 20:36:13,273 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.13 ms. Allocated memory is still 396.4 MB. Free memory is still 359.7 MB. There was no memory consumed. Max. memory is 5.3 GB. * CACSL2BoogieTranslator took 180.23 ms. Allocated memory is still 396.4 MB. Free memory was 353.1 MB in the beginning and 338.5 MB in the end (delta: 14.5 MB). Peak memory consumption was 14.5 MB. Max. memory is 5.3 GB. * Boogie Preprocessor took 35.65 ms. Allocated memory is still 396.4 MB. Free memory was 338.5 MB in the beginning and 337.2 MB in the end (delta: 1.3 MB). Peak memory consumption was 1.3 MB. Max. memory is 5.3 GB. * RCFGBuilder took 316.36 ms. Allocated memory is still 396.4 MB. Free memory was 337.2 MB in the beginning and 298.7 MB in the end (delta: 38.5 MB). Peak memory consumption was 38.5 MB. Max. memory is 5.3 GB. * TraceAbstraction took 13581.00 ms. Allocated memory was 396.4 MB in the beginning and 1.0 GB in the end (delta: 649.1 MB). Free memory was 298.7 MB in the beginning and 854.7 MB in the end (delta: -555.9 MB). Peak memory consumption was 93.1 MB. Max. memory is 5.3 GB. * Results from de.uni_freiburg.informatik.ultimate.boogie.preprocessor: - GenericResult: Unfinished Backtranslation Generated EnsuresSpecification free ensures #res.base == #ptr.base && #res.offset == #ptr.offset; is not ensure(true) - GenericResult: Unfinished Backtranslation Generated EnsuresSpecification ensures #valid == old(#valid); is not ensure(true) * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - UnprovableResult [Line: 1452]: Unable to prove that all allocated memory was freed Unable to prove that all allocated memory was freed Reason: overapproximation of memtrack at line 1452. Possible FailurePath: [L1453] CALL entry_point() [L1445] struct ldv_kobject *kobj; [L1446] CALL, EXPR ldv_kobject_create() [L1406] struct ldv_kobject *kobj; [L1408] CALL, EXPR ldv_malloc(sizeof(*kobj)) VAL [\old(size)=16] [L1073] COND TRUE __VERIFIER_nondet_int() [L1074] EXPR, FCALL malloc(size) VAL [\old(size)=16, malloc(size)={20:0}, size=16] [L1074] RET return malloc(size); VAL [\old(size)=16, \result={20:0}, malloc(size)={20:0}, size=16] [L1408] EXPR ldv_malloc(sizeof(*kobj)) VAL [ldv_malloc(sizeof(*kobj))={20:0}] [L1408] kobj = ldv_malloc(sizeof(*kobj)) [L1409] COND FALSE !(!kobj) VAL [kobj={20:0}] [L1411] FCALL memset(kobj, 0, sizeof(*kobj)) VAL [kobj={20:0}, memset(kobj, 0, sizeof(*kobj))={20:0}] [L1413] CALL ldv_kobject_init(kobj) VAL [kobj={20:0}] [L1394] COND FALSE !(!kobj) VAL [kobj={20:0}, kobj={20:0}] [L1398] CALL ldv_kobject_init_internal(kobj) VAL [kobj={20:0}] [L1380] COND FALSE !(!kobj) VAL [kobj={20:0}, kobj={20:0}] [L1382] CALL ldv_kref_init(&kobj->kref) VAL [kref={20:12}] [L1294] RET, FCALL ((&kref->refcount)->counter) = (1) VAL [kref={20:12}, kref={20:12}] [L1382] ldv_kref_init(&kobj->kref) VAL [kobj={20:0}, kobj={20:0}] [L1383] CALL LDV_INIT_LIST_HEAD(&kobj->entry) VAL [list={20:4}] [L1099] FCALL list->next = list VAL [list={20:4}, list={20:4}] [L1100] FCALL list->prev = list VAL [list={20:4}, list={20:4}] [L1383] RET, FCALL LDV_INIT_LIST_HEAD(&kobj->entry) VAL [kobj={20:0}, kobj={20:0}] [L1413] ldv_kobject_init(kobj) VAL [kobj={20:0}] [L1414] RET return kobj; VAL [\result={20:0}, kobj={20:0}] [L1446] EXPR ldv_kobject_create() VAL [ldv_kobject_create()={20:0}] [L1446] kobj = ldv_kobject_create() [L1447] CALL f_22_get(kobj) VAL [kobj={20:0}] [L1437] CALL ldv_kobject_get(kobj) VAL [kobj={20:0}] [L1373] COND TRUE \read(*kobj) VAL [kobj={20:0}, kobj={20:0}] [L1374] CALL ldv_kref_get(&kobj->kref) VAL [kref={20:12}] [L1308] CALL ldv_atomic_add_return(1, (&kref->refcount)) VAL [\old(i)=1, v={20:12}] [L1255] int temp; VAL [\old(i)=1, i=1, v={20:12}, v={20:12}] [L1256] EXPR, FCALL v->counter VAL [\old(i)=1, i=1, v={20:12}, v={20:12}, v->counter=1] [L1256] temp = v->counter [L1257] temp += i VAL [\old(i)=1, i=1, temp=2, v={20:12}, v={20:12}] [L1258] FCALL v->counter = temp VAL [\old(i)=1, i=1, temp=2, v={20:12}, v={20:12}] [L1259] RET return temp; VAL [\old(i)=1, \result=2, i=1, temp=2, v={20:12}, v={20:12}] [L1308] RET ldv_atomic_add_return(1, (&kref->refcount)) VAL [kref={20:12}, kref={20:12}, ldv_atomic_add_return(1, (&kref->refcount))=2] [L1374] ldv_kref_get(&kobj->kref) VAL [kobj={20:0}, kobj={20:0}] [L1375] RET return kobj; VAL [\result={20:0}, kobj={20:0}, kobj={20:0}] [L1437] RET ldv_kobject_get(kobj) VAL [kobj={20:0}, kobj={20:0}, ldv_kobject_get(kobj)={20:0}] [L1447] f_22_get(kobj) VAL [kobj={20:0}] [L1449] CALL ldv_kobject_put(kobj) VAL [kobj={20:0}] [L1361] COND TRUE \read(*kobj) VAL [kobj={20:0}, kobj={20:0}] [L1363] CALL ldv_kref_put(&kobj->kref, ldv_kobject_release) VAL [kref={20:12}, release={-1:0}] [L1313] CALL, EXPR ldv_kref_sub(kref, 1, release) VAL [\old(count)=1, kref={20:12}, release={-1:0}] [L1281] CALL, EXPR ldv_atomic_sub_return(((int) count), (&kref->refcount)) VAL [\old(i)=1, v={20:12}] [L1264] int temp; VAL [\old(i)=1, i=1, v={20:12}, v={20:12}] [L1265] EXPR, FCALL v->counter VAL [\old(i)=1, i=1, v={20:12}, v={20:12}, v->counter=2] [L1265] temp = v->counter [L1266] temp -= i VAL [\old(i)=1, i=1, temp=1, v={20:12}, v={20:12}] [L1267] FCALL v->counter = temp VAL [\old(i)=1, i=1, temp=1, v={20:12}, v={20:12}] [L1268] RET return temp; VAL [\old(i)=1, \result=1, i=1, temp=1, v={20:12}, v={20:12}] [L1281] EXPR ldv_atomic_sub_return(((int) count), (&kref->refcount)) VAL [\old(count)=1, count=1, kref={20:12}, kref={20:12}, ldv_atomic_sub_return(((int) count), (&kref->refcount))=1, release={-1:0}, release={-1:0}] [L1281] COND FALSE !((ldv_atomic_sub_return(((int) count), (&kref->refcount)) == 0)) [L1285] RET return 0; VAL [\old(count)=1, \result=0, count=1, kref={20:12}, kref={20:12}, release={-1:0}, release={-1:0}] [L1313] EXPR ldv_kref_sub(kref, 1, release) VAL [kref={20:12}, kref={20:12}, ldv_kref_sub(kref, 1, release)=0, release={-1:0}, release={-1:0}] [L1313] RET return ldv_kref_sub(kref, 1, release); [L1363] ldv_kref_put(&kobj->kref, ldv_kobject_release) VAL [kobj={20:0}, kobj={20:0}, ldv_kref_put(&kobj->kref, ldv_kobject_release)=0] [L1449] FCALL ldv_kobject_put(kobj) - StatisticsResult: Ultimate Automizer benchmark data CFG has 22 procedures, 146 locations, 23 error locations. UNSAFE Result, 13.5s OverallTime, 40 OverallIterations, 16 TraceHistogramMax, 6.4s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 5160 SDtfs, 662 SDslu, 43912 SDs, 0 SdLazy, 9336 SolverSat, 161 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 3.8s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 643 GetRequests, 86 SyntacticMatches, 5 SemanticMatches, 552 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1184 ImplicationChecksByTransitivity, 5.6s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=169occurred in iteration=12, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 2040/2720 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s AbstIntTime, 0 AbstIntIterations, 0 AbstIntStrong, NaN AbsIntWeakeningRatio, NaN AbsIntAvgWeakeningVarsNumRemoved, NaN AbsIntAvgWeakenedConjuncts, 0.0s DumpTime, AutomataMinimizationStatistics: 0.1s AutomataMinimizationTime, 39 MinimizatonAttempts, 38 StatesRemovedByMinimization, 8 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.4s SatisfiabilityAnalysisTime, 5.8s InterpolantComputationTime, 2302 NumberOfCodeBlocks, 2302 NumberOfCodeBlocksAsserted, 40 NumberOfCheckSat, 2145 ConstructedInterpolants, 0 QuantifiedInterpolants, 526042 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 39 InterpolantComputations, 24 PerfectInterpolantSequences, 2040/2720 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate could not prove your program: unable to determine feasibility of some traces Written .csv to /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/memleaks_test22_4_false-valid-memtrack_true-termination.i_svcomp-DerefFreeMemtrack-32bit-Automizer_SmtInterpol_Array.epf_AutomizerC.xml/Csv-Benchmark-0-2018-02-02_20-36-13-279.csv Written .csv to /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/memleaks_test22_4_false-valid-memtrack_true-termination.i_svcomp-DerefFreeMemtrack-32bit-Automizer_SmtInterpol_Array.epf_AutomizerC.xml/Csv-TraceAbstractionBenchmarks-0-2018-02-02_20-36-13-279.csv Received shutdown request...