java -Xmx6000000000 -jar ./plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data ./data --generate-csv --csv-dir ../../../releaseScripts/default/UAutomizer-linux/csv -tc ../../../trunk/examples/toolchains/AutomizerC.xml -s ../../../trunk/examples/settings/cade18-smtinterpol/svcomp-DerefFreeMemtrack-32bit-Automizer_SmtInterpol_Array.epf -i ../../../trunk/examples/svcomp/ldv-memsafety/memleaks_test22_1_true-valid-memsafety_true-termination.i -------------------------------------------------------------------------------- This is Ultimate 0.1.23-ccafca9-m [2018-02-04 03:22:40,197 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-02-04 03:22:40,198 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-02-04 03:22:40,211 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-02-04 03:22:40,212 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-02-04 03:22:40,212 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-02-04 03:22:40,213 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-02-04 03:22:40,215 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-02-04 03:22:40,216 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-02-04 03:22:40,217 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-02-04 03:22:40,218 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-02-04 03:22:40,218 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-02-04 03:22:40,219 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-02-04 03:22:40,221 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-02-04 03:22:40,222 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-02-04 03:22:40,224 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-02-04 03:22:40,226 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-02-04 03:22:40,228 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-02-04 03:22:40,229 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-02-04 03:22:40,230 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-02-04 03:22:40,231 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-02-04 03:22:40,231 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-02-04 03:22:40,232 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-02-04 03:22:40,232 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-02-04 03:22:40,233 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-02-04 03:22:40,234 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-02-04 03:22:40,234 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-02-04 03:22:40,235 INFO L177 SettingsManager]: PEA to Boogie provides no preferences, ignoring... [2018-02-04 03:22:40,235 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-02-04 03:22:40,235 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-02-04 03:22:40,235 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-02-04 03:22:40,235 INFO L98 SettingsManager]: Beginning loading settings from /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/cade18-smtinterpol/svcomp-DerefFreeMemtrack-32bit-Automizer_SmtInterpol_Array.epf [2018-02-04 03:22:40,245 INFO L110 SettingsManager]: Loading preferences was successful [2018-02-04 03:22:40,245 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-02-04 03:22:40,246 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-02-04 03:22:40,246 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-02-04 03:22:40,247 INFO L133 SettingsManager]: * Use SBE=true [2018-02-04 03:22:40,247 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-02-04 03:22:40,247 INFO L133 SettingsManager]: * sizeof long=4 [2018-02-04 03:22:40,247 INFO L133 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2018-02-04 03:22:40,247 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-02-04 03:22:40,247 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-02-04 03:22:40,248 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-02-04 03:22:40,248 INFO L133 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2018-02-04 03:22:40,248 INFO L133 SettingsManager]: * Bitprecise bitfields=true [2018-02-04 03:22:40,248 INFO L133 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2018-02-04 03:22:40,248 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-02-04 03:22:40,248 INFO L133 SettingsManager]: * sizeof long double=12 [2018-02-04 03:22:40,248 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-02-04 03:22:40,248 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-02-04 03:22:40,248 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-02-04 03:22:40,248 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-02-04 03:22:40,249 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-02-04 03:22:40,249 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-02-04 03:22:40,249 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=Craig_TreeInterpolation [2018-02-04 03:22:40,277 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-02-04 03:22:40,285 INFO L266 ainManager$Toolchain]: [Toolchain 1]: Parser(s) successfully initialized [2018-02-04 03:22:40,288 INFO L222 ainManager$Toolchain]: [Toolchain 1]: Toolchain data selected. [2018-02-04 03:22:40,289 INFO L271 PluginConnector]: Initializing CDTParser... [2018-02-04 03:22:40,289 INFO L276 PluginConnector]: CDTParser initialized [2018-02-04 03:22:40,290 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/ldv-memsafety/memleaks_test22_1_true-valid-memsafety_true-termination.i [2018-02-04 03:22:40,419 INFO L304 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-02-04 03:22:40,420 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2018-02-04 03:22:40,420 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-02-04 03:22:40,420 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-02-04 03:22:40,427 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-02-04 03:22:40,427 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 04.02 03:22:40" (1/1) ... [2018-02-04 03:22:40,429 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@1719b99c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.02 03:22:40, skipping insertion in model container [2018-02-04 03:22:40,429 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 04.02 03:22:40" (1/1) ... [2018-02-04 03:22:40,439 INFO L153 Dispatcher]: Using SV-COMP mode [2018-02-04 03:22:40,474 INFO L153 Dispatcher]: Using SV-COMP mode [2018-02-04 03:22:40,572 INFO L450 PostProcessor]: Settings: Checked method=main [2018-02-04 03:22:40,588 INFO L450 PostProcessor]: Settings: Checked method=main [2018-02-04 03:22:40,594 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.02 03:22:40 WrapperNode [2018-02-04 03:22:40,594 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-02-04 03:22:40,594 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-02-04 03:22:40,595 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-02-04 03:22:40,595 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-02-04 03:22:40,603 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.02 03:22:40" (1/1) ... [2018-02-04 03:22:40,604 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.02 03:22:40" (1/1) ... [2018-02-04 03:22:40,612 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.02 03:22:40" (1/1) ... [2018-02-04 03:22:40,612 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.02 03:22:40" (1/1) ... [2018-02-04 03:22:40,616 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.02 03:22:40" (1/1) ... [2018-02-04 03:22:40,618 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.02 03:22:40" (1/1) ... [2018-02-04 03:22:40,619 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.02 03:22:40" (1/1) ... [2018-02-04 03:22:40,621 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-02-04 03:22:40,621 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-02-04 03:22:40,621 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-02-04 03:22:40,621 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-02-04 03:22:40,622 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.02 03:22:40" (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-04 03:22:40,655 INFO L136 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-02-04 03:22:40,655 INFO L136 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-02-04 03:22:40,655 INFO L136 BoogieDeclarations]: Found implementation of procedure ##fun~$Pointer$~TO~VOID [2018-02-04 03:22:40,656 INFO L136 BoogieDeclarations]: Found implementation of procedure ldv_malloc [2018-02-04 03:22:40,656 INFO L136 BoogieDeclarations]: Found implementation of procedure LDV_INIT_LIST_HEAD [2018-02-04 03:22:40,656 INFO L136 BoogieDeclarations]: Found implementation of procedure ldv_atomic_sub_return [2018-02-04 03:22:40,656 INFO L136 BoogieDeclarations]: Found implementation of procedure ldv_kref_sub [2018-02-04 03:22:40,656 INFO L136 BoogieDeclarations]: Found implementation of procedure ldv_kref_init [2018-02-04 03:22:40,656 INFO L136 BoogieDeclarations]: Found implementation of procedure ldv_kref_put [2018-02-04 03:22:40,656 INFO L136 BoogieDeclarations]: Found implementation of procedure ldv_kobject_cleanup [2018-02-04 03:22:40,656 INFO L136 BoogieDeclarations]: Found implementation of procedure ldv_kobject_release [2018-02-04 03:22:40,656 INFO L136 BoogieDeclarations]: Found implementation of procedure ldv_kobject_put [2018-02-04 03:22:40,657 INFO L136 BoogieDeclarations]: Found implementation of procedure ldv_kobject_init_internal [2018-02-04 03:22:40,657 INFO L136 BoogieDeclarations]: Found implementation of procedure ldv_kobject_init [2018-02-04 03:22:40,657 INFO L136 BoogieDeclarations]: Found implementation of procedure ldv_kobject_create [2018-02-04 03:22:40,657 INFO L136 BoogieDeclarations]: Found implementation of procedure entry_point [2018-02-04 03:22:40,657 INFO L136 BoogieDeclarations]: Found implementation of procedure main [2018-02-04 03:22:40,657 INFO L128 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2018-02-04 03:22:40,657 INFO L128 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2018-02-04 03:22:40,658 INFO L128 BoogieDeclarations]: Found specification of procedure write~int [2018-02-04 03:22:40,658 INFO L128 BoogieDeclarations]: Found specification of procedure read~int [2018-02-04 03:22:40,658 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.free [2018-02-04 03:22:40,658 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2018-02-04 03:22:40,658 INFO L128 BoogieDeclarations]: Found specification of procedure #Ultimate.alloc [2018-02-04 03:22:40,658 INFO L128 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memset [2018-02-04 03:22:40,658 INFO L136 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memset [2018-02-04 03:22:40,658 INFO L128 BoogieDeclarations]: Found specification of procedure malloc [2018-02-04 03:22:40,658 INFO L128 BoogieDeclarations]: Found specification of procedure free [2018-02-04 03:22:40,659 INFO L128 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2018-02-04 03:22:40,659 INFO L128 BoogieDeclarations]: Found specification of procedure memset [2018-02-04 03:22:40,659 INFO L128 BoogieDeclarations]: Found specification of procedure ldv_malloc [2018-02-04 03:22:40,659 INFO L128 BoogieDeclarations]: Found specification of procedure LDV_INIT_LIST_HEAD [2018-02-04 03:22:40,659 INFO L128 BoogieDeclarations]: Found specification of procedure ldv_atomic_sub_return [2018-02-04 03:22:40,659 INFO L128 BoogieDeclarations]: Found specification of procedure ldv_kref_sub [2018-02-04 03:22:40,659 INFO L128 BoogieDeclarations]: Found specification of procedure ##fun~$Pointer$~TO~VOID [2018-02-04 03:22:40,659 INFO L128 BoogieDeclarations]: Found specification of procedure ldv_kref_init [2018-02-04 03:22:40,660 INFO L128 BoogieDeclarations]: Found specification of procedure ldv_kref_put [2018-02-04 03:22:40,660 INFO L128 BoogieDeclarations]: Found specification of procedure ldv_kobject_cleanup [2018-02-04 03:22:40,660 INFO L128 BoogieDeclarations]: Found specification of procedure ldv_kobject_release [2018-02-04 03:22:40,660 INFO L128 BoogieDeclarations]: Found specification of procedure ldv_kobject_put [2018-02-04 03:22:40,660 INFO L128 BoogieDeclarations]: Found specification of procedure ldv_kobject_init_internal [2018-02-04 03:22:40,660 INFO L128 BoogieDeclarations]: Found specification of procedure ldv_kobject_init [2018-02-04 03:22:40,660 INFO L128 BoogieDeclarations]: Found specification of procedure ldv_kobject_create [2018-02-04 03:22:40,660 INFO L128 BoogieDeclarations]: Found specification of procedure entry_point [2018-02-04 03:22:40,661 INFO L128 BoogieDeclarations]: Found specification of procedure main [2018-02-04 03:22:40,661 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-02-04 03:22:40,661 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-02-04 03:22:40,860 WARN L455 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2018-02-04 03:22:41,003 INFO L257 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-02-04 03:22:41,003 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 04.02 03:22:41 BoogieIcfgContainer [2018-02-04 03:22:41,003 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-02-04 03:22:41,004 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-02-04 03:22:41,004 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-02-04 03:22:41,006 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-02-04 03:22:41,007 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 04.02 03:22:40" (1/3) ... [2018-02-04 03:22:41,008 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@40875fd7 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 04.02 03:22:41, skipping insertion in model container [2018-02-04 03:22:41,008 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.02 03:22:40" (2/3) ... [2018-02-04 03:22:41,008 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@40875fd7 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 04.02 03:22:41, skipping insertion in model container [2018-02-04 03:22:41,008 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 04.02 03:22:41" (3/3) ... [2018-02-04 03:22:41,010 INFO L107 eAbstractionObserver]: Analyzing ICFG memleaks_test22_1_true-valid-memsafety_true-termination.i [2018-02-04 03:22:41,017 INFO L128 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:Craig_TreeInterpolation Determinization: PREDICATE_ABSTRACTION [2018-02-04 03:22:41,021 INFO L140 ceAbstractionStarter]: Appying trace abstraction to program that has 19 error locations. [2018-02-04 03:22:41,049 INFO L322 AbstractCegarLoop]: Interprodecural is true [2018-02-04 03:22:41,049 INFO L323 AbstractCegarLoop]: Hoare is false [2018-02-04 03:22:41,049 INFO L324 AbstractCegarLoop]: Compute interpolants for Craig_TreeInterpolation [2018-02-04 03:22:41,049 INFO L325 AbstractCegarLoop]: Backedges is CANONICAL [2018-02-04 03:22:41,049 INFO L326 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-02-04 03:22:41,050 INFO L327 AbstractCegarLoop]: Difference is false [2018-02-04 03:22:41,050 INFO L328 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-02-04 03:22:41,050 INFO L333 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-02-04 03:22:41,050 INFO L87 2NestedWordAutomaton]: Mode: main mode - execution starts in main procedure [2018-02-04 03:22:41,060 INFO L276 IsEmpty]: Start isEmpty. Operand 118 states. [2018-02-04 03:22:41,066 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2018-02-04 03:22:41,067 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 03:22:41,068 INFO L351 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 03:22:41,068 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_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-04 03:22:41,071 INFO L82 PathProgramCache]: Analyzing trace with hash -401333144, now seen corresponding path program 1 times [2018-02-04 03:22:41,114 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-04 03:22:41,153 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 03:22:41,162 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 03:22:41,280 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-04 03:22:41,282 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-04 03:22:41,282 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-02-04 03:22:41,283 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-04 03:22:41,284 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-04 03:22:41,284 INFO L182 omatonBuilderFactory]: Interpolants [121#true, 122#false, 123#(and (= 0 |ldv_malloc_#res.offset|) (= 0 |ldv_malloc_#res.base|)), 124#(and (= 0 |ldv_kobject_create_#t~ret14.base|) (= 0 |ldv_kobject_create_#t~ret14.offset|)), 125#(and (= ldv_kobject_create_~kobj~1.offset 0) (= ldv_kobject_create_~kobj~1.base 0))] [2018-02-04 03:22:41,285 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 03:22:41,285 INFO L409 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-02-04 03:22:41,363 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-02-04 03:22:41,363 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-02-04 03:22:41,365 INFO L87 Difference]: Start difference. First operand 118 states. Second operand 5 states. [2018-02-04 03:22:41,413 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 03:22:41,413 INFO L93 Difference]: Finished difference Result 124 states and 131 transitions. [2018-02-04 03:22:41,416 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-02-04 03:22:41,417 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 17 [2018-02-04 03:22:41,418 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 03:22:41,430 INFO L225 Difference]: With dead ends: 124 [2018-02-04 03:22:41,431 INFO L226 Difference]: Without dead ends: 121 [2018-02-04 03:22:41,433 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-04 03:22:41,449 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 121 states. [2018-02-04 03:22:41,468 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 121 to 119. [2018-02-04 03:22:41,469 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 119 states. [2018-02-04 03:22:41,472 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 119 states to 119 states and 126 transitions. [2018-02-04 03:22:41,473 INFO L78 Accepts]: Start accepts. Automaton has 119 states and 126 transitions. Word has length 17 [2018-02-04 03:22:41,473 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 03:22:41,474 INFO L432 AbstractCegarLoop]: Abstraction has 119 states and 126 transitions. [2018-02-04 03:22:41,474 INFO L433 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-02-04 03:22:41,474 INFO L276 IsEmpty]: Start isEmpty. Operand 119 states and 126 transitions. [2018-02-04 03:22:41,475 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2018-02-04 03:22:41,475 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 03:22:41,475 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-04 03:22:41,475 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_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-04 03:22:41,475 INFO L82 PathProgramCache]: Analyzing trace with hash 1306365930, now seen corresponding path program 1 times [2018-02-04 03:22:41,477 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-04 03:22:41,495 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 03:22:41,496 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 03:22:41,539 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-04 03:22:41,540 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-04 03:22:41,540 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-02-04 03:22:41,540 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-04 03:22:41,540 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-04 03:22:41,540 INFO L182 omatonBuilderFactory]: Interpolants [369#true, 370#false, 371#(= 1 (select |#valid| |ldv_malloc_#t~malloc4.base|)), 372#(= 1 (select |#valid| |ldv_malloc_#res.base|)), 373#(= 1 (select |#valid| |ldv_kobject_create_#t~ret14.base|)), 374#(= 1 (select |#valid| ldv_kobject_create_~kobj~1.base))] [2018-02-04 03:22:41,540 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-04 03:22:41,541 INFO L409 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-02-04 03:22:41,542 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-02-04 03:22:41,542 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-02-04 03:22:41,542 INFO L87 Difference]: Start difference. First operand 119 states and 126 transitions. Second operand 6 states. [2018-02-04 03:22:41,661 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 03:22:41,661 INFO L93 Difference]: Finished difference Result 120 states and 127 transitions. [2018-02-04 03:22:41,661 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-02-04 03:22:41,662 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 19 [2018-02-04 03:22:41,662 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 03:22:41,662 INFO L225 Difference]: With dead ends: 120 [2018-02-04 03:22:41,663 INFO L226 Difference]: Without dead ends: 120 [2018-02-04 03:22:41,663 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-04 03:22:41,663 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 120 states. [2018-02-04 03:22:41,669 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 120 to 118. [2018-02-04 03:22:41,669 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 118 states. [2018-02-04 03:22:41,671 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 118 states to 118 states and 125 transitions. [2018-02-04 03:22:41,671 INFO L78 Accepts]: Start accepts. Automaton has 118 states and 125 transitions. Word has length 19 [2018-02-04 03:22:41,671 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 03:22:41,672 INFO L432 AbstractCegarLoop]: Abstraction has 118 states and 125 transitions. [2018-02-04 03:22:41,672 INFO L433 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-02-04 03:22:41,672 INFO L276 IsEmpty]: Start isEmpty. Operand 118 states and 125 transitions. [2018-02-04 03:22:41,672 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2018-02-04 03:22:41,672 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 03:22:41,673 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-04 03:22:41,673 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_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-04 03:22:41,673 INFO L82 PathProgramCache]: Analyzing trace with hash 1306365931, now seen corresponding path program 1 times [2018-02-04 03:22:41,675 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-04 03:22:41,694 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 03:22:41,695 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 03:22:41,839 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-04 03:22:41,839 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-04 03:22:41,839 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-02-04 03:22:41,839 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-04 03:22:41,840 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-04 03:22:41,840 INFO L182 omatonBuilderFactory]: Interpolants [615#true, 616#false, 617#(and (or (< 0 (div ldv_malloc_~size 4294967296)) (and (or (<= ldv_malloc_~size |ldv_malloc_#in~size|) (<= (+ (div ldv_malloc_~size 4294967296) 1) 0)) (<= |ldv_malloc_#in~size| ldv_malloc_~size))) (or (<= ldv_malloc_~size |ldv_malloc_#in~size|) (<= (div ldv_malloc_~size 4294967296) 0))), 618#(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|))), 619#(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|))), 620#(and (<= 16 (select |#length| |ldv_kobject_create_#t~ret14.base|)) (= 0 |ldv_kobject_create_#t~ret14.offset|)), 621#(and (= ldv_kobject_create_~kobj~1.offset 0) (<= 16 (select |#length| ldv_kobject_create_~kobj~1.base)))] [2018-02-04 03:22:41,840 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-04 03:22:41,840 INFO L409 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-02-04 03:22:41,840 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-02-04 03:22:41,840 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2018-02-04 03:22:41,841 INFO L87 Difference]: Start difference. First operand 118 states and 125 transitions. Second operand 7 states. [2018-02-04 03:22:42,028 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 03:22:42,028 INFO L93 Difference]: Finished difference Result 119 states and 126 transitions. [2018-02-04 03:22:42,030 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-02-04 03:22:42,031 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 19 [2018-02-04 03:22:42,031 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 03:22:42,032 INFO L225 Difference]: With dead ends: 119 [2018-02-04 03:22:42,032 INFO L226 Difference]: Without dead ends: 119 [2018-02-04 03:22:42,032 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-04 03:22:42,033 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 119 states. [2018-02-04 03:22:42,036 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 119 to 117. [2018-02-04 03:22:42,037 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 117 states. [2018-02-04 03:22:42,037 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 117 states to 117 states and 124 transitions. [2018-02-04 03:22:42,038 INFO L78 Accepts]: Start accepts. Automaton has 117 states and 124 transitions. Word has length 19 [2018-02-04 03:22:42,038 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 03:22:42,038 INFO L432 AbstractCegarLoop]: Abstraction has 117 states and 124 transitions. [2018-02-04 03:22:42,038 INFO L433 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-02-04 03:22:42,038 INFO L276 IsEmpty]: Start isEmpty. Operand 117 states and 124 transitions. [2018-02-04 03:22:42,039 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2018-02-04 03:22:42,039 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 03:22:42,039 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-04 03:22:42,039 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_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-04 03:22:42,039 INFO L82 PathProgramCache]: Analyzing trace with hash -860603530, now seen corresponding path program 1 times [2018-02-04 03:22:42,040 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-04 03:22:42,055 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 03:22:42,056 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 03:22:42,120 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-04 03:22:42,120 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-04 03:22:42,120 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-02-04 03:22:42,120 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-04 03:22:42,121 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-04 03:22:42,121 INFO L182 omatonBuilderFactory]: Interpolants [864#(and (= 0 |ldv_kobject_create_#res.base|) (= 0 |ldv_kobject_create_#res.offset|)), 865#(and (= 0 |entry_point_#t~ret16.base|) (= 0 |entry_point_#t~ret16.offset|)), 866#(and (= 0 entry_point_~kobj~2.base) (= 0 entry_point_~kobj~2.offset)), 867#(and (= 0 |ldv_kobject_put_#in~kobj.offset|) (= 0 |ldv_kobject_put_#in~kobj.base|)), 868#(and (= ldv_kobject_put_~kobj.offset 0) (= 0 ldv_kobject_put_~kobj.base)), 862#true, 863#false] [2018-02-04 03:22:42,121 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-04 03:22:42,121 INFO L409 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-02-04 03:22:42,121 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-02-04 03:22:42,121 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2018-02-04 03:22:42,122 INFO L87 Difference]: Start difference. First operand 117 states and 124 transitions. Second operand 7 states. [2018-02-04 03:22:42,175 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 03:22:42,175 INFO L93 Difference]: Finished difference Result 129 states and 136 transitions. [2018-02-04 03:22:42,175 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-02-04 03:22:42,175 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 29 [2018-02-04 03:22:42,175 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 03:22:42,176 INFO L225 Difference]: With dead ends: 129 [2018-02-04 03:22:42,176 INFO L226 Difference]: Without dead ends: 129 [2018-02-04 03:22:42,176 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2018-02-04 03:22:42,176 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 129 states. [2018-02-04 03:22:42,179 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 129 to 125. [2018-02-04 03:22:42,180 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 125 states. [2018-02-04 03:22:42,181 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 125 states to 125 states and 132 transitions. [2018-02-04 03:22:42,181 INFO L78 Accepts]: Start accepts. Automaton has 125 states and 132 transitions. Word has length 29 [2018-02-04 03:22:42,182 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 03:22:42,182 INFO L432 AbstractCegarLoop]: Abstraction has 125 states and 132 transitions. [2018-02-04 03:22:42,182 INFO L433 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-02-04 03:22:42,182 INFO L276 IsEmpty]: Start isEmpty. Operand 125 states and 132 transitions. [2018-02-04 03:22:42,183 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2018-02-04 03:22:42,183 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 03:22:42,183 INFO L351 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 03:22:42,183 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_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-04 03:22:42,183 INFO L82 PathProgramCache]: Analyzing trace with hash 23284980, now seen corresponding path program 1 times [2018-02-04 03:22:42,184 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-04 03:22:42,191 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 03:22:42,192 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 03:22:42,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-04 03:22:42,219 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-04 03:22:42,220 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-02-04 03:22:42,220 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-04 03:22:42,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-04 03:22:42,220 INFO L182 omatonBuilderFactory]: Interpolants [1125#true, 1126#false, 1127#(= |#valid| |old(#valid)|)] [2018-02-04 03:22:42,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-04 03:22:42,221 INFO L409 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-02-04 03:22:42,221 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-02-04 03:22:42,221 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-02-04 03:22:42,221 INFO L87 Difference]: Start difference. First operand 125 states and 132 transitions. Second operand 3 states. [2018-02-04 03:22:42,303 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 03:22:42,303 INFO L93 Difference]: Finished difference Result 140 states and 147 transitions. [2018-02-04 03:22:42,303 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-02-04 03:22:42,303 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 27 [2018-02-04 03:22:42,303 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 03:22:42,304 INFO L225 Difference]: With dead ends: 140 [2018-02-04 03:22:42,304 INFO L226 Difference]: Without dead ends: 129 [2018-02-04 03:22:42,304 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-02-04 03:22:42,304 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 129 states. [2018-02-04 03:22:42,310 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 129 to 121. [2018-02-04 03:22:42,311 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 121 states. [2018-02-04 03:22:42,311 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 121 states to 121 states and 127 transitions. [2018-02-04 03:22:42,311 INFO L78 Accepts]: Start accepts. Automaton has 121 states and 127 transitions. Word has length 27 [2018-02-04 03:22:42,311 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 03:22:42,311 INFO L432 AbstractCegarLoop]: Abstraction has 121 states and 127 transitions. [2018-02-04 03:22:42,311 INFO L433 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-02-04 03:22:42,312 INFO L276 IsEmpty]: Start isEmpty. Operand 121 states and 127 transitions. [2018-02-04 03:22:42,312 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2018-02-04 03:22:42,312 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 03:22:42,312 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-04 03:22:42,312 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_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-04 03:22:42,312 INFO L82 PathProgramCache]: Analyzing trace with hash -1295663626, now seen corresponding path program 1 times [2018-02-04 03:22:42,313 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-04 03:22:42,317 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 03:22:42,318 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 03:22:42,341 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-04 03:22:42,341 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-04 03:22:42,341 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-02-04 03:22:42,341 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-04 03:22:42,342 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-04 03:22:42,342 INFO L182 omatonBuilderFactory]: Interpolants [1392#(not (= |ldv_malloc_#res.base| 0)), 1393#(not (= |ldv_kobject_create_#t~ret14.base| 0)), 1394#(not (= ldv_kobject_create_~kobj~1.base 0)), 1389#true, 1390#false, 1391#(not (= |ldv_malloc_#t~malloc4.base| 0))] [2018-02-04 03:22:42,342 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-04 03:22:42,342 INFO L409 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-02-04 03:22:42,342 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-02-04 03:22:42,342 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-02-04 03:22:42,342 INFO L87 Difference]: Start difference. First operand 121 states and 127 transitions. Second operand 6 states. [2018-02-04 03:22:42,377 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 03:22:42,377 INFO L93 Difference]: Finished difference Result 113 states and 118 transitions. [2018-02-04 03:22:42,378 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-02-04 03:22:42,378 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 29 [2018-02-04 03:22:42,378 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 03:22:42,379 INFO L225 Difference]: With dead ends: 113 [2018-02-04 03:22:42,379 INFO L226 Difference]: Without dead ends: 113 [2018-02-04 03:22:42,379 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-04 03:22:42,380 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 113 states. [2018-02-04 03:22:42,383 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 113 to 113. [2018-02-04 03:22:42,383 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 113 states. [2018-02-04 03:22:42,384 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 113 states to 113 states and 118 transitions. [2018-02-04 03:22:42,384 INFO L78 Accepts]: Start accepts. Automaton has 113 states and 118 transitions. Word has length 29 [2018-02-04 03:22:42,384 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 03:22:42,384 INFO L432 AbstractCegarLoop]: Abstraction has 113 states and 118 transitions. [2018-02-04 03:22:42,384 INFO L433 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-02-04 03:22:42,384 INFO L276 IsEmpty]: Start isEmpty. Operand 113 states and 118 transitions. [2018-02-04 03:22:42,385 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2018-02-04 03:22:42,385 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 03:22:42,385 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-04 03:22:42,385 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_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-04 03:22:42,385 INFO L82 PathProgramCache]: Analyzing trace with hash 522747174, now seen corresponding path program 1 times [2018-02-04 03:22:42,386 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-04 03:22:42,396 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 03:22:42,397 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 03:22:42,427 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 03:22:42,427 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-04 03:22:42,427 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-02-04 03:22:42,428 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-04 03:22:42,428 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 03:22:42,428 INFO L182 omatonBuilderFactory]: Interpolants [1623#true, 1624#false, 1625#(= |#Ultimate.C_memset_#t~loopctr17| 0), 1626#(<= |#Ultimate.C_memset_#amount| 0)] [2018-02-04 03:22:42,429 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-04 03:22:42,429 INFO L409 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-02-04 03:22:42,429 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-02-04 03:22:42,429 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-02-04 03:22:42,429 INFO L87 Difference]: Start difference. First operand 113 states and 118 transitions. Second operand 4 states. [2018-02-04 03:22:42,446 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 03:22:42,446 INFO L93 Difference]: Finished difference Result 116 states and 121 transitions. [2018-02-04 03:22:42,446 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-02-04 03:22:42,447 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 34 [2018-02-04 03:22:42,447 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 03:22:42,447 INFO L225 Difference]: With dead ends: 116 [2018-02-04 03:22:42,447 INFO L226 Difference]: Without dead ends: 114 [2018-02-04 03:22:42,448 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-04 03:22:42,448 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 114 states. [2018-02-04 03:22:42,451 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 114 to 114. [2018-02-04 03:22:42,452 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 114 states. [2018-02-04 03:22:42,453 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 114 states to 114 states and 119 transitions. [2018-02-04 03:22:42,453 INFO L78 Accepts]: Start accepts. Automaton has 114 states and 119 transitions. Word has length 34 [2018-02-04 03:22:42,453 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 03:22:42,453 INFO L432 AbstractCegarLoop]: Abstraction has 114 states and 119 transitions. [2018-02-04 03:22:42,454 INFO L433 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-02-04 03:22:42,454 INFO L276 IsEmpty]: Start isEmpty. Operand 114 states and 119 transitions. [2018-02-04 03:22:42,455 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2018-02-04 03:22:42,455 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 03:22:42,455 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-04 03:22:42,455 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_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-04 03:22:42,455 INFO L82 PathProgramCache]: Analyzing trace with hash -1305776369, now seen corresponding path program 1 times [2018-02-04 03:22:42,456 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-04 03:22:42,467 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 03:22:42,468 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 03:22:42,494 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-04 03:22:42,494 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-04 03:22:42,494 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5] total 5 [2018-02-04 03:22:42,494 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-04 03:22:42,495 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-04 03:22:42,495 INFO L182 omatonBuilderFactory]: Interpolants [1859#true, 1860#false, 1861#(= |#Ultimate.C_memset_#t~loopctr17| 0), 1862#(<= |#Ultimate.C_memset_#t~loopctr17| 1), 1863#(<= |#Ultimate.C_memset_#amount| 1)] [2018-02-04 03:22:42,495 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-04 03:22:42,495 INFO L409 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-02-04 03:22:42,495 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-02-04 03:22:42,495 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2018-02-04 03:22:42,495 INFO L87 Difference]: Start difference. First operand 114 states and 119 transitions. Second operand 5 states. [2018-02-04 03:22:42,510 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 03:22:42,510 INFO L93 Difference]: Finished difference Result 117 states and 122 transitions. [2018-02-04 03:22:42,510 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-02-04 03:22:42,510 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 35 [2018-02-04 03:22:42,510 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 03:22:42,511 INFO L225 Difference]: With dead ends: 117 [2018-02-04 03:22:42,511 INFO L226 Difference]: Without dead ends: 115 [2018-02-04 03:22:42,512 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-04 03:22:42,512 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 115 states. [2018-02-04 03:22:42,517 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 115 to 115. [2018-02-04 03:22:42,517 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 115 states. [2018-02-04 03:22:42,518 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 115 states to 115 states and 120 transitions. [2018-02-04 03:22:42,519 INFO L78 Accepts]: Start accepts. Automaton has 115 states and 120 transitions. Word has length 35 [2018-02-04 03:22:42,519 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 03:22:42,519 INFO L432 AbstractCegarLoop]: Abstraction has 115 states and 120 transitions. [2018-02-04 03:22:42,519 INFO L433 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-02-04 03:22:42,519 INFO L276 IsEmpty]: Start isEmpty. Operand 115 states and 120 transitions. [2018-02-04 03:22:42,520 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2018-02-04 03:22:42,520 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 03:22:42,520 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-04 03:22:42,520 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_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-04 03:22:42,521 INFO L82 PathProgramCache]: Analyzing trace with hash 2139535942, now seen corresponding path program 2 times [2018-02-04 03:22:42,522 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-04 03:22:42,533 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 03:22:42,534 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 03:22:42,563 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-04 03:22:42,563 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-04 03:22:42,563 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6] total 6 [2018-02-04 03:22:42,563 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-04 03:22:42,563 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-04 03:22:42,563 INFO L182 omatonBuilderFactory]: Interpolants [2098#true, 2099#false, 2100#(= |#Ultimate.C_memset_#t~loopctr17| 0), 2101#(<= |#Ultimate.C_memset_#t~loopctr17| 1), 2102#(<= |#Ultimate.C_memset_#t~loopctr17| 2), 2103#(<= |#Ultimate.C_memset_#amount| 2)] [2018-02-04 03:22:42,563 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-04 03:22:42,564 INFO L409 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-02-04 03:22:42,564 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-02-04 03:22:42,564 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2018-02-04 03:22:42,564 INFO L87 Difference]: Start difference. First operand 115 states and 120 transitions. Second operand 6 states. [2018-02-04 03:22:42,579 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 03:22:42,580 INFO L93 Difference]: Finished difference Result 118 states and 123 transitions. [2018-02-04 03:22:42,580 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-02-04 03:22:42,580 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 36 [2018-02-04 03:22:42,580 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 03:22:42,581 INFO L225 Difference]: With dead ends: 118 [2018-02-04 03:22:42,581 INFO L226 Difference]: Without dead ends: 116 [2018-02-04 03:22:42,582 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-04 03:22:42,582 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 116 states. [2018-02-04 03:22:42,585 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 116 to 116. [2018-02-04 03:22:42,585 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 116 states. [2018-02-04 03:22:42,586 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 116 states to 116 states and 121 transitions. [2018-02-04 03:22:42,586 INFO L78 Accepts]: Start accepts. Automaton has 116 states and 121 transitions. Word has length 36 [2018-02-04 03:22:42,586 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 03:22:42,587 INFO L432 AbstractCegarLoop]: Abstraction has 116 states and 121 transitions. [2018-02-04 03:22:42,587 INFO L433 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-02-04 03:22:42,587 INFO L276 IsEmpty]: Start isEmpty. Operand 116 states and 121 transitions. [2018-02-04 03:22:42,587 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2018-02-04 03:22:42,588 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 03:22:42,588 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-04 03:22:42,588 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_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-04 03:22:42,588 INFO L82 PathProgramCache]: Analyzing trace with hash 1570035183, now seen corresponding path program 3 times [2018-02-04 03:22:42,589 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-04 03:22:42,601 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 03:22:42,602 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 03:22:42,639 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-04 03:22:42,639 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-04 03:22:42,639 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7] total 7 [2018-02-04 03:22:42,639 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-04 03:22:42,640 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-04 03:22:42,640 INFO L182 omatonBuilderFactory]: Interpolants [2340#true, 2341#false, 2342#(= |#Ultimate.C_memset_#t~loopctr17| 0), 2343#(<= |#Ultimate.C_memset_#t~loopctr17| 1), 2344#(<= |#Ultimate.C_memset_#t~loopctr17| 2), 2345#(<= |#Ultimate.C_memset_#t~loopctr17| 3), 2346#(<= |#Ultimate.C_memset_#amount| 3)] [2018-02-04 03:22:42,640 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-04 03:22:42,640 INFO L409 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-02-04 03:22:42,640 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-02-04 03:22:42,641 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2018-02-04 03:22:42,641 INFO L87 Difference]: Start difference. First operand 116 states and 121 transitions. Second operand 7 states. [2018-02-04 03:22:42,656 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 03:22:42,656 INFO L93 Difference]: Finished difference Result 119 states and 124 transitions. [2018-02-04 03:22:42,657 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-02-04 03:22:42,657 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 37 [2018-02-04 03:22:42,657 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 03:22:42,658 INFO L225 Difference]: With dead ends: 119 [2018-02-04 03:22:42,658 INFO L226 Difference]: Without dead ends: 117 [2018-02-04 03:22:42,658 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-04 03:22:42,659 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 117 states. [2018-02-04 03:22:42,661 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 117 to 117. [2018-02-04 03:22:42,661 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 117 states. [2018-02-04 03:22:42,662 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 117 states to 117 states and 122 transitions. [2018-02-04 03:22:42,662 INFO L78 Accepts]: Start accepts. Automaton has 117 states and 122 transitions. Word has length 37 [2018-02-04 03:22:42,662 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 03:22:42,662 INFO L432 AbstractCegarLoop]: Abstraction has 117 states and 122 transitions. [2018-02-04 03:22:42,662 INFO L433 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-02-04 03:22:42,662 INFO L276 IsEmpty]: Start isEmpty. Operand 117 states and 122 transitions. [2018-02-04 03:22:42,663 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2018-02-04 03:22:42,663 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 03:22:42,663 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-04 03:22:42,663 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_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-04 03:22:42,663 INFO L82 PathProgramCache]: Analyzing trace with hash 1095380838, now seen corresponding path program 4 times [2018-02-04 03:22:42,664 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-04 03:22:42,675 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 03:22:42,676 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 03:22:42,721 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-04 03:22:42,721 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-04 03:22:42,722 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8] total 8 [2018-02-04 03:22:42,722 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-04 03:22:42,722 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-04 03:22:42,722 INFO L182 omatonBuilderFactory]: Interpolants [2592#(<= |#Ultimate.C_memset_#amount| 4), 2585#true, 2586#false, 2587#(= |#Ultimate.C_memset_#t~loopctr17| 0), 2588#(<= |#Ultimate.C_memset_#t~loopctr17| 1), 2589#(<= |#Ultimate.C_memset_#t~loopctr17| 2), 2590#(<= |#Ultimate.C_memset_#t~loopctr17| 3), 2591#(<= |#Ultimate.C_memset_#t~loopctr17| 4)] [2018-02-04 03:22:42,722 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-04 03:22:42,723 INFO L409 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-02-04 03:22:42,723 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-02-04 03:22:42,723 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2018-02-04 03:22:42,723 INFO L87 Difference]: Start difference. First operand 117 states and 122 transitions. Second operand 8 states. [2018-02-04 03:22:42,754 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 03:22:42,754 INFO L93 Difference]: Finished difference Result 120 states and 125 transitions. [2018-02-04 03:22:42,754 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-02-04 03:22:42,754 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 38 [2018-02-04 03:22:42,755 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 03:22:42,755 INFO L225 Difference]: With dead ends: 120 [2018-02-04 03:22:42,755 INFO L226 Difference]: Without dead ends: 118 [2018-02-04 03:22:42,756 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-04 03:22:42,756 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 118 states. [2018-02-04 03:22:42,758 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 118 to 118. [2018-02-04 03:22:42,758 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 118 states. [2018-02-04 03:22:42,758 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 118 states to 118 states and 123 transitions. [2018-02-04 03:22:42,759 INFO L78 Accepts]: Start accepts. Automaton has 118 states and 123 transitions. Word has length 38 [2018-02-04 03:22:42,759 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 03:22:42,759 INFO L432 AbstractCegarLoop]: Abstraction has 118 states and 123 transitions. [2018-02-04 03:22:42,759 INFO L433 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-02-04 03:22:42,759 INFO L276 IsEmpty]: Start isEmpty. Operand 118 states and 123 transitions. [2018-02-04 03:22:42,760 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2018-02-04 03:22:42,760 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 03:22:42,760 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-04 03:22:42,760 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_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-04 03:22:42,760 INFO L82 PathProgramCache]: Analyzing trace with hash -734001969, now seen corresponding path program 5 times [2018-02-04 03:22:42,761 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-04 03:22:42,771 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 03:22:42,772 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 03:22:42,823 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-04 03:22:42,823 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-04 03:22:42,824 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9] total 9 [2018-02-04 03:22:42,824 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-04 03:22:42,824 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-04 03:22:42,824 INFO L182 omatonBuilderFactory]: Interpolants [2833#true, 2834#false, 2835#(= |#Ultimate.C_memset_#t~loopctr17| 0), 2836#(<= |#Ultimate.C_memset_#t~loopctr17| 1), 2837#(<= |#Ultimate.C_memset_#t~loopctr17| 2), 2838#(<= |#Ultimate.C_memset_#t~loopctr17| 3), 2839#(<= |#Ultimate.C_memset_#t~loopctr17| 4), 2840#(<= |#Ultimate.C_memset_#t~loopctr17| 5), 2841#(<= |#Ultimate.C_memset_#amount| 5)] [2018-02-04 03:22:42,824 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-04 03:22:42,825 INFO L409 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-02-04 03:22:42,825 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-02-04 03:22:42,825 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2018-02-04 03:22:42,825 INFO L87 Difference]: Start difference. First operand 118 states and 123 transitions. Second operand 9 states. [2018-02-04 03:22:42,856 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 03:22:42,857 INFO L93 Difference]: Finished difference Result 121 states and 126 transitions. [2018-02-04 03:22:42,857 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-02-04 03:22:42,858 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 39 [2018-02-04 03:22:42,858 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 03:22:42,859 INFO L225 Difference]: With dead ends: 121 [2018-02-04 03:22:42,859 INFO L226 Difference]: Without dead ends: 119 [2018-02-04 03:22:42,859 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-04 03:22:42,860 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 119 states. [2018-02-04 03:22:42,862 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 119 to 119. [2018-02-04 03:22:42,862 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 119 states. [2018-02-04 03:22:42,863 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 119 states to 119 states and 124 transitions. [2018-02-04 03:22:42,863 INFO L78 Accepts]: Start accepts. Automaton has 119 states and 124 transitions. Word has length 39 [2018-02-04 03:22:42,863 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 03:22:42,863 INFO L432 AbstractCegarLoop]: Abstraction has 119 states and 124 transitions. [2018-02-04 03:22:42,863 INFO L433 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-02-04 03:22:42,863 INFO L276 IsEmpty]: Start isEmpty. Operand 119 states and 124 transitions. [2018-02-04 03:22:42,864 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2018-02-04 03:22:42,864 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 03:22:42,864 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-04 03:22:42,864 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_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-04 03:22:42,864 INFO L82 PathProgramCache]: Analyzing trace with hash -1610294138, now seen corresponding path program 6 times [2018-02-04 03:22:42,865 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-04 03:22:42,877 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 03:22:42,878 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 03:22:42,937 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-04 03:22:42,937 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-04 03:22:42,937 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10] total 10 [2018-02-04 03:22:42,937 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-04 03:22:42,938 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-04 03:22:42,938 INFO L182 omatonBuilderFactory]: Interpolants [3088#(<= |#Ultimate.C_memset_#t~loopctr17| 2), 3089#(<= |#Ultimate.C_memset_#t~loopctr17| 3), 3090#(<= |#Ultimate.C_memset_#t~loopctr17| 4), 3091#(<= |#Ultimate.C_memset_#t~loopctr17| 5), 3092#(<= |#Ultimate.C_memset_#t~loopctr17| 6), 3093#(<= |#Ultimate.C_memset_#amount| 6), 3084#true, 3085#false, 3086#(= |#Ultimate.C_memset_#t~loopctr17| 0), 3087#(<= |#Ultimate.C_memset_#t~loopctr17| 1)] [2018-02-04 03:22:42,938 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-04 03:22:42,938 INFO L409 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-02-04 03:22:42,938 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-02-04 03:22:42,939 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2018-02-04 03:22:42,939 INFO L87 Difference]: Start difference. First operand 119 states and 124 transitions. Second operand 10 states. [2018-02-04 03:22:42,966 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 03:22:42,966 INFO L93 Difference]: Finished difference Result 122 states and 127 transitions. [2018-02-04 03:22:42,968 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-02-04 03:22:42,968 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 40 [2018-02-04 03:22:42,968 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 03:22:42,969 INFO L225 Difference]: With dead ends: 122 [2018-02-04 03:22:42,969 INFO L226 Difference]: Without dead ends: 120 [2018-02-04 03:22:42,969 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-04 03:22:42,969 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 120 states. [2018-02-04 03:22:42,971 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 120 to 120. [2018-02-04 03:22:42,971 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 120 states. [2018-02-04 03:22:42,972 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 120 states to 120 states and 125 transitions. [2018-02-04 03:22:42,972 INFO L78 Accepts]: Start accepts. Automaton has 120 states and 125 transitions. Word has length 40 [2018-02-04 03:22:42,972 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 03:22:42,972 INFO L432 AbstractCegarLoop]: Abstraction has 120 states and 125 transitions. [2018-02-04 03:22:42,972 INFO L433 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-02-04 03:22:42,972 INFO L276 IsEmpty]: Start isEmpty. Operand 120 states and 125 transitions. [2018-02-04 03:22:42,973 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2018-02-04 03:22:42,973 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 03:22:42,973 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-04 03:22:42,973 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_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-04 03:22:42,973 INFO L82 PathProgramCache]: Analyzing trace with hash 1289419695, now seen corresponding path program 7 times [2018-02-04 03:22:42,974 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-04 03:22:42,988 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 03:22:42,989 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 03:22:43,052 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-04 03:22:43,052 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-04 03:22:43,053 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [11] total 11 [2018-02-04 03:22:43,053 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-04 03:22:43,053 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-04 03:22:43,053 INFO L182 omatonBuilderFactory]: Interpolants [3344#(<= |#Ultimate.C_memset_#t~loopctr17| 4), 3345#(<= |#Ultimate.C_memset_#t~loopctr17| 5), 3346#(<= |#Ultimate.C_memset_#t~loopctr17| 6), 3347#(<= |#Ultimate.C_memset_#t~loopctr17| 7), 3348#(<= |#Ultimate.C_memset_#amount| 7), 3338#true, 3339#false, 3340#(= |#Ultimate.C_memset_#t~loopctr17| 0), 3341#(<= |#Ultimate.C_memset_#t~loopctr17| 1), 3342#(<= |#Ultimate.C_memset_#t~loopctr17| 2), 3343#(<= |#Ultimate.C_memset_#t~loopctr17| 3)] [2018-02-04 03:22:43,053 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-04 03:22:43,054 INFO L409 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-02-04 03:22:43,054 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-02-04 03:22:43,054 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=63, Unknown=0, NotChecked=0, Total=110 [2018-02-04 03:22:43,054 INFO L87 Difference]: Start difference. First operand 120 states and 125 transitions. Second operand 11 states. [2018-02-04 03:22:43,081 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 03:22:43,082 INFO L93 Difference]: Finished difference Result 123 states and 128 transitions. [2018-02-04 03:22:43,082 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-02-04 03:22:43,082 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 41 [2018-02-04 03:22:43,083 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 03:22:43,083 INFO L225 Difference]: With dead ends: 123 [2018-02-04 03:22:43,084 INFO L226 Difference]: Without dead ends: 121 [2018-02-04 03:22:43,084 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-04 03:22:43,084 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 121 states. [2018-02-04 03:22:43,087 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 121 to 121. [2018-02-04 03:22:43,088 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 121 states. [2018-02-04 03:22:43,088 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 121 states to 121 states and 126 transitions. [2018-02-04 03:22:43,089 INFO L78 Accepts]: Start accepts. Automaton has 121 states and 126 transitions. Word has length 41 [2018-02-04 03:22:43,089 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 03:22:43,089 INFO L432 AbstractCegarLoop]: Abstraction has 121 states and 126 transitions. [2018-02-04 03:22:43,089 INFO L433 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-02-04 03:22:43,089 INFO L276 IsEmpty]: Start isEmpty. Operand 121 states and 126 transitions. [2018-02-04 03:22:43,090 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2018-02-04 03:22:43,090 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 03:22:43,090 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-04 03:22:43,090 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_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-04 03:22:43,090 INFO L82 PathProgramCache]: Analyzing trace with hash 986235302, now seen corresponding path program 8 times [2018-02-04 03:22:43,092 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-04 03:22:43,106 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 03:22:43,108 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 03:22:43,207 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-04 03:22:43,208 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-04 03:22:43,208 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [12] total 12 [2018-02-04 03:22:43,208 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-04 03:22:43,209 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-04 03:22:43,209 INFO L182 omatonBuilderFactory]: Interpolants [3600#(<= |#Ultimate.C_memset_#t~loopctr17| 3), 3601#(<= |#Ultimate.C_memset_#t~loopctr17| 4), 3602#(<= |#Ultimate.C_memset_#t~loopctr17| 5), 3603#(<= |#Ultimate.C_memset_#t~loopctr17| 6), 3604#(<= |#Ultimate.C_memset_#t~loopctr17| 7), 3605#(<= |#Ultimate.C_memset_#t~loopctr17| 8), 3606#(<= |#Ultimate.C_memset_#amount| 8), 3595#true, 3596#false, 3597#(= |#Ultimate.C_memset_#t~loopctr17| 0), 3598#(<= |#Ultimate.C_memset_#t~loopctr17| 1), 3599#(<= |#Ultimate.C_memset_#t~loopctr17| 2)] [2018-02-04 03:22:43,209 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-04 03:22:43,210 INFO L409 AbstractCegarLoop]: Interpolant automaton has 12 states [2018-02-04 03:22:43,210 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2018-02-04 03:22:43,210 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=75, Unknown=0, NotChecked=0, Total=132 [2018-02-04 03:22:43,210 INFO L87 Difference]: Start difference. First operand 121 states and 126 transitions. Second operand 12 states. [2018-02-04 03:22:43,244 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 03:22:43,245 INFO L93 Difference]: Finished difference Result 124 states and 129 transitions. [2018-02-04 03:22:43,246 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-02-04 03:22:43,246 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 42 [2018-02-04 03:22:43,247 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 03:22:43,247 INFO L225 Difference]: With dead ends: 124 [2018-02-04 03:22:43,248 INFO L226 Difference]: Without dead ends: 122 [2018-02-04 03:22:43,248 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-04 03:22:43,248 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 122 states. [2018-02-04 03:22:43,250 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 122 to 122. [2018-02-04 03:22:43,250 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 122 states. [2018-02-04 03:22:43,251 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 122 states to 122 states and 127 transitions. [2018-02-04 03:22:43,251 INFO L78 Accepts]: Start accepts. Automaton has 122 states and 127 transitions. Word has length 42 [2018-02-04 03:22:43,251 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 03:22:43,251 INFO L432 AbstractCegarLoop]: Abstraction has 122 states and 127 transitions. [2018-02-04 03:22:43,251 INFO L433 AbstractCegarLoop]: Interpolant automaton has 12 states. [2018-02-04 03:22:43,251 INFO L276 IsEmpty]: Start isEmpty. Operand 122 states and 127 transitions. [2018-02-04 03:22:43,252 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2018-02-04 03:22:43,252 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 03:22:43,252 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-04 03:22:43,252 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_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-04 03:22:43,252 INFO L82 PathProgramCache]: Analyzing trace with hash 177453711, now seen corresponding path program 9 times [2018-02-04 03:22:43,253 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-04 03:22:43,266 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 03:22:43,267 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 03:22:43,362 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-04 03:22:43,362 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-04 03:22:43,363 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [13] total 13 [2018-02-04 03:22:43,363 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-04 03:22:43,363 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-04 03:22:43,363 INFO L182 omatonBuilderFactory]: Interpolants [3855#true, 3856#false, 3857#(= |#Ultimate.C_memset_#t~loopctr17| 0), 3858#(<= |#Ultimate.C_memset_#t~loopctr17| 1), 3859#(<= |#Ultimate.C_memset_#t~loopctr17| 2), 3860#(<= |#Ultimate.C_memset_#t~loopctr17| 3), 3861#(<= |#Ultimate.C_memset_#t~loopctr17| 4), 3862#(<= |#Ultimate.C_memset_#t~loopctr17| 5), 3863#(<= |#Ultimate.C_memset_#t~loopctr17| 6), 3864#(<= |#Ultimate.C_memset_#t~loopctr17| 7), 3865#(<= |#Ultimate.C_memset_#t~loopctr17| 8), 3866#(<= |#Ultimate.C_memset_#t~loopctr17| 9), 3867#(<= |#Ultimate.C_memset_#amount| 9)] [2018-02-04 03:22:43,363 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-04 03:22:43,364 INFO L409 AbstractCegarLoop]: Interpolant automaton has 13 states [2018-02-04 03:22:43,364 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2018-02-04 03:22:43,364 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=68, Invalid=88, Unknown=0, NotChecked=0, Total=156 [2018-02-04 03:22:43,364 INFO L87 Difference]: Start difference. First operand 122 states and 127 transitions. Second operand 13 states. [2018-02-04 03:22:43,388 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 03:22:43,389 INFO L93 Difference]: Finished difference Result 125 states and 130 transitions. [2018-02-04 03:22:43,391 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2018-02-04 03:22:43,391 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 43 [2018-02-04 03:22:43,391 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 03:22:43,392 INFO L225 Difference]: With dead ends: 125 [2018-02-04 03:22:43,392 INFO L226 Difference]: Without dead ends: 123 [2018-02-04 03:22:43,392 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-04 03:22:43,393 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 123 states. [2018-02-04 03:22:43,395 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 123 to 123. [2018-02-04 03:22:43,395 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 123 states. [2018-02-04 03:22:43,395 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 123 states to 123 states and 128 transitions. [2018-02-04 03:22:43,395 INFO L78 Accepts]: Start accepts. Automaton has 123 states and 128 transitions. Word has length 43 [2018-02-04 03:22:43,396 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 03:22:43,396 INFO L432 AbstractCegarLoop]: Abstraction has 123 states and 128 transitions. [2018-02-04 03:22:43,396 INFO L433 AbstractCegarLoop]: Interpolant automaton has 13 states. [2018-02-04 03:22:43,396 INFO L276 IsEmpty]: Start isEmpty. Operand 123 states and 128 transitions. [2018-02-04 03:22:43,396 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2018-02-04 03:22:43,396 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 03:22:43,396 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-04 03:22:43,397 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_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-04 03:22:43,397 INFO L82 PathProgramCache]: Analyzing trace with hash 875028166, now seen corresponding path program 10 times [2018-02-04 03:22:43,398 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-04 03:22:43,412 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 03:22:43,413 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 03:22:43,535 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-04 03:22:43,536 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-04 03:22:43,536 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [14] total 14 [2018-02-04 03:22:43,536 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-04 03:22:43,537 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-04 03:22:43,537 INFO L182 omatonBuilderFactory]: Interpolants [4128#(<= |#Ultimate.C_memset_#t~loopctr17| 8), 4129#(<= |#Ultimate.C_memset_#t~loopctr17| 9), 4130#(<= |#Ultimate.C_memset_#t~loopctr17| 10), 4131#(<= |#Ultimate.C_memset_#amount| 10), 4118#true, 4119#false, 4120#(= |#Ultimate.C_memset_#t~loopctr17| 0), 4121#(<= |#Ultimate.C_memset_#t~loopctr17| 1), 4122#(<= |#Ultimate.C_memset_#t~loopctr17| 2), 4123#(<= |#Ultimate.C_memset_#t~loopctr17| 3), 4124#(<= |#Ultimate.C_memset_#t~loopctr17| 4), 4125#(<= |#Ultimate.C_memset_#t~loopctr17| 5), 4126#(<= |#Ultimate.C_memset_#t~loopctr17| 6), 4127#(<= |#Ultimate.C_memset_#t~loopctr17| 7)] [2018-02-04 03:22:43,537 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-04 03:22:43,537 INFO L409 AbstractCegarLoop]: Interpolant automaton has 14 states [2018-02-04 03:22:43,537 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2018-02-04 03:22:43,537 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=80, Invalid=102, Unknown=0, NotChecked=0, Total=182 [2018-02-04 03:22:43,538 INFO L87 Difference]: Start difference. First operand 123 states and 128 transitions. Second operand 14 states. [2018-02-04 03:22:43,572 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 03:22:43,572 INFO L93 Difference]: Finished difference Result 126 states and 131 transitions. [2018-02-04 03:22:43,573 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2018-02-04 03:22:43,574 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 44 [2018-02-04 03:22:43,574 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 03:22:43,574 INFO L225 Difference]: With dead ends: 126 [2018-02-04 03:22:43,575 INFO L226 Difference]: Without dead ends: 124 [2018-02-04 03:22:43,575 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=84, Invalid=126, Unknown=0, NotChecked=0, Total=210 [2018-02-04 03:22:43,575 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 124 states. [2018-02-04 03:22:43,577 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 124 to 124. [2018-02-04 03:22:43,577 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 124 states. [2018-02-04 03:22:43,578 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 124 states to 124 states and 129 transitions. [2018-02-04 03:22:43,578 INFO L78 Accepts]: Start accepts. Automaton has 124 states and 129 transitions. Word has length 44 [2018-02-04 03:22:43,578 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 03:22:43,578 INFO L432 AbstractCegarLoop]: Abstraction has 124 states and 129 transitions. [2018-02-04 03:22:43,578 INFO L433 AbstractCegarLoop]: Interpolant automaton has 14 states. [2018-02-04 03:22:43,578 INFO L276 IsEmpty]: Start isEmpty. Operand 124 states and 129 transitions. [2018-02-04 03:22:43,579 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2018-02-04 03:22:43,579 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 03:22:43,579 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-04 03:22:43,579 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_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-04 03:22:43,579 INFO L82 PathProgramCache]: Analyzing trace with hash 1024999791, now seen corresponding path program 11 times [2018-02-04 03:22:43,580 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-04 03:22:43,592 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 03:22:43,593 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 03:22:43,690 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-04 03:22:43,690 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-04 03:22:43,690 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [15] total 15 [2018-02-04 03:22:43,690 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-04 03:22:43,691 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-04 03:22:43,691 INFO L182 omatonBuilderFactory]: Interpolants [4384#true, 4385#false, 4386#(= |#Ultimate.C_memset_#t~loopctr17| 0), 4387#(<= |#Ultimate.C_memset_#t~loopctr17| 1), 4388#(<= |#Ultimate.C_memset_#t~loopctr17| 2), 4389#(<= |#Ultimate.C_memset_#t~loopctr17| 3), 4390#(<= |#Ultimate.C_memset_#t~loopctr17| 4), 4391#(<= |#Ultimate.C_memset_#t~loopctr17| 5), 4392#(<= |#Ultimate.C_memset_#t~loopctr17| 6), 4393#(<= |#Ultimate.C_memset_#t~loopctr17| 7), 4394#(<= |#Ultimate.C_memset_#t~loopctr17| 8), 4395#(<= |#Ultimate.C_memset_#t~loopctr17| 9), 4396#(<= |#Ultimate.C_memset_#t~loopctr17| 10), 4397#(<= |#Ultimate.C_memset_#t~loopctr17| 11), 4398#(<= |#Ultimate.C_memset_#amount| 11)] [2018-02-04 03:22:43,691 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-04 03:22:43,691 INFO L409 AbstractCegarLoop]: Interpolant automaton has 15 states [2018-02-04 03:22:43,691 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2018-02-04 03:22:43,691 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=93, Invalid=117, Unknown=0, NotChecked=0, Total=210 [2018-02-04 03:22:43,692 INFO L87 Difference]: Start difference. First operand 124 states and 129 transitions. Second operand 15 states. [2018-02-04 03:22:43,735 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 03:22:43,735 INFO L93 Difference]: Finished difference Result 127 states and 132 transitions. [2018-02-04 03:22:43,736 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2018-02-04 03:22:43,736 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 45 [2018-02-04 03:22:43,736 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 03:22:43,737 INFO L225 Difference]: With dead ends: 127 [2018-02-04 03:22:43,737 INFO L226 Difference]: Without dead ends: 125 [2018-02-04 03:22:43,737 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-04 03:22:43,737 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 125 states. [2018-02-04 03:22:43,739 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 125 to 125. [2018-02-04 03:22:43,739 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 125 states. [2018-02-04 03:22:43,740 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 125 states to 125 states and 130 transitions. [2018-02-04 03:22:43,740 INFO L78 Accepts]: Start accepts. Automaton has 125 states and 130 transitions. Word has length 45 [2018-02-04 03:22:43,740 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 03:22:43,740 INFO L432 AbstractCegarLoop]: Abstraction has 125 states and 130 transitions. [2018-02-04 03:22:43,740 INFO L433 AbstractCegarLoop]: Interpolant automaton has 15 states. [2018-02-04 03:22:43,741 INFO L276 IsEmpty]: Start isEmpty. Operand 125 states and 130 transitions. [2018-02-04 03:22:43,741 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2018-02-04 03:22:43,741 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 03:22:43,741 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-04 03:22:43,741 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_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-04 03:22:43,741 INFO L82 PathProgramCache]: Analyzing trace with hash 1379152870, now seen corresponding path program 12 times [2018-02-04 03:22:43,742 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-04 03:22:43,759 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 03:22:43,761 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 03:22:43,889 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-04 03:22:43,889 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-04 03:22:43,889 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [16] total 16 [2018-02-04 03:22:43,890 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-04 03:22:43,890 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-04 03:22:43,890 INFO L182 omatonBuilderFactory]: Interpolants [4653#true, 4654#false, 4655#(= |#Ultimate.C_memset_#t~loopctr17| 0), 4656#(<= |#Ultimate.C_memset_#t~loopctr17| 1), 4657#(<= |#Ultimate.C_memset_#t~loopctr17| 2), 4658#(<= |#Ultimate.C_memset_#t~loopctr17| 3), 4659#(<= |#Ultimate.C_memset_#t~loopctr17| 4), 4660#(<= |#Ultimate.C_memset_#t~loopctr17| 5), 4661#(<= |#Ultimate.C_memset_#t~loopctr17| 6), 4662#(<= |#Ultimate.C_memset_#t~loopctr17| 7), 4663#(<= |#Ultimate.C_memset_#t~loopctr17| 8), 4664#(<= |#Ultimate.C_memset_#t~loopctr17| 9), 4665#(<= |#Ultimate.C_memset_#t~loopctr17| 10), 4666#(<= |#Ultimate.C_memset_#t~loopctr17| 11), 4667#(<= |#Ultimate.C_memset_#t~loopctr17| 12), 4668#(<= |#Ultimate.C_memset_#amount| 12)] [2018-02-04 03:22:43,890 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-04 03:22:43,891 INFO L409 AbstractCegarLoop]: Interpolant automaton has 16 states [2018-02-04 03:22:43,891 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2018-02-04 03:22:43,891 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=107, Invalid=133, Unknown=0, NotChecked=0, Total=240 [2018-02-04 03:22:43,891 INFO L87 Difference]: Start difference. First operand 125 states and 130 transitions. Second operand 16 states. [2018-02-04 03:22:43,933 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 03:22:43,933 INFO L93 Difference]: Finished difference Result 128 states and 133 transitions. [2018-02-04 03:22:43,934 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2018-02-04 03:22:43,934 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 46 [2018-02-04 03:22:43,934 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 03:22:43,935 INFO L225 Difference]: With dead ends: 128 [2018-02-04 03:22:43,935 INFO L226 Difference]: Without dead ends: 126 [2018-02-04 03:22:43,935 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-04 03:22:43,935 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 126 states. [2018-02-04 03:22:43,937 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 126 to 126. [2018-02-04 03:22:43,937 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 126 states. [2018-02-04 03:22:43,938 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 126 states to 126 states and 131 transitions. [2018-02-04 03:22:43,938 INFO L78 Accepts]: Start accepts. Automaton has 126 states and 131 transitions. Word has length 46 [2018-02-04 03:22:43,938 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 03:22:43,939 INFO L432 AbstractCegarLoop]: Abstraction has 126 states and 131 transitions. [2018-02-04 03:22:43,939 INFO L433 AbstractCegarLoop]: Interpolant automaton has 16 states. [2018-02-04 03:22:43,939 INFO L276 IsEmpty]: Start isEmpty. Operand 126 states and 131 transitions. [2018-02-04 03:22:43,939 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2018-02-04 03:22:43,939 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 03:22:43,939 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-04 03:22:43,939 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_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-04 03:22:43,940 INFO L82 PathProgramCache]: Analyzing trace with hash -527003569, now seen corresponding path program 13 times [2018-02-04 03:22:43,940 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-04 03:22:43,954 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 03:22:43,955 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 03:22:44,087 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-04 03:22:44,088 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-04 03:22:44,088 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [17] total 17 [2018-02-04 03:22:44,088 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-04 03:22:44,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-04 03:22:44,089 INFO L182 omatonBuilderFactory]: Interpolants [4928#(<= |#Ultimate.C_memset_#t~loopctr17| 1), 4929#(<= |#Ultimate.C_memset_#t~loopctr17| 2), 4930#(<= |#Ultimate.C_memset_#t~loopctr17| 3), 4931#(<= |#Ultimate.C_memset_#t~loopctr17| 4), 4932#(<= |#Ultimate.C_memset_#t~loopctr17| 5), 4933#(<= |#Ultimate.C_memset_#t~loopctr17| 6), 4934#(<= |#Ultimate.C_memset_#t~loopctr17| 7), 4935#(<= |#Ultimate.C_memset_#t~loopctr17| 8), 4936#(<= |#Ultimate.C_memset_#t~loopctr17| 9), 4937#(<= |#Ultimate.C_memset_#t~loopctr17| 10), 4938#(<= |#Ultimate.C_memset_#t~loopctr17| 11), 4939#(<= |#Ultimate.C_memset_#t~loopctr17| 12), 4940#(<= |#Ultimate.C_memset_#t~loopctr17| 13), 4941#(<= |#Ultimate.C_memset_#amount| 13), 4925#true, 4926#false, 4927#(= |#Ultimate.C_memset_#t~loopctr17| 0)] [2018-02-04 03:22:44,090 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-04 03:22:44,090 INFO L409 AbstractCegarLoop]: Interpolant automaton has 17 states [2018-02-04 03:22:44,090 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2018-02-04 03:22:44,091 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=122, Invalid=150, Unknown=0, NotChecked=0, Total=272 [2018-02-04 03:22:44,091 INFO L87 Difference]: Start difference. First operand 126 states and 131 transitions. Second operand 17 states. [2018-02-04 03:22:44,143 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 03:22:44,143 INFO L93 Difference]: Finished difference Result 129 states and 134 transitions. [2018-02-04 03:22:44,143 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2018-02-04 03:22:44,143 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 47 [2018-02-04 03:22:44,143 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 03:22:44,144 INFO L225 Difference]: With dead ends: 129 [2018-02-04 03:22:44,144 INFO L226 Difference]: Without dead ends: 127 [2018-02-04 03:22:44,144 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 13 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=126, Invalid=180, Unknown=0, NotChecked=0, Total=306 [2018-02-04 03:22:44,145 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 127 states. [2018-02-04 03:22:44,147 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 127 to 127. [2018-02-04 03:22:44,147 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 127 states. [2018-02-04 03:22:44,147 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 127 states to 127 states and 132 transitions. [2018-02-04 03:22:44,148 INFO L78 Accepts]: Start accepts. Automaton has 127 states and 132 transitions. Word has length 47 [2018-02-04 03:22:44,148 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 03:22:44,148 INFO L432 AbstractCegarLoop]: Abstraction has 127 states and 132 transitions. [2018-02-04 03:22:44,148 INFO L433 AbstractCegarLoop]: Interpolant automaton has 17 states. [2018-02-04 03:22:44,148 INFO L276 IsEmpty]: Start isEmpty. Operand 127 states and 132 transitions. [2018-02-04 03:22:44,149 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2018-02-04 03:22:44,149 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 03:22:44,149 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-04 03:22:44,149 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_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-04 03:22:44,149 INFO L82 PathProgramCache]: Analyzing trace with hash 511688966, now seen corresponding path program 14 times [2018-02-04 03:22:44,150 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-04 03:22:44,162 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 03:22:44,163 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 03:22:44,260 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-04 03:22:44,260 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-04 03:22:44,260 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [18] total 18 [2018-02-04 03:22:44,260 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-04 03:22:44,261 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 03:22:44,261 INFO L182 omatonBuilderFactory]: Interpolants [5216#(<= |#Ultimate.C_memset_#t~loopctr17| 14), 5217#(<= |#Ultimate.C_memset_#amount| 14), 5200#true, 5201#false, 5202#(= |#Ultimate.C_memset_#t~loopctr17| 0), 5203#(<= |#Ultimate.C_memset_#t~loopctr17| 1), 5204#(<= |#Ultimate.C_memset_#t~loopctr17| 2), 5205#(<= |#Ultimate.C_memset_#t~loopctr17| 3), 5206#(<= |#Ultimate.C_memset_#t~loopctr17| 4), 5207#(<= |#Ultimate.C_memset_#t~loopctr17| 5), 5208#(<= |#Ultimate.C_memset_#t~loopctr17| 6), 5209#(<= |#Ultimate.C_memset_#t~loopctr17| 7), 5210#(<= |#Ultimate.C_memset_#t~loopctr17| 8), 5211#(<= |#Ultimate.C_memset_#t~loopctr17| 9), 5212#(<= |#Ultimate.C_memset_#t~loopctr17| 10), 5213#(<= |#Ultimate.C_memset_#t~loopctr17| 11), 5214#(<= |#Ultimate.C_memset_#t~loopctr17| 12), 5215#(<= |#Ultimate.C_memset_#t~loopctr17| 13)] [2018-02-04 03:22:44,261 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-04 03:22:44,261 INFO L409 AbstractCegarLoop]: Interpolant automaton has 18 states [2018-02-04 03:22:44,261 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2018-02-04 03:22:44,261 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=138, Invalid=168, Unknown=0, NotChecked=0, Total=306 [2018-02-04 03:22:44,261 INFO L87 Difference]: Start difference. First operand 127 states and 132 transitions. Second operand 18 states. [2018-02-04 03:22:44,295 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 03:22:44,295 INFO L93 Difference]: Finished difference Result 130 states and 135 transitions. [2018-02-04 03:22:44,295 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2018-02-04 03:22:44,295 INFO L78 Accepts]: Start accepts. Automaton has 18 states. Word has length 48 [2018-02-04 03:22:44,295 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 03:22:44,296 INFO L225 Difference]: With dead ends: 130 [2018-02-04 03:22:44,296 INFO L226 Difference]: Without dead ends: 128 [2018-02-04 03:22:44,296 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 14 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=142, Invalid=200, Unknown=0, NotChecked=0, Total=342 [2018-02-04 03:22:44,296 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 128 states. [2018-02-04 03:22:44,297 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 128 to 128. [2018-02-04 03:22:44,298 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 128 states. [2018-02-04 03:22:44,298 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 128 states to 128 states and 133 transitions. [2018-02-04 03:22:44,298 INFO L78 Accepts]: Start accepts. Automaton has 128 states and 133 transitions. Word has length 48 [2018-02-04 03:22:44,298 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 03:22:44,298 INFO L432 AbstractCegarLoop]: Abstraction has 128 states and 133 transitions. [2018-02-04 03:22:44,298 INFO L433 AbstractCegarLoop]: Interpolant automaton has 18 states. [2018-02-04 03:22:44,298 INFO L276 IsEmpty]: Start isEmpty. Operand 128 states and 133 transitions. [2018-02-04 03:22:44,298 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2018-02-04 03:22:44,298 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 03:22:44,299 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-04 03:22:44,299 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_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-04 03:22:44,299 INFO L82 PathProgramCache]: Analyzing trace with hash -1648580817, now seen corresponding path program 15 times [2018-02-04 03:22:44,299 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-04 03:22:44,309 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 03:22:44,309 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 03:22:44,458 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-04 03:22:44,458 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-04 03:22:44,459 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [19] total 19 [2018-02-04 03:22:44,459 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-04 03:22:44,459 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-04 03:22:44,459 INFO L182 omatonBuilderFactory]: Interpolants [5478#true, 5479#false, 5480#(= |#Ultimate.C_memset_#t~loopctr17| 0), 5481#(<= |#Ultimate.C_memset_#t~loopctr17| 1), 5482#(<= |#Ultimate.C_memset_#t~loopctr17| 2), 5483#(<= |#Ultimate.C_memset_#t~loopctr17| 3), 5484#(<= |#Ultimate.C_memset_#t~loopctr17| 4), 5485#(<= |#Ultimate.C_memset_#t~loopctr17| 5), 5486#(<= |#Ultimate.C_memset_#t~loopctr17| 6), 5487#(<= |#Ultimate.C_memset_#t~loopctr17| 7), 5488#(<= |#Ultimate.C_memset_#t~loopctr17| 8), 5489#(<= |#Ultimate.C_memset_#t~loopctr17| 9), 5490#(<= |#Ultimate.C_memset_#t~loopctr17| 10), 5491#(<= |#Ultimate.C_memset_#t~loopctr17| 11), 5492#(<= |#Ultimate.C_memset_#t~loopctr17| 12), 5493#(<= |#Ultimate.C_memset_#t~loopctr17| 13), 5494#(<= |#Ultimate.C_memset_#t~loopctr17| 14), 5495#(<= |#Ultimate.C_memset_#t~loopctr17| 15), 5496#(<= |#Ultimate.C_memset_#amount| 15)] [2018-02-04 03:22:44,459 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-04 03:22:44,460 INFO L409 AbstractCegarLoop]: Interpolant automaton has 19 states [2018-02-04 03:22:44,460 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2018-02-04 03:22:44,460 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=155, Invalid=187, Unknown=0, NotChecked=0, Total=342 [2018-02-04 03:22:44,460 INFO L87 Difference]: Start difference. First operand 128 states and 133 transitions. Second operand 19 states. [2018-02-04 03:22:44,505 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 03:22:44,505 INFO L93 Difference]: Finished difference Result 131 states and 136 transitions. [2018-02-04 03:22:44,506 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2018-02-04 03:22:44,506 INFO L78 Accepts]: Start accepts. Automaton has 19 states. Word has length 49 [2018-02-04 03:22:44,506 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 03:22:44,506 INFO L225 Difference]: With dead ends: 131 [2018-02-04 03:22:44,506 INFO L226 Difference]: Without dead ends: 129 [2018-02-04 03:22:44,507 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=159, Invalid=221, Unknown=0, NotChecked=0, Total=380 [2018-02-04 03:22:44,507 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 129 states. [2018-02-04 03:22:44,508 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 129 to 129. [2018-02-04 03:22:44,509 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 129 states. [2018-02-04 03:22:44,509 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 129 states to 129 states and 134 transitions. [2018-02-04 03:22:44,510 INFO L78 Accepts]: Start accepts. Automaton has 129 states and 134 transitions. Word has length 49 [2018-02-04 03:22:44,510 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 03:22:44,510 INFO L432 AbstractCegarLoop]: Abstraction has 129 states and 134 transitions. [2018-02-04 03:22:44,510 INFO L433 AbstractCegarLoop]: Interpolant automaton has 19 states. [2018-02-04 03:22:44,510 INFO L276 IsEmpty]: Start isEmpty. Operand 129 states and 134 transitions. [2018-02-04 03:22:44,510 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2018-02-04 03:22:44,510 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 03:22:44,511 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-04 03:22:44,511 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_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-04 03:22:44,511 INFO L82 PathProgramCache]: Analyzing trace with hash 102532646, now seen corresponding path program 16 times [2018-02-04 03:22:44,512 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-04 03:22:44,524 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 03:22:44,525 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 03:22:44,684 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-04 03:22:44,684 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-04 03:22:44,685 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2018-02-04 03:22:44,685 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-04 03:22:44,685 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-04 03:22:44,685 INFO L182 omatonBuilderFactory]: Interpolants [5760#false, 5761#(= 0 |ldv_malloc_#t~malloc4.offset|), 5762#(= 0 |ldv_malloc_#res.offset|), 5763#(= 0 |ldv_kobject_create_#t~ret14.offset|), 5764#(= 0 ldv_kobject_create_~kobj~1.offset), 5765#(or (<= (+ |#Ultimate.C_memset_#ptr.offset| |#Ultimate.C_memset_#amount|) (select |#length| |#Ultimate.C_memset_#ptr.base|)) (not (= |#Ultimate.C_memset_#ptr.offset| 0))), 5766#(and (= 0 ldv_kobject_create_~kobj~1.offset) (<= 16 (select |#length| ldv_kobject_create_~kobj~1.base))), 5767#(and (= 0 |ldv_kobject_init_#in~kobj.offset|) (<= 16 (select |#length| |ldv_kobject_init_#in~kobj.base|))), 5768#(and (= 0 ldv_kobject_init_~kobj.offset) (<= 16 (select |#length| ldv_kobject_init_~kobj.base))), 5769#(and (<= 16 (select |#length| |ldv_kobject_init_internal_#in~kobj.base|)) (= 0 |ldv_kobject_init_internal_#in~kobj.offset|)), 5770#(and (<= 16 (select |#length| ldv_kobject_init_internal_~kobj.base)) (= ldv_kobject_init_internal_~kobj.offset 0)), 5771#(and (<= (+ |ldv_kref_init_#in~kref.offset| 4) (select |#length| |ldv_kref_init_#in~kref.base|)) (<= 12 |ldv_kref_init_#in~kref.offset|)), 5772#(and (<= 12 ldv_kref_init_~kref.offset) (<= (+ ldv_kref_init_~kref.offset 4) (select |#length| ldv_kref_init_~kref.base))), 5759#true] [2018-02-04 03:22:44,685 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-04 03:22:44,685 INFO L409 AbstractCegarLoop]: Interpolant automaton has 14 states [2018-02-04 03:22:44,685 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2018-02-04 03:22:44,686 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=156, Unknown=0, NotChecked=0, Total=182 [2018-02-04 03:22:44,686 INFO L87 Difference]: Start difference. First operand 129 states and 134 transitions. Second operand 14 states. [2018-02-04 03:22:44,887 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 03:22:44,887 INFO L93 Difference]: Finished difference Result 128 states and 133 transitions. [2018-02-04 03:22:44,888 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2018-02-04 03:22:44,888 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 50 [2018-02-04 03:22:44,888 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 03:22:44,889 INFO L225 Difference]: With dead ends: 128 [2018-02-04 03:22:44,889 INFO L226 Difference]: Without dead ends: 128 [2018-02-04 03:22:44,890 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-04 03:22:44,890 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 128 states. [2018-02-04 03:22:44,892 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 128 to 128. [2018-02-04 03:22:44,892 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 128 states. [2018-02-04 03:22:44,892 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 128 states to 128 states and 133 transitions. [2018-02-04 03:22:44,892 INFO L78 Accepts]: Start accepts. Automaton has 128 states and 133 transitions. Word has length 50 [2018-02-04 03:22:44,893 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 03:22:44,893 INFO L432 AbstractCegarLoop]: Abstraction has 128 states and 133 transitions. [2018-02-04 03:22:44,893 INFO L433 AbstractCegarLoop]: Interpolant automaton has 14 states. [2018-02-04 03:22:44,893 INFO L276 IsEmpty]: Start isEmpty. Operand 128 states and 133 transitions. [2018-02-04 03:22:44,893 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2018-02-04 03:22:44,893 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 03:22:44,893 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-04 03:22:44,893 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_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-04 03:22:44,893 INFO L82 PathProgramCache]: Analyzing trace with hash 102532645, now seen corresponding path program 1 times [2018-02-04 03:22:44,894 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-04 03:22:44,902 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 03:22:44,903 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 03:22:44,955 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-04 03:22:44,955 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-04 03:22:44,955 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2018-02-04 03:22:44,955 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-04 03:22:44,955 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-04 03:22:44,955 INFO L182 omatonBuilderFactory]: Interpolants [6037#true, 6038#false, 6039#(= 1 (select |#valid| |#Ultimate.C_memset_#ptr.base|)), 6040#(= 1 (select |#valid| ldv_kobject_create_~kobj~1.base)), 6041#(= 1 (select |#valid| |ldv_kobject_init_#in~kobj.base|)), 6042#(= 1 (select |#valid| ldv_kobject_init_~kobj.base)), 6043#(= 1 (select |#valid| |ldv_kobject_init_internal_#in~kobj.base|)), 6044#(= 1 (select |#valid| ldv_kobject_init_internal_~kobj.base)), 6045#(= 1 (select |#valid| |ldv_kref_init_#in~kref.base|)), 6046#(= 1 (select |#valid| ldv_kref_init_~kref.base))] [2018-02-04 03:22:44,955 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-04 03:22:44,956 INFO L409 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-02-04 03:22:44,956 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-02-04 03:22:44,956 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=73, Unknown=0, NotChecked=0, Total=90 [2018-02-04 03:22:44,956 INFO L87 Difference]: Start difference. First operand 128 states and 133 transitions. Second operand 10 states. [2018-02-04 03:22:45,131 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 03:22:45,132 INFO L93 Difference]: Finished difference Result 127 states and 132 transitions. [2018-02-04 03:22:45,132 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-02-04 03:22:45,132 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 50 [2018-02-04 03:22:45,132 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 03:22:45,132 INFO L225 Difference]: With dead ends: 127 [2018-02-04 03:22:45,132 INFO L226 Difference]: Without dead ends: 127 [2018-02-04 03:22:45,133 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-04 03:22:45,133 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 127 states. [2018-02-04 03:22:45,134 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 127 to 127. [2018-02-04 03:22:45,134 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 127 states. [2018-02-04 03:22:45,134 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 127 states to 127 states and 132 transitions. [2018-02-04 03:22:45,134 INFO L78 Accepts]: Start accepts. Automaton has 127 states and 132 transitions. Word has length 50 [2018-02-04 03:22:45,134 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 03:22:45,134 INFO L432 AbstractCegarLoop]: Abstraction has 127 states and 132 transitions. [2018-02-04 03:22:45,134 INFO L433 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-02-04 03:22:45,134 INFO L276 IsEmpty]: Start isEmpty. Operand 127 states and 132 transitions. [2018-02-04 03:22:45,135 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2018-02-04 03:22:45,135 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 03:22:45,135 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-04 03:22:45,135 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_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-04 03:22:45,135 INFO L82 PathProgramCache]: Analyzing trace with hash 1443896288, now seen corresponding path program 1 times [2018-02-04 03:22:45,136 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-04 03:22:45,144 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 03:22:45,145 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 03:22:45,200 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-04 03:22:45,201 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-04 03:22:45,218 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2018-02-04 03:22:45,219 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-04 03:22:45,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-04 03:22:45,219 INFO L182 omatonBuilderFactory]: Interpolants [6307#true, 6308#false, 6309#(= 1 (select |#valid| |#Ultimate.C_memset_#ptr.base|)), 6310#(= 1 (select |#valid| ldv_kobject_create_~kobj~1.base)), 6311#(= 1 (select |#valid| |ldv_kobject_init_#in~kobj.base|)), 6312#(= 1 (select |#valid| ldv_kobject_init_~kobj.base)), 6313#(= 1 (select |#valid| |ldv_kobject_init_internal_#in~kobj.base|)), 6314#(= 1 (select |#valid| ldv_kobject_init_internal_~kobj.base)), 6315#(= 1 (select |#valid| |LDV_INIT_LIST_HEAD_#in~list.base|)), 6316#(= 1 (select |#valid| LDV_INIT_LIST_HEAD_~list.base))] [2018-02-04 03:22:45,219 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-04 03:22:45,219 INFO L409 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-02-04 03:22:45,220 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-02-04 03:22:45,220 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=73, Unknown=0, NotChecked=0, Total=90 [2018-02-04 03:22:45,220 INFO L87 Difference]: Start difference. First operand 127 states and 132 transitions. Second operand 10 states. [2018-02-04 03:22:45,348 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 03:22:45,348 INFO L93 Difference]: Finished difference Result 125 states and 130 transitions. [2018-02-04 03:22:45,348 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-02-04 03:22:45,348 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 55 [2018-02-04 03:22:45,348 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 03:22:45,349 INFO L225 Difference]: With dead ends: 125 [2018-02-04 03:22:45,349 INFO L226 Difference]: Without dead ends: 125 [2018-02-04 03:22:45,349 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-04 03:22:45,349 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 125 states. [2018-02-04 03:22:45,350 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 125 to 125. [2018-02-04 03:22:45,350 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 125 states. [2018-02-04 03:22:45,351 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 125 states to 125 states and 130 transitions. [2018-02-04 03:22:45,351 INFO L78 Accepts]: Start accepts. Automaton has 125 states and 130 transitions. Word has length 55 [2018-02-04 03:22:45,351 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 03:22:45,351 INFO L432 AbstractCegarLoop]: Abstraction has 125 states and 130 transitions. [2018-02-04 03:22:45,351 INFO L433 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-02-04 03:22:45,351 INFO L276 IsEmpty]: Start isEmpty. Operand 125 states and 130 transitions. [2018-02-04 03:22:45,352 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2018-02-04 03:22:45,352 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 03:22:45,352 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-04 03:22:45,352 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_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-04 03:22:45,352 INFO L82 PathProgramCache]: Analyzing trace with hash 1443896289, now seen corresponding path program 1 times [2018-02-04 03:22:45,353 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-04 03:22:45,370 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 03:22:45,371 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 03:22:45,548 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-04 03:22:45,548 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-04 03:22:45,548 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2018-02-04 03:22:45,548 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-04 03:22:45,548 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-04 03:22:45,548 INFO L182 omatonBuilderFactory]: Interpolants [6573#true, 6574#false, 6575#(= 0 |ldv_malloc_#t~malloc4.offset|), 6576#(= 0 |ldv_malloc_#res.offset|), 6577#(= 0 |ldv_kobject_create_#t~ret14.offset|), 6578#(= 0 ldv_kobject_create_~kobj~1.offset), 6579#(or (<= (+ |#Ultimate.C_memset_#ptr.offset| |#Ultimate.C_memset_#amount|) (select |#length| |#Ultimate.C_memset_#ptr.base|)) (not (= |#Ultimate.C_memset_#ptr.offset| 0))), 6580#(and (= 0 ldv_kobject_create_~kobj~1.offset) (<= 16 (select |#length| ldv_kobject_create_~kobj~1.base))), 6581#(and (= 0 |ldv_kobject_init_#in~kobj.offset|) (<= 16 (select |#length| |ldv_kobject_init_#in~kobj.base|))), 6582#(and (= 0 ldv_kobject_init_~kobj.offset) (<= 16 (select |#length| ldv_kobject_init_~kobj.base))), 6583#(and (<= 16 (select |#length| |ldv_kobject_init_internal_#in~kobj.base|)) (= 0 |ldv_kobject_init_internal_#in~kobj.offset|)), 6584#(and (<= 16 (select |#length| ldv_kobject_init_internal_~kobj.base)) (= ldv_kobject_init_internal_~kobj.offset 0)), 6585#(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|))), 6586#(and (<= (+ LDV_INIT_LIST_HEAD_~list.offset 12) (select |#length| LDV_INIT_LIST_HEAD_~list.base)) (<= 4 LDV_INIT_LIST_HEAD_~list.offset))] [2018-02-04 03:22:45,549 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-04 03:22:45,549 INFO L409 AbstractCegarLoop]: Interpolant automaton has 14 states [2018-02-04 03:22:45,549 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2018-02-04 03:22:45,549 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=156, Unknown=0, NotChecked=0, Total=182 [2018-02-04 03:22:45,549 INFO L87 Difference]: Start difference. First operand 125 states and 130 transitions. Second operand 14 states. [2018-02-04 03:22:45,722 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 03:22:45,722 INFO L93 Difference]: Finished difference Result 123 states and 128 transitions. [2018-02-04 03:22:45,722 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2018-02-04 03:22:45,722 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 55 [2018-02-04 03:22:45,722 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 03:22:45,723 INFO L225 Difference]: With dead ends: 123 [2018-02-04 03:22:45,723 INFO L226 Difference]: Without dead ends: 123 [2018-02-04 03:22:45,723 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-04 03:22:45,723 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 123 states. [2018-02-04 03:22:45,724 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 123 to 123. [2018-02-04 03:22:45,724 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 123 states. [2018-02-04 03:22:45,725 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 123 states to 123 states and 128 transitions. [2018-02-04 03:22:45,725 INFO L78 Accepts]: Start accepts. Automaton has 123 states and 128 transitions. Word has length 55 [2018-02-04 03:22:45,725 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 03:22:45,725 INFO L432 AbstractCegarLoop]: Abstraction has 123 states and 128 transitions. [2018-02-04 03:22:45,725 INFO L433 AbstractCegarLoop]: Interpolant automaton has 14 states. [2018-02-04 03:22:45,725 INFO L276 IsEmpty]: Start isEmpty. Operand 123 states and 128 transitions. [2018-02-04 03:22:45,725 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2018-02-04 03:22:45,725 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 03:22:45,725 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-04 03:22:45,725 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_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-04 03:22:45,725 INFO L82 PathProgramCache]: Analyzing trace with hash -316102580, now seen corresponding path program 1 times [2018-02-04 03:22:45,726 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-04 03:22:45,733 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 03:22:45,734 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 03:22:45,771 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-04 03:22:45,772 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-04 03:22:45,772 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2018-02-04 03:22:45,772 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-04 03:22:45,772 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 03:22:45,772 INFO L182 omatonBuilderFactory]: Interpolants [6848#(= 0 |ldv_kobject_init_#in~kobj.base|), 6841#true, 6842#false, 6843#(not (= |ldv_malloc_#t~malloc4.base| 0)), 6844#(not (= |ldv_malloc_#res.base| 0)), 6845#(not (= |ldv_kobject_create_#t~ret14.base| 0)), 6846#(not (= ldv_kobject_create_~kobj~1.base 0)), 6847#(= ldv_kobject_init_~kobj.base |ldv_kobject_init_#in~kobj.base|)] [2018-02-04 03:22:45,772 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-04 03:22:45,773 INFO L409 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-02-04 03:22:45,773 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-02-04 03:22:45,773 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2018-02-04 03:22:45,773 INFO L87 Difference]: Start difference. First operand 123 states and 128 transitions. Second operand 8 states. [2018-02-04 03:22:45,803 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 03:22:45,803 INFO L93 Difference]: Finished difference Result 125 states and 129 transitions. [2018-02-04 03:22:45,803 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-02-04 03:22:45,803 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 60 [2018-02-04 03:22:45,804 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 03:22:45,804 INFO L225 Difference]: With dead ends: 125 [2018-02-04 03:22:45,804 INFO L226 Difference]: Without dead ends: 123 [2018-02-04 03:22:45,804 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-04 03:22:45,804 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 123 states. [2018-02-04 03:22:45,805 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 123 to 123. [2018-02-04 03:22:45,805 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 123 states. [2018-02-04 03:22:45,805 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 123 states to 123 states and 127 transitions. [2018-02-04 03:22:45,805 INFO L78 Accepts]: Start accepts. Automaton has 123 states and 127 transitions. Word has length 60 [2018-02-04 03:22:45,806 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 03:22:45,806 INFO L432 AbstractCegarLoop]: Abstraction has 123 states and 127 transitions. [2018-02-04 03:22:45,806 INFO L433 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-02-04 03:22:45,806 INFO L276 IsEmpty]: Start isEmpty. Operand 123 states and 127 transitions. [2018-02-04 03:22:45,806 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2018-02-04 03:22:45,806 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 03:22:45,806 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-04 03:22:45,806 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_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-04 03:22:45,807 INFO L82 PathProgramCache]: Analyzing trace with hash -2474126, now seen corresponding path program 1 times [2018-02-04 03:22:45,808 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-04 03:22:45,817 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 03:22:45,818 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 03:22:45,920 INFO L134 CoverageAnalysis]: Checked inductivity of 136 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 136 trivial. 0 not checked. [2018-02-04 03:22:45,921 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-04 03:22:45,921 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2018-02-04 03:22:45,921 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-04 03:22:45,921 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 03:22:45,921 INFO L182 omatonBuilderFactory]: Interpolants [7104#(not (= |ldv_malloc_#res.base| 0)), 7105#(not (= |ldv_kobject_create_#t~ret14.base| 0)), 7106#(not (= ldv_kobject_create_~kobj~1.base 0)), 7107#(= ldv_kobject_init_~kobj.base |ldv_kobject_init_#in~kobj.base|), 7108#(= ldv_kobject_init_internal_~kobj.base |ldv_kobject_init_internal_#in~kobj.base|), 7109#(= 0 |ldv_kobject_init_internal_#in~kobj.base|), 7110#(= 0 |ldv_kobject_init_#in~kobj.base|), 7101#true, 7102#false, 7103#(not (= |ldv_malloc_#t~malloc4.base| 0))] [2018-02-04 03:22:45,922 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-04 03:22:45,922 INFO L409 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-02-04 03:22:45,922 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-02-04 03:22:45,922 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=73, Unknown=0, NotChecked=0, Total=90 [2018-02-04 03:22:45,922 INFO L87 Difference]: Start difference. First operand 123 states and 127 transitions. Second operand 10 states. [2018-02-04 03:22:45,987 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 03:22:45,988 INFO L93 Difference]: Finished difference Result 127 states and 130 transitions. [2018-02-04 03:22:45,988 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-02-04 03:22:45,988 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 65 [2018-02-04 03:22:45,988 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 03:22:45,989 INFO L225 Difference]: With dead ends: 127 [2018-02-04 03:22:45,989 INFO L226 Difference]: Without dead ends: 123 [2018-02-04 03:22:45,989 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-04 03:22:45,989 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 123 states. [2018-02-04 03:22:45,991 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 123 to 123. [2018-02-04 03:22:45,991 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 123 states. [2018-02-04 03:22:45,991 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 123 states to 123 states and 126 transitions. [2018-02-04 03:22:45,991 INFO L78 Accepts]: Start accepts. Automaton has 123 states and 126 transitions. Word has length 65 [2018-02-04 03:22:45,992 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 03:22:45,992 INFO L432 AbstractCegarLoop]: Abstraction has 123 states and 126 transitions. [2018-02-04 03:22:45,992 INFO L433 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-02-04 03:22:45,992 INFO L276 IsEmpty]: Start isEmpty. Operand 123 states and 126 transitions. [2018-02-04 03:22:45,992 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 77 [2018-02-04 03:22:45,992 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 03:22:45,992 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-04 03:22:45,992 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_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-04 03:22:45,993 INFO L82 PathProgramCache]: Analyzing trace with hash -1583321193, now seen corresponding path program 1 times [2018-02-04 03:22:45,993 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-04 03:22:46,007 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 03:22:46,008 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 03:22:46,210 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-04 03:22:46,211 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-04 03:22:46,211 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [20] imperfect sequences [] total 20 [2018-02-04 03:22:46,211 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-04 03:22:46,211 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-04 03:22:46,212 INFO L182 omatonBuilderFactory]: Interpolants [7367#true, 7368#false, 7369#(= ldv_kobject_init_~kobj.base |ldv_kobject_init_#in~kobj.base|), 7370#(= ldv_kobject_init_internal_~kobj.base |ldv_kobject_init_internal_#in~kobj.base|), 7371#(= LDV_INIT_LIST_HEAD_~list.base |LDV_INIT_LIST_HEAD_#in~list.base|), 7372#(and (= 1 (select |#valid| LDV_INIT_LIST_HEAD_~list.base)) (= LDV_INIT_LIST_HEAD_~list.base |LDV_INIT_LIST_HEAD_#in~list.base|)), 7373#(= 1 (select |#valid| |LDV_INIT_LIST_HEAD_#in~list.base|)), 7374#(= 1 (select |#valid| |ldv_kobject_init_internal_#in~kobj.base|)), 7375#(= 1 (select |#valid| |ldv_kobject_init_#in~kobj.base|)), 7376#(= 1 (select |#valid| ldv_kobject_create_~kobj~1.base)), 7377#(= 1 (select |#valid| |ldv_kobject_create_#res.base|)), 7378#(= 1 (select |#valid| |entry_point_#t~ret16.base|)), 7379#(= 1 (select |#valid| entry_point_~kobj~2.base)), 7380#(= 1 (select |#valid| |ldv_kobject_put_#in~kobj.base|)), 7381#(= 1 (select |#valid| ldv_kobject_put_~kobj.base)), 7382#(= 1 (select |#valid| |ldv_kref_put_#in~kref.base|)), 7383#(= 1 (select |#valid| ldv_kref_put_~kref.base)), 7384#(= 1 (select |#valid| |ldv_kref_sub_#in~kref.base|)), 7385#(= 1 (select |#valid| ldv_kref_sub_~kref.base)), 7386#(= 1 (select |#valid| |ldv_atomic_sub_return_#in~v.base|)), 7387#(= 1 (select |#valid| ldv_atomic_sub_return_~v.base))] [2018-02-04 03:22:46,212 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-04 03:22:46,212 INFO L409 AbstractCegarLoop]: Interpolant automaton has 21 states [2018-02-04 03:22:46,212 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2018-02-04 03:22:46,212 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=41, Invalid=379, Unknown=0, NotChecked=0, Total=420 [2018-02-04 03:22:46,213 INFO L87 Difference]: Start difference. First operand 123 states and 126 transitions. Second operand 21 states. [2018-02-04 03:22:46,556 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 03:22:46,557 INFO L93 Difference]: Finished difference Result 130 states and 133 transitions. [2018-02-04 03:22:46,557 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2018-02-04 03:22:46,557 INFO L78 Accepts]: Start accepts. Automaton has 21 states. Word has length 76 [2018-02-04 03:22:46,557 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 03:22:46,557 INFO L225 Difference]: With dead ends: 130 [2018-02-04 03:22:46,557 INFO L226 Difference]: Without dead ends: 130 [2018-02-04 03:22:46,558 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 57 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=69, Invalid=687, Unknown=0, NotChecked=0, Total=756 [2018-02-04 03:22:46,558 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 130 states. [2018-02-04 03:22:46,559 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 130 to 121. [2018-02-04 03:22:46,559 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 121 states. [2018-02-04 03:22:46,560 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 121 states to 121 states and 124 transitions. [2018-02-04 03:22:46,560 INFO L78 Accepts]: Start accepts. Automaton has 121 states and 124 transitions. Word has length 76 [2018-02-04 03:22:46,560 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 03:22:46,560 INFO L432 AbstractCegarLoop]: Abstraction has 121 states and 124 transitions. [2018-02-04 03:22:46,560 INFO L433 AbstractCegarLoop]: Interpolant automaton has 21 states. [2018-02-04 03:22:46,560 INFO L276 IsEmpty]: Start isEmpty. Operand 121 states and 124 transitions. [2018-02-04 03:22:46,561 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 77 [2018-02-04 03:22:46,561 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 03:22:46,561 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-04 03:22:46,561 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_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-04 03:22:46,561 INFO L82 PathProgramCache]: Analyzing trace with hash -1583321192, now seen corresponding path program 1 times [2018-02-04 03:22:46,562 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-04 03:22:46,578 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 03:22:46,579 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 03:22:46,874 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-04 03:22:46,874 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-04 03:22:46,875 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [18] imperfect sequences [] total 18 [2018-02-04 03:22:46,875 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-04 03:22:46,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-04 03:22:46,876 INFO L182 omatonBuilderFactory]: Interpolants [7653#true, 7654#false, 7655#(= 0 |ldv_malloc_#t~malloc4.offset|), 7656#(= 0 |ldv_malloc_#res.offset|), 7657#(= 0 |ldv_kobject_create_#t~ret14.offset|), 7658#(= 0 ldv_kobject_create_~kobj~1.offset), 7659#(or (<= (+ |#Ultimate.C_memset_#ptr.offset| |#Ultimate.C_memset_#amount|) (select |#length| |#Ultimate.C_memset_#ptr.base|)) (not (= |#Ultimate.C_memset_#ptr.offset| 0))), 7660#(and (= 0 ldv_kobject_create_~kobj~1.offset) (<= 16 (select |#length| ldv_kobject_create_~kobj~1.base))), 7661#(and (= 0 |ldv_kobject_create_#res.offset|) (<= 16 (select |#length| |ldv_kobject_create_#res.base|))), 7662#(and (<= 16 (select |#length| |entry_point_#t~ret16.base|)) (= 0 |entry_point_#t~ret16.offset|)), 7663#(and (= 0 entry_point_~kobj~2.offset) (<= 16 (select |#length| entry_point_~kobj~2.base))), 7664#(and (<= 16 (select |#length| |ldv_kobject_put_#in~kobj.base|)) (= 0 |ldv_kobject_put_#in~kobj.offset|)), 7665#(and (= ldv_kobject_put_~kobj.offset 0) (<= 16 (select |#length| ldv_kobject_put_~kobj.base))), 7666#(and (<= 12 |ldv_kref_put_#in~kref.offset|) (<= (+ |ldv_kref_put_#in~kref.offset| 4) (select |#length| |ldv_kref_put_#in~kref.base|))), 7667#(and (<= 12 ldv_kref_put_~kref.offset) (<= (+ ldv_kref_put_~kref.offset 4) (select |#length| ldv_kref_put_~kref.base))), 7668#(and (<= (+ |ldv_kref_sub_#in~kref.offset| 4) (select |#length| |ldv_kref_sub_#in~kref.base|)) (<= 12 |ldv_kref_sub_#in~kref.offset|)), 7669#(and (<= (+ ldv_kref_sub_~kref.offset 4) (select |#length| ldv_kref_sub_~kref.base)) (<= 12 ldv_kref_sub_~kref.offset)), 7670#(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|)), 7671#(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-04 03:22:46,876 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-04 03:22:46,876 INFO L409 AbstractCegarLoop]: Interpolant automaton has 19 states [2018-02-04 03:22:46,877 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2018-02-04 03:22:46,877 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=306, Unknown=0, NotChecked=0, Total=342 [2018-02-04 03:22:46,877 INFO L87 Difference]: Start difference. First operand 121 states and 124 transitions. Second operand 19 states. [2018-02-04 03:22:47,156 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 03:22:47,156 INFO L93 Difference]: Finished difference Result 119 states and 122 transitions. [2018-02-04 03:22:47,156 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2018-02-04 03:22:47,156 INFO L78 Accepts]: Start accepts. Automaton has 19 states. Word has length 76 [2018-02-04 03:22:47,157 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 03:22:47,157 INFO L225 Difference]: With dead ends: 119 [2018-02-04 03:22:47,157 INFO L226 Difference]: Without dead ends: 119 [2018-02-04 03:22:47,157 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 31 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=61, Invalid=539, Unknown=0, NotChecked=0, Total=600 [2018-02-04 03:22:47,157 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 119 states. [2018-02-04 03:22:47,159 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 119 to 119. [2018-02-04 03:22:47,159 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 119 states. [2018-02-04 03:22:47,160 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 119 states to 119 states and 122 transitions. [2018-02-04 03:22:47,160 INFO L78 Accepts]: Start accepts. Automaton has 119 states and 122 transitions. Word has length 76 [2018-02-04 03:22:47,160 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 03:22:47,160 INFO L432 AbstractCegarLoop]: Abstraction has 119 states and 122 transitions. [2018-02-04 03:22:47,160 INFO L433 AbstractCegarLoop]: Interpolant automaton has 19 states. [2018-02-04 03:22:47,160 INFO L276 IsEmpty]: Start isEmpty. Operand 119 states and 122 transitions. [2018-02-04 03:22:47,161 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 75 [2018-02-04 03:22:47,161 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 03:22:47,161 INFO L351 BasicCegarLoop]: trace histogram [16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 03:22:47,161 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_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-04 03:22:47,161 INFO L82 PathProgramCache]: Analyzing trace with hash 576722261, now seen corresponding path program 1 times [2018-02-04 03:22:47,162 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-04 03:22:47,168 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 03:22:47,168 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 03:22:47,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-04 03:22:47,219 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-04 03:22:47,219 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2018-02-04 03:22:47,219 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-04 03:22:47,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-04 03:22:47,219 INFO L182 omatonBuilderFactory]: Interpolants [7922#true, 7923#false, 7924#(not (= |ldv_malloc_#t~malloc4.base| 0)), 7925#(not (= |ldv_malloc_#res.base| 0)), 7926#(not (= |ldv_kobject_create_#t~ret14.base| 0)), 7927#(not (= ldv_kobject_create_~kobj~1.base 0)), 7928#(not (= |ldv_kobject_create_#res.base| 0)), 7929#(not (= |entry_point_#t~ret16.base| 0)), 7930#(not (= entry_point_~kobj~2.base 0)), 7931#(= ldv_kobject_put_~kobj.base |ldv_kobject_put_#in~kobj.base|), 7932#(= 0 |ldv_kobject_put_#in~kobj.base|)] [2018-02-04 03:22:47,219 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-04 03:22:47,219 INFO L409 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-02-04 03:22:47,220 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-02-04 03:22:47,220 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=91, Unknown=0, NotChecked=0, Total=110 [2018-02-04 03:22:47,220 INFO L87 Difference]: Start difference. First operand 119 states and 122 transitions. Second operand 11 states. [2018-02-04 03:22:47,283 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 03:22:47,284 INFO L93 Difference]: Finished difference Result 121 states and 123 transitions. [2018-02-04 03:22:47,284 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-02-04 03:22:47,284 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 74 [2018-02-04 03:22:47,284 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 03:22:47,285 INFO L225 Difference]: With dead ends: 121 [2018-02-04 03:22:47,285 INFO L226 Difference]: Without dead ends: 119 [2018-02-04 03:22:47,286 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=31, Invalid=151, Unknown=0, NotChecked=0, Total=182 [2018-02-04 03:22:47,286 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 119 states. [2018-02-04 03:22:47,287 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 119 to 119. [2018-02-04 03:22:47,287 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 119 states. [2018-02-04 03:22:47,288 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 119 states to 119 states and 121 transitions. [2018-02-04 03:22:47,288 INFO L78 Accepts]: Start accepts. Automaton has 119 states and 121 transitions. Word has length 74 [2018-02-04 03:22:47,288 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 03:22:47,288 INFO L432 AbstractCegarLoop]: Abstraction has 119 states and 121 transitions. [2018-02-04 03:22:47,288 INFO L433 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-02-04 03:22:47,288 INFO L276 IsEmpty]: Start isEmpty. Operand 119 states and 121 transitions. [2018-02-04 03:22:47,289 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 91 [2018-02-04 03:22:47,289 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 03:22:47,289 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] [2018-02-04 03:22:47,289 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_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-04 03:22:47,290 INFO L82 PathProgramCache]: Analyzing trace with hash 33829762, now seen corresponding path program 1 times [2018-02-04 03:22:47,290 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-04 03:22:47,304 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 03:22:47,305 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 03:22:47,551 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-04 03:22:47,551 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-04 03:22:47,551 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [23] imperfect sequences [] total 23 [2018-02-04 03:22:47,551 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-04 03:22:47,551 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-04 03:22:47,552 INFO L182 omatonBuilderFactory]: Interpolants [8192#(= 1 (select |#valid| ldv_kobject_put_~kobj.base)), 8193#(= 1 (select |#valid| |ldv_kref_put_#in~kref.base|)), 8194#(= 1 (select |#valid| ldv_kref_put_~kref.base)), 8195#(= 1 (select |#valid| |ldv_kref_sub_#in~kref.base|)), 8196#(= 1 (select |#valid| ldv_kref_sub_~kref.base)), 8197#(= 1 (select |#valid| |##fun~$Pointer$~TO~VOID_#in~kref.base|)), 8198#(= 1 (select |#valid| |##fun~$Pointer$~TO~VOID_#~kref.base|)), 8199#(= 1 (select |#valid| |ldv_kobject_release_#in~kref.base|)), 8200#(= 1 (select |#valid| ldv_kobject_release_~kobj~0.base)), 8201#(= 1 (select |#valid| |ldv_kobject_cleanup_#in~kobj.base|)), 8202#(= 1 (select |#valid| ldv_kobject_cleanup_~kobj.base)), 8179#true, 8180#false, 8181#(= ldv_kobject_init_~kobj.base |ldv_kobject_init_#in~kobj.base|), 8182#(= ldv_kobject_init_internal_~kobj.base |ldv_kobject_init_internal_#in~kobj.base|), 8183#(= LDV_INIT_LIST_HEAD_~list.base |LDV_INIT_LIST_HEAD_#in~list.base|), 8184#(= 1 (select |#valid| |LDV_INIT_LIST_HEAD_#in~list.base|)), 8185#(= 1 (select |#valid| |ldv_kobject_init_internal_#in~kobj.base|)), 8186#(= 1 (select |#valid| |ldv_kobject_init_#in~kobj.base|)), 8187#(= 1 (select |#valid| ldv_kobject_create_~kobj~1.base)), 8188#(= 1 (select |#valid| |ldv_kobject_create_#res.base|)), 8189#(= 1 (select |#valid| |entry_point_#t~ret16.base|)), 8190#(= 1 (select |#valid| entry_point_~kobj~2.base)), 8191#(= 1 (select |#valid| |ldv_kobject_put_#in~kobj.base|))] [2018-02-04 03:22:47,552 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-04 03:22:47,552 INFO L409 AbstractCegarLoop]: Interpolant automaton has 24 states [2018-02-04 03:22:47,552 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2018-02-04 03:22:47,552 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=45, Invalid=507, Unknown=0, NotChecked=0, Total=552 [2018-02-04 03:22:47,552 INFO L87 Difference]: Start difference. First operand 119 states and 121 transitions. Second operand 24 states. [2018-02-04 03:22:48,018 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 03:22:48,018 INFO L93 Difference]: Finished difference Result 122 states and 124 transitions. [2018-02-04 03:22:48,019 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2018-02-04 03:22:48,019 INFO L78 Accepts]: Start accepts. Automaton has 24 states. Word has length 90 [2018-02-04 03:22:48,019 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 03:22:48,020 INFO L225 Difference]: With dead ends: 122 [2018-02-04 03:22:48,020 INFO L226 Difference]: Without dead ends: 122 [2018-02-04 03:22:48,020 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 33 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 32 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 45 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=85, Invalid=1037, Unknown=0, NotChecked=0, Total=1122 [2018-02-04 03:22:48,021 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 122 states. [2018-02-04 03:22:48,023 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 122 to 117. [2018-02-04 03:22:48,023 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 117 states. [2018-02-04 03:22:48,024 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 117 states to 117 states and 119 transitions. [2018-02-04 03:22:48,024 INFO L78 Accepts]: Start accepts. Automaton has 117 states and 119 transitions. Word has length 90 [2018-02-04 03:22:48,024 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 03:22:48,024 INFO L432 AbstractCegarLoop]: Abstraction has 117 states and 119 transitions. [2018-02-04 03:22:48,024 INFO L433 AbstractCegarLoop]: Interpolant automaton has 24 states. [2018-02-04 03:22:48,024 INFO L276 IsEmpty]: Start isEmpty. Operand 117 states and 119 transitions. [2018-02-04 03:22:48,025 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 91 [2018-02-04 03:22:48,025 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 03:22:48,025 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] [2018-02-04 03:22:48,025 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_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-04 03:22:48,025 INFO L82 PathProgramCache]: Analyzing trace with hash 33829763, now seen corresponding path program 1 times [2018-02-04 03:22:48,027 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-04 03:22:48,046 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 03:22:48,046 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 03:22:48,418 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-04 03:22:48,419 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-04 03:22:48,419 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [24] imperfect sequences [] total 24 [2018-02-04 03:22:48,419 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-04 03:22:48,420 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-04 03:22:48,420 INFO L182 omatonBuilderFactory]: Interpolants [8462#true, 8463#false, 8464#(= 0 |ldv_malloc_#t~malloc4.offset|), 8465#(= 0 |ldv_malloc_#res.offset|), 8466#(= 0 |ldv_kobject_create_#t~ret14.offset|), 8467#(= 0 ldv_kobject_create_~kobj~1.offset), 8468#(= 0 |ldv_kobject_create_#res.offset|), 8469#(= 0 |entry_point_#t~ret16.offset|), 8470#(= 0 entry_point_~kobj~2.offset), 8471#(= 0 |ldv_kobject_put_#in~kobj.offset|), 8472#(= ldv_kobject_put_~kobj.offset 0), 8473#(<= 12 |ldv_kref_put_#in~kref.offset|), 8474#(<= 12 ldv_kref_put_~kref.offset), 8475#(<= 12 |ldv_kref_sub_#in~kref.offset|), 8476#(<= 12 ldv_kref_sub_~kref.offset), 8477#(and (<= |ldv_atomic_sub_return_#in~v.offset| ldv_atomic_sub_return_~v.offset) (= ldv_atomic_sub_return_~v.base |ldv_atomic_sub_return_#in~v.base|)), 8478#(and (<= (+ |ldv_atomic_sub_return_#in~v.offset| 4) (select |#length| ldv_atomic_sub_return_~v.base)) (= ldv_atomic_sub_return_~v.base |ldv_atomic_sub_return_#in~v.base|)), 8479#(<= (+ |ldv_atomic_sub_return_#in~v.offset| 4) (select |#length| |ldv_atomic_sub_return_#in~v.base|)), 8480#(and (<= (+ ldv_kref_sub_~kref.offset 4) (select |#length| ldv_kref_sub_~kref.base)) (<= 12 ldv_kref_sub_~kref.offset)), 8481#(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|))), 8482#(and (<= 12 |##fun~$Pointer$~TO~VOID_#~kref.offset|) (<= (+ |##fun~$Pointer$~TO~VOID_#~kref.offset| 4) (select |#length| |##fun~$Pointer$~TO~VOID_#~kref.base|))), 8483#(and (<= 12 |ldv_kobject_release_#in~kref.offset|) (<= (+ |ldv_kobject_release_#in~kref.offset| 4) (select |#length| |ldv_kobject_release_#in~kref.base|))), 8484#(and (<= (+ ldv_kobject_release_~kobj~0.offset 16) (select |#length| ldv_kobject_release_~kobj~0.base)) (<= 0 ldv_kobject_release_~kobj~0.offset)), 8485#(and (<= (+ |ldv_kobject_cleanup_#in~kobj.offset| 16) (select |#length| |ldv_kobject_cleanup_#in~kobj.base|)) (<= 0 |ldv_kobject_cleanup_#in~kobj.offset|)), 8486#(and (<= 0 ldv_kobject_cleanup_~kobj.offset) (<= (+ ldv_kobject_cleanup_~kobj.offset 16) (select |#length| ldv_kobject_cleanup_~kobj.base)))] [2018-02-04 03:22:48,420 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-04 03:22:48,420 INFO L409 AbstractCegarLoop]: Interpolant automaton has 25 states [2018-02-04 03:22:48,420 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2018-02-04 03:22:48,421 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=49, Invalid=551, Unknown=0, NotChecked=0, Total=600 [2018-02-04 03:22:48,421 INFO L87 Difference]: Start difference. First operand 117 states and 119 transitions. Second operand 25 states. [2018-02-04 03:22:48,835 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 03:22:48,835 INFO L93 Difference]: Finished difference Result 116 states and 118 transitions. [2018-02-04 03:22:48,835 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2018-02-04 03:22:48,835 INFO L78 Accepts]: Start accepts. Automaton has 25 states. Word has length 90 [2018-02-04 03:22:48,836 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 03:22:48,836 INFO L225 Difference]: With dead ends: 116 [2018-02-04 03:22:48,836 INFO L226 Difference]: Without dead ends: 116 [2018-02-04 03:22:48,836 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 36 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 33 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 65 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=92, Invalid=1098, Unknown=0, NotChecked=0, Total=1190 [2018-02-04 03:22:48,837 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 116 states. [2018-02-04 03:22:48,838 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 116 to 116. [2018-02-04 03:22:48,838 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 116 states. [2018-02-04 03:22:48,838 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 116 states to 116 states and 118 transitions. [2018-02-04 03:22:48,838 INFO L78 Accepts]: Start accepts. Automaton has 116 states and 118 transitions. Word has length 90 [2018-02-04 03:22:48,838 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 03:22:48,839 INFO L432 AbstractCegarLoop]: Abstraction has 116 states and 118 transitions. [2018-02-04 03:22:48,839 INFO L433 AbstractCegarLoop]: Interpolant automaton has 25 states. [2018-02-04 03:22:48,839 INFO L276 IsEmpty]: Start isEmpty. Operand 116 states and 118 transitions. [2018-02-04 03:22:48,839 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 93 [2018-02-04 03:22:48,839 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 03:22:48,839 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] [2018-02-04 03:22:48,840 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_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-04 03:22:48,840 INFO L82 PathProgramCache]: Analyzing trace with hash -1849335101, now seen corresponding path program 1 times [2018-02-04 03:22:48,840 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-04 03:22:48,857 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 03:22:48,858 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 03:22:49,125 INFO L134 CoverageAnalysis]: Checked inductivity of 136 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 136 trivial. 0 not checked. [2018-02-04 03:22:49,125 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-04 03:22:49,125 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [21] imperfect sequences [] total 21 [2018-02-04 03:22:49,125 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-04 03:22:49,126 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 03:22:49,126 INFO L182 omatonBuilderFactory]: Interpolants [8739#true, 8740#false, 8741#(= 0 |ldv_malloc_#t~malloc4.offset|), 8742#(= 0 |ldv_malloc_#res.offset|), 8743#(= 0 |ldv_kobject_create_#t~ret14.offset|), 8744#(= 0 ldv_kobject_create_~kobj~1.offset), 8745#(= 0 |ldv_kobject_create_#res.offset|), 8746#(= 0 |entry_point_#t~ret16.offset|), 8747#(= 0 entry_point_~kobj~2.offset), 8748#(= 0 |ldv_kobject_put_#in~kobj.offset|), 8749#(= ldv_kobject_put_~kobj.offset 0), 8750#(<= |ldv_kref_put_#in~kref.offset| 12), 8751#(<= ldv_kref_put_~kref.offset 12), 8752#(<= |ldv_kref_sub_#in~kref.offset| 12), 8753#(<= ldv_kref_sub_~kref.offset 12), 8754#(<= |##fun~$Pointer$~TO~VOID_#in~kref.offset| 12), 8755#(<= |##fun~$Pointer$~TO~VOID_#~kref.offset| 12), 8756#(<= |ldv_kobject_release_#in~kref.offset| 12), 8757#(<= ldv_kobject_release_~kobj~0.offset 0), 8758#(<= |ldv_kobject_cleanup_#in~kobj.offset| 0), 8759#(<= ldv_kobject_cleanup_~kobj.offset 0), 8760#(and (<= 0 ldv_kobject_cleanup_~kobj.offset) (<= ldv_kobject_cleanup_~kobj.offset 0))] [2018-02-04 03:22:49,126 INFO L134 CoverageAnalysis]: Checked inductivity of 136 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 136 trivial. 0 not checked. [2018-02-04 03:22:49,127 INFO L409 AbstractCegarLoop]: Interpolant automaton has 22 states [2018-02-04 03:22:49,127 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2018-02-04 03:22:49,127 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=42, Invalid=420, Unknown=0, NotChecked=0, Total=462 [2018-02-04 03:22:49,127 INFO L87 Difference]: Start difference. First operand 116 states and 118 transitions. Second operand 22 states. [2018-02-04 03:22:49,327 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 03:22:49,327 INFO L93 Difference]: Finished difference Result 115 states and 117 transitions. [2018-02-04 03:22:49,327 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2018-02-04 03:22:49,327 INFO L78 Accepts]: Start accepts. Automaton has 22 states. Word has length 92 [2018-02-04 03:22:49,328 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 03:22:49,328 INFO L225 Difference]: With dead ends: 115 [2018-02-04 03:22:49,328 INFO L226 Difference]: Without dead ends: 115 [2018-02-04 03:22:49,328 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 31 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 29 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 42 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=80, Invalid=850, Unknown=0, NotChecked=0, Total=930 [2018-02-04 03:22:49,328 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 115 states. [2018-02-04 03:22:49,329 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 115 to 115. [2018-02-04 03:22:49,329 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 115 states. [2018-02-04 03:22:49,330 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 115 states to 115 states and 117 transitions. [2018-02-04 03:22:49,330 INFO L78 Accepts]: Start accepts. Automaton has 115 states and 117 transitions. Word has length 92 [2018-02-04 03:22:49,330 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 03:22:49,330 INFO L432 AbstractCegarLoop]: Abstraction has 115 states and 117 transitions. [2018-02-04 03:22:49,330 INFO L433 AbstractCegarLoop]: Interpolant automaton has 22 states. [2018-02-04 03:22:49,330 INFO L276 IsEmpty]: Start isEmpty. Operand 115 states and 117 transitions. [2018-02-04 03:22:49,330 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 95 [2018-02-04 03:22:49,330 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 03:22:49,330 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] [2018-02-04 03:22:49,330 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_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-04 03:22:49,331 INFO L82 PathProgramCache]: Analyzing trace with hash 905430660, now seen corresponding path program 1 times [2018-02-04 03:22:49,331 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-04 03:22:49,388 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 03:22:49,389 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 03:22:51,962 INFO L134 CoverageAnalysis]: Checked inductivity of 136 backedges. 0 proven. 136 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 03:22:51,962 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-04 03:22:51,962 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [57] total 57 [2018-02-04 03:22:51,962 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-04 03:22:51,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-04 03:22:51,963 INFO L182 omatonBuilderFactory]: Interpolants [9009#true, 9010#false, 9011#(= 0 |ldv_malloc_#t~malloc4.offset|), 9012#(= 0 |ldv_malloc_#res.offset|), 9013#(= 0 |ldv_kobject_create_#t~ret14.offset|), 9014#(= 0 ldv_kobject_create_~kobj~1.offset), 9015#(or (= |#Ultimate.C_memset_#t~loopctr17| 0) (not (= |#Ultimate.C_memset_#ptr.offset| 0))), 9016#(or (not (= |#Ultimate.C_memset_#ptr.offset| 0)) (not (= |#Ultimate.C_memset_#value| 0)) (<= (+ |#Ultimate.C_memset_#t~loopctr17| |#Ultimate.C_memset_#ptr.offset|) 0) (and (= 0 (select (store (select |#memory_$Pointer$.offset| |#Ultimate.C_memset_#ptr.base|) (+ |#Ultimate.C_memset_#ptr.offset| |#Ultimate.C_memset_#t~loopctr17|) (+ |#Ultimate.C_memset_#value| (* (- 256) (div |#Ultimate.C_memset_#value| 256)))) 0)) (<= |#Ultimate.C_memset_#t~loopctr17| 1))), 9017#(or (<= (+ |#Ultimate.C_memset_#t~loopctr17| |#Ultimate.C_memset_#ptr.offset|) 1) (not (= |#Ultimate.C_memset_#ptr.offset| 0)) (not (= |#Ultimate.C_memset_#value| 0)) (and (= 0 (select (store (select |#memory_$Pointer$.offset| |#Ultimate.C_memset_#ptr.base|) (+ |#Ultimate.C_memset_#ptr.offset| |#Ultimate.C_memset_#t~loopctr17|) (+ |#Ultimate.C_memset_#value| (* (- 256) (div |#Ultimate.C_memset_#value| 256)))) 0)) (<= |#Ultimate.C_memset_#t~loopctr17| 2))), 9018#(or (and (= 0 (select (store (select |#memory_$Pointer$.offset| |#Ultimate.C_memset_#ptr.base|) (+ |#Ultimate.C_memset_#ptr.offset| |#Ultimate.C_memset_#t~loopctr17|) (+ |#Ultimate.C_memset_#value| (* (- 256) (div |#Ultimate.C_memset_#value| 256)))) 0)) (<= |#Ultimate.C_memset_#t~loopctr17| 3)) (not (= |#Ultimate.C_memset_#ptr.offset| 0)) (not (= |#Ultimate.C_memset_#value| 0)) (<= (+ |#Ultimate.C_memset_#t~loopctr17| |#Ultimate.C_memset_#ptr.offset|) 2)), 9019#(or (<= (+ |#Ultimate.C_memset_#t~loopctr17| |#Ultimate.C_memset_#ptr.offset|) 3) (not (= |#Ultimate.C_memset_#ptr.offset| 0)) (not (= |#Ultimate.C_memset_#value| 0)) (and (= 0 (select (store (select |#memory_$Pointer$.offset| |#Ultimate.C_memset_#ptr.base|) (+ |#Ultimate.C_memset_#ptr.offset| |#Ultimate.C_memset_#t~loopctr17|) (+ |#Ultimate.C_memset_#value| (* (- 256) (div |#Ultimate.C_memset_#value| 256)))) 0)) (<= |#Ultimate.C_memset_#t~loopctr17| 4))), 9020#(or (not (= |#Ultimate.C_memset_#ptr.offset| 0)) (not (= |#Ultimate.C_memset_#value| 0)) (<= (+ |#Ultimate.C_memset_#t~loopctr17| |#Ultimate.C_memset_#ptr.offset|) 4) (and (<= |#Ultimate.C_memset_#t~loopctr17| 5) (= 0 (select (store (select |#memory_$Pointer$.offset| |#Ultimate.C_memset_#ptr.base|) (+ |#Ultimate.C_memset_#t~loopctr17| |#Ultimate.C_memset_#ptr.offset|) (+ |#Ultimate.C_memset_#value| (* (- 256) (div |#Ultimate.C_memset_#value| 256)))) 0)))), 9021#(or (and (<= |#Ultimate.C_memset_#t~loopctr17| 6) (= 0 (select (store (select |#memory_$Pointer$.offset| |#Ultimate.C_memset_#ptr.base|) (+ |#Ultimate.C_memset_#t~loopctr17| |#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)) (<= (+ |#Ultimate.C_memset_#t~loopctr17| |#Ultimate.C_memset_#ptr.offset|) 5)), 9022#(or (<= |#Ultimate.C_memset_#t~loopctr17| 6) (not (= |#Ultimate.C_memset_#ptr.offset| 0)) (not (= |#Ultimate.C_memset_#value| 0)) (and (<= |#Ultimate.C_memset_#t~loopctr17| 7) (= 0 (select (store (select |#memory_$Pointer$.offset| |#Ultimate.C_memset_#ptr.base|) (+ |#Ultimate.C_memset_#t~loopctr17| |#Ultimate.C_memset_#ptr.offset|) (+ |#Ultimate.C_memset_#value| (* (- 256) (div |#Ultimate.C_memset_#value| 256)))) 0)))), 9023#(or (and (<= |#Ultimate.C_memset_#t~loopctr17| 8) (= 0 (select (store (select |#memory_$Pointer$.offset| |#Ultimate.C_memset_#ptr.base|) (+ |#Ultimate.C_memset_#t~loopctr17| |#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)) (<= (+ |#Ultimate.C_memset_#t~loopctr17| |#Ultimate.C_memset_#ptr.offset|) 7)), 9024#(or (not (= |#Ultimate.C_memset_#ptr.offset| 0)) (not (= |#Ultimate.C_memset_#value| 0)) (and (<= |#Ultimate.C_memset_#t~loopctr17| 9) (= 0 (select (store (select |#memory_$Pointer$.offset| |#Ultimate.C_memset_#ptr.base|) (+ |#Ultimate.C_memset_#t~loopctr17| |#Ultimate.C_memset_#ptr.offset|) (+ |#Ultimate.C_memset_#value| (* (- 256) (div |#Ultimate.C_memset_#value| 256)))) 0))) (<= (+ |#Ultimate.C_memset_#t~loopctr17| |#Ultimate.C_memset_#ptr.offset|) 8)), 9025#(or (not (= |#Ultimate.C_memset_#ptr.offset| 0)) (<= (+ |#Ultimate.C_memset_#t~loopctr17| |#Ultimate.C_memset_#ptr.offset|) 9) (not (= |#Ultimate.C_memset_#value| 0)) (and (= 0 (select (store (select |#memory_$Pointer$.offset| |#Ultimate.C_memset_#ptr.base|) (+ |#Ultimate.C_memset_#ptr.offset| |#Ultimate.C_memset_#t~loopctr17|) (+ |#Ultimate.C_memset_#value| (* (- 256) (div |#Ultimate.C_memset_#value| 256)))) 0)) (<= |#Ultimate.C_memset_#t~loopctr17| 10))), 9026#(or (and (= 0 (select (store (select |#memory_$Pointer$.offset| |#Ultimate.C_memset_#ptr.base|) (+ |#Ultimate.C_memset_#ptr.offset| |#Ultimate.C_memset_#t~loopctr17|) (+ |#Ultimate.C_memset_#value| (* (- 256) (div |#Ultimate.C_memset_#value| 256)))) 0)) (<= |#Ultimate.C_memset_#t~loopctr17| 11)) (<= |#Ultimate.C_memset_#t~loopctr17| 10) (not (= |#Ultimate.C_memset_#ptr.offset| 0)) (not (= |#Ultimate.C_memset_#value| 0))), 9027#(or (= 0 (select (store (select |#memory_$Pointer$.offset| |#Ultimate.C_memset_#ptr.base|) (+ |#Ultimate.C_memset_#ptr.offset| |#Ultimate.C_memset_#t~loopctr17|) (+ |#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)) (<= (+ |#Ultimate.C_memset_#t~loopctr17| |#Ultimate.C_memset_#ptr.offset|) 11)), 9028#(or (= 0 (select (store (select |#memory_$Pointer$.offset| |#Ultimate.C_memset_#ptr.base|) (+ |#Ultimate.C_memset_#ptr.offset| |#Ultimate.C_memset_#t~loopctr17|) (+ |#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)) (<= (+ |#Ultimate.C_memset_#t~loopctr17| |#Ultimate.C_memset_#ptr.offset|) 12)), 9029#(or (= 0 (select (store (select |#memory_$Pointer$.offset| |#Ultimate.C_memset_#ptr.base|) (+ |#Ultimate.C_memset_#ptr.offset| |#Ultimate.C_memset_#t~loopctr17|) (+ |#Ultimate.C_memset_#value| (* (- 256) (div |#Ultimate.C_memset_#value| 256)))) 0)) (<= |#Ultimate.C_memset_#t~loopctr17| 13) (not (= |#Ultimate.C_memset_#ptr.offset| 0)) (not (= |#Ultimate.C_memset_#value| 0))), 9030#(or (= 0 (select (store (select |#memory_$Pointer$.offset| |#Ultimate.C_memset_#ptr.base|) (+ |#Ultimate.C_memset_#ptr.offset| |#Ultimate.C_memset_#t~loopctr17|) (+ |#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)) (<= (+ |#Ultimate.C_memset_#t~loopctr17| |#Ultimate.C_memset_#ptr.offset|) 14)), 9031#(or (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)) (<= (+ |#Ultimate.C_memset_#t~loopctr17| |#Ultimate.C_memset_#ptr.offset|) 15)), 9032#(or (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)) (<= |#Ultimate.C_memset_#amount| 15)), 9033#(and (= 0 ldv_kobject_create_~kobj~1.offset) (= 0 (select (select |#memory_$Pointer$.offset| ldv_kobject_create_~kobj~1.base) 0))), 9034#(= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|), 9035#(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)), 9036#(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)))), 9037#(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)))), 9038#(and (<= |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)|)), 9039#(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|))), 9040#(and (or (and (or (= (select |#memory_$Pointer$.offset| ldv_kobject_init_internal_~kobj.base) (select |old(#memory_$Pointer$.offset)| |ldv_kobject_init_internal_#in~kobj.base|)) (<= (+ ldv_kobject_init_internal_~kobj.offset 12) (@diff (select |old(#memory_$Pointer$.offset)| |ldv_kobject_init_internal_#in~kobj.base|) (select |#memory_$Pointer$.offset| ldv_kobject_init_internal_~kobj.base)))) (= ldv_kobject_init_internal_~kobj.base |ldv_kobject_init_internal_#in~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)))))) (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)))), 9041#(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)|)), 9042#(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)) (not (= (+ LDV_INIT_LIST_HEAD_~list.offset 4) 0)) (<= |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|)), 9043#(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|)))) (not (= (+ |LDV_INIT_LIST_HEAD_#in~list.offset| 4) 0)) (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|))))), 9044#(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))), 9045#(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))), 9046#(and (= 0 (select (select |#memory_$Pointer$.offset| |ldv_kobject_create_#res.base|) 0)) (= 0 |ldv_kobject_create_#res.offset|)), 9047#(and (= 0 (select (select |#memory_$Pointer$.offset| |entry_point_#t~ret16.base|) 0)) (= 0 |entry_point_#t~ret16.offset|)), 9048#(and (= 0 entry_point_~kobj~2.offset) (= 0 (select (select |#memory_$Pointer$.offset| entry_point_~kobj~2.base) 0))), 9049#(and (= 0 |ldv_kobject_put_#in~kobj.offset|) (= 0 (select (select |#memory_$Pointer$.offset| |ldv_kobject_put_#in~kobj.base|) 0))), 9050#(and (= ldv_kobject_put_~kobj.offset 0) (= 0 (select (select |#memory_$Pointer$.offset| ldv_kobject_put_~kobj.base) 0))), 9051#(and (<= 12 |ldv_kref_put_#in~kref.offset|) (= 0 (select (select |#memory_$Pointer$.offset| |ldv_kref_put_#in~kref.base|) 0))), 9052#(and (<= 12 ldv_kref_put_~kref.offset) (= 0 (select (select |#memory_$Pointer$.offset| ldv_kref_put_~kref.base) 0))), 9053#(and (<= 12 |ldv_kref_sub_#in~kref.offset|) (= 0 (select (select |#memory_$Pointer$.offset| |ldv_kref_sub_#in~kref.base|) 0))), 9054#(and (= 0 (select (select |#memory_$Pointer$.offset| ldv_kref_sub_~kref.base) 0)) (<= 12 ldv_kref_sub_~kref.offset)), 9055#(and (<= ldv_atomic_sub_return_~v.offset |ldv_atomic_sub_return_#in~v.offset|) (<= |ldv_atomic_sub_return_#in~v.offset| ldv_atomic_sub_return_~v.offset) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= ldv_atomic_sub_return_~v.base |ldv_atomic_sub_return_#in~v.base|)), 9056#(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|))))), 9057#(= 0 (select (select |#memory_$Pointer$.offset| ldv_kref_sub_~kref.base) 0)), 9058#(= 0 (select (select |#memory_$Pointer$.offset| |##fun~$Pointer$~TO~VOID_#in~kref.base|) 0)), 9059#(= 0 (select (select |#memory_$Pointer$.offset| |##fun~$Pointer$~TO~VOID_#~kref.base|) 0)), 9060#(= 0 (select (select |#memory_$Pointer$.offset| |ldv_kobject_release_#in~kref.base|) 0)), 9061#(= 0 (select (select |#memory_$Pointer$.offset| ldv_kobject_release_~kobj~0.base) 0)), 9062#(= 0 (select (select |#memory_$Pointer$.offset| |ldv_kobject_cleanup_#in~kobj.base|) 0)), 9063#(or (not (= 0 ldv_kobject_cleanup_~kobj.offset)) (= 0 (select (select |#memory_$Pointer$.offset| ldv_kobject_cleanup_~kobj.base) ldv_kobject_cleanup_~kobj.offset))), 9064#(or (= 0 |ldv_kobject_cleanup_#t~mem12.offset|) (not (= 0 ldv_kobject_cleanup_~kobj.offset))), 9065#(or (not (= 0 ldv_kobject_cleanup_~kobj.offset)) (= 0 ldv_kobject_cleanup_~name~0.offset)), 9066#(= 0 ldv_kobject_cleanup_~name~0.offset)] [2018-02-04 03:22:51,964 INFO L134 CoverageAnalysis]: Checked inductivity of 136 backedges. 0 proven. 136 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 03:22:51,964 INFO L409 AbstractCegarLoop]: Interpolant automaton has 58 states [2018-02-04 03:22:51,964 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 58 interpolants. [2018-02-04 03:22:51,965 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=283, Invalid=3023, Unknown=0, NotChecked=0, Total=3306 [2018-02-04 03:22:51,965 INFO L87 Difference]: Start difference. First operand 115 states and 117 transitions. Second operand 58 states. [2018-02-04 03:22:54,813 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 03:22:54,813 INFO L93 Difference]: Finished difference Result 114 states and 116 transitions. [2018-02-04 03:22:54,813 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 56 states. [2018-02-04 03:22:54,814 INFO L78 Accepts]: Start accepts. Automaton has 58 states. Word has length 94 [2018-02-04 03:22:54,814 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 03:22:54,814 INFO L225 Difference]: With dead ends: 114 [2018-02-04 03:22:54,814 INFO L226 Difference]: Without dead ends: 114 [2018-02-04 03:22:54,815 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 104 GetRequests, 9 SyntacticMatches, 1 SemanticMatches, 94 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1687 ImplicationChecksByTransitivity, 2.9s TimeCoverageRelationStatistics Valid=807, Invalid=8313, Unknown=0, NotChecked=0, Total=9120 [2018-02-04 03:22:54,816 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 114 states. [2018-02-04 03:22:54,817 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 114 to 114. [2018-02-04 03:22:54,817 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 114 states. [2018-02-04 03:22:54,818 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 114 states to 114 states and 116 transitions. [2018-02-04 03:22:54,818 INFO L78 Accepts]: Start accepts. Automaton has 114 states and 116 transitions. Word has length 94 [2018-02-04 03:22:54,818 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 03:22:54,818 INFO L432 AbstractCegarLoop]: Abstraction has 114 states and 116 transitions. [2018-02-04 03:22:54,818 INFO L433 AbstractCegarLoop]: Interpolant automaton has 58 states. [2018-02-04 03:22:54,818 INFO L276 IsEmpty]: Start isEmpty. Operand 114 states and 116 transitions. [2018-02-04 03:22:54,819 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 95 [2018-02-04 03:22:54,819 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 03:22:54,819 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] [2018-02-04 03:22:54,819 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_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-04 03:22:54,819 INFO L82 PathProgramCache]: Analyzing trace with hash 905430661, now seen corresponding path program 1 times [2018-02-04 03:22:54,820 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-04 03:22:54,870 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 03:22:54,871 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 03:22:57,211 INFO L134 CoverageAnalysis]: Checked inductivity of 136 backedges. 0 proven. 136 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 03:22:57,211 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-04 03:22:57,211 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [57] total 57 [2018-02-04 03:22:57,211 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-04 03:22:57,212 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-04 03:22:57,212 INFO L182 omatonBuilderFactory]: Interpolants [9371#true, 9372#false, 9373#(= 0 |ldv_malloc_#t~malloc4.offset|), 9374#(= 0 |ldv_malloc_#res.offset|), 9375#(= 0 |ldv_kobject_create_#t~ret14.offset|), 9376#(= 0 ldv_kobject_create_~kobj~1.offset), 9377#(or (= |#Ultimate.C_memset_#t~loopctr17| 0) (not (= |#Ultimate.C_memset_#ptr.offset| 0))), 9378#(or (and (not (= 1 (+ |#Ultimate.C_memset_#t~loopctr17| |#Ultimate.C_memset_#ptr.offset|))) (<= |#Ultimate.C_memset_#t~loopctr17| 1)) (not (= |#Ultimate.C_memset_#ptr.offset| 0)) (and (= 0 (select (store (select |#memory_$Pointer$.base| |#Ultimate.C_memset_#ptr.base|) (+ |#Ultimate.C_memset_#ptr.offset| |#Ultimate.C_memset_#t~loopctr17|) 0) 0)) (<= |#Ultimate.C_memset_#t~loopctr17| 1))), 9379#(or (<= (+ |#Ultimate.C_memset_#t~loopctr17| |#Ultimate.C_memset_#ptr.offset|) 1) (not (= |#Ultimate.C_memset_#ptr.offset| 0)) (and (<= |#Ultimate.C_memset_#t~loopctr17| 2) (= 0 (select (store (select |#memory_$Pointer$.base| |#Ultimate.C_memset_#ptr.base|) (+ |#Ultimate.C_memset_#ptr.offset| |#Ultimate.C_memset_#t~loopctr17|) 0) 0)))), 9380#(or (not (= |#Ultimate.C_memset_#ptr.offset| 0)) (and (= 0 (select (store (select |#memory_$Pointer$.base| |#Ultimate.C_memset_#ptr.base|) (+ |#Ultimate.C_memset_#ptr.offset| |#Ultimate.C_memset_#t~loopctr17|) 0) 0)) (<= |#Ultimate.C_memset_#t~loopctr17| 3)) (<= (+ |#Ultimate.C_memset_#t~loopctr17| |#Ultimate.C_memset_#ptr.offset|) 2)), 9381#(or (<= (+ |#Ultimate.C_memset_#t~loopctr17| |#Ultimate.C_memset_#ptr.offset|) 3) (not (= |#Ultimate.C_memset_#ptr.offset| 0)) (and (<= |#Ultimate.C_memset_#t~loopctr17| 4) (= 0 (select (store (select |#memory_$Pointer$.base| |#Ultimate.C_memset_#ptr.base|) (+ |#Ultimate.C_memset_#ptr.offset| |#Ultimate.C_memset_#t~loopctr17|) 0) 0)))), 9382#(or (not (= |#Ultimate.C_memset_#ptr.offset| 0)) (<= (+ |#Ultimate.C_memset_#t~loopctr17| |#Ultimate.C_memset_#ptr.offset|) 4) (and (<= |#Ultimate.C_memset_#t~loopctr17| 5) (= 0 (select (store (select |#memory_$Pointer$.base| |#Ultimate.C_memset_#ptr.base|) (+ |#Ultimate.C_memset_#t~loopctr17| |#Ultimate.C_memset_#ptr.offset|) 0) 0)))), 9383#(or (not (= |#Ultimate.C_memset_#ptr.offset| 0)) (<= (+ |#Ultimate.C_memset_#t~loopctr17| |#Ultimate.C_memset_#ptr.offset|) 5) (and (= 0 (select (store (select |#memory_$Pointer$.base| |#Ultimate.C_memset_#ptr.base|) (+ |#Ultimate.C_memset_#t~loopctr17| |#Ultimate.C_memset_#ptr.offset|) 0) 0)) (<= |#Ultimate.C_memset_#t~loopctr17| 6))), 9384#(or (and (= 0 (select (store (select |#memory_$Pointer$.base| |#Ultimate.C_memset_#ptr.base|) (+ |#Ultimate.C_memset_#t~loopctr17| |#Ultimate.C_memset_#ptr.offset|) 0) 0)) (<= |#Ultimate.C_memset_#t~loopctr17| 7)) (<= |#Ultimate.C_memset_#t~loopctr17| 6) (not (= |#Ultimate.C_memset_#ptr.offset| 0))), 9385#(or (and (= 0 (select (store (select |#memory_$Pointer$.base| |#Ultimate.C_memset_#ptr.base|) (+ |#Ultimate.C_memset_#t~loopctr17| |#Ultimate.C_memset_#ptr.offset|) 0) 0)) (<= |#Ultimate.C_memset_#t~loopctr17| 8)) (not (= |#Ultimate.C_memset_#ptr.offset| 0)) (<= (+ |#Ultimate.C_memset_#t~loopctr17| |#Ultimate.C_memset_#ptr.offset|) 7)), 9386#(or (not (= |#Ultimate.C_memset_#ptr.offset| 0)) (and (<= |#Ultimate.C_memset_#t~loopctr17| 9) (= 0 (select (store (select |#memory_$Pointer$.base| |#Ultimate.C_memset_#ptr.base|) (+ |#Ultimate.C_memset_#t~loopctr17| |#Ultimate.C_memset_#ptr.offset|) 0) 0))) (<= (+ |#Ultimate.C_memset_#t~loopctr17| |#Ultimate.C_memset_#ptr.offset|) 8)), 9387#(or (not (= |#Ultimate.C_memset_#ptr.offset| 0)) (<= (+ |#Ultimate.C_memset_#t~loopctr17| |#Ultimate.C_memset_#ptr.offset|) 9) (and (<= |#Ultimate.C_memset_#t~loopctr17| 10) (= 0 (select (store (select |#memory_$Pointer$.base| |#Ultimate.C_memset_#ptr.base|) (+ |#Ultimate.C_memset_#ptr.offset| |#Ultimate.C_memset_#t~loopctr17|) 0) 0)))), 9388#(or (<= (+ |#Ultimate.C_memset_#t~loopctr17| |#Ultimate.C_memset_#ptr.offset|) 10) (and (<= |#Ultimate.C_memset_#t~loopctr17| 11) (= 0 (select (store (select |#memory_$Pointer$.base| |#Ultimate.C_memset_#ptr.base|) (+ |#Ultimate.C_memset_#ptr.offset| |#Ultimate.C_memset_#t~loopctr17|) 0) 0))) (not (= |#Ultimate.C_memset_#ptr.offset| 0))), 9389#(or (= 0 (select (store (select |#memory_$Pointer$.base| |#Ultimate.C_memset_#ptr.base|) (+ |#Ultimate.C_memset_#ptr.offset| |#Ultimate.C_memset_#t~loopctr17|) 0) 0)) (not (= |#Ultimate.C_memset_#ptr.offset| 0)) (<= (+ |#Ultimate.C_memset_#t~loopctr17| |#Ultimate.C_memset_#ptr.offset|) 11)), 9390#(or (= 0 (select (store (select |#memory_$Pointer$.base| |#Ultimate.C_memset_#ptr.base|) (+ |#Ultimate.C_memset_#ptr.offset| |#Ultimate.C_memset_#t~loopctr17|) 0) 0)) (not (= |#Ultimate.C_memset_#ptr.offset| 0)) (<= (+ |#Ultimate.C_memset_#t~loopctr17| |#Ultimate.C_memset_#ptr.offset|) 12)), 9391#(or (<= |#Ultimate.C_memset_#t~loopctr17| 13) (= 0 (select (store (select |#memory_$Pointer$.base| |#Ultimate.C_memset_#ptr.base|) (+ |#Ultimate.C_memset_#ptr.offset| |#Ultimate.C_memset_#t~loopctr17|) 0) 0)) (not (= |#Ultimate.C_memset_#ptr.offset| 0))), 9392#(or (= 0 (select (store (select |#memory_$Pointer$.base| |#Ultimate.C_memset_#ptr.base|) (+ |#Ultimate.C_memset_#ptr.offset| |#Ultimate.C_memset_#t~loopctr17|) 0) 0)) (not (= |#Ultimate.C_memset_#ptr.offset| 0)) (<= (+ |#Ultimate.C_memset_#t~loopctr17| |#Ultimate.C_memset_#ptr.offset|) 14)), 9393#(or (= 0 (select (select |#memory_$Pointer$.base| |#Ultimate.C_memset_#ptr.base|) 0)) (not (= |#Ultimate.C_memset_#ptr.offset| 0)) (<= |#Ultimate.C_memset_#t~loopctr17| 15)), 9394#(or (= 0 (select (select |#memory_$Pointer$.base| |#Ultimate.C_memset_#ptr.base|) 0)) (not (= |#Ultimate.C_memset_#ptr.offset| 0)) (<= |#Ultimate.C_memset_#amount| 15)), 9395#(and (= 0 ldv_kobject_create_~kobj~1.offset) (= 0 (select (select |#memory_$Pointer$.base| ldv_kobject_create_~kobj~1.base) 0))), 9396#(= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|), 9397#(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)), 9398#(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))), 9399#(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)))), 9400#(and (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (<= |ldv_kref_init_#in~kref.offset| ldv_kref_init_~kref.offset) (= ldv_kref_init_~kref.base |ldv_kref_init_#in~kref.base|)), 9401#(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|))), 9402#(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_#in~kobj.base| ldv_kobject_init_internal_~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)))), 9403#(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|)), 9404#(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|)), 9405#(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|))))))), 9406#(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))), 9407#(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))), 9408#(and (= 0 (select (select |#memory_$Pointer$.base| |ldv_kobject_create_#res.base|) 0)) (= 0 |ldv_kobject_create_#res.offset|)), 9409#(and (= 0 (select (select |#memory_$Pointer$.base| |entry_point_#t~ret16.base|) 0)) (= 0 |entry_point_#t~ret16.offset|)), 9410#(and (= 0 entry_point_~kobj~2.offset) (= 0 (select (select |#memory_$Pointer$.base| entry_point_~kobj~2.base) 0))), 9411#(and (= 0 |ldv_kobject_put_#in~kobj.offset|) (= 0 (select (select |#memory_$Pointer$.base| |ldv_kobject_put_#in~kobj.base|) 0))), 9412#(and (= ldv_kobject_put_~kobj.offset 0) (= 0 (select (select |#memory_$Pointer$.base| ldv_kobject_put_~kobj.base) 0))), 9413#(and (<= 12 |ldv_kref_put_#in~kref.offset|) (= 0 (select (select |#memory_$Pointer$.base| |ldv_kref_put_#in~kref.base|) 0))), 9414#(and (<= 12 ldv_kref_put_~kref.offset) (= 0 (select (select |#memory_$Pointer$.base| ldv_kref_put_~kref.base) 0))), 9415#(and (<= 12 |ldv_kref_sub_#in~kref.offset|) (= 0 (select (select |#memory_$Pointer$.base| |ldv_kref_sub_#in~kref.base|) 0))), 9416#(and (= 0 (select (select |#memory_$Pointer$.base| ldv_kref_sub_~kref.base) 0)) (<= 12 ldv_kref_sub_~kref.offset)), 9417#(and (<= ldv_atomic_sub_return_~v.offset |ldv_atomic_sub_return_#in~v.offset|) (<= |ldv_atomic_sub_return_#in~v.offset| ldv_atomic_sub_return_~v.offset) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= ldv_atomic_sub_return_~v.base |ldv_atomic_sub_return_#in~v.base|)), 9418#(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|)))))), 9419#(= 0 (select (select |#memory_$Pointer$.base| ldv_kref_sub_~kref.base) 0)), 9420#(= 0 (select (select |#memory_$Pointer$.base| |##fun~$Pointer$~TO~VOID_#in~kref.base|) 0)), 9421#(= 0 (select (select |#memory_$Pointer$.base| |##fun~$Pointer$~TO~VOID_#~kref.base|) 0)), 9422#(= 0 (select (select |#memory_$Pointer$.base| |ldv_kobject_release_#in~kref.base|) 0)), 9423#(= 0 (select (select |#memory_$Pointer$.base| ldv_kobject_release_~kobj~0.base) 0)), 9424#(= 0 (select (select |#memory_$Pointer$.base| |ldv_kobject_cleanup_#in~kobj.base|) 0)), 9425#(or (not (= 0 ldv_kobject_cleanup_~kobj.offset)) (= 0 (select (select |#memory_$Pointer$.base| ldv_kobject_cleanup_~kobj.base) ldv_kobject_cleanup_~kobj.offset))), 9426#(or (= 0 |ldv_kobject_cleanup_#t~mem12.base|) (not (= 0 ldv_kobject_cleanup_~kobj.offset))), 9427#(or (not (= 0 ldv_kobject_cleanup_~kobj.offset)) (= ldv_kobject_cleanup_~name~0.base 0)), 9428#(= ldv_kobject_cleanup_~name~0.base 0)] [2018-02-04 03:22:57,212 INFO L134 CoverageAnalysis]: Checked inductivity of 136 backedges. 0 proven. 136 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 03:22:57,213 INFO L409 AbstractCegarLoop]: Interpolant automaton has 58 states [2018-02-04 03:22:57,213 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 58 interpolants. [2018-02-04 03:22:57,213 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=289, Invalid=3017, Unknown=0, NotChecked=0, Total=3306 [2018-02-04 03:22:57,214 INFO L87 Difference]: Start difference. First operand 114 states and 116 transitions. Second operand 58 states. [2018-02-04 03:22:59,609 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 03:22:59,609 INFO L93 Difference]: Finished difference Result 113 states and 115 transitions. [2018-02-04 03:22:59,609 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 56 states. [2018-02-04 03:22:59,609 INFO L78 Accepts]: Start accepts. Automaton has 58 states. Word has length 94 [2018-02-04 03:22:59,609 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 03:22:59,610 INFO L225 Difference]: With dead ends: 113 [2018-02-04 03:22:59,610 INFO L226 Difference]: Without dead ends: 113 [2018-02-04 03:22:59,611 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 104 GetRequests, 9 SyntacticMatches, 1 SemanticMatches, 94 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1710 ImplicationChecksByTransitivity, 2.7s TimeCoverageRelationStatistics Valid=834, Invalid=8286, Unknown=0, NotChecked=0, Total=9120 [2018-02-04 03:22:59,611 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 113 states. [2018-02-04 03:22:59,612 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 113 to 113. [2018-02-04 03:22:59,612 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 113 states. [2018-02-04 03:22:59,612 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 113 states to 113 states and 115 transitions. [2018-02-04 03:22:59,612 INFO L78 Accepts]: Start accepts. Automaton has 113 states and 115 transitions. Word has length 94 [2018-02-04 03:22:59,613 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 03:22:59,613 INFO L432 AbstractCegarLoop]: Abstraction has 113 states and 115 transitions. [2018-02-04 03:22:59,613 INFO L433 AbstractCegarLoop]: Interpolant automaton has 58 states. [2018-02-04 03:22:59,613 INFO L276 IsEmpty]: Start isEmpty. Operand 113 states and 115 transitions. [2018-02-04 03:22:59,613 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 95 [2018-02-04 03:22:59,613 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 03:22:59,613 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] [2018-02-04 03:22:59,613 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_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-04 03:22:59,613 INFO L82 PathProgramCache]: Analyzing trace with hash -105234463, now seen corresponding path program 1 times [2018-02-04 03:22:59,614 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-04 03:22:59,638 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 03:22:59,639 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 03:23:00,515 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-04 03:23:00,515 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-04 03:23:00,515 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [36] imperfect sequences [] total 36 [2018-02-04 03:23:00,515 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-04 03:23:00,515 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-04 03:23:00,515 INFO L182 omatonBuilderFactory]: Interpolants [9731#true, 9732#false, 9733#(= 0 |ldv_malloc_#t~malloc4.offset|), 9734#(= 0 |ldv_malloc_#res.offset|), 9735#(= 0 |ldv_kobject_create_#t~ret14.offset|), 9736#(= 0 ldv_kobject_create_~kobj~1.offset), 9737#(or (not (= |#Ultimate.C_memset_#ptr.offset| 0)) (<= |#Ultimate.C_memset_#t~loopctr17| |#Ultimate.C_memset_#amount|)), 9738#(and (= |ldv_kobject_init_#in~kobj.offset| ldv_kobject_init_~kobj.offset) (= ldv_kobject_init_~kobj.base |ldv_kobject_init_#in~kobj.base|)), 9739#(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|))), 9740#(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|))), 9741#(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|)), 9742#(= 1 (select (select |#memory_int| |ldv_kref_init_#in~kref.base|) (- (- |ldv_kref_init_#in~kref.offset|)))), 9743#(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)))), 9744#(= |#memory_int| |old(#memory_int)|), 9745#(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|)), 9746#(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|)), 9747#(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)))), 9748#(or (= 1 (select (select |#memory_int| |ldv_kobject_init_internal_#in~kobj.base|) (- (- 12)))) (not (= |ldv_kobject_init_internal_#in~kobj.offset| 0))), 9749#(or (= 1 (select (select |#memory_int| |ldv_kobject_init_#in~kobj.base|) (- (- 12)))) (not (= |ldv_kobject_init_#in~kobj.offset| 0))), 9750#(and (= 0 ldv_kobject_create_~kobj~1.offset) (= 1 (select (select |#memory_int| ldv_kobject_create_~kobj~1.base) 12))), 9751#(and (= 1 (select (select |#memory_int| |ldv_kobject_create_#res.base|) 12)) (= 0 |ldv_kobject_create_#res.offset|)), 9752#(and (= 1 (select (select |#memory_int| |entry_point_#t~ret16.base|) 12)) (= 0 |entry_point_#t~ret16.offset|)), 9753#(and (= 0 entry_point_~kobj~2.offset) (= 1 (select (select |#memory_int| entry_point_~kobj~2.base) 12))), 9754#(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|))), 9755#(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)|)), 9756#(and (<= |ldv_kref_put_#in~kref.offset| ldv_kref_put_~kref.offset) (= |ldv_kref_put_#in~kref.base| ldv_kref_put_~kref.base) (= |#memory_int| |old(#memory_int)|) (<= ldv_kref_put_~kref.offset |ldv_kref_put_#in~kref.offset|)), 9757#(and (or (not (= ldv_kref_sub_~count 1)) (and (<= |ldv_kref_sub_#in~kref.offset| ldv_kref_sub_~kref.offset) (= |ldv_kref_sub_#in~kref.base| ldv_kref_sub_~kref.base) (<= ldv_kref_sub_~kref.offset |ldv_kref_sub_#in~kref.offset|) (= |#memory_int| |old(#memory_int)|))) (or (= |ldv_kref_sub_#in~count| ldv_kref_sub_~count) (= ldv_kref_sub_~count 1))), 9758#(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|)), 9759#(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~mem7|) (= |#memory_int| |old(#memory_int)|) (= ldv_atomic_sub_return_~v.base |ldv_atomic_sub_return_#in~v.base|)), 9760#(and (or (and (<= 1 (+ ldv_atomic_sub_return_~temp~0 |ldv_atomic_sub_return_#in~i|)) (<= (+ ldv_atomic_sub_return_~temp~0 |ldv_atomic_sub_return_#in~i|) 1)) (not (= (select (select |#memory_int| ldv_atomic_sub_return_~v.base) ldv_atomic_sub_return_~v.offset) 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|)), 9761#(or (and (<= 1 (+ ldv_atomic_sub_return_~temp~0 |ldv_atomic_sub_return_#in~i|)) (<= (+ ldv_atomic_sub_return_~temp~0 |ldv_atomic_sub_return_#in~i|) 1)) (not (= (select (select |old(#memory_int)| |ldv_atomic_sub_return_#in~v.base|) (- (- |ldv_atomic_sub_return_#in~v.offset|))) 1))), 9762#(or (and (<= 1 (+ |ldv_atomic_sub_return_#in~i| |ldv_atomic_sub_return_#res|)) (<= (+ |ldv_atomic_sub_return_#in~i| |ldv_atomic_sub_return_#res|) 1)) (not (= (select (select |old(#memory_int)| |ldv_atomic_sub_return_#in~v.base|) (- (- |ldv_atomic_sub_return_#in~v.offset|))) 1))), 9763#(or (and (<= |ldv_kref_sub_#t~ret9| 0) (<= 0 |ldv_kref_sub_#t~ret9|)) (not (= (select (select |old(#memory_int)| |ldv_kref_sub_#in~kref.base|) (- (- |ldv_kref_sub_#in~kref.offset|))) 1)) (not (= |ldv_kref_sub_#in~count| 1))), 9764#(or (not (= (select (select |old(#memory_int)| |ldv_kref_sub_#in~kref.base|) (- (- |ldv_kref_sub_#in~kref.offset|))) 1)) (not (= |ldv_kref_sub_#in~count| 1))), 9765#(not (= (select (select |old(#memory_int)| |ldv_kref_put_#in~kref.base|) (- (- |ldv_kref_put_#in~kref.offset|))) 1)), 9766#(or (not (= (select (select |old(#memory_int)| |ldv_kobject_put_#in~kobj.base|) (- (- 12))) 1)) (not (= |ldv_kobject_put_#in~kobj.offset| 0)))] [2018-02-04 03:23:00,516 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-04 03:23:00,516 INFO L409 AbstractCegarLoop]: Interpolant automaton has 36 states [2018-02-04 03:23:00,516 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 36 interpolants. [2018-02-04 03:23:00,516 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=94, Invalid=1166, Unknown=0, NotChecked=0, Total=1260 [2018-02-04 03:23:00,516 INFO L87 Difference]: Start difference. First operand 113 states and 115 transitions. Second operand 36 states. [2018-02-04 03:23:01,398 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 03:23:01,398 INFO L93 Difference]: Finished difference Result 121 states and 122 transitions. [2018-02-04 03:23:01,399 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 34 states. [2018-02-04 03:23:01,399 INFO L78 Accepts]: Start accepts. Automaton has 36 states. Word has length 94 [2018-02-04 03:23:01,399 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 03:23:01,399 INFO L225 Difference]: With dead ends: 121 [2018-02-04 03:23:01,400 INFO L226 Difference]: Without dead ends: 113 [2018-02-04 03:23:01,400 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 61 GetRequests, 7 SyntacticMatches, 6 SemanticMatches, 48 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 377 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=167, Invalid=2283, Unknown=0, NotChecked=0, Total=2450 [2018-02-04 03:23:01,400 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 113 states. [2018-02-04 03:23:01,402 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 113 to 113. [2018-02-04 03:23:01,402 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 113 states. [2018-02-04 03:23:01,402 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 113 states to 113 states and 114 transitions. [2018-02-04 03:23:01,402 INFO L78 Accepts]: Start accepts. Automaton has 113 states and 114 transitions. Word has length 94 [2018-02-04 03:23:01,403 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 03:23:01,403 INFO L432 AbstractCegarLoop]: Abstraction has 113 states and 114 transitions. [2018-02-04 03:23:01,403 INFO L433 AbstractCegarLoop]: Interpolant automaton has 36 states. [2018-02-04 03:23:01,403 INFO L276 IsEmpty]: Start isEmpty. Operand 113 states and 114 transitions. [2018-02-04 03:23:01,404 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 112 [2018-02-04 03:23:01,404 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 03:23:01,404 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] [2018-02-04 03:23:01,404 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_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-04 03:23:01,404 INFO L82 PathProgramCache]: Analyzing trace with hash 100256663, now seen corresponding path program 1 times [2018-02-04 03:23:01,405 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-04 03:23:01,425 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 03:23:01,426 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 03:23:01,908 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-04 03:23:01,908 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-04 03:23:01,908 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [21] imperfect sequences [] total 21 [2018-02-04 03:23:01,908 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-04 03:23:01,909 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 03:23:01,909 INFO L182 omatonBuilderFactory]: Interpolants [10048#(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|)), 10049#(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|)))), 10050#(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|)), 10029#true, 10030#false, 10031#(= |#valid| |old(#valid)|), 10032#(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))), 10033#(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))), 10034#(and (= |old(#valid)| (store |#valid| |ldv_kobject_create_#t~ret14.base| (select |old(#valid)| |ldv_kobject_create_#t~ret14.base|))) (= 0 (select |old(#valid)| |ldv_kobject_create_#t~ret14.base|)) (not (= |ldv_kobject_create_#t~ret14.base| 0))), 10035#(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))), 10036#(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))), 10037#(and (not (= |entry_point_#t~ret16.base| 0)) (= (store |#valid| |entry_point_#t~ret16.base| (select |old(#valid)| |entry_point_#t~ret16.base|)) |old(#valid)|) (= 0 (select |old(#valid)| |entry_point_#t~ret16.base|))), 10038#(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))), 10039#(and (= |#valid| |old(#valid)|) (= ldv_kobject_put_~kobj.base |ldv_kobject_put_#in~kobj.base|)), 10040#(and (= |#valid| |old(#valid)|) (= ldv_kref_put_~kref.base |ldv_kref_put_#in~kref.base|)), 10041#(and (= |#valid| |old(#valid)|) (= ldv_kref_sub_~kref.base |ldv_kref_sub_#in~kref.base|)), 10042#(and (= |#valid| |old(#valid)|) (= |##fun~$Pointer$~TO~VOID_#~kref.base| |##fun~$Pointer$~TO~VOID_#in~kref.base|)), 10043#(and (= ldv_kobject_release_~kobj~0.base |ldv_kobject_release_#in~kref.base|) (= |#valid| |old(#valid)|)), 10044#(and (= ldv_kobject_cleanup_~kobj.base |ldv_kobject_cleanup_#in~kobj.base|) (= |#valid| |old(#valid)|)), 10045#(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|))))), 10046#(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|)))), 10047#(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|))] [2018-02-04 03:23:01,909 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-04 03:23:01,909 INFO L409 AbstractCegarLoop]: Interpolant automaton has 22 states [2018-02-04 03:23:01,909 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2018-02-04 03:23:01,909 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=415, Unknown=0, NotChecked=0, Total=462 [2018-02-04 03:23:01,909 INFO L87 Difference]: Start difference. First operand 113 states and 114 transitions. Second operand 22 states. [2018-02-04 03:23:02,434 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 03:23:02,434 INFO L93 Difference]: Finished difference Result 131 states and 131 transitions. [2018-02-04 03:23:02,434 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2018-02-04 03:23:02,434 INFO L78 Accepts]: Start accepts. Automaton has 22 states. Word has length 111 [2018-02-04 03:23:02,435 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 03:23:02,435 INFO L225 Difference]: With dead ends: 131 [2018-02-04 03:23:02,435 INFO L226 Difference]: Without dead ends: 113 [2018-02-04 03:23:02,435 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 35 GetRequests, 11 SyntacticMatches, 1 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 57 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=59, Invalid=541, Unknown=0, NotChecked=0, Total=600 [2018-02-04 03:23:02,435 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 113 states. [2018-02-04 03:23:02,437 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 113 to 113. [2018-02-04 03:23:02,437 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 113 states. [2018-02-04 03:23:02,437 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 113 states to 113 states and 113 transitions. [2018-02-04 03:23:02,437 INFO L78 Accepts]: Start accepts. Automaton has 113 states and 113 transitions. Word has length 111 [2018-02-04 03:23:02,437 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 03:23:02,438 INFO L432 AbstractCegarLoop]: Abstraction has 113 states and 113 transitions. [2018-02-04 03:23:02,438 INFO L433 AbstractCegarLoop]: Interpolant automaton has 22 states. [2018-02-04 03:23:02,438 INFO L276 IsEmpty]: Start isEmpty. Operand 113 states and 113 transitions. [2018-02-04 03:23:02,438 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 113 [2018-02-04 03:23:02,438 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 03:23:02,439 INFO L351 BasicCegarLoop]: trace histogram [16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 03:23:02,439 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_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-04 03:23:02,439 INFO L82 PathProgramCache]: Analyzing trace with hash 1335816373, now seen corresponding path program 1 times [2018-02-04 03:23:02,440 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-04 03:23:02,488 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 03:23:02,489 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 03:23:04,818 INFO L134 CoverageAnalysis]: Checked inductivity of 136 backedges. 0 proven. 136 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 03:23:04,818 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-04 03:23:04,818 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [60] total 60 [2018-02-04 03:23:04,819 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-04 03:23:04,819 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-04 03:23:04,820 INFO L182 omatonBuilderFactory]: Interpolants [10301#true, 10302#false, 10303#(= 0 |ldv_malloc_#t~malloc4.offset|), 10304#(= 0 |ldv_malloc_#res.offset|), 10305#(= 0 |ldv_kobject_create_#t~ret14.offset|), 10306#(= 0 ldv_kobject_create_~kobj~1.offset), 10307#(or (= |#Ultimate.C_memset_#t~loopctr17| 0) (not (= |#Ultimate.C_memset_#ptr.offset| 0))), 10308#(or (and (not (= 1 (+ |#Ultimate.C_memset_#t~loopctr17| |#Ultimate.C_memset_#ptr.offset|))) (<= |#Ultimate.C_memset_#t~loopctr17| 1)) (not (= |#Ultimate.C_memset_#ptr.offset| 0)) (and (= 0 (select (store (select |#memory_$Pointer$.base| |#Ultimate.C_memset_#ptr.base|) (+ |#Ultimate.C_memset_#ptr.offset| |#Ultimate.C_memset_#t~loopctr17|) 0) 0)) (<= |#Ultimate.C_memset_#t~loopctr17| 1))), 10309#(or (<= (+ |#Ultimate.C_memset_#t~loopctr17| |#Ultimate.C_memset_#ptr.offset|) 1) (not (= |#Ultimate.C_memset_#ptr.offset| 0)) (and (<= |#Ultimate.C_memset_#t~loopctr17| 2) (= 0 (select (store (select |#memory_$Pointer$.base| |#Ultimate.C_memset_#ptr.base|) (+ |#Ultimate.C_memset_#ptr.offset| |#Ultimate.C_memset_#t~loopctr17|) 0) 0)))), 10310#(or (not (= |#Ultimate.C_memset_#ptr.offset| 0)) (and (= 0 (select (store (select |#memory_$Pointer$.base| |#Ultimate.C_memset_#ptr.base|) (+ |#Ultimate.C_memset_#ptr.offset| |#Ultimate.C_memset_#t~loopctr17|) 0) 0)) (<= |#Ultimate.C_memset_#t~loopctr17| 3)) (<= (+ |#Ultimate.C_memset_#t~loopctr17| |#Ultimate.C_memset_#ptr.offset|) 2)), 10311#(or (<= (+ |#Ultimate.C_memset_#t~loopctr17| |#Ultimate.C_memset_#ptr.offset|) 3) (not (= |#Ultimate.C_memset_#ptr.offset| 0)) (and (<= |#Ultimate.C_memset_#t~loopctr17| 4) (= 0 (select (store (select |#memory_$Pointer$.base| |#Ultimate.C_memset_#ptr.base|) (+ |#Ultimate.C_memset_#ptr.offset| |#Ultimate.C_memset_#t~loopctr17|) 0) 0)))), 10312#(or (not (= |#Ultimate.C_memset_#ptr.offset| 0)) (<= (+ |#Ultimate.C_memset_#t~loopctr17| |#Ultimate.C_memset_#ptr.offset|) 4) (and (<= |#Ultimate.C_memset_#t~loopctr17| 5) (= 0 (select (store (select |#memory_$Pointer$.base| |#Ultimate.C_memset_#ptr.base|) (+ |#Ultimate.C_memset_#t~loopctr17| |#Ultimate.C_memset_#ptr.offset|) 0) 0)))), 10313#(or (not (= |#Ultimate.C_memset_#ptr.offset| 0)) (<= (+ |#Ultimate.C_memset_#t~loopctr17| |#Ultimate.C_memset_#ptr.offset|) 5) (and (= 0 (select (store (select |#memory_$Pointer$.base| |#Ultimate.C_memset_#ptr.base|) (+ |#Ultimate.C_memset_#t~loopctr17| |#Ultimate.C_memset_#ptr.offset|) 0) 0)) (<= |#Ultimate.C_memset_#t~loopctr17| 6))), 10314#(or (and (= 0 (select (store (select |#memory_$Pointer$.base| |#Ultimate.C_memset_#ptr.base|) (+ |#Ultimate.C_memset_#t~loopctr17| |#Ultimate.C_memset_#ptr.offset|) 0) 0)) (<= |#Ultimate.C_memset_#t~loopctr17| 7)) (<= |#Ultimate.C_memset_#t~loopctr17| 6) (not (= |#Ultimate.C_memset_#ptr.offset| 0))), 10315#(or (and (= 0 (select (store (select |#memory_$Pointer$.base| |#Ultimate.C_memset_#ptr.base|) (+ |#Ultimate.C_memset_#t~loopctr17| |#Ultimate.C_memset_#ptr.offset|) 0) 0)) (<= |#Ultimate.C_memset_#t~loopctr17| 8)) (not (= |#Ultimate.C_memset_#ptr.offset| 0)) (<= (+ |#Ultimate.C_memset_#t~loopctr17| |#Ultimate.C_memset_#ptr.offset|) 7)), 10316#(or (not (= |#Ultimate.C_memset_#ptr.offset| 0)) (and (<= |#Ultimate.C_memset_#t~loopctr17| 9) (= 0 (select (store (select |#memory_$Pointer$.base| |#Ultimate.C_memset_#ptr.base|) (+ |#Ultimate.C_memset_#t~loopctr17| |#Ultimate.C_memset_#ptr.offset|) 0) 0))) (<= (+ |#Ultimate.C_memset_#t~loopctr17| |#Ultimate.C_memset_#ptr.offset|) 8)), 10317#(or (not (= |#Ultimate.C_memset_#ptr.offset| 0)) (<= (+ |#Ultimate.C_memset_#t~loopctr17| |#Ultimate.C_memset_#ptr.offset|) 9) (and (<= |#Ultimate.C_memset_#t~loopctr17| 10) (= 0 (select (store (select |#memory_$Pointer$.base| |#Ultimate.C_memset_#ptr.base|) (+ |#Ultimate.C_memset_#ptr.offset| |#Ultimate.C_memset_#t~loopctr17|) 0) 0)))), 10318#(or (and (<= |#Ultimate.C_memset_#t~loopctr17| 11) (= 0 (select (store (select |#memory_$Pointer$.base| |#Ultimate.C_memset_#ptr.base|) (+ |#Ultimate.C_memset_#ptr.offset| |#Ultimate.C_memset_#t~loopctr17|) 0) 0))) (<= |#Ultimate.C_memset_#t~loopctr17| 10) (not (= |#Ultimate.C_memset_#ptr.offset| 0))), 10319#(or (= 0 (select (store (select |#memory_$Pointer$.base| |#Ultimate.C_memset_#ptr.base|) (+ |#Ultimate.C_memset_#ptr.offset| |#Ultimate.C_memset_#t~loopctr17|) 0) 0)) (not (= |#Ultimate.C_memset_#ptr.offset| 0)) (<= (+ |#Ultimate.C_memset_#t~loopctr17| |#Ultimate.C_memset_#ptr.offset|) 11)), 10320#(or (= 0 (select (store (select |#memory_$Pointer$.base| |#Ultimate.C_memset_#ptr.base|) (+ |#Ultimate.C_memset_#ptr.offset| |#Ultimate.C_memset_#t~loopctr17|) 0) 0)) (not (= |#Ultimate.C_memset_#ptr.offset| 0)) (<= (+ |#Ultimate.C_memset_#t~loopctr17| |#Ultimate.C_memset_#ptr.offset|) 12)), 10321#(or (<= |#Ultimate.C_memset_#t~loopctr17| 13) (= 0 (select (store (select |#memory_$Pointer$.base| |#Ultimate.C_memset_#ptr.base|) (+ |#Ultimate.C_memset_#ptr.offset| |#Ultimate.C_memset_#t~loopctr17|) 0) 0)) (not (= |#Ultimate.C_memset_#ptr.offset| 0))), 10322#(or (= 0 (select (store (select |#memory_$Pointer$.base| |#Ultimate.C_memset_#ptr.base|) (+ |#Ultimate.C_memset_#ptr.offset| |#Ultimate.C_memset_#t~loopctr17|) 0) 0)) (not (= |#Ultimate.C_memset_#ptr.offset| 0)) (<= (+ |#Ultimate.C_memset_#t~loopctr17| |#Ultimate.C_memset_#ptr.offset|) 14)), 10323#(or (= 0 (select (select |#memory_$Pointer$.base| |#Ultimate.C_memset_#ptr.base|) 0)) (not (= |#Ultimate.C_memset_#ptr.offset| 0)) (<= (+ |#Ultimate.C_memset_#t~loopctr17| |#Ultimate.C_memset_#ptr.offset|) 15)), 10324#(or (= 0 (select (select |#memory_$Pointer$.base| |#Ultimate.C_memset_#ptr.base|) 0)) (not (= |#Ultimate.C_memset_#ptr.offset| 0)) (<= |#Ultimate.C_memset_#amount| 15)), 10325#(and (= 0 ldv_kobject_create_~kobj~1.offset) (= 0 (select (select |#memory_$Pointer$.base| ldv_kobject_create_~kobj~1.base) 0))), 10326#(= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|), 10327#(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)), 10328#(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))), 10329#(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)))), 10330#(and (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (<= |ldv_kref_init_#in~kref.offset| ldv_kref_init_~kref.offset) (= ldv_kref_init_~kref.base |ldv_kref_init_#in~kref.base|)), 10331#(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|))), 10332#(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_#in~kobj.base| ldv_kobject_init_internal_~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)))), 10333#(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|)), 10334#(and (= LDV_INIT_LIST_HEAD_~list.base |LDV_INIT_LIST_HEAD_#in~list.base|) (not (= (+ LDV_INIT_LIST_HEAD_~list.offset 4) 0)) (= (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|)), 10335#(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|))) (not (= (+ |LDV_INIT_LIST_HEAD_#in~list.offset| 4) 0)) (= (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|))))))), 10336#(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))), 10337#(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))), 10338#(and (= 0 (select (select |#memory_$Pointer$.base| |ldv_kobject_create_#res.base|) 0)) (= 0 |ldv_kobject_create_#res.offset|)), 10339#(and (= 0 (select (select |#memory_$Pointer$.base| |entry_point_#t~ret16.base|) 0)) (= 0 |entry_point_#t~ret16.offset|)), 10340#(and (= 0 entry_point_~kobj~2.offset) (= 0 (select (select |#memory_$Pointer$.base| entry_point_~kobj~2.base) 0))), 10341#(and (or (not (= ldv_kobject_put_~kobj.offset 0)) (and (= ldv_kobject_put_~kobj.base |ldv_kobject_put_#in~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|))), 10342#(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_~kobj.base |ldv_kobject_put_#in~kobj.base|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|)))), 10343#(and (<= |ldv_kref_put_#in~kref.offset| ldv_kref_put_~kref.offset) (= ldv_kref_put_~kref.base |ldv_kref_put_#in~kref.base|) (<= ldv_kref_put_~kref.offset |ldv_kref_put_#in~kref.offset|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|)), 10344#(and (<= |ldv_kref_sub_#in~kref.offset| ldv_kref_sub_~kref.offset) (= ldv_kref_sub_~kref.base |ldv_kref_sub_#in~kref.base|) (<= ldv_kref_sub_~kref.offset |ldv_kref_sub_#in~kref.offset|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|)), 10345#(and (<= ldv_atomic_sub_return_~v.offset |ldv_atomic_sub_return_#in~v.offset|) (<= |ldv_atomic_sub_return_#in~v.offset| ldv_atomic_sub_return_~v.offset) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= ldv_atomic_sub_return_~v.base |ldv_atomic_sub_return_#in~v.base|)), 10346#(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|)))))), 10347#(and (or (<= |ldv_kref_sub_#in~kref.offset| (@diff (select |old(#memory_$Pointer$.base)| |ldv_kref_sub_#in~kref.base|) (select |#memory_$Pointer$.base| ldv_kref_sub_~kref.base))) (= (select |#memory_$Pointer$.base| ldv_kref_sub_~kref.base) (select |old(#memory_$Pointer$.base)| |ldv_kref_sub_#in~kref.base|))) (= (store (select |old(#memory_$Pointer$.base)| |ldv_kref_sub_#in~kref.base|) (@diff (select |old(#memory_$Pointer$.base)| |ldv_kref_sub_#in~kref.base|) (select |#memory_$Pointer$.base| ldv_kref_sub_~kref.base)) (select (select |#memory_$Pointer$.base| ldv_kref_sub_~kref.base) (@diff (select |old(#memory_$Pointer$.base)| |ldv_kref_sub_#in~kref.base|) (select |#memory_$Pointer$.base| ldv_kref_sub_~kref.base)))) (select |#memory_$Pointer$.base| ldv_kref_sub_~kref.base))), 10348#(= |##fun~$Pointer$~TO~VOID_#in~kref.base| |##fun~$Pointer$~TO~VOID_#~kref.base|), 10349#(= |ldv_kobject_release_#in~kref.base| ldv_kobject_release_~kobj~0.base), 10350#(or (= ldv_kobject_cleanup_~kobj.base |ldv_kobject_cleanup_#in~kobj.base|) (not (= 0 ldv_kobject_cleanup_~kobj.offset))), 10351#(or (not (= 0 ldv_kobject_cleanup_~kobj.offset)) (and (= ldv_kobject_cleanup_~kobj.base |ldv_kobject_cleanup_#in~kobj.base|) (= (select (select |#memory_$Pointer$.base| ldv_kobject_cleanup_~kobj.base) ldv_kobject_cleanup_~kobj.offset) |ldv_kobject_cleanup_#t~mem12.base|))), 10352#(or (and (= ldv_kobject_cleanup_~name~0.base (select (select |#memory_$Pointer$.base| ldv_kobject_cleanup_~kobj.base) ldv_kobject_cleanup_~kobj.offset)) (= ldv_kobject_cleanup_~kobj.base |ldv_kobject_cleanup_#in~kobj.base|)) (not (= 0 ldv_kobject_cleanup_~kobj.offset))), 10353#(= ldv_kobject_cleanup_~name~0.base (select (select |#memory_$Pointer$.base| |ldv_kobject_cleanup_#in~kobj.base|) 0)), 10354#(and (or (not (= 0 ldv_kobject_cleanup_~name~0.offset)) (not (= ldv_kobject_cleanup_~name~0.base 0))) (or (= (select (select |#memory_$Pointer$.base| |ldv_kobject_cleanup_#in~kobj.base|) 0) ldv_kobject_cleanup_~name~0.base) (= ldv_kobject_cleanup_~name~0.base 0))), 10355#(not (= (select (select |#memory_$Pointer$.base| |ldv_kobject_cleanup_#in~kobj.base|) 0) 0)), 10356#(not (= (select (select |#memory_$Pointer$.base| |ldv_kobject_release_#in~kref.base|) 0) 0)), 10357#(not (= (select (select |#memory_$Pointer$.base| |##fun~$Pointer$~TO~VOID_#in~kref.base|) 0) 0)), 10358#(or (not (= (select (select |old(#memory_$Pointer$.base)| |ldv_kref_sub_#in~kref.base|) 0) 0)) (<= |ldv_kref_sub_#in~kref.offset| 0)), 10359#(or (<= |ldv_kref_put_#in~kref.offset| 0) (not (= (select (select |old(#memory_$Pointer$.base)| |ldv_kref_put_#in~kref.base|) 0) 0))), 10360#(or (not (= (select (select |old(#memory_$Pointer$.base)| |ldv_kobject_put_#in~kobj.base|) 0) 0)) (not (= |ldv_kobject_put_#in~kobj.offset| 0)))] [2018-02-04 03:23:04,820 INFO L134 CoverageAnalysis]: Checked inductivity of 136 backedges. 0 proven. 136 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 03:23:04,820 INFO L409 AbstractCegarLoop]: Interpolant automaton has 60 states [2018-02-04 03:23:04,820 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 60 interpolants. [2018-02-04 03:23:04,821 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=299, Invalid=3241, Unknown=0, NotChecked=0, Total=3540 [2018-02-04 03:23:04,821 INFO L87 Difference]: Start difference. First operand 113 states and 113 transitions. Second operand 60 states. [2018-02-04 03:23:07,255 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 03:23:07,255 INFO L93 Difference]: Finished difference Result 109 states and 109 transitions. [2018-02-04 03:23:07,255 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 57 states. [2018-02-04 03:23:07,255 INFO L78 Accepts]: Start accepts. Automaton has 60 states. Word has length 112 [2018-02-04 03:23:07,255 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 03:23:07,256 INFO L225 Difference]: With dead ends: 109 [2018-02-04 03:23:07,256 INFO L226 Difference]: Without dead ends: 0 [2018-02-04 03:23:07,257 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 106 GetRequests, 12 SyntacticMatches, 1 SemanticMatches, 93 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1768 ImplicationChecksByTransitivity, 2.7s TimeCoverageRelationStatistics Valid=795, Invalid=8135, Unknown=0, NotChecked=0, Total=8930 [2018-02-04 03:23:07,257 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2018-02-04 03:23:07,257 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2018-02-04 03:23:07,257 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2018-02-04 03:23:07,257 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2018-02-04 03:23:07,257 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 112 [2018-02-04 03:23:07,257 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 03:23:07,257 INFO L432 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-02-04 03:23:07,257 INFO L433 AbstractCegarLoop]: Interpolant automaton has 60 states. [2018-02-04 03:23:07,257 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2018-02-04 03:23:07,258 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-02-04 03:23:07,261 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 04.02 03:23:07 BoogieIcfgContainer [2018-02-04 03:23:07,261 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-02-04 03:23:07,261 INFO L168 Benchmark]: Toolchain (without parser) took 26842.40 ms. Allocated memory was 409.5 MB in the beginning and 1.4 GB in the end (delta: 1.0 GB). Free memory was 365.9 MB in the beginning and 1.2 GB in the end (delta: -874.4 MB). Peak memory consumption was 162.7 MB. Max. memory is 5.3 GB. [2018-02-04 03:23:07,262 INFO L168 Benchmark]: CDTParser took 0.09 ms. Allocated memory is still 409.5 MB. Free memory is still 372.5 MB. There was no memory consumed. Max. memory is 5.3 GB. [2018-02-04 03:23:07,262 INFO L168 Benchmark]: CACSL2BoogieTranslator took 174.02 ms. Allocated memory is still 409.5 MB. Free memory was 365.9 MB in the beginning and 351.4 MB in the end (delta: 14.5 MB). Peak memory consumption was 14.5 MB. Max. memory is 5.3 GB. [2018-02-04 03:23:07,262 INFO L168 Benchmark]: Boogie Preprocessor took 26.49 ms. Allocated memory is still 409.5 MB. Free memory was 351.4 MB in the beginning and 350.1 MB in the end (delta: 1.3 MB). Peak memory consumption was 1.3 MB. Max. memory is 5.3 GB. [2018-02-04 03:23:07,263 INFO L168 Benchmark]: RCFGBuilder took 382.13 ms. Allocated memory is still 409.5 MB. Free memory was 350.1 MB in the beginning and 316.9 MB in the end (delta: 33.2 MB). Peak memory consumption was 33.2 MB. Max. memory is 5.3 GB. [2018-02-04 03:23:07,263 INFO L168 Benchmark]: TraceAbstraction took 26257.20 ms. Allocated memory was 409.5 MB in the beginning and 1.4 GB in the end (delta: 1.0 GB). Free memory was 316.9 MB in the beginning and 1.2 GB in the end (delta: -923.4 MB). Peak memory consumption was 113.7 MB. Max. memory is 5.3 GB. [2018-02-04 03:23:07,263 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.09 ms. Allocated memory is still 409.5 MB. Free memory is still 372.5 MB. There was no memory consumed. Max. memory is 5.3 GB. * CACSL2BoogieTranslator took 174.02 ms. Allocated memory is still 409.5 MB. Free memory was 365.9 MB in the beginning and 351.4 MB in the end (delta: 14.5 MB). Peak memory consumption was 14.5 MB. Max. memory is 5.3 GB. * Boogie Preprocessor took 26.49 ms. Allocated memory is still 409.5 MB. Free memory was 351.4 MB in the beginning and 350.1 MB in the end (delta: 1.3 MB). Peak memory consumption was 1.3 MB. Max. memory is 5.3 GB. * RCFGBuilder took 382.13 ms. Allocated memory is still 409.5 MB. Free memory was 350.1 MB in the beginning and 316.9 MB in the end (delta: 33.2 MB). Peak memory consumption was 33.2 MB. Max. memory is 5.3 GB. * TraceAbstraction took 26257.20 ms. Allocated memory was 409.5 MB in the beginning and 1.4 GB in the end (delta: 1.0 GB). Free memory was 316.9 MB in the beginning and 1.2 GB in the end (delta: -923.4 MB). Peak memory consumption was 113.7 MB. Max. memory is 5.3 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 1]: free always succeeds For all program executions holds that free always succeeds at this location - PositiveResult [Line: 1]: free always succeeds For all program executions holds that free always succeeds at this location - PositiveResult [Line: 1]: free always succeeds For all program executions holds that free always succeeds at this location - PositiveResult [Line: 1]: free always succeeds For all program executions holds that free always succeeds at this location - PositiveResult [Line: 1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 1441]: all allocated memory was freed For all program executions holds that all allocated memory was freed at this location - PositiveResult [Line: 1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - AllSpecificationsHoldResult: All specifications hold 19 specifications checked. All of them hold - StatisticsResult: Ultimate Automizer benchmark data CFG has 18 procedures, 118 locations, 19 error locations. SAFE Result, 26.2s OverallTime, 39 OverallIterations, 16 TraceHistogramMax, 12.8s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 3963 SDtfs, 808 SDslu, 34591 SDs, 0 SdLazy, 17297 SolverSat, 363 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 6.8s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 904 GetRequests, 119 SyntacticMatches, 10 SemanticMatches, 775 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6004 ImplicationChecksByTransitivity, 13.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=129occurred in iteration=22, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 1904/2992 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s AbstIntTime, 0 AbstIntIterations, 0 AbstIntStrong, NaN AbsIntWeakeningRatio, NaN AbsIntAvgWeakeningVarsNumRemoved, NaN AbsIntAvgWeakenedConjuncts, 0.0s DumpTime, AutomataMinimizationStatistics: 0.1s AutomataMinimizationTime, 39 MinimizatonAttempts, 32 StatesRemovedByMinimization, 7 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.5s SatisfiabilityAnalysisTime, 12.1s InterpolantComputationTime, 2142 NumberOfCodeBlocks, 2142 NumberOfCodeBlocksAsserted, 39 NumberOfCheckSat, 2103 ConstructedInterpolants, 0 QuantifiedInterpolants, 1479441 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 39 InterpolantComputations, 21 PerfectInterpolantSequences, 1904/2992 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be correct! Written .csv to /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/memleaks_test22_1_true-valid-memsafety_true-termination.i_svcomp-DerefFreeMemtrack-32bit-Automizer_SmtInterpol_Array.epf_AutomizerC.xml/Csv-Benchmark-0-2018-02-04_03-23-07-268.csv Written .csv to /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/memleaks_test22_1_true-valid-memsafety_true-termination.i_svcomp-DerefFreeMemtrack-32bit-Automizer_SmtInterpol_Array.epf_AutomizerC.xml/Csv-TraceAbstractionBenchmarks-0-2018-02-04_03-23-07-268.csv Received shutdown request...