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_3_true-valid-memsafety_true-termination.i -------------------------------------------------------------------------------- This is Ultimate 0.1.23-26d9e06-m [2018-02-02 10:23:52,600 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-02-02 10:23:52,601 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-02-02 10:23:52,612 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-02-02 10:23:52,612 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-02-02 10:23:52,613 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-02-02 10:23:52,614 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-02-02 10:23:52,615 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-02-02 10:23:52,616 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-02-02 10:23:52,617 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-02-02 10:23:52,618 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-02-02 10:23:52,618 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-02-02 10:23:52,619 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-02-02 10:23:52,620 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-02-02 10:23:52,620 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-02-02 10:23:52,622 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-02-02 10:23:52,624 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-02-02 10:23:52,625 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-02-02 10:23:52,626 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-02-02 10:23:52,627 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-02-02 10:23:52,629 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-02-02 10:23:52,629 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-02-02 10:23:52,629 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-02-02 10:23:52,630 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-02-02 10:23:52,631 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-02-02 10:23:52,632 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-02-02 10:23:52,632 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-02-02 10:23:52,632 INFO L177 SettingsManager]: PEA to Boogie provides no preferences, ignoring... [2018-02-02 10:23:52,633 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-02-02 10:23:52,633 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-02-02 10:23:52,633 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-02-02 10:23:52,633 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:52,643 INFO L110 SettingsManager]: Loading preferences was successful [2018-02-02 10:23:52,643 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-02-02 10:23:52,645 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-02-02 10:23:52,645 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-02-02 10:23:52,645 INFO L133 SettingsManager]: * Use SBE=true [2018-02-02 10:23:52,645 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-02-02 10:23:52,645 INFO L133 SettingsManager]: * sizeof long=4 [2018-02-02 10:23:52,646 INFO L133 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2018-02-02 10:23:52,646 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-02-02 10:23:52,646 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-02-02 10:23:52,646 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-02-02 10:23:52,646 INFO L133 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2018-02-02 10:23:52,646 INFO L133 SettingsManager]: * Bitprecise bitfields=true [2018-02-02 10:23:52,647 INFO L133 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2018-02-02 10:23:52,647 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-02-02 10:23:52,647 INFO L133 SettingsManager]: * sizeof long double=12 [2018-02-02 10:23:52,647 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-02-02 10:23:52,647 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-02-02 10:23:52,647 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-02-02 10:23:52,648 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-02-02 10:23:52,648 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-02-02 10:23:52,648 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-02-02 10:23:52,648 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=Craig_TreeInterpolation [2018-02-02 10:23:52,676 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-02-02 10:23:52,686 INFO L266 ainManager$Toolchain]: [Toolchain 1]: Parser(s) successfully initialized [2018-02-02 10:23:52,689 INFO L222 ainManager$Toolchain]: [Toolchain 1]: Toolchain data selected. [2018-02-02 10:23:52,691 INFO L271 PluginConnector]: Initializing CDTParser... [2018-02-02 10:23:52,691 INFO L276 PluginConnector]: CDTParser initialized [2018-02-02 10:23:52,692 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/ldv-memsafety/memleaks_test22_3_true-valid-memsafety_true-termination.i [2018-02-02 10:23:52,837 INFO L304 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-02-02 10:23:52,838 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2018-02-02 10:23:52,839 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-02-02 10:23:52,839 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-02-02 10:23:52,844 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-02-02 10:23:52,845 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 02.02 10:23:52" (1/1) ... [2018-02-02 10:23:52,848 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@6c2b8cf4 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.02 10:23:52, skipping insertion in model container [2018-02-02 10:23:52,848 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 02.02 10:23:52" (1/1) ... [2018-02-02 10:23:52,862 INFO L153 Dispatcher]: Using SV-COMP mode [2018-02-02 10:23:52,898 INFO L153 Dispatcher]: Using SV-COMP mode [2018-02-02 10:23:52,997 INFO L450 PostProcessor]: Settings: Checked method=main [2018-02-02 10:23:53,019 INFO L450 PostProcessor]: Settings: Checked method=main [2018-02-02 10:23:53,029 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.02 10:23:53 WrapperNode [2018-02-02 10:23:53,029 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-02-02 10:23:53,030 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-02-02 10:23:53,030 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-02-02 10:23:53,030 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-02-02 10:23:53,042 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:53" (1/1) ... [2018-02-02 10:23:53,043 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:53" (1/1) ... [2018-02-02 10:23:53,052 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:53" (1/1) ... [2018-02-02 10:23:53,052 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:53" (1/1) ... [2018-02-02 10:23:53,058 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:53" (1/1) ... [2018-02-02 10:23:53,060 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:53" (1/1) ... [2018-02-02 10:23:53,061 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:53" (1/1) ... [2018-02-02 10:23:53,063 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-02-02 10:23:53,064 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-02-02 10:23:53,064 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-02-02 10:23:53,064 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-02-02 10:23:53,065 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.02 10:23:53" (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:53,100 INFO L136 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-02-02 10:23:53,100 INFO L136 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-02-02 10:23:53,100 INFO L136 BoogieDeclarations]: Found implementation of procedure ##fun~$Pointer$~TO~VOID [2018-02-02 10:23:53,100 INFO L136 BoogieDeclarations]: Found implementation of procedure ldv_malloc [2018-02-02 10:23:53,100 INFO L136 BoogieDeclarations]: Found implementation of procedure LDV_INIT_LIST_HEAD [2018-02-02 10:23:53,100 INFO L136 BoogieDeclarations]: Found implementation of procedure ldv_atomic_add_return [2018-02-02 10:23:53,100 INFO L136 BoogieDeclarations]: Found implementation of procedure ldv_atomic_sub_return [2018-02-02 10:23:53,100 INFO L136 BoogieDeclarations]: Found implementation of procedure ldv_kref_sub [2018-02-02 10:23:53,100 INFO L136 BoogieDeclarations]: Found implementation of procedure ldv_kref_init [2018-02-02 10:23:53,101 INFO L136 BoogieDeclarations]: Found implementation of procedure ldv_kref_get [2018-02-02 10:23:53,101 INFO L136 BoogieDeclarations]: Found implementation of procedure ldv_kref_put [2018-02-02 10:23:53,101 INFO L136 BoogieDeclarations]: Found implementation of procedure ldv_kobject_cleanup [2018-02-02 10:23:53,101 INFO L136 BoogieDeclarations]: Found implementation of procedure ldv_kobject_release [2018-02-02 10:23:53,101 INFO L136 BoogieDeclarations]: Found implementation of procedure ldv_kobject_put [2018-02-02 10:23:53,101 INFO L136 BoogieDeclarations]: Found implementation of procedure ldv_kobject_get [2018-02-02 10:23:53,101 INFO L136 BoogieDeclarations]: Found implementation of procedure ldv_kobject_init_internal [2018-02-02 10:23:53,101 INFO L136 BoogieDeclarations]: Found implementation of procedure ldv_kobject_init [2018-02-02 10:23:53,101 INFO L136 BoogieDeclarations]: Found implementation of procedure ldv_kobject_create [2018-02-02 10:23:53,101 INFO L136 BoogieDeclarations]: Found implementation of procedure f_22_get [2018-02-02 10:23:53,101 INFO L136 BoogieDeclarations]: Found implementation of procedure f_22_put [2018-02-02 10:23:53,101 INFO L136 BoogieDeclarations]: Found implementation of procedure entry_point [2018-02-02 10:23:53,101 INFO L136 BoogieDeclarations]: Found implementation of procedure main [2018-02-02 10:23:53,101 INFO L128 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2018-02-02 10:23:53,101 INFO L128 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2018-02-02 10:23:53,102 INFO L128 BoogieDeclarations]: Found specification of procedure write~int [2018-02-02 10:23:53,102 INFO L128 BoogieDeclarations]: Found specification of procedure read~int [2018-02-02 10:23:53,102 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.free [2018-02-02 10:23:53,102 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2018-02-02 10:23:53,102 INFO L128 BoogieDeclarations]: Found specification of procedure #Ultimate.alloc [2018-02-02 10:23:53,102 INFO L128 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memset [2018-02-02 10:23:53,102 INFO L136 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memset [2018-02-02 10:23:53,102 INFO L128 BoogieDeclarations]: Found specification of procedure malloc [2018-02-02 10:23:53,102 INFO L128 BoogieDeclarations]: Found specification of procedure free [2018-02-02 10:23:53,102 INFO L128 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2018-02-02 10:23:53,102 INFO L128 BoogieDeclarations]: Found specification of procedure memset [2018-02-02 10:23:53,102 INFO L128 BoogieDeclarations]: Found specification of procedure ldv_malloc [2018-02-02 10:23:53,102 INFO L128 BoogieDeclarations]: Found specification of procedure LDV_INIT_LIST_HEAD [2018-02-02 10:23:53,103 INFO L128 BoogieDeclarations]: Found specification of procedure ldv_atomic_add_return [2018-02-02 10:23:53,103 INFO L128 BoogieDeclarations]: Found specification of procedure ldv_atomic_sub_return [2018-02-02 10:23:53,103 INFO L128 BoogieDeclarations]: Found specification of procedure ldv_kref_sub [2018-02-02 10:23:53,103 INFO L128 BoogieDeclarations]: Found specification of procedure ##fun~$Pointer$~TO~VOID [2018-02-02 10:23:53,103 INFO L128 BoogieDeclarations]: Found specification of procedure ldv_kref_init [2018-02-02 10:23:53,103 INFO L128 BoogieDeclarations]: Found specification of procedure ldv_kref_get [2018-02-02 10:23:53,103 INFO L128 BoogieDeclarations]: Found specification of procedure ldv_kref_put [2018-02-02 10:23:53,103 INFO L128 BoogieDeclarations]: Found specification of procedure ldv_kobject_cleanup [2018-02-02 10:23:53,103 INFO L128 BoogieDeclarations]: Found specification of procedure ldv_kobject_release [2018-02-02 10:23:53,103 INFO L128 BoogieDeclarations]: Found specification of procedure ldv_kobject_put [2018-02-02 10:23:53,103 INFO L128 BoogieDeclarations]: Found specification of procedure ldv_kobject_get [2018-02-02 10:23:53,103 INFO L128 BoogieDeclarations]: Found specification of procedure ldv_kobject_init_internal [2018-02-02 10:23:53,103 INFO L128 BoogieDeclarations]: Found specification of procedure ldv_kobject_init [2018-02-02 10:23:53,103 INFO L128 BoogieDeclarations]: Found specification of procedure ldv_kobject_create [2018-02-02 10:23:53,103 INFO L128 BoogieDeclarations]: Found specification of procedure f_22_get [2018-02-02 10:23:53,104 INFO L128 BoogieDeclarations]: Found specification of procedure f_22_put [2018-02-02 10:23:53,104 INFO L128 BoogieDeclarations]: Found specification of procedure entry_point [2018-02-02 10:23:53,104 INFO L128 BoogieDeclarations]: Found specification of procedure main [2018-02-02 10:23:53,104 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-02-02 10:23:53,104 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-02-02 10:23:53,285 WARN L455 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2018-02-02 10:23:53,424 INFO L257 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-02-02 10:23:53,425 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 02.02 10:23:53 BoogieIcfgContainer [2018-02-02 10:23:53,425 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-02-02 10:23:53,426 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-02-02 10:23:53,426 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-02-02 10:23:53,428 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-02-02 10:23:53,428 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 02.02 10:23:52" (1/3) ... [2018-02-02 10:23:53,429 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2042251e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 02.02 10:23:53, skipping insertion in model container [2018-02-02 10:23:53,429 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.02 10:23:53" (2/3) ... [2018-02-02 10:23:53,429 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2042251e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 02.02 10:23:53, skipping insertion in model container [2018-02-02 10:23:53,429 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 02.02 10:23:53" (3/3) ... [2018-02-02 10:23:53,430 INFO L107 eAbstractionObserver]: Analyzing ICFG memleaks_test22_3_true-valid-memsafety_true-termination.i [2018-02-02 10:23:53,435 INFO L128 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:Craig_TreeInterpolation Determinization: PREDICATE_ABSTRACTION [2018-02-02 10:23:53,441 INFO L140 ceAbstractionStarter]: Appying trace abstraction to program that has 23 error locations. [2018-02-02 10:23:53,472 INFO L322 AbstractCegarLoop]: Interprodecural is true [2018-02-02 10:23:53,472 INFO L323 AbstractCegarLoop]: Hoare is false [2018-02-02 10:23:53,473 INFO L324 AbstractCegarLoop]: Compute interpolants for Craig_TreeInterpolation [2018-02-02 10:23:53,473 INFO L325 AbstractCegarLoop]: Backedges is CANONICAL [2018-02-02 10:23:53,473 INFO L326 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-02-02 10:23:53,473 INFO L327 AbstractCegarLoop]: Difference is false [2018-02-02 10:23:53,473 INFO L328 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-02-02 10:23:53,473 INFO L333 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-02-02 10:23:53,474 INFO L87 2NestedWordAutomaton]: Mode: main mode - execution starts in main procedure [2018-02-02 10:23:53,486 INFO L276 IsEmpty]: Start isEmpty. Operand 151 states. [2018-02-02 10:23:53,494 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2018-02-02 10:23:53,494 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 10:23:53,495 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:53,495 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:53,499 INFO L82 PathProgramCache]: Analyzing trace with hash 1245228870, now seen corresponding path program 1 times [2018-02-02 10:23:53,544 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 10:23:53,570 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 10:23:53,576 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:53,668 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:53,670 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-02 10:23:53,670 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-02-02 10:23:53,671 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 10:23:53,672 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:53,672 INFO L182 omatonBuilderFactory]: Interpolants [154#true, 155#false, 156#(and (= 0 |ldv_malloc_#res.offset|) (= 0 |ldv_malloc_#res.base|)), 157#(and (= 0 |ldv_kobject_create_#t~ret17.base|) (= 0 |ldv_kobject_create_#t~ret17.offset|)), 158#(and (= ldv_kobject_create_~kobj~1.offset 0) (= ldv_kobject_create_~kobj~1.base 0))] [2018-02-02 10:23:53,672 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:53,673 INFO L409 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-02-02 10:23:53,733 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-02-02 10:23:53,734 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-02-02 10:23:53,736 INFO L87 Difference]: Start difference. First operand 151 states. Second operand 5 states. [2018-02-02 10:23:53,772 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 10:23:53,773 INFO L93 Difference]: Finished difference Result 157 states and 166 transitions. [2018-02-02 10:23:53,773 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-02-02 10:23:53,774 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 17 [2018-02-02 10:23:53,774 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 10:23:53,785 INFO L225 Difference]: With dead ends: 157 [2018-02-02 10:23:53,786 INFO L226 Difference]: Without dead ends: 154 [2018-02-02 10:23:53,787 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:53,797 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 154 states. [2018-02-02 10:23:53,812 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 154 to 152. [2018-02-02 10:23:53,813 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 152 states. [2018-02-02 10:23:53,815 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 152 states to 152 states and 161 transitions. [2018-02-02 10:23:53,816 INFO L78 Accepts]: Start accepts. Automaton has 152 states and 161 transitions. Word has length 17 [2018-02-02 10:23:53,816 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 10:23:53,816 INFO L432 AbstractCegarLoop]: Abstraction has 152 states and 161 transitions. [2018-02-02 10:23:53,816 INFO L433 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-02-02 10:23:53,816 INFO L276 IsEmpty]: Start isEmpty. Operand 152 states and 161 transitions. [2018-02-02 10:23:53,816 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2018-02-02 10:23:53,816 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 10:23:53,816 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:53,817 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:53,817 INFO L82 PathProgramCache]: Analyzing trace with hash -1572748952, now seen corresponding path program 1 times [2018-02-02 10:23:53,818 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 10:23:53,831 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 10:23:53,832 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:53,875 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:53,875 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-02 10:23:53,875 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-02-02 10:23:53,875 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 10:23:53,876 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:53,876 INFO L182 omatonBuilderFactory]: Interpolants [468#true, 469#false, 470#(= 1 (select |#valid| |ldv_malloc_#t~malloc4.base|)), 471#(= 1 (select |#valid| |ldv_malloc_#res.base|)), 472#(= 1 (select |#valid| |ldv_kobject_create_#t~ret17.base|)), 473#(= 1 (select |#valid| ldv_kobject_create_~kobj~1.base))] [2018-02-02 10:23:53,876 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:53,878 INFO L409 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-02-02 10:23:53,878 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-02-02 10:23:53,878 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-02-02 10:23:53,878 INFO L87 Difference]: Start difference. First operand 152 states and 161 transitions. Second operand 6 states. [2018-02-02 10:23:54,031 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 10:23:54,031 INFO L93 Difference]: Finished difference Result 153 states and 162 transitions. [2018-02-02 10:23:54,031 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-02-02 10:23:54,031 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 19 [2018-02-02 10:23:54,031 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 10:23:54,033 INFO L225 Difference]: With dead ends: 153 [2018-02-02 10:23:54,033 INFO L226 Difference]: Without dead ends: 153 [2018-02-02 10:23:54,033 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:54,034 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 153 states. [2018-02-02 10:23:54,041 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 153 to 151. [2018-02-02 10:23:54,041 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 151 states. [2018-02-02 10:23:54,043 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 151 states to 151 states and 160 transitions. [2018-02-02 10:23:54,043 INFO L78 Accepts]: Start accepts. Automaton has 151 states and 160 transitions. Word has length 19 [2018-02-02 10:23:54,043 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 10:23:54,044 INFO L432 AbstractCegarLoop]: Abstraction has 151 states and 160 transitions. [2018-02-02 10:23:54,044 INFO L433 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-02-02 10:23:54,044 INFO L276 IsEmpty]: Start isEmpty. Operand 151 states and 160 transitions. [2018-02-02 10:23:54,044 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2018-02-02 10:23:54,044 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 10:23:54,044 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:54,045 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:54,045 INFO L82 PathProgramCache]: Analyzing trace with hash -1572748951, now seen corresponding path program 1 times [2018-02-02 10:23:54,046 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 10:23:54,066 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 10:23:54,067 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:54,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:54,220 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-02 10:23:54,220 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-02-02 10:23:54,220 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 10:23:54,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:54,221 INFO L182 omatonBuilderFactory]: Interpolants [784#(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|))), 785#(and (<= 16 (select |#length| |ldv_kobject_create_#t~ret17.base|)) (= 0 |ldv_kobject_create_#t~ret17.offset|)), 786#(and (= ldv_kobject_create_~kobj~1.offset 0) (<= 16 (select |#length| ldv_kobject_create_~kobj~1.base))), 780#true, 781#false, 782#(and (or (< 0 (+ (div ldv_malloc_~size 4294967296) 1)) (<= |ldv_malloc_#in~size| ldv_malloc_~size)) (or (<= (+ (div ldv_malloc_~size 4294967296) 1) 0) (and (<= ldv_malloc_~size |ldv_malloc_#in~size|) (or (< 0 (div ldv_malloc_~size 4294967296)) (<= |ldv_malloc_#in~size| ldv_malloc_~size))))), 783#(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|)))] [2018-02-02 10:23:54,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:54,221 INFO L409 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-02-02 10:23:54,222 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-02-02 10:23:54,222 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2018-02-02 10:23:54,222 INFO L87 Difference]: Start difference. First operand 151 states and 160 transitions. Second operand 7 states. [2018-02-02 10:23:54,430 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 10:23:54,430 INFO L93 Difference]: Finished difference Result 152 states and 161 transitions. [2018-02-02 10:23:54,433 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-02-02 10:23:54,433 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 19 [2018-02-02 10:23:54,434 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 10:23:54,435 INFO L225 Difference]: With dead ends: 152 [2018-02-02 10:23:54,435 INFO L226 Difference]: Without dead ends: 152 [2018-02-02 10:23:54,436 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:54,436 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 152 states. [2018-02-02 10:23:54,442 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 152 to 150. [2018-02-02 10:23:54,442 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 150 states. [2018-02-02 10:23:54,444 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 150 states to 150 states and 159 transitions. [2018-02-02 10:23:54,444 INFO L78 Accepts]: Start accepts. Automaton has 150 states and 159 transitions. Word has length 19 [2018-02-02 10:23:54,444 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 10:23:54,444 INFO L432 AbstractCegarLoop]: Abstraction has 150 states and 159 transitions. [2018-02-02 10:23:54,444 INFO L433 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-02-02 10:23:54,445 INFO L276 IsEmpty]: Start isEmpty. Operand 150 states and 159 transitions. [2018-02-02 10:23:54,445 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2018-02-02 10:23:54,445 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 10:23:54,445 INFO L351 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-02 10:23:54,445 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:54,446 INFO L82 PathProgramCache]: Analyzing trace with hash -336004596, now seen corresponding path program 1 times [2018-02-02 10:23:54,447 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 10:23:54,460 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 10:23:54,461 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:54,534 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:54,535 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-02 10:23:54,535 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2018-02-02 10:23:54,535 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 10:23:54,535 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 10:23:54,536 INFO L182 omatonBuilderFactory]: Interpolants [1093#true, 1094#false, 1095#(and (= 0 |ldv_kobject_create_#res.base|) (= 0 |ldv_kobject_create_#res.offset|)), 1096#(and (= 0 |entry_point_#t~ret20.base|) (= 0 |entry_point_#t~ret20.offset|)), 1097#(and (= 0 entry_point_~kobj~2.base) (= 0 entry_point_~kobj~2.offset)), 1098#(and (= 0 |f_22_get_#in~kobj.offset|) (= 0 |f_22_get_#in~kobj.base|)), 1099#(and (= 0 f_22_get_~kobj.offset) (= 0 f_22_get_~kobj.base)), 1100#(and (= 0 |ldv_kobject_get_#in~kobj.base|) (= 0 |ldv_kobject_get_#in~kobj.offset|)), 1101#(and (= 0 ldv_kobject_get_~kobj.offset) (= ldv_kobject_get_~kobj.base 0))] [2018-02-02 10:23:54,536 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:54,536 INFO L409 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-02-02 10:23:54,536 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-02-02 10:23:54,536 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2018-02-02 10:23:54,537 INFO L87 Difference]: Start difference. First operand 150 states and 159 transitions. Second operand 9 states. [2018-02-02 10:23:54,601 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 10:23:54,601 INFO L93 Difference]: Finished difference Result 171 states and 182 transitions. [2018-02-02 10:23:54,601 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-02-02 10:23:54,601 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 29 [2018-02-02 10:23:54,601 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 10:23:54,602 INFO L225 Difference]: With dead ends: 171 [2018-02-02 10:23:54,602 INFO L226 Difference]: Without dead ends: 171 [2018-02-02 10:23:54,603 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=23, Invalid=87, Unknown=0, NotChecked=0, Total=110 [2018-02-02 10:23:54,603 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 171 states. [2018-02-02 10:23:54,612 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 171 to 164. [2018-02-02 10:23:54,612 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 164 states. [2018-02-02 10:23:54,614 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 164 states to 164 states and 173 transitions. [2018-02-02 10:23:54,614 INFO L78 Accepts]: Start accepts. Automaton has 164 states and 173 transitions. Word has length 29 [2018-02-02 10:23:54,614 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 10:23:54,614 INFO L432 AbstractCegarLoop]: Abstraction has 164 states and 173 transitions. [2018-02-02 10:23:54,614 INFO L433 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-02-02 10:23:54,615 INFO L276 IsEmpty]: Start isEmpty. Operand 164 states and 173 transitions. [2018-02-02 10:23:54,615 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2018-02-02 10:23:54,615 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 10:23:54,616 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:54,616 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:54,616 INFO L82 PathProgramCache]: Analyzing trace with hash 610577100, now seen corresponding path program 1 times [2018-02-02 10:23:54,617 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 10:23:54,630 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 10:23:54,631 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:54,700 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:54,700 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-02 10:23:54,701 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2018-02-02 10:23:54,701 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 10:23:54,701 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:54,701 INFO L182 omatonBuilderFactory]: Interpolants [1441#true, 1442#false, 1443#(= 1 (select |#valid| |#Ultimate.C_memset_#ptr.base|)), 1444#(= 1 (select |#valid| ldv_kobject_create_~kobj~1.base)), 1445#(= 1 (select |#valid| |ldv_kobject_init_#in~kobj.base|)), 1446#(= 1 (select |#valid| ldv_kobject_init_~kobj.base)), 1447#(= 1 (select |#valid| |ldv_kobject_init_internal_#in~kobj.base|)), 1448#(= 1 (select |#valid| ldv_kobject_init_internal_~kobj.base)), 1449#(= 1 (select |#valid| |ldv_kref_init_#in~kref.base|)), 1450#(= 1 (select |#valid| ldv_kref_init_~kref.base))] [2018-02-02 10:23:54,702 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:54,702 INFO L409 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-02-02 10:23:54,702 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-02-02 10:23:54,702 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=73, Unknown=0, NotChecked=0, Total=90 [2018-02-02 10:23:54,702 INFO L87 Difference]: Start difference. First operand 164 states and 173 transitions. Second operand 10 states. [2018-02-02 10:23:54,891 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 10:23:54,891 INFO L93 Difference]: Finished difference Result 163 states and 172 transitions. [2018-02-02 10:23:54,891 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-02-02 10:23:54,891 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 34 [2018-02-02 10:23:54,892 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 10:23:54,893 INFO L225 Difference]: With dead ends: 163 [2018-02-02 10:23:54,893 INFO L226 Difference]: Without dead ends: 163 [2018-02-02 10:23:54,893 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:54,894 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 163 states. [2018-02-02 10:23:54,898 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 163 to 163. [2018-02-02 10:23:54,898 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 163 states. [2018-02-02 10:23:54,900 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 163 states to 163 states and 172 transitions. [2018-02-02 10:23:54,900 INFO L78 Accepts]: Start accepts. Automaton has 163 states and 172 transitions. Word has length 34 [2018-02-02 10:23:54,900 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 10:23:54,900 INFO L432 AbstractCegarLoop]: Abstraction has 163 states and 172 transitions. [2018-02-02 10:23:54,900 INFO L433 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-02-02 10:23:54,900 INFO L276 IsEmpty]: Start isEmpty. Operand 163 states and 172 transitions. [2018-02-02 10:23:54,901 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2018-02-02 10:23:54,901 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 10:23:54,901 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:54,902 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:54,902 INFO L82 PathProgramCache]: Analyzing trace with hash 610577101, now seen corresponding path program 1 times [2018-02-02 10:23:54,903 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 10:23:54,913 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 10:23:54,914 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:54,949 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:54,949 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-02 10:23:54,949 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-02-02 10:23:54,949 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 10:23:54,949 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:54,949 INFO L182 omatonBuilderFactory]: Interpolants [1783#true, 1784#false, 1785#(= |#Ultimate.C_memset_#t~loopctr21| 0), 1786#(<= |#Ultimate.C_memset_#amount| 0)] [2018-02-02 10:23:54,949 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:54,950 INFO L409 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-02-02 10:23:54,950 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-02-02 10:23:54,950 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-02-02 10:23:54,950 INFO L87 Difference]: Start difference. First operand 163 states and 172 transitions. Second operand 4 states. [2018-02-02 10:23:54,961 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 10:23:54,961 INFO L93 Difference]: Finished difference Result 166 states and 175 transitions. [2018-02-02 10:23:54,961 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-02-02 10:23:54,961 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 34 [2018-02-02 10:23:54,961 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 10:23:54,962 INFO L225 Difference]: With dead ends: 166 [2018-02-02 10:23:54,962 INFO L226 Difference]: Without dead ends: 164 [2018-02-02 10:23:54,962 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:54,962 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 164 states. [2018-02-02 10:23:54,965 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 164 to 164. [2018-02-02 10:23:54,965 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 164 states. [2018-02-02 10:23:54,966 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 164 states to 164 states and 173 transitions. [2018-02-02 10:23:54,966 INFO L78 Accepts]: Start accepts. Automaton has 164 states and 173 transitions. Word has length 34 [2018-02-02 10:23:54,966 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 10:23:54,966 INFO L432 AbstractCegarLoop]: Abstraction has 164 states and 173 transitions. [2018-02-02 10:23:54,967 INFO L433 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-02-02 10:23:54,967 INFO L276 IsEmpty]: Start isEmpty. Operand 164 states and 173 transitions. [2018-02-02 10:23:54,967 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2018-02-02 10:23:54,967 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 10:23:54,967 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:54,967 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:54,967 INFO L82 PathProgramCache]: Analyzing trace with hash -838244594, now seen corresponding path program 1 times [2018-02-02 10:23:54,968 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 10:23:54,978 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 10:23:54,979 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:55,019 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:55,020 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-02 10:23:55,020 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5] total 5 [2018-02-02 10:23:55,020 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 10:23:55,020 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:55,020 INFO L182 omatonBuilderFactory]: Interpolants [2119#true, 2120#false, 2121#(= |#Ultimate.C_memset_#t~loopctr21| 0), 2122#(<= |#Ultimate.C_memset_#t~loopctr21| 1), 2123#(<= |#Ultimate.C_memset_#amount| 1)] [2018-02-02 10:23:55,021 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:55,021 INFO L409 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-02-02 10:23:55,021 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-02-02 10:23:55,021 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2018-02-02 10:23:55,021 INFO L87 Difference]: Start difference. First operand 164 states and 173 transitions. Second operand 5 states. [2018-02-02 10:23:55,039 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 10:23:55,039 INFO L93 Difference]: Finished difference Result 167 states and 176 transitions. [2018-02-02 10:23:55,039 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-02-02 10:23:55,040 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 35 [2018-02-02 10:23:55,040 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 10:23:55,041 INFO L225 Difference]: With dead ends: 167 [2018-02-02 10:23:55,041 INFO L226 Difference]: Without dead ends: 165 [2018-02-02 10:23:55,041 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:55,042 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 165 states. [2018-02-02 10:23:55,045 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 165 to 165. [2018-02-02 10:23:55,045 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 165 states. [2018-02-02 10:23:55,046 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 165 states to 165 states and 174 transitions. [2018-02-02 10:23:55,046 INFO L78 Accepts]: Start accepts. Automaton has 165 states and 174 transitions. Word has length 35 [2018-02-02 10:23:55,047 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 10:23:55,047 INFO L432 AbstractCegarLoop]: Abstraction has 165 states and 174 transitions. [2018-02-02 10:23:55,047 INFO L433 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-02-02 10:23:55,047 INFO L276 IsEmpty]: Start isEmpty. Operand 165 states and 174 transitions. [2018-02-02 10:23:55,048 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2018-02-02 10:23:55,048 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 10:23:55,048 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:55,048 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:55,048 INFO L82 PathProgramCache]: Analyzing trace with hash 1492923117, now seen corresponding path program 2 times [2018-02-02 10:23:55,049 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 10:23:55,060 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 10:23:55,060 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:55,088 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:55,088 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-02 10:23:55,089 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6] total 6 [2018-02-02 10:23:55,089 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 10:23:55,089 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:55,089 INFO L182 omatonBuilderFactory]: Interpolants [2458#true, 2459#false, 2460#(= |#Ultimate.C_memset_#t~loopctr21| 0), 2461#(<= |#Ultimate.C_memset_#t~loopctr21| 1), 2462#(<= |#Ultimate.C_memset_#t~loopctr21| 2), 2463#(<= |#Ultimate.C_memset_#amount| 2)] [2018-02-02 10:23:55,089 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:55,089 INFO L409 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-02-02 10:23:55,090 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-02-02 10:23:55,090 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2018-02-02 10:23:55,090 INFO L87 Difference]: Start difference. First operand 165 states and 174 transitions. Second operand 6 states. [2018-02-02 10:23:55,102 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 10:23:55,103 INFO L93 Difference]: Finished difference Result 168 states and 177 transitions. [2018-02-02 10:23:55,107 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-02-02 10:23:55,107 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 36 [2018-02-02 10:23:55,107 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 10:23:55,107 INFO L225 Difference]: With dead ends: 168 [2018-02-02 10:23:55,108 INFO L226 Difference]: Without dead ends: 166 [2018-02-02 10:23:55,108 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:55,108 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 166 states. [2018-02-02 10:23:55,111 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 166 to 166. [2018-02-02 10:23:55,111 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 166 states. [2018-02-02 10:23:55,111 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 166 states to 166 states and 175 transitions. [2018-02-02 10:23:55,112 INFO L78 Accepts]: Start accepts. Automaton has 166 states and 175 transitions. Word has length 36 [2018-02-02 10:23:55,112 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 10:23:55,112 INFO L432 AbstractCegarLoop]: Abstraction has 166 states and 175 transitions. [2018-02-02 10:23:55,112 INFO L433 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-02-02 10:23:55,112 INFO L276 IsEmpty]: Start isEmpty. Operand 166 states and 175 transitions. [2018-02-02 10:23:55,113 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2018-02-02 10:23:55,113 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 10:23:55,113 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:55,113 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:55,113 INFO L82 PathProgramCache]: Analyzing trace with hash 744678126, now seen corresponding path program 3 times [2018-02-02 10:23:55,114 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 10:23:55,126 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 10:23:55,127 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:55,159 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:55,160 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-02 10:23:55,160 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7] total 7 [2018-02-02 10:23:55,160 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 10:23:55,160 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:55,160 INFO L182 omatonBuilderFactory]: Interpolants [2800#true, 2801#false, 2802#(= |#Ultimate.C_memset_#t~loopctr21| 0), 2803#(<= |#Ultimate.C_memset_#t~loopctr21| 1), 2804#(<= |#Ultimate.C_memset_#t~loopctr21| 2), 2805#(<= |#Ultimate.C_memset_#t~loopctr21| 3), 2806#(<= |#Ultimate.C_memset_#amount| 3)] [2018-02-02 10:23:55,160 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:55,160 INFO L409 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-02-02 10:23:55,161 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-02-02 10:23:55,161 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2018-02-02 10:23:55,161 INFO L87 Difference]: Start difference. First operand 166 states and 175 transitions. Second operand 7 states. [2018-02-02 10:23:55,178 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 10:23:55,178 INFO L93 Difference]: Finished difference Result 169 states and 178 transitions. [2018-02-02 10:23:55,178 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-02-02 10:23:55,179 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 37 [2018-02-02 10:23:55,179 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 10:23:55,180 INFO L225 Difference]: With dead ends: 169 [2018-02-02 10:23:55,180 INFO L226 Difference]: Without dead ends: 167 [2018-02-02 10:23:55,180 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:55,180 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 167 states. [2018-02-02 10:23:55,183 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 167 to 167. [2018-02-02 10:23:55,183 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 167 states. [2018-02-02 10:23:55,184 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 167 states to 167 states and 176 transitions. [2018-02-02 10:23:55,184 INFO L78 Accepts]: Start accepts. Automaton has 167 states and 176 transitions. Word has length 37 [2018-02-02 10:23:55,184 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 10:23:55,184 INFO L432 AbstractCegarLoop]: Abstraction has 167 states and 176 transitions. [2018-02-02 10:23:55,184 INFO L433 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-02-02 10:23:55,185 INFO L276 IsEmpty]: Start isEmpty. Operand 167 states and 176 transitions. [2018-02-02 10:23:55,185 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2018-02-02 10:23:55,185 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 10:23:55,186 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:55,186 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:55,186 INFO L82 PathProgramCache]: Analyzing trace with hash -976080115, now seen corresponding path program 4 times [2018-02-02 10:23:55,190 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 10:23:55,202 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 10:23:55,202 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:55,244 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:55,244 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-02 10:23:55,244 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8] total 8 [2018-02-02 10:23:55,244 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 10:23:55,245 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 10:23:55,245 INFO L182 omatonBuilderFactory]: Interpolants [3152#(<= |#Ultimate.C_memset_#amount| 4), 3145#true, 3146#false, 3147#(= |#Ultimate.C_memset_#t~loopctr21| 0), 3148#(<= |#Ultimate.C_memset_#t~loopctr21| 1), 3149#(<= |#Ultimate.C_memset_#t~loopctr21| 2), 3150#(<= |#Ultimate.C_memset_#t~loopctr21| 3), 3151#(<= |#Ultimate.C_memset_#t~loopctr21| 4)] [2018-02-02 10:23:55,245 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:55,245 INFO L409 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-02-02 10:23:55,245 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-02-02 10:23:55,246 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2018-02-02 10:23:55,246 INFO L87 Difference]: Start difference. First operand 167 states and 176 transitions. Second operand 8 states. [2018-02-02 10:23:55,277 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 10:23:55,277 INFO L93 Difference]: Finished difference Result 170 states and 179 transitions. [2018-02-02 10:23:55,278 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-02-02 10:23:55,278 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 38 [2018-02-02 10:23:55,278 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 10:23:55,279 INFO L225 Difference]: With dead ends: 170 [2018-02-02 10:23:55,279 INFO L226 Difference]: Without dead ends: 168 [2018-02-02 10:23:55,279 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:55,280 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 168 states. [2018-02-02 10:23:55,283 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 168 to 168. [2018-02-02 10:23:55,283 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 168 states. [2018-02-02 10:23:55,283 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 168 states to 168 states and 177 transitions. [2018-02-02 10:23:55,284 INFO L78 Accepts]: Start accepts. Automaton has 168 states and 177 transitions. Word has length 38 [2018-02-02 10:23:55,284 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 10:23:55,284 INFO L432 AbstractCegarLoop]: Abstraction has 168 states and 177 transitions. [2018-02-02 10:23:55,284 INFO L433 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-02-02 10:23:55,284 INFO L276 IsEmpty]: Start isEmpty. Operand 168 states and 177 transitions. [2018-02-02 10:23:55,285 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2018-02-02 10:23:55,285 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 10:23:55,285 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:55,285 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:55,285 INFO L82 PathProgramCache]: Analyzing trace with hash 1514989262, now seen corresponding path program 5 times [2018-02-02 10:23:55,286 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 10:23:55,297 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 10:23:55,298 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:55,345 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:55,345 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-02 10:23:55,345 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9] total 9 [2018-02-02 10:23:55,345 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 10:23:55,346 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:55,346 INFO L182 omatonBuilderFactory]: Interpolants [3493#true, 3494#false, 3495#(= |#Ultimate.C_memset_#t~loopctr21| 0), 3496#(<= |#Ultimate.C_memset_#t~loopctr21| 1), 3497#(<= |#Ultimate.C_memset_#t~loopctr21| 2), 3498#(<= |#Ultimate.C_memset_#t~loopctr21| 3), 3499#(<= |#Ultimate.C_memset_#t~loopctr21| 4), 3500#(<= |#Ultimate.C_memset_#t~loopctr21| 5), 3501#(<= |#Ultimate.C_memset_#amount| 5)] [2018-02-02 10:23:55,346 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:55,346 INFO L409 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-02-02 10:23:55,346 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-02-02 10:23:55,347 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2018-02-02 10:23:55,347 INFO L87 Difference]: Start difference. First operand 168 states and 177 transitions. Second operand 9 states. [2018-02-02 10:23:55,372 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 10:23:55,373 INFO L93 Difference]: Finished difference Result 171 states and 180 transitions. [2018-02-02 10:23:55,373 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-02-02 10:23:55,373 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 39 [2018-02-02 10:23:55,373 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 10:23:55,374 INFO L225 Difference]: With dead ends: 171 [2018-02-02 10:23:55,374 INFO L226 Difference]: Without dead ends: 169 [2018-02-02 10:23:55,375 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:55,375 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 169 states. [2018-02-02 10:23:55,378 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 169 to 169. [2018-02-02 10:23:55,378 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 169 states. [2018-02-02 10:23:55,379 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 169 states to 169 states and 178 transitions. [2018-02-02 10:23:55,379 INFO L78 Accepts]: Start accepts. Automaton has 169 states and 178 transitions. Word has length 39 [2018-02-02 10:23:55,379 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 10:23:55,380 INFO L432 AbstractCegarLoop]: Abstraction has 169 states and 178 transitions. [2018-02-02 10:23:55,380 INFO L433 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-02-02 10:23:55,380 INFO L276 IsEmpty]: Start isEmpty. Operand 169 states and 178 transitions. [2018-02-02 10:23:55,380 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2018-02-02 10:23:55,380 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 10:23:55,381 INFO L351 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-02 10:23:55,381 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:55,381 INFO L82 PathProgramCache]: Analyzing trace with hash 278126369, now seen corresponding path program 1 times [2018-02-02 10:23:55,382 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 10:23:55,391 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 10:23:55,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:55,463 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:55,463 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-02 10:23:55,463 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2018-02-02 10:23:55,463 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 10:23:55,464 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:55,464 INFO L182 omatonBuilderFactory]: Interpolants [3844#true, 3845#false, 3846#(and (= 0 |ldv_kobject_create_#res.base|) (= 0 |ldv_kobject_create_#res.offset|)), 3847#(and (= 0 |entry_point_#t~ret20.base|) (= 0 |entry_point_#t~ret20.offset|)), 3848#(and (= 0 entry_point_~kobj~2.base) (= 0 entry_point_~kobj~2.offset)), 3849#(and (= 0 |f_22_put_#in~kobj.offset|) (= 0 |f_22_put_#in~kobj.base|)), 3850#(and (= 0 f_22_put_~kobj.base) (= 0 f_22_put_~kobj.offset)), 3851#(and (= 0 |ldv_kobject_put_#in~kobj.offset|) (= 0 |ldv_kobject_put_#in~kobj.base|)), 3852#(and (= ldv_kobject_put_~kobj.offset 0) (= 0 ldv_kobject_put_~kobj.base))] [2018-02-02 10:23:55,464 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:55,464 INFO L409 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-02-02 10:23:55,464 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-02-02 10:23:55,465 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2018-02-02 10:23:55,465 INFO L87 Difference]: Start difference. First operand 169 states and 178 transitions. Second operand 9 states. [2018-02-02 10:23:55,530 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 10:23:55,530 INFO L93 Difference]: Finished difference Result 183 states and 194 transitions. [2018-02-02 10:23:55,531 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-02-02 10:23:55,531 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 42 [2018-02-02 10:23:55,531 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 10:23:55,532 INFO L225 Difference]: With dead ends: 183 [2018-02-02 10:23:55,532 INFO L226 Difference]: Without dead ends: 183 [2018-02-02 10:23:55,533 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=23, Invalid=87, Unknown=0, NotChecked=0, Total=110 [2018-02-02 10:23:55,533 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 183 states. [2018-02-02 10:23:55,536 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 183 to 179. [2018-02-02 10:23:55,537 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 179 states. [2018-02-02 10:23:55,537 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 179 states to 179 states and 189 transitions. [2018-02-02 10:23:55,537 INFO L78 Accepts]: Start accepts. Automaton has 179 states and 189 transitions. Word has length 42 [2018-02-02 10:23:55,538 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 10:23:55,538 INFO L432 AbstractCegarLoop]: Abstraction has 179 states and 189 transitions. [2018-02-02 10:23:55,538 INFO L433 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-02-02 10:23:55,538 INFO L276 IsEmpty]: Start isEmpty. Operand 179 states and 189 transitions. [2018-02-02 10:23:55,539 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2018-02-02 10:23:55,539 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 10:23:55,539 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:55,539 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:55,539 INFO L82 PathProgramCache]: Analyzing trace with hash 1428728621, now seen corresponding path program 6 times [2018-02-02 10:23:55,540 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 10:23:55,564 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 10:23:55,565 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:55,621 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:55,621 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-02 10:23:55,621 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10] total 10 [2018-02-02 10:23:55,621 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 10:23:55,622 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 10:23:55,622 INFO L182 omatonBuilderFactory]: Interpolants [4224#(<= |#Ultimate.C_memset_#t~loopctr21| 3), 4225#(<= |#Ultimate.C_memset_#t~loopctr21| 4), 4226#(<= |#Ultimate.C_memset_#t~loopctr21| 5), 4227#(<= |#Ultimate.C_memset_#t~loopctr21| 6), 4228#(<= |#Ultimate.C_memset_#amount| 6), 4219#true, 4220#false, 4221#(= |#Ultimate.C_memset_#t~loopctr21| 0), 4222#(<= |#Ultimate.C_memset_#t~loopctr21| 1), 4223#(<= |#Ultimate.C_memset_#t~loopctr21| 2)] [2018-02-02 10:23:55,622 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:55,622 INFO L409 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-02-02 10:23:55,623 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-02-02 10:23:55,623 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2018-02-02 10:23:55,623 INFO L87 Difference]: Start difference. First operand 179 states and 189 transitions. Second operand 10 states. [2018-02-02 10:23:55,656 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 10:23:55,656 INFO L93 Difference]: Finished difference Result 182 states and 192 transitions. [2018-02-02 10:23:55,659 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-02-02 10:23:55,659 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 40 [2018-02-02 10:23:55,659 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 10:23:55,660 INFO L225 Difference]: With dead ends: 182 [2018-02-02 10:23:55,660 INFO L226 Difference]: Without dead ends: 180 [2018-02-02 10:23:55,661 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:55,661 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 180 states. [2018-02-02 10:23:55,665 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 180 to 180. [2018-02-02 10:23:55,665 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 180 states. [2018-02-02 10:23:55,666 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 180 states to 180 states and 190 transitions. [2018-02-02 10:23:55,666 INFO L78 Accepts]: Start accepts. Automaton has 180 states and 190 transitions. Word has length 40 [2018-02-02 10:23:55,666 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 10:23:55,667 INFO L432 AbstractCegarLoop]: Abstraction has 180 states and 190 transitions. [2018-02-02 10:23:55,667 INFO L433 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-02-02 10:23:55,667 INFO L276 IsEmpty]: Start isEmpty. Operand 180 states and 190 transitions. [2018-02-02 10:23:55,667 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2018-02-02 10:23:55,668 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 10:23:55,668 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:55,668 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:55,668 INFO L82 PathProgramCache]: Analyzing trace with hash -1245351250, now seen corresponding path program 7 times [2018-02-02 10:23:55,669 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 10:23:55,681 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 10:23:55,682 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:55,746 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:55,747 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-02 10:23:55,747 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [11] total 11 [2018-02-02 10:23:55,747 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 10:23:55,748 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:55,748 INFO L182 omatonBuilderFactory]: Interpolants [4593#true, 4594#false, 4595#(= |#Ultimate.C_memset_#t~loopctr21| 0), 4596#(<= |#Ultimate.C_memset_#t~loopctr21| 1), 4597#(<= |#Ultimate.C_memset_#t~loopctr21| 2), 4598#(<= |#Ultimate.C_memset_#t~loopctr21| 3), 4599#(<= |#Ultimate.C_memset_#t~loopctr21| 4), 4600#(<= |#Ultimate.C_memset_#t~loopctr21| 5), 4601#(<= |#Ultimate.C_memset_#t~loopctr21| 6), 4602#(<= |#Ultimate.C_memset_#t~loopctr21| 7), 4603#(<= |#Ultimate.C_memset_#amount| 7)] [2018-02-02 10:23:55,748 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:55,748 INFO L409 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-02-02 10:23:55,748 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-02-02 10:23:55,748 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=63, Unknown=0, NotChecked=0, Total=110 [2018-02-02 10:23:55,749 INFO L87 Difference]: Start difference. First operand 180 states and 190 transitions. Second operand 11 states. [2018-02-02 10:23:55,791 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 10:23:55,792 INFO L93 Difference]: Finished difference Result 183 states and 193 transitions. [2018-02-02 10:23:55,793 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-02-02 10:23:55,793 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 41 [2018-02-02 10:23:55,793 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 10:23:55,794 INFO L225 Difference]: With dead ends: 183 [2018-02-02 10:23:55,794 INFO L226 Difference]: Without dead ends: 181 [2018-02-02 10:23:55,794 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:55,795 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 181 states. [2018-02-02 10:23:55,798 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 181 to 181. [2018-02-02 10:23:55,799 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 181 states. [2018-02-02 10:23:55,800 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 181 states to 181 states and 191 transitions. [2018-02-02 10:23:55,800 INFO L78 Accepts]: Start accepts. Automaton has 181 states and 191 transitions. Word has length 41 [2018-02-02 10:23:55,800 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 10:23:55,800 INFO L432 AbstractCegarLoop]: Abstraction has 181 states and 191 transitions. [2018-02-02 10:23:55,800 INFO L433 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-02-02 10:23:55,800 INFO L276 IsEmpty]: Start isEmpty. Operand 181 states and 191 transitions. [2018-02-02 10:23:55,801 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2018-02-02 10:23:55,801 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 10:23:55,801 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:55,801 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:55,802 INFO L82 PathProgramCache]: Analyzing trace with hash 1757518669, now seen corresponding path program 8 times [2018-02-02 10:23:55,802 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 10:23:55,812 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 10:23:55,814 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:55,924 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:55,924 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-02 10:23:55,924 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [12] total 12 [2018-02-02 10:23:55,924 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 10:23:55,925 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:55,925 INFO L182 omatonBuilderFactory]: Interpolants [4976#(<= |#Ultimate.C_memset_#t~loopctr21| 4), 4977#(<= |#Ultimate.C_memset_#t~loopctr21| 5), 4978#(<= |#Ultimate.C_memset_#t~loopctr21| 6), 4979#(<= |#Ultimate.C_memset_#t~loopctr21| 7), 4980#(<= |#Ultimate.C_memset_#t~loopctr21| 8), 4981#(<= |#Ultimate.C_memset_#amount| 8), 4970#true, 4971#false, 4972#(= |#Ultimate.C_memset_#t~loopctr21| 0), 4973#(<= |#Ultimate.C_memset_#t~loopctr21| 1), 4974#(<= |#Ultimate.C_memset_#t~loopctr21| 2), 4975#(<= |#Ultimate.C_memset_#t~loopctr21| 3)] [2018-02-02 10:23:55,925 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:55,925 INFO L409 AbstractCegarLoop]: Interpolant automaton has 12 states [2018-02-02 10:23:55,925 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2018-02-02 10:23:55,926 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=75, Unknown=0, NotChecked=0, Total=132 [2018-02-02 10:23:55,926 INFO L87 Difference]: Start difference. First operand 181 states and 191 transitions. Second operand 12 states. [2018-02-02 10:23:55,960 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 10:23:55,960 INFO L93 Difference]: Finished difference Result 184 states and 194 transitions. [2018-02-02 10:23:55,961 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-02-02 10:23:55,961 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 42 [2018-02-02 10:23:55,961 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 10:23:55,962 INFO L225 Difference]: With dead ends: 184 [2018-02-02 10:23:55,962 INFO L226 Difference]: Without dead ends: 182 [2018-02-02 10:23:55,963 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:55,963 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 182 states. [2018-02-02 10:23:55,966 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 182 to 182. [2018-02-02 10:23:55,967 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 182 states. [2018-02-02 10:23:55,967 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 182 states to 182 states and 192 transitions. [2018-02-02 10:23:55,968 INFO L78 Accepts]: Start accepts. Automaton has 182 states and 192 transitions. Word has length 42 [2018-02-02 10:23:55,968 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 10:23:55,968 INFO L432 AbstractCegarLoop]: Abstraction has 182 states and 192 transitions. [2018-02-02 10:23:55,968 INFO L433 AbstractCegarLoop]: Interpolant automaton has 12 states. [2018-02-02 10:23:55,968 INFO L276 IsEmpty]: Start isEmpty. Operand 182 states and 192 transitions. [2018-02-02 10:23:55,969 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2018-02-02 10:23:55,969 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 10:23:55,969 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:55,969 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:55,969 INFO L82 PathProgramCache]: Analyzing trace with hash 357205646, now seen corresponding path program 9 times [2018-02-02 10:23:55,970 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 10:23:55,987 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 10:23:55,988 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:56,096 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:56,096 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-02 10:23:56,097 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [13] total 13 [2018-02-02 10:23:56,097 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 10:23:56,097 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:56,097 INFO L182 omatonBuilderFactory]: Interpolants [5350#true, 5351#false, 5352#(= |#Ultimate.C_memset_#t~loopctr21| 0), 5353#(<= |#Ultimate.C_memset_#t~loopctr21| 1), 5354#(<= |#Ultimate.C_memset_#t~loopctr21| 2), 5355#(<= |#Ultimate.C_memset_#t~loopctr21| 3), 5356#(<= |#Ultimate.C_memset_#t~loopctr21| 4), 5357#(<= |#Ultimate.C_memset_#t~loopctr21| 5), 5358#(<= |#Ultimate.C_memset_#t~loopctr21| 6), 5359#(<= |#Ultimate.C_memset_#t~loopctr21| 7), 5360#(<= |#Ultimate.C_memset_#t~loopctr21| 8), 5361#(<= |#Ultimate.C_memset_#t~loopctr21| 9), 5362#(<= |#Ultimate.C_memset_#amount| 9)] [2018-02-02 10:23:56,097 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:56,097 INFO L409 AbstractCegarLoop]: Interpolant automaton has 13 states [2018-02-02 10:23:56,097 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2018-02-02 10:23:56,097 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=68, Invalid=88, Unknown=0, NotChecked=0, Total=156 [2018-02-02 10:23:56,097 INFO L87 Difference]: Start difference. First operand 182 states and 192 transitions. Second operand 13 states. [2018-02-02 10:23:56,127 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 10:23:56,128 INFO L93 Difference]: Finished difference Result 185 states and 195 transitions. [2018-02-02 10:23:56,128 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2018-02-02 10:23:56,128 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 43 [2018-02-02 10:23:56,129 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 10:23:56,129 INFO L225 Difference]: With dead ends: 185 [2018-02-02 10:23:56,129 INFO L226 Difference]: Without dead ends: 183 [2018-02-02 10:23:56,130 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:56,130 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 183 states. [2018-02-02 10:23:56,133 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 183 to 183. [2018-02-02 10:23:56,133 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 183 states. [2018-02-02 10:23:56,134 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 183 states to 183 states and 193 transitions. [2018-02-02 10:23:56,134 INFO L78 Accepts]: Start accepts. Automaton has 183 states and 193 transitions. Word has length 43 [2018-02-02 10:23:56,135 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 10:23:56,135 INFO L432 AbstractCegarLoop]: Abstraction has 183 states and 193 transitions. [2018-02-02 10:23:56,135 INFO L433 AbstractCegarLoop]: Interpolant automaton has 13 states. [2018-02-02 10:23:56,135 INFO L276 IsEmpty]: Start isEmpty. Operand 183 states and 193 transitions. [2018-02-02 10:23:56,135 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2018-02-02 10:23:56,135 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 10:23:56,136 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:56,136 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:56,136 INFO L82 PathProgramCache]: Analyzing trace with hash -102825107, now seen corresponding path program 10 times [2018-02-02 10:23:56,137 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 10:23:56,148 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 10:23:56,148 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:56,215 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:56,215 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-02 10:23:56,215 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [14] total 14 [2018-02-02 10:23:56,216 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 10:23:56,216 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:56,216 INFO L182 omatonBuilderFactory]: Interpolants [5733#true, 5734#false, 5735#(= |#Ultimate.C_memset_#t~loopctr21| 0), 5736#(<= |#Ultimate.C_memset_#t~loopctr21| 1), 5737#(<= |#Ultimate.C_memset_#t~loopctr21| 2), 5738#(<= |#Ultimate.C_memset_#t~loopctr21| 3), 5739#(<= |#Ultimate.C_memset_#t~loopctr21| 4), 5740#(<= |#Ultimate.C_memset_#t~loopctr21| 5), 5741#(<= |#Ultimate.C_memset_#t~loopctr21| 6), 5742#(<= |#Ultimate.C_memset_#t~loopctr21| 7), 5743#(<= |#Ultimate.C_memset_#t~loopctr21| 8), 5744#(<= |#Ultimate.C_memset_#t~loopctr21| 9), 5745#(<= |#Ultimate.C_memset_#t~loopctr21| 10), 5746#(<= |#Ultimate.C_memset_#amount| 10)] [2018-02-02 10:23:56,216 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:56,216 INFO L409 AbstractCegarLoop]: Interpolant automaton has 14 states [2018-02-02 10:23:56,216 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2018-02-02 10:23:56,216 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=80, Invalid=102, Unknown=0, NotChecked=0, Total=182 [2018-02-02 10:23:56,216 INFO L87 Difference]: Start difference. First operand 183 states and 193 transitions. Second operand 14 states. [2018-02-02 10:23:56,255 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 10:23:56,255 INFO L93 Difference]: Finished difference Result 186 states and 196 transitions. [2018-02-02 10:23:56,256 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2018-02-02 10:23:56,256 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 44 [2018-02-02 10:23:56,257 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 10:23:56,257 INFO L225 Difference]: With dead ends: 186 [2018-02-02 10:23:56,257 INFO L226 Difference]: Without dead ends: 184 [2018-02-02 10:23:56,257 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=84, Invalid=126, Unknown=0, NotChecked=0, Total=210 [2018-02-02 10:23:56,257 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 184 states. [2018-02-02 10:23:56,260 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 184 to 184. [2018-02-02 10:23:56,260 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 184 states. [2018-02-02 10:23:56,260 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 184 states to 184 states and 194 transitions. [2018-02-02 10:23:56,261 INFO L78 Accepts]: Start accepts. Automaton has 184 states and 194 transitions. Word has length 44 [2018-02-02 10:23:56,261 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 10:23:56,261 INFO L432 AbstractCegarLoop]: Abstraction has 184 states and 194 transitions. [2018-02-02 10:23:56,261 INFO L433 AbstractCegarLoop]: Interpolant automaton has 14 states. [2018-02-02 10:23:56,261 INFO L276 IsEmpty]: Start isEmpty. Operand 184 states and 194 transitions. [2018-02-02 10:23:56,261 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2018-02-02 10:23:56,261 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 10:23:56,261 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:56,261 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:56,262 INFO L82 PathProgramCache]: Analyzing trace with hash -1478876562, now seen corresponding path program 11 times [2018-02-02 10:23:56,262 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 10:23:56,271 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 10:23:56,272 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:56,353 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:56,354 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-02 10:23:56,354 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [15] total 15 [2018-02-02 10:23:56,354 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 10:23:56,354 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:56,354 INFO L182 omatonBuilderFactory]: Interpolants [6119#true, 6120#false, 6121#(= |#Ultimate.C_memset_#t~loopctr21| 0), 6122#(<= |#Ultimate.C_memset_#t~loopctr21| 1), 6123#(<= |#Ultimate.C_memset_#t~loopctr21| 2), 6124#(<= |#Ultimate.C_memset_#t~loopctr21| 3), 6125#(<= |#Ultimate.C_memset_#t~loopctr21| 4), 6126#(<= |#Ultimate.C_memset_#t~loopctr21| 5), 6127#(<= |#Ultimate.C_memset_#t~loopctr21| 6), 6128#(<= |#Ultimate.C_memset_#t~loopctr21| 7), 6129#(<= |#Ultimate.C_memset_#t~loopctr21| 8), 6130#(<= |#Ultimate.C_memset_#t~loopctr21| 9), 6131#(<= |#Ultimate.C_memset_#t~loopctr21| 10), 6132#(<= |#Ultimate.C_memset_#t~loopctr21| 11), 6133#(<= |#Ultimate.C_memset_#amount| 11)] [2018-02-02 10:23:56,355 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:56,355 INFO L409 AbstractCegarLoop]: Interpolant automaton has 15 states [2018-02-02 10:23:56,355 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2018-02-02 10:23:56,355 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=93, Invalid=117, Unknown=0, NotChecked=0, Total=210 [2018-02-02 10:23:56,355 INFO L87 Difference]: Start difference. First operand 184 states and 194 transitions. Second operand 15 states. [2018-02-02 10:23:56,387 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 10:23:56,388 INFO L93 Difference]: Finished difference Result 187 states and 197 transitions. [2018-02-02 10:23:56,388 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2018-02-02 10:23:56,388 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 45 [2018-02-02 10:23:56,388 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 10:23:56,389 INFO L225 Difference]: With dead ends: 187 [2018-02-02 10:23:56,389 INFO L226 Difference]: Without dead ends: 185 [2018-02-02 10:23:56,389 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:56,389 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 185 states. [2018-02-02 10:23:56,392 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 185 to 185. [2018-02-02 10:23:56,392 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 185 states. [2018-02-02 10:23:56,392 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 185 states to 185 states and 195 transitions. [2018-02-02 10:23:56,392 INFO L78 Accepts]: Start accepts. Automaton has 185 states and 195 transitions. Word has length 45 [2018-02-02 10:23:56,393 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 10:23:56,393 INFO L432 AbstractCegarLoop]: Abstraction has 185 states and 195 transitions. [2018-02-02 10:23:56,393 INFO L433 AbstractCegarLoop]: Interpolant automaton has 15 states. [2018-02-02 10:23:56,393 INFO L276 IsEmpty]: Start isEmpty. Operand 185 states and 195 transitions. [2018-02-02 10:23:56,393 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2018-02-02 10:23:56,393 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 10:23:56,393 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:56,393 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:56,393 INFO L82 PathProgramCache]: Analyzing trace with hash -1186798707, now seen corresponding path program 12 times [2018-02-02 10:23:56,395 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 10:23:56,404 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 10:23:56,405 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:56,535 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:56,535 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-02 10:23:56,535 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [16] total 16 [2018-02-02 10:23:56,535 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 10:23:56,535 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 10:23:56,535 INFO L182 omatonBuilderFactory]: Interpolants [6508#true, 6509#false, 6510#(= |#Ultimate.C_memset_#t~loopctr21| 0), 6511#(<= |#Ultimate.C_memset_#t~loopctr21| 1), 6512#(<= |#Ultimate.C_memset_#t~loopctr21| 2), 6513#(<= |#Ultimate.C_memset_#t~loopctr21| 3), 6514#(<= |#Ultimate.C_memset_#t~loopctr21| 4), 6515#(<= |#Ultimate.C_memset_#t~loopctr21| 5), 6516#(<= |#Ultimate.C_memset_#t~loopctr21| 6), 6517#(<= |#Ultimate.C_memset_#t~loopctr21| 7), 6518#(<= |#Ultimate.C_memset_#t~loopctr21| 8), 6519#(<= |#Ultimate.C_memset_#t~loopctr21| 9), 6520#(<= |#Ultimate.C_memset_#t~loopctr21| 10), 6521#(<= |#Ultimate.C_memset_#t~loopctr21| 11), 6522#(<= |#Ultimate.C_memset_#t~loopctr21| 12), 6523#(<= |#Ultimate.C_memset_#amount| 12)] [2018-02-02 10:23:56,535 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:56,536 INFO L409 AbstractCegarLoop]: Interpolant automaton has 16 states [2018-02-02 10:23:56,536 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2018-02-02 10:23:56,536 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=107, Invalid=133, Unknown=0, NotChecked=0, Total=240 [2018-02-02 10:23:56,536 INFO L87 Difference]: Start difference. First operand 185 states and 195 transitions. Second operand 16 states. [2018-02-02 10:23:56,563 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 10:23:56,563 INFO L93 Difference]: Finished difference Result 188 states and 198 transitions. [2018-02-02 10:23:56,563 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2018-02-02 10:23:56,563 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 46 [2018-02-02 10:23:56,563 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 10:23:56,564 INFO L225 Difference]: With dead ends: 188 [2018-02-02 10:23:56,564 INFO L226 Difference]: Without dead ends: 186 [2018-02-02 10:23:56,564 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:56,565 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 186 states. [2018-02-02 10:23:56,566 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 186 to 186. [2018-02-02 10:23:56,567 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 186 states. [2018-02-02 10:23:56,567 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 186 states to 186 states and 196 transitions. [2018-02-02 10:23:56,567 INFO L78 Accepts]: Start accepts. Automaton has 186 states and 196 transitions. Word has length 46 [2018-02-02 10:23:56,567 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 10:23:56,567 INFO L432 AbstractCegarLoop]: Abstraction has 186 states and 196 transitions. [2018-02-02 10:23:56,567 INFO L433 AbstractCegarLoop]: Interpolant automaton has 16 states. [2018-02-02 10:23:56,567 INFO L276 IsEmpty]: Start isEmpty. Operand 186 states and 196 transitions. [2018-02-02 10:23:56,568 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2018-02-02 10:23:56,568 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 10:23:56,568 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, 1, 1, 1, 1, 1, 1] [2018-02-02 10:23:56,568 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:56,568 INFO L82 PathProgramCache]: Analyzing trace with hash 689381786, now seen corresponding path program 1 times [2018-02-02 10:23:56,569 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 10:23:56,572 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 10:23:56,573 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:56,593 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:56,593 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-02 10:23:56,593 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-02-02 10:23:56,593 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 10:23:56,593 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:56,593 INFO L182 omatonBuilderFactory]: Interpolants [6900#true, 6901#false, 6902#(= |#valid| |old(#valid)|)] [2018-02-02 10:23:56,593 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:56,594 INFO L409 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-02-02 10:23:56,594 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-02-02 10:23:56,594 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-02-02 10:23:56,594 INFO L87 Difference]: Start difference. First operand 186 states and 196 transitions. Second operand 3 states. [2018-02-02 10:23:56,683 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 10:23:56,683 INFO L93 Difference]: Finished difference Result 205 states and 218 transitions. [2018-02-02 10:23:56,684 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-02-02 10:23:56,684 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 47 [2018-02-02 10:23:56,684 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 10:23:56,685 INFO L225 Difference]: With dead ends: 205 [2018-02-02 10:23:56,685 INFO L226 Difference]: Without dead ends: 192 [2018-02-02 10:23:56,685 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 13 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:56,685 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 192 states. [2018-02-02 10:23:56,689 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 192 to 182. [2018-02-02 10:23:56,689 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 182 states. [2018-02-02 10:23:56,690 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 182 states to 182 states and 191 transitions. [2018-02-02 10:23:56,690 INFO L78 Accepts]: Start accepts. Automaton has 182 states and 191 transitions. Word has length 47 [2018-02-02 10:23:56,690 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 10:23:56,690 INFO L432 AbstractCegarLoop]: Abstraction has 182 states and 191 transitions. [2018-02-02 10:23:56,691 INFO L433 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-02-02 10:23:56,691 INFO L276 IsEmpty]: Start isEmpty. Operand 182 states and 191 transitions. [2018-02-02 10:23:56,691 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2018-02-02 10:23:56,691 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 10:23:56,691 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:56,691 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:56,692 INFO L82 PathProgramCache]: Analyzing trace with hash -722319794, now seen corresponding path program 13 times [2018-02-02 10:23:56,692 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 10:23:56,704 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 10:23:56,705 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:56,813 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:56,813 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-02 10:23:56,813 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [17] total 17 [2018-02-02 10:23:56,813 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 10:23:56,813 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:56,813 INFO L182 omatonBuilderFactory]: Interpolants [7296#(<= |#Ultimate.C_memset_#t~loopctr21| 4), 7297#(<= |#Ultimate.C_memset_#t~loopctr21| 5), 7298#(<= |#Ultimate.C_memset_#t~loopctr21| 6), 7299#(<= |#Ultimate.C_memset_#t~loopctr21| 7), 7300#(<= |#Ultimate.C_memset_#t~loopctr21| 8), 7301#(<= |#Ultimate.C_memset_#t~loopctr21| 9), 7302#(<= |#Ultimate.C_memset_#t~loopctr21| 10), 7303#(<= |#Ultimate.C_memset_#t~loopctr21| 11), 7304#(<= |#Ultimate.C_memset_#t~loopctr21| 12), 7305#(<= |#Ultimate.C_memset_#t~loopctr21| 13), 7306#(<= |#Ultimate.C_memset_#amount| 13), 7290#true, 7291#false, 7292#(= |#Ultimate.C_memset_#t~loopctr21| 0), 7293#(<= |#Ultimate.C_memset_#t~loopctr21| 1), 7294#(<= |#Ultimate.C_memset_#t~loopctr21| 2), 7295#(<= |#Ultimate.C_memset_#t~loopctr21| 3)] [2018-02-02 10:23:56,814 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:56,814 INFO L409 AbstractCegarLoop]: Interpolant automaton has 17 states [2018-02-02 10:23:56,814 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2018-02-02 10:23:56,814 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=122, Invalid=150, Unknown=0, NotChecked=0, Total=272 [2018-02-02 10:23:56,814 INFO L87 Difference]: Start difference. First operand 182 states and 191 transitions. Second operand 17 states. [2018-02-02 10:23:56,858 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 10:23:56,858 INFO L93 Difference]: Finished difference Result 185 states and 194 transitions. [2018-02-02 10:23:56,858 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2018-02-02 10:23:56,859 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 47 [2018-02-02 10:23:56,859 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 10:23:56,859 INFO L225 Difference]: With dead ends: 185 [2018-02-02 10:23:56,860 INFO L226 Difference]: Without dead ends: 183 [2018-02-02 10:23:56,860 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:56,860 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 183 states. [2018-02-02 10:23:56,863 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 183 to 183. [2018-02-02 10:23:56,863 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 183 states. [2018-02-02 10:23:56,864 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 183 states to 183 states and 192 transitions. [2018-02-02 10:23:56,864 INFO L78 Accepts]: Start accepts. Automaton has 183 states and 192 transitions. Word has length 47 [2018-02-02 10:23:56,864 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 10:23:56,864 INFO L432 AbstractCegarLoop]: Abstraction has 183 states and 192 transitions. [2018-02-02 10:23:56,864 INFO L433 AbstractCegarLoop]: Interpolant automaton has 17 states. [2018-02-02 10:23:56,864 INFO L276 IsEmpty]: Start isEmpty. Operand 183 states and 192 transitions. [2018-02-02 10:23:56,865 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2018-02-02 10:23:56,865 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 10:23:56,865 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, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-02 10:23:56,865 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:56,865 INFO L82 PathProgramCache]: Analyzing trace with hash -1335931844, now seen corresponding path program 1 times [2018-02-02 10:23:56,866 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 10:23:56,869 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 10:23:56,870 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:56,893 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:56,893 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-02 10:23:56,893 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-02-02 10:23:56,893 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 10:23:56,893 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:56,894 INFO L182 omatonBuilderFactory]: Interpolants [7680#(not (= |ldv_malloc_#res.base| 0)), 7681#(not (= |ldv_kobject_create_#t~ret17.base| 0)), 7682#(not (= ldv_kobject_create_~kobj~1.base 0)), 7677#true, 7678#false, 7679#(not (= |ldv_malloc_#t~malloc4.base| 0))] [2018-02-02 10:23:56,894 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:56,894 INFO L409 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-02-02 10:23:56,894 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-02-02 10:23:56,894 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-02-02 10:23:56,894 INFO L87 Difference]: Start difference. First operand 183 states and 192 transitions. Second operand 6 states. [2018-02-02 10:23:56,909 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 10:23:56,909 INFO L93 Difference]: Finished difference Result 159 states and 166 transitions. [2018-02-02 10:23:56,910 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-02-02 10:23:56,910 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 49 [2018-02-02 10:23:56,910 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 10:23:56,911 INFO L225 Difference]: With dead ends: 159 [2018-02-02 10:23:56,911 INFO L226 Difference]: Without dead ends: 159 [2018-02-02 10:23:56,911 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:56,911 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 159 states. [2018-02-02 10:23:56,913 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 159 to 159. [2018-02-02 10:23:56,913 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 159 states. [2018-02-02 10:23:56,914 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 159 states to 159 states and 166 transitions. [2018-02-02 10:23:56,914 INFO L78 Accepts]: Start accepts. Automaton has 159 states and 166 transitions. Word has length 49 [2018-02-02 10:23:56,914 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 10:23:56,914 INFO L432 AbstractCegarLoop]: Abstraction has 159 states and 166 transitions. [2018-02-02 10:23:56,915 INFO L433 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-02-02 10:23:56,915 INFO L276 IsEmpty]: Start isEmpty. Operand 159 states and 166 transitions. [2018-02-02 10:23:56,915 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2018-02-02 10:23:56,915 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 10:23:56,915 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:56,915 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:56,916 INFO L82 PathProgramCache]: Analyzing trace with hash 791624621, now seen corresponding path program 14 times [2018-02-02 10:23:56,916 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 10:23:56,928 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 10:23:56,929 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,058 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:57,059 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-02 10:23:57,059 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [18] total 18 [2018-02-02 10:23:57,059 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 10:23:57,059 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:57,059 INFO L182 omatonBuilderFactory]: Interpolants [8003#true, 8004#false, 8005#(= |#Ultimate.C_memset_#t~loopctr21| 0), 8006#(<= |#Ultimate.C_memset_#t~loopctr21| 1), 8007#(<= |#Ultimate.C_memset_#t~loopctr21| 2), 8008#(<= |#Ultimate.C_memset_#t~loopctr21| 3), 8009#(<= |#Ultimate.C_memset_#t~loopctr21| 4), 8010#(<= |#Ultimate.C_memset_#t~loopctr21| 5), 8011#(<= |#Ultimate.C_memset_#t~loopctr21| 6), 8012#(<= |#Ultimate.C_memset_#t~loopctr21| 7), 8013#(<= |#Ultimate.C_memset_#t~loopctr21| 8), 8014#(<= |#Ultimate.C_memset_#t~loopctr21| 9), 8015#(<= |#Ultimate.C_memset_#t~loopctr21| 10), 8016#(<= |#Ultimate.C_memset_#t~loopctr21| 11), 8017#(<= |#Ultimate.C_memset_#t~loopctr21| 12), 8018#(<= |#Ultimate.C_memset_#t~loopctr21| 13), 8019#(<= |#Ultimate.C_memset_#t~loopctr21| 14), 8020#(<= |#Ultimate.C_memset_#amount| 14)] [2018-02-02 10:23:57,060 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:57,060 INFO L409 AbstractCegarLoop]: Interpolant automaton has 18 states [2018-02-02 10:23:57,060 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2018-02-02 10:23:57,060 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=138, Invalid=168, Unknown=0, NotChecked=0, Total=306 [2018-02-02 10:23:57,060 INFO L87 Difference]: Start difference. First operand 159 states and 166 transitions. Second operand 18 states. [2018-02-02 10:23:57,106 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 10:23:57,106 INFO L93 Difference]: Finished difference Result 162 states and 169 transitions. [2018-02-02 10:23:57,107 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2018-02-02 10:23:57,107 INFO L78 Accepts]: Start accepts. Automaton has 18 states. Word has length 48 [2018-02-02 10:23:57,107 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 10:23:57,108 INFO L225 Difference]: With dead ends: 162 [2018-02-02 10:23:57,108 INFO L226 Difference]: Without dead ends: 160 [2018-02-02 10:23:57,108 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 14 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=142, Invalid=200, Unknown=0, NotChecked=0, Total=342 [2018-02-02 10:23:57,109 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 160 states. [2018-02-02 10:23:57,111 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 160 to 160. [2018-02-02 10:23:57,111 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 160 states. [2018-02-02 10:23:57,112 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 160 states to 160 states and 167 transitions. [2018-02-02 10:23:57,112 INFO L78 Accepts]: Start accepts. Automaton has 160 states and 167 transitions. Word has length 48 [2018-02-02 10:23:57,112 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 10:23:57,112 INFO L432 AbstractCegarLoop]: Abstraction has 160 states and 167 transitions. [2018-02-02 10:23:57,112 INFO L433 AbstractCegarLoop]: Interpolant automaton has 18 states. [2018-02-02 10:23:57,112 INFO L276 IsEmpty]: Start isEmpty. Operand 160 states and 167 transitions. [2018-02-02 10:23:57,113 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2018-02-02 10:23:57,113 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 10:23:57,113 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:57,113 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:57,113 INFO L82 PathProgramCache]: Analyzing trace with hash 479261230, now seen corresponding path program 15 times [2018-02-02 10:23:57,114 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 10:23:57,126 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 10:23:57,127 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,246 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:57,246 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-02 10:23:57,246 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [19] total 19 [2018-02-02 10:23:57,247 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 10:23:57,247 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:57,247 INFO L182 omatonBuilderFactory]: Interpolants [8352#(<= |#Ultimate.C_memset_#t~loopctr21| 5), 8353#(<= |#Ultimate.C_memset_#t~loopctr21| 6), 8354#(<= |#Ultimate.C_memset_#t~loopctr21| 7), 8355#(<= |#Ultimate.C_memset_#t~loopctr21| 8), 8356#(<= |#Ultimate.C_memset_#t~loopctr21| 9), 8357#(<= |#Ultimate.C_memset_#t~loopctr21| 10), 8358#(<= |#Ultimate.C_memset_#t~loopctr21| 11), 8359#(<= |#Ultimate.C_memset_#t~loopctr21| 12), 8360#(<= |#Ultimate.C_memset_#t~loopctr21| 13), 8361#(<= |#Ultimate.C_memset_#t~loopctr21| 14), 8362#(<= |#Ultimate.C_memset_#t~loopctr21| 15), 8363#(<= |#Ultimate.C_memset_#amount| 15), 8345#true, 8346#false, 8347#(= |#Ultimate.C_memset_#t~loopctr21| 0), 8348#(<= |#Ultimate.C_memset_#t~loopctr21| 1), 8349#(<= |#Ultimate.C_memset_#t~loopctr21| 2), 8350#(<= |#Ultimate.C_memset_#t~loopctr21| 3), 8351#(<= |#Ultimate.C_memset_#t~loopctr21| 4)] [2018-02-02 10:23:57,247 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:57,247 INFO L409 AbstractCegarLoop]: Interpolant automaton has 19 states [2018-02-02 10:23:57,247 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2018-02-02 10:23:57,247 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=155, Invalid=187, Unknown=0, NotChecked=0, Total=342 [2018-02-02 10:23:57,248 INFO L87 Difference]: Start difference. First operand 160 states and 167 transitions. Second operand 19 states. [2018-02-02 10:23:57,294 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 10:23:57,295 INFO L93 Difference]: Finished difference Result 163 states and 170 transitions. [2018-02-02 10:23:57,295 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2018-02-02 10:23:57,295 INFO L78 Accepts]: Start accepts. Automaton has 19 states. Word has length 49 [2018-02-02 10:23:57,295 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 10:23:57,296 INFO L225 Difference]: With dead ends: 163 [2018-02-02 10:23:57,296 INFO L226 Difference]: Without dead ends: 161 [2018-02-02 10:23:57,296 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=159, Invalid=221, Unknown=0, NotChecked=0, Total=380 [2018-02-02 10:23:57,296 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 161 states. [2018-02-02 10:23:57,298 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 161 to 161. [2018-02-02 10:23:57,298 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 161 states. [2018-02-02 10:23:57,299 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 161 states to 161 states and 168 transitions. [2018-02-02 10:23:57,299 INFO L78 Accepts]: Start accepts. Automaton has 161 states and 168 transitions. Word has length 49 [2018-02-02 10:23:57,299 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 10:23:57,299 INFO L432 AbstractCegarLoop]: Abstraction has 161 states and 168 transitions. [2018-02-02 10:23:57,300 INFO L433 AbstractCegarLoop]: Interpolant automaton has 19 states. [2018-02-02 10:23:57,300 INFO L276 IsEmpty]: Start isEmpty. Operand 161 states and 168 transitions. [2018-02-02 10:23:57,300 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2018-02-02 10:23:57,300 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 10:23:57,300 INFO L351 BasicCegarLoop]: trace histogram [16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-02 10:23:57,300 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:57,300 INFO L82 PathProgramCache]: Analyzing trace with hash -614069299, now seen corresponding path program 16 times [2018-02-02 10:23:57,301 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 10:23:57,313 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 10:23:57,314 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,470 INFO L134 CoverageAnalysis]: Checked inductivity of 136 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 136 trivial. 0 not checked. [2018-02-02 10:23:57,471 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-02 10:23:57,471 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2018-02-02 10:23:57,471 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 10:23:57,471 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 10:23:57,471 INFO L182 omatonBuilderFactory]: Interpolants [8690#true, 8691#false, 8692#(= 0 |ldv_malloc_#t~malloc4.offset|), 8693#(= 0 |ldv_malloc_#res.offset|), 8694#(= 0 |ldv_kobject_create_#t~ret17.offset|), 8695#(= 0 ldv_kobject_create_~kobj~1.offset), 8696#(or (<= (+ |#Ultimate.C_memset_#ptr.offset| |#Ultimate.C_memset_#amount|) (select |#length| |#Ultimate.C_memset_#ptr.base|)) (not (= |#Ultimate.C_memset_#ptr.offset| 0))), 8697#(and (= 0 ldv_kobject_create_~kobj~1.offset) (<= 16 (select |#length| ldv_kobject_create_~kobj~1.base))), 8698#(and (= 0 |ldv_kobject_init_#in~kobj.offset|) (<= 16 (select |#length| |ldv_kobject_init_#in~kobj.base|))), 8699#(and (= 0 ldv_kobject_init_~kobj.offset) (<= 16 (select |#length| ldv_kobject_init_~kobj.base))), 8700#(and (<= 16 (select |#length| |ldv_kobject_init_internal_#in~kobj.base|)) (= 0 |ldv_kobject_init_internal_#in~kobj.offset|)), 8701#(and (<= 16 (select |#length| ldv_kobject_init_internal_~kobj.base)) (= ldv_kobject_init_internal_~kobj.offset 0)), 8702#(and (<= (+ |ldv_kref_init_#in~kref.offset| 4) (select |#length| |ldv_kref_init_#in~kref.base|)) (<= 12 |ldv_kref_init_#in~kref.offset|)), 8703#(and (<= 12 ldv_kref_init_~kref.offset) (<= (+ ldv_kref_init_~kref.offset 4) (select |#length| ldv_kref_init_~kref.base)))] [2018-02-02 10:23:57,471 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:57,471 INFO L409 AbstractCegarLoop]: Interpolant automaton has 14 states [2018-02-02 10:23:57,471 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2018-02-02 10:23:57,472 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=156, Unknown=0, NotChecked=0, Total=182 [2018-02-02 10:23:57,472 INFO L87 Difference]: Start difference. First operand 161 states and 168 transitions. Second operand 14 states. [2018-02-02 10:23:57,716 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 10:23:57,716 INFO L93 Difference]: Finished difference Result 160 states and 167 transitions. [2018-02-02 10:23:57,716 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2018-02-02 10:23:57,716 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 50 [2018-02-02 10:23:57,717 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 10:23:57,717 INFO L225 Difference]: With dead ends: 160 [2018-02-02 10:23:57,717 INFO L226 Difference]: Without dead ends: 160 [2018-02-02 10:23:57,718 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:57,718 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 160 states. [2018-02-02 10:23:57,720 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 160 to 160. [2018-02-02 10:23:57,720 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 160 states. [2018-02-02 10:23:57,721 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 160 states to 160 states and 167 transitions. [2018-02-02 10:23:57,721 INFO L78 Accepts]: Start accepts. Automaton has 160 states and 167 transitions. Word has length 50 [2018-02-02 10:23:57,721 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 10:23:57,721 INFO L432 AbstractCegarLoop]: Abstraction has 160 states and 167 transitions. [2018-02-02 10:23:57,721 INFO L433 AbstractCegarLoop]: Interpolant automaton has 14 states. [2018-02-02 10:23:57,721 INFO L276 IsEmpty]: Start isEmpty. Operand 160 states and 167 transitions. [2018-02-02 10:23:57,722 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2018-02-02 10:23:57,722 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 10:23:57,722 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:57,722 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:57,722 INFO L82 PathProgramCache]: Analyzing trace with hash 2018632319, now seen corresponding path program 1 times [2018-02-02 10:23:57,723 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 10:23:57,735 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 10:23:57,736 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,803 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:57,804 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-02 10:23:57,804 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2018-02-02 10:23:57,804 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 10:23:57,805 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:57,805 INFO L182 omatonBuilderFactory]: Interpolants [9040#(= 1 (select |#valid| |LDV_INIT_LIST_HEAD_#in~list.base|)), 9041#(= 1 (select |#valid| LDV_INIT_LIST_HEAD_~list.base)), 9032#true, 9033#false, 9034#(= 1 (select |#valid| |#Ultimate.C_memset_#ptr.base|)), 9035#(= 1 (select |#valid| ldv_kobject_create_~kobj~1.base)), 9036#(= 1 (select |#valid| |ldv_kobject_init_#in~kobj.base|)), 9037#(= 1 (select |#valid| ldv_kobject_init_~kobj.base)), 9038#(= 1 (select |#valid| |ldv_kobject_init_internal_#in~kobj.base|)), 9039#(= 1 (select |#valid| ldv_kobject_init_internal_~kobj.base))] [2018-02-02 10:23:57,805 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:57,805 INFO L409 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-02-02 10:23:57,805 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-02-02 10:23:57,806 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=73, Unknown=0, NotChecked=0, Total=90 [2018-02-02 10:23:57,806 INFO L87 Difference]: Start difference. First operand 160 states and 167 transitions. Second operand 10 states. [2018-02-02 10:23:58,012 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 10:23:58,012 INFO L93 Difference]: Finished difference Result 158 states and 165 transitions. [2018-02-02 10:23:58,013 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-02-02 10:23:58,013 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 55 [2018-02-02 10:23:58,013 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 10:23:58,014 INFO L225 Difference]: With dead ends: 158 [2018-02-02 10:23:58,014 INFO L226 Difference]: Without dead ends: 158 [2018-02-02 10:23:58,014 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:58,014 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 158 states. [2018-02-02 10:23:58,016 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 158 to 158. [2018-02-02 10:23:58,016 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 158 states. [2018-02-02 10:23:58,017 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 158 states to 158 states and 165 transitions. [2018-02-02 10:23:58,017 INFO L78 Accepts]: Start accepts. Automaton has 158 states and 165 transitions. Word has length 55 [2018-02-02 10:23:58,018 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 10:23:58,018 INFO L432 AbstractCegarLoop]: Abstraction has 158 states and 165 transitions. [2018-02-02 10:23:58,018 INFO L433 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-02-02 10:23:58,018 INFO L276 IsEmpty]: Start isEmpty. Operand 158 states and 165 transitions. [2018-02-02 10:23:58,018 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2018-02-02 10:23:58,018 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 10:23:58,018 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:58,019 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:58,019 INFO L82 PathProgramCache]: Analyzing trace with hash 2018632320, now seen corresponding path program 1 times [2018-02-02 10:23:58,020 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 10:23:58,034 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 10:23:58,034 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:58,218 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:58,218 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-02 10:23:58,219 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2018-02-02 10:23:58,219 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 10:23:58,219 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 10:23:58,219 INFO L182 omatonBuilderFactory]: Interpolants [9376#(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|))), 9377#(and (<= (+ LDV_INIT_LIST_HEAD_~list.offset 12) (select |#length| LDV_INIT_LIST_HEAD_~list.base)) (<= 4 LDV_INIT_LIST_HEAD_~list.offset)), 9364#true, 9365#false, 9366#(= 0 |ldv_malloc_#t~malloc4.offset|), 9367#(= 0 |ldv_malloc_#res.offset|), 9368#(= 0 |ldv_kobject_create_#t~ret17.offset|), 9369#(= 0 ldv_kobject_create_~kobj~1.offset), 9370#(or (<= (+ |#Ultimate.C_memset_#ptr.offset| |#Ultimate.C_memset_#amount|) (select |#length| |#Ultimate.C_memset_#ptr.base|)) (not (= |#Ultimate.C_memset_#ptr.offset| 0))), 9371#(and (= 0 ldv_kobject_create_~kobj~1.offset) (<= 16 (select |#length| ldv_kobject_create_~kobj~1.base))), 9372#(and (= 0 |ldv_kobject_init_#in~kobj.offset|) (<= 16 (select |#length| |ldv_kobject_init_#in~kobj.base|))), 9373#(and (= 0 ldv_kobject_init_~kobj.offset) (<= 16 (select |#length| ldv_kobject_init_~kobj.base))), 9374#(and (<= 16 (select |#length| |ldv_kobject_init_internal_#in~kobj.base|)) (= 0 |ldv_kobject_init_internal_#in~kobj.offset|)), 9375#(and (<= 16 (select |#length| ldv_kobject_init_internal_~kobj.base)) (= ldv_kobject_init_internal_~kobj.offset 0))] [2018-02-02 10:23:58,220 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:58,220 INFO L409 AbstractCegarLoop]: Interpolant automaton has 14 states [2018-02-02 10:23:58,220 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2018-02-02 10:23:58,220 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=156, Unknown=0, NotChecked=0, Total=182 [2018-02-02 10:23:58,220 INFO L87 Difference]: Start difference. First operand 158 states and 165 transitions. Second operand 14 states. [2018-02-02 10:23:58,473 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 10:23:58,473 INFO L93 Difference]: Finished difference Result 156 states and 163 transitions. [2018-02-02 10:23:58,473 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2018-02-02 10:23:58,473 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 55 [2018-02-02 10:23:58,473 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 10:23:58,474 INFO L225 Difference]: With dead ends: 156 [2018-02-02 10:23:58,474 INFO L226 Difference]: Without dead ends: 156 [2018-02-02 10:23:58,474 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:58,474 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 156 states. [2018-02-02 10:23:58,476 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 156 to 156. [2018-02-02 10:23:58,476 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 156 states. [2018-02-02 10:23:58,476 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 156 states to 156 states and 163 transitions. [2018-02-02 10:23:58,476 INFO L78 Accepts]: Start accepts. Automaton has 156 states and 163 transitions. Word has length 55 [2018-02-02 10:23:58,477 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 10:23:58,477 INFO L432 AbstractCegarLoop]: Abstraction has 156 states and 163 transitions. [2018-02-02 10:23:58,477 INFO L433 AbstractCegarLoop]: Interpolant automaton has 14 states. [2018-02-02 10:23:58,477 INFO L276 IsEmpty]: Start isEmpty. Operand 156 states and 163 transitions. [2018-02-02 10:23:58,477 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2018-02-02 10:23:58,477 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 10:23:58,477 INFO L351 BasicCegarLoop]: trace histogram [16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-02 10:23:58,477 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:58,477 INFO L82 PathProgramCache]: Analyzing trace with hash -1509185372, now seen corresponding path program 1 times [2018-02-02 10:23:58,478 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 10:23:58,485 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 10:23:58,486 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:58,520 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:58,520 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-02 10:23:58,520 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2018-02-02 10:23:58,520 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 10:23:58,520 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:58,520 INFO L182 omatonBuilderFactory]: Interpolants [9698#true, 9699#false, 9700#(not (= |ldv_malloc_#t~malloc4.base| 0)), 9701#(not (= |ldv_malloc_#res.base| 0)), 9702#(not (= |ldv_kobject_create_#t~ret17.base| 0)), 9703#(not (= ldv_kobject_create_~kobj~1.base 0)), 9704#(= ldv_kobject_init_~kobj.base |ldv_kobject_init_#in~kobj.base|), 9705#(= 0 |ldv_kobject_init_#in~kobj.base|)] [2018-02-02 10:23:58,520 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:58,521 INFO L409 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-02-02 10:23:58,521 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-02-02 10:23:58,521 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2018-02-02 10:23:58,521 INFO L87 Difference]: Start difference. First operand 156 states and 163 transitions. Second operand 8 states. [2018-02-02 10:23:58,576 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 10:23:58,576 INFO L93 Difference]: Finished difference Result 158 states and 164 transitions. [2018-02-02 10:23:58,577 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-02-02 10:23:58,577 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 60 [2018-02-02 10:23:58,577 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 10:23:58,578 INFO L225 Difference]: With dead ends: 158 [2018-02-02 10:23:58,578 INFO L226 Difference]: Without dead ends: 156 [2018-02-02 10:23:58,578 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:58,578 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 156 states. [2018-02-02 10:23:58,580 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 156 to 156. [2018-02-02 10:23:58,580 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 156 states. [2018-02-02 10:23:58,581 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 156 states to 156 states and 162 transitions. [2018-02-02 10:23:58,581 INFO L78 Accepts]: Start accepts. Automaton has 156 states and 162 transitions. Word has length 60 [2018-02-02 10:23:58,581 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 10:23:58,581 INFO L432 AbstractCegarLoop]: Abstraction has 156 states and 162 transitions. [2018-02-02 10:23:58,581 INFO L433 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-02-02 10:23:58,581 INFO L276 IsEmpty]: Start isEmpty. Operand 156 states and 162 transitions. [2018-02-02 10:23:58,582 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2018-02-02 10:23:58,582 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 10:23:58,582 INFO L351 BasicCegarLoop]: trace histogram [16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-02 10:23:58,582 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:58,582 INFO L82 PathProgramCache]: Analyzing trace with hash -1200464284, now seen corresponding path program 1 times [2018-02-02 10:23:58,583 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 10:23:58,595 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 10:23:58,596 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:58,653 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:58,654 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-02 10:23:58,654 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2018-02-02 10:23:58,654 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 10:23:58,654 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:58,654 INFO L182 omatonBuilderFactory]: Interpolants [10032#(= 0 |ldv_kobject_init_internal_#in~kobj.base|), 10033#(= 0 |ldv_kobject_init_#in~kobj.base|), 10024#true, 10025#false, 10026#(not (= |ldv_malloc_#t~malloc4.base| 0)), 10027#(not (= |ldv_malloc_#res.base| 0)), 10028#(not (= |ldv_kobject_create_#t~ret17.base| 0)), 10029#(not (= ldv_kobject_create_~kobj~1.base 0)), 10030#(= ldv_kobject_init_~kobj.base |ldv_kobject_init_#in~kobj.base|), 10031#(= ldv_kobject_init_internal_~kobj.base |ldv_kobject_init_internal_#in~kobj.base|)] [2018-02-02 10:23:58,655 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:58,655 INFO L409 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-02-02 10:23:58,655 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-02-02 10:23:58,655 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=73, Unknown=0, NotChecked=0, Total=90 [2018-02-02 10:23:58,655 INFO L87 Difference]: Start difference. First operand 156 states and 162 transitions. Second operand 10 states. [2018-02-02 10:23:58,714 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 10:23:58,715 INFO L93 Difference]: Finished difference Result 160 states and 165 transitions. [2018-02-02 10:23:58,715 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-02-02 10:23:58,715 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 65 [2018-02-02 10:23:58,715 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 10:23:58,716 INFO L225 Difference]: With dead ends: 160 [2018-02-02 10:23:58,716 INFO L226 Difference]: Without dead ends: 156 [2018-02-02 10:23:58,716 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:58,717 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 156 states. [2018-02-02 10:23:58,719 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 156 to 156. [2018-02-02 10:23:58,719 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 156 states. [2018-02-02 10:23:58,719 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 156 states to 156 states and 161 transitions. [2018-02-02 10:23:58,720 INFO L78 Accepts]: Start accepts. Automaton has 156 states and 161 transitions. Word has length 65 [2018-02-02 10:23:58,720 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 10:23:58,720 INFO L432 AbstractCegarLoop]: Abstraction has 156 states and 161 transitions. [2018-02-02 10:23:58,720 INFO L433 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-02-02 10:23:58,720 INFO L276 IsEmpty]: Start isEmpty. Operand 156 states and 161 transitions. [2018-02-02 10:23:58,720 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 77 [2018-02-02 10:23:58,721 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 10:23:58,721 INFO L351 BasicCegarLoop]: trace histogram [16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-02 10:23:58,721 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:58,721 INFO L82 PathProgramCache]: Analyzing trace with hash -801417679, now seen corresponding path program 1 times [2018-02-02 10:23:58,722 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 10:23:58,735 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 10:23:58,736 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:58,870 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:58,870 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-02 10:23:58,870 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2018-02-02 10:23:58,870 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 10:23:58,870 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 10:23:58,871 INFO L182 omatonBuilderFactory]: Interpolants [10368#(= 1 (select |#valid| ldv_kref_get_~kref.base)), 10369#(= 1 (select |#valid| |ldv_atomic_add_return_#in~v.base|)), 10370#(= 1 (select |#valid| ldv_atomic_add_return_~v.base)), 10356#true, 10357#false, 10358#(= 1 (select |#valid| |#Ultimate.C_memset_#ptr.base|)), 10359#(= 1 (select |#valid| ldv_kobject_create_~kobj~1.base)), 10360#(= 1 (select |#valid| |ldv_kobject_create_#res.base|)), 10361#(= 1 (select |#valid| |entry_point_#t~ret20.base|)), 10362#(= 1 (select |#valid| entry_point_~kobj~2.base)), 10363#(= 1 (select |#valid| |f_22_get_#in~kobj.base|)), 10364#(= 1 (select |#valid| f_22_get_~kobj.base)), 10365#(= 1 (select |#valid| |ldv_kobject_get_#in~kobj.base|)), 10366#(= 1 (select |#valid| ldv_kobject_get_~kobj.base)), 10367#(= 1 (select |#valid| |ldv_kref_get_#in~kref.base|))] [2018-02-02 10:23:58,871 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:58,871 INFO L409 AbstractCegarLoop]: Interpolant automaton has 15 states [2018-02-02 10:23:58,871 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2018-02-02 10:23:58,871 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=183, Unknown=0, NotChecked=0, Total=210 [2018-02-02 10:23:58,871 INFO L87 Difference]: Start difference. First operand 156 states and 161 transitions. Second operand 15 states. [2018-02-02 10:23:59,107 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 10:23:59,107 INFO L93 Difference]: Finished difference Result 154 states and 159 transitions. [2018-02-02 10:23:59,107 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2018-02-02 10:23:59,107 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 76 [2018-02-02 10:23:59,108 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 10:23:59,108 INFO L225 Difference]: With dead ends: 154 [2018-02-02 10:23:59,108 INFO L226 Difference]: Without dead ends: 154 [2018-02-02 10:23:59,108 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=47, Invalid=333, Unknown=0, NotChecked=0, Total=380 [2018-02-02 10:23:59,109 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 154 states. [2018-02-02 10:23:59,111 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 154 to 154. [2018-02-02 10:23:59,111 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 154 states. [2018-02-02 10:23:59,111 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 154 states to 154 states and 159 transitions. [2018-02-02 10:23:59,111 INFO L78 Accepts]: Start accepts. Automaton has 154 states and 159 transitions. Word has length 76 [2018-02-02 10:23:59,112 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 10:23:59,112 INFO L432 AbstractCegarLoop]: Abstraction has 154 states and 159 transitions. [2018-02-02 10:23:59,112 INFO L433 AbstractCegarLoop]: Interpolant automaton has 15 states. [2018-02-02 10:23:59,112 INFO L276 IsEmpty]: Start isEmpty. Operand 154 states and 159 transitions. [2018-02-02 10:23:59,112 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 77 [2018-02-02 10:23:59,113 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 10:23:59,113 INFO L351 BasicCegarLoop]: trace histogram [16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-02 10:23:59,113 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:59,113 INFO L82 PathProgramCache]: Analyzing trace with hash -801417678, now seen corresponding path program 1 times [2018-02-02 10:23:59,114 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 10:23:59,129 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 10:23:59,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:59,344 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:59,345 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-02 10:23:59,345 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [18] imperfect sequences [] total 18 [2018-02-02 10:23:59,345 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 10:23:59,345 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 10:23:59,345 INFO L182 omatonBuilderFactory]: Interpolants [10689#true, 10690#false, 10691#(= 0 |ldv_malloc_#t~malloc4.offset|), 10692#(= 0 |ldv_malloc_#res.offset|), 10693#(= 0 |ldv_kobject_create_#t~ret17.offset|), 10694#(= 0 ldv_kobject_create_~kobj~1.offset), 10695#(or (<= (+ |#Ultimate.C_memset_#ptr.offset| |#Ultimate.C_memset_#amount|) (select |#length| |#Ultimate.C_memset_#ptr.base|)) (not (= |#Ultimate.C_memset_#ptr.offset| 0))), 10696#(and (= 0 ldv_kobject_create_~kobj~1.offset) (<= 16 (select |#length| ldv_kobject_create_~kobj~1.base))), 10697#(and (= 0 |ldv_kobject_create_#res.offset|) (<= 16 (select |#length| |ldv_kobject_create_#res.base|))), 10698#(and (<= 16 (select |#length| |entry_point_#t~ret20.base|)) (= 0 |entry_point_#t~ret20.offset|)), 10699#(and (= 0 entry_point_~kobj~2.offset) (<= 16 (select |#length| entry_point_~kobj~2.base))), 10700#(and (= 0 |f_22_get_#in~kobj.offset|) (<= 16 (select |#length| |f_22_get_#in~kobj.base|))), 10701#(and (= 0 f_22_get_~kobj.offset) (<= 16 (select |#length| f_22_get_~kobj.base))), 10702#(and (<= 16 (select |#length| |ldv_kobject_get_#in~kobj.base|)) (= 0 |ldv_kobject_get_#in~kobj.offset|)), 10703#(and (<= 16 (select |#length| ldv_kobject_get_~kobj.base)) (= ldv_kobject_get_~kobj.offset 0)), 10704#(and (<= 12 |ldv_kref_get_#in~kref.offset|) (<= (+ |ldv_kref_get_#in~kref.offset| 4) (select |#length| |ldv_kref_get_#in~kref.base|))), 10705#(and (<= 12 ldv_kref_get_~kref.offset) (<= (+ ldv_kref_get_~kref.offset 4) (select |#length| ldv_kref_get_~kref.base))), 10706#(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|))), 10707#(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:59,346 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:59,346 INFO L409 AbstractCegarLoop]: Interpolant automaton has 19 states [2018-02-02 10:23:59,346 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2018-02-02 10:23:59,346 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=306, Unknown=0, NotChecked=0, Total=342 [2018-02-02 10:23:59,346 INFO L87 Difference]: Start difference. First operand 154 states and 159 transitions. Second operand 19 states. [2018-02-02 10:23:59,629 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 10:23:59,629 INFO L93 Difference]: Finished difference Result 152 states and 157 transitions. [2018-02-02 10:23:59,630 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2018-02-02 10:23:59,630 INFO L78 Accepts]: Start accepts. Automaton has 19 states. Word has length 76 [2018-02-02 10:23:59,630 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 10:23:59,631 INFO L225 Difference]: With dead ends: 152 [2018-02-02 10:23:59,631 INFO L226 Difference]: Without dead ends: 152 [2018-02-02 10:23:59,631 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 31 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=61, Invalid=539, Unknown=0, NotChecked=0, Total=600 [2018-02-02 10:23:59,631 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 152 states. [2018-02-02 10:23:59,633 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 152 to 152. [2018-02-02 10:23:59,633 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 152 states. [2018-02-02 10:23:59,633 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 152 states to 152 states and 157 transitions. [2018-02-02 10:23:59,633 INFO L78 Accepts]: Start accepts. Automaton has 152 states and 157 transitions. Word has length 76 [2018-02-02 10:23:59,633 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 10:23:59,633 INFO L432 AbstractCegarLoop]: Abstraction has 152 states and 157 transitions. [2018-02-02 10:23:59,634 INFO L433 AbstractCegarLoop]: Interpolant automaton has 19 states. [2018-02-02 10:23:59,634 INFO L276 IsEmpty]: Start isEmpty. Operand 152 states and 157 transitions. [2018-02-02 10:23:59,634 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 90 [2018-02-02 10:23:59,634 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 10:23:59,634 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] [2018-02-02 10:23:59,634 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:59,634 INFO L82 PathProgramCache]: Analyzing trace with hash 18163484, now seen corresponding path program 1 times [2018-02-02 10:23:59,635 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 10:23:59,644 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 10:23:59,645 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:59,749 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:59,749 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-02 10:23:59,749 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2018-02-02 10:23:59,749 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 10:23:59,750 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:59,750 INFO L182 omatonBuilderFactory]: Interpolants [11024#true, 11025#false, 11026#(not (= |ldv_malloc_#t~malloc4.base| 0)), 11027#(not (= |ldv_malloc_#res.base| 0)), 11028#(not (= |ldv_kobject_create_#t~ret17.base| 0)), 11029#(not (= ldv_kobject_create_~kobj~1.base 0)), 11030#(not (= |ldv_kobject_create_#res.base| 0)), 11031#(not (= |entry_point_#t~ret20.base| 0)), 11032#(not (= entry_point_~kobj~2.base 0)), 11033#(= f_22_get_~kobj.base |f_22_get_#in~kobj.base|), 11034#(= ldv_kobject_get_~kobj.base |ldv_kobject_get_#in~kobj.base|), 11035#(= 0 |ldv_kobject_get_#in~kobj.base|), 11036#(= 0 |f_22_get_#in~kobj.base|)] [2018-02-02 10:23:59,750 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:59,750 INFO L409 AbstractCegarLoop]: Interpolant automaton has 13 states [2018-02-02 10:23:59,750 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2018-02-02 10:23:59,751 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=133, Unknown=0, NotChecked=0, Total=156 [2018-02-02 10:23:59,751 INFO L87 Difference]: Start difference. First operand 152 states and 157 transitions. Second operand 13 states. [2018-02-02 10:23:59,830 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 10:23:59,830 INFO L93 Difference]: Finished difference Result 158 states and 162 transitions. [2018-02-02 10:23:59,830 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2018-02-02 10:23:59,830 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 89 [2018-02-02 10:23:59,830 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 10:23:59,831 INFO L225 Difference]: With dead ends: 158 [2018-02-02 10:23:59,831 INFO L226 Difference]: Without dead ends: 152 [2018-02-02 10:23:59,831 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=39, Invalid=233, Unknown=0, NotChecked=0, Total=272 [2018-02-02 10:23:59,832 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 152 states. [2018-02-02 10:23:59,833 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 152 to 152. [2018-02-02 10:23:59,833 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 152 states. [2018-02-02 10:23:59,834 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 152 states to 152 states and 156 transitions. [2018-02-02 10:23:59,834 INFO L78 Accepts]: Start accepts. Automaton has 152 states and 156 transitions. Word has length 89 [2018-02-02 10:23:59,834 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 10:23:59,834 INFO L432 AbstractCegarLoop]: Abstraction has 152 states and 156 transitions. [2018-02-02 10:23:59,835 INFO L433 AbstractCegarLoop]: Interpolant automaton has 13 states. [2018-02-02 10:23:59,835 INFO L276 IsEmpty]: Start isEmpty. Operand 152 states and 156 transitions. [2018-02-02 10:23:59,835 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 103 [2018-02-02 10:23:59,835 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 10:23:59,835 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] [2018-02-02 10:23:59,835 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:59,836 INFO L82 PathProgramCache]: Analyzing trace with hash -1782732078, now seen corresponding path program 1 times [2018-02-02 10:23:59,836 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 10:23:59,852 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 10:23:59,853 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,080 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:24:00,080 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-02 10:24:00,081 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [21] imperfect sequences [] total 21 [2018-02-02 10:24:00,081 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 10:24:00,081 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,081 INFO L182 omatonBuilderFactory]: Interpolants [11360#(= ldv_atomic_add_return_~v.base |ldv_atomic_add_return_#in~v.base|), 11361#(and (= 1 (select |#valid| ldv_atomic_add_return_~v.base)) (= ldv_atomic_add_return_~v.base |ldv_atomic_add_return_#in~v.base|)), 11362#(= 1 (select |#valid| |ldv_atomic_add_return_#in~v.base|)), 11363#(= 1 (select |#valid| |ldv_kref_get_#in~kref.base|)), 11364#(= 1 (select |#valid| |ldv_kobject_get_#in~kobj.base|)), 11365#(= 1 (select |#valid| |f_22_get_#in~kobj.base|)), 11366#(= 1 (select |#valid| entry_point_~kobj~2.base)), 11367#(= 1 (select |#valid| |f_22_put_#in~kobj.base|)), 11368#(= 1 (select |#valid| f_22_put_~kobj.base)), 11369#(= 1 (select |#valid| |ldv_kobject_put_#in~kobj.base|)), 11370#(= 1 (select |#valid| ldv_kobject_put_~kobj.base)), 11371#(= 1 (select |#valid| |ldv_kref_put_#in~kref.base|)), 11372#(= 1 (select |#valid| ldv_kref_put_~kref.base)), 11373#(= 1 (select |#valid| |ldv_kref_sub_#in~kref.base|)), 11374#(= 1 (select |#valid| ldv_kref_sub_~kref.base)), 11375#(= 1 (select |#valid| |ldv_atomic_sub_return_#in~v.base|)), 11376#(= 1 (select |#valid| ldv_atomic_sub_return_~v.base)), 11355#true, 11356#false, 11357#(= f_22_get_~kobj.base |f_22_get_#in~kobj.base|), 11358#(= ldv_kobject_get_~kobj.base |ldv_kobject_get_#in~kobj.base|), 11359#(= ldv_kref_get_~kref.base |ldv_kref_get_#in~kref.base|)] [2018-02-02 10:24:00,081 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:24:00,082 INFO L409 AbstractCegarLoop]: Interpolant automaton has 22 states [2018-02-02 10:24:00,082 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2018-02-02 10:24:00,082 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=43, Invalid=419, Unknown=0, NotChecked=0, Total=462 [2018-02-02 10:24:00,082 INFO L87 Difference]: Start difference. First operand 152 states and 156 transitions. Second operand 22 states. [2018-02-02 10:24:00,644 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 10:24:00,644 INFO L93 Difference]: Finished difference Result 179 states and 188 transitions. [2018-02-02 10:24:00,645 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2018-02-02 10:24:00,645 INFO L78 Accepts]: Start accepts. Automaton has 22 states. Word has length 102 [2018-02-02 10:24:00,645 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 10:24:00,646 INFO L225 Difference]: With dead ends: 179 [2018-02-02 10:24:00,646 INFO L226 Difference]: Without dead ends: 179 [2018-02-02 10:24:00,646 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 29 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 65 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=75, Invalid=795, Unknown=0, NotChecked=0, Total=870 [2018-02-02 10:24:00,647 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 179 states. [2018-02-02 10:24:00,649 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 179 to 174. [2018-02-02 10:24:00,650 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 174 states. [2018-02-02 10:24:00,650 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 174 states to 174 states and 184 transitions. [2018-02-02 10:24:00,650 INFO L78 Accepts]: Start accepts. Automaton has 174 states and 184 transitions. Word has length 102 [2018-02-02 10:24:00,651 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 10:24:00,651 INFO L432 AbstractCegarLoop]: Abstraction has 174 states and 184 transitions. [2018-02-02 10:24:00,651 INFO L433 AbstractCegarLoop]: Interpolant automaton has 22 states. [2018-02-02 10:24:00,651 INFO L276 IsEmpty]: Start isEmpty. Operand 174 states and 184 transitions. [2018-02-02 10:24:00,651 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 103 [2018-02-02 10:24:00,651 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 10:24:00,652 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] [2018-02-02 10:24:00,652 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:24:00,652 INFO L82 PathProgramCache]: Analyzing trace with hash -1782732077, now seen corresponding path program 1 times [2018-02-02 10:24:00,653 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 10:24:00,670 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 10:24:00,671 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,961 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:24:00,961 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-02 10:24:00,961 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [20] imperfect sequences [] total 20 [2018-02-02 10:24:00,962 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 10:24:00,962 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,962 INFO L182 omatonBuilderFactory]: Interpolants [11746#true, 11747#false, 11748#(= 0 |ldv_malloc_#t~malloc4.offset|), 11749#(= 0 |ldv_malloc_#res.offset|), 11750#(= 0 |ldv_kobject_create_#t~ret17.offset|), 11751#(= 0 ldv_kobject_create_~kobj~1.offset), 11752#(or (<= (+ |#Ultimate.C_memset_#ptr.offset| |#Ultimate.C_memset_#amount|) (select |#length| |#Ultimate.C_memset_#ptr.base|)) (not (= |#Ultimate.C_memset_#ptr.offset| 0))), 11753#(and (= 0 ldv_kobject_create_~kobj~1.offset) (<= 16 (select |#length| ldv_kobject_create_~kobj~1.base))), 11754#(and (= 0 |ldv_kobject_create_#res.offset|) (<= 16 (select |#length| |ldv_kobject_create_#res.base|))), 11755#(and (<= 16 (select |#length| |entry_point_#t~ret20.base|)) (= 0 |entry_point_#t~ret20.offset|)), 11756#(and (= 0 entry_point_~kobj~2.offset) (<= 16 (select |#length| entry_point_~kobj~2.base))), 11757#(and (<= 16 (select |#length| |f_22_put_#in~kobj.base|)) (= 0 |f_22_put_#in~kobj.offset|)), 11758#(and (= 0 f_22_put_~kobj.offset) (<= 16 (select |#length| f_22_put_~kobj.base))), 11759#(and (<= 16 (select |#length| |ldv_kobject_put_#in~kobj.base|)) (= 0 |ldv_kobject_put_#in~kobj.offset|)), 11760#(and (= ldv_kobject_put_~kobj.offset 0) (<= 16 (select |#length| ldv_kobject_put_~kobj.base))), 11761#(and (<= 12 |ldv_kref_put_#in~kref.offset|) (<= (+ |ldv_kref_put_#in~kref.offset| 4) (select |#length| |ldv_kref_put_#in~kref.base|))), 11762#(and (<= 12 ldv_kref_put_~kref.offset) (<= (+ ldv_kref_put_~kref.offset 4) (select |#length| ldv_kref_put_~kref.base))), 11763#(and (<= (+ |ldv_kref_sub_#in~kref.offset| 4) (select |#length| |ldv_kref_sub_#in~kref.base|)) (<= 12 |ldv_kref_sub_#in~kref.offset|)), 11764#(and (<= (+ ldv_kref_sub_~kref.offset 4) (select |#length| ldv_kref_sub_~kref.base)) (<= 12 ldv_kref_sub_~kref.offset)), 11765#(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|)), 11766#(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:24:00,962 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:24:00,962 INFO L409 AbstractCegarLoop]: Interpolant automaton has 21 states [2018-02-02 10:24:00,962 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2018-02-02 10:24:00,962 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=40, Invalid=380, Unknown=0, NotChecked=0, Total=420 [2018-02-02 10:24:00,962 INFO L87 Difference]: Start difference. First operand 174 states and 184 transitions. Second operand 21 states. [2018-02-02 10:24:01,335 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 10:24:01,335 INFO L93 Difference]: Finished difference Result 172 states and 180 transitions. [2018-02-02 10:24:01,336 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2018-02-02 10:24:01,336 INFO L78 Accepts]: Start accepts. Automaton has 21 states. Word has length 102 [2018-02-02 10:24:01,336 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 10:24:01,336 INFO L225 Difference]: With dead ends: 172 [2018-02-02 10:24:01,336 INFO L226 Difference]: Without dead ends: 172 [2018-02-02 10:24:01,337 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 40 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=69, Invalid=687, Unknown=0, NotChecked=0, Total=756 [2018-02-02 10:24:01,337 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 172 states. [2018-02-02 10:24:01,340 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 172 to 172. [2018-02-02 10:24:01,340 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 172 states. [2018-02-02 10:24:01,340 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 172 states to 172 states and 180 transitions. [2018-02-02 10:24:01,341 INFO L78 Accepts]: Start accepts. Automaton has 172 states and 180 transitions. Word has length 102 [2018-02-02 10:24:01,341 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 10:24:01,341 INFO L432 AbstractCegarLoop]: Abstraction has 172 states and 180 transitions. [2018-02-02 10:24:01,341 INFO L433 AbstractCegarLoop]: Interpolant automaton has 21 states. [2018-02-02 10:24:01,341 INFO L276 IsEmpty]: Start isEmpty. Operand 172 states and 180 transitions. [2018-02-02 10:24:01,342 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 110 [2018-02-02 10:24:01,342 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 10:24:01,342 INFO L351 BasicCegarLoop]: trace histogram [16, 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] [2018-02-02 10:24:01,342 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:24:01,343 INFO L82 PathProgramCache]: Analyzing trace with hash -1973215805, now seen corresponding path program 1 times [2018-02-02 10:24:01,344 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 10:24:01,361 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 10:24:01,362 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:01,496 INFO L134 CoverageAnalysis]: Checked inductivity of 138 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 136 trivial. 0 not checked. [2018-02-02 10:24:01,496 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-02 10:24:01,497 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2018-02-02 10:24:01,497 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 10:24:01,497 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:01,497 INFO L182 omatonBuilderFactory]: Interpolants [12128#(not (= |ldv_malloc_#res.base| 0)), 12129#(not (= |ldv_kobject_create_#t~ret17.base| 0)), 12130#(not (= ldv_kobject_create_~kobj~1.base 0)), 12131#(not (= |ldv_kobject_create_#res.base| 0)), 12132#(not (= |entry_point_#t~ret20.base| 0)), 12133#(not (= entry_point_~kobj~2.base 0)), 12134#(= f_22_put_~kobj.base |f_22_put_#in~kobj.base|), 12135#(= ldv_kobject_put_~kobj.base |ldv_kobject_put_#in~kobj.base|), 12136#(= 0 |ldv_kobject_put_#in~kobj.base|), 12137#(= 0 |f_22_put_#in~kobj.base|), 12125#true, 12126#false, 12127#(not (= |ldv_malloc_#t~malloc4.base| 0))] [2018-02-02 10:24:01,498 INFO L134 CoverageAnalysis]: Checked inductivity of 138 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 136 trivial. 0 not checked. [2018-02-02 10:24:01,498 INFO L409 AbstractCegarLoop]: Interpolant automaton has 13 states [2018-02-02 10:24:01,498 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2018-02-02 10:24:01,498 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=133, Unknown=0, NotChecked=0, Total=156 [2018-02-02 10:24:01,498 INFO L87 Difference]: Start difference. First operand 172 states and 180 transitions. Second operand 13 states. [2018-02-02 10:24:01,591 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 10:24:01,592 INFO L93 Difference]: Finished difference Result 176 states and 182 transitions. [2018-02-02 10:24:01,592 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2018-02-02 10:24:01,592 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 109 [2018-02-02 10:24:01,592 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 10:24:01,593 INFO L225 Difference]: With dead ends: 176 [2018-02-02 10:24:01,593 INFO L226 Difference]: Without dead ends: 170 [2018-02-02 10:24:01,593 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=39, Invalid=233, Unknown=0, NotChecked=0, Total=272 [2018-02-02 10:24:01,594 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 170 states. [2018-02-02 10:24:01,596 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 170 to 170. [2018-02-02 10:24:01,596 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 170 states. [2018-02-02 10:24:01,597 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 170 states to 170 states and 176 transitions. [2018-02-02 10:24:01,597 INFO L78 Accepts]: Start accepts. Automaton has 170 states and 176 transitions. Word has length 109 [2018-02-02 10:24:01,597 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 10:24:01,597 INFO L432 AbstractCegarLoop]: Abstraction has 170 states and 176 transitions. [2018-02-02 10:24:01,597 INFO L433 AbstractCegarLoop]: Interpolant automaton has 13 states. [2018-02-02 10:24:01,597 INFO L276 IsEmpty]: Start isEmpty. Operand 170 states and 176 transitions. [2018-02-02 10:24:01,598 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 117 [2018-02-02 10:24:01,598 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 10:24:01,598 INFO L351 BasicCegarLoop]: trace histogram [16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-02 10:24:01,598 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:24:01,599 INFO L82 PathProgramCache]: Analyzing trace with hash 842639827, now seen corresponding path program 1 times [2018-02-02 10:24:01,600 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 10:24:01,616 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 10:24:01,617 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:01,952 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:24:01,952 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-02 10:24:01,952 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [24] imperfect sequences [] total 24 [2018-02-02 10:24:01,952 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 10:24:01,953 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:01,953 INFO L182 omatonBuilderFactory]: Interpolants [12492#true, 12493#false, 12494#(= f_22_get_~kobj.base |f_22_get_#in~kobj.base|), 12495#(= ldv_kobject_get_~kobj.base |ldv_kobject_get_#in~kobj.base|), 12496#(= ldv_kref_get_~kref.base |ldv_kref_get_#in~kref.base|), 12497#(= ldv_atomic_add_return_~v.base |ldv_atomic_add_return_#in~v.base|), 12498#(= 1 (select |#valid| |ldv_atomic_add_return_#in~v.base|)), 12499#(= 1 (select |#valid| |ldv_kref_get_#in~kref.base|)), 12500#(= 1 (select |#valid| |ldv_kobject_get_#in~kobj.base|)), 12501#(= 1 (select |#valid| |f_22_get_#in~kobj.base|)), 12502#(= 1 (select |#valid| entry_point_~kobj~2.base)), 12503#(= 1 (select |#valid| |f_22_put_#in~kobj.base|)), 12504#(= 1 (select |#valid| f_22_put_~kobj.base)), 12505#(= 1 (select |#valid| |ldv_kobject_put_#in~kobj.base|)), 12506#(= 1 (select |#valid| ldv_kobject_put_~kobj.base)), 12507#(= 1 (select |#valid| |ldv_kref_put_#in~kref.base|)), 12508#(= 1 (select |#valid| ldv_kref_put_~kref.base)), 12509#(= 1 (select |#valid| |ldv_kref_sub_#in~kref.base|)), 12510#(= 1 (select |#valid| ldv_kref_sub_~kref.base)), 12511#(= 1 (select |#valid| |##fun~$Pointer$~TO~VOID_#in~kref.base|)), 12512#(= 1 (select |#valid| |##fun~$Pointer$~TO~VOID_#~kref.base|)), 12513#(= 1 (select |#valid| |ldv_kobject_release_#in~kref.base|)), 12514#(= 1 (select |#valid| ldv_kobject_release_~kobj~0.base)), 12515#(= 1 (select |#valid| |ldv_kobject_cleanup_#in~kobj.base|)), 12516#(= 1 (select |#valid| ldv_kobject_cleanup_~kobj.base))] [2018-02-02 10:24:01,953 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:24:01,953 INFO L409 AbstractCegarLoop]: Interpolant automaton has 25 states [2018-02-02 10:24:01,953 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2018-02-02 10:24:01,953 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=553, Unknown=0, NotChecked=0, Total=600 [2018-02-02 10:24:01,953 INFO L87 Difference]: Start difference. First operand 170 states and 176 transitions. Second operand 25 states. [2018-02-02 10:24:02,635 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 10:24:02,636 INFO L93 Difference]: Finished difference Result 180 states and 189 transitions. [2018-02-02 10:24:02,636 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2018-02-02 10:24:02,636 INFO L78 Accepts]: Start accepts. Automaton has 25 states. Word has length 116 [2018-02-02 10:24:02,637 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 10:24:02,637 INFO L225 Difference]: With dead ends: 180 [2018-02-02 10:24:02,637 INFO L226 Difference]: Without dead ends: 180 [2018-02-02 10:24:02,638 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 35 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 34 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 55 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=91, Invalid=1169, Unknown=0, NotChecked=0, Total=1260 [2018-02-02 10:24:02,638 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 180 states. [2018-02-02 10:24:02,641 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 180 to 176. [2018-02-02 10:24:02,641 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 176 states. [2018-02-02 10:24:02,642 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 176 states to 176 states and 186 transitions. [2018-02-02 10:24:02,642 INFO L78 Accepts]: Start accepts. Automaton has 176 states and 186 transitions. Word has length 116 [2018-02-02 10:24:02,642 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 10:24:02,642 INFO L432 AbstractCegarLoop]: Abstraction has 176 states and 186 transitions. [2018-02-02 10:24:02,643 INFO L433 AbstractCegarLoop]: Interpolant automaton has 25 states. [2018-02-02 10:24:02,643 INFO L276 IsEmpty]: Start isEmpty. Operand 176 states and 186 transitions. [2018-02-02 10:24:02,643 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 117 [2018-02-02 10:24:02,643 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 10:24:02,643 INFO L351 BasicCegarLoop]: trace histogram [16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-02 10:24:02,644 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:24:02,644 INFO L82 PathProgramCache]: Analyzing trace with hash 842639828, now seen corresponding path program 1 times [2018-02-02 10:24:02,645 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 10:24:02,667 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 10:24:02,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:24:03,129 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:24:03,129 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-02 10:24:03,130 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [24] imperfect sequences [] total 24 [2018-02-02 10:24:03,130 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 10:24:03,130 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:03,130 INFO L182 omatonBuilderFactory]: Interpolants [12895#true, 12896#false, 12897#(= 0 |ldv_malloc_#t~malloc4.offset|), 12898#(= 0 |ldv_malloc_#res.offset|), 12899#(= 0 |ldv_kobject_create_#t~ret17.offset|), 12900#(= 0 ldv_kobject_create_~kobj~1.offset), 12901#(or (<= (+ |#Ultimate.C_memset_#ptr.offset| |#Ultimate.C_memset_#amount|) (select |#length| |#Ultimate.C_memset_#ptr.base|)) (not (= |#Ultimate.C_memset_#ptr.offset| 0))), 12902#(and (= 0 ldv_kobject_create_~kobj~1.offset) (<= 16 (select |#length| ldv_kobject_create_~kobj~1.base))), 12903#(and (= 0 |ldv_kobject_create_#res.offset|) (<= 16 (select |#length| |ldv_kobject_create_#res.base|))), 12904#(and (<= 16 (select |#length| |entry_point_#t~ret20.base|)) (= 0 |entry_point_#t~ret20.offset|)), 12905#(and (= 0 entry_point_~kobj~2.offset) (<= 16 (select |#length| entry_point_~kobj~2.base))), 12906#(and (<= 16 (select |#length| |f_22_put_#in~kobj.base|)) (= 0 |f_22_put_#in~kobj.offset|)), 12907#(and (= 0 f_22_put_~kobj.offset) (<= 16 (select |#length| f_22_put_~kobj.base))), 12908#(and (<= 16 (select |#length| |ldv_kobject_put_#in~kobj.base|)) (= 0 |ldv_kobject_put_#in~kobj.offset|)), 12909#(and (= ldv_kobject_put_~kobj.offset 0) (<= 16 (select |#length| ldv_kobject_put_~kobj.base))), 12910#(and (<= 12 |ldv_kref_put_#in~kref.offset|) (<= (+ |ldv_kref_put_#in~kref.offset| 4) (select |#length| |ldv_kref_put_#in~kref.base|))), 12911#(and (<= 12 ldv_kref_put_~kref.offset) (<= (+ ldv_kref_put_~kref.offset 4) (select |#length| ldv_kref_put_~kref.base))), 12912#(and (<= (+ |ldv_kref_sub_#in~kref.offset| 4) (select |#length| |ldv_kref_sub_#in~kref.base|)) (<= 12 |ldv_kref_sub_#in~kref.offset|)), 12913#(and (<= (+ ldv_kref_sub_~kref.offset 4) (select |#length| ldv_kref_sub_~kref.base)) (<= 12 ldv_kref_sub_~kref.offset)), 12914#(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|))), 12915#(and (<= 12 |##fun~$Pointer$~TO~VOID_#~kref.offset|) (<= (+ |##fun~$Pointer$~TO~VOID_#~kref.offset| 4) (select |#length| |##fun~$Pointer$~TO~VOID_#~kref.base|))), 12916#(and (<= 12 |ldv_kobject_release_#in~kref.offset|) (<= (+ |ldv_kobject_release_#in~kref.offset| 4) (select |#length| |ldv_kobject_release_#in~kref.base|))), 12917#(and (<= (+ ldv_kobject_release_~kobj~0.offset 16) (select |#length| ldv_kobject_release_~kobj~0.base)) (<= 0 ldv_kobject_release_~kobj~0.offset)), 12918#(and (<= (+ |ldv_kobject_cleanup_#in~kobj.offset| 16) (select |#length| |ldv_kobject_cleanup_#in~kobj.base|)) (<= 0 |ldv_kobject_cleanup_#in~kobj.offset|)), 12919#(and (<= 0 ldv_kobject_cleanup_~kobj.offset) (<= (+ ldv_kobject_cleanup_~kobj.offset 16) (select |#length| ldv_kobject_cleanup_~kobj.base)))] [2018-02-02 10:24:03,130 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:24:03,130 INFO L409 AbstractCegarLoop]: Interpolant automaton has 25 states [2018-02-02 10:24:03,131 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2018-02-02 10:24:03,131 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=48, Invalid=552, Unknown=0, NotChecked=0, Total=600 [2018-02-02 10:24:03,131 INFO L87 Difference]: Start difference. First operand 176 states and 186 transitions. Second operand 25 states. [2018-02-02 10:24:03,840 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 10:24:03,840 INFO L93 Difference]: Finished difference Result 175 states and 184 transitions. [2018-02-02 10:24:03,840 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2018-02-02 10:24:03,840 INFO L78 Accepts]: Start accepts. Automaton has 25 states. Word has length 116 [2018-02-02 10:24:03,840 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 10:24:03,841 INFO L225 Difference]: With dead ends: 175 [2018-02-02 10:24:03,841 INFO L226 Difference]: Without dead ends: 175 [2018-02-02 10:24:03,841 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 34 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 32 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 61 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=85, Invalid=1037, Unknown=0, NotChecked=0, Total=1122 [2018-02-02 10:24:03,842 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 175 states. [2018-02-02 10:24:03,843 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 175 to 175. [2018-02-02 10:24:03,843 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 175 states. [2018-02-02 10:24:03,844 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 175 states to 175 states and 184 transitions. [2018-02-02 10:24:03,844 INFO L78 Accepts]: Start accepts. Automaton has 175 states and 184 transitions. Word has length 116 [2018-02-02 10:24:03,844 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 10:24:03,844 INFO L432 AbstractCegarLoop]: Abstraction has 175 states and 184 transitions. [2018-02-02 10:24:03,844 INFO L433 AbstractCegarLoop]: Interpolant automaton has 25 states. [2018-02-02 10:24:03,844 INFO L276 IsEmpty]: Start isEmpty. Operand 175 states and 184 transitions. [2018-02-02 10:24:03,844 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 119 [2018-02-02 10:24:03,845 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 10:24:03,845 INFO L351 BasicCegarLoop]: trace histogram [16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-02 10:24:03,845 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:24:03,845 INFO L82 PathProgramCache]: Analyzing trace with hash -1971942700, now seen corresponding path program 1 times [2018-02-02 10:24:03,845 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 10:24:03,862 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 10:24:03,864 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:04,329 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:24:04,329 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-02 10:24:04,329 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [23] imperfect sequences [] total 23 [2018-02-02 10:24:04,330 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 10:24:04,330 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:04,330 INFO L182 omatonBuilderFactory]: Interpolants [13288#true, 13289#false, 13290#(= 0 |ldv_malloc_#t~malloc4.offset|), 13291#(= 0 |ldv_malloc_#res.offset|), 13292#(= 0 |ldv_kobject_create_#t~ret17.offset|), 13293#(= 0 ldv_kobject_create_~kobj~1.offset), 13294#(= 0 |ldv_kobject_create_#res.offset|), 13295#(= 0 |entry_point_#t~ret20.offset|), 13296#(= 0 entry_point_~kobj~2.offset), 13297#(= 0 |f_22_put_#in~kobj.offset|), 13298#(= 0 f_22_put_~kobj.offset), 13299#(= 0 |ldv_kobject_put_#in~kobj.offset|), 13300#(= ldv_kobject_put_~kobj.offset 0), 13301#(<= |ldv_kref_put_#in~kref.offset| 12), 13302#(<= ldv_kref_put_~kref.offset 12), 13303#(<= |ldv_kref_sub_#in~kref.offset| 12), 13304#(<= ldv_kref_sub_~kref.offset 12), 13305#(<= |##fun~$Pointer$~TO~VOID_#in~kref.offset| 12), 13306#(<= |##fun~$Pointer$~TO~VOID_#~kref.offset| 12), 13307#(<= |ldv_kobject_release_#in~kref.offset| 12), 13308#(<= ldv_kobject_release_~kobj~0.offset 0), 13309#(<= |ldv_kobject_cleanup_#in~kobj.offset| 0), 13310#(<= ldv_kobject_cleanup_~kobj.offset 0), 13311#(and (<= 0 ldv_kobject_cleanup_~kobj.offset) (<= ldv_kobject_cleanup_~kobj.offset 0))] [2018-02-02 10:24:04,330 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:24:04,330 INFO L409 AbstractCegarLoop]: Interpolant automaton has 24 states [2018-02-02 10:24:04,330 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2018-02-02 10:24:04,330 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=46, Invalid=506, Unknown=0, NotChecked=0, Total=552 [2018-02-02 10:24:04,331 INFO L87 Difference]: Start difference. First operand 175 states and 184 transitions. Second operand 24 states. [2018-02-02 10:24:04,536 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 10:24:04,536 INFO L93 Difference]: Finished difference Result 174 states and 183 transitions. [2018-02-02 10:24:04,536 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2018-02-02 10:24:04,536 INFO L78 Accepts]: Start accepts. Automaton has 24 states. Word has length 118 [2018-02-02 10:24:04,537 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 10:24:04,537 INFO L225 Difference]: With dead ends: 174 [2018-02-02 10:24:04,537 INFO L226 Difference]: Without dead ends: 174 [2018-02-02 10:24:04,538 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 34 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 32 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 52 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=88, Invalid=1034, Unknown=0, NotChecked=0, Total=1122 [2018-02-02 10:24:04,538 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 174 states. [2018-02-02 10:24:04,539 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 174 to 174. [2018-02-02 10:24:04,539 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 174 states. [2018-02-02 10:24:04,540 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 174 states to 174 states and 183 transitions. [2018-02-02 10:24:04,540 INFO L78 Accepts]: Start accepts. Automaton has 174 states and 183 transitions. Word has length 118 [2018-02-02 10:24:04,540 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 10:24:04,540 INFO L432 AbstractCegarLoop]: Abstraction has 174 states and 183 transitions. [2018-02-02 10:24:04,540 INFO L433 AbstractCegarLoop]: Interpolant automaton has 24 states. [2018-02-02 10:24:04,540 INFO L276 IsEmpty]: Start isEmpty. Operand 174 states and 183 transitions. [2018-02-02 10:24:04,541 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 121 [2018-02-02 10:24:04,541 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 10:24:04,541 INFO L351 BasicCegarLoop]: trace histogram [16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-02 10:24:04,541 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:24:04,541 INFO L82 PathProgramCache]: Analyzing trace with hash -956354475, now seen corresponding path program 1 times [2018-02-02 10:24:04,542 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 10:24:04,581 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 10:24:04,582 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:06,128 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:24:06,129 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-02 10:24:06,129 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [51] imperfect sequences [] total 51 [2018-02-02 10:24:06,129 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 10:24:06,129 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:06,129 INFO L182 omatonBuilderFactory]: Interpolants [13696#(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)))), 13697#(or (= 1 (select (select |#memory_int| |ldv_kobject_init_internal_#in~kobj.base|) (- (- 12)))) (not (= |ldv_kobject_init_internal_#in~kobj.offset| 0))), 13698#(or (= 1 (select (select |#memory_int| |ldv_kobject_init_#in~kobj.base|) (- (- 12)))) (not (= |ldv_kobject_init_#in~kobj.offset| 0))), 13699#(and (= 0 ldv_kobject_create_~kobj~1.offset) (= 1 (select (select |#memory_int| ldv_kobject_create_~kobj~1.base) 12))), 13700#(and (= 1 (select (select |#memory_int| |ldv_kobject_create_#res.base|) 12)) (= 0 |ldv_kobject_create_#res.offset|)), 13701#(and (= 0 |entry_point_#t~ret20.offset|) (= 1 (select (select |#memory_int| |entry_point_#t~ret20.base|) 12))), 13702#(and (= 0 entry_point_~kobj~2.offset) (= 1 (select (select |#memory_int| entry_point_~kobj~2.base) 12))), 13703#(and (= |f_22_get_#in~kobj.base| f_22_get_~kobj.base) (= |#memory_int| |old(#memory_int)|) (= f_22_get_~kobj.offset |f_22_get_#in~kobj.offset|)), 13704#(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))), 13705#(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))), 13706#(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)), 13707#(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)))), 13708#(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))), 13709#(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|)), 13710#(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))), 13711#(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))), 13712#(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|))))), 13713#(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))), 13714#(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))), 13715#(or (<= 2 (select (select |#memory_int| |f_22_get_#in~kobj.base|) (- (- 12)))) (not (= 0 |f_22_get_#in~kobj.offset|)) (not (= (select (select |old(#memory_int)| |f_22_get_#in~kobj.base|) (- (- 12))) 1))), 13716#(and (<= 2 (select (select |#memory_int| entry_point_~kobj~2.base) 12)) (= 0 entry_point_~kobj~2.offset)), 13717#(and (<= 2 (select (select |#memory_int| |f_22_put_#in~kobj.base|) 12)) (= 0 |f_22_put_#in~kobj.offset|)), 13718#(and (= 0 f_22_put_~kobj.offset) (<= 2 (select (select |#memory_int| f_22_put_~kobj.base) 12))), 13719#(and (<= 2 (select (select |#memory_int| |ldv_kobject_put_#in~kobj.base|) 12)) (= 0 |ldv_kobject_put_#in~kobj.offset|)), 13720#(and (= ldv_kobject_put_~kobj.offset 0) (<= 2 (select (select |#memory_int| ldv_kobject_put_~kobj.base) 12))), 13721#(<= 2 (select (select |#memory_int| |ldv_kref_put_#in~kref.base|) |ldv_kref_put_#in~kref.offset|)), 13722#(<= 2 (select (select |#memory_int| ldv_kref_put_~kref.base) ldv_kref_put_~kref.offset)), 13723#(and (<= 2 (select (select |#memory_int| |ldv_kref_sub_#in~kref.base|) |ldv_kref_sub_#in~kref.offset|)) (= 1 |ldv_kref_sub_#in~count|)), 13724#(and (= ldv_kref_sub_~count 1) (<= 2 (select (select |#memory_int| ldv_kref_sub_~kref.base) ldv_kref_sub_~kref.offset))), 13725#(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|)), 13726#(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|)), 13727#(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|)), 13728#(<= (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)), 13729#(<= (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|)), 13730#(<= 1 |ldv_kref_sub_#t~ret11|), 13680#true, 13681#false, 13682#(= 0 |ldv_malloc_#t~malloc4.offset|), 13683#(= 0 |ldv_malloc_#res.offset|), 13684#(= 0 |ldv_kobject_create_#t~ret17.offset|), 13685#(= 0 ldv_kobject_create_~kobj~1.offset), 13686#(or (not (= |#Ultimate.C_memset_#ptr.offset| 0)) (<= |#Ultimate.C_memset_#t~loopctr21| |#Ultimate.C_memset_#amount|)), 13687#(and (= |ldv_kobject_init_#in~kobj.offset| ldv_kobject_init_~kobj.offset) (= ldv_kobject_init_~kobj.base |ldv_kobject_init_#in~kobj.base|)), 13688#(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|))), 13689#(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|))), 13690#(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|)), 13691#(= 1 (select (select |#memory_int| |ldv_kref_init_#in~kref.base|) (- (- |ldv_kref_init_#in~kref.offset|)))), 13692#(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)))), 13693#(= |#memory_int| |old(#memory_int)|), 13694#(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|)), 13695#(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|))] [2018-02-02 10:24:06,130 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:24:06,130 INFO L409 AbstractCegarLoop]: Interpolant automaton has 51 states [2018-02-02 10:24:06,130 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 51 interpolants. [2018-02-02 10:24:06,130 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=124, Invalid=2426, Unknown=0, NotChecked=0, Total=2550 [2018-02-02 10:24:06,130 INFO L87 Difference]: Start difference. First operand 174 states and 183 transitions. Second operand 51 states. [2018-02-02 10:24:08,370 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 10:24:08,370 INFO L93 Difference]: Finished difference Result 167 states and 170 transitions. [2018-02-02 10:24:08,371 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 47 states. [2018-02-02 10:24:08,371 INFO L78 Accepts]: Start accepts. Automaton has 51 states. Word has length 120 [2018-02-02 10:24:08,371 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 10:24:08,371 INFO L225 Difference]: With dead ends: 167 [2018-02-02 10:24:08,371 INFO L226 Difference]: Without dead ends: 167 [2018-02-02 10:24:08,372 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 88 GetRequests, 9 SyntacticMatches, 5 SemanticMatches, 74 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 797 ImplicationChecksByTransitivity, 1.8s TimeCoverageRelationStatistics Valid=265, Invalid=5435, Unknown=0, NotChecked=0, Total=5700 [2018-02-02 10:24:08,373 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 167 states. [2018-02-02 10:24:08,374 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 167 to 167. [2018-02-02 10:24:08,374 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 167 states. [2018-02-02 10:24:08,374 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 167 states to 167 states and 170 transitions. [2018-02-02 10:24:08,375 INFO L78 Accepts]: Start accepts. Automaton has 167 states and 170 transitions. Word has length 120 [2018-02-02 10:24:08,375 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 10:24:08,375 INFO L432 AbstractCegarLoop]: Abstraction has 167 states and 170 transitions. [2018-02-02 10:24:08,375 INFO L433 AbstractCegarLoop]: Interpolant automaton has 51 states. [2018-02-02 10:24:08,375 INFO L276 IsEmpty]: Start isEmpty. Operand 167 states and 170 transitions. [2018-02-02 10:24:08,375 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 130 [2018-02-02 10:24:08,375 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 10:24:08,375 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, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-02 10:24:08,375 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:24:08,376 INFO L82 PathProgramCache]: Analyzing trace with hash -413026264, now seen corresponding path program 1 times [2018-02-02 10:24:08,376 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 10:24:08,388 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 10:24:08,389 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:08,582 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:24:08,582 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-02 10:24:08,582 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [20] total 20 [2018-02-02 10:24:08,582 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 10:24:08,582 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:08,582 INFO L182 omatonBuilderFactory]: Interpolants [14115#true, 14116#false, 14117#(= f_22_get_~kobj.base |f_22_get_#in~kobj.base|), 14118#(= ldv_kobject_get_~kobj.base |ldv_kobject_get_#in~kobj.base|), 14119#(= ldv_kref_get_~kref.base |ldv_kref_get_#in~kref.base|), 14120#(= ldv_atomic_add_return_~v.base |ldv_atomic_add_return_#in~v.base|), 14121#(and (= 1 (select |#valid| ldv_atomic_add_return_~v.base)) (= ldv_atomic_add_return_~v.base |ldv_atomic_add_return_#in~v.base|)), 14122#(= 1 (select |#valid| |ldv_atomic_add_return_#in~v.base|)), 14123#(= 1 (select |#valid| |ldv_kref_get_#in~kref.base|)), 14124#(= 1 (select |#valid| |ldv_kobject_get_#in~kobj.base|)), 14125#(= 1 (select |#valid| |f_22_get_#in~kobj.base|)), 14126#(= 1 (select |#valid| entry_point_~kobj~2.base)), 14127#(= |#valid| |old(#valid)|), 14128#(= 1 (select |#valid| |ldv_kobject_put_#in~kobj.base|)), 14129#(= 1 (select |#valid| ldv_kobject_put_~kobj.base)), 14130#(= 1 (select |#valid| |ldv_kref_put_#in~kref.base|)), 14131#(= 1 (select |#valid| ldv_kref_put_~kref.base)), 14132#(= 1 (select |#valid| |ldv_kref_sub_#in~kref.base|)), 14133#(= 1 (select |#valid| ldv_kref_sub_~kref.base)), 14134#(= 1 (select |#valid| |ldv_atomic_sub_return_#in~v.base|)), 14135#(= 1 (select |#valid| ldv_atomic_sub_return_~v.base))] [2018-02-02 10:24:08,583 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:24:08,583 INFO L409 AbstractCegarLoop]: Interpolant automaton has 21 states [2018-02-02 10:24:08,583 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2018-02-02 10:24:08,583 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=41, Invalid=379, Unknown=0, NotChecked=0, Total=420 [2018-02-02 10:24:08,583 INFO L87 Difference]: Start difference. First operand 167 states and 170 transitions. Second operand 21 states. [2018-02-02 10:24:09,203 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 10:24:09,203 INFO L93 Difference]: Finished difference Result 179 states and 181 transitions. [2018-02-02 10:24:09,203 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2018-02-02 10:24:09,203 INFO L78 Accepts]: Start accepts. Automaton has 21 states. Word has length 129 [2018-02-02 10:24:09,203 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 10:24:09,204 INFO L225 Difference]: With dead ends: 179 [2018-02-02 10:24:09,204 INFO L226 Difference]: Without dead ends: 179 [2018-02-02 10:24:09,204 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 44 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 36 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 169 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=127, Invalid=1279, Unknown=0, NotChecked=0, Total=1406 [2018-02-02 10:24:09,204 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 179 states. [2018-02-02 10:24:09,206 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 179 to 169. [2018-02-02 10:24:09,206 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 169 states. [2018-02-02 10:24:09,206 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 169 states to 169 states and 171 transitions. [2018-02-02 10:24:09,206 INFO L78 Accepts]: Start accepts. Automaton has 169 states and 171 transitions. Word has length 129 [2018-02-02 10:24:09,206 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 10:24:09,207 INFO L432 AbstractCegarLoop]: Abstraction has 169 states and 171 transitions. [2018-02-02 10:24:09,207 INFO L433 AbstractCegarLoop]: Interpolant automaton has 21 states. [2018-02-02 10:24:09,207 INFO L276 IsEmpty]: Start isEmpty. Operand 169 states and 171 transitions. [2018-02-02 10:24:09,207 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 144 [2018-02-02 10:24:09,207 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 10:24:09,207 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, 1, 1, 1, 1] [2018-02-02 10:24:09,207 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:24:09,207 INFO L82 PathProgramCache]: Analyzing trace with hash 687384745, now seen corresponding path program 1 times [2018-02-02 10:24:09,208 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 10:24:09,222 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 10:24:09,223 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:09,526 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:24:09,526 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-02 10:24:09,527 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [23] total 23 [2018-02-02 10:24:09,527 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 10:24:09,527 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:09,527 INFO L182 omatonBuilderFactory]: Interpolants [14528#(= 1 (select |#valid| entry_point_~kobj~2.base)), 14529#(= |#valid| |old(#valid)|), 14530#(= 1 (select |#valid| |ldv_kobject_put_#in~kobj.base|)), 14531#(= 1 (select |#valid| ldv_kobject_put_~kobj.base)), 14532#(= 1 (select |#valid| |ldv_kref_put_#in~kref.base|)), 14533#(= 1 (select |#valid| ldv_kref_put_~kref.base)), 14534#(= 1 (select |#valid| |ldv_kref_sub_#in~kref.base|)), 14535#(= 1 (select |#valid| ldv_kref_sub_~kref.base)), 14536#(= 1 (select |#valid| |##fun~$Pointer$~TO~VOID_#in~kref.base|)), 14537#(= 1 (select |#valid| |##fun~$Pointer$~TO~VOID_#~kref.base|)), 14538#(= 1 (select |#valid| |ldv_kobject_release_#in~kref.base|)), 14539#(= 1 (select |#valid| ldv_kobject_release_~kobj~0.base)), 14540#(= 1 (select |#valid| |ldv_kobject_cleanup_#in~kobj.base|)), 14541#(= 1 (select |#valid| ldv_kobject_cleanup_~kobj.base)), 14518#true, 14519#false, 14520#(= f_22_get_~kobj.base |f_22_get_#in~kobj.base|), 14521#(= ldv_kobject_get_~kobj.base |ldv_kobject_get_#in~kobj.base|), 14522#(= ldv_kref_get_~kref.base |ldv_kref_get_#in~kref.base|), 14523#(= ldv_atomic_add_return_~v.base |ldv_atomic_add_return_#in~v.base|), 14524#(= 1 (select |#valid| |ldv_atomic_add_return_#in~v.base|)), 14525#(= 1 (select |#valid| |ldv_kref_get_#in~kref.base|)), 14526#(= 1 (select |#valid| |ldv_kobject_get_#in~kobj.base|)), 14527#(= 1 (select |#valid| |f_22_get_#in~kobj.base|))] [2018-02-02 10:24:09,527 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:24:09,528 INFO L409 AbstractCegarLoop]: Interpolant automaton has 24 states [2018-02-02 10:24:09,528 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2018-02-02 10:24:09,528 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=45, Invalid=507, Unknown=0, NotChecked=0, Total=552 [2018-02-02 10:24:09,528 INFO L87 Difference]: Start difference. First operand 169 states and 171 transitions. Second operand 24 states. [2018-02-02 10:24:10,443 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 10:24:10,443 INFO L93 Difference]: Finished difference Result 178 states and 180 transitions. [2018-02-02 10:24:10,443 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2018-02-02 10:24:10,443 INFO L78 Accepts]: Start accepts. Automaton has 24 states. Word has length 143 [2018-02-02 10:24:10,444 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 10:24:10,444 INFO L225 Difference]: With dead ends: 178 [2018-02-02 10:24:10,444 INFO L226 Difference]: Without dead ends: 178 [2018-02-02 10:24:10,445 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 50 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 42 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 180 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=145, Invalid=1747, Unknown=0, NotChecked=0, Total=1892 [2018-02-02 10:24:10,445 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 178 states. [2018-02-02 10:24:10,447 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 178 to 168. [2018-02-02 10:24:10,447 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 168 states. [2018-02-02 10:24:10,448 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 168 states to 168 states and 170 transitions. [2018-02-02 10:24:10,448 INFO L78 Accepts]: Start accepts. Automaton has 168 states and 170 transitions. Word has length 143 [2018-02-02 10:24:10,448 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 10:24:10,448 INFO L432 AbstractCegarLoop]: Abstraction has 168 states and 170 transitions. [2018-02-02 10:24:10,448 INFO L433 AbstractCegarLoop]: Interpolant automaton has 24 states. [2018-02-02 10:24:10,448 INFO L276 IsEmpty]: Start isEmpty. Operand 168 states and 170 transitions. [2018-02-02 10:24:10,449 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 148 [2018-02-02 10:24:10,449 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 10:24:10,449 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, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-02 10:24:10,449 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:24:10,449 INFO L82 PathProgramCache]: Analyzing trace with hash 903271467, now seen corresponding path program 1 times [2018-02-02 10:24:10,450 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 10:24:10,532 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 10:24:10,533 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:15,475 INFO L134 CoverageAnalysis]: Checked inductivity of 152 backedges. 16 proven. 129 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2018-02-02 10:24:15,475 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-02 10:24:15,475 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [75] total 75 [2018-02-02 10:24:15,476 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 10:24:15,476 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:15,476 INFO L182 omatonBuilderFactory]: Interpolants [14976#(and (= (select |#memory_$Pointer$.offset| |f_22_get_#in~kobj.base|) (store (select |old(#memory_$Pointer$.offset)| |f_22_get_#in~kobj.base|) (@diff (select |old(#memory_$Pointer$.offset)| |f_22_get_#in~kobj.base|) (select |#memory_$Pointer$.offset| |f_22_get_#in~kobj.base|)) (select (select |#memory_$Pointer$.offset| |f_22_get_#in~kobj.base|) (@diff (select |old(#memory_$Pointer$.offset)| |f_22_get_#in~kobj.base|) (select |#memory_$Pointer$.offset| |f_22_get_#in~kobj.base|))))) (or (<= 12 (@diff (select |old(#memory_$Pointer$.offset)| |f_22_get_#in~kobj.base|) (select |#memory_$Pointer$.offset| |f_22_get_#in~kobj.base|))) (not (= 0 |f_22_get_#in~kobj.offset|)) (= (select |#memory_$Pointer$.offset| |f_22_get_#in~kobj.base|) (select |old(#memory_$Pointer$.offset)| |f_22_get_#in~kobj.base|)))), 14977#(and (= |f_22_put_#in~kobj.offset| f_22_put_~kobj.offset) (= |f_22_put_#in~kobj.base| f_22_put_~kobj.base) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|)), 14978#(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|))), 14979#(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)|)), 14980#(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)|)), 14981#(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)|)), 14982#(and (<= |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|)), 14983#(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|))))), 14984#(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|)) (<= |ldv_kref_sub_#in~kref.offset| (@diff (select |old(#memory_$Pointer$.offset)| |ldv_kref_sub_#in~kref.base|) (select |#memory_$Pointer$.offset| |ldv_kref_sub_#in~kref.base|))))), 14985#(and (or (<= |ldv_kref_put_#in~kref.offset| (@diff (select |old(#memory_$Pointer$.offset)| |ldv_kref_put_#in~kref.base|) (select |#memory_$Pointer$.offset| |ldv_kref_put_#in~kref.base|))) (= (select |old(#memory_$Pointer$.offset)| |ldv_kref_put_#in~kref.base|) (select |#memory_$Pointer$.offset| |ldv_kref_put_#in~kref.base|))) (= (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|))), 14986#(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)) (<= 12 (@diff (select |old(#memory_$Pointer$.offset)| |ldv_kobject_put_#in~kobj.base|) (select |#memory_$Pointer$.offset| |ldv_kobject_put_#in~kobj.base|))))), 14987#(and (or (not (= |f_22_put_#in~kobj.offset| 0)) (<= 12 (@diff (select |old(#memory_$Pointer$.offset)| |f_22_put_#in~kobj.base|) (select |#memory_$Pointer$.offset| |f_22_put_#in~kobj.base|))) (= (select |old(#memory_$Pointer$.offset)| |f_22_put_#in~kobj.base|) (select |#memory_$Pointer$.offset| |f_22_put_#in~kobj.base|))) (= (select |#memory_$Pointer$.offset| |f_22_put_#in~kobj.base|) (store (select |old(#memory_$Pointer$.offset)| |f_22_put_#in~kobj.base|) (@diff (select |old(#memory_$Pointer$.offset)| |f_22_put_#in~kobj.base|) (select |#memory_$Pointer$.offset| |f_22_put_#in~kobj.base|)) (select (select |#memory_$Pointer$.offset| |f_22_put_#in~kobj.base|) (@diff (select |old(#memory_$Pointer$.offset)| |f_22_put_#in~kobj.base|) (select |#memory_$Pointer$.offset| |f_22_put_#in~kobj.base|)))))), 14988#(and (= 0 |ldv_kobject_put_#in~kobj.offset|) (= 0 (select (select |#memory_$Pointer$.offset| |ldv_kobject_put_#in~kobj.base|) 0))), 14989#(and (= ldv_kobject_put_~kobj.offset 0) (= 0 (select (select |#memory_$Pointer$.offset| ldv_kobject_put_~kobj.base) 0))), 14990#(and (<= 12 |ldv_kref_put_#in~kref.offset|) (= 0 (select (select |#memory_$Pointer$.offset| |ldv_kref_put_#in~kref.base|) 0))), 14991#(and (<= 12 ldv_kref_put_~kref.offset) (= 0 (select (select |#memory_$Pointer$.offset| ldv_kref_put_~kref.base) 0))), 14992#(and (<= 12 |ldv_kref_sub_#in~kref.offset|) (= 0 (select (select |#memory_$Pointer$.offset| |ldv_kref_sub_#in~kref.base|) 0))), 14993#(and (= 0 (select (select |#memory_$Pointer$.offset| ldv_kref_sub_~kref.base) 0)) (<= 12 ldv_kref_sub_~kref.offset)), 14994#(= 0 (select (select |#memory_$Pointer$.offset| ldv_kref_sub_~kref.base) 0)), 14995#(= 0 (select (select |#memory_$Pointer$.offset| |##fun~$Pointer$~TO~VOID_#in~kref.base|) 0)), 14996#(= 0 (select (select |#memory_$Pointer$.offset| |##fun~$Pointer$~TO~VOID_#~kref.base|) 0)), 14997#(= 0 (select (select |#memory_$Pointer$.offset| |ldv_kobject_release_#in~kref.base|) 0)), 14998#(= 0 (select (select |#memory_$Pointer$.offset| ldv_kobject_release_~kobj~0.base) 0)), 14999#(= 0 (select (select |#memory_$Pointer$.offset| |ldv_kobject_cleanup_#in~kobj.base|) 0)), 15000#(or (not (= 0 ldv_kobject_cleanup_~kobj.offset)) (= 0 (select (select |#memory_$Pointer$.offset| ldv_kobject_cleanup_~kobj.base) ldv_kobject_cleanup_~kobj.offset))), 15001#(or (= 0 |ldv_kobject_cleanup_#t~mem15.offset|) (not (= 0 ldv_kobject_cleanup_~kobj.offset))), 15002#(or (not (= 0 ldv_kobject_cleanup_~kobj.offset)) (= 0 ldv_kobject_cleanup_~name~0.offset)), 15003#(= 0 ldv_kobject_cleanup_~name~0.offset), 14928#true, 14929#false, 14930#(= 0 |ldv_malloc_#t~malloc4.offset|), 14931#(= 0 |ldv_malloc_#res.offset|), 14932#(= 0 |ldv_kobject_create_#t~ret17.offset|), 14933#(= 0 ldv_kobject_create_~kobj~1.offset), 14934#(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)), 14935#(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)), 14936#(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))), 14937#(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))), 14938#(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|))), 14939#(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)), 14940#(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))), 14941#(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)), 14942#(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))), 14943#(or (not (= |#Ultimate.C_memset_#ptr.offset| 0)) (<= 11 (+ |#Ultimate.C_memset_#ptr.offset| |#Ultimate.C_memset_#t~loopctr21|)) (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)) (<= (+ |#Ultimate.C_memset_#ptr.offset| |#Ultimate.C_memset_#t~loopctr21|) 9)), 14944#(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))), 14945#(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)), 14946#(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)), 14947#(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|))), 14948#(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)), 14949#(or (<= 17 (+ |#Ultimate.C_memset_#ptr.offset| |#Ultimate.C_memset_#amount|)) (and (= 0 (select (select |#memory_$Pointer$.offset| |#Ultimate.C_memset_#ptr.base|) 0)) (<= 16 (+ |#Ultimate.C_memset_#ptr.offset| |#Ultimate.C_memset_#amount|))) (<= (+ |#Ultimate.C_memset_#ptr.offset| |#Ultimate.C_memset_#t~loopctr21|) 15) (not (= |#Ultimate.C_memset_#ptr.offset| 0)) (not (= |#Ultimate.C_memset_#value| 0))), 14950#(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))), 14951#(and (= 0 ldv_kobject_create_~kobj~1.offset) (= 0 (select (select |#memory_$Pointer$.offset| ldv_kobject_create_~kobj~1.base) 0))), 14952#(= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|), 14953#(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)), 14954#(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)))), 14955#(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)))), 14956#(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)|)), 14957#(and (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|)))) (= (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|))), 14958#(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 (= |ldv_kobject_init_internal_#in~kobj.base| ldv_kobject_init_internal_~kobj.base) (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)))) (= (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)))))))), 14959#(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)|)), 14960#(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|)), 14961#(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|))))), 14962#(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))), 14963#(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))), 14964#(and (= 0 (select (select |#memory_$Pointer$.offset| |ldv_kobject_create_#res.base|) 0)) (= 0 |ldv_kobject_create_#res.offset|)), 14965#(and (= 0 |entry_point_#t~ret20.offset|) (= 0 (select (select |#memory_$Pointer$.offset| |entry_point_#t~ret20.base|) 0))), 14966#(and (= 0 entry_point_~kobj~2.offset) (= 0 (select (select |#memory_$Pointer$.offset| entry_point_~kobj~2.base) 0))), 14967#(and (= |f_22_get_#in~kobj.base| f_22_get_~kobj.base) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= f_22_get_~kobj.offset |f_22_get_#in~kobj.offset|)), 14968#(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_$Pointer$.offset| |old(#memory_$Pointer$.offset)|)), 14969#(and (= ldv_kobject_get_~kobj.base |ldv_kobject_get_#in~kobj.base|) (or (not (= 0 |ldv_kobject_get_#in~kobj.offset|)) (= ldv_kobject_get_~kobj.offset 0)) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|)), 14970#(and (= 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)|)), 14971#(and (<= |ldv_atomic_add_return_#in~v.offset| ldv_atomic_add_return_~v.offset) (= ldv_atomic_add_return_~v.base |ldv_atomic_add_return_#in~v.base|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|)), 14972#(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 (<= |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|))) (= (select |old(#memory_$Pointer$.offset)| |ldv_atomic_add_return_#in~v.base|) (select |#memory_$Pointer$.offset| |ldv_atomic_add_return_#in~v.base|)))), 14973#(and (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|))) (= (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|)))))), 14974#(and (or (= (select |#memory_$Pointer$.offset| |ldv_kobject_get_#in~kobj.base|) (select |old(#memory_$Pointer$.offset)| |ldv_kobject_get_#in~kobj.base|)) (and (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|))) (not (= ldv_kobject_get_~kobj.offset 0))) (or (not (= 0 |ldv_kobject_get_#in~kobj.offset|)) (= ldv_kobject_get_~kobj.offset 0)))) (= (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|)))))), 14975#(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|))) (not (= 0 |ldv_kobject_get_#in~kobj.offset|)) (= (select |#memory_$Pointer$.offset| |ldv_kobject_get_#in~kobj.base|) (select |old(#memory_$Pointer$.offset)| |ldv_kobject_get_#in~kobj.base|))))] [2018-02-02 10:24:15,477 INFO L134 CoverageAnalysis]: Checked inductivity of 152 backedges. 16 proven. 129 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2018-02-02 10:24:15,477 INFO L409 AbstractCegarLoop]: Interpolant automaton has 76 states [2018-02-02 10:24:15,477 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 76 interpolants. [2018-02-02 10:24:15,478 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=387, Invalid=5313, Unknown=0, NotChecked=0, Total=5700 [2018-02-02 10:24:15,478 INFO L87 Difference]: Start difference. First operand 168 states and 170 transitions. Second operand 76 states. [2018-02-02 10:24:16,094 WARN L143 SmtUtils]: Spent 101ms on a formula simplification that was a NOOP. DAG size: 98 [2018-02-02 10:24:16,674 WARN L146 SmtUtils]: Spent 301ms on a formula simplification. DAG size of input: 98 DAG size of output 97 [2018-02-02 10:24:19,506 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 10:24:19,506 INFO L93 Difference]: Finished difference Result 167 states and 169 transitions. [2018-02-02 10:24:19,507 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 60 states. [2018-02-02 10:24:19,507 INFO L78 Accepts]: Start accepts. Automaton has 76 states. Word has length 147 [2018-02-02 10:24:19,507 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 10:24:19,507 INFO L225 Difference]: With dead ends: 167 [2018-02-02 10:24:19,507 INFO L226 Difference]: Without dead ends: 167 [2018-02-02 10:24:19,509 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 125 GetRequests, 21 SyntacticMatches, 3 SemanticMatches, 101 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1604 ImplicationChecksByTransitivity, 5.0s TimeCoverageRelationStatistics Valid=878, Invalid=9628, Unknown=0, NotChecked=0, Total=10506 [2018-02-02 10:24:19,509 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 167 states. [2018-02-02 10:24:19,510 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 167 to 167. [2018-02-02 10:24:19,511 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 167 states. [2018-02-02 10:24:19,511 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 167 states to 167 states and 169 transitions. [2018-02-02 10:24:19,511 INFO L78 Accepts]: Start accepts. Automaton has 167 states and 169 transitions. Word has length 147 [2018-02-02 10:24:19,511 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 10:24:19,511 INFO L432 AbstractCegarLoop]: Abstraction has 167 states and 169 transitions. [2018-02-02 10:24:19,511 INFO L433 AbstractCegarLoop]: Interpolant automaton has 76 states. [2018-02-02 10:24:19,511 INFO L276 IsEmpty]: Start isEmpty. Operand 167 states and 169 transitions. [2018-02-02 10:24:19,512 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 148 [2018-02-02 10:24:19,512 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 10:24:19,512 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, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-02 10:24:19,512 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:24:19,512 INFO L82 PathProgramCache]: Analyzing trace with hash 903271468, now seen corresponding path program 1 times [2018-02-02 10:24:19,513 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 10:24:19,560 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 10:24:19,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:24:23,834 INFO L134 CoverageAnalysis]: Checked inductivity of 152 backedges. 16 proven. 129 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2018-02-02 10:24:23,835 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-02 10:24:23,835 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [75] total 75 [2018-02-02 10:24:23,835 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 10:24:23,835 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:23,836 INFO L182 omatonBuilderFactory]: Interpolants [15392#true, 15393#false, 15394#(= 0 |ldv_malloc_#t~malloc4.offset|), 15395#(= 0 |ldv_malloc_#res.offset|), 15396#(= 0 |ldv_kobject_create_#t~ret17.offset|), 15397#(= 0 ldv_kobject_create_~kobj~1.offset), 15398#(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)), 15399#(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)), 15400#(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)), 15401#(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))), 15402#(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|))), 15403#(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)), 15404#(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|))), 15405#(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)), 15406#(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|))), 15407#(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)), 15408#(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|))), 15409#(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)), 15410#(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)), 15411#(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|))), 15412#(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)), 15413#(or (<= 17 (+ |#Ultimate.C_memset_#ptr.offset| |#Ultimate.C_memset_#amount|)) (<= (+ |#Ultimate.C_memset_#ptr.offset| |#Ultimate.C_memset_#t~loopctr21|) 15) (not (= |#Ultimate.C_memset_#ptr.offset| 0)) (and (= 0 (select (select |#memory_$Pointer$.base| |#Ultimate.C_memset_#ptr.base|) 0)) (<= 16 (+ |#Ultimate.C_memset_#ptr.offset| |#Ultimate.C_memset_#amount|)))), 15414#(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))), 15415#(and (= 0 ldv_kobject_create_~kobj~1.offset) (= 0 (select (select |#memory_$Pointer$.base| ldv_kobject_create_~kobj~1.base) 0))), 15416#(= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|), 15417#(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)), 15418#(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))), 15419#(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)))), 15420#(and (<= ldv_kref_init_~kref.offset |ldv_kref_init_#in~kref.offset|) (= |#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|)), 15421#(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|))), 15422#(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)))), 15423#(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|)), 15424#(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|)), 15425#(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|))))))), 15426#(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))), 15427#(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))), 15428#(and (= 0 (select (select |#memory_$Pointer$.base| |ldv_kobject_create_#res.base|) 0)) (= 0 |ldv_kobject_create_#res.offset|)), 15429#(and (= 0 (select (select |#memory_$Pointer$.base| |entry_point_#t~ret20.base|) 0)) (= 0 |entry_point_#t~ret20.offset|)), 15430#(and (= 0 entry_point_~kobj~2.offset) (= 0 (select (select |#memory_$Pointer$.base| entry_point_~kobj~2.base) 0))), 15431#(and (= |f_22_get_#in~kobj.base| f_22_get_~kobj.base) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= f_22_get_~kobj.offset |f_22_get_#in~kobj.offset|)), 15432#(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_$Pointer$.base| |old(#memory_$Pointer$.base)|)), 15433#(and (= ldv_kobject_get_~kobj.base |ldv_kobject_get_#in~kobj.base|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (or (not (= 0 |ldv_kobject_get_#in~kobj.offset|)) (= ldv_kobject_get_~kobj.offset 0))), 15434#(and (= 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)), 15435#(and (<= |ldv_atomic_add_return_#in~v.offset| ldv_atomic_add_return_~v.offset) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= ldv_atomic_add_return_~v.base |ldv_atomic_add_return_#in~v.base|)), 15436#(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|))), 15437#(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|)))))), 15438#(and (or (= (select |old(#memory_$Pointer$.base)| |ldv_kobject_get_#in~kobj.base|) (select |#memory_$Pointer$.base| |ldv_kobject_get_#in~kobj.base|)) (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|))) (not (= ldv_kobject_get_~kobj.offset 0))) (or (not (= 0 |ldv_kobject_get_#in~kobj.offset|)) (= ldv_kobject_get_~kobj.offset 0)))) (= (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|))), 15439#(and (or (not (= 0 |ldv_kobject_get_#in~kobj.offset|)) (= (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|))), 15440#(and (= (select |#memory_$Pointer$.base| |f_22_get_#in~kobj.base|) (store (select |old(#memory_$Pointer$.base)| |f_22_get_#in~kobj.base|) (@diff (select |old(#memory_$Pointer$.base)| |f_22_get_#in~kobj.base|) (select |#memory_$Pointer$.base| |f_22_get_#in~kobj.base|)) (select (select |#memory_$Pointer$.base| |f_22_get_#in~kobj.base|) (@diff (select |old(#memory_$Pointer$.base)| |f_22_get_#in~kobj.base|) (select |#memory_$Pointer$.base| |f_22_get_#in~kobj.base|))))) (or (<= 12 (@diff (select |old(#memory_$Pointer$.base)| |f_22_get_#in~kobj.base|) (select |#memory_$Pointer$.base| |f_22_get_#in~kobj.base|))) (not (= 0 |f_22_get_#in~kobj.offset|)) (= (select |old(#memory_$Pointer$.base)| |f_22_get_#in~kobj.base|) (select |#memory_$Pointer$.base| |f_22_get_#in~kobj.base|)))), 15441#(and (= |f_22_put_#in~kobj.offset| f_22_put_~kobj.offset) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |f_22_put_#in~kobj.base| f_22_put_~kobj.base)), 15442#(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|))), 15443#(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)|)), 15444#(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)|)), 15445#(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)|)), 15446#(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|)), 15447#(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|)))))), 15448#(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|))))), 15449#(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|)))), 15450#(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|))))), 15451#(and (or (not (= |f_22_put_#in~kobj.offset| 0)) (= (select |old(#memory_$Pointer$.base)| |f_22_put_#in~kobj.base|) (select |#memory_$Pointer$.base| |f_22_put_#in~kobj.base|)) (<= 12 (@diff (select |old(#memory_$Pointer$.base)| |f_22_put_#in~kobj.base|) (select |#memory_$Pointer$.base| |f_22_put_#in~kobj.base|)))) (= (store (select |old(#memory_$Pointer$.base)| |f_22_put_#in~kobj.base|) (@diff (select |old(#memory_$Pointer$.base)| |f_22_put_#in~kobj.base|) (select |#memory_$Pointer$.base| |f_22_put_#in~kobj.base|)) (select (select |#memory_$Pointer$.base| |f_22_put_#in~kobj.base|) (@diff (select |old(#memory_$Pointer$.base)| |f_22_put_#in~kobj.base|) (select |#memory_$Pointer$.base| |f_22_put_#in~kobj.base|)))) (select |#memory_$Pointer$.base| |f_22_put_#in~kobj.base|))), 15452#(and (= 0 |ldv_kobject_put_#in~kobj.offset|) (= 0 (select (select |#memory_$Pointer$.base| |ldv_kobject_put_#in~kobj.base|) 0))), 15453#(and (= ldv_kobject_put_~kobj.offset 0) (= 0 (select (select |#memory_$Pointer$.base| ldv_kobject_put_~kobj.base) 0))), 15454#(and (<= 12 |ldv_kref_put_#in~kref.offset|) (= 0 (select (select |#memory_$Pointer$.base| |ldv_kref_put_#in~kref.base|) 0))), 15455#(and (<= 12 ldv_kref_put_~kref.offset) (= 0 (select (select |#memory_$Pointer$.base| ldv_kref_put_~kref.base) 0))), 15456#(and (<= 12 |ldv_kref_sub_#in~kref.offset|) (= 0 (select (select |#memory_$Pointer$.base| |ldv_kref_sub_#in~kref.base|) 0))), 15457#(and (= 0 (select (select |#memory_$Pointer$.base| ldv_kref_sub_~kref.base) 0)) (<= 12 ldv_kref_sub_~kref.offset)), 15458#(= 0 (select (select |#memory_$Pointer$.base| ldv_kref_sub_~kref.base) 0)), 15459#(= 0 (select (select |#memory_$Pointer$.base| |##fun~$Pointer$~TO~VOID_#in~kref.base|) 0)), 15460#(= 0 (select (select |#memory_$Pointer$.base| |##fun~$Pointer$~TO~VOID_#~kref.base|) 0)), 15461#(= 0 (select (select |#memory_$Pointer$.base| |ldv_kobject_release_#in~kref.base|) 0)), 15462#(= 0 (select (select |#memory_$Pointer$.base| ldv_kobject_release_~kobj~0.base) 0)), 15463#(= 0 (select (select |#memory_$Pointer$.base| |ldv_kobject_cleanup_#in~kobj.base|) 0)), 15464#(or (not (= 0 ldv_kobject_cleanup_~kobj.offset)) (= 0 (select (select |#memory_$Pointer$.base| ldv_kobject_cleanup_~kobj.base) ldv_kobject_cleanup_~kobj.offset))), 15465#(or (= 0 |ldv_kobject_cleanup_#t~mem15.base|) (not (= 0 ldv_kobject_cleanup_~kobj.offset))), 15466#(or (not (= 0 ldv_kobject_cleanup_~kobj.offset)) (= ldv_kobject_cleanup_~name~0.base 0)), 15467#(= ldv_kobject_cleanup_~name~0.base 0)] [2018-02-02 10:24:23,836 INFO L134 CoverageAnalysis]: Checked inductivity of 152 backedges. 16 proven. 129 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2018-02-02 10:24:23,836 INFO L409 AbstractCegarLoop]: Interpolant automaton has 76 states [2018-02-02 10:24:23,836 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 76 interpolants. [2018-02-02 10:24:23,837 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=387, Invalid=5313, Unknown=0, NotChecked=0, Total=5700 [2018-02-02 10:24:23,837 INFO L87 Difference]: Start difference. First operand 167 states and 169 transitions. Second operand 76 states. [2018-02-02 10:24:24,877 WARN L146 SmtUtils]: Spent 248ms on a formula simplification. DAG size of input: 90 DAG size of output 89 [2018-02-02 10:24:27,570 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 10:24:27,571 INFO L93 Difference]: Finished difference Result 166 states and 168 transitions. [2018-02-02 10:24:27,571 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 60 states. [2018-02-02 10:24:27,571 INFO L78 Accepts]: Start accepts. Automaton has 76 states. Word has length 147 [2018-02-02 10:24:27,571 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 10:24:27,572 INFO L225 Difference]: With dead ends: 166 [2018-02-02 10:24:27,572 INFO L226 Difference]: Without dead ends: 166 [2018-02-02 10:24:27,573 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 125 GetRequests, 22 SyntacticMatches, 2 SemanticMatches, 101 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1593 ImplicationChecksByTransitivity, 4.2s TimeCoverageRelationStatistics Valid=878, Invalid=9628, Unknown=0, NotChecked=0, Total=10506 [2018-02-02 10:24:27,574 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 166 states. [2018-02-02 10:24:27,575 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 166 to 166. [2018-02-02 10:24:27,576 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 166 states. [2018-02-02 10:24:27,576 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 166 states to 166 states and 168 transitions. [2018-02-02 10:24:27,576 INFO L78 Accepts]: Start accepts. Automaton has 166 states and 168 transitions. Word has length 147 [2018-02-02 10:24:27,577 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 10:24:27,577 INFO L432 AbstractCegarLoop]: Abstraction has 166 states and 168 transitions. [2018-02-02 10:24:27,577 INFO L433 AbstractCegarLoop]: Interpolant automaton has 76 states. [2018-02-02 10:24:27,577 INFO L276 IsEmpty]: Start isEmpty. Operand 166 states and 168 transitions. [2018-02-02 10:24:27,577 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 148 [2018-02-02 10:24:27,578 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 10:24:27,578 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, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-02 10:24:27,578 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:24:27,578 INFO L82 PathProgramCache]: Analyzing trace with hash 560354601, now seen corresponding path program 1 times [2018-02-02 10:24:27,579 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 10:24:27,618 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 10:24:27,619 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:30,048 INFO L134 CoverageAnalysis]: Checked inductivity of 160 backedges. 19 proven. 15 refuted. 0 times theorem prover too weak. 126 trivial. 0 not checked. [2018-02-02 10:24:30,048 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-02 10:24:30,048 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [62] total 62 [2018-02-02 10:24:30,048 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 10:24:30,048 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:30,048 INFO L182 omatonBuilderFactory]: Interpolants [15872#(or (= 1 (select (select |#memory_int| |ldv_kobject_init_#in~kobj.base|) (- (- 12)))) (not (= |ldv_kobject_init_#in~kobj.offset| 0))), 15873#(and (= 0 ldv_kobject_create_~kobj~1.offset) (= 1 (select (select |#memory_int| ldv_kobject_create_~kobj~1.base) 12))), 15874#(and (= 1 (select (select |#memory_int| |ldv_kobject_create_#res.base|) 12)) (= 0 |ldv_kobject_create_#res.offset|)), 15875#(and (= 0 |entry_point_#t~ret20.offset|) (= 1 (select (select |#memory_int| |entry_point_#t~ret20.base|) 12))), 15876#(and (= 0 entry_point_~kobj~2.offset) (= 1 (select (select |#memory_int| entry_point_~kobj~2.base) 12))), 15877#(and (= |f_22_get_#in~kobj.base| f_22_get_~kobj.base) (= |#memory_int| |old(#memory_int)|) (= f_22_get_~kobj.offset |f_22_get_#in~kobj.offset|)), 15878#(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)|)), 15879#(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))), 15880#(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)), 15881#(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)))), 15882#(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 (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_#t~mem7| 1)) (= ldv_atomic_add_return_~v.base |ldv_atomic_add_return_#in~v.base|)) (not (= ldv_atomic_add_return_~i 1)))), 15883#(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|)), 15884#(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))), 15885#(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|)))))), 15886#(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|)))))), 15887#(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))), 15888#(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))), 15889#(or (not (= 0 |f_22_get_#in~kobj.offset|)) (and (<= 2 (select (select |#memory_int| |f_22_get_#in~kobj.base|) (- (- 12)))) (<= (select (select |#memory_int| |f_22_get_#in~kobj.base|) (- (- 12))) 2)) (not (= (select (select |old(#memory_int)| |f_22_get_#in~kobj.base|) (- (- 12))) 1))), 15890#(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)), 15891#(and (= |f_22_put_#in~kobj.offset| f_22_put_~kobj.offset) (= |#memory_int| |old(#memory_int)|) (= |f_22_put_#in~kobj.base| f_22_put_~kobj.base)), 15892#(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|))), 15893#(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)|)), 15894#(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|)), 15895#(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_#in~count| ldv_kref_sub_~count) (= ldv_kref_sub_~count 1))), 15896#(and (or (and (= |#memory_int| |old(#memory_int)|) (= ldv_atomic_sub_return_~v.base |ldv_atomic_sub_return_#in~v.base|)) (not (= ldv_atomic_sub_return_~i 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) (or (= ldv_atomic_sub_return_~i 1) (= ldv_atomic_sub_return_~i |ldv_atomic_sub_return_#in~i|))), 15897#(and (or (not (= ldv_atomic_sub_return_~i 1)) (and (= (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|))) (<= 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) (or (= ldv_atomic_sub_return_~i 1) (= ldv_atomic_sub_return_~i |ldv_atomic_sub_return_#in~i|))), 15898#(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) (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)) (= |#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))))), 15899#(or (not (= 1 |ldv_atomic_sub_return_#in~i|)) (and (= ldv_atomic_sub_return_~temp~1 (select (select |#memory_int| |ldv_atomic_sub_return_#in~v.base|) (- (- |ldv_atomic_sub_return_#in~v.offset|)))) (<= (+ 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)))), 15900#(or (not (= 1 |ldv_atomic_sub_return_#in~i|)) (and (<= (+ (select (select |#memory_int| |ldv_atomic_sub_return_#in~v.base|) (- (- |ldv_atomic_sub_return_#in~v.offset|))) 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|))) (+ (select (select |#memory_int| |ldv_atomic_sub_return_#in~v.base|) (- (- |ldv_atomic_sub_return_#in~v.offset|))) 1)))), 15901#(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 (= |ldv_kref_sub_#in~count| 1))), 15902#(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|))))), 15903#(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)))))), 15904#(or (not (= |f_22_put_#in~kobj.offset| 0)) (and (<= (select (select |old(#memory_int)| |f_22_put_#in~kobj.base|) (- (- 12))) (+ (select (select |#memory_int| |f_22_put_#in~kobj.base|) (- (- 12))) 1)) (<= (+ (select (select |#memory_int| |f_22_put_#in~kobj.base|) (- (- 12))) 1) (select (select |old(#memory_int)| |f_22_put_#in~kobj.base|) (- (- 12)))))), 15905#(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|))), 15906#(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)|)))), 15907#(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|)), 15908#(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|)), 15909#(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|)), 15910#(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))), 15911#(and (<= (+ |ldv_atomic_sub_return_#in~i| |ldv_atomic_sub_return_#res|) (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_#res|))), 15912#(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))), 15913#(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))), 15914#(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)), 15915#(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))), 15854#true, 15855#false, 15856#(= 0 |ldv_malloc_#t~malloc4.offset|), 15857#(= 0 |ldv_malloc_#res.offset|), 15858#(= 0 |ldv_kobject_create_#t~ret17.offset|), 15859#(= 0 ldv_kobject_create_~kobj~1.offset), 15860#(or (not (= |#Ultimate.C_memset_#ptr.offset| 0)) (<= |#Ultimate.C_memset_#t~loopctr21| |#Ultimate.C_memset_#amount|)), 15861#(and (= |ldv_kobject_init_#in~kobj.offset| ldv_kobject_init_~kobj.offset) (= ldv_kobject_init_~kobj.base |ldv_kobject_init_#in~kobj.base|)), 15862#(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|)), 15863#(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|)), 15864#(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|)), 15865#(= 1 (select (select |#memory_int| |ldv_kref_init_#in~kref.base|) (- (- |ldv_kref_init_#in~kref.offset|)))), 15866#(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)))), 15867#(= |#memory_int| |old(#memory_int)|), 15868#(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|)), 15869#(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|)), 15870#(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)))), 15871#(or (= 1 (select (select |#memory_int| |ldv_kobject_init_internal_#in~kobj.base|) (- (- 12)))) (not (= |ldv_kobject_init_internal_#in~kobj.offset| 0)))] [2018-02-02 10:24:30,049 INFO L134 CoverageAnalysis]: Checked inductivity of 160 backedges. 19 proven. 15 refuted. 0 times theorem prover too weak. 126 trivial. 0 not checked. [2018-02-02 10:24:30,049 INFO L409 AbstractCegarLoop]: Interpolant automaton has 62 states [2018-02-02 10:24:30,049 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 62 interpolants. [2018-02-02 10:24:30,049 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=167, Invalid=3615, Unknown=0, NotChecked=0, Total=3782 [2018-02-02 10:24:30,049 INFO L87 Difference]: Start difference. First operand 166 states and 168 transitions. Second operand 62 states. [2018-02-02 10:24:32,610 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 10:24:32,610 INFO L93 Difference]: Finished difference Result 174 states and 175 transitions. [2018-02-02 10:24:32,610 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 50 states. [2018-02-02 10:24:32,610 INFO L78 Accepts]: Start accepts. Automaton has 62 states. Word has length 147 [2018-02-02 10:24:32,610 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 10:24:32,611 INFO L225 Difference]: With dead ends: 174 [2018-02-02 10:24:32,611 INFO L226 Difference]: Without dead ends: 166 [2018-02-02 10:24:32,611 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 107 GetRequests, 16 SyntacticMatches, 9 SemanticMatches, 82 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1119 ImplicationChecksByTransitivity, 2.5s TimeCoverageRelationStatistics Valid=285, Invalid=6687, Unknown=0, NotChecked=0, Total=6972 [2018-02-02 10:24:32,612 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 166 states. [2018-02-02 10:24:32,613 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 166 to 166. [2018-02-02 10:24:32,613 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 166 states. [2018-02-02 10:24:32,613 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 166 states to 166 states and 167 transitions. [2018-02-02 10:24:32,613 INFO L78 Accepts]: Start accepts. Automaton has 166 states and 167 transitions. Word has length 147 [2018-02-02 10:24:32,614 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 10:24:32,614 INFO L432 AbstractCegarLoop]: Abstraction has 166 states and 167 transitions. [2018-02-02 10:24:32,614 INFO L433 AbstractCegarLoop]: Interpolant automaton has 62 states. [2018-02-02 10:24:32,614 INFO L276 IsEmpty]: Start isEmpty. Operand 166 states and 167 transitions. [2018-02-02 10:24:32,614 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 165 [2018-02-02 10:24:32,614 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 10:24:32,614 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, 1, 1, 1, 1, 1, 1, 1] [2018-02-02 10:24:32,615 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:32,615 INFO L82 PathProgramCache]: Analyzing trace with hash -776492123, now seen corresponding path program 1 times [2018-02-02 10:24:32,615 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 10:24:32,635 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 10:24:32,636 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:33,140 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:33,140 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-02 10:24:33,140 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [21] total 21 [2018-02-02 10:24:33,143 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 10:24:33,143 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 10:24:33,143 INFO L182 omatonBuilderFactory]: Interpolants [16320#(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|)))), 16321#(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|)), 16300#true, 16301#false, 16302#(= |#valid| |old(#valid)|), 16303#(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))), 16304#(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))), 16305#(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)|)), 16306#(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))), 16307#(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))), 16308#(and (= 0 (select |old(#valid)| |entry_point_#t~ret20.base|)) (= (store |#valid| |entry_point_#t~ret20.base| (select |old(#valid)| |entry_point_#t~ret20.base|)) |old(#valid)|) (not (= |entry_point_#t~ret20.base| 0))), 16309#(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))), 16310#(and (= |#valid| |old(#valid)|) (= |ldv_kobject_put_#in~kobj.base| ldv_kobject_put_~kobj.base)), 16311#(and (= |#valid| |old(#valid)|) (= ldv_kref_put_~kref.base |ldv_kref_put_#in~kref.base|)), 16312#(and (= |#valid| |old(#valid)|) (= ldv_kref_sub_~kref.base |ldv_kref_sub_#in~kref.base|)), 16313#(and (= |#valid| |old(#valid)|) (= |##fun~$Pointer$~TO~VOID_#in~kref.base| |##fun~$Pointer$~TO~VOID_#~kref.base|)), 16314#(and (= |#valid| |old(#valid)|) (= |ldv_kobject_release_#in~kref.base| ldv_kobject_release_~kobj~0.base)), 16315#(and (= ldv_kobject_cleanup_~kobj.base |ldv_kobject_cleanup_#in~kobj.base|) (= |#valid| |old(#valid)|)), 16316#(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|))))), 16317#(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|)))), 16318#(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|)), 16319#(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|))] [2018-02-02 10:24:33,143 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:33,144 INFO L409 AbstractCegarLoop]: Interpolant automaton has 22 states [2018-02-02 10:24:33,144 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2018-02-02 10:24:33,144 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=415, Unknown=0, NotChecked=0, Total=462 [2018-02-02 10:24:33,144 INFO L87 Difference]: Start difference. First operand 166 states and 167 transitions. Second operand 22 states. [2018-02-02 10:24:33,892 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 10:24:33,892 INFO L93 Difference]: Finished difference Result 184 states and 184 transitions. [2018-02-02 10:24:33,892 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2018-02-02 10:24:33,892 INFO L78 Accepts]: Start accepts. Automaton has 22 states. Word has length 164 [2018-02-02 10:24:33,892 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 10:24:33,893 INFO L225 Difference]: With dead ends: 184 [2018-02-02 10:24:33,893 INFO L226 Difference]: Without dead ends: 166 [2018-02-02 10:24:33,893 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 43 GetRequests, 19 SyntacticMatches, 1 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 57 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=59, Invalid=541, Unknown=0, NotChecked=0, Total=600 [2018-02-02 10:24:33,894 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 166 states. [2018-02-02 10:24:33,895 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 166 to 166. [2018-02-02 10:24:33,895 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 166 states. [2018-02-02 10:24:33,896 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 166 states to 166 states and 166 transitions. [2018-02-02 10:24:33,896 INFO L78 Accepts]: Start accepts. Automaton has 166 states and 166 transitions. Word has length 164 [2018-02-02 10:24:33,896 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 10:24:33,896 INFO L432 AbstractCegarLoop]: Abstraction has 166 states and 166 transitions. [2018-02-02 10:24:33,896 INFO L433 AbstractCegarLoop]: Interpolant automaton has 22 states. [2018-02-02 10:24:33,896 INFO L276 IsEmpty]: Start isEmpty. Operand 166 states and 166 transitions. [2018-02-02 10:24:33,896 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 166 [2018-02-02 10:24:33,897 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 10:24:33,897 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, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-02 10:24:33,897 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:33,897 INFO L82 PathProgramCache]: Analyzing trace with hash 504328033, now seen corresponding path program 1 times [2018-02-02 10:24:33,897 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 10:24:33,938 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 10:24:33,940 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. Received shutdown request... [2018-02-02 10:24:37,826 WARN L491 AbstractCegarLoop]: Verification canceled [2018-02-02 10:24:37,830 WARN L185 ceAbstractionStarter]: Timeout [2018-02-02 10:24:37,830 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 02.02 10:24:37 BoogieIcfgContainer [2018-02-02 10:24:37,830 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-02-02 10:24:37,831 INFO L168 Benchmark]: Toolchain (without parser) took 44993.60 ms. Allocated memory was 403.2 MB in the beginning and 2.0 GB in the end (delta: 1.6 GB). Free memory was 360.1 MB in the beginning and 1.9 GB in the end (delta: -1.5 GB). Peak memory consumption was 1.5 GB. Max. memory is 5.3 GB. [2018-02-02 10:24:37,832 INFO L168 Benchmark]: CDTParser took 0.15 ms. Allocated memory is still 403.2 MB. Free memory is still 366.7 MB. There was no memory consumed. Max. memory is 5.3 GB. [2018-02-02 10:24:37,832 INFO L168 Benchmark]: CACSL2BoogieTranslator took 190.60 ms. Allocated memory is still 403.2 MB. Free memory was 360.1 MB in the beginning and 345.5 MB in the end (delta: 14.5 MB). Peak memory consumption was 14.5 MB. Max. memory is 5.3 GB. [2018-02-02 10:24:37,832 INFO L168 Benchmark]: Boogie Preprocessor took 33.63 ms. Allocated memory is still 403.2 MB. Free memory was 345.5 MB in the beginning and 344.2 MB in the end (delta: 1.3 MB). Peak memory consumption was 1.3 MB. Max. memory is 5.3 GB. [2018-02-02 10:24:37,833 INFO L168 Benchmark]: RCFGBuilder took 361.67 ms. Allocated memory is still 403.2 MB. Free memory was 344.2 MB in the beginning and 306.2 MB in the end (delta: 38.0 MB). Peak memory consumption was 38.0 MB. Max. memory is 5.3 GB. [2018-02-02 10:24:37,833 INFO L168 Benchmark]: TraceAbstraction took 44404.65 ms. Allocated memory was 403.2 MB in the beginning and 2.0 GB in the end (delta: 1.6 GB). Free memory was 306.2 MB in the beginning and 1.9 GB in the end (delta: -1.6 GB). Peak memory consumption was 1.4 GB. Max. memory is 5.3 GB. [2018-02-02 10:24:37,834 INFO L344 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.15 ms. Allocated memory is still 403.2 MB. Free memory is still 366.7 MB. There was no memory consumed. Max. memory is 5.3 GB. * CACSL2BoogieTranslator took 190.60 ms. Allocated memory is still 403.2 MB. Free memory was 360.1 MB in the beginning and 345.5 MB in the end (delta: 14.5 MB). Peak memory consumption was 14.5 MB. Max. memory is 5.3 GB. * Boogie Preprocessor took 33.63 ms. Allocated memory is still 403.2 MB. Free memory was 345.5 MB in the beginning and 344.2 MB in the end (delta: 1.3 MB). Peak memory consumption was 1.3 MB. Max. memory is 5.3 GB. * RCFGBuilder took 361.67 ms. Allocated memory is still 403.2 MB. Free memory was 344.2 MB in the beginning and 306.2 MB in the end (delta: 38.0 MB). Peak memory consumption was 38.0 MB. Max. memory is 5.3 GB. * TraceAbstraction took 44404.65 ms. Allocated memory was 403.2 MB in the beginning and 2.0 GB in the end (delta: 1.6 GB). Free memory was 306.2 MB in the beginning and 1.9 GB in the end (delta: -1.6 GB). Peak memory consumption was 1.4 GB. Max. memory is 5.3 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 1294). Cancelled while BasicCegarLoop was analyzing trace of length 166 with TraceHistMax 16, while InterpolatingTraceCheckCraig was constructing Craig interpolants, while PredicateComparison was comparing new predicate (quantifier-free) to 71 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 1294). Cancelled while BasicCegarLoop was analyzing trace of length 166 with TraceHistMax 16, while InterpolatingTraceCheckCraig was constructing Craig interpolants, while PredicateComparison was comparing new predicate (quantifier-free) to 71 known predicates. - TimeoutResultAtElement [Line: -1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 1411). Cancelled while BasicCegarLoop was analyzing trace of length 166 with TraceHistMax 16, while InterpolatingTraceCheckCraig was constructing Craig interpolants, while PredicateComparison was comparing new predicate (quantifier-free) to 71 known predicates. - TimeoutResultAtElement [Line: -1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 1411). Cancelled while BasicCegarLoop was analyzing trace of length 166 with TraceHistMax 16, while InterpolatingTraceCheckCraig was constructing Craig interpolants, while PredicateComparison was comparing new predicate (quantifier-free) to 71 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 1265). Cancelled while BasicCegarLoop was analyzing trace of length 166 with TraceHistMax 16, while InterpolatingTraceCheckCraig was constructing Craig interpolants, while PredicateComparison was comparing new predicate (quantifier-free) to 71 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 1265). Cancelled while BasicCegarLoop was analyzing trace of length 166 with TraceHistMax 16, while InterpolatingTraceCheckCraig was constructing Craig interpolants, while PredicateComparison was comparing new predicate (quantifier-free) to 71 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 1267). Cancelled while BasicCegarLoop was analyzing trace of length 166 with TraceHistMax 16, while InterpolatingTraceCheckCraig was constructing Craig interpolants, while PredicateComparison was comparing new predicate (quantifier-free) to 71 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 1267). Cancelled while BasicCegarLoop was analyzing trace of length 166 with TraceHistMax 16, while InterpolatingTraceCheckCraig was constructing Craig interpolants, while PredicateComparison was comparing new predicate (quantifier-free) to 71 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 1256). Cancelled while BasicCegarLoop was analyzing trace of length 166 with TraceHistMax 16, while InterpolatingTraceCheckCraig was constructing Craig interpolants, while PredicateComparison was comparing new predicate (quantifier-free) to 71 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 1256). Cancelled while BasicCegarLoop was analyzing trace of length 166 with TraceHistMax 16, while InterpolatingTraceCheckCraig was constructing Craig interpolants, while PredicateComparison was comparing new predicate (quantifier-free) to 71 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 1258). Cancelled while BasicCegarLoop was analyzing trace of length 166 with TraceHistMax 16, while InterpolatingTraceCheckCraig was constructing Craig interpolants, while PredicateComparison was comparing new predicate (quantifier-free) to 71 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 1258). Cancelled while BasicCegarLoop was analyzing trace of length 166 with TraceHistMax 16, while InterpolatingTraceCheckCraig was constructing Craig interpolants, while PredicateComparison was comparing new predicate (quantifier-free) to 71 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that free always succeeds (line 1344). Cancelled while BasicCegarLoop was analyzing trace of length 166 with TraceHistMax 16, while InterpolatingTraceCheckCraig was constructing Craig interpolants, while PredicateComparison was comparing new predicate (quantifier-free) to 71 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that free always succeeds (line 1340). Cancelled while BasicCegarLoop was analyzing trace of length 166 with TraceHistMax 16, while InterpolatingTraceCheckCraig was constructing Craig interpolants, while PredicateComparison was comparing new predicate (quantifier-free) to 71 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that free always succeeds (line 1344). Cancelled while BasicCegarLoop was analyzing trace of length 166 with TraceHistMax 16, while InterpolatingTraceCheckCraig was constructing Craig interpolants, while PredicateComparison was comparing new predicate (quantifier-free) to 71 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that free always succeeds (line 1340). Cancelled while BasicCegarLoop was analyzing trace of length 166 with TraceHistMax 16, while InterpolatingTraceCheckCraig was constructing Craig interpolants, while PredicateComparison was comparing new predicate (quantifier-free) to 71 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 1339). Cancelled while BasicCegarLoop was analyzing trace of length 166 with TraceHistMax 16, while InterpolatingTraceCheckCraig was constructing Craig interpolants, while PredicateComparison was comparing new predicate (quantifier-free) to 71 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 1339). Cancelled while BasicCegarLoop was analyzing trace of length 166 with TraceHistMax 16, while InterpolatingTraceCheckCraig was constructing Craig interpolants, while PredicateComparison was comparing new predicate (quantifier-free) to 71 known predicates. - TimeoutResultAtElement [Line: 1452]: Timeout (TraceAbstraction) Unable to prove that all allocated memory was freed (line 1452). Cancelled while BasicCegarLoop was analyzing trace of length 166 with TraceHistMax 16, while InterpolatingTraceCheckCraig was constructing Craig interpolants, while PredicateComparison was comparing new predicate (quantifier-free) to 71 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 1099). Cancelled while BasicCegarLoop was analyzing trace of length 166 with TraceHistMax 16, while InterpolatingTraceCheckCraig was constructing Craig interpolants, while PredicateComparison was comparing new predicate (quantifier-free) to 71 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 1100). Cancelled while BasicCegarLoop was analyzing trace of length 166 with TraceHistMax 16, while InterpolatingTraceCheckCraig was constructing Craig interpolants, while PredicateComparison was comparing new predicate (quantifier-free) to 71 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 1100). Cancelled while BasicCegarLoop was analyzing trace of length 166 with TraceHistMax 16, while InterpolatingTraceCheckCraig was constructing Craig interpolants, while PredicateComparison was comparing new predicate (quantifier-free) to 71 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 1099). Cancelled while BasicCegarLoop was analyzing trace of length 166 with TraceHistMax 16, while InterpolatingTraceCheckCraig was constructing Craig interpolants, while PredicateComparison was comparing new predicate (quantifier-free) to 71 known predicates. - StatisticsResult: Ultimate Automizer benchmark data CFG has 23 procedures, 151 locations, 23 error locations. TIMEOUT Result, 44.3s OverallTime, 46 OverallIterations, 16 TraceHistogramMax, 20.3s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 6021 SDtfs, 1608 SDslu, 57456 SDs, 0 SdLazy, 31350 SolverSat, 879 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 12.3s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 1166 GetRequests, 184 SyntacticMatches, 20 SemanticMatches, 962 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6009 ImplicationChecksByTransitivity, 18.7s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=186occurred in iteration=19, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 2674/3651 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s AbstIntTime, 0 AbstIntIterations, 0 AbstIntStrong, NaN AbsIntWeakeningRatio, NaN AbsIntAvgWeakeningVarsNumRemoved, NaN AbsIntAvgWeakenedConjuncts, 0.0s DumpTime, AutomataMinimizationStatistics: 0.1s AutomataMinimizationTime, 45 MinimizatonAttempts, 56 StatesRemovedByMinimization, 10 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.1s SsaConstructionTime, 0.6s SatisfiabilityAnalysisTime, 18.5s InterpolantComputationTime, 3106 NumberOfCodeBlocks, 3106 NumberOfCodeBlocksAsserted, 45 NumberOfCheckSat, 3061 ConstructedInterpolants, 0 QuantifiedInterpolants, 2597776 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 45 InterpolantComputations, 24 PerfectInterpolantSequences, 2674/3651 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate could not prove your program: Timeout Written .csv to /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/memleaks_test22_3_true-valid-memsafety_true-termination.i_svcomp-DerefFreeMemtrack-32bit-Automizer_SmtInterpol_Array.epf_AutomizerC.xml/Csv-Benchmark-0-2018-02-02_10-24-37-840.csv Written .csv to /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/memleaks_test22_3_true-valid-memsafety_true-termination.i_svcomp-DerefFreeMemtrack-32bit-Automizer_SmtInterpol_Array.epf_AutomizerC.xml/Csv-TraceAbstractionBenchmarks-0-2018-02-02_10-24-37-840.csv Completed graceful shutdown