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/cav18-smtinterpol/svcomp-DerefFreeMemtrack-32bit-Automizer_SmtInterpol_Array.epf -i ../../../trunk/examples/svcomp/ldv-memsafety/memleaks_test22_2_true-valid-memsafety_true-termination.i -------------------------------------------------------------------------------- This is Ultimate 0.1.23-26d9e06-m [2018-02-02 10:23:25,253 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-02-02 10:23:25,254 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-02-02 10:23:25,265 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-02-02 10:23:25,265 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-02-02 10:23:25,266 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-02-02 10:23:25,267 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-02-02 10:23:25,269 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-02-02 10:23:25,271 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-02-02 10:23:25,271 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-02-02 10:23:25,272 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-02-02 10:23:25,272 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-02-02 10:23:25,273 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-02-02 10:23:25,274 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-02-02 10:23:25,275 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-02-02 10:23:25,277 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-02-02 10:23:25,278 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-02-02 10:23:25,280 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-02-02 10:23:25,281 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-02-02 10:23:25,282 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-02-02 10:23:25,283 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-02-02 10:23:25,284 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-02-02 10:23:25,284 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-02-02 10:23:25,285 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-02-02 10:23:25,285 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-02-02 10:23:25,286 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-02-02 10:23:25,287 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-02-02 10:23:25,287 INFO L177 SettingsManager]: PEA to Boogie provides no preferences, ignoring... [2018-02-02 10:23:25,287 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-02-02 10:23:25,288 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-02-02 10:23:25,288 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-02-02 10:23:25,288 INFO L98 SettingsManager]: Beginning loading settings from /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/cav18-smtinterpol/svcomp-DerefFreeMemtrack-32bit-Automizer_SmtInterpol_Array.epf [2018-02-02 10:23:25,298 INFO L110 SettingsManager]: Loading preferences was successful [2018-02-02 10:23:25,299 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-02-02 10:23:25,300 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-02-02 10:23:25,300 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-02-02 10:23:25,300 INFO L133 SettingsManager]: * Use SBE=true [2018-02-02 10:23:25,300 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-02-02 10:23:25,300 INFO L133 SettingsManager]: * sizeof long=4 [2018-02-02 10:23:25,300 INFO L133 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2018-02-02 10:23:25,301 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-02-02 10:23:25,301 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-02-02 10:23:25,301 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-02-02 10:23:25,301 INFO L133 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2018-02-02 10:23:25,301 INFO L133 SettingsManager]: * Bitprecise bitfields=true [2018-02-02 10:23:25,301 INFO L133 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2018-02-02 10:23:25,301 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-02-02 10:23:25,302 INFO L133 SettingsManager]: * sizeof long double=12 [2018-02-02 10:23:25,302 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-02-02 10:23:25,302 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-02-02 10:23:25,302 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-02-02 10:23:25,302 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-02-02 10:23:25,302 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-02-02 10:23:25,303 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-02-02 10:23:25,303 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=Craig_TreeInterpolation [2018-02-02 10:23:25,333 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-02-02 10:23:25,344 INFO L266 ainManager$Toolchain]: [Toolchain 1]: Parser(s) successfully initialized [2018-02-02 10:23:25,347 INFO L222 ainManager$Toolchain]: [Toolchain 1]: Toolchain data selected. [2018-02-02 10:23:25,348 INFO L271 PluginConnector]: Initializing CDTParser... [2018-02-02 10:23:25,348 INFO L276 PluginConnector]: CDTParser initialized [2018-02-02 10:23:25,349 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/ldv-memsafety/memleaks_test22_2_true-valid-memsafety_true-termination.i [2018-02-02 10:23:25,493 INFO L304 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-02-02 10:23:25,494 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2018-02-02 10:23:25,495 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-02-02 10:23:25,495 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-02-02 10:23:25,501 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-02-02 10:23:25,502 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 02.02 10:23:25" (1/1) ... [2018-02-02 10:23:25,505 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@48a37773 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.02 10:23:25, skipping insertion in model container [2018-02-02 10:23:25,505 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 02.02 10:23:25" (1/1) ... [2018-02-02 10:23:25,520 INFO L153 Dispatcher]: Using SV-COMP mode [2018-02-02 10:23:25,555 INFO L153 Dispatcher]: Using SV-COMP mode [2018-02-02 10:23:25,649 INFO L450 PostProcessor]: Settings: Checked method=main [2018-02-02 10:23:25,666 INFO L450 PostProcessor]: Settings: Checked method=main [2018-02-02 10:23:25,672 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.02 10:23:25 WrapperNode [2018-02-02 10:23:25,672 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-02-02 10:23:25,673 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-02-02 10:23:25,673 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-02-02 10:23:25,673 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-02-02 10:23:25,682 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.02 10:23:25" (1/1) ... [2018-02-02 10:23:25,683 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.02 10:23:25" (1/1) ... [2018-02-02 10:23:25,695 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.02 10:23:25" (1/1) ... [2018-02-02 10:23:25,695 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.02 10:23:25" (1/1) ... [2018-02-02 10:23:25,700 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.02 10:23:25" (1/1) ... [2018-02-02 10:23:25,702 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.02 10:23:25" (1/1) ... [2018-02-02 10:23:25,703 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.02 10:23:25" (1/1) ... [2018-02-02 10:23:25,705 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-02-02 10:23:25,706 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-02-02 10:23:25,706 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-02-02 10:23:25,706 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-02-02 10:23:25,706 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.02 10:23:25" (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 10:23:25,742 INFO L136 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-02-02 10:23:25,742 INFO L136 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-02-02 10:23:25,743 INFO L136 BoogieDeclarations]: Found implementation of procedure ##fun~$Pointer$~TO~VOID [2018-02-02 10:23:25,743 INFO L136 BoogieDeclarations]: Found implementation of procedure ldv_malloc [2018-02-02 10:23:25,743 INFO L136 BoogieDeclarations]: Found implementation of procedure LDV_INIT_LIST_HEAD [2018-02-02 10:23:25,743 INFO L136 BoogieDeclarations]: Found implementation of procedure ldv_atomic_add_return [2018-02-02 10:23:25,743 INFO L136 BoogieDeclarations]: Found implementation of procedure ldv_atomic_sub_return [2018-02-02 10:23:25,743 INFO L136 BoogieDeclarations]: Found implementation of procedure ldv_kref_sub [2018-02-02 10:23:25,743 INFO L136 BoogieDeclarations]: Found implementation of procedure ldv_kref_init [2018-02-02 10:23:25,743 INFO L136 BoogieDeclarations]: Found implementation of procedure ldv_kref_get [2018-02-02 10:23:25,743 INFO L136 BoogieDeclarations]: Found implementation of procedure ldv_kref_put [2018-02-02 10:23:25,743 INFO L136 BoogieDeclarations]: Found implementation of procedure ldv_kobject_cleanup [2018-02-02 10:23:25,743 INFO L136 BoogieDeclarations]: Found implementation of procedure ldv_kobject_release [2018-02-02 10:23:25,743 INFO L136 BoogieDeclarations]: Found implementation of procedure ldv_kobject_put [2018-02-02 10:23:25,744 INFO L136 BoogieDeclarations]: Found implementation of procedure ldv_kobject_get [2018-02-02 10:23:25,744 INFO L136 BoogieDeclarations]: Found implementation of procedure ldv_kobject_init_internal [2018-02-02 10:23:25,744 INFO L136 BoogieDeclarations]: Found implementation of procedure ldv_kobject_init [2018-02-02 10:23:25,744 INFO L136 BoogieDeclarations]: Found implementation of procedure ldv_kobject_create [2018-02-02 10:23:25,744 INFO L136 BoogieDeclarations]: Found implementation of procedure entry_point [2018-02-02 10:23:25,744 INFO L136 BoogieDeclarations]: Found implementation of procedure main [2018-02-02 10:23:25,744 INFO L128 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2018-02-02 10:23:25,744 INFO L128 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2018-02-02 10:23:25,744 INFO L128 BoogieDeclarations]: Found specification of procedure write~int [2018-02-02 10:23:25,744 INFO L128 BoogieDeclarations]: Found specification of procedure read~int [2018-02-02 10:23:25,744 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.free [2018-02-02 10:23:25,744 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2018-02-02 10:23:25,744 INFO L128 BoogieDeclarations]: Found specification of procedure #Ultimate.alloc [2018-02-02 10:23:25,744 INFO L128 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memset [2018-02-02 10:23:25,745 INFO L136 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memset [2018-02-02 10:23:25,745 INFO L128 BoogieDeclarations]: Found specification of procedure malloc [2018-02-02 10:23:25,745 INFO L128 BoogieDeclarations]: Found specification of procedure free [2018-02-02 10:23:25,745 INFO L128 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2018-02-02 10:23:25,745 INFO L128 BoogieDeclarations]: Found specification of procedure memset [2018-02-02 10:23:25,745 INFO L128 BoogieDeclarations]: Found specification of procedure ldv_malloc [2018-02-02 10:23:25,745 INFO L128 BoogieDeclarations]: Found specification of procedure LDV_INIT_LIST_HEAD [2018-02-02 10:23:25,745 INFO L128 BoogieDeclarations]: Found specification of procedure ldv_atomic_add_return [2018-02-02 10:23:25,745 INFO L128 BoogieDeclarations]: Found specification of procedure ldv_atomic_sub_return [2018-02-02 10:23:25,745 INFO L128 BoogieDeclarations]: Found specification of procedure ldv_kref_sub [2018-02-02 10:23:25,745 INFO L128 BoogieDeclarations]: Found specification of procedure ##fun~$Pointer$~TO~VOID [2018-02-02 10:23:25,745 INFO L128 BoogieDeclarations]: Found specification of procedure ldv_kref_init [2018-02-02 10:23:25,746 INFO L128 BoogieDeclarations]: Found specification of procedure ldv_kref_get [2018-02-02 10:23:25,746 INFO L128 BoogieDeclarations]: Found specification of procedure ldv_kref_put [2018-02-02 10:23:25,746 INFO L128 BoogieDeclarations]: Found specification of procedure ldv_kobject_cleanup [2018-02-02 10:23:25,746 INFO L128 BoogieDeclarations]: Found specification of procedure ldv_kobject_release [2018-02-02 10:23:25,746 INFO L128 BoogieDeclarations]: Found specification of procedure ldv_kobject_put [2018-02-02 10:23:25,746 INFO L128 BoogieDeclarations]: Found specification of procedure ldv_kobject_get [2018-02-02 10:23:25,746 INFO L128 BoogieDeclarations]: Found specification of procedure ldv_kobject_init_internal [2018-02-02 10:23:25,746 INFO L128 BoogieDeclarations]: Found specification of procedure ldv_kobject_init [2018-02-02 10:23:25,746 INFO L128 BoogieDeclarations]: Found specification of procedure ldv_kobject_create [2018-02-02 10:23:25,746 INFO L128 BoogieDeclarations]: Found specification of procedure entry_point [2018-02-02 10:23:25,746 INFO L128 BoogieDeclarations]: Found specification of procedure main [2018-02-02 10:23:25,746 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-02-02 10:23:25,746 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-02-02 10:23:25,957 WARN L455 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2018-02-02 10:23:26,071 INFO L257 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-02-02 10:23:26,072 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 02.02 10:23:26 BoogieIcfgContainer [2018-02-02 10:23:26,072 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-02-02 10:23:26,072 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-02-02 10:23:26,073 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-02-02 10:23:26,075 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-02-02 10:23:26,075 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 02.02 10:23:25" (1/3) ... [2018-02-02 10:23:26,076 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@14894a7d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 02.02 10:23:26, skipping insertion in model container [2018-02-02 10:23:26,076 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.02 10:23:25" (2/3) ... [2018-02-02 10:23:26,076 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@14894a7d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 02.02 10:23:26, skipping insertion in model container [2018-02-02 10:23:26,076 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 02.02 10:23:26" (3/3) ... [2018-02-02 10:23:26,077 INFO L107 eAbstractionObserver]: Analyzing ICFG memleaks_test22_2_true-valid-memsafety_true-termination.i [2018-02-02 10:23:26,083 INFO L128 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:Craig_TreeInterpolation Determinization: PREDICATE_ABSTRACTION [2018-02-02 10:23:26,088 INFO L140 ceAbstractionStarter]: Appying trace abstraction to program that has 23 error locations. [2018-02-02 10:23:26,111 INFO L322 AbstractCegarLoop]: Interprodecural is true [2018-02-02 10:23:26,111 INFO L323 AbstractCegarLoop]: Hoare is false [2018-02-02 10:23:26,111 INFO L324 AbstractCegarLoop]: Compute interpolants for Craig_TreeInterpolation [2018-02-02 10:23:26,111 INFO L325 AbstractCegarLoop]: Backedges is CANONICAL [2018-02-02 10:23:26,111 INFO L326 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-02-02 10:23:26,112 INFO L327 AbstractCegarLoop]: Difference is false [2018-02-02 10:23:26,112 INFO L328 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-02-02 10:23:26,112 INFO L333 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-02-02 10:23:26,112 INFO L87 2NestedWordAutomaton]: Mode: main mode - execution starts in main procedure [2018-02-02 10:23:26,123 INFO L276 IsEmpty]: Start isEmpty. Operand 143 states. [2018-02-02 10:23:26,131 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2018-02-02 10:23:26,131 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 10:23:26,132 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 10:23:26,132 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 10:23:26,135 INFO L82 PathProgramCache]: Analyzing trace with hash -998986606, now seen corresponding path program 1 times [2018-02-02 10:23:26,174 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 10:23:26,209 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 10:23:26,216 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 10:23:26,428 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 10:23:26,430 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-02 10:23:26,430 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-02-02 10:23:26,431 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 10:23:26,431 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 10:23:26,431 INFO L182 omatonBuilderFactory]: Interpolants [146#true, 147#false, 148#(and (= 0 |ldv_malloc_#res.offset|) (= 0 |ldv_malloc_#res.base|)), 149#(and (= 0 |ldv_kobject_create_#t~ret17.base|) (= 0 |ldv_kobject_create_#t~ret17.offset|)), 150#(and (= ldv_kobject_create_~kobj~1.offset 0) (= ldv_kobject_create_~kobj~1.base 0))] [2018-02-02 10:23:26,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 10:23:26,433 INFO L409 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-02-02 10:23:26,446 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-02-02 10:23:26,446 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-02-02 10:23:26,448 INFO L87 Difference]: Start difference. First operand 143 states. Second operand 5 states. [2018-02-02 10:23:26,497 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 10:23:26,497 INFO L93 Difference]: Finished difference Result 149 states and 158 transitions. [2018-02-02 10:23:26,498 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-02-02 10:23:26,499 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 17 [2018-02-02 10:23:26,499 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 10:23:26,511 INFO L225 Difference]: With dead ends: 149 [2018-02-02 10:23:26,511 INFO L226 Difference]: Without dead ends: 146 [2018-02-02 10:23:26,513 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 10:23:26,526 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 146 states. [2018-02-02 10:23:26,542 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 146 to 144. [2018-02-02 10:23:26,543 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 144 states. [2018-02-02 10:23:26,546 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 144 states to 144 states and 153 transitions. [2018-02-02 10:23:26,548 INFO L78 Accepts]: Start accepts. Automaton has 144 states and 153 transitions. Word has length 17 [2018-02-02 10:23:26,548 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 10:23:26,548 INFO L432 AbstractCegarLoop]: Abstraction has 144 states and 153 transitions. [2018-02-02 10:23:26,548 INFO L433 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-02-02 10:23:26,548 INFO L276 IsEmpty]: Start isEmpty. Operand 144 states and 153 transitions. [2018-02-02 10:23:26,549 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2018-02-02 10:23:26,549 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 10:23:26,549 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 10:23:26,549 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 10:23:26,549 INFO L82 PathProgramCache]: Analyzing trace with hash -2077747980, now seen corresponding path program 1 times [2018-02-02 10:23:26,551 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 10:23:26,562 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 10:23:26,563 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 10:23:26,604 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 10:23:26,604 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-02 10:23:26,604 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-02-02 10:23:26,605 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 10:23:26,605 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 10:23:26,605 INFO L182 omatonBuilderFactory]: Interpolants [448#(= 1 (select |#valid| |ldv_kobject_create_#t~ret17.base|)), 449#(= 1 (select |#valid| ldv_kobject_create_~kobj~1.base)), 444#true, 445#false, 446#(= 1 (select |#valid| |ldv_malloc_#t~malloc4.base|)), 447#(= 1 (select |#valid| |ldv_malloc_#res.base|))] [2018-02-02 10:23:26,605 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 10:23:26,607 INFO L409 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-02-02 10:23:26,607 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-02-02 10:23:26,607 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-02-02 10:23:26,607 INFO L87 Difference]: Start difference. First operand 144 states and 153 transitions. Second operand 6 states. [2018-02-02 10:23:26,746 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 10:23:26,746 INFO L93 Difference]: Finished difference Result 145 states and 154 transitions. [2018-02-02 10:23:26,746 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-02-02 10:23:26,747 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 19 [2018-02-02 10:23:26,747 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 10:23:26,748 INFO L225 Difference]: With dead ends: 145 [2018-02-02 10:23:26,748 INFO L226 Difference]: Without dead ends: 145 [2018-02-02 10:23:26,749 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 10:23:26,749 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 145 states. [2018-02-02 10:23:26,756 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 145 to 143. [2018-02-02 10:23:26,756 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 143 states. [2018-02-02 10:23:26,759 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 143 states to 143 states and 152 transitions. [2018-02-02 10:23:26,759 INFO L78 Accepts]: Start accepts. Automaton has 143 states and 152 transitions. Word has length 19 [2018-02-02 10:23:26,760 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 10:23:26,760 INFO L432 AbstractCegarLoop]: Abstraction has 143 states and 152 transitions. [2018-02-02 10:23:26,760 INFO L433 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-02-02 10:23:26,760 INFO L276 IsEmpty]: Start isEmpty. Operand 143 states and 152 transitions. [2018-02-02 10:23:26,760 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2018-02-02 10:23:26,761 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 10:23:26,761 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 10:23:26,761 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 10:23:26,761 INFO L82 PathProgramCache]: Analyzing trace with hash -2077747979, now seen corresponding path program 1 times [2018-02-02 10:23:26,762 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 10:23:26,779 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 10:23:26,781 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 10:23:26,943 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 10:23:26,943 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-02 10:23:26,944 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-02-02 10:23:26,944 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 10:23:26,944 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 10:23:26,944 INFO L182 omatonBuilderFactory]: Interpolants [740#true, 741#false, 742#(and (or (< 0 (div ldv_malloc_~size 4294967296)) (<= |ldv_malloc_#in~size| ldv_malloc_~size)) (or (<= ldv_malloc_~size |ldv_malloc_#in~size|) (<= (+ (div ldv_malloc_~size 4294967296) 1) 0))), 743#(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|))), 744#(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|))), 745#(and (<= 16 (select |#length| |ldv_kobject_create_#t~ret17.base|)) (= 0 |ldv_kobject_create_#t~ret17.offset|)), 746#(and (= ldv_kobject_create_~kobj~1.offset 0) (<= 16 (select |#length| ldv_kobject_create_~kobj~1.base)))] [2018-02-02 10:23:26,944 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 10:23:26,945 INFO L409 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-02-02 10:23:26,945 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-02-02 10:23:26,945 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2018-02-02 10:23:26,945 INFO L87 Difference]: Start difference. First operand 143 states and 152 transitions. Second operand 7 states. [2018-02-02 10:23:27,144 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 10:23:27,145 INFO L93 Difference]: Finished difference Result 144 states and 153 transitions. [2018-02-02 10:23:27,145 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-02-02 10:23:27,145 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 19 [2018-02-02 10:23:27,146 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 10:23:27,147 INFO L225 Difference]: With dead ends: 144 [2018-02-02 10:23:27,147 INFO L226 Difference]: Without dead ends: 144 [2018-02-02 10:23:27,147 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 10:23:27,147 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 144 states. [2018-02-02 10:23:27,156 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 144 to 142. [2018-02-02 10:23:27,156 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 142 states. [2018-02-02 10:23:27,158 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 142 states to 142 states and 151 transitions. [2018-02-02 10:23:27,158 INFO L78 Accepts]: Start accepts. Automaton has 142 states and 151 transitions. Word has length 19 [2018-02-02 10:23:27,158 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 10:23:27,158 INFO L432 AbstractCegarLoop]: Abstraction has 142 states and 151 transitions. [2018-02-02 10:23:27,158 INFO L433 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-02-02 10:23:27,158 INFO L276 IsEmpty]: Start isEmpty. Operand 142 states and 151 transitions. [2018-02-02 10:23:27,161 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2018-02-02 10:23:27,161 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 10:23:27,161 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] [2018-02-02 10:23:27,161 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 10:23:27,162 INFO L82 PathProgramCache]: Analyzing trace with hash -471802203, now seen corresponding path program 1 times [2018-02-02 10:23:27,163 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 10:23:27,174 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 10:23:27,175 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 10:23:27,220 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 10:23:27,221 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-02 10:23:27,221 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-02-02 10:23:27,221 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 10:23:27,221 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 10:23:27,222 INFO L182 omatonBuilderFactory]: Interpolants [1040#(and (= 0 |entry_point_#t~ret19.base|) (= 0 |entry_point_#t~ret19.offset|)), 1041#(and (= 0 entry_point_~kobj~2.base) (= 0 entry_point_~kobj~2.offset)), 1042#(and (= 0 |ldv_kobject_get_#in~kobj.base|) (= 0 |ldv_kobject_get_#in~kobj.offset|)), 1043#(and (= 0 ldv_kobject_get_~kobj.offset) (= ldv_kobject_get_~kobj.base 0)), 1037#true, 1038#false, 1039#(and (= 0 |ldv_kobject_create_#res.base|) (= 0 |ldv_kobject_create_#res.offset|))] [2018-02-02 10:23:27,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 10:23:27,222 INFO L409 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-02-02 10:23:27,222 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-02-02 10:23:27,222 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2018-02-02 10:23:27,222 INFO L87 Difference]: Start difference. First operand 142 states and 151 transitions. Second operand 7 states. [2018-02-02 10:23:27,303 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 10:23:27,303 INFO L93 Difference]: Finished difference Result 159 states and 170 transitions. [2018-02-02 10:23:27,303 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-02-02 10:23:27,304 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 27 [2018-02-02 10:23:27,304 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 10:23:27,305 INFO L225 Difference]: With dead ends: 159 [2018-02-02 10:23:27,305 INFO L226 Difference]: Without dead ends: 159 [2018-02-02 10:23:27,306 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 10:23:27,306 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 159 states. [2018-02-02 10:23:27,315 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 159 to 151. [2018-02-02 10:23:27,315 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 151 states. [2018-02-02 10:23:27,317 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 151 states to 151 states and 160 transitions. [2018-02-02 10:23:27,317 INFO L78 Accepts]: Start accepts. Automaton has 151 states and 160 transitions. Word has length 27 [2018-02-02 10:23:27,317 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 10:23:27,317 INFO L432 AbstractCegarLoop]: Abstraction has 151 states and 160 transitions. [2018-02-02 10:23:27,317 INFO L433 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-02-02 10:23:27,317 INFO L276 IsEmpty]: Start isEmpty. Operand 151 states and 160 transitions. [2018-02-02 10:23:27,318 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2018-02-02 10:23:27,318 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 10:23:27,318 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 10:23:27,319 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 10:23:27,319 INFO L82 PathProgramCache]: Analyzing trace with hash 131109242, now seen corresponding path program 1 times [2018-02-02 10:23:27,320 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 10:23:27,333 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 10:23:27,334 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 10:23:27,401 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 10:23:27,401 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-02 10:23:27,401 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2018-02-02 10:23:27,402 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 10:23:27,402 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 10:23:27,402 INFO L182 omatonBuilderFactory]: Interpolants [1360#(= 1 (select |#valid| |ldv_kobject_init_#in~kobj.base|)), 1361#(= 1 (select |#valid| ldv_kobject_init_~kobj.base)), 1362#(= 1 (select |#valid| |ldv_kobject_init_internal_#in~kobj.base|)), 1363#(= 1 (select |#valid| ldv_kobject_init_internal_~kobj.base)), 1364#(= 1 (select |#valid| |ldv_kref_init_#in~kref.base|)), 1365#(= 1 (select |#valid| ldv_kref_init_~kref.base)), 1356#true, 1357#false, 1358#(= 1 (select |#valid| |#Ultimate.C_memset_#ptr.base|)), 1359#(= 1 (select |#valid| ldv_kobject_create_~kobj~1.base))] [2018-02-02 10:23:27,403 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 10:23:27,403 INFO L409 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-02-02 10:23:27,403 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-02-02 10:23:27,403 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=73, Unknown=0, NotChecked=0, Total=90 [2018-02-02 10:23:27,404 INFO L87 Difference]: Start difference. First operand 151 states and 160 transitions. Second operand 10 states. [2018-02-02 10:23:27,590 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 10:23:27,590 INFO L93 Difference]: Finished difference Result 150 states and 159 transitions. [2018-02-02 10:23:27,590 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-02-02 10:23:27,590 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 34 [2018-02-02 10:23:27,591 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 10:23:27,591 INFO L225 Difference]: With dead ends: 150 [2018-02-02 10:23:27,591 INFO L226 Difference]: Without dead ends: 150 [2018-02-02 10:23:27,591 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 10:23:27,592 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 150 states. [2018-02-02 10:23:27,597 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 150 to 150. [2018-02-02 10:23:27,598 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 150 states. [2018-02-02 10:23:27,599 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 150 states to 150 states and 159 transitions. [2018-02-02 10:23:27,599 INFO L78 Accepts]: Start accepts. Automaton has 150 states and 159 transitions. Word has length 34 [2018-02-02 10:23:27,599 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 10:23:27,599 INFO L432 AbstractCegarLoop]: Abstraction has 150 states and 159 transitions. [2018-02-02 10:23:27,599 INFO L433 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-02-02 10:23:27,600 INFO L276 IsEmpty]: Start isEmpty. Operand 150 states and 159 transitions. [2018-02-02 10:23:27,600 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2018-02-02 10:23:27,600 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 10:23:27,601 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 10:23:27,601 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 10:23:27,601 INFO L82 PathProgramCache]: Analyzing trace with hash 131109243, now seen corresponding path program 1 times [2018-02-02 10:23:27,602 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 10:23:27,613 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 10:23:27,614 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 10:23:27,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 10:23:27,635 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-02 10:23:27,636 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-02-02 10:23:27,636 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 10:23:27,636 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 10:23:27,636 INFO L182 omatonBuilderFactory]: Interpolants [1672#true, 1673#false, 1674#(= |#Ultimate.C_memset_#t~loopctr21| 0), 1675#(<= |#Ultimate.C_memset_#amount| 0)] [2018-02-02 10:23:27,636 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 10:23:27,636 INFO L409 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-02-02 10:23:27,636 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-02-02 10:23:27,636 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-02-02 10:23:27,636 INFO L87 Difference]: Start difference. First operand 150 states and 159 transitions. Second operand 4 states. [2018-02-02 10:23:27,646 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 10:23:27,646 INFO L93 Difference]: Finished difference Result 153 states and 162 transitions. [2018-02-02 10:23:27,663 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-02-02 10:23:27,663 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 34 [2018-02-02 10:23:27,663 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 10:23:27,664 INFO L225 Difference]: With dead ends: 153 [2018-02-02 10:23:27,664 INFO L226 Difference]: Without dead ends: 151 [2018-02-02 10:23:27,665 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 10:23:27,665 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 151 states. [2018-02-02 10:23:27,669 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 151 to 151. [2018-02-02 10:23:27,669 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 151 states. [2018-02-02 10:23:27,670 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 151 states to 151 states and 160 transitions. [2018-02-02 10:23:27,671 INFO L78 Accepts]: Start accepts. Automaton has 151 states and 160 transitions. Word has length 34 [2018-02-02 10:23:27,671 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 10:23:27,671 INFO L432 AbstractCegarLoop]: Abstraction has 151 states and 160 transitions. [2018-02-02 10:23:27,671 INFO L433 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-02-02 10:23:27,671 INFO L276 IsEmpty]: Start isEmpty. Operand 151 states and 160 transitions. [2018-02-02 10:23:27,672 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2018-02-02 10:23:27,672 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 10:23:27,672 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 10:23:27,672 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 10:23:27,672 INFO L82 PathProgramCache]: Analyzing trace with hash -2110897305, now seen corresponding path program 1 times [2018-02-02 10:23:27,673 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 10:23:27,684 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 10:23:27,685 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 10:23:27,730 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 10:23:27,730 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-02 10:23:27,731 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5] total 5 [2018-02-02 10:23:27,731 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 10:23:27,731 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 10:23:27,731 INFO L182 omatonBuilderFactory]: Interpolants [1984#(= |#Ultimate.C_memset_#t~loopctr21| 0), 1985#(<= |#Ultimate.C_memset_#t~loopctr21| 1), 1986#(<= |#Ultimate.C_memset_#amount| 1), 1982#true, 1983#false] [2018-02-02 10:23:27,731 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 10:23:27,731 INFO L409 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-02-02 10:23:27,731 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-02-02 10:23:27,731 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2018-02-02 10:23:27,732 INFO L87 Difference]: Start difference. First operand 151 states and 160 transitions. Second operand 5 states. [2018-02-02 10:23:27,744 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 10:23:27,745 INFO L93 Difference]: Finished difference Result 154 states and 163 transitions. [2018-02-02 10:23:27,745 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-02-02 10:23:27,745 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 35 [2018-02-02 10:23:27,745 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 10:23:27,746 INFO L225 Difference]: With dead ends: 154 [2018-02-02 10:23:27,746 INFO L226 Difference]: Without dead ends: 152 [2018-02-02 10:23:27,746 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 10:23:27,746 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 152 states. [2018-02-02 10:23:27,748 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 152 to 152. [2018-02-02 10:23:27,749 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 152 states. [2018-02-02 10:23:27,749 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 152 states to 152 states and 161 transitions. [2018-02-02 10:23:27,749 INFO L78 Accepts]: Start accepts. Automaton has 152 states and 161 transitions. Word has length 35 [2018-02-02 10:23:27,749 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 10:23:27,750 INFO L432 AbstractCegarLoop]: Abstraction has 152 states and 161 transitions. [2018-02-02 10:23:27,750 INFO L433 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-02-02 10:23:27,750 INFO L276 IsEmpty]: Start isEmpty. Operand 152 states and 161 transitions. [2018-02-02 10:23:27,750 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2018-02-02 10:23:27,750 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 10:23:27,750 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] [2018-02-02 10:23:27,750 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 10:23:27,750 INFO L82 PathProgramCache]: Analyzing trace with hash 1181841647, now seen corresponding path program 1 times [2018-02-02 10:23:27,752 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 10:23:27,762 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 10:23:27,763 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 10:23:27,810 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 10:23:27,810 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-02 10:23:27,811 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-02-02 10:23:27,811 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 10:23:27,811 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 10:23:27,811 INFO L182 omatonBuilderFactory]: Interpolants [2295#true, 2296#false, 2297#(and (= 0 |ldv_kobject_create_#res.base|) (= 0 |ldv_kobject_create_#res.offset|)), 2298#(and (= 0 |entry_point_#t~ret19.base|) (= 0 |entry_point_#t~ret19.offset|)), 2299#(and (= 0 entry_point_~kobj~2.base) (= 0 entry_point_~kobj~2.offset)), 2300#(and (= 0 |ldv_kobject_put_#in~kobj.offset|) (= 0 |ldv_kobject_put_#in~kobj.base|)), 2301#(and (= ldv_kobject_put_~kobj.offset 0) (= 0 ldv_kobject_put_~kobj.base))] [2018-02-02 10:23:27,811 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 10:23:27,811 INFO L409 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-02-02 10:23:27,812 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-02-02 10:23:27,812 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2018-02-02 10:23:27,812 INFO L87 Difference]: Start difference. First operand 152 states and 161 transitions. Second operand 7 states. [2018-02-02 10:23:27,857 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 10:23:27,857 INFO L93 Difference]: Finished difference Result 163 states and 174 transitions. [2018-02-02 10:23:27,858 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-02-02 10:23:27,858 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 36 [2018-02-02 10:23:27,858 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 10:23:27,859 INFO L225 Difference]: With dead ends: 163 [2018-02-02 10:23:27,859 INFO L226 Difference]: Without dead ends: 163 [2018-02-02 10:23:27,859 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 10:23:27,859 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 163 states. [2018-02-02 10:23:27,863 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 163 to 159. [2018-02-02 10:23:27,863 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 159 states. [2018-02-02 10:23:27,864 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 159 states to 159 states and 169 transitions. [2018-02-02 10:23:27,864 INFO L78 Accepts]: Start accepts. Automaton has 159 states and 169 transitions. Word has length 36 [2018-02-02 10:23:27,864 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 10:23:27,864 INFO L432 AbstractCegarLoop]: Abstraction has 159 states and 169 transitions. [2018-02-02 10:23:27,864 INFO L433 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-02-02 10:23:27,864 INFO L276 IsEmpty]: Start isEmpty. Operand 159 states and 169 transitions. [2018-02-02 10:23:27,865 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2018-02-02 10:23:27,865 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 10:23:27,865 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 10:23:27,865 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 10:23:27,866 INFO L82 PathProgramCache]: Analyzing trace with hash 1401343739, now seen corresponding path program 2 times [2018-02-02 10:23:27,867 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 10:23:27,877 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 10:23:27,877 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 10:23:27,906 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 10:23:27,906 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-02 10:23:27,906 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6] total 6 [2018-02-02 10:23:27,907 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 10:23:27,907 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 10:23:27,907 INFO L182 omatonBuilderFactory]: Interpolants [2626#true, 2627#false, 2628#(= |#Ultimate.C_memset_#t~loopctr21| 0), 2629#(<= |#Ultimate.C_memset_#t~loopctr21| 1), 2630#(<= |#Ultimate.C_memset_#t~loopctr21| 2), 2631#(<= |#Ultimate.C_memset_#amount| 2)] [2018-02-02 10:23:27,907 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 10:23:27,907 INFO L409 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-02-02 10:23:27,908 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-02-02 10:23:27,908 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2018-02-02 10:23:27,908 INFO L87 Difference]: Start difference. First operand 159 states and 169 transitions. Second operand 6 states. [2018-02-02 10:23:27,923 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 10:23:27,923 INFO L93 Difference]: Finished difference Result 162 states and 172 transitions. [2018-02-02 10:23:27,924 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-02-02 10:23:27,924 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 36 [2018-02-02 10:23:27,924 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 10:23:27,924 INFO L225 Difference]: With dead ends: 162 [2018-02-02 10:23:27,924 INFO L226 Difference]: Without dead ends: 160 [2018-02-02 10:23:27,925 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 10:23:27,925 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 160 states. [2018-02-02 10:23:27,927 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 160 to 160. [2018-02-02 10:23:27,927 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 160 states. [2018-02-02 10:23:27,928 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 160 states to 160 states and 170 transitions. [2018-02-02 10:23:27,928 INFO L78 Accepts]: Start accepts. Automaton has 160 states and 170 transitions. Word has length 36 [2018-02-02 10:23:27,928 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 10:23:27,928 INFO L432 AbstractCegarLoop]: Abstraction has 160 states and 170 transitions. [2018-02-02 10:23:27,928 INFO L433 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-02-02 10:23:27,929 INFO L276 IsEmpty]: Start isEmpty. Operand 160 states and 170 transitions. [2018-02-02 10:23:27,929 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2018-02-02 10:23:27,929 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 10:23:27,929 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 10:23:27,929 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 10:23:27,930 INFO L82 PathProgramCache]: Analyzing trace with hash -1388333593, now seen corresponding path program 3 times [2018-02-02 10:23:27,930 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 10:23:27,938 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 10:23:27,939 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 10:23:27,972 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 10:23:27,972 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-02 10:23:27,972 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7] total 7 [2018-02-02 10:23:27,973 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 10:23:27,973 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 10:23:27,973 INFO L182 omatonBuilderFactory]: Interpolants [2960#(<= |#Ultimate.C_memset_#t~loopctr21| 2), 2961#(<= |#Ultimate.C_memset_#t~loopctr21| 3), 2962#(<= |#Ultimate.C_memset_#amount| 3), 2956#true, 2957#false, 2958#(= |#Ultimate.C_memset_#t~loopctr21| 0), 2959#(<= |#Ultimate.C_memset_#t~loopctr21| 1)] [2018-02-02 10:23:27,973 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 10:23:27,974 INFO L409 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-02-02 10:23:27,974 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-02-02 10:23:27,974 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2018-02-02 10:23:27,974 INFO L87 Difference]: Start difference. First operand 160 states and 170 transitions. Second operand 7 states. [2018-02-02 10:23:28,008 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 10:23:28,008 INFO L93 Difference]: Finished difference Result 163 states and 173 transitions. [2018-02-02 10:23:28,015 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-02-02 10:23:28,015 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 37 [2018-02-02 10:23:28,015 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 10:23:28,016 INFO L225 Difference]: With dead ends: 163 [2018-02-02 10:23:28,016 INFO L226 Difference]: Without dead ends: 161 [2018-02-02 10:23:28,017 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 10:23:28,017 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 161 states. [2018-02-02 10:23:28,020 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 161 to 161. [2018-02-02 10:23:28,021 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 161 states. [2018-02-02 10:23:28,022 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 161 states to 161 states and 171 transitions. [2018-02-02 10:23:28,022 INFO L78 Accepts]: Start accepts. Automaton has 161 states and 171 transitions. Word has length 37 [2018-02-02 10:23:28,022 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 10:23:28,022 INFO L432 AbstractCegarLoop]: Abstraction has 161 states and 171 transitions. [2018-02-02 10:23:28,022 INFO L433 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-02-02 10:23:28,022 INFO L276 IsEmpty]: Start isEmpty. Operand 161 states and 171 transitions. [2018-02-02 10:23:28,023 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2018-02-02 10:23:28,023 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 10:23:28,023 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 10:23:28,023 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 10:23:28,024 INFO L82 PathProgramCache]: Analyzing trace with hash -1968984965, now seen corresponding path program 4 times [2018-02-02 10:23:28,025 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 10:23:28,036 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 10:23:28,037 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 10:23:28,079 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 10:23:28,079 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-02 10:23:28,079 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8] total 8 [2018-02-02 10:23:28,079 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 10:23:28,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 10:23:28,080 INFO L182 omatonBuilderFactory]: Interpolants [3296#(<= |#Ultimate.C_memset_#amount| 4), 3289#true, 3290#false, 3291#(= |#Ultimate.C_memset_#t~loopctr21| 0), 3292#(<= |#Ultimate.C_memset_#t~loopctr21| 1), 3293#(<= |#Ultimate.C_memset_#t~loopctr21| 2), 3294#(<= |#Ultimate.C_memset_#t~loopctr21| 3), 3295#(<= |#Ultimate.C_memset_#t~loopctr21| 4)] [2018-02-02 10:23:28,080 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 10:23:28,080 INFO L409 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-02-02 10:23:28,081 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-02-02 10:23:28,081 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2018-02-02 10:23:28,081 INFO L87 Difference]: Start difference. First operand 161 states and 171 transitions. Second operand 8 states. [2018-02-02 10:23:28,104 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 10:23:28,104 INFO L93 Difference]: Finished difference Result 164 states and 174 transitions. [2018-02-02 10:23:28,107 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-02-02 10:23:28,107 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 38 [2018-02-02 10:23:28,107 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 10:23:28,108 INFO L225 Difference]: With dead ends: 164 [2018-02-02 10:23:28,108 INFO L226 Difference]: Without dead ends: 162 [2018-02-02 10:23:28,109 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 10:23:28,109 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 162 states. [2018-02-02 10:23:28,113 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 162 to 162. [2018-02-02 10:23:28,113 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 162 states. [2018-02-02 10:23:28,114 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 162 states to 162 states and 172 transitions. [2018-02-02 10:23:28,114 INFO L78 Accepts]: Start accepts. Automaton has 162 states and 172 transitions. Word has length 38 [2018-02-02 10:23:28,114 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 10:23:28,114 INFO L432 AbstractCegarLoop]: Abstraction has 162 states and 172 transitions. [2018-02-02 10:23:28,114 INFO L433 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-02-02 10:23:28,115 INFO L276 IsEmpty]: Start isEmpty. Operand 162 states and 172 transitions. [2018-02-02 10:23:28,115 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2018-02-02 10:23:28,115 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 10:23:28,116 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 10:23:28,116 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 10:23:28,116 INFO L82 PathProgramCache]: Analyzing trace with hash 1505658983, now seen corresponding path program 5 times [2018-02-02 10:23:28,117 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 10:23:28,129 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 10:23:28,130 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 10:23:28,238 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 10:23:28,238 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-02 10:23:28,238 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9] total 9 [2018-02-02 10:23:28,238 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 10:23:28,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 10:23:28,239 INFO L182 omatonBuilderFactory]: Interpolants [3632#(<= |#Ultimate.C_memset_#t~loopctr21| 5), 3633#(<= |#Ultimate.C_memset_#amount| 5), 3625#true, 3626#false, 3627#(= |#Ultimate.C_memset_#t~loopctr21| 0), 3628#(<= |#Ultimate.C_memset_#t~loopctr21| 1), 3629#(<= |#Ultimate.C_memset_#t~loopctr21| 2), 3630#(<= |#Ultimate.C_memset_#t~loopctr21| 3), 3631#(<= |#Ultimate.C_memset_#t~loopctr21| 4)] [2018-02-02 10:23:28,239 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 10:23:28,239 INFO L409 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-02-02 10:23:28,239 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-02-02 10:23:28,240 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2018-02-02 10:23:28,240 INFO L87 Difference]: Start difference. First operand 162 states and 172 transitions. Second operand 9 states. [2018-02-02 10:23:28,281 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 10:23:28,281 INFO L93 Difference]: Finished difference Result 165 states and 175 transitions. [2018-02-02 10:23:28,281 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-02-02 10:23:28,281 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 39 [2018-02-02 10:23:28,281 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 10:23:28,282 INFO L225 Difference]: With dead ends: 165 [2018-02-02 10:23:28,282 INFO L226 Difference]: Without dead ends: 163 [2018-02-02 10:23:28,282 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 10:23:28,282 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 163 states. [2018-02-02 10:23:28,285 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 163 to 163. [2018-02-02 10:23:28,285 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 163 states. [2018-02-02 10:23:28,286 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 163 states to 163 states and 173 transitions. [2018-02-02 10:23:28,286 INFO L78 Accepts]: Start accepts. Automaton has 163 states and 173 transitions. Word has length 39 [2018-02-02 10:23:28,286 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 10:23:28,286 INFO L432 AbstractCegarLoop]: Abstraction has 163 states and 173 transitions. [2018-02-02 10:23:28,286 INFO L433 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-02-02 10:23:28,287 INFO L276 IsEmpty]: Start isEmpty. Operand 163 states and 173 transitions. [2018-02-02 10:23:28,287 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2018-02-02 10:23:28,288 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 10:23:28,288 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 10:23:28,288 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 10:23:28,288 INFO L82 PathProgramCache]: Analyzing trace with hash 1845438971, now seen corresponding path program 6 times [2018-02-02 10:23:28,289 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 10:23:28,300 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 10:23:28,301 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 10:23:28,344 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 10:23:28,344 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-02 10:23:28,344 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10] total 10 [2018-02-02 10:23:28,344 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 10:23:28,344 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 10:23:28,344 INFO L182 omatonBuilderFactory]: Interpolants [3968#(<= |#Ultimate.C_memset_#t~loopctr21| 2), 3969#(<= |#Ultimate.C_memset_#t~loopctr21| 3), 3970#(<= |#Ultimate.C_memset_#t~loopctr21| 4), 3971#(<= |#Ultimate.C_memset_#t~loopctr21| 5), 3972#(<= |#Ultimate.C_memset_#t~loopctr21| 6), 3973#(<= |#Ultimate.C_memset_#amount| 6), 3964#true, 3965#false, 3966#(= |#Ultimate.C_memset_#t~loopctr21| 0), 3967#(<= |#Ultimate.C_memset_#t~loopctr21| 1)] [2018-02-02 10:23:28,345 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 10:23:28,345 INFO L409 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-02-02 10:23:28,345 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-02-02 10:23:28,345 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2018-02-02 10:23:28,345 INFO L87 Difference]: Start difference. First operand 163 states and 173 transitions. Second operand 10 states. [2018-02-02 10:23:28,373 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 10:23:28,373 INFO L93 Difference]: Finished difference Result 166 states and 176 transitions. [2018-02-02 10:23:28,374 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-02-02 10:23:28,374 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 40 [2018-02-02 10:23:28,374 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 10:23:28,374 INFO L225 Difference]: With dead ends: 166 [2018-02-02 10:23:28,374 INFO L226 Difference]: Without dead ends: 164 [2018-02-02 10:23:28,375 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 10:23:28,375 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 164 states. [2018-02-02 10:23:28,378 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 164 to 164. [2018-02-02 10:23:28,378 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 164 states. [2018-02-02 10:23:28,379 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 164 states to 164 states and 174 transitions. [2018-02-02 10:23:28,379 INFO L78 Accepts]: Start accepts. Automaton has 164 states and 174 transitions. Word has length 40 [2018-02-02 10:23:28,379 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 10:23:28,379 INFO L432 AbstractCegarLoop]: Abstraction has 164 states and 174 transitions. [2018-02-02 10:23:28,379 INFO L433 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-02-02 10:23:28,380 INFO L276 IsEmpty]: Start isEmpty. Operand 164 states and 174 transitions. [2018-02-02 10:23:28,380 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2018-02-02 10:23:28,380 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 10:23:28,380 INFO L351 BasicCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-02 10:23:28,380 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 10:23:28,381 INFO L82 PathProgramCache]: Analyzing trace with hash -1379512829, now seen corresponding path program 1 times [2018-02-02 10:23:28,381 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 10:23:28,390 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 10:23:28,392 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 10:23:28,428 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2018-02-02 10:23:28,429 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-02 10:23:28,429 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-02-02 10:23:28,429 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 10:23:28,429 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2018-02-02 10:23:28,429 INFO L182 omatonBuilderFactory]: Interpolants [4306#true, 4307#false, 4308#(= |#valid| |old(#valid)|)] [2018-02-02 10:23:28,430 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2018-02-02 10:23:28,430 INFO L409 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-02-02 10:23:28,430 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-02-02 10:23:28,430 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-02-02 10:23:28,430 INFO L87 Difference]: Start difference. First operand 164 states and 174 transitions. Second operand 3 states. [2018-02-02 10:23:28,527 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 10:23:28,527 INFO L93 Difference]: Finished difference Result 182 states and 195 transitions. [2018-02-02 10:23:28,528 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-02-02 10:23:28,528 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 39 [2018-02-02 10:23:28,528 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 10:23:28,529 INFO L225 Difference]: With dead ends: 182 [2018-02-02 10:23:28,529 INFO L226 Difference]: Without dead ends: 168 [2018-02-02 10:23:28,529 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 11 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 10:23:28,530 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 168 states. [2018-02-02 10:23:28,534 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 168 to 160. [2018-02-02 10:23:28,534 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 160 states. [2018-02-02 10:23:28,535 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 160 states to 160 states and 169 transitions. [2018-02-02 10:23:28,535 INFO L78 Accepts]: Start accepts. Automaton has 160 states and 169 transitions. Word has length 39 [2018-02-02 10:23:28,535 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 10:23:28,535 INFO L432 AbstractCegarLoop]: Abstraction has 160 states and 169 transitions. [2018-02-02 10:23:28,535 INFO L433 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-02-02 10:23:28,535 INFO L276 IsEmpty]: Start isEmpty. Operand 160 states and 169 transitions. [2018-02-02 10:23:28,536 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2018-02-02 10:23:28,536 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 10:23:28,536 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 10:23:28,536 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 10:23:28,536 INFO L82 PathProgramCache]: Analyzing trace with hash -506283289, now seen corresponding path program 7 times [2018-02-02 10:23:28,537 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 10:23:28,553 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 10:23:28,554 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 10:23:28,623 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 10:23:28,623 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-02 10:23:28,623 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [11] total 11 [2018-02-02 10:23:28,624 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 10:23:28,624 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 10:23:28,624 INFO L182 omatonBuilderFactory]: Interpolants [4656#(<= |#Ultimate.C_memset_#t~loopctr21| 3), 4657#(<= |#Ultimate.C_memset_#t~loopctr21| 4), 4658#(<= |#Ultimate.C_memset_#t~loopctr21| 5), 4659#(<= |#Ultimate.C_memset_#t~loopctr21| 6), 4660#(<= |#Ultimate.C_memset_#t~loopctr21| 7), 4661#(<= |#Ultimate.C_memset_#amount| 7), 4651#true, 4652#false, 4653#(= |#Ultimate.C_memset_#t~loopctr21| 0), 4654#(<= |#Ultimate.C_memset_#t~loopctr21| 1), 4655#(<= |#Ultimate.C_memset_#t~loopctr21| 2)] [2018-02-02 10:23:28,624 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 10:23:28,624 INFO L409 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-02-02 10:23:28,624 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-02-02 10:23:28,624 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=63, Unknown=0, NotChecked=0, Total=110 [2018-02-02 10:23:28,625 INFO L87 Difference]: Start difference. First operand 160 states and 169 transitions. Second operand 11 states. [2018-02-02 10:23:28,653 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 10:23:28,653 INFO L93 Difference]: Finished difference Result 163 states and 172 transitions. [2018-02-02 10:23:28,653 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-02-02 10:23:28,653 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 41 [2018-02-02 10:23:28,653 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 10:23:28,654 INFO L225 Difference]: With dead ends: 163 [2018-02-02 10:23:28,654 INFO L226 Difference]: Without dead ends: 161 [2018-02-02 10:23:28,657 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 10:23:28,657 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 161 states. [2018-02-02 10:23:28,660 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 161 to 161. [2018-02-02 10:23:28,660 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 161 states. [2018-02-02 10:23:28,661 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 161 states to 161 states and 170 transitions. [2018-02-02 10:23:28,661 INFO L78 Accepts]: Start accepts. Automaton has 161 states and 170 transitions. Word has length 41 [2018-02-02 10:23:28,662 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 10:23:28,662 INFO L432 AbstractCegarLoop]: Abstraction has 161 states and 170 transitions. [2018-02-02 10:23:28,662 INFO L433 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-02-02 10:23:28,662 INFO L276 IsEmpty]: Start isEmpty. Operand 161 states and 170 transitions. [2018-02-02 10:23:28,662 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2018-02-02 10:23:28,662 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 10:23:28,663 INFO L351 BasicCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-02 10:23:28,663 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 10:23:28,663 INFO L82 PathProgramCache]: Analyzing trace with hash -495427355, now seen corresponding path program 1 times [2018-02-02 10:23:28,664 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 10:23:28,668 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 10:23:28,669 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 10:23:28,694 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2018-02-02 10:23:28,694 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-02 10:23:28,694 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-02-02 10:23:28,694 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 10:23:28,694 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2018-02-02 10:23:28,694 INFO L182 omatonBuilderFactory]: Interpolants [4992#(not (= |ldv_kobject_create_#t~ret17.base| 0)), 4993#(not (= ldv_kobject_create_~kobj~1.base 0)), 4988#true, 4989#false, 4990#(not (= |ldv_malloc_#t~malloc4.base| 0)), 4991#(not (= |ldv_malloc_#res.base| 0))] [2018-02-02 10:23:28,695 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2018-02-02 10:23:28,695 INFO L409 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-02-02 10:23:28,695 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-02-02 10:23:28,695 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-02-02 10:23:28,695 INFO L87 Difference]: Start difference. First operand 161 states and 170 transitions. Second operand 6 states. [2018-02-02 10:23:28,710 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 10:23:28,710 INFO L93 Difference]: Finished difference Result 145 states and 152 transitions. [2018-02-02 10:23:28,710 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-02-02 10:23:28,710 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 41 [2018-02-02 10:23:28,710 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 10:23:28,711 INFO L225 Difference]: With dead ends: 145 [2018-02-02 10:23:28,711 INFO L226 Difference]: Without dead ends: 145 [2018-02-02 10:23:28,711 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 10:23:28,712 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 145 states. [2018-02-02 10:23:28,714 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 145 to 145. [2018-02-02 10:23:28,714 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 145 states. [2018-02-02 10:23:28,715 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 145 states to 145 states and 152 transitions. [2018-02-02 10:23:28,715 INFO L78 Accepts]: Start accepts. Automaton has 145 states and 152 transitions. Word has length 41 [2018-02-02 10:23:28,715 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 10:23:28,715 INFO L432 AbstractCegarLoop]: Abstraction has 145 states and 152 transitions. [2018-02-02 10:23:28,715 INFO L433 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-02-02 10:23:28,715 INFO L276 IsEmpty]: Start isEmpty. Operand 145 states and 152 transitions. [2018-02-02 10:23:28,716 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2018-02-02 10:23:28,716 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 10:23:28,716 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 10:23:28,716 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 10:23:28,716 INFO L82 PathProgramCache]: Analyzing trace with hash -395229317, now seen corresponding path program 8 times [2018-02-02 10:23:28,717 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 10:23:28,728 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 10:23:28,728 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 10:23:28,807 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 10:23:28,807 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-02 10:23:28,807 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [12] total 12 [2018-02-02 10:23:28,807 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 10:23:28,807 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 10:23:28,807 INFO L182 omatonBuilderFactory]: Interpolants [5296#(<= |#Ultimate.C_memset_#t~loopctr21| 8), 5297#(<= |#Ultimate.C_memset_#amount| 8), 5286#true, 5287#false, 5288#(= |#Ultimate.C_memset_#t~loopctr21| 0), 5289#(<= |#Ultimate.C_memset_#t~loopctr21| 1), 5290#(<= |#Ultimate.C_memset_#t~loopctr21| 2), 5291#(<= |#Ultimate.C_memset_#t~loopctr21| 3), 5292#(<= |#Ultimate.C_memset_#t~loopctr21| 4), 5293#(<= |#Ultimate.C_memset_#t~loopctr21| 5), 5294#(<= |#Ultimate.C_memset_#t~loopctr21| 6), 5295#(<= |#Ultimate.C_memset_#t~loopctr21| 7)] [2018-02-02 10:23:28,808 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 10:23:28,808 INFO L409 AbstractCegarLoop]: Interpolant automaton has 12 states [2018-02-02 10:23:28,808 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2018-02-02 10:23:28,808 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=75, Unknown=0, NotChecked=0, Total=132 [2018-02-02 10:23:28,808 INFO L87 Difference]: Start difference. First operand 145 states and 152 transitions. Second operand 12 states. [2018-02-02 10:23:28,842 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 10:23:28,842 INFO L93 Difference]: Finished difference Result 148 states and 155 transitions. [2018-02-02 10:23:28,842 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-02-02 10:23:28,842 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 42 [2018-02-02 10:23:28,842 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 10:23:28,843 INFO L225 Difference]: With dead ends: 148 [2018-02-02 10:23:28,843 INFO L226 Difference]: Without dead ends: 146 [2018-02-02 10:23:28,844 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 10:23:28,844 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 146 states. [2018-02-02 10:23:28,846 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 146 to 146. [2018-02-02 10:23:28,846 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 146 states. [2018-02-02 10:23:28,849 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 146 states to 146 states and 153 transitions. [2018-02-02 10:23:28,849 INFO L78 Accepts]: Start accepts. Automaton has 146 states and 153 transitions. Word has length 42 [2018-02-02 10:23:28,849 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 10:23:28,849 INFO L432 AbstractCegarLoop]: Abstraction has 146 states and 153 transitions. [2018-02-02 10:23:28,849 INFO L433 AbstractCegarLoop]: Interpolant automaton has 12 states. [2018-02-02 10:23:28,849 INFO L276 IsEmpty]: Start isEmpty. Operand 146 states and 153 transitions. [2018-02-02 10:23:28,850 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2018-02-02 10:23:28,850 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 10:23:28,850 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 10:23:28,850 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 10:23:28,850 INFO L82 PathProgramCache]: Analyzing trace with hash -1247523481, now seen corresponding path program 9 times [2018-02-02 10:23:28,851 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 10:23:28,864 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 10:23:28,865 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 10:23:28,943 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 10:23:28,943 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-02 10:23:28,943 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [13] total 13 [2018-02-02 10:23:28,943 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 10:23:28,944 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 10:23:28,944 INFO L182 omatonBuilderFactory]: Interpolants [5600#(<= |#Ultimate.C_memset_#t~loopctr21| 4), 5601#(<= |#Ultimate.C_memset_#t~loopctr21| 5), 5602#(<= |#Ultimate.C_memset_#t~loopctr21| 6), 5603#(<= |#Ultimate.C_memset_#t~loopctr21| 7), 5604#(<= |#Ultimate.C_memset_#t~loopctr21| 8), 5605#(<= |#Ultimate.C_memset_#t~loopctr21| 9), 5606#(<= |#Ultimate.C_memset_#amount| 9), 5594#true, 5595#false, 5596#(= |#Ultimate.C_memset_#t~loopctr21| 0), 5597#(<= |#Ultimate.C_memset_#t~loopctr21| 1), 5598#(<= |#Ultimate.C_memset_#t~loopctr21| 2), 5599#(<= |#Ultimate.C_memset_#t~loopctr21| 3)] [2018-02-02 10:23:28,944 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 10:23:28,944 INFO L409 AbstractCegarLoop]: Interpolant automaton has 13 states [2018-02-02 10:23:28,944 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2018-02-02 10:23:28,944 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=68, Invalid=88, Unknown=0, NotChecked=0, Total=156 [2018-02-02 10:23:28,945 INFO L87 Difference]: Start difference. First operand 146 states and 153 transitions. Second operand 13 states. [2018-02-02 10:23:28,978 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 10:23:28,979 INFO L93 Difference]: Finished difference Result 149 states and 156 transitions. [2018-02-02 10:23:28,979 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2018-02-02 10:23:28,979 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 43 [2018-02-02 10:23:28,979 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 10:23:28,980 INFO L225 Difference]: With dead ends: 149 [2018-02-02 10:23:28,980 INFO L226 Difference]: Without dead ends: 147 [2018-02-02 10:23:28,981 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 10:23:28,981 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 147 states. [2018-02-02 10:23:28,983 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 147 to 147. [2018-02-02 10:23:28,984 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 147 states. [2018-02-02 10:23:28,984 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 147 states to 147 states and 154 transitions. [2018-02-02 10:23:28,985 INFO L78 Accepts]: Start accepts. Automaton has 147 states and 154 transitions. Word has length 43 [2018-02-02 10:23:28,985 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 10:23:28,985 INFO L432 AbstractCegarLoop]: Abstraction has 147 states and 154 transitions. [2018-02-02 10:23:28,985 INFO L433 AbstractCegarLoop]: Interpolant automaton has 13 states. [2018-02-02 10:23:28,985 INFO L276 IsEmpty]: Start isEmpty. Operand 147 states and 154 transitions. [2018-02-02 10:23:28,986 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2018-02-02 10:23:28,986 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 10:23:28,986 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 10:23:28,986 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 10:23:28,986 INFO L82 PathProgramCache]: Analyzing trace with hash -1898838789, now seen corresponding path program 10 times [2018-02-02 10:23:28,987 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 10:23:28,999 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 10:23:29,000 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 10:23:29,106 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 10:23:29,106 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-02 10:23:29,106 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [14] total 14 [2018-02-02 10:23:29,106 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 10:23:29,106 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 10:23:29,106 INFO L182 omatonBuilderFactory]: Interpolants [5905#true, 5906#false, 5907#(= |#Ultimate.C_memset_#t~loopctr21| 0), 5908#(<= |#Ultimate.C_memset_#t~loopctr21| 1), 5909#(<= |#Ultimate.C_memset_#t~loopctr21| 2), 5910#(<= |#Ultimate.C_memset_#t~loopctr21| 3), 5911#(<= |#Ultimate.C_memset_#t~loopctr21| 4), 5912#(<= |#Ultimate.C_memset_#t~loopctr21| 5), 5913#(<= |#Ultimate.C_memset_#t~loopctr21| 6), 5914#(<= |#Ultimate.C_memset_#t~loopctr21| 7), 5915#(<= |#Ultimate.C_memset_#t~loopctr21| 8), 5916#(<= |#Ultimate.C_memset_#t~loopctr21| 9), 5917#(<= |#Ultimate.C_memset_#t~loopctr21| 10), 5918#(<= |#Ultimate.C_memset_#amount| 10)] [2018-02-02 10:23:29,106 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 10:23:29,107 INFO L409 AbstractCegarLoop]: Interpolant automaton has 14 states [2018-02-02 10:23:29,107 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2018-02-02 10:23:29,107 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=80, Invalid=102, Unknown=0, NotChecked=0, Total=182 [2018-02-02 10:23:29,107 INFO L87 Difference]: Start difference. First operand 147 states and 154 transitions. Second operand 14 states. [2018-02-02 10:23:29,151 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 10:23:29,151 INFO L93 Difference]: Finished difference Result 150 states and 157 transitions. [2018-02-02 10:23:29,157 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2018-02-02 10:23:29,157 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 44 [2018-02-02 10:23:29,158 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 10:23:29,158 INFO L225 Difference]: With dead ends: 150 [2018-02-02 10:23:29,158 INFO L226 Difference]: Without dead ends: 148 [2018-02-02 10:23:29,158 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=84, Invalid=126, Unknown=0, NotChecked=0, Total=210 [2018-02-02 10:23:29,158 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 148 states. [2018-02-02 10:23:29,160 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 148 to 148. [2018-02-02 10:23:29,160 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 148 states. [2018-02-02 10:23:29,160 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 148 states to 148 states and 155 transitions. [2018-02-02 10:23:29,161 INFO L78 Accepts]: Start accepts. Automaton has 148 states and 155 transitions. Word has length 44 [2018-02-02 10:23:29,161 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 10:23:29,161 INFO L432 AbstractCegarLoop]: Abstraction has 148 states and 155 transitions. [2018-02-02 10:23:29,161 INFO L433 AbstractCegarLoop]: Interpolant automaton has 14 states. [2018-02-02 10:23:29,161 INFO L276 IsEmpty]: Start isEmpty. Operand 148 states and 155 transitions. [2018-02-02 10:23:29,161 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2018-02-02 10:23:29,161 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 10:23:29,162 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 10:23:29,162 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 10:23:29,162 INFO L82 PathProgramCache]: Analyzing trace with hash -614776857, now seen corresponding path program 11 times [2018-02-02 10:23:29,163 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 10:23:29,170 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 10:23:29,171 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 10:23:29,270 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 10:23:29,270 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-02 10:23:29,270 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [15] total 15 [2018-02-02 10:23:29,270 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 10:23:29,271 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 10:23:29,271 INFO L182 omatonBuilderFactory]: Interpolants [6219#true, 6220#false, 6221#(= |#Ultimate.C_memset_#t~loopctr21| 0), 6222#(<= |#Ultimate.C_memset_#t~loopctr21| 1), 6223#(<= |#Ultimate.C_memset_#t~loopctr21| 2), 6224#(<= |#Ultimate.C_memset_#t~loopctr21| 3), 6225#(<= |#Ultimate.C_memset_#t~loopctr21| 4), 6226#(<= |#Ultimate.C_memset_#t~loopctr21| 5), 6227#(<= |#Ultimate.C_memset_#t~loopctr21| 6), 6228#(<= |#Ultimate.C_memset_#t~loopctr21| 7), 6229#(<= |#Ultimate.C_memset_#t~loopctr21| 8), 6230#(<= |#Ultimate.C_memset_#t~loopctr21| 9), 6231#(<= |#Ultimate.C_memset_#t~loopctr21| 10), 6232#(<= |#Ultimate.C_memset_#t~loopctr21| 11), 6233#(<= |#Ultimate.C_memset_#amount| 11)] [2018-02-02 10:23:29,271 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 10:23:29,271 INFO L409 AbstractCegarLoop]: Interpolant automaton has 15 states [2018-02-02 10:23:29,271 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2018-02-02 10:23:29,271 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=93, Invalid=117, Unknown=0, NotChecked=0, Total=210 [2018-02-02 10:23:29,271 INFO L87 Difference]: Start difference. First operand 148 states and 155 transitions. Second operand 15 states. [2018-02-02 10:23:29,296 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 10:23:29,296 INFO L93 Difference]: Finished difference Result 151 states and 158 transitions. [2018-02-02 10:23:29,296 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2018-02-02 10:23:29,296 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 45 [2018-02-02 10:23:29,296 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 10:23:29,297 INFO L225 Difference]: With dead ends: 151 [2018-02-02 10:23:29,297 INFO L226 Difference]: Without dead ends: 149 [2018-02-02 10:23:29,297 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=97, Invalid=143, Unknown=0, NotChecked=0, Total=240 [2018-02-02 10:23:29,297 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 149 states. [2018-02-02 10:23:29,311 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 149 to 149. [2018-02-02 10:23:29,311 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 149 states. [2018-02-02 10:23:29,312 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 149 states to 149 states and 156 transitions. [2018-02-02 10:23:29,312 INFO L78 Accepts]: Start accepts. Automaton has 149 states and 156 transitions. Word has length 45 [2018-02-02 10:23:29,312 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 10:23:29,313 INFO L432 AbstractCegarLoop]: Abstraction has 149 states and 156 transitions. [2018-02-02 10:23:29,313 INFO L433 AbstractCegarLoop]: Interpolant automaton has 15 states. [2018-02-02 10:23:29,313 INFO L276 IsEmpty]: Start isEmpty. Operand 149 states and 156 transitions. [2018-02-02 10:23:29,313 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2018-02-02 10:23:29,313 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 10:23:29,313 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 10:23:29,313 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 10:23:29,314 INFO L82 PathProgramCache]: Analyzing trace with hash 536437371, now seen corresponding path program 12 times [2018-02-02 10:23:29,315 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 10:23:29,331 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 10:23:29,332 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 10:23:29,444 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 10:23:29,445 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-02 10:23:29,445 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [16] total 16 [2018-02-02 10:23:29,445 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 10:23:29,445 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 10:23:29,446 INFO L182 omatonBuilderFactory]: Interpolants [6536#true, 6537#false, 6538#(= |#Ultimate.C_memset_#t~loopctr21| 0), 6539#(<= |#Ultimate.C_memset_#t~loopctr21| 1), 6540#(<= |#Ultimate.C_memset_#t~loopctr21| 2), 6541#(<= |#Ultimate.C_memset_#t~loopctr21| 3), 6542#(<= |#Ultimate.C_memset_#t~loopctr21| 4), 6543#(<= |#Ultimate.C_memset_#t~loopctr21| 5), 6544#(<= |#Ultimate.C_memset_#t~loopctr21| 6), 6545#(<= |#Ultimate.C_memset_#t~loopctr21| 7), 6546#(<= |#Ultimate.C_memset_#t~loopctr21| 8), 6547#(<= |#Ultimate.C_memset_#t~loopctr21| 9), 6548#(<= |#Ultimate.C_memset_#t~loopctr21| 10), 6549#(<= |#Ultimate.C_memset_#t~loopctr21| 11), 6550#(<= |#Ultimate.C_memset_#t~loopctr21| 12), 6551#(<= |#Ultimate.C_memset_#amount| 12)] [2018-02-02 10:23:29,446 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 10:23:29,446 INFO L409 AbstractCegarLoop]: Interpolant automaton has 16 states [2018-02-02 10:23:29,446 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2018-02-02 10:23:29,446 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=107, Invalid=133, Unknown=0, NotChecked=0, Total=240 [2018-02-02 10:23:29,447 INFO L87 Difference]: Start difference. First operand 149 states and 156 transitions. Second operand 16 states. [2018-02-02 10:23:29,485 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 10:23:29,485 INFO L93 Difference]: Finished difference Result 152 states and 159 transitions. [2018-02-02 10:23:29,485 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2018-02-02 10:23:29,485 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 46 [2018-02-02 10:23:29,485 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 10:23:29,486 INFO L225 Difference]: With dead ends: 152 [2018-02-02 10:23:29,486 INFO L226 Difference]: Without dead ends: 150 [2018-02-02 10:23:29,486 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 10:23:29,487 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 150 states. [2018-02-02 10:23:29,489 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 150 to 150. [2018-02-02 10:23:29,489 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 150 states. [2018-02-02 10:23:29,490 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 150 states to 150 states and 157 transitions. [2018-02-02 10:23:29,490 INFO L78 Accepts]: Start accepts. Automaton has 150 states and 157 transitions. Word has length 46 [2018-02-02 10:23:29,490 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 10:23:29,490 INFO L432 AbstractCegarLoop]: Abstraction has 150 states and 157 transitions. [2018-02-02 10:23:29,490 INFO L433 AbstractCegarLoop]: Interpolant automaton has 16 states. [2018-02-02 10:23:29,490 INFO L276 IsEmpty]: Start isEmpty. Operand 150 states and 157 transitions. [2018-02-02 10:23:29,491 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2018-02-02 10:23:29,491 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 10:23:29,491 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 10:23:29,491 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 10:23:29,491 INFO L82 PathProgramCache]: Analyzing trace with hash 1864340071, now seen corresponding path program 13 times [2018-02-02 10:23:29,492 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 10:23:29,504 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 10:23:29,505 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 10:23:29,615 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 10:23:29,615 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-02 10:23:29,615 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [17] total 17 [2018-02-02 10:23:29,615 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 10:23:29,616 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 10:23:29,616 INFO L182 omatonBuilderFactory]: Interpolants [6856#true, 6857#false, 6858#(= |#Ultimate.C_memset_#t~loopctr21| 0), 6859#(<= |#Ultimate.C_memset_#t~loopctr21| 1), 6860#(<= |#Ultimate.C_memset_#t~loopctr21| 2), 6861#(<= |#Ultimate.C_memset_#t~loopctr21| 3), 6862#(<= |#Ultimate.C_memset_#t~loopctr21| 4), 6863#(<= |#Ultimate.C_memset_#t~loopctr21| 5), 6864#(<= |#Ultimate.C_memset_#t~loopctr21| 6), 6865#(<= |#Ultimate.C_memset_#t~loopctr21| 7), 6866#(<= |#Ultimate.C_memset_#t~loopctr21| 8), 6867#(<= |#Ultimate.C_memset_#t~loopctr21| 9), 6868#(<= |#Ultimate.C_memset_#t~loopctr21| 10), 6869#(<= |#Ultimate.C_memset_#t~loopctr21| 11), 6870#(<= |#Ultimate.C_memset_#t~loopctr21| 12), 6871#(<= |#Ultimate.C_memset_#t~loopctr21| 13), 6872#(<= |#Ultimate.C_memset_#amount| 13)] [2018-02-02 10:23:29,616 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 10:23:29,616 INFO L409 AbstractCegarLoop]: Interpolant automaton has 17 states [2018-02-02 10:23:29,616 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2018-02-02 10:23:29,617 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=122, Invalid=150, Unknown=0, NotChecked=0, Total=272 [2018-02-02 10:23:29,617 INFO L87 Difference]: Start difference. First operand 150 states and 157 transitions. Second operand 17 states. [2018-02-02 10:23:29,653 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 10:23:29,653 INFO L93 Difference]: Finished difference Result 153 states and 160 transitions. [2018-02-02 10:23:29,655 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2018-02-02 10:23:29,655 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 47 [2018-02-02 10:23:29,655 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 10:23:29,656 INFO L225 Difference]: With dead ends: 153 [2018-02-02 10:23:29,656 INFO L226 Difference]: Without dead ends: 151 [2018-02-02 10:23:29,656 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 10:23:29,657 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 151 states. [2018-02-02 10:23:29,659 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 151 to 151. [2018-02-02 10:23:29,659 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 151 states. [2018-02-02 10:23:29,660 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 151 states to 151 states and 158 transitions. [2018-02-02 10:23:29,660 INFO L78 Accepts]: Start accepts. Automaton has 151 states and 158 transitions. Word has length 47 [2018-02-02 10:23:29,660 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 10:23:29,660 INFO L432 AbstractCegarLoop]: Abstraction has 151 states and 158 transitions. [2018-02-02 10:23:29,660 INFO L433 AbstractCegarLoop]: Interpolant automaton has 17 states. [2018-02-02 10:23:29,660 INFO L276 IsEmpty]: Start isEmpty. Operand 151 states and 158 transitions. [2018-02-02 10:23:29,661 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2018-02-02 10:23:29,661 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 10:23:29,661 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 10:23:29,661 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 10:23:29,661 INFO L82 PathProgramCache]: Analyzing trace with hash 79650811, now seen corresponding path program 14 times [2018-02-02 10:23:29,662 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 10:23:29,677 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 10:23:29,677 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 10:23:29,801 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 10:23:29,801 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-02 10:23:29,801 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [18] total 18 [2018-02-02 10:23:29,801 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 10:23:29,802 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 10:23:29,802 INFO L182 omatonBuilderFactory]: Interpolants [7179#true, 7180#false, 7181#(= |#Ultimate.C_memset_#t~loopctr21| 0), 7182#(<= |#Ultimate.C_memset_#t~loopctr21| 1), 7183#(<= |#Ultimate.C_memset_#t~loopctr21| 2), 7184#(<= |#Ultimate.C_memset_#t~loopctr21| 3), 7185#(<= |#Ultimate.C_memset_#t~loopctr21| 4), 7186#(<= |#Ultimate.C_memset_#t~loopctr21| 5), 7187#(<= |#Ultimate.C_memset_#t~loopctr21| 6), 7188#(<= |#Ultimate.C_memset_#t~loopctr21| 7), 7189#(<= |#Ultimate.C_memset_#t~loopctr21| 8), 7190#(<= |#Ultimate.C_memset_#t~loopctr21| 9), 7191#(<= |#Ultimate.C_memset_#t~loopctr21| 10), 7192#(<= |#Ultimate.C_memset_#t~loopctr21| 11), 7193#(<= |#Ultimate.C_memset_#t~loopctr21| 12), 7194#(<= |#Ultimate.C_memset_#t~loopctr21| 13), 7195#(<= |#Ultimate.C_memset_#t~loopctr21| 14), 7196#(<= |#Ultimate.C_memset_#amount| 14)] [2018-02-02 10:23:29,802 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 10:23:29,802 INFO L409 AbstractCegarLoop]: Interpolant automaton has 18 states [2018-02-02 10:23:29,802 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2018-02-02 10:23:29,802 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=138, Invalid=168, Unknown=0, NotChecked=0, Total=306 [2018-02-02 10:23:29,803 INFO L87 Difference]: Start difference. First operand 151 states and 158 transitions. Second operand 18 states. [2018-02-02 10:23:29,840 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 10:23:29,840 INFO L93 Difference]: Finished difference Result 154 states and 161 transitions. [2018-02-02 10:23:29,840 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2018-02-02 10:23:29,840 INFO L78 Accepts]: Start accepts. Automaton has 18 states. Word has length 48 [2018-02-02 10:23:29,840 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 10:23:29,841 INFO L225 Difference]: With dead ends: 154 [2018-02-02 10:23:29,841 INFO L226 Difference]: Without dead ends: 152 [2018-02-02 10:23:29,841 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 14 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=142, Invalid=200, Unknown=0, NotChecked=0, Total=342 [2018-02-02 10:23:29,842 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 152 states. [2018-02-02 10:23:29,844 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 152 to 152. [2018-02-02 10:23:29,844 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 152 states. [2018-02-02 10:23:29,844 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 152 states to 152 states and 159 transitions. [2018-02-02 10:23:29,845 INFO L78 Accepts]: Start accepts. Automaton has 152 states and 159 transitions. Word has length 48 [2018-02-02 10:23:29,845 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 10:23:29,845 INFO L432 AbstractCegarLoop]: Abstraction has 152 states and 159 transitions. [2018-02-02 10:23:29,845 INFO L433 AbstractCegarLoop]: Interpolant automaton has 18 states. [2018-02-02 10:23:29,845 INFO L276 IsEmpty]: Start isEmpty. Operand 152 states and 159 transitions. [2018-02-02 10:23:29,845 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2018-02-02 10:23:29,845 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 10:23:29,846 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 10:23:29,846 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 10:23:29,846 INFO L82 PathProgramCache]: Analyzing trace with hash 588858599, now seen corresponding path program 15 times [2018-02-02 10:23:29,847 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 10:23:29,859 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 10:23:29,860 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 10:23:29,999 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 10:23:29,999 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-02 10:23:30,000 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [19] total 19 [2018-02-02 10:23:30,000 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 10:23:30,000 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 10:23:30,000 INFO L182 omatonBuilderFactory]: Interpolants [7520#(<= |#Ultimate.C_memset_#t~loopctr21| 13), 7521#(<= |#Ultimate.C_memset_#t~loopctr21| 14), 7522#(<= |#Ultimate.C_memset_#t~loopctr21| 15), 7523#(<= |#Ultimate.C_memset_#amount| 15), 7505#true, 7506#false, 7507#(= |#Ultimate.C_memset_#t~loopctr21| 0), 7508#(<= |#Ultimate.C_memset_#t~loopctr21| 1), 7509#(<= |#Ultimate.C_memset_#t~loopctr21| 2), 7510#(<= |#Ultimate.C_memset_#t~loopctr21| 3), 7511#(<= |#Ultimate.C_memset_#t~loopctr21| 4), 7512#(<= |#Ultimate.C_memset_#t~loopctr21| 5), 7513#(<= |#Ultimate.C_memset_#t~loopctr21| 6), 7514#(<= |#Ultimate.C_memset_#t~loopctr21| 7), 7515#(<= |#Ultimate.C_memset_#t~loopctr21| 8), 7516#(<= |#Ultimate.C_memset_#t~loopctr21| 9), 7517#(<= |#Ultimate.C_memset_#t~loopctr21| 10), 7518#(<= |#Ultimate.C_memset_#t~loopctr21| 11), 7519#(<= |#Ultimate.C_memset_#t~loopctr21| 12)] [2018-02-02 10:23:30,001 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 10:23:30,001 INFO L409 AbstractCegarLoop]: Interpolant automaton has 19 states [2018-02-02 10:23:30,001 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2018-02-02 10:23:30,001 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=155, Invalid=187, Unknown=0, NotChecked=0, Total=342 [2018-02-02 10:23:30,001 INFO L87 Difference]: Start difference. First operand 152 states and 159 transitions. Second operand 19 states. [2018-02-02 10:23:30,040 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 10:23:30,040 INFO L93 Difference]: Finished difference Result 155 states and 162 transitions. [2018-02-02 10:23:30,040 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2018-02-02 10:23:30,040 INFO L78 Accepts]: Start accepts. Automaton has 19 states. Word has length 49 [2018-02-02 10:23:30,041 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 10:23:30,041 INFO L225 Difference]: With dead ends: 155 [2018-02-02 10:23:30,041 INFO L226 Difference]: Without dead ends: 153 [2018-02-02 10:23:30,042 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 10:23:30,042 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 153 states. [2018-02-02 10:23:30,044 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 153 to 153. [2018-02-02 10:23:30,045 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 153 states. [2018-02-02 10:23:30,045 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 153 states to 153 states and 160 transitions. [2018-02-02 10:23:30,046 INFO L78 Accepts]: Start accepts. Automaton has 153 states and 160 transitions. Word has length 49 [2018-02-02 10:23:30,046 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 10:23:30,046 INFO L432 AbstractCegarLoop]: Abstraction has 153 states and 160 transitions. [2018-02-02 10:23:30,046 INFO L433 AbstractCegarLoop]: Interpolant automaton has 19 states. [2018-02-02 10:23:30,046 INFO L276 IsEmpty]: Start isEmpty. Operand 153 states and 160 transitions. [2018-02-02 10:23:30,046 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2018-02-02 10:23:30,046 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 10:23:30,047 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 10:23:30,047 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 10:23:30,047 INFO L82 PathProgramCache]: Analyzing trace with hash -805569157, now seen corresponding path program 16 times [2018-02-02 10:23:30,048 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 10:23:30,075 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 10:23:30,076 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 10:23:30,232 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 10:23:30,233 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-02 10:23:30,233 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2018-02-02 10:23:30,233 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 10:23:30,233 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 10:23:30,233 INFO L182 omatonBuilderFactory]: Interpolants [7840#(or (<= (+ |#Ultimate.C_memset_#ptr.offset| |#Ultimate.C_memset_#amount|) (select |#length| |#Ultimate.C_memset_#ptr.base|)) (not (= |#Ultimate.C_memset_#ptr.offset| 0))), 7841#(and (= 0 ldv_kobject_create_~kobj~1.offset) (<= 16 (select |#length| ldv_kobject_create_~kobj~1.base))), 7842#(and (= 0 |ldv_kobject_init_#in~kobj.offset|) (<= 16 (select |#length| |ldv_kobject_init_#in~kobj.base|))), 7843#(and (= 0 ldv_kobject_init_~kobj.offset) (<= 16 (select |#length| ldv_kobject_init_~kobj.base))), 7844#(and (<= 16 (select |#length| |ldv_kobject_init_internal_#in~kobj.base|)) (= 0 |ldv_kobject_init_internal_#in~kobj.offset|)), 7845#(and (<= 16 (select |#length| ldv_kobject_init_internal_~kobj.base)) (= ldv_kobject_init_internal_~kobj.offset 0)), 7846#(and (<= (+ |ldv_kref_init_#in~kref.offset| 4) (select |#length| |ldv_kref_init_#in~kref.base|)) (<= 12 |ldv_kref_init_#in~kref.offset|)), 7847#(and (<= 12 ldv_kref_init_~kref.offset) (<= (+ ldv_kref_init_~kref.offset 4) (select |#length| ldv_kref_init_~kref.base))), 7834#true, 7835#false, 7836#(= 0 |ldv_malloc_#t~malloc4.offset|), 7837#(= 0 |ldv_malloc_#res.offset|), 7838#(= 0 |ldv_kobject_create_#t~ret17.offset|), 7839#(= 0 ldv_kobject_create_~kobj~1.offset)] [2018-02-02 10:23:30,234 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 10:23:30,234 INFO L409 AbstractCegarLoop]: Interpolant automaton has 14 states [2018-02-02 10:23:30,234 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2018-02-02 10:23:30,234 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=156, Unknown=0, NotChecked=0, Total=182 [2018-02-02 10:23:30,234 INFO L87 Difference]: Start difference. First operand 153 states and 160 transitions. Second operand 14 states. [2018-02-02 10:23:30,483 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 10:23:30,483 INFO L93 Difference]: Finished difference Result 152 states and 159 transitions. [2018-02-02 10:23:30,487 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2018-02-02 10:23:30,487 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 50 [2018-02-02 10:23:30,487 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 10:23:30,487 INFO L225 Difference]: With dead ends: 152 [2018-02-02 10:23:30,487 INFO L226 Difference]: Without dead ends: 152 [2018-02-02 10:23:30,488 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 10:23:30,488 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 152 states. [2018-02-02 10:23:30,489 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 152 to 152. [2018-02-02 10:23:30,490 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 152 states. [2018-02-02 10:23:30,490 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 152 states to 152 states and 159 transitions. [2018-02-02 10:23:30,490 INFO L78 Accepts]: Start accepts. Automaton has 152 states and 159 transitions. Word has length 50 [2018-02-02 10:23:30,490 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 10:23:30,490 INFO L432 AbstractCegarLoop]: Abstraction has 152 states and 159 transitions. [2018-02-02 10:23:30,490 INFO L433 AbstractCegarLoop]: Interpolant automaton has 14 states. [2018-02-02 10:23:30,490 INFO L276 IsEmpty]: Start isEmpty. Operand 152 states and 159 transitions. [2018-02-02 10:23:30,491 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2018-02-02 10:23:30,491 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 10:23:30,491 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 10:23:30,491 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 10:23:30,491 INFO L82 PathProgramCache]: Analyzing trace with hash -2118052750, now seen corresponding path program 1 times [2018-02-02 10:23:30,492 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 10:23:30,501 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 10:23:30,501 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 10:23:30,560 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 10:23:30,560 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-02 10:23:30,560 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2018-02-02 10:23:30,560 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 10:23:30,560 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 10:23:30,560 INFO L182 omatonBuilderFactory]: Interpolants [8160#true, 8161#false, 8162#(= 1 (select |#valid| |#Ultimate.C_memset_#ptr.base|)), 8163#(= 1 (select |#valid| ldv_kobject_create_~kobj~1.base)), 8164#(= 1 (select |#valid| |ldv_kobject_init_#in~kobj.base|)), 8165#(= 1 (select |#valid| ldv_kobject_init_~kobj.base)), 8166#(= 1 (select |#valid| |ldv_kobject_init_internal_#in~kobj.base|)), 8167#(= 1 (select |#valid| ldv_kobject_init_internal_~kobj.base)), 8168#(= 1 (select |#valid| |LDV_INIT_LIST_HEAD_#in~list.base|)), 8169#(= 1 (select |#valid| LDV_INIT_LIST_HEAD_~list.base))] [2018-02-02 10:23:30,561 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 10:23:30,561 INFO L409 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-02-02 10:23:30,561 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-02-02 10:23:30,561 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=73, Unknown=0, NotChecked=0, Total=90 [2018-02-02 10:23:30,561 INFO L87 Difference]: Start difference. First operand 152 states and 159 transitions. Second operand 10 states. [2018-02-02 10:23:30,779 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 10:23:30,780 INFO L93 Difference]: Finished difference Result 150 states and 157 transitions. [2018-02-02 10:23:30,780 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-02-02 10:23:30,780 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 55 [2018-02-02 10:23:30,780 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 10:23:30,781 INFO L225 Difference]: With dead ends: 150 [2018-02-02 10:23:30,781 INFO L226 Difference]: Without dead ends: 150 [2018-02-02 10:23:30,781 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 10:23:30,781 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 150 states. [2018-02-02 10:23:30,783 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 150 to 150. [2018-02-02 10:23:30,784 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 150 states. [2018-02-02 10:23:30,784 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 150 states to 150 states and 157 transitions. [2018-02-02 10:23:30,784 INFO L78 Accepts]: Start accepts. Automaton has 150 states and 157 transitions. Word has length 55 [2018-02-02 10:23:30,785 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 10:23:30,785 INFO L432 AbstractCegarLoop]: Abstraction has 150 states and 157 transitions. [2018-02-02 10:23:30,785 INFO L433 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-02-02 10:23:30,785 INFO L276 IsEmpty]: Start isEmpty. Operand 150 states and 157 transitions. [2018-02-02 10:23:30,785 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2018-02-02 10:23:30,785 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 10:23:30,786 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 10:23:30,786 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 10:23:30,786 INFO L82 PathProgramCache]: Analyzing trace with hash -2118052749, now seen corresponding path program 1 times [2018-02-02 10:23:30,787 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 10:23:30,801 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 10:23:30,802 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 10:23:30,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 10:23:30,982 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-02 10:23:30,982 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2018-02-02 10:23:30,982 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 10:23:30,982 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 10:23:30,983 INFO L182 omatonBuilderFactory]: Interpolants [8480#(= 0 |ldv_kobject_create_#t~ret17.offset|), 8481#(= 0 ldv_kobject_create_~kobj~1.offset), 8482#(or (<= (+ |#Ultimate.C_memset_#ptr.offset| |#Ultimate.C_memset_#amount|) (select |#length| |#Ultimate.C_memset_#ptr.base|)) (not (= |#Ultimate.C_memset_#ptr.offset| 0))), 8483#(and (= 0 ldv_kobject_create_~kobj~1.offset) (<= 16 (select |#length| ldv_kobject_create_~kobj~1.base))), 8484#(and (= 0 |ldv_kobject_init_#in~kobj.offset|) (<= 16 (select |#length| |ldv_kobject_init_#in~kobj.base|))), 8485#(and (= 0 ldv_kobject_init_~kobj.offset) (<= 16 (select |#length| ldv_kobject_init_~kobj.base))), 8486#(and (<= 16 (select |#length| |ldv_kobject_init_internal_#in~kobj.base|)) (= 0 |ldv_kobject_init_internal_#in~kobj.offset|)), 8487#(and (<= 16 (select |#length| ldv_kobject_init_internal_~kobj.base)) (= ldv_kobject_init_internal_~kobj.offset 0)), 8488#(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|))), 8489#(and (<= (+ LDV_INIT_LIST_HEAD_~list.offset 12) (select |#length| LDV_INIT_LIST_HEAD_~list.base)) (<= 4 LDV_INIT_LIST_HEAD_~list.offset)), 8476#true, 8477#false, 8478#(= 0 |ldv_malloc_#t~malloc4.offset|), 8479#(= 0 |ldv_malloc_#res.offset|)] [2018-02-02 10:23:30,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 10:23:30,983 INFO L409 AbstractCegarLoop]: Interpolant automaton has 14 states [2018-02-02 10:23:30,983 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2018-02-02 10:23:30,983 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=156, Unknown=0, NotChecked=0, Total=182 [2018-02-02 10:23:30,983 INFO L87 Difference]: Start difference. First operand 150 states and 157 transitions. Second operand 14 states. [2018-02-02 10:23:31,213 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 10:23:31,230 INFO L93 Difference]: Finished difference Result 148 states and 155 transitions. [2018-02-02 10:23:31,230 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2018-02-02 10:23:31,230 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 55 [2018-02-02 10:23:31,230 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 10:23:31,231 INFO L225 Difference]: With dead ends: 148 [2018-02-02 10:23:31,231 INFO L226 Difference]: Without dead ends: 148 [2018-02-02 10:23:31,231 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 10:23:31,232 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 148 states. [2018-02-02 10:23:31,234 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 148 to 148. [2018-02-02 10:23:31,234 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 148 states. [2018-02-02 10:23:31,234 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 148 states to 148 states and 155 transitions. [2018-02-02 10:23:31,235 INFO L78 Accepts]: Start accepts. Automaton has 148 states and 155 transitions. Word has length 55 [2018-02-02 10:23:31,235 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 10:23:31,235 INFO L432 AbstractCegarLoop]: Abstraction has 148 states and 155 transitions. [2018-02-02 10:23:31,235 INFO L433 AbstractCegarLoop]: Interpolant automaton has 14 states. [2018-02-02 10:23:31,235 INFO L276 IsEmpty]: Start isEmpty. Operand 148 states and 155 transitions. [2018-02-02 10:23:31,235 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2018-02-02 10:23:31,236 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 10:23:31,236 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] [2018-02-02 10:23:31,236 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 10:23:31,236 INFO L82 PathProgramCache]: Analyzing trace with hash 533209049, now seen corresponding path program 1 times [2018-02-02 10:23:31,237 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 10:23:31,247 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 10:23:31,248 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 10:23:31,311 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 10:23:31,312 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-02 10:23:31,312 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2018-02-02 10:23:31,312 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 10:23:31,312 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 10:23:31,312 INFO L182 omatonBuilderFactory]: Interpolants [8800#(= ldv_kobject_init_~kobj.base |ldv_kobject_init_#in~kobj.base|), 8801#(= 0 |ldv_kobject_init_#in~kobj.base|), 8794#true, 8795#false, 8796#(not (= |ldv_malloc_#t~malloc4.base| 0)), 8797#(not (= |ldv_malloc_#res.base| 0)), 8798#(not (= |ldv_kobject_create_#t~ret17.base| 0)), 8799#(not (= ldv_kobject_create_~kobj~1.base 0))] [2018-02-02 10:23:31,313 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 10:23:31,313 INFO L409 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-02-02 10:23:31,313 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-02-02 10:23:31,313 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2018-02-02 10:23:31,313 INFO L87 Difference]: Start difference. First operand 148 states and 155 transitions. Second operand 8 states. [2018-02-02 10:23:31,349 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 10:23:31,349 INFO L93 Difference]: Finished difference Result 150 states and 156 transitions. [2018-02-02 10:23:31,350 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-02-02 10:23:31,350 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 58 [2018-02-02 10:23:31,350 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 10:23:31,350 INFO L225 Difference]: With dead ends: 150 [2018-02-02 10:23:31,350 INFO L226 Difference]: Without dead ends: 148 [2018-02-02 10:23:31,351 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 10:23:31,351 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 148 states. [2018-02-02 10:23:31,353 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 148 to 148. [2018-02-02 10:23:31,353 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 148 states. [2018-02-02 10:23:31,353 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 148 states to 148 states and 154 transitions. [2018-02-02 10:23:31,353 INFO L78 Accepts]: Start accepts. Automaton has 148 states and 154 transitions. Word has length 58 [2018-02-02 10:23:31,353 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 10:23:31,354 INFO L432 AbstractCegarLoop]: Abstraction has 148 states and 154 transitions. [2018-02-02 10:23:31,354 INFO L433 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-02-02 10:23:31,354 INFO L276 IsEmpty]: Start isEmpty. Operand 148 states and 154 transitions. [2018-02-02 10:23:31,354 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2018-02-02 10:23:31,354 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 10:23:31,354 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] [2018-02-02 10:23:31,354 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 10:23:31,355 INFO L82 PathProgramCache]: Analyzing trace with hash -793469840, now seen corresponding path program 1 times [2018-02-02 10:23:31,355 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 10:23:31,366 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 10:23:31,367 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 10:23:31,426 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 10:23:31,427 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-02 10:23:31,427 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2018-02-02 10:23:31,427 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 10:23:31,427 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 10:23:31,427 INFO L182 omatonBuilderFactory]: Interpolants [9104#true, 9105#false, 9106#(not (= |ldv_malloc_#t~malloc4.base| 0)), 9107#(not (= |ldv_malloc_#res.base| 0)), 9108#(not (= |ldv_kobject_create_#t~ret17.base| 0)), 9109#(not (= ldv_kobject_create_~kobj~1.base 0)), 9110#(= ldv_kobject_init_~kobj.base |ldv_kobject_init_#in~kobj.base|), 9111#(= ldv_kobject_init_internal_~kobj.base |ldv_kobject_init_internal_#in~kobj.base|), 9112#(= 0 |ldv_kobject_init_internal_#in~kobj.base|), 9113#(= 0 |ldv_kobject_init_#in~kobj.base|)] [2018-02-02 10:23:31,428 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 10:23:31,428 INFO L409 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-02-02 10:23:31,428 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-02-02 10:23:31,428 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=73, Unknown=0, NotChecked=0, Total=90 [2018-02-02 10:23:31,428 INFO L87 Difference]: Start difference. First operand 148 states and 154 transitions. Second operand 10 states. [2018-02-02 10:23:31,486 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 10:23:31,486 INFO L93 Difference]: Finished difference Result 152 states and 157 transitions. [2018-02-02 10:23:31,486 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-02-02 10:23:31,486 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 63 [2018-02-02 10:23:31,486 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 10:23:31,487 INFO L225 Difference]: With dead ends: 152 [2018-02-02 10:23:31,487 INFO L226 Difference]: Without dead ends: 148 [2018-02-02 10:23:31,487 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 10:23:31,487 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 148 states. [2018-02-02 10:23:31,489 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 148 to 148. [2018-02-02 10:23:31,489 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 148 states. [2018-02-02 10:23:31,490 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 148 states to 148 states and 153 transitions. [2018-02-02 10:23:31,490 INFO L78 Accepts]: Start accepts. Automaton has 148 states and 153 transitions. Word has length 63 [2018-02-02 10:23:31,490 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 10:23:31,490 INFO L432 AbstractCegarLoop]: Abstraction has 148 states and 153 transitions. [2018-02-02 10:23:31,490 INFO L433 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-02-02 10:23:31,490 INFO L276 IsEmpty]: Start isEmpty. Operand 148 states and 153 transitions. [2018-02-02 10:23:31,491 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 75 [2018-02-02 10:23:31,491 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 10:23:31,491 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] [2018-02-02 10:23:31,491 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 10:23:31,491 INFO L82 PathProgramCache]: Analyzing trace with hash -1873730024, now seen corresponding path program 1 times [2018-02-02 10:23:31,492 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 10:23:31,504 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 10:23:31,505 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 10:23:31,598 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 10:23:31,598 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-02 10:23:31,598 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2018-02-02 10:23:31,598 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 10:23:31,598 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 10:23:31,599 INFO L182 omatonBuilderFactory]: Interpolants [9420#true, 9421#false, 9422#(= 1 (select |#valid| |#Ultimate.C_memset_#ptr.base|)), 9423#(= 1 (select |#valid| ldv_kobject_create_~kobj~1.base)), 9424#(= 1 (select |#valid| |ldv_kobject_create_#res.base|)), 9425#(= 1 (select |#valid| |entry_point_#t~ret19.base|)), 9426#(= 1 (select |#valid| entry_point_~kobj~2.base)), 9427#(= 1 (select |#valid| |ldv_kobject_get_#in~kobj.base|)), 9428#(= 1 (select |#valid| ldv_kobject_get_~kobj.base)), 9429#(= 1 (select |#valid| |ldv_kref_get_#in~kref.base|)), 9430#(= 1 (select |#valid| ldv_kref_get_~kref.base)), 9431#(= 1 (select |#valid| |ldv_atomic_add_return_#in~v.base|)), 9432#(= 1 (select |#valid| ldv_atomic_add_return_~v.base))] [2018-02-02 10:23:31,599 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 10:23:31,599 INFO L409 AbstractCegarLoop]: Interpolant automaton has 13 states [2018-02-02 10:23:31,599 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2018-02-02 10:23:31,599 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=133, Unknown=0, NotChecked=0, Total=156 [2018-02-02 10:23:31,599 INFO L87 Difference]: Start difference. First operand 148 states and 153 transitions. Second operand 13 states. [2018-02-02 10:23:31,833 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 10:23:31,833 INFO L93 Difference]: Finished difference Result 146 states and 151 transitions. [2018-02-02 10:23:31,834 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2018-02-02 10:23:31,834 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 74 [2018-02-02 10:23:31,834 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 10:23:31,834 INFO L225 Difference]: With dead ends: 146 [2018-02-02 10:23:31,834 INFO L226 Difference]: Without dead ends: 146 [2018-02-02 10:23:31,835 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 1 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 10:23:31,835 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 146 states. [2018-02-02 10:23:31,836 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 146 to 146. [2018-02-02 10:23:31,836 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 146 states. [2018-02-02 10:23:31,836 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 146 states to 146 states and 151 transitions. [2018-02-02 10:23:31,836 INFO L78 Accepts]: Start accepts. Automaton has 146 states and 151 transitions. Word has length 74 [2018-02-02 10:23:31,836 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 10:23:31,836 INFO L432 AbstractCegarLoop]: Abstraction has 146 states and 151 transitions. [2018-02-02 10:23:31,837 INFO L433 AbstractCegarLoop]: Interpolant automaton has 13 states. [2018-02-02 10:23:31,837 INFO L276 IsEmpty]: Start isEmpty. Operand 146 states and 151 transitions. [2018-02-02 10:23:31,837 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 75 [2018-02-02 10:23:31,837 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 10:23:31,837 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] [2018-02-02 10:23:31,837 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 10:23:31,837 INFO L82 PathProgramCache]: Analyzing trace with hash -1873730023, now seen corresponding path program 1 times [2018-02-02 10:23:31,838 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 10:23:31,846 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 10:23:31,847 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 10:23:32,015 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 10:23:32,016 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-02 10:23:32,016 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [16] imperfect sequences [] total 16 [2018-02-02 10:23:32,016 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 10:23:32,016 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 10:23:32,016 INFO L182 omatonBuilderFactory]: Interpolants [9733#true, 9734#false, 9735#(= 0 |ldv_malloc_#t~malloc4.offset|), 9736#(= 0 |ldv_malloc_#res.offset|), 9737#(= 0 |ldv_kobject_create_#t~ret17.offset|), 9738#(= 0 ldv_kobject_create_~kobj~1.offset), 9739#(or (<= (+ |#Ultimate.C_memset_#ptr.offset| |#Ultimate.C_memset_#amount|) (select |#length| |#Ultimate.C_memset_#ptr.base|)) (not (= |#Ultimate.C_memset_#ptr.offset| 0))), 9740#(and (= 0 ldv_kobject_create_~kobj~1.offset) (<= 16 (select |#length| ldv_kobject_create_~kobj~1.base))), 9741#(and (= 0 |ldv_kobject_create_#res.offset|) (<= 16 (select |#length| |ldv_kobject_create_#res.base|))), 9742#(and (= 0 |entry_point_#t~ret19.offset|) (<= 16 (select |#length| |entry_point_#t~ret19.base|))), 9743#(and (= 0 entry_point_~kobj~2.offset) (<= 16 (select |#length| entry_point_~kobj~2.base))), 9744#(and (<= 16 (select |#length| |ldv_kobject_get_#in~kobj.base|)) (= 0 |ldv_kobject_get_#in~kobj.offset|)), 9745#(and (<= 16 (select |#length| ldv_kobject_get_~kobj.base)) (= ldv_kobject_get_~kobj.offset 0)), 9746#(and (<= 12 |ldv_kref_get_#in~kref.offset|) (<= (+ |ldv_kref_get_#in~kref.offset| 4) (select |#length| |ldv_kref_get_#in~kref.base|))), 9747#(and (<= 12 ldv_kref_get_~kref.offset) (<= (+ ldv_kref_get_~kref.offset 4) (select |#length| ldv_kref_get_~kref.base))), 9748#(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|))), 9749#(and (<= 12 ldv_atomic_add_return_~v.offset) (<= (+ ldv_atomic_add_return_~v.offset 4) (select |#length| ldv_atomic_add_return_~v.base)))] [2018-02-02 10:23:32,016 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 10:23:32,017 INFO L409 AbstractCegarLoop]: Interpolant automaton has 17 states [2018-02-02 10:23:32,017 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2018-02-02 10:23:32,017 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=240, Unknown=0, NotChecked=0, Total=272 [2018-02-02 10:23:32,017 INFO L87 Difference]: Start difference. First operand 146 states and 151 transitions. Second operand 17 states. [2018-02-02 10:23:32,264 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 10:23:32,264 INFO L93 Difference]: Finished difference Result 144 states and 149 transitions. [2018-02-02 10:23:32,264 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2018-02-02 10:23:32,265 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 74 [2018-02-02 10:23:32,265 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 10:23:32,265 INFO L225 Difference]: With dead ends: 144 [2018-02-02 10:23:32,265 INFO L226 Difference]: Without dead ends: 144 [2018-02-02 10:23:32,265 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 23 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=53, Invalid=409, Unknown=0, NotChecked=0, Total=462 [2018-02-02 10:23:32,266 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 144 states. [2018-02-02 10:23:32,267 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 144 to 144. [2018-02-02 10:23:32,267 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 144 states. [2018-02-02 10:23:32,267 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 144 states to 144 states and 149 transitions. [2018-02-02 10:23:32,267 INFO L78 Accepts]: Start accepts. Automaton has 144 states and 149 transitions. Word has length 74 [2018-02-02 10:23:32,267 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 10:23:32,267 INFO L432 AbstractCegarLoop]: Abstraction has 144 states and 149 transitions. [2018-02-02 10:23:32,267 INFO L433 AbstractCegarLoop]: Interpolant automaton has 17 states. [2018-02-02 10:23:32,267 INFO L276 IsEmpty]: Start isEmpty. Operand 144 states and 149 transitions. [2018-02-02 10:23:32,268 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 84 [2018-02-02 10:23:32,268 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 10:23:32,268 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] [2018-02-02 10:23:32,268 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 10:23:32,268 INFO L82 PathProgramCache]: Analyzing trace with hash -1285627172, now seen corresponding path program 1 times [2018-02-02 10:23:32,269 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 10:23:32,283 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 10:23:32,284 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 10:23:32,368 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 10:23:32,368 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-02 10:23:32,369 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2018-02-02 10:23:32,369 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 10:23:32,369 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 10:23:32,369 INFO L182 omatonBuilderFactory]: Interpolants [10048#true, 10049#false, 10050#(not (= |ldv_malloc_#t~malloc4.base| 0)), 10051#(not (= |ldv_malloc_#res.base| 0)), 10052#(not (= |ldv_kobject_create_#t~ret17.base| 0)), 10053#(not (= ldv_kobject_create_~kobj~1.base 0)), 10054#(not (= |ldv_kobject_create_#res.base| 0)), 10055#(not (= |entry_point_#t~ret19.base| 0)), 10056#(not (= entry_point_~kobj~2.base 0)), 10057#(= ldv_kobject_get_~kobj.base |ldv_kobject_get_#in~kobj.base|), 10058#(= 0 |ldv_kobject_get_#in~kobj.base|)] [2018-02-02 10:23:32,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 10:23:32,370 INFO L409 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-02-02 10:23:32,370 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-02-02 10:23:32,370 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=91, Unknown=0, NotChecked=0, Total=110 [2018-02-02 10:23:32,370 INFO L87 Difference]: Start difference. First operand 144 states and 149 transitions. Second operand 11 states. [2018-02-02 10:23:32,422 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 10:23:32,422 INFO L93 Difference]: Finished difference Result 147 states and 151 transitions. [2018-02-02 10:23:32,422 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-02-02 10:23:32,422 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 83 [2018-02-02 10:23:32,423 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 10:23:32,423 INFO L225 Difference]: With dead ends: 147 [2018-02-02 10:23:32,423 INFO L226 Difference]: Without dead ends: 144 [2018-02-02 10:23:32,424 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 10:23:32,424 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 144 states. [2018-02-02 10:23:32,426 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 144 to 144. [2018-02-02 10:23:32,426 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 144 states. [2018-02-02 10:23:32,427 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 144 states to 144 states and 148 transitions. [2018-02-02 10:23:32,427 INFO L78 Accepts]: Start accepts. Automaton has 144 states and 148 transitions. Word has length 83 [2018-02-02 10:23:32,428 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 10:23:32,428 INFO L432 AbstractCegarLoop]: Abstraction has 144 states and 148 transitions. [2018-02-02 10:23:32,428 INFO L433 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-02-02 10:23:32,428 INFO L276 IsEmpty]: Start isEmpty. Operand 144 states and 148 transitions. [2018-02-02 10:23:32,428 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 97 [2018-02-02 10:23:32,428 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 10:23:32,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] [2018-02-02 10:23:32,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 10:23:32,429 INFO L82 PathProgramCache]: Analyzing trace with hash 101557868, now seen corresponding path program 1 times [2018-02-02 10:23:32,430 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 10:23:32,445 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 10:23:32,446 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 10:23:32,598 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 10:23:32,598 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-02 10:23:32,598 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [17] imperfect sequences [] total 17 [2018-02-02 10:23:32,599 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 10:23:32,599 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 10:23:32,599 INFO L182 omatonBuilderFactory]: Interpolants [10368#(= 1 (select |#valid| |ldv_kref_put_#in~kref.base|)), 10369#(= 1 (select |#valid| ldv_kref_put_~kref.base)), 10370#(= 1 (select |#valid| |ldv_kref_sub_#in~kref.base|)), 10371#(= 1 (select |#valid| ldv_kref_sub_~kref.base)), 10372#(= 1 (select |#valid| |ldv_atomic_sub_return_#in~v.base|)), 10373#(= 1 (select |#valid| ldv_atomic_sub_return_~v.base)), 10356#true, 10357#false, 10358#(= ldv_kobject_get_~kobj.base |ldv_kobject_get_#in~kobj.base|), 10359#(= ldv_kref_get_~kref.base |ldv_kref_get_#in~kref.base|), 10360#(= ldv_atomic_add_return_~v.base |ldv_atomic_add_return_#in~v.base|), 10361#(and (= 1 (select |#valid| ldv_atomic_add_return_~v.base)) (= ldv_atomic_add_return_~v.base |ldv_atomic_add_return_#in~v.base|)), 10362#(= 1 (select |#valid| |ldv_atomic_add_return_#in~v.base|)), 10363#(= 1 (select |#valid| |ldv_kref_get_#in~kref.base|)), 10364#(= 1 (select |#valid| |ldv_kobject_get_#in~kobj.base|)), 10365#(= 1 (select |#valid| entry_point_~kobj~2.base)), 10366#(= 1 (select |#valid| |ldv_kobject_put_#in~kobj.base|)), 10367#(= 1 (select |#valid| ldv_kobject_put_~kobj.base))] [2018-02-02 10:23:32,599 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 10:23:32,600 INFO L409 AbstractCegarLoop]: Interpolant automaton has 18 states [2018-02-02 10:23:32,600 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2018-02-02 10:23:32,600 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=271, Unknown=0, NotChecked=0, Total=306 [2018-02-02 10:23:32,600 INFO L87 Difference]: Start difference. First operand 144 states and 148 transitions. Second operand 18 states. [2018-02-02 10:23:32,857 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 10:23:32,857 INFO L93 Difference]: Finished difference Result 172 states and 183 transitions. [2018-02-02 10:23:32,857 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2018-02-02 10:23:32,857 INFO L78 Accepts]: Start accepts. Automaton has 18 states. Word has length 96 [2018-02-02 10:23:32,857 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 10:23:32,858 INFO L225 Difference]: With dead ends: 172 [2018-02-02 10:23:32,858 INFO L226 Difference]: Without dead ends: 172 [2018-02-02 10:23:32,858 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 44 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=59, Invalid=493, Unknown=0, NotChecked=0, Total=552 [2018-02-02 10:23:32,858 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 172 states. [2018-02-02 10:23:32,861 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 172 to 167. [2018-02-02 10:23:32,861 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 167 states. [2018-02-02 10:23:32,861 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 167 states to 167 states and 179 transitions. [2018-02-02 10:23:32,861 INFO L78 Accepts]: Start accepts. Automaton has 167 states and 179 transitions. Word has length 96 [2018-02-02 10:23:32,861 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 10:23:32,861 INFO L432 AbstractCegarLoop]: Abstraction has 167 states and 179 transitions. [2018-02-02 10:23:32,862 INFO L433 AbstractCegarLoop]: Interpolant automaton has 18 states. [2018-02-02 10:23:32,862 INFO L276 IsEmpty]: Start isEmpty. Operand 167 states and 179 transitions. [2018-02-02 10:23:32,862 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 97 [2018-02-02 10:23:32,862 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 10:23:32,862 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] [2018-02-02 10:23:32,862 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 10:23:32,862 INFO L82 PathProgramCache]: Analyzing trace with hash 101557869, now seen corresponding path program 1 times [2018-02-02 10:23:32,863 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 10:23:32,874 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 10:23:32,874 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 10:23:33,126 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 10:23:33,126 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-02 10:23:33,127 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [18] imperfect sequences [] total 18 [2018-02-02 10:23:33,127 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 10:23:33,127 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 10:23:33,127 INFO L182 omatonBuilderFactory]: Interpolants [10725#true, 10726#false, 10727#(= 0 |ldv_malloc_#t~malloc4.offset|), 10728#(= 0 |ldv_malloc_#res.offset|), 10729#(= 0 |ldv_kobject_create_#t~ret17.offset|), 10730#(= 0 ldv_kobject_create_~kobj~1.offset), 10731#(or (<= (+ |#Ultimate.C_memset_#ptr.offset| |#Ultimate.C_memset_#amount|) (select |#length| |#Ultimate.C_memset_#ptr.base|)) (not (= |#Ultimate.C_memset_#ptr.offset| 0))), 10732#(and (= 0 ldv_kobject_create_~kobj~1.offset) (<= 16 (select |#length| ldv_kobject_create_~kobj~1.base))), 10733#(and (= 0 |ldv_kobject_create_#res.offset|) (<= 16 (select |#length| |ldv_kobject_create_#res.base|))), 10734#(and (= 0 |entry_point_#t~ret19.offset|) (<= 16 (select |#length| |entry_point_#t~ret19.base|))), 10735#(and (= 0 entry_point_~kobj~2.offset) (<= 16 (select |#length| entry_point_~kobj~2.base))), 10736#(and (<= 16 (select |#length| |ldv_kobject_put_#in~kobj.base|)) (= 0 |ldv_kobject_put_#in~kobj.offset|)), 10737#(and (= ldv_kobject_put_~kobj.offset 0) (<= 16 (select |#length| ldv_kobject_put_~kobj.base))), 10738#(and (<= 12 |ldv_kref_put_#in~kref.offset|) (<= (+ |ldv_kref_put_#in~kref.offset| 4) (select |#length| |ldv_kref_put_#in~kref.base|))), 10739#(and (<= 12 ldv_kref_put_~kref.offset) (<= (+ ldv_kref_put_~kref.offset 4) (select |#length| ldv_kref_put_~kref.base))), 10740#(and (<= (+ |ldv_kref_sub_#in~kref.offset| 4) (select |#length| |ldv_kref_sub_#in~kref.base|)) (<= 12 |ldv_kref_sub_#in~kref.offset|)), 10741#(and (<= (+ ldv_kref_sub_~kref.offset 4) (select |#length| ldv_kref_sub_~kref.base)) (<= 12 ldv_kref_sub_~kref.offset)), 10742#(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|)), 10743#(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 10:23:33,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 10:23:33,127 INFO L409 AbstractCegarLoop]: Interpolant automaton has 19 states [2018-02-02 10:23:33,127 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2018-02-02 10:23:33,127 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=306, Unknown=0, NotChecked=0, Total=342 [2018-02-02 10:23:33,128 INFO L87 Difference]: Start difference. First operand 167 states and 179 transitions. Second operand 19 states. [2018-02-02 10:23:33,460 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 10:23:33,460 INFO L93 Difference]: Finished difference Result 165 states and 175 transitions. [2018-02-02 10:23:33,460 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2018-02-02 10:23:33,460 INFO L78 Accepts]: Start accepts. Automaton has 19 states. Word has length 96 [2018-02-02 10:23:33,460 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 10:23:33,461 INFO L225 Difference]: With dead ends: 165 [2018-02-02 10:23:33,461 INFO L226 Difference]: Without dead ends: 165 [2018-02-02 10:23:33,461 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 10:23:33,461 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 165 states. [2018-02-02 10:23:33,463 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 165 to 165. [2018-02-02 10:23:33,463 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 165 states. [2018-02-02 10:23:33,464 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 165 states to 165 states and 175 transitions. [2018-02-02 10:23:33,464 INFO L78 Accepts]: Start accepts. Automaton has 165 states and 175 transitions. Word has length 96 [2018-02-02 10:23:33,464 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 10:23:33,464 INFO L432 AbstractCegarLoop]: Abstraction has 165 states and 175 transitions. [2018-02-02 10:23:33,464 INFO L433 AbstractCegarLoop]: Interpolant automaton has 19 states. [2018-02-02 10:23:33,464 INFO L276 IsEmpty]: Start isEmpty. Operand 165 states and 175 transitions. [2018-02-02 10:23:33,464 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 100 [2018-02-02 10:23:33,465 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 10:23:33,465 INFO L351 BasicCegarLoop]: trace histogram [16, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-02 10:23:33,465 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 10:23:33,465 INFO L82 PathProgramCache]: Analyzing trace with hash -1923624090, now seen corresponding path program 1 times [2018-02-02 10:23:33,465 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 10:23:33,474 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 10:23:33,475 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 10:23:33,540 INFO L134 CoverageAnalysis]: Checked inductivity of 140 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 137 trivial. 0 not checked. [2018-02-02 10:23:33,540 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-02 10:23:33,540 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [11] total 11 [2018-02-02 10:23:33,541 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 10:23:33,541 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-02-02 10:23:33,541 INFO L182 omatonBuilderFactory]: Interpolants [11088#(not (= |ldv_malloc_#t~malloc4.base| 0)), 11089#(not (= |ldv_malloc_#res.base| 0)), 11090#(not (= |ldv_kobject_create_#t~ret17.base| 0)), 11091#(not (= ldv_kobject_create_~kobj~1.base 0)), 11092#(not (= |ldv_kobject_create_#res.base| 0)), 11093#(not (= |entry_point_#t~ret19.base| 0)), 11094#(not (= entry_point_~kobj~2.base 0)), 11095#(= ldv_kobject_put_~kobj.base |ldv_kobject_put_#in~kobj.base|), 11096#(= 0 |ldv_kobject_put_#in~kobj.base|), 11086#true, 11087#false] [2018-02-02 10:23:33,541 INFO L134 CoverageAnalysis]: Checked inductivity of 140 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 137 trivial. 0 not checked. [2018-02-02 10:23:33,541 INFO L409 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-02-02 10:23:33,542 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-02-02 10:23:33,542 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=91, Unknown=0, NotChecked=0, Total=110 [2018-02-02 10:23:33,542 INFO L87 Difference]: Start difference. First operand 165 states and 175 transitions. Second operand 11 states. [2018-02-02 10:23:33,610 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 10:23:33,610 INFO L93 Difference]: Finished difference Result 166 states and 172 transitions. [2018-02-02 10:23:33,610 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-02-02 10:23:33,610 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 99 [2018-02-02 10:23:33,610 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 10:23:33,611 INFO L225 Difference]: With dead ends: 166 [2018-02-02 10:23:33,611 INFO L226 Difference]: Without dead ends: 162 [2018-02-02 10:23:33,611 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 10:23:33,611 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 162 states. [2018-02-02 10:23:33,613 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 162 to 162. [2018-02-02 10:23:33,613 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 162 states. [2018-02-02 10:23:33,613 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 162 states to 162 states and 168 transitions. [2018-02-02 10:23:33,614 INFO L78 Accepts]: Start accepts. Automaton has 162 states and 168 transitions. Word has length 99 [2018-02-02 10:23:33,614 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 10:23:33,614 INFO L432 AbstractCegarLoop]: Abstraction has 162 states and 168 transitions. [2018-02-02 10:23:33,614 INFO L433 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-02-02 10:23:33,614 INFO L276 IsEmpty]: Start isEmpty. Operand 162 states and 168 transitions. [2018-02-02 10:23:33,614 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 111 [2018-02-02 10:23:33,614 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 10:23:33,615 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] [2018-02-02 10:23:33,615 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 10:23:33,615 INFO L82 PathProgramCache]: Analyzing trace with hash -1608011136, now seen corresponding path program 1 times [2018-02-02 10:23:33,615 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 10:23:33,627 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 10:23:33,627 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 10:23:33,809 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 10:23:33,809 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-02 10:23:33,809 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [20] imperfect sequences [] total 20 [2018-02-02 10:23:33,809 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 10:23:33,809 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 10:23:33,809 INFO L182 omatonBuilderFactory]: Interpolants [11431#true, 11432#false, 11433#(= ldv_kobject_get_~kobj.base |ldv_kobject_get_#in~kobj.base|), 11434#(= ldv_kref_get_~kref.base |ldv_kref_get_#in~kref.base|), 11435#(= ldv_atomic_add_return_~v.base |ldv_atomic_add_return_#in~v.base|), 11436#(= 1 (select |#valid| |ldv_atomic_add_return_#in~v.base|)), 11437#(= 1 (select |#valid| |ldv_kref_get_#in~kref.base|)), 11438#(= 1 (select |#valid| |ldv_kobject_get_#in~kobj.base|)), 11439#(= 1 (select |#valid| entry_point_~kobj~2.base)), 11440#(= 1 (select |#valid| |ldv_kobject_put_#in~kobj.base|)), 11441#(= 1 (select |#valid| ldv_kobject_put_~kobj.base)), 11442#(= 1 (select |#valid| |ldv_kref_put_#in~kref.base|)), 11443#(= 1 (select |#valid| ldv_kref_put_~kref.base)), 11444#(= 1 (select |#valid| |ldv_kref_sub_#in~kref.base|)), 11445#(= 1 (select |#valid| ldv_kref_sub_~kref.base)), 11446#(= 1 (select |#valid| |##fun~$Pointer$~TO~VOID_#in~kref.base|)), 11447#(= 1 (select |#valid| |##fun~$Pointer$~TO~VOID_#~kref.base|)), 11448#(= 1 (select |#valid| |ldv_kobject_release_#in~kref.base|)), 11449#(= 1 (select |#valid| ldv_kobject_release_~kobj~0.base)), 11450#(= 1 (select |#valid| |ldv_kobject_cleanup_#in~kobj.base|)), 11451#(= 1 (select |#valid| ldv_kobject_cleanup_~kobj.base))] [2018-02-02 10:23:33,809 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 10:23:33,809 INFO L409 AbstractCegarLoop]: Interpolant automaton has 21 states [2018-02-02 10:23:33,810 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2018-02-02 10:23:33,810 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=39, Invalid=381, Unknown=0, NotChecked=0, Total=420 [2018-02-02 10:23:33,810 INFO L87 Difference]: Start difference. First operand 162 states and 168 transitions. Second operand 21 states. [2018-02-02 10:23:34,160 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 10:23:34,160 INFO L93 Difference]: Finished difference Result 172 states and 181 transitions. [2018-02-02 10:23:34,160 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2018-02-02 10:23:34,161 INFO L78 Accepts]: Start accepts. Automaton has 21 states. Word has length 110 [2018-02-02 10:23:34,161 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 10:23:34,162 INFO L225 Difference]: With dead ends: 172 [2018-02-02 10:23:34,162 INFO L226 Difference]: Without dead ends: 172 [2018-02-02 10:23:34,162 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 29 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 36 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=75, Invalid=795, Unknown=0, NotChecked=0, Total=870 [2018-02-02 10:23:34,162 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 172 states. [2018-02-02 10:23:34,165 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 172 to 168. [2018-02-02 10:23:34,165 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 168 states. [2018-02-02 10:23:34,165 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 168 states to 168 states and 178 transitions. [2018-02-02 10:23:34,165 INFO L78 Accepts]: Start accepts. Automaton has 168 states and 178 transitions. Word has length 110 [2018-02-02 10:23:34,166 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 10:23:34,166 INFO L432 AbstractCegarLoop]: Abstraction has 168 states and 178 transitions. [2018-02-02 10:23:34,166 INFO L433 AbstractCegarLoop]: Interpolant automaton has 21 states. [2018-02-02 10:23:34,166 INFO L276 IsEmpty]: Start isEmpty. Operand 168 states and 178 transitions. [2018-02-02 10:23:34,166 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 111 [2018-02-02 10:23:34,166 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 10:23:34,167 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] [2018-02-02 10:23:34,167 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 10:23:34,167 INFO L82 PathProgramCache]: Analyzing trace with hash -1608011135, now seen corresponding path program 1 times [2018-02-02 10:23:34,168 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 10:23:34,191 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 10:23:34,192 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 10:23:34,546 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 10:23:34,547 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-02 10:23:34,547 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [22] imperfect sequences [] total 22 [2018-02-02 10:23:34,547 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 10:23:34,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 10:23:34,547 INFO L182 omatonBuilderFactory]: Interpolants [11810#true, 11811#false, 11812#(= 0 |ldv_malloc_#t~malloc4.offset|), 11813#(= 0 |ldv_malloc_#res.offset|), 11814#(= 0 |ldv_kobject_create_#t~ret17.offset|), 11815#(= 0 ldv_kobject_create_~kobj~1.offset), 11816#(or (<= (+ |#Ultimate.C_memset_#ptr.offset| |#Ultimate.C_memset_#amount|) (select |#length| |#Ultimate.C_memset_#ptr.base|)) (not (= |#Ultimate.C_memset_#ptr.offset| 0))), 11817#(and (= 0 ldv_kobject_create_~kobj~1.offset) (<= 16 (select |#length| ldv_kobject_create_~kobj~1.base))), 11818#(and (= 0 |ldv_kobject_create_#res.offset|) (<= 16 (select |#length| |ldv_kobject_create_#res.base|))), 11819#(and (= 0 |entry_point_#t~ret19.offset|) (<= 16 (select |#length| |entry_point_#t~ret19.base|))), 11820#(and (= 0 entry_point_~kobj~2.offset) (<= 16 (select |#length| entry_point_~kobj~2.base))), 11821#(and (<= 16 (select |#length| |ldv_kobject_put_#in~kobj.base|)) (= 0 |ldv_kobject_put_#in~kobj.offset|)), 11822#(and (= ldv_kobject_put_~kobj.offset 0) (<= 16 (select |#length| ldv_kobject_put_~kobj.base))), 11823#(and (<= 12 |ldv_kref_put_#in~kref.offset|) (<= (+ |ldv_kref_put_#in~kref.offset| 4) (select |#length| |ldv_kref_put_#in~kref.base|))), 11824#(and (<= 12 ldv_kref_put_~kref.offset) (<= (+ ldv_kref_put_~kref.offset 4) (select |#length| ldv_kref_put_~kref.base))), 11825#(and (<= (+ |ldv_kref_sub_#in~kref.offset| 4) (select |#length| |ldv_kref_sub_#in~kref.base|)) (<= 12 |ldv_kref_sub_#in~kref.offset|)), 11826#(and (<= (+ ldv_kref_sub_~kref.offset 4) (select |#length| ldv_kref_sub_~kref.base)) (<= 12 ldv_kref_sub_~kref.offset)), 11827#(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|))), 11828#(and (<= 12 |##fun~$Pointer$~TO~VOID_#~kref.offset|) (<= (+ |##fun~$Pointer$~TO~VOID_#~kref.offset| 4) (select |#length| |##fun~$Pointer$~TO~VOID_#~kref.base|))), 11829#(and (<= 12 |ldv_kobject_release_#in~kref.offset|) (<= (+ |ldv_kobject_release_#in~kref.offset| 4) (select |#length| |ldv_kobject_release_#in~kref.base|))), 11830#(and (<= (+ ldv_kobject_release_~kobj~0.offset 16) (select |#length| ldv_kobject_release_~kobj~0.base)) (<= 0 ldv_kobject_release_~kobj~0.offset)), 11831#(and (<= (+ |ldv_kobject_cleanup_#in~kobj.offset| 16) (select |#length| |ldv_kobject_cleanup_#in~kobj.base|)) (<= 0 |ldv_kobject_cleanup_#in~kobj.offset|)), 11832#(and (<= 0 ldv_kobject_cleanup_~kobj.offset) (<= (+ ldv_kobject_cleanup_~kobj.offset 16) (select |#length| ldv_kobject_cleanup_~kobj.base)))] [2018-02-02 10:23:34,547 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 10:23:34,548 INFO L409 AbstractCegarLoop]: Interpolant automaton has 23 states [2018-02-02 10:23:34,548 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2018-02-02 10:23:34,548 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=44, Invalid=462, Unknown=0, NotChecked=0, Total=506 [2018-02-02 10:23:34,548 INFO L87 Difference]: Start difference. First operand 168 states and 178 transitions. Second operand 23 states. [2018-02-02 10:23:35,076 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 10:23:35,077 INFO L93 Difference]: Finished difference Result 167 states and 176 transitions. [2018-02-02 10:23:35,077 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2018-02-02 10:23:35,077 INFO L78 Accepts]: Start accepts. Automaton has 23 states. Word has length 110 [2018-02-02 10:23:35,077 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 10:23:35,078 INFO L225 Difference]: With dead ends: 167 [2018-02-02 10:23:35,078 INFO L226 Difference]: Without dead ends: 167 [2018-02-02 10:23:35,078 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 10:23:35,078 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 167 states. [2018-02-02 10:23:35,080 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 167 to 167. [2018-02-02 10:23:35,080 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 167 states. [2018-02-02 10:23:35,080 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 167 states to 167 states and 176 transitions. [2018-02-02 10:23:35,080 INFO L78 Accepts]: Start accepts. Automaton has 167 states and 176 transitions. Word has length 110 [2018-02-02 10:23:35,080 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 10:23:35,081 INFO L432 AbstractCegarLoop]: Abstraction has 167 states and 176 transitions. [2018-02-02 10:23:35,081 INFO L433 AbstractCegarLoop]: Interpolant automaton has 23 states. [2018-02-02 10:23:35,081 INFO L276 IsEmpty]: Start isEmpty. Operand 167 states and 176 transitions. [2018-02-02 10:23:35,081 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 113 [2018-02-02 10:23:35,081 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 10:23:35,081 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] [2018-02-02 10:23:35,081 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 10:23:35,081 INFO L82 PathProgramCache]: Analyzing trace with hash 889527393, now seen corresponding path program 1 times [2018-02-02 10:23:35,082 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 10:23:35,093 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 10:23:35,094 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 10:23:35,322 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 10:23:35,322 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-02 10:23:35,322 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [21] imperfect sequences [] total 21 [2018-02-02 10:23:35,322 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 10:23:35,322 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 10:23:35,322 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~ret19.offset|), 12191#(= 0 entry_point_~kobj~2.offset)] [2018-02-02 10:23:35,323 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 10:23:35,323 INFO L409 AbstractCegarLoop]: Interpolant automaton has 22 states [2018-02-02 10:23:35,323 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2018-02-02 10:23:35,323 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=42, Invalid=420, Unknown=0, NotChecked=0, Total=462 [2018-02-02 10:23:35,323 INFO L87 Difference]: Start difference. First operand 167 states and 176 transitions. Second operand 22 states. [2018-02-02 10:23:35,571 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 10:23:35,571 INFO L93 Difference]: Finished difference Result 166 states and 175 transitions. [2018-02-02 10:23:35,572 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2018-02-02 10:23:35,572 INFO L78 Accepts]: Start accepts. Automaton has 22 states. Word has length 112 [2018-02-02 10:23:35,572 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 10:23:35,573 INFO L225 Difference]: With dead ends: 166 [2018-02-02 10:23:35,573 INFO L226 Difference]: Without dead ends: 166 [2018-02-02 10:23:35,573 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 10:23:35,574 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 166 states. [2018-02-02 10:23:35,576 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 166 to 166. [2018-02-02 10:23:35,576 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 166 states. [2018-02-02 10:23:35,576 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 166 states to 166 states and 175 transitions. [2018-02-02 10:23:35,576 INFO L78 Accepts]: Start accepts. Automaton has 166 states and 175 transitions. Word has length 112 [2018-02-02 10:23:35,577 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 10:23:35,577 INFO L432 AbstractCegarLoop]: Abstraction has 166 states and 175 transitions. [2018-02-02 10:23:35,577 INFO L433 AbstractCegarLoop]: Interpolant automaton has 22 states. [2018-02-02 10:23:35,577 INFO L276 IsEmpty]: Start isEmpty. Operand 166 states and 175 transitions. [2018-02-02 10:23:35,577 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 115 [2018-02-02 10:23:35,578 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 10:23:35,578 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 10:23:35,578 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 10:23:35,578 INFO L82 PathProgramCache]: Analyzing trace with hash 137335490, now seen corresponding path program 1 times [2018-02-02 10:23:35,579 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 10:23:35,628 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 10:23:35,629 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 10:23:37,034 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 10:23:37,034 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-02 10:23:37,034 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [47] imperfect sequences [] total 47 [2018-02-02 10:23:37,034 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 10:23:37,034 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 10:23:37,034 INFO L182 omatonBuilderFactory]: Interpolants [12555#true, 12556#false, 12557#(= 0 |ldv_malloc_#t~malloc4.offset|), 12558#(= 0 |ldv_malloc_#res.offset|), 12559#(= 0 |ldv_kobject_create_#t~ret17.offset|), 12560#(= 0 ldv_kobject_create_~kobj~1.offset), 12561#(or (not (= |#Ultimate.C_memset_#ptr.offset| 0)) (<= |#Ultimate.C_memset_#t~loopctr21| |#Ultimate.C_memset_#amount|)), 12562#(and (= |ldv_kobject_init_#in~kobj.offset| ldv_kobject_init_~kobj.offset) (= ldv_kobject_init_~kobj.base |ldv_kobject_init_#in~kobj.base|)), 12563#(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|))), 12564#(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|))), 12565#(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|)), 12566#(= 1 (select (select |#memory_int| |ldv_kref_init_#in~kref.base|) (- (- |ldv_kref_init_#in~kref.offset|)))), 12567#(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)))), 12568#(= |#memory_int| |old(#memory_int)|), 12569#(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|)), 12570#(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|)), 12571#(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)))), 12572#(or (= 1 (select (select |#memory_int| |ldv_kobject_init_internal_#in~kobj.base|) (- (- 12)))) (not (= |ldv_kobject_init_internal_#in~kobj.offset| 0))), 12573#(or (= 1 (select (select |#memory_int| |ldv_kobject_init_#in~kobj.base|) (- (- 12)))) (not (= |ldv_kobject_init_#in~kobj.offset| 0))), 12574#(and (= 0 ldv_kobject_create_~kobj~1.offset) (= 1 (select (select |#memory_int| ldv_kobject_create_~kobj~1.base) 12))), 12575#(and (= 1 (select (select |#memory_int| |ldv_kobject_create_#res.base|) 12)) (= 0 |ldv_kobject_create_#res.offset|)), 12576#(and (= 0 |entry_point_#t~ret19.offset|) (= 1 (select (select |#memory_int| |entry_point_#t~ret19.base|) 12))), 12577#(and (= 0 entry_point_~kobj~2.offset) (= 1 (select (select |#memory_int| entry_point_~kobj~2.base) 12))), 12578#(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))), 12579#(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))), 12580#(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)), 12581#(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)))), 12582#(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))), 12583#(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|)), 12584#(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))), 12585#(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))), 12586#(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|))))), 12587#(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))), 12588#(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))), 12589#(and (<= 2 (select (select |#memory_int| entry_point_~kobj~2.base) 12)) (= 0 entry_point_~kobj~2.offset)), 12590#(and (<= 2 (select (select |#memory_int| |ldv_kobject_put_#in~kobj.base|) 12)) (= 0 |ldv_kobject_put_#in~kobj.offset|)), 12591#(and (= ldv_kobject_put_~kobj.offset 0) (<= 2 (select (select |#memory_int| ldv_kobject_put_~kobj.base) 12))), 12592#(<= 2 (select (select |#memory_int| |ldv_kref_put_#in~kref.base|) |ldv_kref_put_#in~kref.offset|)), 12593#(<= 2 (select (select |#memory_int| ldv_kref_put_~kref.base) ldv_kref_put_~kref.offset)), 12594#(and (<= 2 (select (select |#memory_int| |ldv_kref_sub_#in~kref.base|) |ldv_kref_sub_#in~kref.offset|)) (= 1 |ldv_kref_sub_#in~count|)), 12595#(and (= ldv_kref_sub_~count 1) (<= 2 (select (select |#memory_int| ldv_kref_sub_~kref.base) ldv_kref_sub_~kref.offset))), 12596#(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|)), 12597#(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|)), 12598#(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|)), 12599#(<= (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)), 12600#(<= (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|)), 12601#(<= 1 |ldv_kref_sub_#t~ret11|)] [2018-02-02 10:23:37,035 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 10:23:37,035 INFO L409 AbstractCegarLoop]: Interpolant automaton has 47 states [2018-02-02 10:23:37,035 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 47 interpolants. [2018-02-02 10:23:37,035 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=114, Invalid=2048, Unknown=0, NotChecked=0, Total=2162 [2018-02-02 10:23:37,036 INFO L87 Difference]: Start difference. First operand 166 states and 175 transitions. Second operand 47 states. [2018-02-02 10:23:38,793 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 10:23:38,793 INFO L93 Difference]: Finished difference Result 159 states and 162 transitions. [2018-02-02 10:23:38,794 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 43 states. [2018-02-02 10:23:38,794 INFO L78 Accepts]: Start accepts. Automaton has 47 states. Word has length 114 [2018-02-02 10:23:38,794 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 10:23:38,795 INFO L225 Difference]: With dead ends: 159 [2018-02-02 10:23:38,795 INFO L226 Difference]: Without dead ends: 159 [2018-02-02 10:23:38,796 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 81 GetRequests, 8 SyntacticMatches, 5 SemanticMatches, 68 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 672 ImplicationChecksByTransitivity, 1.4s TimeCoverageRelationStatistics Valid=243, Invalid=4587, Unknown=0, NotChecked=0, Total=4830 [2018-02-02 10:23:38,796 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 159 states. [2018-02-02 10:23:38,798 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 159 to 159. [2018-02-02 10:23:38,798 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 159 states. [2018-02-02 10:23:38,798 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 159 states to 159 states and 162 transitions. [2018-02-02 10:23:38,799 INFO L78 Accepts]: Start accepts. Automaton has 159 states and 162 transitions. Word has length 114 [2018-02-02 10:23:38,799 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 10:23:38,799 INFO L432 AbstractCegarLoop]: Abstraction has 159 states and 162 transitions. [2018-02-02 10:23:38,799 INFO L433 AbstractCegarLoop]: Interpolant automaton has 47 states. [2018-02-02 10:23:38,799 INFO L276 IsEmpty]: Start isEmpty. Operand 159 states and 162 transitions. [2018-02-02 10:23:38,800 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 122 [2018-02-02 10:23:38,800 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 10:23:38,800 INFO L351 BasicCegarLoop]: trace histogram [16, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 10:23:38,800 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 10:23:38,800 INFO L82 PathProgramCache]: Analyzing trace with hash 1940441039, now seen corresponding path program 1 times [2018-02-02 10:23:38,801 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 10:23:38,818 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 10:23:38,819 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 10:23:39,037 INFO L134 CoverageAnalysis]: Checked inductivity of 145 backedges. 2 proven. 7 refuted. 0 times theorem prover too weak. 136 trivial. 0 not checked. [2018-02-02 10:23:39,037 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-02 10:23:39,037 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [18] total 18 [2018-02-02 10:23:39,037 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 10:23:39,038 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 10:23:39,038 INFO L182 omatonBuilderFactory]: Interpolants [12966#true, 12967#false, 12968#(= ldv_kobject_get_~kobj.base |ldv_kobject_get_#in~kobj.base|), 12969#(= ldv_kref_get_~kref.base |ldv_kref_get_#in~kref.base|), 12970#(= ldv_atomic_add_return_~v.base |ldv_atomic_add_return_#in~v.base|), 12971#(and (= 1 (select |#valid| ldv_atomic_add_return_~v.base)) (= ldv_atomic_add_return_~v.base |ldv_atomic_add_return_#in~v.base|)), 12972#(= 1 (select |#valid| |ldv_atomic_add_return_#in~v.base|)), 12973#(= 1 (select |#valid| |ldv_kref_get_#in~kref.base|)), 12974#(= 1 (select |#valid| |ldv_kobject_get_#in~kobj.base|)), 12975#(= 1 (select |#valid| entry_point_~kobj~2.base)), 12976#(= |#valid| |old(#valid)|), 12977#(= 1 (select |#valid| |ldv_kobject_put_#in~kobj.base|)), 12978#(= 1 (select |#valid| ldv_kobject_put_~kobj.base)), 12979#(= 1 (select |#valid| |ldv_kref_put_#in~kref.base|)), 12980#(= 1 (select |#valid| ldv_kref_put_~kref.base)), 12981#(= 1 (select |#valid| |ldv_kref_sub_#in~kref.base|)), 12982#(= 1 (select |#valid| ldv_kref_sub_~kref.base)), 12983#(= 1 (select |#valid| |ldv_atomic_sub_return_#in~v.base|)), 12984#(= 1 (select |#valid| ldv_atomic_sub_return_~v.base))] [2018-02-02 10:23:39,038 INFO L134 CoverageAnalysis]: Checked inductivity of 145 backedges. 2 proven. 7 refuted. 0 times theorem prover too weak. 136 trivial. 0 not checked. [2018-02-02 10:23:39,038 INFO L409 AbstractCegarLoop]: Interpolant automaton has 19 states [2018-02-02 10:23:39,038 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2018-02-02 10:23:39,039 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=37, Invalid=305, Unknown=0, NotChecked=0, Total=342 [2018-02-02 10:23:39,039 INFO L87 Difference]: Start difference. First operand 159 states and 162 transitions. Second operand 19 states. [2018-02-02 10:23:39,541 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 10:23:39,541 INFO L93 Difference]: Finished difference Result 168 states and 171 transitions. [2018-02-02 10:23:39,541 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2018-02-02 10:23:39,541 INFO L78 Accepts]: Start accepts. Automaton has 19 states. Word has length 121 [2018-02-02 10:23:39,541 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 10:23:39,542 INFO L225 Difference]: With dead ends: 168 [2018-02-02 10:23:39,542 INFO L226 Difference]: Without dead ends: 168 [2018-02-02 10:23:39,542 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 37 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 31 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 121 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=108, Invalid=948, Unknown=0, NotChecked=0, Total=1056 [2018-02-02 10:23:39,543 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 168 states. [2018-02-02 10:23:39,545 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 168 to 166. [2018-02-02 10:23:39,545 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 166 states. [2018-02-02 10:23:39,546 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 166 states to 166 states and 169 transitions. [2018-02-02 10:23:39,546 INFO L78 Accepts]: Start accepts. Automaton has 166 states and 169 transitions. Word has length 121 [2018-02-02 10:23:39,546 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 10:23:39,546 INFO L432 AbstractCegarLoop]: Abstraction has 166 states and 169 transitions. [2018-02-02 10:23:39,546 INFO L433 AbstractCegarLoop]: Interpolant automaton has 19 states. [2018-02-02 10:23:39,547 INFO L276 IsEmpty]: Start isEmpty. Operand 166 states and 169 transitions. [2018-02-02 10:23:39,547 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 136 [2018-02-02 10:23:39,547 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 10:23:39,547 INFO L351 BasicCegarLoop]: trace histogram [16, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 10:23:39,548 INFO L371 AbstractCegarLoop]: === Iteration 41 === [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 10:23:39,548 INFO L82 PathProgramCache]: Analyzing trace with hash -1425069405, now seen corresponding path program 1 times [2018-02-02 10:23:39,548 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 10:23:39,571 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 10:23:39,572 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 10:23:39,828 INFO L134 CoverageAnalysis]: Checked inductivity of 152 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 143 trivial. 0 not checked. [2018-02-02 10:23:39,829 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-02 10:23:39,829 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [21] total 21 [2018-02-02 10:23:39,829 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 10:23:39,829 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 10:23:39,829 INFO L182 omatonBuilderFactory]: Interpolants [13347#true, 13348#false, 13349#(= ldv_kobject_get_~kobj.base |ldv_kobject_get_#in~kobj.base|), 13350#(= ldv_kref_get_~kref.base |ldv_kref_get_#in~kref.base|), 13351#(= ldv_atomic_add_return_~v.base |ldv_atomic_add_return_#in~v.base|), 13352#(= 1 (select |#valid| |ldv_atomic_add_return_#in~v.base|)), 13353#(= 1 (select |#valid| |ldv_kref_get_#in~kref.base|)), 13354#(= 1 (select |#valid| |ldv_kobject_get_#in~kobj.base|)), 13355#(= 1 (select |#valid| entry_point_~kobj~2.base)), 13356#(= |#valid| |old(#valid)|), 13357#(= 1 (select |#valid| |ldv_kobject_put_#in~kobj.base|)), 13358#(= 1 (select |#valid| ldv_kobject_put_~kobj.base)), 13359#(= 1 (select |#valid| |ldv_kref_put_#in~kref.base|)), 13360#(= 1 (select |#valid| ldv_kref_put_~kref.base)), 13361#(= 1 (select |#valid| |ldv_kref_sub_#in~kref.base|)), 13362#(= 1 (select |#valid| ldv_kref_sub_~kref.base)), 13363#(= 1 (select |#valid| |##fun~$Pointer$~TO~VOID_#in~kref.base|)), 13364#(= 1 (select |#valid| |##fun~$Pointer$~TO~VOID_#~kref.base|)), 13365#(= 1 (select |#valid| |ldv_kobject_release_#in~kref.base|)), 13366#(= 1 (select |#valid| ldv_kobject_release_~kobj~0.base)), 13367#(= 1 (select |#valid| |ldv_kobject_cleanup_#in~kobj.base|)), 13368#(= 1 (select |#valid| ldv_kobject_cleanup_~kobj.base))] [2018-02-02 10:23:39,829 INFO L134 CoverageAnalysis]: Checked inductivity of 152 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 143 trivial. 0 not checked. [2018-02-02 10:23:39,829 INFO L409 AbstractCegarLoop]: Interpolant automaton has 22 states [2018-02-02 10:23:39,829 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2018-02-02 10:23:39,830 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=41, Invalid=421, Unknown=0, NotChecked=0, Total=462 [2018-02-02 10:23:39,830 INFO L87 Difference]: Start difference. First operand 166 states and 169 transitions. Second operand 22 states. [2018-02-02 10:23:40,429 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 10:23:40,429 INFO L93 Difference]: Finished difference Result 167 states and 170 transitions. [2018-02-02 10:23:40,429 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2018-02-02 10:23:40,429 INFO L78 Accepts]: Start accepts. Automaton has 22 states. Word has length 135 [2018-02-02 10:23:40,429 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 10:23:40,430 INFO L225 Difference]: With dead ends: 167 [2018-02-02 10:23:40,430 INFO L226 Difference]: Without dead ends: 167 [2018-02-02 10:23:40,431 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 44 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 38 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 144 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=131, Invalid=1429, Unknown=0, NotChecked=0, Total=1560 [2018-02-02 10:23:40,431 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 167 states. [2018-02-02 10:23:40,433 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 167 to 165. [2018-02-02 10:23:40,433 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 165 states. [2018-02-02 10:23:40,434 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 165 states to 165 states and 168 transitions. [2018-02-02 10:23:40,434 INFO L78 Accepts]: Start accepts. Automaton has 165 states and 168 transitions. Word has length 135 [2018-02-02 10:23:40,434 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 10:23:40,434 INFO L432 AbstractCegarLoop]: Abstraction has 165 states and 168 transitions. [2018-02-02 10:23:40,435 INFO L433 AbstractCegarLoop]: Interpolant automaton has 22 states. [2018-02-02 10:23:40,435 INFO L276 IsEmpty]: Start isEmpty. Operand 165 states and 168 transitions. [2018-02-02 10:23:40,435 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 140 [2018-02-02 10:23:40,435 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 10:23:40,435 INFO L351 BasicCegarLoop]: trace histogram [16, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 10:23:40,436 INFO L371 AbstractCegarLoop]: === Iteration 42 === [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 10:23:40,436 INFO L82 PathProgramCache]: Analyzing trace with hash -460832411, now seen corresponding path program 1 times [2018-02-02 10:23:40,436 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 10:23:40,531 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 10:23:40,531 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 10:23:44,826 INFO L134 CoverageAnalysis]: Checked inductivity of 152 backedges. 22 proven. 129 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-02-02 10:23:44,827 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-02 10:23:44,827 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [73] total 73 [2018-02-02 10:23:44,827 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 10:23:44,827 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 10:23:44,828 INFO L182 omatonBuilderFactory]: Interpolants [13737#true, 13738#false, 13739#(= 0 |ldv_malloc_#t~malloc4.offset|), 13740#(= 0 |ldv_malloc_#res.offset|), 13741#(= 0 |ldv_kobject_create_#t~ret17.offset|), 13742#(= 0 ldv_kobject_create_~kobj~1.offset), 13743#(or (not (= |#Ultimate.C_memset_#ptr.offset| 0)) (not (= |#Ultimate.C_memset_#value| 0)) (<= 2 (+ |#Ultimate.C_memset_#ptr.offset| |#Ultimate.C_memset_#t~loopctr21|)) (= 0 (select (store (select |#memory_$Pointer$.offset| |#Ultimate.C_memset_#ptr.base|) (+ |#Ultimate.C_memset_#ptr.offset| |#Ultimate.C_memset_#t~loopctr21|) (+ |#Ultimate.C_memset_#value| (* (- 256) (div |#Ultimate.C_memset_#value| 256)))) 0)) (<= (+ |#Ultimate.C_memset_#ptr.offset| |#Ultimate.C_memset_#t~loopctr21|) 0)), 13744#(or (= 0 (select (store (select |#memory_$Pointer$.offset| |#Ultimate.C_memset_#ptr.base|) (+ |#Ultimate.C_memset_#t~loopctr21| |#Ultimate.C_memset_#ptr.offset|) (+ |#Ultimate.C_memset_#value| (* (- 256) (div |#Ultimate.C_memset_#value| 256)))) 0)) (not (= |#Ultimate.C_memset_#ptr.offset| 0)) (<= 3 (+ |#Ultimate.C_memset_#ptr.offset| |#Ultimate.C_memset_#t~loopctr21|)) (not (= |#Ultimate.C_memset_#value| 0)) (<= (+ |#Ultimate.C_memset_#ptr.offset| |#Ultimate.C_memset_#t~loopctr21|) 1)), 13745#(or (not (= |#Ultimate.C_memset_#ptr.offset| 0)) (<= 4 (+ |#Ultimate.C_memset_#ptr.offset| |#Ultimate.C_memset_#t~loopctr21|)) (not (= |#Ultimate.C_memset_#value| 0)) (<= (+ |#Ultimate.C_memset_#ptr.offset| |#Ultimate.C_memset_#t~loopctr21|) 2) (= 0 (select (store (select |#memory_$Pointer$.offset| |#Ultimate.C_memset_#ptr.base|) (+ |#Ultimate.C_memset_#ptr.offset| |#Ultimate.C_memset_#t~loopctr21|) (+ |#Ultimate.C_memset_#value| (* (- 256) (div |#Ultimate.C_memset_#value| 256)))) 0))), 13746#(or (<= (+ |#Ultimate.C_memset_#ptr.offset| |#Ultimate.C_memset_#t~loopctr21|) 3) (<= 5 (+ |#Ultimate.C_memset_#ptr.offset| |#Ultimate.C_memset_#t~loopctr21|)) (not (= |#Ultimate.C_memset_#ptr.offset| 0)) (not (= |#Ultimate.C_memset_#value| 0)) (= 0 (select (store (select |#memory_$Pointer$.offset| |#Ultimate.C_memset_#ptr.base|) (+ |#Ultimate.C_memset_#ptr.offset| |#Ultimate.C_memset_#t~loopctr21|) (+ |#Ultimate.C_memset_#value| (* (- 256) (div |#Ultimate.C_memset_#value| 256)))) 0))), 13747#(or (not (= |#Ultimate.C_memset_#ptr.offset| 0)) (<= (+ |#Ultimate.C_memset_#ptr.offset| |#Ultimate.C_memset_#t~loopctr21|) 4) (not (= |#Ultimate.C_memset_#value| 0)) (= 0 (select (store (select |#memory_$Pointer$.offset| |#Ultimate.C_memset_#ptr.base|) (+ |#Ultimate.C_memset_#ptr.offset| |#Ultimate.C_memset_#t~loopctr21|) (+ |#Ultimate.C_memset_#value| (* (- 256) (div |#Ultimate.C_memset_#value| 256)))) 0)) (<= 6 (+ |#Ultimate.C_memset_#ptr.offset| |#Ultimate.C_memset_#t~loopctr21|))), 13748#(or (= 0 (select (store (select |#memory_$Pointer$.offset| |#Ultimate.C_memset_#ptr.base|) (+ |#Ultimate.C_memset_#t~loopctr21| |#Ultimate.C_memset_#ptr.offset|) (+ |#Ultimate.C_memset_#value| (* (- 256) (div |#Ultimate.C_memset_#value| 256)))) 0)) (not (= |#Ultimate.C_memset_#ptr.offset| 0)) (not (= |#Ultimate.C_memset_#value| 0)) (<= 7 (+ |#Ultimate.C_memset_#ptr.offset| |#Ultimate.C_memset_#t~loopctr21|)) (<= (+ |#Ultimate.C_memset_#ptr.offset| |#Ultimate.C_memset_#t~loopctr21|) 5)), 13749#(or (<= (+ |#Ultimate.C_memset_#ptr.offset| |#Ultimate.C_memset_#t~loopctr21|) 6) (= 0 (select (store (select |#memory_$Pointer$.offset| |#Ultimate.C_memset_#ptr.base|) (+ |#Ultimate.C_memset_#t~loopctr21| |#Ultimate.C_memset_#ptr.offset|) (+ |#Ultimate.C_memset_#value| (* (- 256) (div |#Ultimate.C_memset_#value| 256)))) 0)) (not (= |#Ultimate.C_memset_#ptr.offset| 0)) (<= 8 (+ |#Ultimate.C_memset_#ptr.offset| |#Ultimate.C_memset_#t~loopctr21|)) (not (= |#Ultimate.C_memset_#value| 0))), 13750#(or (= 0 (select (store (select |#memory_$Pointer$.offset| |#Ultimate.C_memset_#ptr.base|) (+ |#Ultimate.C_memset_#t~loopctr21| |#Ultimate.C_memset_#ptr.offset|) (+ |#Ultimate.C_memset_#value| (* (- 256) (div |#Ultimate.C_memset_#value| 256)))) 0)) (not (= |#Ultimate.C_memset_#ptr.offset| 0)) (<= 9 (+ |#Ultimate.C_memset_#ptr.offset| |#Ultimate.C_memset_#t~loopctr21|)) (not (= |#Ultimate.C_memset_#value| 0)) (<= (+ |#Ultimate.C_memset_#ptr.offset| |#Ultimate.C_memset_#t~loopctr21|) 7)), 13751#(or (= 0 (select (store (select |#memory_$Pointer$.offset| |#Ultimate.C_memset_#ptr.base|) (+ |#Ultimate.C_memset_#t~loopctr21| |#Ultimate.C_memset_#ptr.offset|) (+ |#Ultimate.C_memset_#value| (* (- 256) (div |#Ultimate.C_memset_#value| 256)))) 0)) (<= (+ |#Ultimate.C_memset_#ptr.offset| |#Ultimate.C_memset_#t~loopctr21|) 8) (not (= |#Ultimate.C_memset_#ptr.offset| 0)) (<= 10 (+ |#Ultimate.C_memset_#ptr.offset| |#Ultimate.C_memset_#t~loopctr21|)) (not (= |#Ultimate.C_memset_#value| 0))), 13752#(or (not (= |#Ultimate.C_memset_#ptr.offset| 0)) (not (= |#Ultimate.C_memset_#value| 0)) (<= 11 (+ |#Ultimate.C_memset_#ptr.offset| |#Ultimate.C_memset_#t~loopctr21|)) (= 0 (select (store (select |#memory_$Pointer$.offset| |#Ultimate.C_memset_#ptr.base|) (+ |#Ultimate.C_memset_#ptr.offset| |#Ultimate.C_memset_#t~loopctr21|) (+ |#Ultimate.C_memset_#value| (* (- 256) (div |#Ultimate.C_memset_#value| 256)))) 0)) (<= (+ |#Ultimate.C_memset_#ptr.offset| |#Ultimate.C_memset_#t~loopctr21|) 9)), 13753#(or (<= (+ |#Ultimate.C_memset_#ptr.offset| |#Ultimate.C_memset_#t~loopctr21|) 10) (not (= |#Ultimate.C_memset_#ptr.offset| 0)) (not (= |#Ultimate.C_memset_#value| 0)) (<= 12 (+ |#Ultimate.C_memset_#ptr.offset| |#Ultimate.C_memset_#t~loopctr21|)) (= 0 (select (store (select |#memory_$Pointer$.offset| |#Ultimate.C_memset_#ptr.base|) (+ |#Ultimate.C_memset_#ptr.offset| |#Ultimate.C_memset_#t~loopctr21|) (+ |#Ultimate.C_memset_#value| (* (- 256) (div |#Ultimate.C_memset_#value| 256)))) 0))), 13754#(or (not (= |#Ultimate.C_memset_#ptr.offset| 0)) (not (= |#Ultimate.C_memset_#value| 0)) (= 0 (select (store (select |#memory_$Pointer$.offset| |#Ultimate.C_memset_#ptr.base|) (+ |#Ultimate.C_memset_#ptr.offset| |#Ultimate.C_memset_#t~loopctr21|) (+ |#Ultimate.C_memset_#value| (* (- 256) (div |#Ultimate.C_memset_#value| 256)))) 0)) (<= 13 (+ |#Ultimate.C_memset_#ptr.offset| |#Ultimate.C_memset_#t~loopctr21|)) (<= (+ |#Ultimate.C_memset_#ptr.offset| |#Ultimate.C_memset_#t~loopctr21|) 11)), 13755#(or (= 0 (select (store (select |#memory_$Pointer$.offset| |#Ultimate.C_memset_#ptr.base|) (+ |#Ultimate.C_memset_#t~loopctr21| |#Ultimate.C_memset_#ptr.offset|) (+ |#Ultimate.C_memset_#value| (* (- 256) (div |#Ultimate.C_memset_#value| 256)))) 0)) (not (= |#Ultimate.C_memset_#ptr.offset| 0)) (not (= |#Ultimate.C_memset_#value| 0)) (<= 14 (+ |#Ultimate.C_memset_#ptr.offset| |#Ultimate.C_memset_#t~loopctr21|)) (<= (+ |#Ultimate.C_memset_#ptr.offset| |#Ultimate.C_memset_#t~loopctr21|) 12)), 13756#(or (not (= |#Ultimate.C_memset_#ptr.offset| 0)) (<= (+ |#Ultimate.C_memset_#ptr.offset| |#Ultimate.C_memset_#t~loopctr21|) 13) (not (= |#Ultimate.C_memset_#value| 0)) (= 0 (select (store (select |#memory_$Pointer$.offset| |#Ultimate.C_memset_#ptr.base|) (+ |#Ultimate.C_memset_#ptr.offset| |#Ultimate.C_memset_#t~loopctr21|) (+ |#Ultimate.C_memset_#value| (* (- 256) (div |#Ultimate.C_memset_#value| 256)))) 0)) (<= 15 (+ |#Ultimate.C_memset_#ptr.offset| |#Ultimate.C_memset_#t~loopctr21|))), 13757#(or (not (= |#Ultimate.C_memset_#ptr.offset| 0)) (not (= |#Ultimate.C_memset_#value| 0)) (<= 16 (+ |#Ultimate.C_memset_#ptr.offset| |#Ultimate.C_memset_#t~loopctr21|)) (= 0 (select (store (select |#memory_$Pointer$.offset| |#Ultimate.C_memset_#ptr.base|) (+ |#Ultimate.C_memset_#ptr.offset| |#Ultimate.C_memset_#t~loopctr21|) (+ |#Ultimate.C_memset_#value| (* (- 256) (div |#Ultimate.C_memset_#value| 256)))) 0)) (<= (+ |#Ultimate.C_memset_#ptr.offset| |#Ultimate.C_memset_#t~loopctr21|) 14)), 13758#(or (<= 17 (+ |#Ultimate.C_memset_#ptr.offset| |#Ultimate.C_memset_#amount|)) (<= (+ |#Ultimate.C_memset_#ptr.offset| |#Ultimate.C_memset_#t~loopctr21|) 15) (and (<= |#Ultimate.C_memset_#t~loopctr21| |#Ultimate.C_memset_#amount|) (= 0 (select (select |#memory_$Pointer$.offset| |#Ultimate.C_memset_#ptr.base|) 0))) (not (= |#Ultimate.C_memset_#ptr.offset| 0)) (not (= |#Ultimate.C_memset_#value| 0))), 13759#(or (<= 17 (+ |#Ultimate.C_memset_#ptr.offset| |#Ultimate.C_memset_#amount|)) (<= (+ |#Ultimate.C_memset_#ptr.offset| |#Ultimate.C_memset_#amount|) 15) (not (= |#Ultimate.C_memset_#ptr.offset| 0)) (= 0 (select (select |#memory_$Pointer$.offset| |#Ultimate.C_memset_#ptr.base|) 0)) (not (= |#Ultimate.C_memset_#value| 0))), 13760#(and (= 0 ldv_kobject_create_~kobj~1.offset) (= 0 (select (select |#memory_$Pointer$.offset| ldv_kobject_create_~kobj~1.base) 0))), 13761#(= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|), 13762#(and (= |ldv_kobject_init_#in~kobj.offset| ldv_kobject_init_~kobj.offset) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |ldv_kobject_init_#in~kobj.base| ldv_kobject_init_~kobj.base)), 13763#(and (or (= ldv_kobject_init_internal_~kobj.offset |ldv_kobject_init_internal_#in~kobj.offset|) (= ldv_kobject_init_internal_~kobj.offset 0)) (or (and (= ldv_kobject_init_internal_~kobj.base |ldv_kobject_init_internal_#in~kobj.base|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|)) (not (= ldv_kobject_init_internal_~kobj.offset 0)))), 13764#(and (or (= ldv_kobject_init_internal_~kobj.offset 0) (not (= |ldv_kobject_init_internal_#in~kobj.offset| 0))) (or (and (= ldv_kobject_init_internal_~kobj.base |ldv_kobject_init_internal_#in~kobj.base|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|)) (not (= ldv_kobject_init_internal_~kobj.offset 0)))), 13765#(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|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|)), 13766#(and (= (store (select |old(#memory_$Pointer$.offset)| |ldv_kref_init_#in~kref.base|) (@diff (select |old(#memory_$Pointer$.offset)| |ldv_kref_init_#in~kref.base|) (select |#memory_$Pointer$.offset| |ldv_kref_init_#in~kref.base|)) (select (select |#memory_$Pointer$.offset| |ldv_kref_init_#in~kref.base|) (@diff (select |old(#memory_$Pointer$.offset)| |ldv_kref_init_#in~kref.base|) (select |#memory_$Pointer$.offset| |ldv_kref_init_#in~kref.base|)))) (select |#memory_$Pointer$.offset| |ldv_kref_init_#in~kref.base|)) (or (= (select |old(#memory_$Pointer$.offset)| |ldv_kref_init_#in~kref.base|) (select |#memory_$Pointer$.offset| |ldv_kref_init_#in~kref.base|)) (= |ldv_kref_init_#in~kref.offset| (@diff (select |old(#memory_$Pointer$.offset)| |ldv_kref_init_#in~kref.base|) (select |#memory_$Pointer$.offset| |ldv_kref_init_#in~kref.base|))))), 13767#(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)) (and (or (= (select |#memory_$Pointer$.offset| ldv_kobject_init_internal_~kobj.base) (select |old(#memory_$Pointer$.offset)| |ldv_kobject_init_internal_#in~kobj.base|)) (= (+ ldv_kobject_init_internal_~kobj.offset 12) (@diff (select |old(#memory_$Pointer$.offset)| |ldv_kobject_init_internal_#in~kobj.base|) (select |#memory_$Pointer$.offset| ldv_kobject_init_internal_~kobj.base)))) (= |ldv_kobject_init_internal_#in~kobj.base| ldv_kobject_init_internal_~kobj.base) (= (select |#memory_$Pointer$.offset| ldv_kobject_init_internal_~kobj.base) (store (select |old(#memory_$Pointer$.offset)| |ldv_kobject_init_internal_#in~kobj.base|) (@diff (select |old(#memory_$Pointer$.offset)| |ldv_kobject_init_internal_#in~kobj.base|) (select |#memory_$Pointer$.offset| ldv_kobject_init_internal_~kobj.base)) (select (select |#memory_$Pointer$.offset| ldv_kobject_init_internal_~kobj.base) (@diff (select |old(#memory_$Pointer$.offset)| |ldv_kobject_init_internal_#in~kobj.base|) (select |#memory_$Pointer$.offset| ldv_kobject_init_internal_~kobj.base)))))))), 13768#(and (= LDV_INIT_LIST_HEAD_~list.base |LDV_INIT_LIST_HEAD_#in~list.base|) (<= |LDV_INIT_LIST_HEAD_#in~list.offset| LDV_INIT_LIST_HEAD_~list.offset) (<= LDV_INIT_LIST_HEAD_~list.offset |LDV_INIT_LIST_HEAD_#in~list.offset|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|)), 13769#(and (= LDV_INIT_LIST_HEAD_~list.base |LDV_INIT_LIST_HEAD_#in~list.base|) (= (store (select |old(#memory_$Pointer$.offset)| LDV_INIT_LIST_HEAD_~list.base) LDV_INIT_LIST_HEAD_~list.offset (select (select |#memory_$Pointer$.offset| LDV_INIT_LIST_HEAD_~list.base) LDV_INIT_LIST_HEAD_~list.offset)) (select |#memory_$Pointer$.offset| LDV_INIT_LIST_HEAD_~list.base)) (<= |LDV_INIT_LIST_HEAD_#in~list.offset| LDV_INIT_LIST_HEAD_~list.offset) (<= LDV_INIT_LIST_HEAD_~list.offset |LDV_INIT_LIST_HEAD_#in~list.offset|)), 13770#(and (= (store (store (select |old(#memory_$Pointer$.offset)| |LDV_INIT_LIST_HEAD_#in~list.base|) (@diff (select |old(#memory_$Pointer$.offset)| |LDV_INIT_LIST_HEAD_#in~list.base|) (select |#memory_$Pointer$.offset| |LDV_INIT_LIST_HEAD_#in~list.base|)) (select (select |#memory_$Pointer$.offset| |LDV_INIT_LIST_HEAD_#in~list.base|) (@diff (select |old(#memory_$Pointer$.offset)| |LDV_INIT_LIST_HEAD_#in~list.base|) (select |#memory_$Pointer$.offset| |LDV_INIT_LIST_HEAD_#in~list.base|)))) (@diff (store (select |old(#memory_$Pointer$.offset)| |LDV_INIT_LIST_HEAD_#in~list.base|) (@diff (select |old(#memory_$Pointer$.offset)| |LDV_INIT_LIST_HEAD_#in~list.base|) (select |#memory_$Pointer$.offset| |LDV_INIT_LIST_HEAD_#in~list.base|)) (select (select |#memory_$Pointer$.offset| |LDV_INIT_LIST_HEAD_#in~list.base|) (@diff (select |old(#memory_$Pointer$.offset)| |LDV_INIT_LIST_HEAD_#in~list.base|) (select |#memory_$Pointer$.offset| |LDV_INIT_LIST_HEAD_#in~list.base|)))) (select |#memory_$Pointer$.offset| |LDV_INIT_LIST_HEAD_#in~list.base|)) (select (select |#memory_$Pointer$.offset| |LDV_INIT_LIST_HEAD_#in~list.base|) (@diff (store (select |old(#memory_$Pointer$.offset)| |LDV_INIT_LIST_HEAD_#in~list.base|) (@diff (select |old(#memory_$Pointer$.offset)| |LDV_INIT_LIST_HEAD_#in~list.base|) (select |#memory_$Pointer$.offset| |LDV_INIT_LIST_HEAD_#in~list.base|)) (select (select |#memory_$Pointer$.offset| |LDV_INIT_LIST_HEAD_#in~list.base|) (@diff (select |old(#memory_$Pointer$.offset)| |LDV_INIT_LIST_HEAD_#in~list.base|) (select |#memory_$Pointer$.offset| |LDV_INIT_LIST_HEAD_#in~list.base|)))) (select |#memory_$Pointer$.offset| |LDV_INIT_LIST_HEAD_#in~list.base|)))) (select |#memory_$Pointer$.offset| |LDV_INIT_LIST_HEAD_#in~list.base|)) (or (= (select |#memory_$Pointer$.offset| |LDV_INIT_LIST_HEAD_#in~list.base|) (store (select |old(#memory_$Pointer$.offset)| |LDV_INIT_LIST_HEAD_#in~list.base|) (@diff (select |old(#memory_$Pointer$.offset)| |LDV_INIT_LIST_HEAD_#in~list.base|) (select |#memory_$Pointer$.offset| |LDV_INIT_LIST_HEAD_#in~list.base|)) (select (select |#memory_$Pointer$.offset| |LDV_INIT_LIST_HEAD_#in~list.base|) (@diff (select |old(#memory_$Pointer$.offset)| |LDV_INIT_LIST_HEAD_#in~list.base|) (select |#memory_$Pointer$.offset| |LDV_INIT_LIST_HEAD_#in~list.base|))))) (<= |LDV_INIT_LIST_HEAD_#in~list.offset| (@diff (store (select |old(#memory_$Pointer$.offset)| |LDV_INIT_LIST_HEAD_#in~list.base|) (@diff (select |old(#memory_$Pointer$.offset)| |LDV_INIT_LIST_HEAD_#in~list.base|) (select |#memory_$Pointer$.offset| |LDV_INIT_LIST_HEAD_#in~list.base|)) (select (select |#memory_$Pointer$.offset| |LDV_INIT_LIST_HEAD_#in~list.base|) (@diff (select |old(#memory_$Pointer$.offset)| |LDV_INIT_LIST_HEAD_#in~list.base|) (select |#memory_$Pointer$.offset| |LDV_INIT_LIST_HEAD_#in~list.base|)))) (select |#memory_$Pointer$.offset| |LDV_INIT_LIST_HEAD_#in~list.base|)))) (or (= (select |#memory_$Pointer$.offset| |LDV_INIT_LIST_HEAD_#in~list.base|) (select |old(#memory_$Pointer$.offset)| |LDV_INIT_LIST_HEAD_#in~list.base|)) (<= |LDV_INIT_LIST_HEAD_#in~list.offset| (@diff (select |old(#memory_$Pointer$.offset)| |LDV_INIT_LIST_HEAD_#in~list.base|) (select |#memory_$Pointer$.offset| |LDV_INIT_LIST_HEAD_#in~list.base|))))), 13771#(or (and (or (<= 4 (@diff (store (store (select |old(#memory_$Pointer$.offset)| |ldv_kobject_init_internal_#in~kobj.base|) (@diff (select |old(#memory_$Pointer$.offset)| |ldv_kobject_init_internal_#in~kobj.base|) (select |#memory_$Pointer$.offset| |ldv_kobject_init_internal_#in~kobj.base|)) (select (select |#memory_$Pointer$.offset| |ldv_kobject_init_internal_#in~kobj.base|) (@diff (select |old(#memory_$Pointer$.offset)| |ldv_kobject_init_internal_#in~kobj.base|) (select |#memory_$Pointer$.offset| |ldv_kobject_init_internal_#in~kobj.base|)))) (@diff (store (select |old(#memory_$Pointer$.offset)| |ldv_kobject_init_internal_#in~kobj.base|) (@diff (select |old(#memory_$Pointer$.offset)| |ldv_kobject_init_internal_#in~kobj.base|) (select |#memory_$Pointer$.offset| |ldv_kobject_init_internal_#in~kobj.base|)) (select (select |#memory_$Pointer$.offset| |ldv_kobject_init_internal_#in~kobj.base|) (@diff (select |old(#memory_$Pointer$.offset)| |ldv_kobject_init_internal_#in~kobj.base|) (select |#memory_$Pointer$.offset| |ldv_kobject_init_internal_#in~kobj.base|)))) (select |#memory_$Pointer$.offset| |ldv_kobject_init_internal_#in~kobj.base|)) (select (select |#memory_$Pointer$.offset| |ldv_kobject_init_internal_#in~kobj.base|) (@diff (store (select |old(#memory_$Pointer$.offset)| |ldv_kobject_init_internal_#in~kobj.base|) (@diff (select |old(#memory_$Pointer$.offset)| |ldv_kobject_init_internal_#in~kobj.base|) (select |#memory_$Pointer$.offset| |ldv_kobject_init_internal_#in~kobj.base|)) (select (select |#memory_$Pointer$.offset| |ldv_kobject_init_internal_#in~kobj.base|) (@diff (select |old(#memory_$Pointer$.offset)| |ldv_kobject_init_internal_#in~kobj.base|) (select |#memory_$Pointer$.offset| |ldv_kobject_init_internal_#in~kobj.base|)))) (select |#memory_$Pointer$.offset| |ldv_kobject_init_internal_#in~kobj.base|)))) (select |#memory_$Pointer$.offset| |ldv_kobject_init_internal_#in~kobj.base|))) (= (store (store (select |old(#memory_$Pointer$.offset)| |ldv_kobject_init_internal_#in~kobj.base|) (@diff (select |old(#memory_$Pointer$.offset)| |ldv_kobject_init_internal_#in~kobj.base|) (select |#memory_$Pointer$.offset| |ldv_kobject_init_internal_#in~kobj.base|)) (select (select |#memory_$Pointer$.offset| |ldv_kobject_init_internal_#in~kobj.base|) (@diff (select |old(#memory_$Pointer$.offset)| |ldv_kobject_init_internal_#in~kobj.base|) (select |#memory_$Pointer$.offset| |ldv_kobject_init_internal_#in~kobj.base|)))) (@diff (store (select |old(#memory_$Pointer$.offset)| |ldv_kobject_init_internal_#in~kobj.base|) (@diff (select |old(#memory_$Pointer$.offset)| |ldv_kobject_init_internal_#in~kobj.base|) (select |#memory_$Pointer$.offset| |ldv_kobject_init_internal_#in~kobj.base|)) (select (select |#memory_$Pointer$.offset| |ldv_kobject_init_internal_#in~kobj.base|) (@diff (select |old(#memory_$Pointer$.offset)| |ldv_kobject_init_internal_#in~kobj.base|) (select |#memory_$Pointer$.offset| |ldv_kobject_init_internal_#in~kobj.base|)))) (select |#memory_$Pointer$.offset| |ldv_kobject_init_internal_#in~kobj.base|)) (select (select |#memory_$Pointer$.offset| |ldv_kobject_init_internal_#in~kobj.base|) (@diff (store (select |old(#memory_$Pointer$.offset)| |ldv_kobject_init_internal_#in~kobj.base|) (@diff (select |old(#memory_$Pointer$.offset)| |ldv_kobject_init_internal_#in~kobj.base|) (select |#memory_$Pointer$.offset| |ldv_kobject_init_internal_#in~kobj.base|)) (select (select |#memory_$Pointer$.offset| |ldv_kobject_init_internal_#in~kobj.base|) (@diff (select |old(#memory_$Pointer$.offset)| |ldv_kobject_init_internal_#in~kobj.base|) (select |#memory_$Pointer$.offset| |ldv_kobject_init_internal_#in~kobj.base|)))) (select |#memory_$Pointer$.offset| |ldv_kobject_init_internal_#in~kobj.base|)))) (select |#memory_$Pointer$.offset| |ldv_kobject_init_internal_#in~kobj.base|))) (= (select |#memory_$Pointer$.offset| |ldv_kobject_init_internal_#in~kobj.base|) (store (store (store (select |old(#memory_$Pointer$.offset)| |ldv_kobject_init_internal_#in~kobj.base|) (@diff (select |old(#memory_$Pointer$.offset)| |ldv_kobject_init_internal_#in~kobj.base|) (select |#memory_$Pointer$.offset| |ldv_kobject_init_internal_#in~kobj.base|)) (select (select |#memory_$Pointer$.offset| |ldv_kobject_init_internal_#in~kobj.base|) (@diff (select |old(#memory_$Pointer$.offset)| |ldv_kobject_init_internal_#in~kobj.base|) (select |#memory_$Pointer$.offset| |ldv_kobject_init_internal_#in~kobj.base|)))) (@diff (store (select |old(#memory_$Pointer$.offset)| |ldv_kobject_init_internal_#in~kobj.base|) (@diff (select |old(#memory_$Pointer$.offset)| |ldv_kobject_init_internal_#in~kobj.base|) (select |#memory_$Pointer$.offset| |ldv_kobject_init_internal_#in~kobj.base|)) (select (select |#memory_$Pointer$.offset| |ldv_kobject_init_internal_#in~kobj.base|) (@diff (select |old(#memory_$Pointer$.offset)| |ldv_kobject_init_internal_#in~kobj.base|) (select |#memory_$Pointer$.offset| |ldv_kobject_init_internal_#in~kobj.base|)))) (select |#memory_$Pointer$.offset| |ldv_kobject_init_internal_#in~kobj.base|)) (select (select |#memory_$Pointer$.offset| |ldv_kobject_init_internal_#in~kobj.base|) (@diff (store (select |old(#memory_$Pointer$.offset)| |ldv_kobject_init_internal_#in~kobj.base|) (@diff (select |old(#memory_$Pointer$.offset)| |ldv_kobject_init_internal_#in~kobj.base|) (select |#memory_$Pointer$.offset| |ldv_kobject_init_internal_#in~kobj.base|)) (select (select |#memory_$Pointer$.offset| |ldv_kobject_init_internal_#in~kobj.base|) (@diff (select |old(#memory_$Pointer$.offset)| |ldv_kobject_init_internal_#in~kobj.base|) (select |#memory_$Pointer$.offset| |ldv_kobject_init_internal_#in~kobj.base|)))) (select |#memory_$Pointer$.offset| |ldv_kobject_init_internal_#in~kobj.base|)))) (@diff (store (store (select |old(#memory_$Pointer$.offset)| |ldv_kobject_init_internal_#in~kobj.base|) (@diff (select |old(#memory_$Pointer$.offset)| |ldv_kobject_init_internal_#in~kobj.base|) (select |#memory_$Pointer$.offset| |ldv_kobject_init_internal_#in~kobj.base|)) (select (select |#memory_$Pointer$.offset| |ldv_kobject_init_internal_#in~kobj.base|) (@diff (select |old(#memory_$Pointer$.offset)| |ldv_kobject_init_internal_#in~kobj.base|) (select |#memory_$Pointer$.offset| |ldv_kobject_init_internal_#in~kobj.base|)))) (@diff (store (select |old(#memory_$Pointer$.offset)| |ldv_kobject_init_internal_#in~kobj.base|) (@diff (select |old(#memory_$Pointer$.offset)| |ldv_kobject_init_internal_#in~kobj.base|) (select |#memory_$Pointer$.offset| |ldv_kobject_init_internal_#in~kobj.base|)) (select (select |#memory_$Pointer$.offset| |ldv_kobject_init_internal_#in~kobj.base|) (@diff (select |old(#memory_$Pointer$.offset)| |ldv_kobject_init_internal_#in~kobj.base|) (select |#memory_$Pointer$.offset| |ldv_kobject_init_internal_#in~kobj.base|)))) (select |#memory_$Pointer$.offset| |ldv_kobject_init_internal_#in~kobj.base|)) (select (select |#memory_$Pointer$.offset| |ldv_kobject_init_internal_#in~kobj.base|) (@diff (store (select |old(#memory_$Pointer$.offset)| |ldv_kobject_init_internal_#in~kobj.base|) (@diff (select |old(#memory_$Pointer$.offset)| |ldv_kobject_init_internal_#in~kobj.base|) (select |#memory_$Pointer$.offset| |ldv_kobject_init_internal_#in~kobj.base|)) (select (select |#memory_$Pointer$.offset| |ldv_kobject_init_internal_#in~kobj.base|) (@diff (select |old(#memory_$Pointer$.offset)| |ldv_kobject_init_internal_#in~kobj.base|) (select |#memory_$Pointer$.offset| |ldv_kobject_init_internal_#in~kobj.base|)))) (select |#memory_$Pointer$.offset| |ldv_kobject_init_internal_#in~kobj.base|)))) (select |#memory_$Pointer$.offset| |ldv_kobject_init_internal_#in~kobj.base|)) (select (select |#memory_$Pointer$.offset| |ldv_kobject_init_internal_#in~kobj.base|) (@diff (store (store (select |old(#memory_$Pointer$.offset)| |ldv_kobject_init_internal_#in~kobj.base|) (@diff (select |old(#memory_$Pointer$.offset)| |ldv_kobject_init_internal_#in~kobj.base|) (select |#memory_$Pointer$.offset| |ldv_kobject_init_internal_#in~kobj.base|)) (select (select |#memory_$Pointer$.offset| |ldv_kobject_init_internal_#in~kobj.base|) (@diff (select |old(#memory_$Pointer$.offset)| |ldv_kobject_init_internal_#in~kobj.base|) (select |#memory_$Pointer$.offset| |ldv_kobject_init_internal_#in~kobj.base|)))) (@diff (store (select |old(#memory_$Pointer$.offset)| |ldv_kobject_init_internal_#in~kobj.base|) (@diff (select |old(#memory_$Pointer$.offset)| |ldv_kobject_init_internal_#in~kobj.base|) (select |#memory_$Pointer$.offset| |ldv_kobject_init_internal_#in~kobj.base|)) (select (select |#memory_$Pointer$.offset| |ldv_kobject_init_internal_#in~kobj.base|) (@diff (select |old(#memory_$Pointer$.offset)| |ldv_kobject_init_internal_#in~kobj.base|) (select |#memory_$Pointer$.offset| |ldv_kobject_init_internal_#in~kobj.base|)))) (select |#memory_$Pointer$.offset| |ldv_kobject_init_internal_#in~kobj.base|)) (select (select |#memory_$Pointer$.offset| |ldv_kobject_init_internal_#in~kobj.base|) (@diff (store (select |old(#memory_$Pointer$.offset)| |ldv_kobject_init_internal_#in~kobj.base|) (@diff (select |old(#memory_$Pointer$.offset)| |ldv_kobject_init_internal_#in~kobj.base|) (select |#memory_$Pointer$.offset| |ldv_kobject_init_internal_#in~kobj.base|)) (select (select |#memory_$Pointer$.offset| |ldv_kobject_init_internal_#in~kobj.base|) (@diff (select |old(#memory_$Pointer$.offset)| |ldv_kobject_init_internal_#in~kobj.base|) (select |#memory_$Pointer$.offset| |ldv_kobject_init_internal_#in~kobj.base|)))) (select |#memory_$Pointer$.offset| |ldv_kobject_init_internal_#in~kobj.base|)))) (select |#memory_$Pointer$.offset| |ldv_kobject_init_internal_#in~kobj.base|))))) (or (<= 4 (@diff (select |old(#memory_$Pointer$.offset)| |ldv_kobject_init_internal_#in~kobj.base|) (select |#memory_$Pointer$.offset| |ldv_kobject_init_internal_#in~kobj.base|))) (= (select |#memory_$Pointer$.offset| |ldv_kobject_init_internal_#in~kobj.base|) (select |old(#memory_$Pointer$.offset)| |ldv_kobject_init_internal_#in~kobj.base|))) (or (= (store (select |old(#memory_$Pointer$.offset)| |ldv_kobject_init_internal_#in~kobj.base|) (@diff (select |old(#memory_$Pointer$.offset)| |ldv_kobject_init_internal_#in~kobj.base|) (select |#memory_$Pointer$.offset| |ldv_kobject_init_internal_#in~kobj.base|)) (select (select |#memory_$Pointer$.offset| |ldv_kobject_init_internal_#in~kobj.base|) (@diff (select |old(#memory_$Pointer$.offset)| |ldv_kobject_init_internal_#in~kobj.base|) (select |#memory_$Pointer$.offset| |ldv_kobject_init_internal_#in~kobj.base|)))) (select |#memory_$Pointer$.offset| |ldv_kobject_init_internal_#in~kobj.base|)) (<= 4 (@diff (store (select |old(#memory_$Pointer$.offset)| |ldv_kobject_init_internal_#in~kobj.base|) (@diff (select |old(#memory_$Pointer$.offset)| |ldv_kobject_init_internal_#in~kobj.base|) (select |#memory_$Pointer$.offset| |ldv_kobject_init_internal_#in~kobj.base|)) (select (select |#memory_$Pointer$.offset| |ldv_kobject_init_internal_#in~kobj.base|) (@diff (select |old(#memory_$Pointer$.offset)| |ldv_kobject_init_internal_#in~kobj.base|) (select |#memory_$Pointer$.offset| |ldv_kobject_init_internal_#in~kobj.base|)))) (select |#memory_$Pointer$.offset| |ldv_kobject_init_internal_#in~kobj.base|))))) (not (= |ldv_kobject_init_internal_#in~kobj.offset| 0))), 13772#(or (and (or (<= 4 (@diff (select |old(#memory_$Pointer$.offset)| |ldv_kobject_init_#in~kobj.base|) (select |#memory_$Pointer$.offset| |ldv_kobject_init_#in~kobj.base|))) (= (select |#memory_$Pointer$.offset| |ldv_kobject_init_#in~kobj.base|) (select |old(#memory_$Pointer$.offset)| |ldv_kobject_init_#in~kobj.base|))) (= (store (store (store (select |old(#memory_$Pointer$.offset)| |ldv_kobject_init_#in~kobj.base|) (@diff (select |old(#memory_$Pointer$.offset)| |ldv_kobject_init_#in~kobj.base|) (select |#memory_$Pointer$.offset| |ldv_kobject_init_#in~kobj.base|)) (select (select |#memory_$Pointer$.offset| |ldv_kobject_init_#in~kobj.base|) (@diff (select |old(#memory_$Pointer$.offset)| |ldv_kobject_init_#in~kobj.base|) (select |#memory_$Pointer$.offset| |ldv_kobject_init_#in~kobj.base|)))) (@diff (store (select |old(#memory_$Pointer$.offset)| |ldv_kobject_init_#in~kobj.base|) (@diff (select |old(#memory_$Pointer$.offset)| |ldv_kobject_init_#in~kobj.base|) (select |#memory_$Pointer$.offset| |ldv_kobject_init_#in~kobj.base|)) (select (select |#memory_$Pointer$.offset| |ldv_kobject_init_#in~kobj.base|) (@diff (select |old(#memory_$Pointer$.offset)| |ldv_kobject_init_#in~kobj.base|) (select |#memory_$Pointer$.offset| |ldv_kobject_init_#in~kobj.base|)))) (select |#memory_$Pointer$.offset| |ldv_kobject_init_#in~kobj.base|)) (select (select |#memory_$Pointer$.offset| |ldv_kobject_init_#in~kobj.base|) (@diff (store (select |old(#memory_$Pointer$.offset)| |ldv_kobject_init_#in~kobj.base|) (@diff (select |old(#memory_$Pointer$.offset)| |ldv_kobject_init_#in~kobj.base|) (select |#memory_$Pointer$.offset| |ldv_kobject_init_#in~kobj.base|)) (select (select |#memory_$Pointer$.offset| |ldv_kobject_init_#in~kobj.base|) (@diff (select |old(#memory_$Pointer$.offset)| |ldv_kobject_init_#in~kobj.base|) (select |#memory_$Pointer$.offset| |ldv_kobject_init_#in~kobj.base|)))) (select |#memory_$Pointer$.offset| |ldv_kobject_init_#in~kobj.base|)))) (@diff (store (store (select |old(#memory_$Pointer$.offset)| |ldv_kobject_init_#in~kobj.base|) (@diff (select |old(#memory_$Pointer$.offset)| |ldv_kobject_init_#in~kobj.base|) (select |#memory_$Pointer$.offset| |ldv_kobject_init_#in~kobj.base|)) (select (select |#memory_$Pointer$.offset| |ldv_kobject_init_#in~kobj.base|) (@diff (select |old(#memory_$Pointer$.offset)| |ldv_kobject_init_#in~kobj.base|) (select |#memory_$Pointer$.offset| |ldv_kobject_init_#in~kobj.base|)))) (@diff (store (select |old(#memory_$Pointer$.offset)| |ldv_kobject_init_#in~kobj.base|) (@diff (select |old(#memory_$Pointer$.offset)| |ldv_kobject_init_#in~kobj.base|) (select |#memory_$Pointer$.offset| |ldv_kobject_init_#in~kobj.base|)) (select (select |#memory_$Pointer$.offset| |ldv_kobject_init_#in~kobj.base|) (@diff (select |old(#memory_$Pointer$.offset)| |ldv_kobject_init_#in~kobj.base|) (select |#memory_$Pointer$.offset| |ldv_kobject_init_#in~kobj.base|)))) (select |#memory_$Pointer$.offset| |ldv_kobject_init_#in~kobj.base|)) (select (select |#memory_$Pointer$.offset| |ldv_kobject_init_#in~kobj.base|) (@diff (store (select |old(#memory_$Pointer$.offset)| |ldv_kobject_init_#in~kobj.base|) (@diff (select |old(#memory_$Pointer$.offset)| |ldv_kobject_init_#in~kobj.base|) (select |#memory_$Pointer$.offset| |ldv_kobject_init_#in~kobj.base|)) (select (select |#memory_$Pointer$.offset| |ldv_kobject_init_#in~kobj.base|) (@diff (select |old(#memory_$Pointer$.offset)| |ldv_kobject_init_#in~kobj.base|) (select |#memory_$Pointer$.offset| |ldv_kobject_init_#in~kobj.base|)))) (select |#memory_$Pointer$.offset| |ldv_kobject_init_#in~kobj.base|)))) (select |#memory_$Pointer$.offset| |ldv_kobject_init_#in~kobj.base|)) (select (select |#memory_$Pointer$.offset| |ldv_kobject_init_#in~kobj.base|) (@diff (store (store (select |old(#memory_$Pointer$.offset)| |ldv_kobject_init_#in~kobj.base|) (@diff (select |old(#memory_$Pointer$.offset)| |ldv_kobject_init_#in~kobj.base|) (select |#memory_$Pointer$.offset| |ldv_kobject_init_#in~kobj.base|)) (select (select |#memory_$Pointer$.offset| |ldv_kobject_init_#in~kobj.base|) (@diff (select |old(#memory_$Pointer$.offset)| |ldv_kobject_init_#in~kobj.base|) (select |#memory_$Pointer$.offset| |ldv_kobject_init_#in~kobj.base|)))) (@diff (store (select |old(#memory_$Pointer$.offset)| |ldv_kobject_init_#in~kobj.base|) (@diff (select |old(#memory_$Pointer$.offset)| |ldv_kobject_init_#in~kobj.base|) (select |#memory_$Pointer$.offset| |ldv_kobject_init_#in~kobj.base|)) (select (select |#memory_$Pointer$.offset| |ldv_kobject_init_#in~kobj.base|) (@diff (select |old(#memory_$Pointer$.offset)| |ldv_kobject_init_#in~kobj.base|) (select |#memory_$Pointer$.offset| |ldv_kobject_init_#in~kobj.base|)))) (select |#memory_$Pointer$.offset| |ldv_kobject_init_#in~kobj.base|)) (select (select |#memory_$Pointer$.offset| |ldv_kobject_init_#in~kobj.base|) (@diff (store (select |old(#memory_$Pointer$.offset)| |ldv_kobject_init_#in~kobj.base|) (@diff (select |old(#memory_$Pointer$.offset)| |ldv_kobject_init_#in~kobj.base|) (select |#memory_$Pointer$.offset| |ldv_kobject_init_#in~kobj.base|)) (select (select |#memory_$Pointer$.offset| |ldv_kobject_init_#in~kobj.base|) (@diff (select |old(#memory_$Pointer$.offset)| |ldv_kobject_init_#in~kobj.base|) (select |#memory_$Pointer$.offset| |ldv_kobject_init_#in~kobj.base|)))) (select |#memory_$Pointer$.offset| |ldv_kobject_init_#in~kobj.base|)))) (select |#memory_$Pointer$.offset| |ldv_kobject_init_#in~kobj.base|)))) (select |#memory_$Pointer$.offset| |ldv_kobject_init_#in~kobj.base|)) (or (= (select |#memory_$Pointer$.offset| |ldv_kobject_init_#in~kobj.base|) (store (select |old(#memory_$Pointer$.offset)| |ldv_kobject_init_#in~kobj.base|) (@diff (select |old(#memory_$Pointer$.offset)| |ldv_kobject_init_#in~kobj.base|) (select |#memory_$Pointer$.offset| |ldv_kobject_init_#in~kobj.base|)) (select (select |#memory_$Pointer$.offset| |ldv_kobject_init_#in~kobj.base|) (@diff (select |old(#memory_$Pointer$.offset)| |ldv_kobject_init_#in~kobj.base|) (select |#memory_$Pointer$.offset| |ldv_kobject_init_#in~kobj.base|))))) (<= 4 (@diff (store (select |old(#memory_$Pointer$.offset)| |ldv_kobject_init_#in~kobj.base|) (@diff (select |old(#memory_$Pointer$.offset)| |ldv_kobject_init_#in~kobj.base|) (select |#memory_$Pointer$.offset| |ldv_kobject_init_#in~kobj.base|)) (select (select |#memory_$Pointer$.offset| |ldv_kobject_init_#in~kobj.base|) (@diff (select |old(#memory_$Pointer$.offset)| |ldv_kobject_init_#in~kobj.base|) (select |#memory_$Pointer$.offset| |ldv_kobject_init_#in~kobj.base|)))) (select |#memory_$Pointer$.offset| |ldv_kobject_init_#in~kobj.base|)))) (or (= (store (store (select |old(#memory_$Pointer$.offset)| |ldv_kobject_init_#in~kobj.base|) (@diff (select |old(#memory_$Pointer$.offset)| |ldv_kobject_init_#in~kobj.base|) (select |#memory_$Pointer$.offset| |ldv_kobject_init_#in~kobj.base|)) (select (select |#memory_$Pointer$.offset| |ldv_kobject_init_#in~kobj.base|) (@diff (select |old(#memory_$Pointer$.offset)| |ldv_kobject_init_#in~kobj.base|) (select |#memory_$Pointer$.offset| |ldv_kobject_init_#in~kobj.base|)))) (@diff (store (select |old(#memory_$Pointer$.offset)| |ldv_kobject_init_#in~kobj.base|) (@diff (select |old(#memory_$Pointer$.offset)| |ldv_kobject_init_#in~kobj.base|) (select |#memory_$Pointer$.offset| |ldv_kobject_init_#in~kobj.base|)) (select (select |#memory_$Pointer$.offset| |ldv_kobject_init_#in~kobj.base|) (@diff (select |old(#memory_$Pointer$.offset)| |ldv_kobject_init_#in~kobj.base|) (select |#memory_$Pointer$.offset| |ldv_kobject_init_#in~kobj.base|)))) (select |#memory_$Pointer$.offset| |ldv_kobject_init_#in~kobj.base|)) (select (select |#memory_$Pointer$.offset| |ldv_kobject_init_#in~kobj.base|) (@diff (store (select |old(#memory_$Pointer$.offset)| |ldv_kobject_init_#in~kobj.base|) (@diff (select |old(#memory_$Pointer$.offset)| |ldv_kobject_init_#in~kobj.base|) (select |#memory_$Pointer$.offset| |ldv_kobject_init_#in~kobj.base|)) (select (select |#memory_$Pointer$.offset| |ldv_kobject_init_#in~kobj.base|) (@diff (select |old(#memory_$Pointer$.offset)| |ldv_kobject_init_#in~kobj.base|) (select |#memory_$Pointer$.offset| |ldv_kobject_init_#in~kobj.base|)))) (select |#memory_$Pointer$.offset| |ldv_kobject_init_#in~kobj.base|)))) (select |#memory_$Pointer$.offset| |ldv_kobject_init_#in~kobj.base|)) (<= 4 (@diff (store (store (select |old(#memory_$Pointer$.offset)| |ldv_kobject_init_#in~kobj.base|) (@diff (select |old(#memory_$Pointer$.offset)| |ldv_kobject_init_#in~kobj.base|) (select |#memory_$Pointer$.offset| |ldv_kobject_init_#in~kobj.base|)) (select (select |#memory_$Pointer$.offset| |ldv_kobject_init_#in~kobj.base|) (@diff (select |old(#memory_$Pointer$.offset)| |ldv_kobject_init_#in~kobj.base|) (select |#memory_$Pointer$.offset| |ldv_kobject_init_#in~kobj.base|)))) (@diff (store (select |old(#memory_$Pointer$.offset)| |ldv_kobject_init_#in~kobj.base|) (@diff (select |old(#memory_$Pointer$.offset)| |ldv_kobject_init_#in~kobj.base|) (select |#memory_$Pointer$.offset| |ldv_kobject_init_#in~kobj.base|)) (select (select |#memory_$Pointer$.offset| |ldv_kobject_init_#in~kobj.base|) (@diff (select |old(#memory_$Pointer$.offset)| |ldv_kobject_init_#in~kobj.base|) (select |#memory_$Pointer$.offset| |ldv_kobject_init_#in~kobj.base|)))) (select |#memory_$Pointer$.offset| |ldv_kobject_init_#in~kobj.base|)) (select (select |#memory_$Pointer$.offset| |ldv_kobject_init_#in~kobj.base|) (@diff (store (select |old(#memory_$Pointer$.offset)| |ldv_kobject_init_#in~kobj.base|) (@diff (select |old(#memory_$Pointer$.offset)| |ldv_kobject_init_#in~kobj.base|) (select |#memory_$Pointer$.offset| |ldv_kobject_init_#in~kobj.base|)) (select (select |#memory_$Pointer$.offset| |ldv_kobject_init_#in~kobj.base|) (@diff (select |old(#memory_$Pointer$.offset)| |ldv_kobject_init_#in~kobj.base|) (select |#memory_$Pointer$.offset| |ldv_kobject_init_#in~kobj.base|)))) (select |#memory_$Pointer$.offset| |ldv_kobject_init_#in~kobj.base|)))) (select |#memory_$Pointer$.offset| |ldv_kobject_init_#in~kobj.base|))))) (not (= |ldv_kobject_init_#in~kobj.offset| 0))), 13773#(and (= 0 (select (select |#memory_$Pointer$.offset| |ldv_kobject_create_#res.base|) 0)) (= 0 |ldv_kobject_create_#res.offset|)), 13774#(and (= 0 (select (select |#memory_$Pointer$.offset| |entry_point_#t~ret19.base|) 0)) (= 0 |entry_point_#t~ret19.offset|)), 13775#(and (= 0 entry_point_~kobj~2.offset) (= 0 (select (select |#memory_$Pointer$.offset| entry_point_~kobj~2.base) 0))), 13776#(and (or (and (= ldv_kobject_get_~kobj.base |ldv_kobject_get_#in~kobj.base|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|)) (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))), 13777#(and (or (and (= ldv_kobject_get_~kobj.base |ldv_kobject_get_#in~kobj.base|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|)) (not (= ldv_kobject_get_~kobj.offset 0))) (or (not (= 0 |ldv_kobject_get_#in~kobj.offset|)) (= ldv_kobject_get_~kobj.offset 0))), 13778#(and (<= ldv_kref_get_~kref.offset |ldv_kref_get_#in~kref.offset|) (= ldv_kref_get_~kref.base |ldv_kref_get_#in~kref.base|) (<= |ldv_kref_get_#in~kref.offset| ldv_kref_get_~kref.offset) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|)), 13779#(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|) (= ldv_atomic_add_return_~v.base |ldv_atomic_add_return_#in~v.base|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|)), 13780#(and (= (store (select |old(#memory_$Pointer$.offset)| |ldv_atomic_add_return_#in~v.base|) (@diff (select |old(#memory_$Pointer$.offset)| |ldv_atomic_add_return_#in~v.base|) (select |#memory_$Pointer$.offset| |ldv_atomic_add_return_#in~v.base|)) (select (select |#memory_$Pointer$.offset| |ldv_atomic_add_return_#in~v.base|) (@diff (select |old(#memory_$Pointer$.offset)| |ldv_atomic_add_return_#in~v.base|) (select |#memory_$Pointer$.offset| |ldv_atomic_add_return_#in~v.base|)))) (select |#memory_$Pointer$.offset| |ldv_atomic_add_return_#in~v.base|)) (or (= (select |old(#memory_$Pointer$.offset)| |ldv_atomic_add_return_#in~v.base|) (select |#memory_$Pointer$.offset| |ldv_atomic_add_return_#in~v.base|)) (= |ldv_atomic_add_return_#in~v.offset| (@diff (select |old(#memory_$Pointer$.offset)| |ldv_atomic_add_return_#in~v.base|) (select |#memory_$Pointer$.offset| |ldv_atomic_add_return_#in~v.base|))))), 13781#(and (= (select |#memory_$Pointer$.offset| |ldv_kref_get_#in~kref.base|) (store (select |old(#memory_$Pointer$.offset)| |ldv_kref_get_#in~kref.base|) (@diff (select |old(#memory_$Pointer$.offset)| |ldv_kref_get_#in~kref.base|) (select |#memory_$Pointer$.offset| |ldv_kref_get_#in~kref.base|)) (select (select |#memory_$Pointer$.offset| |ldv_kref_get_#in~kref.base|) (@diff (select |old(#memory_$Pointer$.offset)| |ldv_kref_get_#in~kref.base|) (select |#memory_$Pointer$.offset| |ldv_kref_get_#in~kref.base|))))) (or (= |ldv_kref_get_#in~kref.offset| (@diff (select |old(#memory_$Pointer$.offset)| |ldv_kref_get_#in~kref.base|) (select |#memory_$Pointer$.offset| |ldv_kref_get_#in~kref.base|))) (= (select |#memory_$Pointer$.offset| |ldv_kref_get_#in~kref.base|) (select |old(#memory_$Pointer$.offset)| |ldv_kref_get_#in~kref.base|)))), 13782#(and (or (not (= ldv_kobject_get_~kobj.offset 0)) (and (= (select |#memory_$Pointer$.offset| |ldv_kobject_get_#in~kobj.base|) (store (select |old(#memory_$Pointer$.offset)| |ldv_kobject_get_#in~kobj.base|) (@diff (select |old(#memory_$Pointer$.offset)| |ldv_kobject_get_#in~kobj.base|) (select |#memory_$Pointer$.offset| |ldv_kobject_get_#in~kobj.base|)) (select (select |#memory_$Pointer$.offset| |ldv_kobject_get_#in~kobj.base|) (@diff (select |old(#memory_$Pointer$.offset)| |ldv_kobject_get_#in~kobj.base|) (select |#memory_$Pointer$.offset| |ldv_kobject_get_#in~kobj.base|))))) (or (= (+ ldv_kobject_get_~kobj.offset 12) (@diff (select |old(#memory_$Pointer$.offset)| |ldv_kobject_get_#in~kobj.base|) (select |#memory_$Pointer$.offset| |ldv_kobject_get_#in~kobj.base|))) (= (select |#memory_$Pointer$.offset| |ldv_kobject_get_#in~kobj.base|) (select |old(#memory_$Pointer$.offset)| |ldv_kobject_get_#in~kobj.base|))))) (or (not (= 0 |ldv_kobject_get_#in~kobj.offset|)) (= ldv_kobject_get_~kobj.offset 0))), 13783#(or (not (= 0 |ldv_kobject_get_#in~kobj.offset|)) (and (= (select |#memory_$Pointer$.offset| |ldv_kobject_get_#in~kobj.base|) (store (select |old(#memory_$Pointer$.offset)| |ldv_kobject_get_#in~kobj.base|) (@diff (select |old(#memory_$Pointer$.offset)| |ldv_kobject_get_#in~kobj.base|) (select |#memory_$Pointer$.offset| |ldv_kobject_get_#in~kobj.base|)) (select (select |#memory_$Pointer$.offset| |ldv_kobject_get_#in~kobj.base|) (@diff (select |old(#memory_$Pointer$.offset)| |ldv_kobject_get_#in~kobj.base|) (select |#memory_$Pointer$.offset| |ldv_kobject_get_#in~kobj.base|))))) (or (= 12 (@diff (select |old(#memory_$Pointer$.offset)| |ldv_kobject_get_#in~kobj.base|) (select |#memory_$Pointer$.offset| |ldv_kobject_get_#in~kobj.base|))) (= (select |#memory_$Pointer$.offset| |ldv_kobject_get_#in~kobj.base|) (select |old(#memory_$Pointer$.offset)| |ldv_kobject_get_#in~kobj.base|))))), 13784#(and (= |ldv_kobject_put_#in~kobj.base| ldv_kobject_put_~kobj.base) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (or (= ldv_kobject_put_~kobj.offset 0) (= ldv_kobject_put_~kobj.offset |ldv_kobject_put_#in~kobj.offset|))), 13785#(and (or (= ldv_kobject_put_~kobj.offset 0) (not (= |ldv_kobject_put_#in~kobj.offset| 0))) (= |ldv_kobject_put_#in~kobj.base| ldv_kobject_put_~kobj.base) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|)), 13786#(and (<= |ldv_kref_put_#in~kref.offset| ldv_kref_put_~kref.offset) (= ldv_kref_put_~kref.base |ldv_kref_put_#in~kref.base|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|)), 13787#(and (<= |ldv_kref_sub_#in~kref.offset| ldv_kref_sub_~kref.offset) (= ldv_kref_sub_~kref.base |ldv_kref_sub_#in~kref.base|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|)), 13788#(and (or (<= |ldv_atomic_sub_return_#in~v.offset| ldv_atomic_sub_return_~v.offset) (not (= ldv_atomic_sub_return_~v.offset 0))) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= ldv_atomic_sub_return_~v.base |ldv_atomic_sub_return_#in~v.base|)), 13789#(and (= (select |#memory_$Pointer$.offset| |ldv_atomic_sub_return_#in~v.base|) (store (select |old(#memory_$Pointer$.offset)| |ldv_atomic_sub_return_#in~v.base|) (@diff (select |old(#memory_$Pointer$.offset)| |ldv_atomic_sub_return_#in~v.base|) (select |#memory_$Pointer$.offset| |ldv_atomic_sub_return_#in~v.base|)) (select (select |#memory_$Pointer$.offset| |ldv_atomic_sub_return_#in~v.base|) (@diff (select |old(#memory_$Pointer$.offset)| |ldv_atomic_sub_return_#in~v.base|) (select |#memory_$Pointer$.offset| |ldv_atomic_sub_return_#in~v.base|))))) (or (= (select |#memory_$Pointer$.offset| |ldv_atomic_sub_return_#in~v.base|) (select |old(#memory_$Pointer$.offset)| |ldv_atomic_sub_return_#in~v.base|)) (not (= (@diff (select |old(#memory_$Pointer$.offset)| |ldv_atomic_sub_return_#in~v.base|) (select |#memory_$Pointer$.offset| |ldv_atomic_sub_return_#in~v.base|)) 0)) (<= |ldv_atomic_sub_return_#in~v.offset| 11))), 13790#(and (= (select |#memory_$Pointer$.offset| |ldv_kref_sub_#in~kref.base|) (store (select |old(#memory_$Pointer$.offset)| |ldv_kref_sub_#in~kref.base|) (@diff (select |old(#memory_$Pointer$.offset)| |ldv_kref_sub_#in~kref.base|) (select |#memory_$Pointer$.offset| |ldv_kref_sub_#in~kref.base|)) (select (select |#memory_$Pointer$.offset| |ldv_kref_sub_#in~kref.base|) (@diff (select |old(#memory_$Pointer$.offset)| |ldv_kref_sub_#in~kref.base|) (select |#memory_$Pointer$.offset| |ldv_kref_sub_#in~kref.base|))))) (or (= (select |#memory_$Pointer$.offset| |ldv_kref_sub_#in~kref.base|) (select |old(#memory_$Pointer$.offset)| |ldv_kref_sub_#in~kref.base|)) (not (= (@diff (select |old(#memory_$Pointer$.offset)| |ldv_kref_sub_#in~kref.base|) (select |#memory_$Pointer$.offset| |ldv_kref_sub_#in~kref.base|)) 0)) (<= |ldv_kref_sub_#in~kref.offset| 11))), 13791#(and (or (<= |ldv_kref_put_#in~kref.offset| 11) (= (select |old(#memory_$Pointer$.offset)| |ldv_kref_put_#in~kref.base|) (select |#memory_$Pointer$.offset| |ldv_kref_put_#in~kref.base|)) (not (= (@diff (select |old(#memory_$Pointer$.offset)| |ldv_kref_put_#in~kref.base|) (select |#memory_$Pointer$.offset| |ldv_kref_put_#in~kref.base|)) 0))) (= (store (select |old(#memory_$Pointer$.offset)| |ldv_kref_put_#in~kref.base|) (@diff (select |old(#memory_$Pointer$.offset)| |ldv_kref_put_#in~kref.base|) (select |#memory_$Pointer$.offset| |ldv_kref_put_#in~kref.base|)) (select (select |#memory_$Pointer$.offset| |ldv_kref_put_#in~kref.base|) (@diff (select |old(#memory_$Pointer$.offset)| |ldv_kref_put_#in~kref.base|) (select |#memory_$Pointer$.offset| |ldv_kref_put_#in~kref.base|)))) (select |#memory_$Pointer$.offset| |ldv_kref_put_#in~kref.base|))), 13792#(and (= (select |#memory_$Pointer$.offset| |ldv_kobject_put_#in~kobj.base|) (store (select |old(#memory_$Pointer$.offset)| |ldv_kobject_put_#in~kobj.base|) (@diff (select |old(#memory_$Pointer$.offset)| |ldv_kobject_put_#in~kobj.base|) (select |#memory_$Pointer$.offset| |ldv_kobject_put_#in~kobj.base|)) (select (select |#memory_$Pointer$.offset| |ldv_kobject_put_#in~kobj.base|) (@diff (select |old(#memory_$Pointer$.offset)| |ldv_kobject_put_#in~kobj.base|) (select |#memory_$Pointer$.offset| |ldv_kobject_put_#in~kobj.base|))))) (or (= (select |old(#memory_$Pointer$.offset)| |ldv_kobject_put_#in~kobj.base|) (select |#memory_$Pointer$.offset| |ldv_kobject_put_#in~kobj.base|)) (not (= |ldv_kobject_put_#in~kobj.offset| 0)) (not (= (@diff (select |old(#memory_$Pointer$.offset)| |ldv_kobject_put_#in~kobj.base|) (select |#memory_$Pointer$.offset| |ldv_kobject_put_#in~kobj.base|)) 0)))), 13793#(and (= 0 |ldv_kobject_put_#in~kobj.offset|) (= 0 (select (select |#memory_$Pointer$.offset| |ldv_kobject_put_#in~kobj.base|) 0))), 13794#(and (= ldv_kobject_put_~kobj.offset 0) (= 0 (select (select |#memory_$Pointer$.offset| ldv_kobject_put_~kobj.base) 0))), 13795#(and (<= 12 |ldv_kref_put_#in~kref.offset|) (= 0 (select (select |#memory_$Pointer$.offset| |ldv_kref_put_#in~kref.base|) 0))), 13796#(and (<= 12 ldv_kref_put_~kref.offset) (= 0 (select (select |#memory_$Pointer$.offset| ldv_kref_put_~kref.base) 0))), 13797#(and (<= 12 |ldv_kref_sub_#in~kref.offset|) (= 0 (select (select |#memory_$Pointer$.offset| |ldv_kref_sub_#in~kref.base|) 0))), 13798#(and (= 0 (select (select |#memory_$Pointer$.offset| ldv_kref_sub_~kref.base) 0)) (<= 12 ldv_kref_sub_~kref.offset)), 13799#(and (<= 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_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= ldv_atomic_sub_return_~v.base |ldv_atomic_sub_return_#in~v.base|)), 13800#(and (= (select |#memory_$Pointer$.offset| |ldv_atomic_sub_return_#in~v.base|) (store (select |old(#memory_$Pointer$.offset)| |ldv_atomic_sub_return_#in~v.base|) (@diff (select |old(#memory_$Pointer$.offset)| |ldv_atomic_sub_return_#in~v.base|) (select |#memory_$Pointer$.offset| |ldv_atomic_sub_return_#in~v.base|)) (select (select |#memory_$Pointer$.offset| |ldv_atomic_sub_return_#in~v.base|) (@diff (select |old(#memory_$Pointer$.offset)| |ldv_atomic_sub_return_#in~v.base|) (select |#memory_$Pointer$.offset| |ldv_atomic_sub_return_#in~v.base|))))) (or (= (select |#memory_$Pointer$.offset| |ldv_atomic_sub_return_#in~v.base|) (select |old(#memory_$Pointer$.offset)| |ldv_atomic_sub_return_#in~v.base|)) (<= |ldv_atomic_sub_return_#in~v.offset| (@diff (select |old(#memory_$Pointer$.offset)| |ldv_atomic_sub_return_#in~v.base|) (select |#memory_$Pointer$.offset| |ldv_atomic_sub_return_#in~v.base|))))), 13801#(= 0 (select (select |#memory_$Pointer$.offset| ldv_kref_sub_~kref.base) 0)), 13802#(= 0 (select (select |#memory_$Pointer$.offset| |##fun~$Pointer$~TO~VOID_#in~kref.base|) 0)), 13803#(= 0 (select (select |#memory_$Pointer$.offset| |##fun~$Pointer$~TO~VOID_#~kref.base|) 0)), 13804#(= 0 (select (select |#memory_$Pointer$.offset| |ldv_kobject_release_#in~kref.base|) 0)), 13805#(= 0 (select (select |#memory_$Pointer$.offset| ldv_kobject_release_~kobj~0.base) 0)), 13806#(= 0 (select (select |#memory_$Pointer$.offset| |ldv_kobject_cleanup_#in~kobj.base|) 0)), 13807#(or (not (= 0 ldv_kobject_cleanup_~kobj.offset)) (= 0 (select (select |#memory_$Pointer$.offset| ldv_kobject_cleanup_~kobj.base) ldv_kobject_cleanup_~kobj.offset))), 13808#(or (= 0 |ldv_kobject_cleanup_#t~mem15.offset|) (not (= 0 ldv_kobject_cleanup_~kobj.offset))), 13809#(or (not (= 0 ldv_kobject_cleanup_~kobj.offset)) (= 0 ldv_kobject_cleanup_~name~0.offset)), 13810#(= 0 ldv_kobject_cleanup_~name~0.offset)] [2018-02-02 10:23:44,828 INFO L134 CoverageAnalysis]: Checked inductivity of 152 backedges. 22 proven. 129 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-02-02 10:23:44,828 INFO L409 AbstractCegarLoop]: Interpolant automaton has 74 states [2018-02-02 10:23:44,828 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 74 interpolants. [2018-02-02 10:23:44,829 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=320, Invalid=5082, Unknown=0, NotChecked=0, Total=5402 [2018-02-02 10:23:44,829 INFO L87 Difference]: Start difference. First operand 165 states and 168 transitions. Second operand 74 states. [2018-02-02 10:23:45,409 WARN L143 SmtUtils]: Spent 110ms on a formula simplification that was a NOOP. DAG size: 98 [2018-02-02 10:23:45,909 WARN L146 SmtUtils]: Spent 222ms on a formula simplification. DAG size of input: 98 DAG size of output 97 [2018-02-02 10:23:48,297 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 10:23:48,297 INFO L93 Difference]: Finished difference Result 164 states and 167 transitions. [2018-02-02 10:23:48,297 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 50 states. [2018-02-02 10:23:48,297 INFO L78 Accepts]: Start accepts. Automaton has 74 states. Word has length 139 [2018-02-02 10:23:48,298 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 10:23:48,298 INFO L225 Difference]: With dead ends: 164 [2018-02-02 10:23:48,298 INFO L226 Difference]: Without dead ends: 164 [2018-02-02 10:23:48,300 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 120 GetRequests, 16 SyntacticMatches, 4 SemanticMatches, 100 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1490 ImplicationChecksByTransitivity, 4.6s TimeCoverageRelationStatistics Valid=787, Invalid=9515, Unknown=0, NotChecked=0, Total=10302 [2018-02-02 10:23:48,300 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 164 states. [2018-02-02 10:23:48,301 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 164 to 164. [2018-02-02 10:23:48,301 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 164 states. [2018-02-02 10:23:48,301 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 164 states to 164 states and 167 transitions. [2018-02-02 10:23:48,301 INFO L78 Accepts]: Start accepts. Automaton has 164 states and 167 transitions. Word has length 139 [2018-02-02 10:23:48,302 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 10:23:48,302 INFO L432 AbstractCegarLoop]: Abstraction has 164 states and 167 transitions. [2018-02-02 10:23:48,302 INFO L433 AbstractCegarLoop]: Interpolant automaton has 74 states. [2018-02-02 10:23:48,302 INFO L276 IsEmpty]: Start isEmpty. Operand 164 states and 167 transitions. [2018-02-02 10:23:48,302 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 140 [2018-02-02 10:23:48,302 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 10:23:48,302 INFO L351 BasicCegarLoop]: trace histogram [16, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 10:23:48,302 INFO L371 AbstractCegarLoop]: === Iteration 43 === [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 10:23:48,303 INFO L82 PathProgramCache]: Analyzing trace with hash -460832410, now seen corresponding path program 1 times [2018-02-02 10:23:48,303 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 10:23:48,341 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 10:23:48,342 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 10:23:52,197 INFO L134 CoverageAnalysis]: Checked inductivity of 152 backedges. 22 proven. 129 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-02-02 10:23:52,197 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-02 10:23:52,197 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [73] total 73 [2018-02-02 10:23:52,197 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 10:23:52,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 10:23:52,198 INFO L182 omatonBuilderFactory]: Interpolants [14208#(or (= 0 (select (store (select |#memory_$Pointer$.base| |#Ultimate.C_memset_#ptr.base|) (+ |#Ultimate.C_memset_#t~loopctr21| |#Ultimate.C_memset_#ptr.offset|) 0) 0)) (not (= |#Ultimate.C_memset_#ptr.offset| 0)) (<= 9 (+ |#Ultimate.C_memset_#ptr.offset| |#Ultimate.C_memset_#t~loopctr21|)) (<= (+ |#Ultimate.C_memset_#ptr.offset| |#Ultimate.C_memset_#t~loopctr21|) 7)), 14209#(or (= 0 (select (store (select |#memory_$Pointer$.base| |#Ultimate.C_memset_#ptr.base|) (+ |#Ultimate.C_memset_#t~loopctr21| |#Ultimate.C_memset_#ptr.offset|) 0) 0)) (<= (+ |#Ultimate.C_memset_#ptr.offset| |#Ultimate.C_memset_#t~loopctr21|) 8) (not (= |#Ultimate.C_memset_#ptr.offset| 0)) (<= 10 (+ |#Ultimate.C_memset_#ptr.offset| |#Ultimate.C_memset_#t~loopctr21|))), 14210#(or (= 0 (select (store (select |#memory_$Pointer$.base| |#Ultimate.C_memset_#ptr.base|) (+ |#Ultimate.C_memset_#ptr.offset| |#Ultimate.C_memset_#t~loopctr21|) 0) 0)) (not (= |#Ultimate.C_memset_#ptr.offset| 0)) (<= 11 (+ |#Ultimate.C_memset_#ptr.offset| |#Ultimate.C_memset_#t~loopctr21|)) (<= (+ |#Ultimate.C_memset_#ptr.offset| |#Ultimate.C_memset_#t~loopctr21|) 9)), 14211#(or (<= (+ |#Ultimate.C_memset_#ptr.offset| |#Ultimate.C_memset_#t~loopctr21|) 10) (= 0 (select (store (select |#memory_$Pointer$.base| |#Ultimate.C_memset_#ptr.base|) (+ |#Ultimate.C_memset_#ptr.offset| |#Ultimate.C_memset_#t~loopctr21|) 0) 0)) (not (= |#Ultimate.C_memset_#ptr.offset| 0)) (<= 12 (+ |#Ultimate.C_memset_#ptr.offset| |#Ultimate.C_memset_#t~loopctr21|))), 14212#(or (= 0 (select (store (select |#memory_$Pointer$.base| |#Ultimate.C_memset_#ptr.base|) (+ |#Ultimate.C_memset_#ptr.offset| |#Ultimate.C_memset_#t~loopctr21|) 0) 0)) (not (= |#Ultimate.C_memset_#ptr.offset| 0)) (<= 13 (+ |#Ultimate.C_memset_#ptr.offset| |#Ultimate.C_memset_#t~loopctr21|)) (<= (+ |#Ultimate.C_memset_#ptr.offset| |#Ultimate.C_memset_#t~loopctr21|) 11)), 14213#(or (= 0 (select (store (select |#memory_$Pointer$.base| |#Ultimate.C_memset_#ptr.base|) (+ |#Ultimate.C_memset_#t~loopctr21| |#Ultimate.C_memset_#ptr.offset|) 0) 0)) (not (= |#Ultimate.C_memset_#ptr.offset| 0)) (<= 14 (+ |#Ultimate.C_memset_#ptr.offset| |#Ultimate.C_memset_#t~loopctr21|)) (<= (+ |#Ultimate.C_memset_#ptr.offset| |#Ultimate.C_memset_#t~loopctr21|) 12)), 14214#(or (= 0 (select (store (select |#memory_$Pointer$.base| |#Ultimate.C_memset_#ptr.base|) (+ |#Ultimate.C_memset_#ptr.offset| |#Ultimate.C_memset_#t~loopctr21|) 0) 0)) (not (= |#Ultimate.C_memset_#ptr.offset| 0)) (<= (+ |#Ultimate.C_memset_#ptr.offset| |#Ultimate.C_memset_#t~loopctr21|) 13) (<= 15 (+ |#Ultimate.C_memset_#ptr.offset| |#Ultimate.C_memset_#t~loopctr21|))), 14215#(or (= 0 (select (store (select |#memory_$Pointer$.base| |#Ultimate.C_memset_#ptr.base|) (+ |#Ultimate.C_memset_#ptr.offset| |#Ultimate.C_memset_#t~loopctr21|) 0) 0)) (not (= |#Ultimate.C_memset_#ptr.offset| 0)) (<= 16 (+ |#Ultimate.C_memset_#ptr.offset| |#Ultimate.C_memset_#t~loopctr21|)) (<= (+ |#Ultimate.C_memset_#ptr.offset| |#Ultimate.C_memset_#t~loopctr21|) 14)), 14216#(or (<= 17 (+ |#Ultimate.C_memset_#ptr.offset| |#Ultimate.C_memset_#amount|)) (and (= 0 (select (select |#memory_$Pointer$.base| |#Ultimate.C_memset_#ptr.base|) 0)) (<= |#Ultimate.C_memset_#t~loopctr21| |#Ultimate.C_memset_#amount|)) (<= (+ |#Ultimate.C_memset_#ptr.offset| |#Ultimate.C_memset_#t~loopctr21|) 15) (not (= |#Ultimate.C_memset_#ptr.offset| 0))), 14217#(or (<= 17 (+ |#Ultimate.C_memset_#ptr.offset| |#Ultimate.C_memset_#amount|)) (<= (+ |#Ultimate.C_memset_#ptr.offset| |#Ultimate.C_memset_#amount|) 15) (= 0 (select (select |#memory_$Pointer$.base| |#Ultimate.C_memset_#ptr.base|) 0)) (not (= |#Ultimate.C_memset_#ptr.offset| 0))), 14218#(and (= 0 ldv_kobject_create_~kobj~1.offset) (= 0 (select (select |#memory_$Pointer$.base| ldv_kobject_create_~kobj~1.base) 0))), 14219#(= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|), 14220#(and (= |ldv_kobject_init_#in~kobj.offset| ldv_kobject_init_~kobj.offset) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |ldv_kobject_init_#in~kobj.base| ldv_kobject_init_~kobj.base)), 14221#(and (or (and (= ldv_kobject_init_internal_~kobj.base |ldv_kobject_init_internal_#in~kobj.base|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|)) (not (= ldv_kobject_init_internal_~kobj.offset 0))) (or (= ldv_kobject_init_internal_~kobj.offset |ldv_kobject_init_internal_#in~kobj.offset|) (= ldv_kobject_init_internal_~kobj.offset 0))), 14222#(and (or (and (= ldv_kobject_init_internal_~kobj.base |ldv_kobject_init_internal_#in~kobj.base|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.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)))), 14223#(and (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (<= |ldv_kref_init_#in~kref.offset| ldv_kref_init_~kref.offset) (= ldv_kref_init_~kref.base |ldv_kref_init_#in~kref.base|)), 14224#(and (or (= (select |old(#memory_$Pointer$.base)| |ldv_kref_init_#in~kref.base|) (select |#memory_$Pointer$.base| |ldv_kref_init_#in~kref.base|)) (<= |ldv_kref_init_#in~kref.offset| (@diff (select |old(#memory_$Pointer$.base)| |ldv_kref_init_#in~kref.base|) (select |#memory_$Pointer$.base| |ldv_kref_init_#in~kref.base|)))) (= (store (select |old(#memory_$Pointer$.base)| |ldv_kref_init_#in~kref.base|) (@diff (select |old(#memory_$Pointer$.base)| |ldv_kref_init_#in~kref.base|) (select |#memory_$Pointer$.base| |ldv_kref_init_#in~kref.base|)) (select (select |#memory_$Pointer$.base| |ldv_kref_init_#in~kref.base|) (@diff (select |old(#memory_$Pointer$.base)| |ldv_kref_init_#in~kref.base|) (select |#memory_$Pointer$.base| |ldv_kref_init_#in~kref.base|)))) (select |#memory_$Pointer$.base| |ldv_kref_init_#in~kref.base|))), 14225#(and (or (= ldv_kobject_init_internal_~kobj.offset 0) (not (= |ldv_kobject_init_internal_#in~kobj.offset| 0))) (or (and (or (= (select |old(#memory_$Pointer$.base)| |ldv_kobject_init_internal_#in~kobj.base|) (select |#memory_$Pointer$.base| ldv_kobject_init_internal_~kobj.base)) (<= (+ ldv_kobject_init_internal_~kobj.offset 12) (@diff (select |old(#memory_$Pointer$.base)| |ldv_kobject_init_internal_#in~kobj.base|) (select |#memory_$Pointer$.base| ldv_kobject_init_internal_~kobj.base)))) (= ldv_kobject_init_internal_~kobj.base |ldv_kobject_init_internal_#in~kobj.base|) (= (select |#memory_$Pointer$.base| ldv_kobject_init_internal_~kobj.base) (store (select |old(#memory_$Pointer$.base)| |ldv_kobject_init_internal_#in~kobj.base|) (@diff (select |old(#memory_$Pointer$.base)| |ldv_kobject_init_internal_#in~kobj.base|) (select |#memory_$Pointer$.base| ldv_kobject_init_internal_~kobj.base)) (select (select |#memory_$Pointer$.base| ldv_kobject_init_internal_~kobj.base) (@diff (select |old(#memory_$Pointer$.base)| |ldv_kobject_init_internal_#in~kobj.base|) (select |#memory_$Pointer$.base| ldv_kobject_init_internal_~kobj.base)))))) (not (= ldv_kobject_init_internal_~kobj.offset 0)))), 14226#(and (= LDV_INIT_LIST_HEAD_~list.base |LDV_INIT_LIST_HEAD_#in~list.base|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (<= |LDV_INIT_LIST_HEAD_#in~list.offset| LDV_INIT_LIST_HEAD_~list.offset) (<= LDV_INIT_LIST_HEAD_~list.offset |LDV_INIT_LIST_HEAD_#in~list.offset|)), 14227#(and (= LDV_INIT_LIST_HEAD_~list.base |LDV_INIT_LIST_HEAD_#in~list.base|) (= (select |#memory_$Pointer$.base| LDV_INIT_LIST_HEAD_~list.base) (store (select |old(#memory_$Pointer$.base)| LDV_INIT_LIST_HEAD_~list.base) LDV_INIT_LIST_HEAD_~list.offset (select (select |#memory_$Pointer$.base| LDV_INIT_LIST_HEAD_~list.base) LDV_INIT_LIST_HEAD_~list.offset))) (<= |LDV_INIT_LIST_HEAD_#in~list.offset| LDV_INIT_LIST_HEAD_~list.offset) (<= LDV_INIT_LIST_HEAD_~list.offset |LDV_INIT_LIST_HEAD_#in~list.offset|)), 14228#(and (or (= |LDV_INIT_LIST_HEAD_#in~list.offset| (@diff (select |old(#memory_$Pointer$.base)| |LDV_INIT_LIST_HEAD_#in~list.base|) (select |#memory_$Pointer$.base| |LDV_INIT_LIST_HEAD_#in~list.base|))) (<= (+ |LDV_INIT_LIST_HEAD_#in~list.offset| 4) (@diff (select |old(#memory_$Pointer$.base)| |LDV_INIT_LIST_HEAD_#in~list.base|) (select |#memory_$Pointer$.base| |LDV_INIT_LIST_HEAD_#in~list.base|))) (= (select |#memory_$Pointer$.base| |LDV_INIT_LIST_HEAD_#in~list.base|) (select |old(#memory_$Pointer$.base)| |LDV_INIT_LIST_HEAD_#in~list.base|))) (= (select |#memory_$Pointer$.base| |LDV_INIT_LIST_HEAD_#in~list.base|) (store (store (select |old(#memory_$Pointer$.base)| |LDV_INIT_LIST_HEAD_#in~list.base|) (@diff (select |old(#memory_$Pointer$.base)| |LDV_INIT_LIST_HEAD_#in~list.base|) (select |#memory_$Pointer$.base| |LDV_INIT_LIST_HEAD_#in~list.base|)) (select (select |#memory_$Pointer$.base| |LDV_INIT_LIST_HEAD_#in~list.base|) (@diff (select |old(#memory_$Pointer$.base)| |LDV_INIT_LIST_HEAD_#in~list.base|) (select |#memory_$Pointer$.base| |LDV_INIT_LIST_HEAD_#in~list.base|)))) (@diff (store (select |old(#memory_$Pointer$.base)| |LDV_INIT_LIST_HEAD_#in~list.base|) (@diff (select |old(#memory_$Pointer$.base)| |LDV_INIT_LIST_HEAD_#in~list.base|) (select |#memory_$Pointer$.base| |LDV_INIT_LIST_HEAD_#in~list.base|)) (select (select |#memory_$Pointer$.base| |LDV_INIT_LIST_HEAD_#in~list.base|) (@diff (select |old(#memory_$Pointer$.base)| |LDV_INIT_LIST_HEAD_#in~list.base|) (select |#memory_$Pointer$.base| |LDV_INIT_LIST_HEAD_#in~list.base|)))) (select |#memory_$Pointer$.base| |LDV_INIT_LIST_HEAD_#in~list.base|)) (select (select |#memory_$Pointer$.base| |LDV_INIT_LIST_HEAD_#in~list.base|) (@diff (store (select |old(#memory_$Pointer$.base)| |LDV_INIT_LIST_HEAD_#in~list.base|) (@diff (select |old(#memory_$Pointer$.base)| |LDV_INIT_LIST_HEAD_#in~list.base|) (select |#memory_$Pointer$.base| |LDV_INIT_LIST_HEAD_#in~list.base|)) (select (select |#memory_$Pointer$.base| |LDV_INIT_LIST_HEAD_#in~list.base|) (@diff (select |old(#memory_$Pointer$.base)| |LDV_INIT_LIST_HEAD_#in~list.base|) (select |#memory_$Pointer$.base| |LDV_INIT_LIST_HEAD_#in~list.base|)))) (select |#memory_$Pointer$.base| |LDV_INIT_LIST_HEAD_#in~list.base|))))) (or (= |LDV_INIT_LIST_HEAD_#in~list.offset| (@diff (store (select |old(#memory_$Pointer$.base)| |LDV_INIT_LIST_HEAD_#in~list.base|) (@diff (select |old(#memory_$Pointer$.base)| |LDV_INIT_LIST_HEAD_#in~list.base|) (select |#memory_$Pointer$.base| |LDV_INIT_LIST_HEAD_#in~list.base|)) (select (select |#memory_$Pointer$.base| |LDV_INIT_LIST_HEAD_#in~list.base|) (@diff (select |old(#memory_$Pointer$.base)| |LDV_INIT_LIST_HEAD_#in~list.base|) (select |#memory_$Pointer$.base| |LDV_INIT_LIST_HEAD_#in~list.base|)))) (select |#memory_$Pointer$.base| |LDV_INIT_LIST_HEAD_#in~list.base|))) (<= (+ |LDV_INIT_LIST_HEAD_#in~list.offset| 4) (@diff (store (select |old(#memory_$Pointer$.base)| |LDV_INIT_LIST_HEAD_#in~list.base|) (@diff (select |old(#memory_$Pointer$.base)| |LDV_INIT_LIST_HEAD_#in~list.base|) (select |#memory_$Pointer$.base| |LDV_INIT_LIST_HEAD_#in~list.base|)) (select (select |#memory_$Pointer$.base| |LDV_INIT_LIST_HEAD_#in~list.base|) (@diff (select |old(#memory_$Pointer$.base)| |LDV_INIT_LIST_HEAD_#in~list.base|) (select |#memory_$Pointer$.base| |LDV_INIT_LIST_HEAD_#in~list.base|)))) (select |#memory_$Pointer$.base| |LDV_INIT_LIST_HEAD_#in~list.base|))) (= (select |#memory_$Pointer$.base| |LDV_INIT_LIST_HEAD_#in~list.base|) (store (select |old(#memory_$Pointer$.base)| |LDV_INIT_LIST_HEAD_#in~list.base|) (@diff (select |old(#memory_$Pointer$.base)| |LDV_INIT_LIST_HEAD_#in~list.base|) (select |#memory_$Pointer$.base| |LDV_INIT_LIST_HEAD_#in~list.base|)) (select (select |#memory_$Pointer$.base| |LDV_INIT_LIST_HEAD_#in~list.base|) (@diff (select |old(#memory_$Pointer$.base)| |LDV_INIT_LIST_HEAD_#in~list.base|) (select |#memory_$Pointer$.base| |LDV_INIT_LIST_HEAD_#in~list.base|))))))), 14229#(or (and (= (store (store (store (select |old(#memory_$Pointer$.base)| |ldv_kobject_init_internal_#in~kobj.base|) (@diff (select |old(#memory_$Pointer$.base)| |ldv_kobject_init_internal_#in~kobj.base|) (select |#memory_$Pointer$.base| |ldv_kobject_init_internal_#in~kobj.base|)) (select (select |#memory_$Pointer$.base| |ldv_kobject_init_internal_#in~kobj.base|) (@diff (select |old(#memory_$Pointer$.base)| |ldv_kobject_init_internal_#in~kobj.base|) (select |#memory_$Pointer$.base| |ldv_kobject_init_internal_#in~kobj.base|)))) (@diff (store (select |old(#memory_$Pointer$.base)| |ldv_kobject_init_internal_#in~kobj.base|) (@diff (select |old(#memory_$Pointer$.base)| |ldv_kobject_init_internal_#in~kobj.base|) (select |#memory_$Pointer$.base| |ldv_kobject_init_internal_#in~kobj.base|)) (select (select |#memory_$Pointer$.base| |ldv_kobject_init_internal_#in~kobj.base|) (@diff (select |old(#memory_$Pointer$.base)| |ldv_kobject_init_internal_#in~kobj.base|) (select |#memory_$Pointer$.base| |ldv_kobject_init_internal_#in~kobj.base|)))) (select |#memory_$Pointer$.base| |ldv_kobject_init_internal_#in~kobj.base|)) (select (select |#memory_$Pointer$.base| |ldv_kobject_init_internal_#in~kobj.base|) (@diff (store (select |old(#memory_$Pointer$.base)| |ldv_kobject_init_internal_#in~kobj.base|) (@diff (select |old(#memory_$Pointer$.base)| |ldv_kobject_init_internal_#in~kobj.base|) (select |#memory_$Pointer$.base| |ldv_kobject_init_internal_#in~kobj.base|)) (select (select |#memory_$Pointer$.base| |ldv_kobject_init_internal_#in~kobj.base|) (@diff (select |old(#memory_$Pointer$.base)| |ldv_kobject_init_internal_#in~kobj.base|) (select |#memory_$Pointer$.base| |ldv_kobject_init_internal_#in~kobj.base|)))) (select |#memory_$Pointer$.base| |ldv_kobject_init_internal_#in~kobj.base|)))) (@diff (store (store (select |old(#memory_$Pointer$.base)| |ldv_kobject_init_internal_#in~kobj.base|) (@diff (select |old(#memory_$Pointer$.base)| |ldv_kobject_init_internal_#in~kobj.base|) (select |#memory_$Pointer$.base| |ldv_kobject_init_internal_#in~kobj.base|)) (select (select |#memory_$Pointer$.base| |ldv_kobject_init_internal_#in~kobj.base|) (@diff (select |old(#memory_$Pointer$.base)| |ldv_kobject_init_internal_#in~kobj.base|) (select |#memory_$Pointer$.base| |ldv_kobject_init_internal_#in~kobj.base|)))) (@diff (store (select |old(#memory_$Pointer$.base)| |ldv_kobject_init_internal_#in~kobj.base|) (@diff (select |old(#memory_$Pointer$.base)| |ldv_kobject_init_internal_#in~kobj.base|) (select |#memory_$Pointer$.base| |ldv_kobject_init_internal_#in~kobj.base|)) (select (select |#memory_$Pointer$.base| |ldv_kobject_init_internal_#in~kobj.base|) (@diff (select |old(#memory_$Pointer$.base)| |ldv_kobject_init_internal_#in~kobj.base|) (select |#memory_$Pointer$.base| |ldv_kobject_init_internal_#in~kobj.base|)))) (select |#memory_$Pointer$.base| |ldv_kobject_init_internal_#in~kobj.base|)) (select (select |#memory_$Pointer$.base| |ldv_kobject_init_internal_#in~kobj.base|) (@diff (store (select |old(#memory_$Pointer$.base)| |ldv_kobject_init_internal_#in~kobj.base|) (@diff (select |old(#memory_$Pointer$.base)| |ldv_kobject_init_internal_#in~kobj.base|) (select |#memory_$Pointer$.base| |ldv_kobject_init_internal_#in~kobj.base|)) (select (select |#memory_$Pointer$.base| |ldv_kobject_init_internal_#in~kobj.base|) (@diff (select |old(#memory_$Pointer$.base)| |ldv_kobject_init_internal_#in~kobj.base|) (select |#memory_$Pointer$.base| |ldv_kobject_init_internal_#in~kobj.base|)))) (select |#memory_$Pointer$.base| |ldv_kobject_init_internal_#in~kobj.base|)))) (select |#memory_$Pointer$.base| |ldv_kobject_init_internal_#in~kobj.base|)) (select (select |#memory_$Pointer$.base| |ldv_kobject_init_internal_#in~kobj.base|) (@diff (store (store (select |old(#memory_$Pointer$.base)| |ldv_kobject_init_internal_#in~kobj.base|) (@diff (select |old(#memory_$Pointer$.base)| |ldv_kobject_init_internal_#in~kobj.base|) (select |#memory_$Pointer$.base| |ldv_kobject_init_internal_#in~kobj.base|)) (select (select |#memory_$Pointer$.base| |ldv_kobject_init_internal_#in~kobj.base|) (@diff (select |old(#memory_$Pointer$.base)| |ldv_kobject_init_internal_#in~kobj.base|) (select |#memory_$Pointer$.base| |ldv_kobject_init_internal_#in~kobj.base|)))) (@diff (store (select |old(#memory_$Pointer$.base)| |ldv_kobject_init_internal_#in~kobj.base|) (@diff (select |old(#memory_$Pointer$.base)| |ldv_kobject_init_internal_#in~kobj.base|) (select |#memory_$Pointer$.base| |ldv_kobject_init_internal_#in~kobj.base|)) (select (select |#memory_$Pointer$.base| |ldv_kobject_init_internal_#in~kobj.base|) (@diff (select |old(#memory_$Pointer$.base)| |ldv_kobject_init_internal_#in~kobj.base|) (select |#memory_$Pointer$.base| |ldv_kobject_init_internal_#in~kobj.base|)))) (select |#memory_$Pointer$.base| |ldv_kobject_init_internal_#in~kobj.base|)) (select (select |#memory_$Pointer$.base| |ldv_kobject_init_internal_#in~kobj.base|) (@diff (store (select |old(#memory_$Pointer$.base)| |ldv_kobject_init_internal_#in~kobj.base|) (@diff (select |old(#memory_$Pointer$.base)| |ldv_kobject_init_internal_#in~kobj.base|) (select |#memory_$Pointer$.base| |ldv_kobject_init_internal_#in~kobj.base|)) (select (select |#memory_$Pointer$.base| |ldv_kobject_init_internal_#in~kobj.base|) (@diff (select |old(#memory_$Pointer$.base)| |ldv_kobject_init_internal_#in~kobj.base|) (select |#memory_$Pointer$.base| |ldv_kobject_init_internal_#in~kobj.base|)))) (select |#memory_$Pointer$.base| |ldv_kobject_init_internal_#in~kobj.base|)))) (select |#memory_$Pointer$.base| |ldv_kobject_init_internal_#in~kobj.base|)))) (select |#memory_$Pointer$.base| |ldv_kobject_init_internal_#in~kobj.base|)) (or (<= 8 (@diff (store (store (select |old(#memory_$Pointer$.base)| |ldv_kobject_init_internal_#in~kobj.base|) (@diff (select |old(#memory_$Pointer$.base)| |ldv_kobject_init_internal_#in~kobj.base|) (select |#memory_$Pointer$.base| |ldv_kobject_init_internal_#in~kobj.base|)) (select (select |#memory_$Pointer$.base| |ldv_kobject_init_internal_#in~kobj.base|) (@diff (select |old(#memory_$Pointer$.base)| |ldv_kobject_init_internal_#in~kobj.base|) (select |#memory_$Pointer$.base| |ldv_kobject_init_internal_#in~kobj.base|)))) (@diff (store (select |old(#memory_$Pointer$.base)| |ldv_kobject_init_internal_#in~kobj.base|) (@diff (select |old(#memory_$Pointer$.base)| |ldv_kobject_init_internal_#in~kobj.base|) (select |#memory_$Pointer$.base| |ldv_kobject_init_internal_#in~kobj.base|)) (select (select |#memory_$Pointer$.base| |ldv_kobject_init_internal_#in~kobj.base|) (@diff (select |old(#memory_$Pointer$.base)| |ldv_kobject_init_internal_#in~kobj.base|) (select |#memory_$Pointer$.base| |ldv_kobject_init_internal_#in~kobj.base|)))) (select |#memory_$Pointer$.base| |ldv_kobject_init_internal_#in~kobj.base|)) (select (select |#memory_$Pointer$.base| |ldv_kobject_init_internal_#in~kobj.base|) (@diff (store (select |old(#memory_$Pointer$.base)| |ldv_kobject_init_internal_#in~kobj.base|) (@diff (select |old(#memory_$Pointer$.base)| |ldv_kobject_init_internal_#in~kobj.base|) (select |#memory_$Pointer$.base| |ldv_kobject_init_internal_#in~kobj.base|)) (select (select |#memory_$Pointer$.base| |ldv_kobject_init_internal_#in~kobj.base|) (@diff (select |old(#memory_$Pointer$.base)| |ldv_kobject_init_internal_#in~kobj.base|) (select |#memory_$Pointer$.base| |ldv_kobject_init_internal_#in~kobj.base|)))) (select |#memory_$Pointer$.base| |ldv_kobject_init_internal_#in~kobj.base|)))) (select |#memory_$Pointer$.base| |ldv_kobject_init_internal_#in~kobj.base|))) (= (store (store (select |old(#memory_$Pointer$.base)| |ldv_kobject_init_internal_#in~kobj.base|) (@diff (select |old(#memory_$Pointer$.base)| |ldv_kobject_init_internal_#in~kobj.base|) (select |#memory_$Pointer$.base| |ldv_kobject_init_internal_#in~kobj.base|)) (select (select |#memory_$Pointer$.base| |ldv_kobject_init_internal_#in~kobj.base|) (@diff (select |old(#memory_$Pointer$.base)| |ldv_kobject_init_internal_#in~kobj.base|) (select |#memory_$Pointer$.base| |ldv_kobject_init_internal_#in~kobj.base|)))) (@diff (store (select |old(#memory_$Pointer$.base)| |ldv_kobject_init_internal_#in~kobj.base|) (@diff (select |old(#memory_$Pointer$.base)| |ldv_kobject_init_internal_#in~kobj.base|) (select |#memory_$Pointer$.base| |ldv_kobject_init_internal_#in~kobj.base|)) (select (select |#memory_$Pointer$.base| |ldv_kobject_init_internal_#in~kobj.base|) (@diff (select |old(#memory_$Pointer$.base)| |ldv_kobject_init_internal_#in~kobj.base|) (select |#memory_$Pointer$.base| |ldv_kobject_init_internal_#in~kobj.base|)))) (select |#memory_$Pointer$.base| |ldv_kobject_init_internal_#in~kobj.base|)) (select (select |#memory_$Pointer$.base| |ldv_kobject_init_internal_#in~kobj.base|) (@diff (store (select |old(#memory_$Pointer$.base)| |ldv_kobject_init_internal_#in~kobj.base|) (@diff (select |old(#memory_$Pointer$.base)| |ldv_kobject_init_internal_#in~kobj.base|) (select |#memory_$Pointer$.base| |ldv_kobject_init_internal_#in~kobj.base|)) (select (select |#memory_$Pointer$.base| |ldv_kobject_init_internal_#in~kobj.base|) (@diff (select |old(#memory_$Pointer$.base)| |ldv_kobject_init_internal_#in~kobj.base|) (select |#memory_$Pointer$.base| |ldv_kobject_init_internal_#in~kobj.base|)))) (select |#memory_$Pointer$.base| |ldv_kobject_init_internal_#in~kobj.base|)))) (select |#memory_$Pointer$.base| |ldv_kobject_init_internal_#in~kobj.base|)) (= 4 (@diff (store (store (select |old(#memory_$Pointer$.base)| |ldv_kobject_init_internal_#in~kobj.base|) (@diff (select |old(#memory_$Pointer$.base)| |ldv_kobject_init_internal_#in~kobj.base|) (select |#memory_$Pointer$.base| |ldv_kobject_init_internal_#in~kobj.base|)) (select (select |#memory_$Pointer$.base| |ldv_kobject_init_internal_#in~kobj.base|) (@diff (select |old(#memory_$Pointer$.base)| |ldv_kobject_init_internal_#in~kobj.base|) (select |#memory_$Pointer$.base| |ldv_kobject_init_internal_#in~kobj.base|)))) (@diff (store (select |old(#memory_$Pointer$.base)| |ldv_kobject_init_internal_#in~kobj.base|) (@diff (select |old(#memory_$Pointer$.base)| |ldv_kobject_init_internal_#in~kobj.base|) (select |#memory_$Pointer$.base| |ldv_kobject_init_internal_#in~kobj.base|)) (select (select |#memory_$Pointer$.base| |ldv_kobject_init_internal_#in~kobj.base|) (@diff (select |old(#memory_$Pointer$.base)| |ldv_kobject_init_internal_#in~kobj.base|) (select |#memory_$Pointer$.base| |ldv_kobject_init_internal_#in~kobj.base|)))) (select |#memory_$Pointer$.base| |ldv_kobject_init_internal_#in~kobj.base|)) (select (select |#memory_$Pointer$.base| |ldv_kobject_init_internal_#in~kobj.base|) (@diff (store (select |old(#memory_$Pointer$.base)| |ldv_kobject_init_internal_#in~kobj.base|) (@diff (select |old(#memory_$Pointer$.base)| |ldv_kobject_init_internal_#in~kobj.base|) (select |#memory_$Pointer$.base| |ldv_kobject_init_internal_#in~kobj.base|)) (select (select |#memory_$Pointer$.base| |ldv_kobject_init_internal_#in~kobj.base|) (@diff (select |old(#memory_$Pointer$.base)| |ldv_kobject_init_internal_#in~kobj.base|) (select |#memory_$Pointer$.base| |ldv_kobject_init_internal_#in~kobj.base|)))) (select |#memory_$Pointer$.base| |ldv_kobject_init_internal_#in~kobj.base|)))) (select |#memory_$Pointer$.base| |ldv_kobject_init_internal_#in~kobj.base|)))) (or (= (select |old(#memory_$Pointer$.base)| |ldv_kobject_init_internal_#in~kobj.base|) (select |#memory_$Pointer$.base| |ldv_kobject_init_internal_#in~kobj.base|)) (<= 8 (@diff (select |old(#memory_$Pointer$.base)| |ldv_kobject_init_internal_#in~kobj.base|) (select |#memory_$Pointer$.base| |ldv_kobject_init_internal_#in~kobj.base|))) (= 4 (@diff (select |old(#memory_$Pointer$.base)| |ldv_kobject_init_internal_#in~kobj.base|) (select |#memory_$Pointer$.base| |ldv_kobject_init_internal_#in~kobj.base|)))) (or (= (select |#memory_$Pointer$.base| |ldv_kobject_init_internal_#in~kobj.base|) (store (select |old(#memory_$Pointer$.base)| |ldv_kobject_init_internal_#in~kobj.base|) (@diff (select |old(#memory_$Pointer$.base)| |ldv_kobject_init_internal_#in~kobj.base|) (select |#memory_$Pointer$.base| |ldv_kobject_init_internal_#in~kobj.base|)) (select (select |#memory_$Pointer$.base| |ldv_kobject_init_internal_#in~kobj.base|) (@diff (select |old(#memory_$Pointer$.base)| |ldv_kobject_init_internal_#in~kobj.base|) (select |#memory_$Pointer$.base| |ldv_kobject_init_internal_#in~kobj.base|))))) (= 4 (@diff (store (select |old(#memory_$Pointer$.base)| |ldv_kobject_init_internal_#in~kobj.base|) (@diff (select |old(#memory_$Pointer$.base)| |ldv_kobject_init_internal_#in~kobj.base|) (select |#memory_$Pointer$.base| |ldv_kobject_init_internal_#in~kobj.base|)) (select (select |#memory_$Pointer$.base| |ldv_kobject_init_internal_#in~kobj.base|) (@diff (select |old(#memory_$Pointer$.base)| |ldv_kobject_init_internal_#in~kobj.base|) (select |#memory_$Pointer$.base| |ldv_kobject_init_internal_#in~kobj.base|)))) (select |#memory_$Pointer$.base| |ldv_kobject_init_internal_#in~kobj.base|))) (<= 8 (@diff (store (select |old(#memory_$Pointer$.base)| |ldv_kobject_init_internal_#in~kobj.base|) (@diff (select |old(#memory_$Pointer$.base)| |ldv_kobject_init_internal_#in~kobj.base|) (select |#memory_$Pointer$.base| |ldv_kobject_init_internal_#in~kobj.base|)) (select (select |#memory_$Pointer$.base| |ldv_kobject_init_internal_#in~kobj.base|) (@diff (select |old(#memory_$Pointer$.base)| |ldv_kobject_init_internal_#in~kobj.base|) (select |#memory_$Pointer$.base| |ldv_kobject_init_internal_#in~kobj.base|)))) (select |#memory_$Pointer$.base| |ldv_kobject_init_internal_#in~kobj.base|))))) (not (= |ldv_kobject_init_internal_#in~kobj.offset| 0))), 14230#(or (and (= (store (store (store (select |old(#memory_$Pointer$.base)| |ldv_kobject_init_#in~kobj.base|) (@diff (select |old(#memory_$Pointer$.base)| |ldv_kobject_init_#in~kobj.base|) (select |#memory_$Pointer$.base| |ldv_kobject_init_#in~kobj.base|)) (select (select |#memory_$Pointer$.base| |ldv_kobject_init_#in~kobj.base|) (@diff (select |old(#memory_$Pointer$.base)| |ldv_kobject_init_#in~kobj.base|) (select |#memory_$Pointer$.base| |ldv_kobject_init_#in~kobj.base|)))) (@diff (store (select |old(#memory_$Pointer$.base)| |ldv_kobject_init_#in~kobj.base|) (@diff (select |old(#memory_$Pointer$.base)| |ldv_kobject_init_#in~kobj.base|) (select |#memory_$Pointer$.base| |ldv_kobject_init_#in~kobj.base|)) (select (select |#memory_$Pointer$.base| |ldv_kobject_init_#in~kobj.base|) (@diff (select |old(#memory_$Pointer$.base)| |ldv_kobject_init_#in~kobj.base|) (select |#memory_$Pointer$.base| |ldv_kobject_init_#in~kobj.base|)))) (select |#memory_$Pointer$.base| |ldv_kobject_init_#in~kobj.base|)) (select (select |#memory_$Pointer$.base| |ldv_kobject_init_#in~kobj.base|) (@diff (store (select |old(#memory_$Pointer$.base)| |ldv_kobject_init_#in~kobj.base|) (@diff (select |old(#memory_$Pointer$.base)| |ldv_kobject_init_#in~kobj.base|) (select |#memory_$Pointer$.base| |ldv_kobject_init_#in~kobj.base|)) (select (select |#memory_$Pointer$.base| |ldv_kobject_init_#in~kobj.base|) (@diff (select |old(#memory_$Pointer$.base)| |ldv_kobject_init_#in~kobj.base|) (select |#memory_$Pointer$.base| |ldv_kobject_init_#in~kobj.base|)))) (select |#memory_$Pointer$.base| |ldv_kobject_init_#in~kobj.base|)))) (@diff (store (store (select |old(#memory_$Pointer$.base)| |ldv_kobject_init_#in~kobj.base|) (@diff (select |old(#memory_$Pointer$.base)| |ldv_kobject_init_#in~kobj.base|) (select |#memory_$Pointer$.base| |ldv_kobject_init_#in~kobj.base|)) (select (select |#memory_$Pointer$.base| |ldv_kobject_init_#in~kobj.base|) (@diff (select |old(#memory_$Pointer$.base)| |ldv_kobject_init_#in~kobj.base|) (select |#memory_$Pointer$.base| |ldv_kobject_init_#in~kobj.base|)))) (@diff (store (select |old(#memory_$Pointer$.base)| |ldv_kobject_init_#in~kobj.base|) (@diff (select |old(#memory_$Pointer$.base)| |ldv_kobject_init_#in~kobj.base|) (select |#memory_$Pointer$.base| |ldv_kobject_init_#in~kobj.base|)) (select (select |#memory_$Pointer$.base| |ldv_kobject_init_#in~kobj.base|) (@diff (select |old(#memory_$Pointer$.base)| |ldv_kobject_init_#in~kobj.base|) (select |#memory_$Pointer$.base| |ldv_kobject_init_#in~kobj.base|)))) (select |#memory_$Pointer$.base| |ldv_kobject_init_#in~kobj.base|)) (select (select |#memory_$Pointer$.base| |ldv_kobject_init_#in~kobj.base|) (@diff (store (select |old(#memory_$Pointer$.base)| |ldv_kobject_init_#in~kobj.base|) (@diff (select |old(#memory_$Pointer$.base)| |ldv_kobject_init_#in~kobj.base|) (select |#memory_$Pointer$.base| |ldv_kobject_init_#in~kobj.base|)) (select (select |#memory_$Pointer$.base| |ldv_kobject_init_#in~kobj.base|) (@diff (select |old(#memory_$Pointer$.base)| |ldv_kobject_init_#in~kobj.base|) (select |#memory_$Pointer$.base| |ldv_kobject_init_#in~kobj.base|)))) (select |#memory_$Pointer$.base| |ldv_kobject_init_#in~kobj.base|)))) (select |#memory_$Pointer$.base| |ldv_kobject_init_#in~kobj.base|)) (select (select |#memory_$Pointer$.base| |ldv_kobject_init_#in~kobj.base|) (@diff (store (store (select |old(#memory_$Pointer$.base)| |ldv_kobject_init_#in~kobj.base|) (@diff (select |old(#memory_$Pointer$.base)| |ldv_kobject_init_#in~kobj.base|) (select |#memory_$Pointer$.base| |ldv_kobject_init_#in~kobj.base|)) (select (select |#memory_$Pointer$.base| |ldv_kobject_init_#in~kobj.base|) (@diff (select |old(#memory_$Pointer$.base)| |ldv_kobject_init_#in~kobj.base|) (select |#memory_$Pointer$.base| |ldv_kobject_init_#in~kobj.base|)))) (@diff (store (select |old(#memory_$Pointer$.base)| |ldv_kobject_init_#in~kobj.base|) (@diff (select |old(#memory_$Pointer$.base)| |ldv_kobject_init_#in~kobj.base|) (select |#memory_$Pointer$.base| |ldv_kobject_init_#in~kobj.base|)) (select (select |#memory_$Pointer$.base| |ldv_kobject_init_#in~kobj.base|) (@diff (select |old(#memory_$Pointer$.base)| |ldv_kobject_init_#in~kobj.base|) (select |#memory_$Pointer$.base| |ldv_kobject_init_#in~kobj.base|)))) (select |#memory_$Pointer$.base| |ldv_kobject_init_#in~kobj.base|)) (select (select |#memory_$Pointer$.base| |ldv_kobject_init_#in~kobj.base|) (@diff (store (select |old(#memory_$Pointer$.base)| |ldv_kobject_init_#in~kobj.base|) (@diff (select |old(#memory_$Pointer$.base)| |ldv_kobject_init_#in~kobj.base|) (select |#memory_$Pointer$.base| |ldv_kobject_init_#in~kobj.base|)) (select (select |#memory_$Pointer$.base| |ldv_kobject_init_#in~kobj.base|) (@diff (select |old(#memory_$Pointer$.base)| |ldv_kobject_init_#in~kobj.base|) (select |#memory_$Pointer$.base| |ldv_kobject_init_#in~kobj.base|)))) (select |#memory_$Pointer$.base| |ldv_kobject_init_#in~kobj.base|)))) (select |#memory_$Pointer$.base| |ldv_kobject_init_#in~kobj.base|)))) (select |#memory_$Pointer$.base| |ldv_kobject_init_#in~kobj.base|)) (or (= 4 (@diff (store (store (select |old(#memory_$Pointer$.base)| |ldv_kobject_init_#in~kobj.base|) (@diff (select |old(#memory_$Pointer$.base)| |ldv_kobject_init_#in~kobj.base|) (select |#memory_$Pointer$.base| |ldv_kobject_init_#in~kobj.base|)) (select (select |#memory_$Pointer$.base| |ldv_kobject_init_#in~kobj.base|) (@diff (select |old(#memory_$Pointer$.base)| |ldv_kobject_init_#in~kobj.base|) (select |#memory_$Pointer$.base| |ldv_kobject_init_#in~kobj.base|)))) (@diff (store (select |old(#memory_$Pointer$.base)| |ldv_kobject_init_#in~kobj.base|) (@diff (select |old(#memory_$Pointer$.base)| |ldv_kobject_init_#in~kobj.base|) (select |#memory_$Pointer$.base| |ldv_kobject_init_#in~kobj.base|)) (select (select |#memory_$Pointer$.base| |ldv_kobject_init_#in~kobj.base|) (@diff (select |old(#memory_$Pointer$.base)| |ldv_kobject_init_#in~kobj.base|) (select |#memory_$Pointer$.base| |ldv_kobject_init_#in~kobj.base|)))) (select |#memory_$Pointer$.base| |ldv_kobject_init_#in~kobj.base|)) (select (select |#memory_$Pointer$.base| |ldv_kobject_init_#in~kobj.base|) (@diff (store (select |old(#memory_$Pointer$.base)| |ldv_kobject_init_#in~kobj.base|) (@diff (select |old(#memory_$Pointer$.base)| |ldv_kobject_init_#in~kobj.base|) (select |#memory_$Pointer$.base| |ldv_kobject_init_#in~kobj.base|)) (select (select |#memory_$Pointer$.base| |ldv_kobject_init_#in~kobj.base|) (@diff (select |old(#memory_$Pointer$.base)| |ldv_kobject_init_#in~kobj.base|) (select |#memory_$Pointer$.base| |ldv_kobject_init_#in~kobj.base|)))) (select |#memory_$Pointer$.base| |ldv_kobject_init_#in~kobj.base|)))) (select |#memory_$Pointer$.base| |ldv_kobject_init_#in~kobj.base|))) (= (store (store (select |old(#memory_$Pointer$.base)| |ldv_kobject_init_#in~kobj.base|) (@diff (select |old(#memory_$Pointer$.base)| |ldv_kobject_init_#in~kobj.base|) (select |#memory_$Pointer$.base| |ldv_kobject_init_#in~kobj.base|)) (select (select |#memory_$Pointer$.base| |ldv_kobject_init_#in~kobj.base|) (@diff (select |old(#memory_$Pointer$.base)| |ldv_kobject_init_#in~kobj.base|) (select |#memory_$Pointer$.base| |ldv_kobject_init_#in~kobj.base|)))) (@diff (store (select |old(#memory_$Pointer$.base)| |ldv_kobject_init_#in~kobj.base|) (@diff (select |old(#memory_$Pointer$.base)| |ldv_kobject_init_#in~kobj.base|) (select |#memory_$Pointer$.base| |ldv_kobject_init_#in~kobj.base|)) (select (select |#memory_$Pointer$.base| |ldv_kobject_init_#in~kobj.base|) (@diff (select |old(#memory_$Pointer$.base)| |ldv_kobject_init_#in~kobj.base|) (select |#memory_$Pointer$.base| |ldv_kobject_init_#in~kobj.base|)))) (select |#memory_$Pointer$.base| |ldv_kobject_init_#in~kobj.base|)) (select (select |#memory_$Pointer$.base| |ldv_kobject_init_#in~kobj.base|) (@diff (store (select |old(#memory_$Pointer$.base)| |ldv_kobject_init_#in~kobj.base|) (@diff (select |old(#memory_$Pointer$.base)| |ldv_kobject_init_#in~kobj.base|) (select |#memory_$Pointer$.base| |ldv_kobject_init_#in~kobj.base|)) (select (select |#memory_$Pointer$.base| |ldv_kobject_init_#in~kobj.base|) (@diff (select |old(#memory_$Pointer$.base)| |ldv_kobject_init_#in~kobj.base|) (select |#memory_$Pointer$.base| |ldv_kobject_init_#in~kobj.base|)))) (select |#memory_$Pointer$.base| |ldv_kobject_init_#in~kobj.base|)))) (select |#memory_$Pointer$.base| |ldv_kobject_init_#in~kobj.base|)) (<= 8 (@diff (store (store (select |old(#memory_$Pointer$.base)| |ldv_kobject_init_#in~kobj.base|) (@diff (select |old(#memory_$Pointer$.base)| |ldv_kobject_init_#in~kobj.base|) (select |#memory_$Pointer$.base| |ldv_kobject_init_#in~kobj.base|)) (select (select |#memory_$Pointer$.base| |ldv_kobject_init_#in~kobj.base|) (@diff (select |old(#memory_$Pointer$.base)| |ldv_kobject_init_#in~kobj.base|) (select |#memory_$Pointer$.base| |ldv_kobject_init_#in~kobj.base|)))) (@diff (store (select |old(#memory_$Pointer$.base)| |ldv_kobject_init_#in~kobj.base|) (@diff (select |old(#memory_$Pointer$.base)| |ldv_kobject_init_#in~kobj.base|) (select |#memory_$Pointer$.base| |ldv_kobject_init_#in~kobj.base|)) (select (select |#memory_$Pointer$.base| |ldv_kobject_init_#in~kobj.base|) (@diff (select |old(#memory_$Pointer$.base)| |ldv_kobject_init_#in~kobj.base|) (select |#memory_$Pointer$.base| |ldv_kobject_init_#in~kobj.base|)))) (select |#memory_$Pointer$.base| |ldv_kobject_init_#in~kobj.base|)) (select (select |#memory_$Pointer$.base| |ldv_kobject_init_#in~kobj.base|) (@diff (store (select |old(#memory_$Pointer$.base)| |ldv_kobject_init_#in~kobj.base|) (@diff (select |old(#memory_$Pointer$.base)| |ldv_kobject_init_#in~kobj.base|) (select |#memory_$Pointer$.base| |ldv_kobject_init_#in~kobj.base|)) (select (select |#memory_$Pointer$.base| |ldv_kobject_init_#in~kobj.base|) (@diff (select |old(#memory_$Pointer$.base)| |ldv_kobject_init_#in~kobj.base|) (select |#memory_$Pointer$.base| |ldv_kobject_init_#in~kobj.base|)))) (select |#memory_$Pointer$.base| |ldv_kobject_init_#in~kobj.base|)))) (select |#memory_$Pointer$.base| |ldv_kobject_init_#in~kobj.base|)))) (or (= (select |#memory_$Pointer$.base| |ldv_kobject_init_#in~kobj.base|) (store (select |old(#memory_$Pointer$.base)| |ldv_kobject_init_#in~kobj.base|) (@diff (select |old(#memory_$Pointer$.base)| |ldv_kobject_init_#in~kobj.base|) (select |#memory_$Pointer$.base| |ldv_kobject_init_#in~kobj.base|)) (select (select |#memory_$Pointer$.base| |ldv_kobject_init_#in~kobj.base|) (@diff (select |old(#memory_$Pointer$.base)| |ldv_kobject_init_#in~kobj.base|) (select |#memory_$Pointer$.base| |ldv_kobject_init_#in~kobj.base|))))) (= 4 (@diff (store (select |old(#memory_$Pointer$.base)| |ldv_kobject_init_#in~kobj.base|) (@diff (select |old(#memory_$Pointer$.base)| |ldv_kobject_init_#in~kobj.base|) (select |#memory_$Pointer$.base| |ldv_kobject_init_#in~kobj.base|)) (select (select |#memory_$Pointer$.base| |ldv_kobject_init_#in~kobj.base|) (@diff (select |old(#memory_$Pointer$.base)| |ldv_kobject_init_#in~kobj.base|) (select |#memory_$Pointer$.base| |ldv_kobject_init_#in~kobj.base|)))) (select |#memory_$Pointer$.base| |ldv_kobject_init_#in~kobj.base|))) (<= 8 (@diff (store (select |old(#memory_$Pointer$.base)| |ldv_kobject_init_#in~kobj.base|) (@diff (select |old(#memory_$Pointer$.base)| |ldv_kobject_init_#in~kobj.base|) (select |#memory_$Pointer$.base| |ldv_kobject_init_#in~kobj.base|)) (select (select |#memory_$Pointer$.base| |ldv_kobject_init_#in~kobj.base|) (@diff (select |old(#memory_$Pointer$.base)| |ldv_kobject_init_#in~kobj.base|) (select |#memory_$Pointer$.base| |ldv_kobject_init_#in~kobj.base|)))) (select |#memory_$Pointer$.base| |ldv_kobject_init_#in~kobj.base|)))) (or (= (select |#memory_$Pointer$.base| |ldv_kobject_init_#in~kobj.base|) (select |old(#memory_$Pointer$.base)| |ldv_kobject_init_#in~kobj.base|)) (<= 8 (@diff (select |old(#memory_$Pointer$.base)| |ldv_kobject_init_#in~kobj.base|) (select |#memory_$Pointer$.base| |ldv_kobject_init_#in~kobj.base|))) (= 4 (@diff (select |old(#memory_$Pointer$.base)| |ldv_kobject_init_#in~kobj.base|) (select |#memory_$Pointer$.base| |ldv_kobject_init_#in~kobj.base|))))) (not (= |ldv_kobject_init_#in~kobj.offset| 0))), 14231#(and (= 0 (select (select |#memory_$Pointer$.base| |ldv_kobject_create_#res.base|) 0)) (= 0 |ldv_kobject_create_#res.offset|)), 14232#(and (= 0 (select (select |#memory_$Pointer$.base| |entry_point_#t~ret19.base|) 0)) (= 0 |entry_point_#t~ret19.offset|)), 14233#(and (= 0 entry_point_~kobj~2.offset) (= 0 (select (select |#memory_$Pointer$.base| entry_point_~kobj~2.base) 0))), 14234#(and (or (= ldv_kobject_get_~kobj.offset |ldv_kobject_get_#in~kobj.offset|) (= ldv_kobject_get_~kobj.offset 0)) (or (and (= ldv_kobject_get_~kobj.base |ldv_kobject_get_#in~kobj.base|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|)) (not (= ldv_kobject_get_~kobj.offset 0)))), 14235#(and (or (not (= 0 |ldv_kobject_get_#in~kobj.offset|)) (= ldv_kobject_get_~kobj.offset 0)) (or (and (= ldv_kobject_get_~kobj.base |ldv_kobject_get_#in~kobj.base|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|)) (not (= ldv_kobject_get_~kobj.offset 0)))), 14236#(and (<= ldv_kref_get_~kref.offset |ldv_kref_get_#in~kref.offset|) (= ldv_kref_get_~kref.base |ldv_kref_get_#in~kref.base|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (<= |ldv_kref_get_#in~kref.offset| ldv_kref_get_~kref.offset)), 14237#(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|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= ldv_atomic_add_return_~v.base |ldv_atomic_add_return_#in~v.base|)), 14238#(and (= (store (select |old(#memory_$Pointer$.base)| |ldv_atomic_add_return_#in~v.base|) (@diff (select |old(#memory_$Pointer$.base)| |ldv_atomic_add_return_#in~v.base|) (select |#memory_$Pointer$.base| |ldv_atomic_add_return_#in~v.base|)) (select (select |#memory_$Pointer$.base| |ldv_atomic_add_return_#in~v.base|) (@diff (select |old(#memory_$Pointer$.base)| |ldv_atomic_add_return_#in~v.base|) (select |#memory_$Pointer$.base| |ldv_atomic_add_return_#in~v.base|)))) (select |#memory_$Pointer$.base| |ldv_atomic_add_return_#in~v.base|)) (or (= (@diff (select |old(#memory_$Pointer$.base)| |ldv_atomic_add_return_#in~v.base|) (select |#memory_$Pointer$.base| |ldv_atomic_add_return_#in~v.base|)) |ldv_atomic_add_return_#in~v.offset|) (= (select |old(#memory_$Pointer$.base)| |ldv_atomic_add_return_#in~v.base|) (select |#memory_$Pointer$.base| |ldv_atomic_add_return_#in~v.base|)))), 14239#(and (= (select |#memory_$Pointer$.base| |ldv_kref_get_#in~kref.base|) (store (select |old(#memory_$Pointer$.base)| |ldv_kref_get_#in~kref.base|) (@diff (select |old(#memory_$Pointer$.base)| |ldv_kref_get_#in~kref.base|) (select |#memory_$Pointer$.base| |ldv_kref_get_#in~kref.base|)) (select (select |#memory_$Pointer$.base| |ldv_kref_get_#in~kref.base|) (@diff (select |old(#memory_$Pointer$.base)| |ldv_kref_get_#in~kref.base|) (select |#memory_$Pointer$.base| |ldv_kref_get_#in~kref.base|))))) (or (= (select |#memory_$Pointer$.base| |ldv_kref_get_#in~kref.base|) (select |old(#memory_$Pointer$.base)| |ldv_kref_get_#in~kref.base|)) (= (@diff (select |old(#memory_$Pointer$.base)| |ldv_kref_get_#in~kref.base|) (select |#memory_$Pointer$.base| |ldv_kref_get_#in~kref.base|)) |ldv_kref_get_#in~kref.offset|))), 14240#(and (or (not (= ldv_kobject_get_~kobj.offset 0)) (and (or (= (@diff (select |old(#memory_$Pointer$.base)| |ldv_kobject_get_#in~kobj.base|) (select |#memory_$Pointer$.base| |ldv_kobject_get_#in~kobj.base|)) (+ ldv_kobject_get_~kobj.offset 12)) (= (select |old(#memory_$Pointer$.base)| |ldv_kobject_get_#in~kobj.base|) (select |#memory_$Pointer$.base| |ldv_kobject_get_#in~kobj.base|))) (= (store (select |old(#memory_$Pointer$.base)| |ldv_kobject_get_#in~kobj.base|) (@diff (select |old(#memory_$Pointer$.base)| |ldv_kobject_get_#in~kobj.base|) (select |#memory_$Pointer$.base| |ldv_kobject_get_#in~kobj.base|)) (select (select |#memory_$Pointer$.base| |ldv_kobject_get_#in~kobj.base|) (@diff (select |old(#memory_$Pointer$.base)| |ldv_kobject_get_#in~kobj.base|) (select |#memory_$Pointer$.base| |ldv_kobject_get_#in~kobj.base|)))) (select |#memory_$Pointer$.base| |ldv_kobject_get_#in~kobj.base|)))) (or (not (= 0 |ldv_kobject_get_#in~kobj.offset|)) (= ldv_kobject_get_~kobj.offset 0))), 14241#(or (not (= 0 |ldv_kobject_get_#in~kobj.offset|)) (and (or (= (@diff (select |old(#memory_$Pointer$.base)| |ldv_kobject_get_#in~kobj.base|) (select |#memory_$Pointer$.base| |ldv_kobject_get_#in~kobj.base|)) 12) (= (select |old(#memory_$Pointer$.base)| |ldv_kobject_get_#in~kobj.base|) (select |#memory_$Pointer$.base| |ldv_kobject_get_#in~kobj.base|))) (= (store (select |old(#memory_$Pointer$.base)| |ldv_kobject_get_#in~kobj.base|) (@diff (select |old(#memory_$Pointer$.base)| |ldv_kobject_get_#in~kobj.base|) (select |#memory_$Pointer$.base| |ldv_kobject_get_#in~kobj.base|)) (select (select |#memory_$Pointer$.base| |ldv_kobject_get_#in~kobj.base|) (@diff (select |old(#memory_$Pointer$.base)| |ldv_kobject_get_#in~kobj.base|) (select |#memory_$Pointer$.base| |ldv_kobject_get_#in~kobj.base|)))) (select |#memory_$Pointer$.base| |ldv_kobject_get_#in~kobj.base|)))), 14242#(and (or (and (= |ldv_kobject_put_#in~kobj.base| ldv_kobject_put_~kobj.base) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|)) (not (= ldv_kobject_put_~kobj.offset 0))) (or (= ldv_kobject_put_~kobj.offset 0) (= ldv_kobject_put_~kobj.offset |ldv_kobject_put_#in~kobj.offset|))), 14243#(and (or (= ldv_kobject_put_~kobj.offset 0) (not (= |ldv_kobject_put_#in~kobj.offset| 0))) (or (and (= |ldv_kobject_put_#in~kobj.base| ldv_kobject_put_~kobj.base) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|)) (not (= ldv_kobject_put_~kobj.offset 0)))), 14244#(and (<= |ldv_kref_put_#in~kref.offset| ldv_kref_put_~kref.offset) (= ldv_kref_put_~kref.base |ldv_kref_put_#in~kref.base|) (<= ldv_kref_put_~kref.offset |ldv_kref_put_#in~kref.offset|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|)), 14245#(and (<= |ldv_kref_sub_#in~kref.offset| ldv_kref_sub_~kref.offset) (= ldv_kref_sub_~kref.base |ldv_kref_sub_#in~kref.base|) (<= ldv_kref_sub_~kref.offset |ldv_kref_sub_#in~kref.offset|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|)), 14246#(and (<= |ldv_atomic_sub_return_#in~v.offset| ldv_atomic_sub_return_~v.offset) (or (and (<= ldv_atomic_sub_return_~v.offset |ldv_atomic_sub_return_#in~v.offset|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= ldv_atomic_sub_return_~v.base |ldv_atomic_sub_return_#in~v.base|)) (= ldv_atomic_sub_return_~v.offset 0))), 14247#(or (<= |ldv_atomic_sub_return_#in~v.offset| 11) (and (or (= (select |old(#memory_$Pointer$.base)| |ldv_atomic_sub_return_#in~v.base|) (select |#memory_$Pointer$.base| |ldv_atomic_sub_return_#in~v.base|)) (not (= (@diff (select |old(#memory_$Pointer$.base)| |ldv_atomic_sub_return_#in~v.base|) (select |#memory_$Pointer$.base| |ldv_atomic_sub_return_#in~v.base|)) 0))) (= (select |#memory_$Pointer$.base| |ldv_atomic_sub_return_#in~v.base|) (store (select |old(#memory_$Pointer$.base)| |ldv_atomic_sub_return_#in~v.base|) (@diff (select |old(#memory_$Pointer$.base)| |ldv_atomic_sub_return_#in~v.base|) (select |#memory_$Pointer$.base| |ldv_atomic_sub_return_#in~v.base|)) (select (select |#memory_$Pointer$.base| |ldv_atomic_sub_return_#in~v.base|) (@diff (select |old(#memory_$Pointer$.base)| |ldv_atomic_sub_return_#in~v.base|) (select |#memory_$Pointer$.base| |ldv_atomic_sub_return_#in~v.base|))))))), 14248#(or (and (= (select |#memory_$Pointer$.base| |ldv_kref_sub_#in~kref.base|) (store (select |old(#memory_$Pointer$.base)| |ldv_kref_sub_#in~kref.base|) (@diff (select |old(#memory_$Pointer$.base)| |ldv_kref_sub_#in~kref.base|) (select |#memory_$Pointer$.base| |ldv_kref_sub_#in~kref.base|)) (select (select |#memory_$Pointer$.base| |ldv_kref_sub_#in~kref.base|) (@diff (select |old(#memory_$Pointer$.base)| |ldv_kref_sub_#in~kref.base|) (select |#memory_$Pointer$.base| |ldv_kref_sub_#in~kref.base|))))) (or (= (select |#memory_$Pointer$.base| |ldv_kref_sub_#in~kref.base|) (select |old(#memory_$Pointer$.base)| |ldv_kref_sub_#in~kref.base|)) (not (= (@diff (select |old(#memory_$Pointer$.base)| |ldv_kref_sub_#in~kref.base|) (select |#memory_$Pointer$.base| |ldv_kref_sub_#in~kref.base|)) 0)))) (<= |ldv_kref_sub_#in~kref.offset| 11)), 14249#(or (<= |ldv_kref_put_#in~kref.offset| 11) (and (= (select |#memory_$Pointer$.base| |ldv_kref_put_#in~kref.base|) (store (select |old(#memory_$Pointer$.base)| |ldv_kref_put_#in~kref.base|) (@diff (select |old(#memory_$Pointer$.base)| |ldv_kref_put_#in~kref.base|) (select |#memory_$Pointer$.base| |ldv_kref_put_#in~kref.base|)) (select (select |#memory_$Pointer$.base| |ldv_kref_put_#in~kref.base|) (@diff (select |old(#memory_$Pointer$.base)| |ldv_kref_put_#in~kref.base|) (select |#memory_$Pointer$.base| |ldv_kref_put_#in~kref.base|))))) (or (not (= (@diff (select |old(#memory_$Pointer$.base)| |ldv_kref_put_#in~kref.base|) (select |#memory_$Pointer$.base| |ldv_kref_put_#in~kref.base|)) 0)) (= (select |old(#memory_$Pointer$.base)| |ldv_kref_put_#in~kref.base|) (select |#memory_$Pointer$.base| |ldv_kref_put_#in~kref.base|))))), 14250#(or (and (or (not (= (@diff (select |old(#memory_$Pointer$.base)| |ldv_kobject_put_#in~kobj.base|) (select |#memory_$Pointer$.base| |ldv_kobject_put_#in~kobj.base|)) 0)) (= (select |old(#memory_$Pointer$.base)| |ldv_kobject_put_#in~kobj.base|) (select |#memory_$Pointer$.base| |ldv_kobject_put_#in~kobj.base|))) (= (select |#memory_$Pointer$.base| |ldv_kobject_put_#in~kobj.base|) (store (select |old(#memory_$Pointer$.base)| |ldv_kobject_put_#in~kobj.base|) (@diff (select |old(#memory_$Pointer$.base)| |ldv_kobject_put_#in~kobj.base|) (select |#memory_$Pointer$.base| |ldv_kobject_put_#in~kobj.base|)) (select (select |#memory_$Pointer$.base| |ldv_kobject_put_#in~kobj.base|) (@diff (select |old(#memory_$Pointer$.base)| |ldv_kobject_put_#in~kobj.base|) (select |#memory_$Pointer$.base| |ldv_kobject_put_#in~kobj.base|)))))) (not (= |ldv_kobject_put_#in~kobj.offset| 0))), 14251#(and (= 0 |ldv_kobject_put_#in~kobj.offset|) (= 0 (select (select |#memory_$Pointer$.base| |ldv_kobject_put_#in~kobj.base|) 0))), 14252#(and (= ldv_kobject_put_~kobj.offset 0) (= 0 (select (select |#memory_$Pointer$.base| ldv_kobject_put_~kobj.base) 0))), 14253#(and (not (= |ldv_kref_put_#in~kref.offset| 0)) (= 0 (select (select |#memory_$Pointer$.base| |ldv_kref_put_#in~kref.base|) 0))), 14254#(and (not (= ldv_kref_put_~kref.offset 0)) (= 0 (select (select |#memory_$Pointer$.base| ldv_kref_put_~kref.base) 0))), 14255#(and (= 0 (select (select |#memory_$Pointer$.base| |ldv_kref_sub_#in~kref.base|) 0)) (not (= |ldv_kref_sub_#in~kref.offset| 0))), 14256#(and (= 0 (select (select |#memory_$Pointer$.base| ldv_kref_sub_~kref.base) 0)) (not (= ldv_kref_sub_~kref.offset 0))), 14257#(and (<= 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_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= ldv_atomic_sub_return_~v.base |ldv_atomic_sub_return_#in~v.base|)), 14258#(and (or (= (select |old(#memory_$Pointer$.base)| |ldv_atomic_sub_return_#in~v.base|) (select |#memory_$Pointer$.base| |ldv_atomic_sub_return_#in~v.base|)) (= (@diff (select |old(#memory_$Pointer$.base)| |ldv_atomic_sub_return_#in~v.base|) (select |#memory_$Pointer$.base| |ldv_atomic_sub_return_#in~v.base|)) |ldv_atomic_sub_return_#in~v.offset|)) (= (select |#memory_$Pointer$.base| |ldv_atomic_sub_return_#in~v.base|) (store (select |old(#memory_$Pointer$.base)| |ldv_atomic_sub_return_#in~v.base|) (@diff (select |old(#memory_$Pointer$.base)| |ldv_atomic_sub_return_#in~v.base|) (select |#memory_$Pointer$.base| |ldv_atomic_sub_return_#in~v.base|)) (select (select |#memory_$Pointer$.base| |ldv_atomic_sub_return_#in~v.base|) (@diff (select |old(#memory_$Pointer$.base)| |ldv_atomic_sub_return_#in~v.base|) (select |#memory_$Pointer$.base| |ldv_atomic_sub_return_#in~v.base|)))))), 14259#(= 0 (select (select |#memory_$Pointer$.base| ldv_kref_sub_~kref.base) 0)), 14260#(= 0 (select (select |#memory_$Pointer$.base| |##fun~$Pointer$~TO~VOID_#in~kref.base|) 0)), 14261#(= 0 (select (select |#memory_$Pointer$.base| |##fun~$Pointer$~TO~VOID_#~kref.base|) 0)), 14262#(= 0 (select (select |#memory_$Pointer$.base| |ldv_kobject_release_#in~kref.base|) 0)), 14263#(= 0 (select (select |#memory_$Pointer$.base| ldv_kobject_release_~kobj~0.base) 0)), 14264#(= 0 (select (select |#memory_$Pointer$.base| |ldv_kobject_cleanup_#in~kobj.base|) 0)), 14265#(or (not (= 0 ldv_kobject_cleanup_~kobj.offset)) (= 0 (select (select |#memory_$Pointer$.base| ldv_kobject_cleanup_~kobj.base) ldv_kobject_cleanup_~kobj.offset))), 14266#(or (= 0 |ldv_kobject_cleanup_#t~mem15.base|) (not (= 0 ldv_kobject_cleanup_~kobj.offset))), 14267#(or (not (= 0 ldv_kobject_cleanup_~kobj.offset)) (= ldv_kobject_cleanup_~name~0.base 0)), 14268#(= ldv_kobject_cleanup_~name~0.base 0), 14195#true, 14196#false, 14197#(= 0 |ldv_malloc_#t~malloc4.offset|), 14198#(= 0 |ldv_malloc_#res.offset|), 14199#(= 0 |ldv_kobject_create_#t~ret17.offset|), 14200#(= 0 ldv_kobject_create_~kobj~1.offset), 14201#(or (= 0 (select (store (select |#memory_$Pointer$.base| |#Ultimate.C_memset_#ptr.base|) (+ |#Ultimate.C_memset_#ptr.offset| |#Ultimate.C_memset_#t~loopctr21|) 0) 0)) (not (= |#Ultimate.C_memset_#ptr.offset| 0)) (<= 2 (+ |#Ultimate.C_memset_#ptr.offset| |#Ultimate.C_memset_#t~loopctr21|)) (<= (+ |#Ultimate.C_memset_#ptr.offset| |#Ultimate.C_memset_#t~loopctr21|) 0)), 14202#(or (= 0 (select (store (select |#memory_$Pointer$.base| |#Ultimate.C_memset_#ptr.base|) (+ |#Ultimate.C_memset_#t~loopctr21| |#Ultimate.C_memset_#ptr.offset|) 0) 0)) (not (= |#Ultimate.C_memset_#ptr.offset| 0)) (<= 3 (+ |#Ultimate.C_memset_#ptr.offset| |#Ultimate.C_memset_#t~loopctr21|)) (<= (+ |#Ultimate.C_memset_#ptr.offset| |#Ultimate.C_memset_#t~loopctr21|) 1)), 14203#(or (= 0 (select (store (select |#memory_$Pointer$.base| |#Ultimate.C_memset_#ptr.base|) (+ |#Ultimate.C_memset_#ptr.offset| |#Ultimate.C_memset_#t~loopctr21|) 0) 0)) (not (= |#Ultimate.C_memset_#ptr.offset| 0)) (<= 4 (+ |#Ultimate.C_memset_#ptr.offset| |#Ultimate.C_memset_#t~loopctr21|)) (<= (+ |#Ultimate.C_memset_#ptr.offset| |#Ultimate.C_memset_#t~loopctr21|) 2)), 14204#(or (<= (+ |#Ultimate.C_memset_#ptr.offset| |#Ultimate.C_memset_#t~loopctr21|) 3) (<= 5 (+ |#Ultimate.C_memset_#ptr.offset| |#Ultimate.C_memset_#t~loopctr21|)) (= 0 (select (store (select |#memory_$Pointer$.base| |#Ultimate.C_memset_#ptr.base|) (+ |#Ultimate.C_memset_#ptr.offset| |#Ultimate.C_memset_#t~loopctr21|) 0) 0)) (not (= |#Ultimate.C_memset_#ptr.offset| 0))), 14205#(or (= 0 (select (store (select |#memory_$Pointer$.base| |#Ultimate.C_memset_#ptr.base|) (+ |#Ultimate.C_memset_#ptr.offset| |#Ultimate.C_memset_#t~loopctr21|) 0) 0)) (not (= |#Ultimate.C_memset_#ptr.offset| 0)) (<= (+ |#Ultimate.C_memset_#ptr.offset| |#Ultimate.C_memset_#t~loopctr21|) 4) (<= 6 (+ |#Ultimate.C_memset_#ptr.offset| |#Ultimate.C_memset_#t~loopctr21|))), 14206#(or (= 0 (select (store (select |#memory_$Pointer$.base| |#Ultimate.C_memset_#ptr.base|) (+ |#Ultimate.C_memset_#t~loopctr21| |#Ultimate.C_memset_#ptr.offset|) 0) 0)) (not (= |#Ultimate.C_memset_#ptr.offset| 0)) (<= 7 (+ |#Ultimate.C_memset_#ptr.offset| |#Ultimate.C_memset_#t~loopctr21|)) (<= (+ |#Ultimate.C_memset_#ptr.offset| |#Ultimate.C_memset_#t~loopctr21|) 5)), 14207#(or (= 0 (select (store (select |#memory_$Pointer$.base| |#Ultimate.C_memset_#ptr.base|) (+ |#Ultimate.C_memset_#t~loopctr21| |#Ultimate.C_memset_#ptr.offset|) 0) 0)) (<= (+ |#Ultimate.C_memset_#ptr.offset| |#Ultimate.C_memset_#t~loopctr21|) 6) (not (= |#Ultimate.C_memset_#ptr.offset| 0)) (<= 8 (+ |#Ultimate.C_memset_#ptr.offset| |#Ultimate.C_memset_#t~loopctr21|)))] [2018-02-02 10:23:52,198 INFO L134 CoverageAnalysis]: Checked inductivity of 152 backedges. 22 proven. 129 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-02-02 10:23:52,198 INFO L409 AbstractCegarLoop]: Interpolant automaton has 74 states [2018-02-02 10:23:52,198 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 74 interpolants. [2018-02-02 10:23:52,199 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=284, Invalid=5118, Unknown=0, NotChecked=0, Total=5402 [2018-02-02 10:23:52,199 INFO L87 Difference]: Start difference. First operand 164 states and 167 transitions. Second operand 74 states. [2018-02-02 10:23:53,116 WARN L146 SmtUtils]: Spent 157ms on a formula simplification. DAG size of input: 90 DAG size of output 89 [2018-02-02 10:23:55,653 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 10:23:55,653 INFO L93 Difference]: Finished difference Result 163 states and 166 transitions. [2018-02-02 10:23:55,653 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 50 states. [2018-02-02 10:23:55,653 INFO L78 Accepts]: Start accepts. Automaton has 74 states. Word has length 139 [2018-02-02 10:23:55,653 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 10:23:55,654 INFO L225 Difference]: With dead ends: 163 [2018-02-02 10:23:55,654 INFO L226 Difference]: Without dead ends: 163 [2018-02-02 10:23:55,655 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 120 GetRequests, 17 SyntacticMatches, 3 SemanticMatches, 100 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1391 ImplicationChecksByTransitivity, 4.3s TimeCoverageRelationStatistics Valid=751, Invalid=9551, Unknown=0, NotChecked=0, Total=10302 [2018-02-02 10:23:55,656 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 163 states. [2018-02-02 10:23:55,657 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 163 to 163. [2018-02-02 10:23:55,658 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 163 states. [2018-02-02 10:23:55,658 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 163 states to 163 states and 166 transitions. [2018-02-02 10:23:55,658 INFO L78 Accepts]: Start accepts. Automaton has 163 states and 166 transitions. Word has length 139 [2018-02-02 10:23:55,658 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 10:23:55,658 INFO L432 AbstractCegarLoop]: Abstraction has 163 states and 166 transitions. [2018-02-02 10:23:55,658 INFO L433 AbstractCegarLoop]: Interpolant automaton has 74 states. [2018-02-02 10:23:55,658 INFO L276 IsEmpty]: Start isEmpty. Operand 163 states and 166 transitions. [2018-02-02 10:23:55,659 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 140 [2018-02-02 10:23:55,659 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 10:23:55,659 INFO L351 BasicCegarLoop]: trace histogram [16, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 10:23:55,659 INFO L371 AbstractCegarLoop]: === Iteration 44 === [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 10:23:55,659 INFO L82 PathProgramCache]: Analyzing trace with hash 1471492742, now seen corresponding path program 1 times [2018-02-02 10:23:55,660 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 10:23:55,690 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 10:23:55,690 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 10:23:57,812 INFO L134 CoverageAnalysis]: Checked inductivity of 160 backedges. 16 proven. 18 refuted. 0 times theorem prover too weak. 126 trivial. 0 not checked. [2018-02-02 10:23:57,812 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-02 10:23:57,813 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [58] total 58 [2018-02-02 10:23:57,813 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 10:23:57,813 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 10:23:57,813 INFO L182 omatonBuilderFactory]: Interpolants [14651#true, 14652#false, 14653#(= 0 |ldv_malloc_#t~malloc4.offset|), 14654#(= 0 |ldv_malloc_#res.offset|), 14655#(= 0 |ldv_kobject_create_#t~ret17.offset|), 14656#(= 0 ldv_kobject_create_~kobj~1.offset), 14657#(or (not (= |#Ultimate.C_memset_#ptr.offset| 0)) (<= |#Ultimate.C_memset_#t~loopctr21| |#Ultimate.C_memset_#amount|)), 14658#(and (= |ldv_kobject_init_#in~kobj.offset| ldv_kobject_init_~kobj.offset) (= ldv_kobject_init_~kobj.base |ldv_kobject_init_#in~kobj.base|)), 14659#(and (or (= ldv_kobject_init_internal_~kobj.offset |ldv_kobject_init_internal_#in~kobj.offset|) (= ldv_kobject_init_internal_~kobj.offset 0)) (= ldv_kobject_init_internal_~kobj.base |ldv_kobject_init_internal_#in~kobj.base|)), 14660#(and (or (= ldv_kobject_init_internal_~kobj.offset 0) (not (= |ldv_kobject_init_internal_#in~kobj.offset| 0))) (= ldv_kobject_init_internal_~kobj.base |ldv_kobject_init_internal_#in~kobj.base|)), 14661#(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|)), 14662#(= 1 (select (select |#memory_int| |ldv_kref_init_#in~kref.base|) (- (- |ldv_kref_init_#in~kref.offset|)))), 14663#(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)))), 14664#(= |#memory_int| |old(#memory_int)|), 14665#(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|)), 14666#(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|)), 14667#(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)))), 14668#(or (= 1 (select (select |#memory_int| |ldv_kobject_init_internal_#in~kobj.base|) (- (- 12)))) (not (= |ldv_kobject_init_internal_#in~kobj.offset| 0))), 14669#(or (= 1 (select (select |#memory_int| |ldv_kobject_init_#in~kobj.base|) (- (- 12)))) (not (= |ldv_kobject_init_#in~kobj.offset| 0))), 14670#(and (= 0 ldv_kobject_create_~kobj~1.offset) (= 1 (select (select |#memory_int| ldv_kobject_create_~kobj~1.base) 12))), 14671#(and (= 1 (select (select |#memory_int| |ldv_kobject_create_#res.base|) 12)) (= 0 |ldv_kobject_create_#res.offset|)), 14672#(and (= 0 |entry_point_#t~ret19.offset|) (= 1 (select (select |#memory_int| |entry_point_#t~ret19.base|) 12))), 14673#(and (= 0 entry_point_~kobj~2.offset) (= 1 (select (select |#memory_int| entry_point_~kobj~2.base) 12))), 14674#(and (or (= ldv_kobject_get_~kobj.offset |ldv_kobject_get_#in~kobj.offset|) (= ldv_kobject_get_~kobj.offset 0)) (= ldv_kobject_get_~kobj.base |ldv_kobject_get_#in~kobj.base|) (= |#memory_int| |old(#memory_int)|)), 14675#(and (= ldv_kobject_get_~kobj.base |ldv_kobject_get_#in~kobj.base|) (= |#memory_int| |old(#memory_int)|) (or (not (= 0 |ldv_kobject_get_#in~kobj.offset|)) (= ldv_kobject_get_~kobj.offset 0))), 14676#(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)), 14677#(and (<= |ldv_atomic_add_return_#in~v.offset| ldv_atomic_add_return_~v.offset) (= |#memory_int| |old(#memory_int)|) (<= 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)) (= ldv_atomic_add_return_~v.base |ldv_atomic_add_return_#in~v.base|)), 14678#(and (<= |ldv_atomic_add_return_#in~v.offset| ldv_atomic_add_return_~v.offset) (or (and (or (= ldv_atomic_add_return_~v.base |ldv_atomic_add_return_#in~v.base|) (not (= ldv_atomic_add_return_~i 1))) (or (= |ldv_atomic_add_return_#in~i| ldv_atomic_add_return_~i) (= ldv_atomic_add_return_~i 1))) (not (= |ldv_atomic_add_return_#t~mem7| 1))) (<= ldv_atomic_add_return_~v.offset |ldv_atomic_add_return_#in~v.offset|) (or (and (= (select (select |#memory_int| ldv_atomic_add_return_~v.base) ldv_atomic_add_return_~v.offset) |ldv_atomic_add_return_#t~mem7|) (= |#memory_int| |old(#memory_int)|) (= ldv_atomic_add_return_~v.base |ldv_atomic_add_return_#in~v.base|)) (= |ldv_atomic_add_return_#t~mem7| 1))), 14679#(and (or (not (= |ldv_atomic_add_return_#in~i| 1)) (and (<= 2 ldv_atomic_add_return_~temp~0) (<= ldv_atomic_add_return_~temp~0 2) (= ldv_atomic_add_return_~v.base |ldv_atomic_add_return_#in~v.base|)) (and (= |#memory_int| |old(#memory_int)|) (= ldv_atomic_add_return_~v.base |ldv_atomic_add_return_#in~v.base|) (not (= (select (select |#memory_int| ldv_atomic_add_return_~v.base) ldv_atomic_add_return_~v.offset) 1)))) (<= |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|)), 14680#(or (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|)))) (<= ldv_atomic_add_return_~temp~0 2)) (not (= |ldv_atomic_add_return_#in~i| 1)) (not (= (select (select |old(#memory_int)| |ldv_atomic_add_return_#in~v.base|) (- (- |ldv_atomic_add_return_#in~v.offset|))) 1))), 14681#(or (not (= |ldv_atomic_add_return_#in~i| 1)) (not (= (select (select |old(#memory_int)| |ldv_atomic_add_return_#in~v.base|) (- (- |ldv_atomic_add_return_#in~v.offset|))) 1)) (and (<= (select (select |#memory_int| |ldv_atomic_add_return_#in~v.base|) (- (- |ldv_atomic_add_return_#in~v.offset|))) 2) (<= 2 (select (select |#memory_int| |ldv_atomic_add_return_#in~v.base|) (- (- |ldv_atomic_add_return_#in~v.offset|)))))), 14682#(or (not (= (select (select |old(#memory_int)| |ldv_kref_get_#in~kref.base|) (- (- |ldv_kref_get_#in~kref.offset|))) 1)) (and (<= (select (select |#memory_int| |ldv_kref_get_#in~kref.base|) (- (- |ldv_kref_get_#in~kref.offset|))) 2) (<= 2 (select (select |#memory_int| |ldv_kref_get_#in~kref.base|) (- (- |ldv_kref_get_#in~kref.offset|)))))), 14683#(and (or (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)) (and (<= 2 (select (select |#memory_int| |ldv_kobject_get_#in~kobj.base|) (- (+ (- ldv_kobject_get_~kobj.offset) (- 12))))) (<= (select (select |#memory_int| |ldv_kobject_get_#in~kobj.base|) (- (+ (- ldv_kobject_get_~kobj.offset) (- 12)))) 2))) (or (not (= 0 |ldv_kobject_get_#in~kobj.offset|)) (= ldv_kobject_get_~kobj.offset 0))), 14684#(or (not (= 0 |ldv_kobject_get_#in~kobj.offset|)) (not (= (select (select |old(#memory_int)| |ldv_kobject_get_#in~kobj.base|) (- (- 12))) 1)) (and (<= 2 (select (select |#memory_int| |ldv_kobject_get_#in~kobj.base|) (- (- 12)))) (<= (select (select |#memory_int| |ldv_kobject_get_#in~kobj.base|) (- (- 12))) 2))), 14685#(and (<= (select (select |#memory_int| entry_point_~kobj~2.base) 12) 2) (<= 2 (select (select |#memory_int| entry_point_~kobj~2.base) 12)) (= 0 entry_point_~kobj~2.offset)), 14686#(and (= |ldv_kobject_put_#in~kobj.base| ldv_kobject_put_~kobj.base) (= |#memory_int| |old(#memory_int)|) (or (= ldv_kobject_put_~kobj.offset 0) (= ldv_kobject_put_~kobj.offset |ldv_kobject_put_#in~kobj.offset|))), 14687#(and (or (= ldv_kobject_put_~kobj.offset 0) (not (= |ldv_kobject_put_#in~kobj.offset| 0))) (= |ldv_kobject_put_#in~kobj.base| ldv_kobject_put_~kobj.base) (= |#memory_int| |old(#memory_int)|)), 14688#(and (<= |ldv_kref_put_#in~kref.offset| ldv_kref_put_~kref.offset) (= ldv_kref_put_~kref.base |ldv_kref_put_#in~kref.base|) (= |#memory_int| |old(#memory_int)|) (<= ldv_kref_put_~kref.offset |ldv_kref_put_#in~kref.offset|)), 14689#(and (or (and (<= |ldv_kref_sub_#in~kref.offset| ldv_kref_sub_~kref.offset) (= ldv_kref_sub_~kref.base |ldv_kref_sub_#in~kref.base|) (<= ldv_kref_sub_~kref.offset |ldv_kref_sub_#in~kref.offset|) (= |#memory_int| |old(#memory_int)|)) (not (= ldv_kref_sub_~count 1))) (or (= ldv_kref_sub_~count |ldv_kref_sub_#in~count|) (= ldv_kref_sub_~count 1))), 14690#(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|)), 14691#(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|)), 14692#(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~i| ldv_atomic_sub_return_~temp~1) (select (select |#memory_int| ldv_atomic_sub_return_~v.base) ldv_atomic_sub_return_~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|)), 14693#(and (<= (+ |ldv_atomic_sub_return_#in~i| ldv_atomic_sub_return_~temp~1) (select (select |old(#memory_int)| |ldv_atomic_sub_return_#in~v.base|) (- (- |ldv_atomic_sub_return_#in~v.offset|)))) (<= (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)) (= ldv_atomic_sub_return_~temp~1 (select (select |#memory_int| |ldv_atomic_sub_return_#in~v.base|) (- (- |ldv_atomic_sub_return_#in~v.offset|))))), 14694#(and (<= (+ |ldv_atomic_sub_return_#in~i| (select (select |#memory_int| |ldv_atomic_sub_return_#in~v.base|) (- (- |ldv_atomic_sub_return_#in~v.offset|)))) (select (select |old(#memory_int)| |ldv_atomic_sub_return_#in~v.base|) (- (- |ldv_atomic_sub_return_#in~v.offset|)))) (<= (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| (select (select |#memory_int| |ldv_atomic_sub_return_#in~v.base|) (- (- |ldv_atomic_sub_return_#in~v.offset|)))))), 14695#(or (and (<= (select (select |old(#memory_int)| |ldv_kref_sub_#in~kref.base|) (- (- |ldv_kref_sub_#in~kref.offset|))) (+ (select (select |#memory_int| |ldv_kref_sub_#in~kref.base|) (- (- |ldv_kref_sub_#in~kref.offset|))) 1)) (<= (+ (select (select |#memory_int| |ldv_kref_sub_#in~kref.base|) (- (- |ldv_kref_sub_#in~kref.offset|))) 1) (select (select |old(#memory_int)| |ldv_kref_sub_#in~kref.base|) (- (- |ldv_kref_sub_#in~kref.offset|))))) (not (= 1 |ldv_kref_sub_#in~count|))), 14696#(and (<= (select (select |old(#memory_int)| |ldv_kref_put_#in~kref.base|) (- (- |ldv_kref_put_#in~kref.offset|))) (+ (select (select |#memory_int| |ldv_kref_put_#in~kref.base|) (- (- |ldv_kref_put_#in~kref.offset|))) 1)) (<= (+ (select (select |#memory_int| |ldv_kref_put_#in~kref.base|) (- (- |ldv_kref_put_#in~kref.offset|))) 1) (select (select |old(#memory_int)| |ldv_kref_put_#in~kref.base|) (- (- |ldv_kref_put_#in~kref.offset|))))), 14697#(or (not (= |ldv_kobject_put_#in~kobj.offset| 0)) (and (<= (select (select |old(#memory_int)| |ldv_kobject_put_#in~kobj.base|) (- (- 12))) (+ (select (select |#memory_int| |ldv_kobject_put_#in~kobj.base|) (- (- 12))) 1)) (<= (+ (select (select |#memory_int| |ldv_kobject_put_#in~kobj.base|) (- (- 12))) 1) (select (select |old(#memory_int)| |ldv_kobject_put_#in~kobj.base|) (- (- 12)))))), 14698#(and (or (not (= ldv_kobject_put_~kobj.offset 0)) (and (= |ldv_kobject_put_#in~kobj.base| ldv_kobject_put_~kobj.base) (= |#memory_int| |old(#memory_int)|))) (or (= ldv_kobject_put_~kobj.offset 0) (= ldv_kobject_put_~kobj.offset |ldv_kobject_put_#in~kobj.offset|))), 14699#(and (or (= ldv_kobject_put_~kobj.offset 0) (not (= |ldv_kobject_put_#in~kobj.offset| 0))) (or (not (= ldv_kobject_put_~kobj.offset 0)) (and (= |ldv_kobject_put_#in~kobj.base| ldv_kobject_put_~kobj.base) (= |#memory_int| |old(#memory_int)|)))), 14700#(and (or (not (= ldv_atomic_sub_return_~i 1)) (and (<= 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|))) (or (= ldv_atomic_sub_return_~i 1) (= ldv_atomic_sub_return_~i |ldv_atomic_sub_return_#in~i|))), 14701#(and (or (not (= ldv_atomic_sub_return_~i 1)) (and (<= 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|))) (or (= ldv_atomic_sub_return_~i 1) (= ldv_atomic_sub_return_~i |ldv_atomic_sub_return_#in~i|))), 14702#(or (not (= 1 |ldv_atomic_sub_return_#in~i|)) (and (<= (+ ldv_atomic_sub_return_~temp~1 1) (select (select |#memory_int| ldv_atomic_sub_return_~v.base) ldv_atomic_sub_return_~v.offset)) (<= 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|) (<= (select (select |#memory_int| ldv_atomic_sub_return_~v.base) ldv_atomic_sub_return_~v.offset) (+ ldv_atomic_sub_return_~temp~1 1)))), 14703#(or (not (= 1 |ldv_atomic_sub_return_#in~i|)) (and (<= (+ ldv_atomic_sub_return_~temp~1 1) (select (select |old(#memory_int)| |ldv_atomic_sub_return_#in~v.base|) (- (- |ldv_atomic_sub_return_#in~v.offset|)))) (<= (select (select |old(#memory_int)| |ldv_atomic_sub_return_#in~v.base|) (- (- |ldv_atomic_sub_return_#in~v.offset|))) (+ ldv_atomic_sub_return_~temp~1 1)))), 14704#(or (not (= 1 |ldv_atomic_sub_return_#in~i|)) (and (<= (+ |ldv_atomic_sub_return_#res| 1) (select (select |old(#memory_int)| |ldv_atomic_sub_return_#in~v.base|) (- (- |ldv_atomic_sub_return_#in~v.offset|)))) (<= (select (select |old(#memory_int)| |ldv_atomic_sub_return_#in~v.base|) (- (- |ldv_atomic_sub_return_#in~v.offset|))) (+ |ldv_atomic_sub_return_#res| 1)))), 14705#(or (and (or (<= (+ |ldv_kref_sub_#t~ret11| 1) (select (select |old(#memory_int)| |ldv_kref_sub_#in~kref.base|) (- (- |ldv_kref_sub_#in~kref.offset|)))) (<= |ldv_kref_sub_#t~ret11| 0)) (or (<= (select (select |old(#memory_int)| |ldv_kref_sub_#in~kref.base|) (- (- |ldv_kref_sub_#in~kref.offset|))) (+ |ldv_kref_sub_#t~ret11| 1)) (< 0 (+ |ldv_kref_sub_#t~ret11| 1)))) (not (= |ldv_kref_sub_#in~count| 1))), 14706#(or (<= 2 (select (select |old(#memory_int)| |ldv_kref_sub_#in~kref.base|) (- (- |ldv_kref_sub_#in~kref.offset|)))) (<= (select (select |old(#memory_int)| |ldv_kref_sub_#in~kref.base|) (- (- |ldv_kref_sub_#in~kref.offset|))) 0) (not (= |ldv_kref_sub_#in~count| 1))), 14707#(or (<= 2 (select (select |old(#memory_int)| |ldv_kref_put_#in~kref.base|) (- (- |ldv_kref_put_#in~kref.offset|)))) (<= (select (select |old(#memory_int)| |ldv_kref_put_#in~kref.base|) (- (- |ldv_kref_put_#in~kref.offset|))) 0)), 14708#(or (<= 2 (select (select |old(#memory_int)| |ldv_kobject_put_#in~kobj.base|) (- (- 12)))) (<= (select (select |old(#memory_int)| |ldv_kobject_put_#in~kobj.base|) (- (- 12))) 0) (not (= |ldv_kobject_put_#in~kobj.offset| 0)))] [2018-02-02 10:23:57,813 INFO L134 CoverageAnalysis]: Checked inductivity of 160 backedges. 16 proven. 18 refuted. 0 times theorem prover too weak. 126 trivial. 0 not checked. [2018-02-02 10:23:57,814 INFO L409 AbstractCegarLoop]: Interpolant automaton has 58 states [2018-02-02 10:23:57,814 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 58 interpolants. [2018-02-02 10:23:57,815 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=159, Invalid=3147, Unknown=0, NotChecked=0, Total=3306 [2018-02-02 10:23:57,815 INFO L87 Difference]: Start difference. First operand 163 states and 166 transitions. Second operand 58 states. [2018-02-02 10:24:00,045 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 10:24:00,045 INFO L93 Difference]: Finished difference Result 163 states and 165 transitions. [2018-02-02 10:24:00,045 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 48 states. [2018-02-02 10:24:00,045 INFO L78 Accepts]: Start accepts. Automaton has 58 states. Word has length 139 [2018-02-02 10:24:00,045 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 10:24:00,046 INFO L225 Difference]: With dead ends: 163 [2018-02-02 10:24:00,046 INFO L226 Difference]: Without dead ends: 158 [2018-02-02 10:24:00,047 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 100 GetRequests, 14 SyntacticMatches, 8 SemanticMatches, 78 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1051 ImplicationChecksByTransitivity, 2.1s TimeCoverageRelationStatistics Valid=279, Invalid=6041, Unknown=0, NotChecked=0, Total=6320 [2018-02-02 10:24:00,047 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 158 states. [2018-02-02 10:24:00,051 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 158 to 158. [2018-02-02 10:24:00,051 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 158 states. [2018-02-02 10:24:00,052 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 158 states to 158 states and 159 transitions. [2018-02-02 10:24:00,052 INFO L78 Accepts]: Start accepts. Automaton has 158 states and 159 transitions. Word has length 139 [2018-02-02 10:24:00,052 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 10:24:00,052 INFO L432 AbstractCegarLoop]: Abstraction has 158 states and 159 transitions. [2018-02-02 10:24:00,052 INFO L433 AbstractCegarLoop]: Interpolant automaton has 58 states. [2018-02-02 10:24:00,052 INFO L276 IsEmpty]: Start isEmpty. Operand 158 states and 159 transitions. [2018-02-02 10:24:00,052 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 157 [2018-02-02 10:24:00,052 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 10:24:00,053 INFO L351 BasicCegarLoop]: trace histogram [16, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 10:24:00,053 INFO L371 AbstractCegarLoop]: === Iteration 45 === [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 10:24:00,053 INFO L82 PathProgramCache]: Analyzing trace with hash -244147289, now seen corresponding path program 1 times [2018-02-02 10:24:00,053 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 10:24:00,070 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 10:24:00,070 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 10:24:00,427 INFO L134 CoverageAnalysis]: Checked inductivity of 160 backedges. 6 proven. 8 refuted. 0 times theorem prover too weak. 146 trivial. 0 not checked. [2018-02-02 10:24:00,427 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-02 10:24:00,427 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [21] total 21 [2018-02-02 10:24:00,427 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 10:24:00,428 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 10:24:00,428 INFO L182 omatonBuilderFactory]: Interpolants [15074#true, 15075#false, 15076#(= |#valid| |old(#valid)|), 15077#(and (= |old(#valid)| (store |#valid| |ldv_malloc_#t~malloc4.base| (select |old(#valid)| |ldv_malloc_#t~malloc4.base|))) (= 0 (select |old(#valid)| |ldv_malloc_#t~malloc4.base|)) (not (= |ldv_malloc_#t~malloc4.base| 0))), 15078#(and (= (store |#valid| |ldv_malloc_#res.base| (select |old(#valid)| |ldv_malloc_#res.base|)) |old(#valid)|) (= 0 (select |old(#valid)| |ldv_malloc_#res.base|)) (not (= |ldv_malloc_#res.base| 0))), 15079#(and (not (= |ldv_kobject_create_#t~ret17.base| 0)) (= 0 (select |old(#valid)| |ldv_kobject_create_#t~ret17.base|)) (= (store |#valid| |ldv_kobject_create_#t~ret17.base| (select |old(#valid)| |ldv_kobject_create_#t~ret17.base|)) |old(#valid)|)), 15080#(and (= (store |#valid| ldv_kobject_create_~kobj~1.base (select |old(#valid)| ldv_kobject_create_~kobj~1.base)) |old(#valid)|) (= 0 (select |old(#valid)| ldv_kobject_create_~kobj~1.base)) (not (= ldv_kobject_create_~kobj~1.base 0))), 15081#(and (= |old(#valid)| (store |#valid| |ldv_kobject_create_#res.base| (select |old(#valid)| |ldv_kobject_create_#res.base|))) (= 0 (select |old(#valid)| |ldv_kobject_create_#res.base|)) (not (= |ldv_kobject_create_#res.base| 0))), 15082#(and (= (store |#valid| |entry_point_#t~ret19.base| (select |old(#valid)| |entry_point_#t~ret19.base|)) |old(#valid)|) (not (= |entry_point_#t~ret19.base| 0)) (= 0 (select |old(#valid)| |entry_point_#t~ret19.base|))), 15083#(and (not (= entry_point_~kobj~2.base 0)) (= (store |#valid| entry_point_~kobj~2.base (select |old(#valid)| entry_point_~kobj~2.base)) |old(#valid)|) (= 0 (select |old(#valid)| entry_point_~kobj~2.base))), 15084#(and (= |#valid| |old(#valid)|) (= |ldv_kobject_put_#in~kobj.base| ldv_kobject_put_~kobj.base)), 15085#(and (= |#valid| |old(#valid)|) (= ldv_kref_put_~kref.base |ldv_kref_put_#in~kref.base|)), 15086#(and (= |#valid| |old(#valid)|) (= ldv_kref_sub_~kref.base |ldv_kref_sub_#in~kref.base|)), 15087#(and (= |#valid| |old(#valid)|) (= |##fun~$Pointer$~TO~VOID_#in~kref.base| |##fun~$Pointer$~TO~VOID_#~kref.base|)), 15088#(and (= |#valid| |old(#valid)|) (= |ldv_kobject_release_#in~kref.base| ldv_kobject_release_~kobj~0.base)), 15089#(and (= ldv_kobject_cleanup_~kobj.base |ldv_kobject_cleanup_#in~kobj.base|) (= |#valid| |old(#valid)|)), 15090#(or (= 0 |ldv_kobject_cleanup_#in~kobj.base|) (and (= 0 (select |#valid| |ldv_kobject_cleanup_#in~kobj.base|)) (= |old(#valid)| (store |#valid| |ldv_kobject_cleanup_#in~kobj.base| (select |old(#valid)| |ldv_kobject_cleanup_#in~kobj.base|))))), 15091#(or (= 0 |ldv_kobject_release_#in~kref.base|) (and (= (store |#valid| |ldv_kobject_release_#in~kref.base| (select |old(#valid)| |ldv_kobject_release_#in~kref.base|)) |old(#valid)|) (= 0 (select |#valid| |ldv_kobject_release_#in~kref.base|)))), 15092#(or (and (= 0 (select |#valid| |##fun~$Pointer$~TO~VOID_#in~kref.base|)) (= (store |#valid| |##fun~$Pointer$~TO~VOID_#in~kref.base| (select |old(#valid)| |##fun~$Pointer$~TO~VOID_#in~kref.base|)) |old(#valid)|)) (= 0 |##fun~$Pointer$~TO~VOID_#in~kref.base|)), 15093#(or (and (= (store |#valid| |ldv_kref_sub_#in~kref.base| (select |old(#valid)| |ldv_kref_sub_#in~kref.base|)) |old(#valid)|) (= 0 (select |#valid| |ldv_kref_sub_#in~kref.base|))) (= 0 |ldv_kref_sub_#in~kref.base|)), 15094#(or (= 0 |ldv_kref_put_#in~kref.base|) (and (= |old(#valid)| (store |#valid| |ldv_kref_put_#in~kref.base| (select |old(#valid)| |ldv_kref_put_#in~kref.base|))) (= 0 (select |#valid| |ldv_kref_put_#in~kref.base|)))), 15095#(or (and (= (store |#valid| |ldv_kobject_put_#in~kobj.base| (select |old(#valid)| |ldv_kobject_put_#in~kobj.base|)) |old(#valid)|) (= 0 (select |#valid| |ldv_kobject_put_#in~kobj.base|))) (= 0 |ldv_kobject_put_#in~kobj.base|))] [2018-02-02 10:24:00,428 INFO L134 CoverageAnalysis]: Checked inductivity of 160 backedges. 6 proven. 8 refuted. 0 times theorem prover too weak. 146 trivial. 0 not checked. [2018-02-02 10:24:00,428 INFO L409 AbstractCegarLoop]: Interpolant automaton has 22 states [2018-02-02 10:24:00,428 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2018-02-02 10:24:00,428 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=415, Unknown=0, NotChecked=0, Total=462 [2018-02-02 10:24:00,428 INFO L87 Difference]: Start difference. First operand 158 states and 159 transitions. Second operand 22 states. [2018-02-02 10:24:01,043 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 10:24:01,044 INFO L93 Difference]: Finished difference Result 176 states and 176 transitions. [2018-02-02 10:24:01,044 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2018-02-02 10:24:01,044 INFO L78 Accepts]: Start accepts. Automaton has 22 states. Word has length 156 [2018-02-02 10:24:01,044 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 10:24:01,044 INFO L225 Difference]: With dead ends: 176 [2018-02-02 10:24:01,045 INFO L226 Difference]: Without dead ends: 158 [2018-02-02 10:24:01,045 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 41 GetRequests, 17 SyntacticMatches, 1 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 57 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=59, Invalid=541, Unknown=0, NotChecked=0, Total=600 [2018-02-02 10:24:01,045 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 158 states. [2018-02-02 10:24:01,047 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 158 to 158. [2018-02-02 10:24:01,047 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 158 states. [2018-02-02 10:24:01,048 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 158 states to 158 states and 158 transitions. [2018-02-02 10:24:01,048 INFO L78 Accepts]: Start accepts. Automaton has 158 states and 158 transitions. Word has length 156 [2018-02-02 10:24:01,048 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 10:24:01,048 INFO L432 AbstractCegarLoop]: Abstraction has 158 states and 158 transitions. [2018-02-02 10:24:01,048 INFO L433 AbstractCegarLoop]: Interpolant automaton has 22 states. [2018-02-02 10:24:01,048 INFO L276 IsEmpty]: Start isEmpty. Operand 158 states and 158 transitions. [2018-02-02 10:24:01,049 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 158 [2018-02-02 10:24:01,049 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 10:24:01,049 INFO L351 BasicCegarLoop]: trace histogram [16, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 10:24:01,049 INFO L371 AbstractCegarLoop]: === Iteration 46 === [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 10:24:01,049 INFO L82 PathProgramCache]: Analyzing trace with hash -616356298, now seen corresponding path program 1 times [2018-02-02 10:24:01,050 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 10:24:01,121 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 10:24:01,122 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 10:24:05,086 INFO L134 CoverageAnalysis]: Checked inductivity of 160 backedges. 0 proven. 146 refuted. 0 times theorem prover too weak. 14 trivial. 0 not checked. [2018-02-02 10:24:05,086 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-02 10:24:05,086 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [71] total 71 [2018-02-02 10:24:05,086 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 10:24:05,086 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 10:24:05,087 INFO L182 omatonBuilderFactory]: Interpolants [15488#(and (<= |ldv_atomic_sub_return_#in~v.offset| ldv_atomic_sub_return_~v.offset) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= ldv_atomic_sub_return_~v.base |ldv_atomic_sub_return_#in~v.base|)), 15489#(and (or (<= |ldv_atomic_sub_return_#in~v.offset| (@diff (select |old(#memory_$Pointer$.base)| |ldv_atomic_sub_return_#in~v.base|) (select |#memory_$Pointer$.base| |ldv_atomic_sub_return_#in~v.base|))) (= (select |old(#memory_$Pointer$.base)| |ldv_atomic_sub_return_#in~v.base|) (select |#memory_$Pointer$.base| |ldv_atomic_sub_return_#in~v.base|))) (= (select |#memory_$Pointer$.base| |ldv_atomic_sub_return_#in~v.base|) (store (select |old(#memory_$Pointer$.base)| |ldv_atomic_sub_return_#in~v.base|) (@diff (select |old(#memory_$Pointer$.base)| |ldv_atomic_sub_return_#in~v.base|) (select |#memory_$Pointer$.base| |ldv_atomic_sub_return_#in~v.base|)) (select (select |#memory_$Pointer$.base| |ldv_atomic_sub_return_#in~v.base|) (@diff (select |old(#memory_$Pointer$.base)| |ldv_atomic_sub_return_#in~v.base|) (select |#memory_$Pointer$.base| |ldv_atomic_sub_return_#in~v.base|)))))), 15490#(and (= (select |#memory_$Pointer$.base| |ldv_kref_sub_#in~kref.base|) (store (select |old(#memory_$Pointer$.base)| |ldv_kref_sub_#in~kref.base|) (@diff (select |old(#memory_$Pointer$.base)| |ldv_kref_sub_#in~kref.base|) (select |#memory_$Pointer$.base| |ldv_kref_sub_#in~kref.base|)) (select (select |#memory_$Pointer$.base| |ldv_kref_sub_#in~kref.base|) (@diff (select |old(#memory_$Pointer$.base)| |ldv_kref_sub_#in~kref.base|) (select |#memory_$Pointer$.base| |ldv_kref_sub_#in~kref.base|))))) (or (= (select |#memory_$Pointer$.base| |ldv_kref_sub_#in~kref.base|) (select |old(#memory_$Pointer$.base)| |ldv_kref_sub_#in~kref.base|)) (<= |ldv_kref_sub_#in~kref.offset| (@diff (select |old(#memory_$Pointer$.base)| |ldv_kref_sub_#in~kref.base|) (select |#memory_$Pointer$.base| |ldv_kref_sub_#in~kref.base|))))), 15491#(and (= (select |#memory_$Pointer$.base| |ldv_kref_put_#in~kref.base|) (store (select |old(#memory_$Pointer$.base)| |ldv_kref_put_#in~kref.base|) (@diff (select |old(#memory_$Pointer$.base)| |ldv_kref_put_#in~kref.base|) (select |#memory_$Pointer$.base| |ldv_kref_put_#in~kref.base|)) (select (select |#memory_$Pointer$.base| |ldv_kref_put_#in~kref.base|) (@diff (select |old(#memory_$Pointer$.base)| |ldv_kref_put_#in~kref.base|) (select |#memory_$Pointer$.base| |ldv_kref_put_#in~kref.base|))))) (or (<= |ldv_kref_put_#in~kref.offset| (@diff (select |old(#memory_$Pointer$.base)| |ldv_kref_put_#in~kref.base|) (select |#memory_$Pointer$.base| |ldv_kref_put_#in~kref.base|))) (= (select |old(#memory_$Pointer$.base)| |ldv_kref_put_#in~kref.base|) (select |#memory_$Pointer$.base| |ldv_kref_put_#in~kref.base|)))), 15492#(and (= (select |#memory_$Pointer$.base| |ldv_kobject_put_#in~kobj.base|) (store (select |old(#memory_$Pointer$.base)| |ldv_kobject_put_#in~kobj.base|) (@diff (select |old(#memory_$Pointer$.base)| |ldv_kobject_put_#in~kobj.base|) (select |#memory_$Pointer$.base| |ldv_kobject_put_#in~kobj.base|)) (select (select |#memory_$Pointer$.base| |ldv_kobject_put_#in~kobj.base|) (@diff (select |old(#memory_$Pointer$.base)| |ldv_kobject_put_#in~kobj.base|) (select |#memory_$Pointer$.base| |ldv_kobject_put_#in~kobj.base|))))) (or (not (= |ldv_kobject_put_#in~kobj.offset| 0)) (= (select |old(#memory_$Pointer$.base)| |ldv_kobject_put_#in~kobj.base|) (select |#memory_$Pointer$.base| |ldv_kobject_put_#in~kobj.base|)) (<= 12 (@diff (select |old(#memory_$Pointer$.base)| |ldv_kobject_put_#in~kobj.base|) (select |#memory_$Pointer$.base| |ldv_kobject_put_#in~kobj.base|))))), 15493#(and (or (<= |ldv_kref_sub_#in~kref.offset| (@diff (select |old(#memory_$Pointer$.base)| |ldv_kref_sub_#in~kref.base|) (select |#memory_$Pointer$.base| ldv_kref_sub_~kref.base))) (= (select |#memory_$Pointer$.base| ldv_kref_sub_~kref.base) (select |old(#memory_$Pointer$.base)| |ldv_kref_sub_#in~kref.base|))) (= (store (select |old(#memory_$Pointer$.base)| |ldv_kref_sub_#in~kref.base|) (@diff (select |old(#memory_$Pointer$.base)| |ldv_kref_sub_#in~kref.base|) (select |#memory_$Pointer$.base| ldv_kref_sub_~kref.base)) (select (select |#memory_$Pointer$.base| ldv_kref_sub_~kref.base) (@diff (select |old(#memory_$Pointer$.base)| |ldv_kref_sub_#in~kref.base|) (select |#memory_$Pointer$.base| ldv_kref_sub_~kref.base)))) (select |#memory_$Pointer$.base| ldv_kref_sub_~kref.base))), 15494#(= |##fun~$Pointer$~TO~VOID_#in~kref.base| |##fun~$Pointer$~TO~VOID_#~kref.base|), 15495#(= |ldv_kobject_release_#in~kref.base| ldv_kobject_release_~kobj~0.base), 15496#(or (= ldv_kobject_cleanup_~kobj.base |ldv_kobject_cleanup_#in~kobj.base|) (not (= 0 ldv_kobject_cleanup_~kobj.offset))), 15497#(or (not (= 0 ldv_kobject_cleanup_~kobj.offset)) (and (= ldv_kobject_cleanup_~kobj.base |ldv_kobject_cleanup_#in~kobj.base|) (= (select (select |#memory_$Pointer$.base| ldv_kobject_cleanup_~kobj.base) ldv_kobject_cleanup_~kobj.offset) |ldv_kobject_cleanup_#t~mem15.base|))), 15498#(or (and (= ldv_kobject_cleanup_~name~0.base (select (select |#memory_$Pointer$.base| ldv_kobject_cleanup_~kobj.base) ldv_kobject_cleanup_~kobj.offset)) (= ldv_kobject_cleanup_~kobj.base |ldv_kobject_cleanup_#in~kobj.base|)) (not (= 0 ldv_kobject_cleanup_~kobj.offset))), 15499#(= ldv_kobject_cleanup_~name~0.base (select (select |#memory_$Pointer$.base| |ldv_kobject_cleanup_#in~kobj.base|) 0)), 15500#(and (or (not (= 0 ldv_kobject_cleanup_~name~0.offset)) (not (= ldv_kobject_cleanup_~name~0.base 0))) (or (= (select (select |#memory_$Pointer$.base| |ldv_kobject_cleanup_#in~kobj.base|) 0) ldv_kobject_cleanup_~name~0.base) (= ldv_kobject_cleanup_~name~0.base 0))), 15501#(not (= (select (select |#memory_$Pointer$.base| |ldv_kobject_cleanup_#in~kobj.base|) 0) 0)), 15502#(not (= (select (select |#memory_$Pointer$.base| |ldv_kobject_release_#in~kref.base|) 0) 0)), 15503#(not (= (select (select |#memory_$Pointer$.base| |##fun~$Pointer$~TO~VOID_#in~kref.base|) 0) 0)), 15504#(or (not (= (select (select |old(#memory_$Pointer$.base)| |ldv_kref_sub_#in~kref.base|) 0) 0)) (<= |ldv_kref_sub_#in~kref.offset| 0)), 15505#(or (<= |ldv_kref_put_#in~kref.offset| 0) (not (= (select (select |old(#memory_$Pointer$.base)| |ldv_kref_put_#in~kref.base|) 0) 0))), 15506#(or (not (= (select (select |old(#memory_$Pointer$.base)| |ldv_kobject_put_#in~kobj.base|) 0) 0)) (not (= |ldv_kobject_put_#in~kobj.offset| 0))), 15436#true, 15437#false, 15438#(= 0 |ldv_malloc_#t~malloc4.offset|), 15439#(= 0 |ldv_malloc_#res.offset|), 15440#(= 0 |ldv_kobject_create_#t~ret17.offset|), 15441#(= 0 ldv_kobject_create_~kobj~1.offset), 15442#(or (= |#Ultimate.C_memset_#t~loopctr21| 0) (not (= |#Ultimate.C_memset_#ptr.offset| 0))), 15443#(or (and (<= |#Ultimate.C_memset_#t~loopctr21| 1) (= 0 (select (store (select |#memory_$Pointer$.base| |#Ultimate.C_memset_#ptr.base|) (+ |#Ultimate.C_memset_#ptr.offset| |#Ultimate.C_memset_#t~loopctr21|) 0) 0))) (not (= |#Ultimate.C_memset_#ptr.offset| 0)) (<= (+ |#Ultimate.C_memset_#ptr.offset| |#Ultimate.C_memset_#t~loopctr21|) 0)), 15444#(or (and (<= |#Ultimate.C_memset_#t~loopctr21| 2) (= 0 (select (store (select |#memory_$Pointer$.base| |#Ultimate.C_memset_#ptr.base|) (+ |#Ultimate.C_memset_#t~loopctr21| |#Ultimate.C_memset_#ptr.offset|) 0) 0))) (not (= |#Ultimate.C_memset_#ptr.offset| 0)) (<= (+ |#Ultimate.C_memset_#ptr.offset| |#Ultimate.C_memset_#t~loopctr21|) 1)), 15445#(or (not (= |#Ultimate.C_memset_#ptr.offset| 0)) (<= (+ |#Ultimate.C_memset_#ptr.offset| |#Ultimate.C_memset_#t~loopctr21|) 2) (and (<= |#Ultimate.C_memset_#t~loopctr21| 3) (= 0 (select (store (select |#memory_$Pointer$.base| |#Ultimate.C_memset_#ptr.base|) (+ |#Ultimate.C_memset_#ptr.offset| |#Ultimate.C_memset_#t~loopctr21|) 0) 0)))), 15446#(or (<= (+ |#Ultimate.C_memset_#ptr.offset| |#Ultimate.C_memset_#t~loopctr21|) 3) (not (= |#Ultimate.C_memset_#ptr.offset| 0)) (and (= 0 (select (store (select |#memory_$Pointer$.base| |#Ultimate.C_memset_#ptr.base|) (+ |#Ultimate.C_memset_#ptr.offset| |#Ultimate.C_memset_#t~loopctr21|) 0) 0)) (<= |#Ultimate.C_memset_#t~loopctr21| 4))), 15447#(or (and (= 0 (select (store (select |#memory_$Pointer$.base| |#Ultimate.C_memset_#ptr.base|) (+ |#Ultimate.C_memset_#ptr.offset| |#Ultimate.C_memset_#t~loopctr21|) 0) 0)) (<= |#Ultimate.C_memset_#t~loopctr21| 5)) (not (= |#Ultimate.C_memset_#ptr.offset| 0)) (<= |#Ultimate.C_memset_#t~loopctr21| 4)), 15448#(or (and (= 0 (select (store (select |#memory_$Pointer$.base| |#Ultimate.C_memset_#ptr.base|) (+ |#Ultimate.C_memset_#t~loopctr21| |#Ultimate.C_memset_#ptr.offset|) 0) 0)) (<= |#Ultimate.C_memset_#t~loopctr21| 6)) (not (= |#Ultimate.C_memset_#ptr.offset| 0)) (<= |#Ultimate.C_memset_#t~loopctr21| 5)), 15449#(or (<= |#Ultimate.C_memset_#t~loopctr21| 6) (and (= 0 (select (store (select |#memory_$Pointer$.base| |#Ultimate.C_memset_#ptr.base|) (+ |#Ultimate.C_memset_#t~loopctr21| |#Ultimate.C_memset_#ptr.offset|) 0) 0)) (<= |#Ultimate.C_memset_#t~loopctr21| 7)) (not (= |#Ultimate.C_memset_#ptr.offset| 0))), 15450#(or (not (= |#Ultimate.C_memset_#ptr.offset| 0)) (<= |#Ultimate.C_memset_#t~loopctr21| 7) (and (= 0 (select (store (select |#memory_$Pointer$.base| |#Ultimate.C_memset_#ptr.base|) (+ |#Ultimate.C_memset_#t~loopctr21| |#Ultimate.C_memset_#ptr.offset|) 0) 0)) (<= |#Ultimate.C_memset_#t~loopctr21| 8))), 15451#(or (not (= |#Ultimate.C_memset_#ptr.offset| 0)) (<= |#Ultimate.C_memset_#t~loopctr21| 8) (and (= 0 (select (store (select |#memory_$Pointer$.base| |#Ultimate.C_memset_#ptr.base|) (+ |#Ultimate.C_memset_#t~loopctr21| |#Ultimate.C_memset_#ptr.offset|) 0) 0)) (<= |#Ultimate.C_memset_#t~loopctr21| 9))), 15452#(or (and (<= |#Ultimate.C_memset_#t~loopctr21| 10) (= 0 (select (store (select |#memory_$Pointer$.base| |#Ultimate.C_memset_#ptr.base|) (+ |#Ultimate.C_memset_#ptr.offset| |#Ultimate.C_memset_#t~loopctr21|) 0) 0))) (not (= |#Ultimate.C_memset_#ptr.offset| 0)) (<= (+ |#Ultimate.C_memset_#ptr.offset| |#Ultimate.C_memset_#t~loopctr21|) 9)), 15453#(or (and (= 0 (select (store (select |#memory_$Pointer$.base| |#Ultimate.C_memset_#ptr.base|) (+ |#Ultimate.C_memset_#ptr.offset| |#Ultimate.C_memset_#t~loopctr21|) 0) 0)) (<= |#Ultimate.C_memset_#t~loopctr21| 11)) (<= (+ |#Ultimate.C_memset_#ptr.offset| |#Ultimate.C_memset_#t~loopctr21|) 10) (not (= |#Ultimate.C_memset_#ptr.offset| 0))), 15454#(or (= 0 (select (store (select |#memory_$Pointer$.base| |#Ultimate.C_memset_#ptr.base|) (+ |#Ultimate.C_memset_#ptr.offset| |#Ultimate.C_memset_#t~loopctr21|) 0) 0)) (not (= |#Ultimate.C_memset_#ptr.offset| 0)) (<= (+ |#Ultimate.C_memset_#ptr.offset| |#Ultimate.C_memset_#t~loopctr21|) 11)), 15455#(or (= 0 (select (store (select |#memory_$Pointer$.base| |#Ultimate.C_memset_#ptr.base|) (+ |#Ultimate.C_memset_#t~loopctr21| |#Ultimate.C_memset_#ptr.offset|) 0) 0)) (not (= |#Ultimate.C_memset_#ptr.offset| 0)) (<= (+ |#Ultimate.C_memset_#ptr.offset| |#Ultimate.C_memset_#t~loopctr21|) 12)), 15456#(or (= 0 (select (store (select |#memory_$Pointer$.base| |#Ultimate.C_memset_#ptr.base|) (+ |#Ultimate.C_memset_#ptr.offset| |#Ultimate.C_memset_#t~loopctr21|) 0) 0)) (not (= |#Ultimate.C_memset_#ptr.offset| 0)) (<= |#Ultimate.C_memset_#t~loopctr21| 13)), 15457#(or (= 0 (select (store (select |#memory_$Pointer$.base| |#Ultimate.C_memset_#ptr.base|) (+ |#Ultimate.C_memset_#ptr.offset| |#Ultimate.C_memset_#t~loopctr21|) 0) 0)) (not (= |#Ultimate.C_memset_#ptr.offset| 0)) (<= (+ |#Ultimate.C_memset_#ptr.offset| |#Ultimate.C_memset_#t~loopctr21|) 14)), 15458#(or (<= |#Ultimate.C_memset_#t~loopctr21| 15) (= 0 (select (select |#memory_$Pointer$.base| |#Ultimate.C_memset_#ptr.base|) 0)) (not (= |#Ultimate.C_memset_#ptr.offset| 0))), 15459#(or (= 0 (select (select |#memory_$Pointer$.base| |#Ultimate.C_memset_#ptr.base|) 0)) (not (= |#Ultimate.C_memset_#ptr.offset| 0)) (<= |#Ultimate.C_memset_#amount| 15)), 15460#(and (= 0 ldv_kobject_create_~kobj~1.offset) (= 0 (select (select |#memory_$Pointer$.base| ldv_kobject_create_~kobj~1.base) 0))), 15461#(= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|), 15462#(and (= |ldv_kobject_init_#in~kobj.offset| ldv_kobject_init_~kobj.offset) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |ldv_kobject_init_#in~kobj.base| ldv_kobject_init_~kobj.base)), 15463#(and (or (and (= ldv_kobject_init_internal_~kobj.base |ldv_kobject_init_internal_#in~kobj.base|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|)) (not (= ldv_kobject_init_internal_~kobj.offset 0))) (or (= ldv_kobject_init_internal_~kobj.offset |ldv_kobject_init_internal_#in~kobj.offset|) (= ldv_kobject_init_internal_~kobj.offset 0))), 15464#(and (or (and (= ldv_kobject_init_internal_~kobj.base |ldv_kobject_init_internal_#in~kobj.base|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.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)))), 15465#(and (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (<= |ldv_kref_init_#in~kref.offset| ldv_kref_init_~kref.offset) (= ldv_kref_init_~kref.base |ldv_kref_init_#in~kref.base|)), 15466#(and (or (= (select |old(#memory_$Pointer$.base)| |ldv_kref_init_#in~kref.base|) (select |#memory_$Pointer$.base| |ldv_kref_init_#in~kref.base|)) (<= |ldv_kref_init_#in~kref.offset| (@diff (select |old(#memory_$Pointer$.base)| |ldv_kref_init_#in~kref.base|) (select |#memory_$Pointer$.base| |ldv_kref_init_#in~kref.base|)))) (= (store (select |old(#memory_$Pointer$.base)| |ldv_kref_init_#in~kref.base|) (@diff (select |old(#memory_$Pointer$.base)| |ldv_kref_init_#in~kref.base|) (select |#memory_$Pointer$.base| |ldv_kref_init_#in~kref.base|)) (select (select |#memory_$Pointer$.base| |ldv_kref_init_#in~kref.base|) (@diff (select |old(#memory_$Pointer$.base)| |ldv_kref_init_#in~kref.base|) (select |#memory_$Pointer$.base| |ldv_kref_init_#in~kref.base|)))) (select |#memory_$Pointer$.base| |ldv_kref_init_#in~kref.base|))), 15467#(and (or (= ldv_kobject_init_internal_~kobj.offset 0) (not (= |ldv_kobject_init_internal_#in~kobj.offset| 0))) (or (and (or (= (select |old(#memory_$Pointer$.base)| |ldv_kobject_init_internal_#in~kobj.base|) (select |#memory_$Pointer$.base| ldv_kobject_init_internal_~kobj.base)) (<= (+ ldv_kobject_init_internal_~kobj.offset 12) (@diff (select |old(#memory_$Pointer$.base)| |ldv_kobject_init_internal_#in~kobj.base|) (select |#memory_$Pointer$.base| ldv_kobject_init_internal_~kobj.base)))) (= ldv_kobject_init_internal_~kobj.base |ldv_kobject_init_internal_#in~kobj.base|) (= (select |#memory_$Pointer$.base| ldv_kobject_init_internal_~kobj.base) (store (select |old(#memory_$Pointer$.base)| |ldv_kobject_init_internal_#in~kobj.base|) (@diff (select |old(#memory_$Pointer$.base)| |ldv_kobject_init_internal_#in~kobj.base|) (select |#memory_$Pointer$.base| ldv_kobject_init_internal_~kobj.base)) (select (select |#memory_$Pointer$.base| ldv_kobject_init_internal_~kobj.base) (@diff (select |old(#memory_$Pointer$.base)| |ldv_kobject_init_internal_#in~kobj.base|) (select |#memory_$Pointer$.base| ldv_kobject_init_internal_~kobj.base)))))) (not (= ldv_kobject_init_internal_~kobj.offset 0)))), 15468#(and (= LDV_INIT_LIST_HEAD_~list.base |LDV_INIT_LIST_HEAD_#in~list.base|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (<= |LDV_INIT_LIST_HEAD_#in~list.offset| LDV_INIT_LIST_HEAD_~list.offset) (<= LDV_INIT_LIST_HEAD_~list.offset |LDV_INIT_LIST_HEAD_#in~list.offset|)), 15469#(and (= LDV_INIT_LIST_HEAD_~list.base |LDV_INIT_LIST_HEAD_#in~list.base|) (= (select |#memory_$Pointer$.base| LDV_INIT_LIST_HEAD_~list.base) (store (select |old(#memory_$Pointer$.base)| LDV_INIT_LIST_HEAD_~list.base) LDV_INIT_LIST_HEAD_~list.offset (select (select |#memory_$Pointer$.base| LDV_INIT_LIST_HEAD_~list.base) LDV_INIT_LIST_HEAD_~list.offset))) (<= |LDV_INIT_LIST_HEAD_#in~list.offset| LDV_INIT_LIST_HEAD_~list.offset) (<= LDV_INIT_LIST_HEAD_~list.offset |LDV_INIT_LIST_HEAD_#in~list.offset|)), 15470#(and (or (<= |LDV_INIT_LIST_HEAD_#in~list.offset| (@diff (select |old(#memory_$Pointer$.base)| |LDV_INIT_LIST_HEAD_#in~list.base|) (select |#memory_$Pointer$.base| |LDV_INIT_LIST_HEAD_#in~list.base|))) (= (select |#memory_$Pointer$.base| |LDV_INIT_LIST_HEAD_#in~list.base|) (select |old(#memory_$Pointer$.base)| |LDV_INIT_LIST_HEAD_#in~list.base|))) (= (select |#memory_$Pointer$.base| |LDV_INIT_LIST_HEAD_#in~list.base|) (store (store (select |old(#memory_$Pointer$.base)| |LDV_INIT_LIST_HEAD_#in~list.base|) (@diff (select |old(#memory_$Pointer$.base)| |LDV_INIT_LIST_HEAD_#in~list.base|) (select |#memory_$Pointer$.base| |LDV_INIT_LIST_HEAD_#in~list.base|)) (select (select |#memory_$Pointer$.base| |LDV_INIT_LIST_HEAD_#in~list.base|) (@diff (select |old(#memory_$Pointer$.base)| |LDV_INIT_LIST_HEAD_#in~list.base|) (select |#memory_$Pointer$.base| |LDV_INIT_LIST_HEAD_#in~list.base|)))) (@diff (store (select |old(#memory_$Pointer$.base)| |LDV_INIT_LIST_HEAD_#in~list.base|) (@diff (select |old(#memory_$Pointer$.base)| |LDV_INIT_LIST_HEAD_#in~list.base|) (select |#memory_$Pointer$.base| |LDV_INIT_LIST_HEAD_#in~list.base|)) (select (select |#memory_$Pointer$.base| |LDV_INIT_LIST_HEAD_#in~list.base|) (@diff (select |old(#memory_$Pointer$.base)| |LDV_INIT_LIST_HEAD_#in~list.base|) (select |#memory_$Pointer$.base| |LDV_INIT_LIST_HEAD_#in~list.base|)))) (select |#memory_$Pointer$.base| |LDV_INIT_LIST_HEAD_#in~list.base|)) (select (select |#memory_$Pointer$.base| |LDV_INIT_LIST_HEAD_#in~list.base|) (@diff (store (select |old(#memory_$Pointer$.base)| |LDV_INIT_LIST_HEAD_#in~list.base|) (@diff (select |old(#memory_$Pointer$.base)| |LDV_INIT_LIST_HEAD_#in~list.base|) (select |#memory_$Pointer$.base| |LDV_INIT_LIST_HEAD_#in~list.base|)) (select (select |#memory_$Pointer$.base| |LDV_INIT_LIST_HEAD_#in~list.base|) (@diff (select |old(#memory_$Pointer$.base)| |LDV_INIT_LIST_HEAD_#in~list.base|) (select |#memory_$Pointer$.base| |LDV_INIT_LIST_HEAD_#in~list.base|)))) (select |#memory_$Pointer$.base| |LDV_INIT_LIST_HEAD_#in~list.base|))))) (or (<= |LDV_INIT_LIST_HEAD_#in~list.offset| (@diff (store (select |old(#memory_$Pointer$.base)| |LDV_INIT_LIST_HEAD_#in~list.base|) (@diff (select |old(#memory_$Pointer$.base)| |LDV_INIT_LIST_HEAD_#in~list.base|) (select |#memory_$Pointer$.base| |LDV_INIT_LIST_HEAD_#in~list.base|)) (select (select |#memory_$Pointer$.base| |LDV_INIT_LIST_HEAD_#in~list.base|) (@diff (select |old(#memory_$Pointer$.base)| |LDV_INIT_LIST_HEAD_#in~list.base|) (select |#memory_$Pointer$.base| |LDV_INIT_LIST_HEAD_#in~list.base|)))) (select |#memory_$Pointer$.base| |LDV_INIT_LIST_HEAD_#in~list.base|))) (= (select |#memory_$Pointer$.base| |LDV_INIT_LIST_HEAD_#in~list.base|) (store (select |old(#memory_$Pointer$.base)| |LDV_INIT_LIST_HEAD_#in~list.base|) (@diff (select |old(#memory_$Pointer$.base)| |LDV_INIT_LIST_HEAD_#in~list.base|) (select |#memory_$Pointer$.base| |LDV_INIT_LIST_HEAD_#in~list.base|)) (select (select |#memory_$Pointer$.base| |LDV_INIT_LIST_HEAD_#in~list.base|) (@diff (select |old(#memory_$Pointer$.base)| |LDV_INIT_LIST_HEAD_#in~list.base|) (select |#memory_$Pointer$.base| |LDV_INIT_LIST_HEAD_#in~list.base|))))))), 15471#(or (and (or (= (store (store (select |old(#memory_$Pointer$.base)| |ldv_kobject_init_internal_#in~kobj.base|) (@diff (select |old(#memory_$Pointer$.base)| |ldv_kobject_init_internal_#in~kobj.base|) (select |#memory_$Pointer$.base| |ldv_kobject_init_internal_#in~kobj.base|)) (select (select |#memory_$Pointer$.base| |ldv_kobject_init_internal_#in~kobj.base|) (@diff (select |old(#memory_$Pointer$.base)| |ldv_kobject_init_internal_#in~kobj.base|) (select |#memory_$Pointer$.base| |ldv_kobject_init_internal_#in~kobj.base|)))) (@diff (store (select |old(#memory_$Pointer$.base)| |ldv_kobject_init_internal_#in~kobj.base|) (@diff (select |old(#memory_$Pointer$.base)| |ldv_kobject_init_internal_#in~kobj.base|) (select |#memory_$Pointer$.base| |ldv_kobject_init_internal_#in~kobj.base|)) (select (select |#memory_$Pointer$.base| |ldv_kobject_init_internal_#in~kobj.base|) (@diff (select |old(#memory_$Pointer$.base)| |ldv_kobject_init_internal_#in~kobj.base|) (select |#memory_$Pointer$.base| |ldv_kobject_init_internal_#in~kobj.base|)))) (select |#memory_$Pointer$.base| |ldv_kobject_init_internal_#in~kobj.base|)) (select (select |#memory_$Pointer$.base| |ldv_kobject_init_internal_#in~kobj.base|) (@diff (store (select |old(#memory_$Pointer$.base)| |ldv_kobject_init_internal_#in~kobj.base|) (@diff (select |old(#memory_$Pointer$.base)| |ldv_kobject_init_internal_#in~kobj.base|) (select |#memory_$Pointer$.base| |ldv_kobject_init_internal_#in~kobj.base|)) (select (select |#memory_$Pointer$.base| |ldv_kobject_init_internal_#in~kobj.base|) (@diff (select |old(#memory_$Pointer$.base)| |ldv_kobject_init_internal_#in~kobj.base|) (select |#memory_$Pointer$.base| |ldv_kobject_init_internal_#in~kobj.base|)))) (select |#memory_$Pointer$.base| |ldv_kobject_init_internal_#in~kobj.base|)))) (select |#memory_$Pointer$.base| |ldv_kobject_init_internal_#in~kobj.base|)) (<= 4 (@diff (store (store (select |old(#memory_$Pointer$.base)| |ldv_kobject_init_internal_#in~kobj.base|) (@diff (select |old(#memory_$Pointer$.base)| |ldv_kobject_init_internal_#in~kobj.base|) (select |#memory_$Pointer$.base| |ldv_kobject_init_internal_#in~kobj.base|)) (select (select |#memory_$Pointer$.base| |ldv_kobject_init_internal_#in~kobj.base|) (@diff (select |old(#memory_$Pointer$.base)| |ldv_kobject_init_internal_#in~kobj.base|) (select |#memory_$Pointer$.base| |ldv_kobject_init_internal_#in~kobj.base|)))) (@diff (store (select |old(#memory_$Pointer$.base)| |ldv_kobject_init_internal_#in~kobj.base|) (@diff (select |old(#memory_$Pointer$.base)| |ldv_kobject_init_internal_#in~kobj.base|) (select |#memory_$Pointer$.base| |ldv_kobject_init_internal_#in~kobj.base|)) (select (select |#memory_$Pointer$.base| |ldv_kobject_init_internal_#in~kobj.base|) (@diff (select |old(#memory_$Pointer$.base)| |ldv_kobject_init_internal_#in~kobj.base|) (select |#memory_$Pointer$.base| |ldv_kobject_init_internal_#in~kobj.base|)))) (select |#memory_$Pointer$.base| |ldv_kobject_init_internal_#in~kobj.base|)) (select (select |#memory_$Pointer$.base| |ldv_kobject_init_internal_#in~kobj.base|) (@diff (store (select |old(#memory_$Pointer$.base)| |ldv_kobject_init_internal_#in~kobj.base|) (@diff (select |old(#memory_$Pointer$.base)| |ldv_kobject_init_internal_#in~kobj.base|) (select |#memory_$Pointer$.base| |ldv_kobject_init_internal_#in~kobj.base|)) (select (select |#memory_$Pointer$.base| |ldv_kobject_init_internal_#in~kobj.base|) (@diff (select |old(#memory_$Pointer$.base)| |ldv_kobject_init_internal_#in~kobj.base|) (select |#memory_$Pointer$.base| |ldv_kobject_init_internal_#in~kobj.base|)))) (select |#memory_$Pointer$.base| |ldv_kobject_init_internal_#in~kobj.base|)))) (select |#memory_$Pointer$.base| |ldv_kobject_init_internal_#in~kobj.base|)))) (= (store (store (store (select |old(#memory_$Pointer$.base)| |ldv_kobject_init_internal_#in~kobj.base|) (@diff (select |old(#memory_$Pointer$.base)| |ldv_kobject_init_internal_#in~kobj.base|) (select |#memory_$Pointer$.base| |ldv_kobject_init_internal_#in~kobj.base|)) (select (select |#memory_$Pointer$.base| |ldv_kobject_init_internal_#in~kobj.base|) (@diff (select |old(#memory_$Pointer$.base)| |ldv_kobject_init_internal_#in~kobj.base|) (select |#memory_$Pointer$.base| |ldv_kobject_init_internal_#in~kobj.base|)))) (@diff (store (select |old(#memory_$Pointer$.base)| |ldv_kobject_init_internal_#in~kobj.base|) (@diff (select |old(#memory_$Pointer$.base)| |ldv_kobject_init_internal_#in~kobj.base|) (select |#memory_$Pointer$.base| |ldv_kobject_init_internal_#in~kobj.base|)) (select (select |#memory_$Pointer$.base| |ldv_kobject_init_internal_#in~kobj.base|) (@diff (select |old(#memory_$Pointer$.base)| |ldv_kobject_init_internal_#in~kobj.base|) (select |#memory_$Pointer$.base| |ldv_kobject_init_internal_#in~kobj.base|)))) (select |#memory_$Pointer$.base| |ldv_kobject_init_internal_#in~kobj.base|)) (select (select |#memory_$Pointer$.base| |ldv_kobject_init_internal_#in~kobj.base|) (@diff (store (select |old(#memory_$Pointer$.base)| |ldv_kobject_init_internal_#in~kobj.base|) (@diff (select |old(#memory_$Pointer$.base)| |ldv_kobject_init_internal_#in~kobj.base|) (select |#memory_$Pointer$.base| |ldv_kobject_init_internal_#in~kobj.base|)) (select (select |#memory_$Pointer$.base| |ldv_kobject_init_internal_#in~kobj.base|) (@diff (select |old(#memory_$Pointer$.base)| |ldv_kobject_init_internal_#in~kobj.base|) (select |#memory_$Pointer$.base| |ldv_kobject_init_internal_#in~kobj.base|)))) (select |#memory_$Pointer$.base| |ldv_kobject_init_internal_#in~kobj.base|)))) (@diff (store (store (select |old(#memory_$Pointer$.base)| |ldv_kobject_init_internal_#in~kobj.base|) (@diff (select |old(#memory_$Pointer$.base)| |ldv_kobject_init_internal_#in~kobj.base|) (select |#memory_$Pointer$.base| |ldv_kobject_init_internal_#in~kobj.base|)) (select (select |#memory_$Pointer$.base| |ldv_kobject_init_internal_#in~kobj.base|) (@diff (select |old(#memory_$Pointer$.base)| |ldv_kobject_init_internal_#in~kobj.base|) (select |#memory_$Pointer$.base| |ldv_kobject_init_internal_#in~kobj.base|)))) (@diff (store (select |old(#memory_$Pointer$.base)| |ldv_kobject_init_internal_#in~kobj.base|) (@diff (select |old(#memory_$Pointer$.base)| |ldv_kobject_init_internal_#in~kobj.base|) (select |#memory_$Pointer$.base| |ldv_kobject_init_internal_#in~kobj.base|)) (select (select |#memory_$Pointer$.base| |ldv_kobject_init_internal_#in~kobj.base|) (@diff (select |old(#memory_$Pointer$.base)| |ldv_kobject_init_internal_#in~kobj.base|) (select |#memory_$Pointer$.base| |ldv_kobject_init_internal_#in~kobj.base|)))) (select |#memory_$Pointer$.base| |ldv_kobject_init_internal_#in~kobj.base|)) (select (select |#memory_$Pointer$.base| |ldv_kobject_init_internal_#in~kobj.base|) (@diff (store (select |old(#memory_$Pointer$.base)| |ldv_kobject_init_internal_#in~kobj.base|) (@diff (select |old(#memory_$Pointer$.base)| |ldv_kobject_init_internal_#in~kobj.base|) (select |#memory_$Pointer$.base| |ldv_kobject_init_internal_#in~kobj.base|)) (select (select |#memory_$Pointer$.base| |ldv_kobject_init_internal_#in~kobj.base|) (@diff (select |old(#memory_$Pointer$.base)| |ldv_kobject_init_internal_#in~kobj.base|) (select |#memory_$Pointer$.base| |ldv_kobject_init_internal_#in~kobj.base|)))) (select |#memory_$Pointer$.base| |ldv_kobject_init_internal_#in~kobj.base|)))) (select |#memory_$Pointer$.base| |ldv_kobject_init_internal_#in~kobj.base|)) (select (select |#memory_$Pointer$.base| |ldv_kobject_init_internal_#in~kobj.base|) (@diff (store (store (select |old(#memory_$Pointer$.base)| |ldv_kobject_init_internal_#in~kobj.base|) (@diff (select |old(#memory_$Pointer$.base)| |ldv_kobject_init_internal_#in~kobj.base|) (select |#memory_$Pointer$.base| |ldv_kobject_init_internal_#in~kobj.base|)) (select (select |#memory_$Pointer$.base| |ldv_kobject_init_internal_#in~kobj.base|) (@diff (select |old(#memory_$Pointer$.base)| |ldv_kobject_init_internal_#in~kobj.base|) (select |#memory_$Pointer$.base| |ldv_kobject_init_internal_#in~kobj.base|)))) (@diff (store (select |old(#memory_$Pointer$.base)| |ldv_kobject_init_internal_#in~kobj.base|) (@diff (select |old(#memory_$Pointer$.base)| |ldv_kobject_init_internal_#in~kobj.base|) (select |#memory_$Pointer$.base| |ldv_kobject_init_internal_#in~kobj.base|)) (select (select |#memory_$Pointer$.base| |ldv_kobject_init_internal_#in~kobj.base|) (@diff (select |old(#memory_$Pointer$.base)| |ldv_kobject_init_internal_#in~kobj.base|) (select |#memory_$Pointer$.base| |ldv_kobject_init_internal_#in~kobj.base|)))) (select |#memory_$Pointer$.base| |ldv_kobject_init_internal_#in~kobj.base|)) (select (select |#memory_$Pointer$.base| |ldv_kobject_init_internal_#in~kobj.base|) (@diff (store (select |old(#memory_$Pointer$.base)| |ldv_kobject_init_internal_#in~kobj.base|) (@diff (select |old(#memory_$Pointer$.base)| |ldv_kobject_init_internal_#in~kobj.base|) (select |#memory_$Pointer$.base| |ldv_kobject_init_internal_#in~kobj.base|)) (select (select |#memory_$Pointer$.base| |ldv_kobject_init_internal_#in~kobj.base|) (@diff (select |old(#memory_$Pointer$.base)| |ldv_kobject_init_internal_#in~kobj.base|) (select |#memory_$Pointer$.base| |ldv_kobject_init_internal_#in~kobj.base|)))) (select |#memory_$Pointer$.base| |ldv_kobject_init_internal_#in~kobj.base|)))) (select |#memory_$Pointer$.base| |ldv_kobject_init_internal_#in~kobj.base|)))) (select |#memory_$Pointer$.base| |ldv_kobject_init_internal_#in~kobj.base|)) (or (<= 4 (@diff (select |old(#memory_$Pointer$.base)| |ldv_kobject_init_internal_#in~kobj.base|) (select |#memory_$Pointer$.base| |ldv_kobject_init_internal_#in~kobj.base|))) (= (select |old(#memory_$Pointer$.base)| |ldv_kobject_init_internal_#in~kobj.base|) (select |#memory_$Pointer$.base| |ldv_kobject_init_internal_#in~kobj.base|))) (or (= (select |#memory_$Pointer$.base| |ldv_kobject_init_internal_#in~kobj.base|) (store (select |old(#memory_$Pointer$.base)| |ldv_kobject_init_internal_#in~kobj.base|) (@diff (select |old(#memory_$Pointer$.base)| |ldv_kobject_init_internal_#in~kobj.base|) (select |#memory_$Pointer$.base| |ldv_kobject_init_internal_#in~kobj.base|)) (select (select |#memory_$Pointer$.base| |ldv_kobject_init_internal_#in~kobj.base|) (@diff (select |old(#memory_$Pointer$.base)| |ldv_kobject_init_internal_#in~kobj.base|) (select |#memory_$Pointer$.base| |ldv_kobject_init_internal_#in~kobj.base|))))) (<= 4 (@diff (store (select |old(#memory_$Pointer$.base)| |ldv_kobject_init_internal_#in~kobj.base|) (@diff (select |old(#memory_$Pointer$.base)| |ldv_kobject_init_internal_#in~kobj.base|) (select |#memory_$Pointer$.base| |ldv_kobject_init_internal_#in~kobj.base|)) (select (select |#memory_$Pointer$.base| |ldv_kobject_init_internal_#in~kobj.base|) (@diff (select |old(#memory_$Pointer$.base)| |ldv_kobject_init_internal_#in~kobj.base|) (select |#memory_$Pointer$.base| |ldv_kobject_init_internal_#in~kobj.base|)))) (select |#memory_$Pointer$.base| |ldv_kobject_init_internal_#in~kobj.base|))))) (not (= |ldv_kobject_init_internal_#in~kobj.offset| 0))), 15472#(or (and (or (= (select |#memory_$Pointer$.base| |ldv_kobject_init_#in~kobj.base|) (store (select |old(#memory_$Pointer$.base)| |ldv_kobject_init_#in~kobj.base|) (@diff (select |old(#memory_$Pointer$.base)| |ldv_kobject_init_#in~kobj.base|) (select |#memory_$Pointer$.base| |ldv_kobject_init_#in~kobj.base|)) (select (select |#memory_$Pointer$.base| |ldv_kobject_init_#in~kobj.base|) (@diff (select |old(#memory_$Pointer$.base)| |ldv_kobject_init_#in~kobj.base|) (select |#memory_$Pointer$.base| |ldv_kobject_init_#in~kobj.base|))))) (<= 4 (@diff (store (select |old(#memory_$Pointer$.base)| |ldv_kobject_init_#in~kobj.base|) (@diff (select |old(#memory_$Pointer$.base)| |ldv_kobject_init_#in~kobj.base|) (select |#memory_$Pointer$.base| |ldv_kobject_init_#in~kobj.base|)) (select (select |#memory_$Pointer$.base| |ldv_kobject_init_#in~kobj.base|) (@diff (select |old(#memory_$Pointer$.base)| |ldv_kobject_init_#in~kobj.base|) (select |#memory_$Pointer$.base| |ldv_kobject_init_#in~kobj.base|)))) (select |#memory_$Pointer$.base| |ldv_kobject_init_#in~kobj.base|)))) (or (<= 4 (@diff (select |old(#memory_$Pointer$.base)| |ldv_kobject_init_#in~kobj.base|) (select |#memory_$Pointer$.base| |ldv_kobject_init_#in~kobj.base|))) (= (select |#memory_$Pointer$.base| |ldv_kobject_init_#in~kobj.base|) (select |old(#memory_$Pointer$.base)| |ldv_kobject_init_#in~kobj.base|))) (= (store (store (store (select |old(#memory_$Pointer$.base)| |ldv_kobject_init_#in~kobj.base|) (@diff (select |old(#memory_$Pointer$.base)| |ldv_kobject_init_#in~kobj.base|) (select |#memory_$Pointer$.base| |ldv_kobject_init_#in~kobj.base|)) (select (select |#memory_$Pointer$.base| |ldv_kobject_init_#in~kobj.base|) (@diff (select |old(#memory_$Pointer$.base)| |ldv_kobject_init_#in~kobj.base|) (select |#memory_$Pointer$.base| |ldv_kobject_init_#in~kobj.base|)))) (@diff (store (select |old(#memory_$Pointer$.base)| |ldv_kobject_init_#in~kobj.base|) (@diff (select |old(#memory_$Pointer$.base)| |ldv_kobject_init_#in~kobj.base|) (select |#memory_$Pointer$.base| |ldv_kobject_init_#in~kobj.base|)) (select (select |#memory_$Pointer$.base| |ldv_kobject_init_#in~kobj.base|) (@diff (select |old(#memory_$Pointer$.base)| |ldv_kobject_init_#in~kobj.base|) (select |#memory_$Pointer$.base| |ldv_kobject_init_#in~kobj.base|)))) (select |#memory_$Pointer$.base| |ldv_kobject_init_#in~kobj.base|)) (select (select |#memory_$Pointer$.base| |ldv_kobject_init_#in~kobj.base|) (@diff (store (select |old(#memory_$Pointer$.base)| |ldv_kobject_init_#in~kobj.base|) (@diff (select |old(#memory_$Pointer$.base)| |ldv_kobject_init_#in~kobj.base|) (select |#memory_$Pointer$.base| |ldv_kobject_init_#in~kobj.base|)) (select (select |#memory_$Pointer$.base| |ldv_kobject_init_#in~kobj.base|) (@diff (select |old(#memory_$Pointer$.base)| |ldv_kobject_init_#in~kobj.base|) (select |#memory_$Pointer$.base| |ldv_kobject_init_#in~kobj.base|)))) (select |#memory_$Pointer$.base| |ldv_kobject_init_#in~kobj.base|)))) (@diff (store (store (select |old(#memory_$Pointer$.base)| |ldv_kobject_init_#in~kobj.base|) (@diff (select |old(#memory_$Pointer$.base)| |ldv_kobject_init_#in~kobj.base|) (select |#memory_$Pointer$.base| |ldv_kobject_init_#in~kobj.base|)) (select (select |#memory_$Pointer$.base| |ldv_kobject_init_#in~kobj.base|) (@diff (select |old(#memory_$Pointer$.base)| |ldv_kobject_init_#in~kobj.base|) (select |#memory_$Pointer$.base| |ldv_kobject_init_#in~kobj.base|)))) (@diff (store (select |old(#memory_$Pointer$.base)| |ldv_kobject_init_#in~kobj.base|) (@diff (select |old(#memory_$Pointer$.base)| |ldv_kobject_init_#in~kobj.base|) (select |#memory_$Pointer$.base| |ldv_kobject_init_#in~kobj.base|)) (select (select |#memory_$Pointer$.base| |ldv_kobject_init_#in~kobj.base|) (@diff (select |old(#memory_$Pointer$.base)| |ldv_kobject_init_#in~kobj.base|) (select |#memory_$Pointer$.base| |ldv_kobject_init_#in~kobj.base|)))) (select |#memory_$Pointer$.base| |ldv_kobject_init_#in~kobj.base|)) (select (select |#memory_$Pointer$.base| |ldv_kobject_init_#in~kobj.base|) (@diff (store (select |old(#memory_$Pointer$.base)| |ldv_kobject_init_#in~kobj.base|) (@diff (select |old(#memory_$Pointer$.base)| |ldv_kobject_init_#in~kobj.base|) (select |#memory_$Pointer$.base| |ldv_kobject_init_#in~kobj.base|)) (select (select |#memory_$Pointer$.base| |ldv_kobject_init_#in~kobj.base|) (@diff (select |old(#memory_$Pointer$.base)| |ldv_kobject_init_#in~kobj.base|) (select |#memory_$Pointer$.base| |ldv_kobject_init_#in~kobj.base|)))) (select |#memory_$Pointer$.base| |ldv_kobject_init_#in~kobj.base|)))) (select |#memory_$Pointer$.base| |ldv_kobject_init_#in~kobj.base|)) (select (select |#memory_$Pointer$.base| |ldv_kobject_init_#in~kobj.base|) (@diff (store (store (select |old(#memory_$Pointer$.base)| |ldv_kobject_init_#in~kobj.base|) (@diff (select |old(#memory_$Pointer$.base)| |ldv_kobject_init_#in~kobj.base|) (select |#memory_$Pointer$.base| |ldv_kobject_init_#in~kobj.base|)) (select (select |#memory_$Pointer$.base| |ldv_kobject_init_#in~kobj.base|) (@diff (select |old(#memory_$Pointer$.base)| |ldv_kobject_init_#in~kobj.base|) (select |#memory_$Pointer$.base| |ldv_kobject_init_#in~kobj.base|)))) (@diff (store (select |old(#memory_$Pointer$.base)| |ldv_kobject_init_#in~kobj.base|) (@diff (select |old(#memory_$Pointer$.base)| |ldv_kobject_init_#in~kobj.base|) (select |#memory_$Pointer$.base| |ldv_kobject_init_#in~kobj.base|)) (select (select |#memory_$Pointer$.base| |ldv_kobject_init_#in~kobj.base|) (@diff (select |old(#memory_$Pointer$.base)| |ldv_kobject_init_#in~kobj.base|) (select |#memory_$Pointer$.base| |ldv_kobject_init_#in~kobj.base|)))) (select |#memory_$Pointer$.base| |ldv_kobject_init_#in~kobj.base|)) (select (select |#memory_$Pointer$.base| |ldv_kobject_init_#in~kobj.base|) (@diff (store (select |old(#memory_$Pointer$.base)| |ldv_kobject_init_#in~kobj.base|) (@diff (select |old(#memory_$Pointer$.base)| |ldv_kobject_init_#in~kobj.base|) (select |#memory_$Pointer$.base| |ldv_kobject_init_#in~kobj.base|)) (select (select |#memory_$Pointer$.base| |ldv_kobject_init_#in~kobj.base|) (@diff (select |old(#memory_$Pointer$.base)| |ldv_kobject_init_#in~kobj.base|) (select |#memory_$Pointer$.base| |ldv_kobject_init_#in~kobj.base|)))) (select |#memory_$Pointer$.base| |ldv_kobject_init_#in~kobj.base|)))) (select |#memory_$Pointer$.base| |ldv_kobject_init_#in~kobj.base|)))) (select |#memory_$Pointer$.base| |ldv_kobject_init_#in~kobj.base|)) (or (<= 4 (@diff (store (store (select |old(#memory_$Pointer$.base)| |ldv_kobject_init_#in~kobj.base|) (@diff (select |old(#memory_$Pointer$.base)| |ldv_kobject_init_#in~kobj.base|) (select |#memory_$Pointer$.base| |ldv_kobject_init_#in~kobj.base|)) (select (select |#memory_$Pointer$.base| |ldv_kobject_init_#in~kobj.base|) (@diff (select |old(#memory_$Pointer$.base)| |ldv_kobject_init_#in~kobj.base|) (select |#memory_$Pointer$.base| |ldv_kobject_init_#in~kobj.base|)))) (@diff (store (select |old(#memory_$Pointer$.base)| |ldv_kobject_init_#in~kobj.base|) (@diff (select |old(#memory_$Pointer$.base)| |ldv_kobject_init_#in~kobj.base|) (select |#memory_$Pointer$.base| |ldv_kobject_init_#in~kobj.base|)) (select (select |#memory_$Pointer$.base| |ldv_kobject_init_#in~kobj.base|) (@diff (select |old(#memory_$Pointer$.base)| |ldv_kobject_init_#in~kobj.base|) (select |#memory_$Pointer$.base| |ldv_kobject_init_#in~kobj.base|)))) (select |#memory_$Pointer$.base| |ldv_kobject_init_#in~kobj.base|)) (select (select |#memory_$Pointer$.base| |ldv_kobject_init_#in~kobj.base|) (@diff (store (select |old(#memory_$Pointer$.base)| |ldv_kobject_init_#in~kobj.base|) (@diff (select |old(#memory_$Pointer$.base)| |ldv_kobject_init_#in~kobj.base|) (select |#memory_$Pointer$.base| |ldv_kobject_init_#in~kobj.base|)) (select (select |#memory_$Pointer$.base| |ldv_kobject_init_#in~kobj.base|) (@diff (select |old(#memory_$Pointer$.base)| |ldv_kobject_init_#in~kobj.base|) (select |#memory_$Pointer$.base| |ldv_kobject_init_#in~kobj.base|)))) (select |#memory_$Pointer$.base| |ldv_kobject_init_#in~kobj.base|)))) (select |#memory_$Pointer$.base| |ldv_kobject_init_#in~kobj.base|))) (= (store (store (select |old(#memory_$Pointer$.base)| |ldv_kobject_init_#in~kobj.base|) (@diff (select |old(#memory_$Pointer$.base)| |ldv_kobject_init_#in~kobj.base|) (select |#memory_$Pointer$.base| |ldv_kobject_init_#in~kobj.base|)) (select (select |#memory_$Pointer$.base| |ldv_kobject_init_#in~kobj.base|) (@diff (select |old(#memory_$Pointer$.base)| |ldv_kobject_init_#in~kobj.base|) (select |#memory_$Pointer$.base| |ldv_kobject_init_#in~kobj.base|)))) (@diff (store (select |old(#memory_$Pointer$.base)| |ldv_kobject_init_#in~kobj.base|) (@diff (select |old(#memory_$Pointer$.base)| |ldv_kobject_init_#in~kobj.base|) (select |#memory_$Pointer$.base| |ldv_kobject_init_#in~kobj.base|)) (select (select |#memory_$Pointer$.base| |ldv_kobject_init_#in~kobj.base|) (@diff (select |old(#memory_$Pointer$.base)| |ldv_kobject_init_#in~kobj.base|) (select |#memory_$Pointer$.base| |ldv_kobject_init_#in~kobj.base|)))) (select |#memory_$Pointer$.base| |ldv_kobject_init_#in~kobj.base|)) (select (select |#memory_$Pointer$.base| |ldv_kobject_init_#in~kobj.base|) (@diff (store (select |old(#memory_$Pointer$.base)| |ldv_kobject_init_#in~kobj.base|) (@diff (select |old(#memory_$Pointer$.base)| |ldv_kobject_init_#in~kobj.base|) (select |#memory_$Pointer$.base| |ldv_kobject_init_#in~kobj.base|)) (select (select |#memory_$Pointer$.base| |ldv_kobject_init_#in~kobj.base|) (@diff (select |old(#memory_$Pointer$.base)| |ldv_kobject_init_#in~kobj.base|) (select |#memory_$Pointer$.base| |ldv_kobject_init_#in~kobj.base|)))) (select |#memory_$Pointer$.base| |ldv_kobject_init_#in~kobj.base|)))) (select |#memory_$Pointer$.base| |ldv_kobject_init_#in~kobj.base|)))) (not (= |ldv_kobject_init_#in~kobj.offset| 0))), 15473#(and (= 0 (select (select |#memory_$Pointer$.base| |ldv_kobject_create_#res.base|) 0)) (= 0 |ldv_kobject_create_#res.offset|)), 15474#(and (= 0 (select (select |#memory_$Pointer$.base| |entry_point_#t~ret19.base|) 0)) (= 0 |entry_point_#t~ret19.offset|)), 15475#(and (= 0 entry_point_~kobj~2.offset) (= 0 (select (select |#memory_$Pointer$.base| entry_point_~kobj~2.base) 0))), 15476#(and (or (= ldv_kobject_get_~kobj.offset |ldv_kobject_get_#in~kobj.offset|) (= ldv_kobject_get_~kobj.offset 0)) (or (and (= ldv_kobject_get_~kobj.base |ldv_kobject_get_#in~kobj.base|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|)) (not (= ldv_kobject_get_~kobj.offset 0)))), 15477#(and (or (not (= 0 |ldv_kobject_get_#in~kobj.offset|)) (= ldv_kobject_get_~kobj.offset 0)) (or (and (= ldv_kobject_get_~kobj.base |ldv_kobject_get_#in~kobj.base|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|)) (not (= ldv_kobject_get_~kobj.offset 0)))), 15478#(and (<= ldv_kref_get_~kref.offset |ldv_kref_get_#in~kref.offset|) (= ldv_kref_get_~kref.base |ldv_kref_get_#in~kref.base|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (<= |ldv_kref_get_#in~kref.offset| ldv_kref_get_~kref.offset)), 15479#(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|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= ldv_atomic_add_return_~v.base |ldv_atomic_add_return_#in~v.base|)), 15480#(and (or (<= |ldv_atomic_add_return_#in~v.offset| (@diff (select |old(#memory_$Pointer$.base)| |ldv_atomic_add_return_#in~v.base|) (select |#memory_$Pointer$.base| |ldv_atomic_add_return_#in~v.base|))) (= (select |old(#memory_$Pointer$.base)| |ldv_atomic_add_return_#in~v.base|) (select |#memory_$Pointer$.base| |ldv_atomic_add_return_#in~v.base|))) (= (store (select |old(#memory_$Pointer$.base)| |ldv_atomic_add_return_#in~v.base|) (@diff (select |old(#memory_$Pointer$.base)| |ldv_atomic_add_return_#in~v.base|) (select |#memory_$Pointer$.base| |ldv_atomic_add_return_#in~v.base|)) (select (select |#memory_$Pointer$.base| |ldv_atomic_add_return_#in~v.base|) (@diff (select |old(#memory_$Pointer$.base)| |ldv_atomic_add_return_#in~v.base|) (select |#memory_$Pointer$.base| |ldv_atomic_add_return_#in~v.base|)))) (select |#memory_$Pointer$.base| |ldv_atomic_add_return_#in~v.base|))), 15481#(and (or (= (select |#memory_$Pointer$.base| |ldv_kref_get_#in~kref.base|) (select |old(#memory_$Pointer$.base)| |ldv_kref_get_#in~kref.base|)) (<= |ldv_kref_get_#in~kref.offset| (@diff (select |old(#memory_$Pointer$.base)| |ldv_kref_get_#in~kref.base|) (select |#memory_$Pointer$.base| |ldv_kref_get_#in~kref.base|)))) (= (select |#memory_$Pointer$.base| |ldv_kref_get_#in~kref.base|) (store (select |old(#memory_$Pointer$.base)| |ldv_kref_get_#in~kref.base|) (@diff (select |old(#memory_$Pointer$.base)| |ldv_kref_get_#in~kref.base|) (select |#memory_$Pointer$.base| |ldv_kref_get_#in~kref.base|)) (select (select |#memory_$Pointer$.base| |ldv_kref_get_#in~kref.base|) (@diff (select |old(#memory_$Pointer$.base)| |ldv_kref_get_#in~kref.base|) (select |#memory_$Pointer$.base| |ldv_kref_get_#in~kref.base|)))))), 15482#(and (or (and (or (<= (+ ldv_kobject_get_~kobj.offset 12) (@diff (select |old(#memory_$Pointer$.base)| |ldv_kobject_get_#in~kobj.base|) (select |#memory_$Pointer$.base| |ldv_kobject_get_#in~kobj.base|))) (= (select |old(#memory_$Pointer$.base)| |ldv_kobject_get_#in~kobj.base|) (select |#memory_$Pointer$.base| |ldv_kobject_get_#in~kobj.base|))) (= (store (select |old(#memory_$Pointer$.base)| |ldv_kobject_get_#in~kobj.base|) (@diff (select |old(#memory_$Pointer$.base)| |ldv_kobject_get_#in~kobj.base|) (select |#memory_$Pointer$.base| |ldv_kobject_get_#in~kobj.base|)) (select (select |#memory_$Pointer$.base| |ldv_kobject_get_#in~kobj.base|) (@diff (select |old(#memory_$Pointer$.base)| |ldv_kobject_get_#in~kobj.base|) (select |#memory_$Pointer$.base| |ldv_kobject_get_#in~kobj.base|)))) (select |#memory_$Pointer$.base| |ldv_kobject_get_#in~kobj.base|))) (not (= ldv_kobject_get_~kobj.offset 0))) (or (not (= 0 |ldv_kobject_get_#in~kobj.offset|)) (= ldv_kobject_get_~kobj.offset 0))), 15483#(or (not (= 0 |ldv_kobject_get_#in~kobj.offset|)) (and (or (= (select |old(#memory_$Pointer$.base)| |ldv_kobject_get_#in~kobj.base|) (select |#memory_$Pointer$.base| |ldv_kobject_get_#in~kobj.base|)) (<= 12 (@diff (select |old(#memory_$Pointer$.base)| |ldv_kobject_get_#in~kobj.base|) (select |#memory_$Pointer$.base| |ldv_kobject_get_#in~kobj.base|)))) (= (store (select |old(#memory_$Pointer$.base)| |ldv_kobject_get_#in~kobj.base|) (@diff (select |old(#memory_$Pointer$.base)| |ldv_kobject_get_#in~kobj.base|) (select |#memory_$Pointer$.base| |ldv_kobject_get_#in~kobj.base|)) (select (select |#memory_$Pointer$.base| |ldv_kobject_get_#in~kobj.base|) (@diff (select |old(#memory_$Pointer$.base)| |ldv_kobject_get_#in~kobj.base|) (select |#memory_$Pointer$.base| |ldv_kobject_get_#in~kobj.base|)))) (select |#memory_$Pointer$.base| |ldv_kobject_get_#in~kobj.base|)))), 15484#(and (= |ldv_kobject_put_#in~kobj.base| ldv_kobject_put_~kobj.base) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (or (= ldv_kobject_put_~kobj.offset 0) (= ldv_kobject_put_~kobj.offset |ldv_kobject_put_#in~kobj.offset|))), 15485#(and (or (= ldv_kobject_put_~kobj.offset 0) (not (= |ldv_kobject_put_#in~kobj.offset| 0))) (= |ldv_kobject_put_#in~kobj.base| ldv_kobject_put_~kobj.base) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|)), 15486#(and (<= |ldv_kref_put_#in~kref.offset| ldv_kref_put_~kref.offset) (= ldv_kref_put_~kref.base |ldv_kref_put_#in~kref.base|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|)), 15487#(and (<= |ldv_kref_sub_#in~kref.offset| ldv_kref_sub_~kref.offset) (= ldv_kref_sub_~kref.base |ldv_kref_sub_#in~kref.base|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|))] [2018-02-02 10:24:05,087 INFO L134 CoverageAnalysis]: Checked inductivity of 160 backedges. 0 proven. 146 refuted. 0 times theorem prover too weak. 14 trivial. 0 not checked. [2018-02-02 10:24:05,087 INFO L409 AbstractCegarLoop]: Interpolant automaton has 71 states [2018-02-02 10:24:05,087 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 71 interpolants. [2018-02-02 10:24:05,088 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=425, Invalid=4545, Unknown=0, NotChecked=0, Total=4970 [2018-02-02 10:24:05,088 INFO L87 Difference]: Start difference. First operand 158 states and 158 transitions. Second operand 71 states. [2018-02-02 10:24:08,545 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 10:24:08,546 INFO L93 Difference]: Finished difference Result 154 states and 154 transitions. [2018-02-02 10:24:08,546 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 65 states. [2018-02-02 10:24:08,546 INFO L78 Accepts]: Start accepts. Automaton has 71 states. Word has length 157 [2018-02-02 10:24:08,546 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 10:24:08,546 INFO L225 Difference]: With dead ends: 154 [2018-02-02 10:24:08,546 INFO L226 Difference]: Without dead ends: 0 [2018-02-02 10:24:08,547 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 135 GetRequests, 24 SyntacticMatches, 4 SemanticMatches, 107 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2718 ImplicationChecksByTransitivity, 4.4s TimeCoverageRelationStatistics Valid=1056, Invalid=10716, Unknown=0, NotChecked=0, Total=11772 [2018-02-02 10:24:08,547 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2018-02-02 10:24:08,547 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2018-02-02 10:24:08,547 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2018-02-02 10:24:08,548 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2018-02-02 10:24:08,548 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 157 [2018-02-02 10:24:08,548 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 10:24:08,548 INFO L432 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-02-02 10:24:08,548 INFO L433 AbstractCegarLoop]: Interpolant automaton has 71 states. [2018-02-02 10:24:08,548 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2018-02-02 10:24:08,548 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-02-02 10:24:08,553 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 02.02 10:24:08 BoogieIcfgContainer [2018-02-02 10:24:08,553 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-02-02 10:24:08,553 INFO L168 Benchmark]: Toolchain (without parser) took 43059.79 ms. Allocated memory was 399.5 MB in the beginning and 2.0 GB in the end (delta: 1.6 GB). Free memory was 356.4 MB in the beginning and 667.0 MB in the end (delta: -310.6 MB). Peak memory consumption was 1.3 GB. Max. memory is 5.3 GB. [2018-02-02 10:24:08,555 INFO L168 Benchmark]: CDTParser took 0.14 ms. Allocated memory is still 399.5 MB. Free memory is still 361.7 MB. There was no memory consumed. Max. memory is 5.3 GB. [2018-02-02 10:24:08,555 INFO L168 Benchmark]: CACSL2BoogieTranslator took 177.60 ms. Allocated memory is still 399.5 MB. Free memory was 356.4 MB in the beginning and 340.5 MB in the end (delta: 15.9 MB). Peak memory consumption was 15.9 MB. Max. memory is 5.3 GB. [2018-02-02 10:24:08,555 INFO L168 Benchmark]: Boogie Preprocessor took 32.52 ms. Allocated memory is still 399.5 MB. Free memory is still 340.5 MB. There was no memory consumed. Max. memory is 5.3 GB. [2018-02-02 10:24:08,555 INFO L168 Benchmark]: RCFGBuilder took 366.20 ms. Allocated memory is still 399.5 MB. Free memory was 340.5 MB in the beginning and 302.7 MB in the end (delta: 37.9 MB). Peak memory consumption was 37.9 MB. Max. memory is 5.3 GB. [2018-02-02 10:24:08,555 INFO L168 Benchmark]: TraceAbstraction took 42480.44 ms. Allocated memory was 399.5 MB in the beginning and 2.0 GB in the end (delta: 1.6 GB). Free memory was 302.7 MB in the beginning and 667.0 MB in the end (delta: -364.4 MB). Peak memory consumption was 1.3 GB. Max. memory is 5.3 GB. [2018-02-02 10:24:08,556 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.14 ms. Allocated memory is still 399.5 MB. Free memory is still 361.7 MB. There was no memory consumed. Max. memory is 5.3 GB. * CACSL2BoogieTranslator took 177.60 ms. Allocated memory is still 399.5 MB. Free memory was 356.4 MB in the beginning and 340.5 MB in the end (delta: 15.9 MB). Peak memory consumption was 15.9 MB. Max. memory is 5.3 GB. * Boogie Preprocessor took 32.52 ms. Allocated memory is still 399.5 MB. Free memory is still 340.5 MB. There was no memory consumed. Max. memory is 5.3 GB. * RCFGBuilder took 366.20 ms. Allocated memory is still 399.5 MB. Free memory was 340.5 MB in the beginning and 302.7 MB in the end (delta: 37.9 MB). Peak memory consumption was 37.9 MB. Max. memory is 5.3 GB. * TraceAbstraction took 42480.44 ms. Allocated memory was 399.5 MB in the beginning and 2.0 GB in the end (delta: 1.6 GB). Free memory was 302.7 MB in the beginning and 667.0 MB in the end (delta: -364.4 MB). Peak memory consumption was 1.3 GB. Max. memory is 5.3 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 1]: free always succeeds For all program executions holds that free always succeeds at this location - PositiveResult [Line: 1]: free always succeeds For all program executions holds that free always succeeds at this location - PositiveResult [Line: 1]: free always succeeds For all program executions holds that free always succeeds at this location - PositiveResult [Line: 1]: free always succeeds For all program executions holds that free always succeeds at this location - PositiveResult [Line: 1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 1443]: all allocated memory was freed For all program executions holds that all allocated memory was freed at this location - PositiveResult [Line: 1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - AllSpecificationsHoldResult: All specifications hold 23 specifications checked. All of them hold - StatisticsResult: Ultimate Automizer benchmark data CFG has 21 procedures, 143 locations, 23 error locations. SAFE Result, 42.4s OverallTime, 46 OverallIterations, 16 TraceHistogramMax, 20.6s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 5712 SDtfs, 1489 SDslu, 51359 SDs, 0 SdLazy, 30992 SolverSat, 907 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 11.8s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 1221 GetRequests, 187 SyntacticMatches, 25 SemanticMatches, 1009 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8044 ImplicationChecksByTransitivity, 21.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=168occurred in iteration=36, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 2684/3813 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s AbstIntTime, 0 AbstIntIterations, 0 AbstIntStrong, NaN AbsIntWeakeningRatio, NaN AbsIntAvgWeakeningVarsNumRemoved, NaN AbsIntAvgWeakenedConjuncts, 0.0s DumpTime, AutomataMinimizationStatistics: 0.2s AutomataMinimizationTime, 46 MinimizatonAttempts, 39 StatesRemovedByMinimization, 10 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.1s SsaConstructionTime, 0.7s SatisfiabilityAnalysisTime, 20.2s InterpolantComputationTime, 3131 NumberOfCodeBlocks, 3131 NumberOfCodeBlocksAsserted, 46 NumberOfCheckSat, 3085 ConstructedInterpolants, 0 QuantifiedInterpolants, 3214745 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 46 InterpolantComputations, 23 PerfectInterpolantSequences, 2684/3813 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be correct! Written .csv to /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/memleaks_test22_2_true-valid-memsafety_true-termination.i_svcomp-DerefFreeMemtrack-32bit-Automizer_SmtInterpol_Array.epf_AutomizerC.xml/Csv-Benchmark-0-2018-02-02_10-24-08-563.csv Written .csv to /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/memleaks_test22_2_true-valid-memsafety_true-termination.i_svcomp-DerefFreeMemtrack-32bit-Automizer_SmtInterpol_Array.epf_AutomizerC.xml/Csv-TraceAbstractionBenchmarks-0-2018-02-02_10-24-08-563.csv Received shutdown request...