java -Xmx6000000000 -jar ./plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data ./data --generate-csv --csv-dir ../../../releaseScripts/default/UAutomizer-linux/csv -tc ../../../trunk/examples/toolchains/AutomizerC.xml -s ../../../trunk/examples/settings/cav18-smtinterpol/svcomp-DerefFreeMemtrack-32bit-Automizer_SmtInterpol_NoArray.epf -i ../../../trunk/examples/svcomp/ldv-memsafety/memleaks_test22_1_true-valid-memsafety_true-termination.i -------------------------------------------------------------------------------- This is Ultimate 0.1.23-26d9e06-m [2018-02-02 10:48:19,115 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-02-02 10:48:19,116 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-02-02 10:48:19,128 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-02-02 10:48:19,128 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-02-02 10:48:19,128 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-02-02 10:48:19,129 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-02-02 10:48:19,131 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-02-02 10:48:19,132 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-02-02 10:48:19,133 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-02-02 10:48:19,133 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-02-02 10:48:19,133 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-02-02 10:48:19,134 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-02-02 10:48:19,135 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-02-02 10:48:19,136 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-02-02 10:48:19,137 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-02-02 10:48:19,139 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-02-02 10:48:19,140 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-02-02 10:48:19,141 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-02-02 10:48:19,142 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-02-02 10:48:19,144 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-02-02 10:48:19,144 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-02-02 10:48:19,144 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-02-02 10:48:19,145 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-02-02 10:48:19,145 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-02-02 10:48:19,146 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-02-02 10:48:19,147 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-02-02 10:48:19,147 INFO L177 SettingsManager]: PEA to Boogie provides no preferences, ignoring... [2018-02-02 10:48:19,147 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-02-02 10:48:19,147 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-02-02 10:48:19,147 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-02-02 10:48:19,148 INFO L98 SettingsManager]: Beginning loading settings from /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/cav18-smtinterpol/svcomp-DerefFreeMemtrack-32bit-Automizer_SmtInterpol_NoArray.epf [2018-02-02 10:48:19,156 INFO L110 SettingsManager]: Loading preferences was successful [2018-02-02 10:48:19,157 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-02-02 10:48:19,157 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-02-02 10:48:19,157 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-02-02 10:48:19,158 INFO L133 SettingsManager]: * Use SBE=true [2018-02-02 10:48:19,158 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-02-02 10:48:19,158 INFO L133 SettingsManager]: * sizeof long=4 [2018-02-02 10:48:19,158 INFO L133 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2018-02-02 10:48:19,158 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-02-02 10:48:19,158 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-02-02 10:48:19,158 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-02-02 10:48:19,158 INFO L133 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2018-02-02 10:48:19,158 INFO L133 SettingsManager]: * Bitprecise bitfields=true [2018-02-02 10:48:19,159 INFO L133 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2018-02-02 10:48:19,159 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-02-02 10:48:19,159 INFO L133 SettingsManager]: * sizeof long double=12 [2018-02-02 10:48:19,159 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-02-02 10:48:19,159 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-02-02 10:48:19,159 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-02-02 10:48:19,159 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-02-02 10:48:19,159 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-02-02 10:48:19,159 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-02-02 10:48:19,160 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=Craig_TreeInterpolation [2018-02-02 10:48:19,160 INFO L133 SettingsManager]: * SMT solver=Internal_SMTInterpol_NoArrayInterpol [2018-02-02 10:48:19,186 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-02-02 10:48:19,194 INFO L266 ainManager$Toolchain]: [Toolchain 1]: Parser(s) successfully initialized [2018-02-02 10:48:19,196 INFO L222 ainManager$Toolchain]: [Toolchain 1]: Toolchain data selected. [2018-02-02 10:48:19,197 INFO L271 PluginConnector]: Initializing CDTParser... [2018-02-02 10:48:19,197 INFO L276 PluginConnector]: CDTParser initialized [2018-02-02 10:48:19,198 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-02 10:48:19,318 INFO L304 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-02-02 10:48:19,319 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2018-02-02 10:48:19,319 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-02-02 10:48:19,320 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-02-02 10:48:19,323 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-02-02 10:48:19,324 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 02.02 10:48:19" (1/1) ... [2018-02-02 10:48:19,326 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@6c2b8cf4 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.02 10:48:19, skipping insertion in model container [2018-02-02 10:48:19,326 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 02.02 10:48:19" (1/1) ... [2018-02-02 10:48:19,336 INFO L153 Dispatcher]: Using SV-COMP mode [2018-02-02 10:48:19,368 INFO L153 Dispatcher]: Using SV-COMP mode [2018-02-02 10:48:19,468 INFO L450 PostProcessor]: Settings: Checked method=main [2018-02-02 10:48:19,487 INFO L450 PostProcessor]: Settings: Checked method=main [2018-02-02 10:48:19,496 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.02 10:48:19 WrapperNode [2018-02-02 10:48:19,496 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-02-02 10:48:19,497 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-02-02 10:48:19,497 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-02-02 10:48:19,497 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-02-02 10:48:19,506 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.02 10:48:19" (1/1) ... [2018-02-02 10:48:19,506 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.02 10:48:19" (1/1) ... [2018-02-02 10:48:19,514 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.02 10:48:19" (1/1) ... [2018-02-02 10:48:19,515 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.02 10:48:19" (1/1) ... [2018-02-02 10:48:19,521 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.02 10:48:19" (1/1) ... [2018-02-02 10:48:19,524 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.02 10:48:19" (1/1) ... [2018-02-02 10:48:19,526 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.02 10:48:19" (1/1) ... [2018-02-02 10:48:19,528 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-02-02 10:48:19,529 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-02-02 10:48:19,529 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-02-02 10:48:19,529 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-02-02 10:48:19,530 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.02 10:48:19" (1/1) ... No working directory specified, using /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-02-02 10:48:19,569 INFO L136 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-02-02 10:48:19,569 INFO L136 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-02-02 10:48:19,569 INFO L136 BoogieDeclarations]: Found implementation of procedure ##fun~$Pointer$~TO~VOID [2018-02-02 10:48:19,569 INFO L136 BoogieDeclarations]: Found implementation of procedure ldv_malloc [2018-02-02 10:48:19,569 INFO L136 BoogieDeclarations]: Found implementation of procedure LDV_INIT_LIST_HEAD [2018-02-02 10:48:19,569 INFO L136 BoogieDeclarations]: Found implementation of procedure ldv_atomic_sub_return [2018-02-02 10:48:19,570 INFO L136 BoogieDeclarations]: Found implementation of procedure ldv_kref_sub [2018-02-02 10:48:19,570 INFO L136 BoogieDeclarations]: Found implementation of procedure ldv_kref_init [2018-02-02 10:48:19,570 INFO L136 BoogieDeclarations]: Found implementation of procedure ldv_kref_put [2018-02-02 10:48:19,570 INFO L136 BoogieDeclarations]: Found implementation of procedure ldv_kobject_cleanup [2018-02-02 10:48:19,570 INFO L136 BoogieDeclarations]: Found implementation of procedure ldv_kobject_release [2018-02-02 10:48:19,570 INFO L136 BoogieDeclarations]: Found implementation of procedure ldv_kobject_put [2018-02-02 10:48:19,570 INFO L136 BoogieDeclarations]: Found implementation of procedure ldv_kobject_init_internal [2018-02-02 10:48:19,570 INFO L136 BoogieDeclarations]: Found implementation of procedure ldv_kobject_init [2018-02-02 10:48:19,571 INFO L136 BoogieDeclarations]: Found implementation of procedure ldv_kobject_create [2018-02-02 10:48:19,571 INFO L136 BoogieDeclarations]: Found implementation of procedure entry_point [2018-02-02 10:48:19,571 INFO L136 BoogieDeclarations]: Found implementation of procedure main [2018-02-02 10:48:19,571 INFO L128 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2018-02-02 10:48:19,571 INFO L128 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2018-02-02 10:48:19,571 INFO L128 BoogieDeclarations]: Found specification of procedure write~int [2018-02-02 10:48:19,571 INFO L128 BoogieDeclarations]: Found specification of procedure read~int [2018-02-02 10:48:19,571 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.free [2018-02-02 10:48:19,572 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2018-02-02 10:48:19,572 INFO L128 BoogieDeclarations]: Found specification of procedure #Ultimate.alloc [2018-02-02 10:48:19,572 INFO L128 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memset [2018-02-02 10:48:19,572 INFO L136 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memset [2018-02-02 10:48:19,572 INFO L128 BoogieDeclarations]: Found specification of procedure malloc [2018-02-02 10:48:19,572 INFO L128 BoogieDeclarations]: Found specification of procedure free [2018-02-02 10:48:19,572 INFO L128 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2018-02-02 10:48:19,572 INFO L128 BoogieDeclarations]: Found specification of procedure memset [2018-02-02 10:48:19,572 INFO L128 BoogieDeclarations]: Found specification of procedure ldv_malloc [2018-02-02 10:48:19,573 INFO L128 BoogieDeclarations]: Found specification of procedure LDV_INIT_LIST_HEAD [2018-02-02 10:48:19,573 INFO L128 BoogieDeclarations]: Found specification of procedure ldv_atomic_sub_return [2018-02-02 10:48:19,573 INFO L128 BoogieDeclarations]: Found specification of procedure ldv_kref_sub [2018-02-02 10:48:19,573 INFO L128 BoogieDeclarations]: Found specification of procedure ##fun~$Pointer$~TO~VOID [2018-02-02 10:48:19,573 INFO L128 BoogieDeclarations]: Found specification of procedure ldv_kref_init [2018-02-02 10:48:19,573 INFO L128 BoogieDeclarations]: Found specification of procedure ldv_kref_put [2018-02-02 10:48:19,573 INFO L128 BoogieDeclarations]: Found specification of procedure ldv_kobject_cleanup [2018-02-02 10:48:19,574 INFO L128 BoogieDeclarations]: Found specification of procedure ldv_kobject_release [2018-02-02 10:48:19,574 INFO L128 BoogieDeclarations]: Found specification of procedure ldv_kobject_put [2018-02-02 10:48:19,574 INFO L128 BoogieDeclarations]: Found specification of procedure ldv_kobject_init_internal [2018-02-02 10:48:19,574 INFO L128 BoogieDeclarations]: Found specification of procedure ldv_kobject_init [2018-02-02 10:48:19,574 INFO L128 BoogieDeclarations]: Found specification of procedure ldv_kobject_create [2018-02-02 10:48:19,574 INFO L128 BoogieDeclarations]: Found specification of procedure entry_point [2018-02-02 10:48:19,574 INFO L128 BoogieDeclarations]: Found specification of procedure main [2018-02-02 10:48:19,574 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-02-02 10:48:19,575 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-02-02 10:48:19,751 WARN L455 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2018-02-02 10:48:19,873 INFO L257 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-02-02 10:48:19,873 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 02.02 10:48:19 BoogieIcfgContainer [2018-02-02 10:48:19,873 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-02-02 10:48:19,874 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-02-02 10:48:19,874 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-02-02 10:48:19,876 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-02-02 10:48:19,876 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 02.02 10:48:19" (1/3) ... [2018-02-02 10:48:19,877 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@60992bbf and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 02.02 10:48:19, skipping insertion in model container [2018-02-02 10:48:19,877 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.02 10:48:19" (2/3) ... [2018-02-02 10:48:19,877 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@60992bbf and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 02.02 10:48:19, skipping insertion in model container [2018-02-02 10:48:19,877 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 02.02 10:48:19" (3/3) ... [2018-02-02 10:48:19,878 INFO L107 eAbstractionObserver]: Analyzing ICFG memleaks_test22_1_true-valid-memsafety_true-termination.i [2018-02-02 10:48:19,884 INFO L128 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:Craig_TreeInterpolation Determinization: PREDICATE_ABSTRACTION [2018-02-02 10:48:19,889 INFO L140 ceAbstractionStarter]: Appying trace abstraction to program that has 19 error locations. [2018-02-02 10:48:19,923 INFO L322 AbstractCegarLoop]: Interprodecural is true [2018-02-02 10:48:19,924 INFO L323 AbstractCegarLoop]: Hoare is false [2018-02-02 10:48:19,924 INFO L324 AbstractCegarLoop]: Compute interpolants for Craig_TreeInterpolation [2018-02-02 10:48:19,924 INFO L325 AbstractCegarLoop]: Backedges is CANONICAL [2018-02-02 10:48:19,924 INFO L326 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-02-02 10:48:19,924 INFO L327 AbstractCegarLoop]: Difference is false [2018-02-02 10:48:19,924 INFO L328 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-02-02 10:48:19,924 INFO L333 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-02-02 10:48:19,925 INFO L87 2NestedWordAutomaton]: Mode: main mode - execution starts in main procedure [2018-02-02 10:48:19,935 INFO L276 IsEmpty]: Start isEmpty. Operand 118 states. [2018-02-02 10:48:19,941 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2018-02-02 10:48:19,942 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 10:48:19,942 INFO L351 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-02 10:48:19,942 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-02 10:48:19,945 INFO L82 PathProgramCache]: Analyzing trace with hash -401333144, now seen corresponding path program 1 times [2018-02-02 10:48:19,986 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 10:48:20,021 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 10:48:20,028 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 10:48:20,177 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 10:48:20,179 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-02 10:48:20,179 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-02-02 10:48:20,180 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 10:48:20,181 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 10:48:20,181 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-02 10:48:20,181 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 10:48:20,182 INFO L409 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-02-02 10:48:20,194 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-02-02 10:48:20,195 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-02-02 10:48:20,197 INFO L87 Difference]: Start difference. First operand 118 states. Second operand 5 states. [2018-02-02 10:48:20,241 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 10:48:20,241 INFO L93 Difference]: Finished difference Result 124 states and 131 transitions. [2018-02-02 10:48:20,241 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-02-02 10:48:20,242 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 17 [2018-02-02 10:48:20,243 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 10:48:20,253 INFO L225 Difference]: With dead ends: 124 [2018-02-02 10:48:20,253 INFO L226 Difference]: Without dead ends: 121 [2018-02-02 10:48:20,254 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-02-02 10:48:20,265 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 121 states. [2018-02-02 10:48:20,281 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 121 to 119. [2018-02-02 10:48:20,283 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 119 states. [2018-02-02 10:48:20,285 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 119 states to 119 states and 126 transitions. [2018-02-02 10:48:20,286 INFO L78 Accepts]: Start accepts. Automaton has 119 states and 126 transitions. Word has length 17 [2018-02-02 10:48:20,286 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 10:48:20,286 INFO L432 AbstractCegarLoop]: Abstraction has 119 states and 126 transitions. [2018-02-02 10:48:20,287 INFO L433 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-02-02 10:48:20,287 INFO L276 IsEmpty]: Start isEmpty. Operand 119 states and 126 transitions. [2018-02-02 10:48:20,287 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2018-02-02 10:48:20,287 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 10:48:20,287 INFO L351 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-02 10:48:20,288 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-02 10:48:20,288 INFO L82 PathProgramCache]: Analyzing trace with hash 1306365930, now seen corresponding path program 1 times [2018-02-02 10:48:20,289 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 10:48:20,307 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 10:48:20,308 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 10:48:20,352 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 10:48:20,352 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-02 10:48:20,352 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-02-02 10:48:20,353 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 10:48:20,353 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 10:48:20,353 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-02 10:48:20,353 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 10:48:20,355 INFO L409 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-02-02 10:48:20,355 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-02-02 10:48:20,355 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-02-02 10:48:20,356 INFO L87 Difference]: Start difference. First operand 119 states and 126 transitions. Second operand 6 states. [2018-02-02 10:48:20,453 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 10:48:20,453 INFO L93 Difference]: Finished difference Result 120 states and 127 transitions. [2018-02-02 10:48:20,453 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-02-02 10:48:20,453 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 19 [2018-02-02 10:48:20,454 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 10:48:20,455 INFO L225 Difference]: With dead ends: 120 [2018-02-02 10:48:20,455 INFO L226 Difference]: Without dead ends: 120 [2018-02-02 10:48:20,456 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2018-02-02 10:48:20,456 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 120 states. [2018-02-02 10:48:20,461 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 120 to 118. [2018-02-02 10:48:20,462 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 118 states. [2018-02-02 10:48:20,463 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 118 states to 118 states and 125 transitions. [2018-02-02 10:48:20,463 INFO L78 Accepts]: Start accepts. Automaton has 118 states and 125 transitions. Word has length 19 [2018-02-02 10:48:20,464 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 10:48:20,464 INFO L432 AbstractCegarLoop]: Abstraction has 118 states and 125 transitions. [2018-02-02 10:48:20,464 INFO L433 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-02-02 10:48:20,464 INFO L276 IsEmpty]: Start isEmpty. Operand 118 states and 125 transitions. [2018-02-02 10:48:20,464 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2018-02-02 10:48:20,465 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 10:48:20,465 INFO L351 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-02 10:48:20,465 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-02 10:48:20,465 INFO L82 PathProgramCache]: Analyzing trace with hash 1306365931, now seen corresponding path program 1 times [2018-02-02 10:48:20,466 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 10:48:20,480 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 10:48:20,481 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 10:48:20,622 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 10:48:20,622 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-02 10:48:20,622 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-02-02 10:48:20,622 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 10:48:20,623 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 10:48:20,623 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-02 10:48:20,623 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 10:48:20,623 INFO L409 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-02-02 10:48:20,623 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-02-02 10:48:20,623 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2018-02-02 10:48:20,624 INFO L87 Difference]: Start difference. First operand 118 states and 125 transitions. Second operand 7 states. [2018-02-02 10:48:20,764 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 10:48:20,764 INFO L93 Difference]: Finished difference Result 119 states and 126 transitions. [2018-02-02 10:48:20,764 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-02-02 10:48:20,764 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 19 [2018-02-02 10:48:20,765 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 10:48:20,765 INFO L225 Difference]: With dead ends: 119 [2018-02-02 10:48:20,765 INFO L226 Difference]: Without dead ends: 119 [2018-02-02 10:48:20,766 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2018-02-02 10:48:20,766 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 119 states. [2018-02-02 10:48:20,769 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 119 to 117. [2018-02-02 10:48:20,769 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 117 states. [2018-02-02 10:48:20,770 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 117 states to 117 states and 124 transitions. [2018-02-02 10:48:20,770 INFO L78 Accepts]: Start accepts. Automaton has 117 states and 124 transitions. Word has length 19 [2018-02-02 10:48:20,770 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 10:48:20,770 INFO L432 AbstractCegarLoop]: Abstraction has 117 states and 124 transitions. [2018-02-02 10:48:20,770 INFO L433 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-02-02 10:48:20,770 INFO L276 IsEmpty]: Start isEmpty. Operand 117 states and 124 transitions. [2018-02-02 10:48:20,771 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2018-02-02 10:48:20,771 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 10:48:20,771 INFO L351 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-02 10:48:20,771 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-02 10:48:20,772 INFO L82 PathProgramCache]: Analyzing trace with hash -860603530, now seen corresponding path program 1 times [2018-02-02 10:48:20,773 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 10:48:20,788 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 10:48:20,790 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 10:48:20,849 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 10:48:20,849 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-02 10:48:20,849 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-02-02 10:48:20,849 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 10:48:20,850 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 10:48:20,850 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-02 10:48:20,850 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 10:48:20,850 INFO L409 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-02-02 10:48:20,850 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-02-02 10:48:20,851 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2018-02-02 10:48:20,851 INFO L87 Difference]: Start difference. First operand 117 states and 124 transitions. Second operand 7 states. [2018-02-02 10:48:20,903 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 10:48:20,903 INFO L93 Difference]: Finished difference Result 129 states and 136 transitions. [2018-02-02 10:48:20,904 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-02-02 10:48:20,905 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 29 [2018-02-02 10:48:20,905 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 10:48:20,906 INFO L225 Difference]: With dead ends: 129 [2018-02-02 10:48:20,906 INFO L226 Difference]: Without dead ends: 129 [2018-02-02 10:48:20,906 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2018-02-02 10:48:20,907 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 129 states. [2018-02-02 10:48:20,911 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 129 to 125. [2018-02-02 10:48:20,911 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 125 states. [2018-02-02 10:48:20,912 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 125 states to 125 states and 132 transitions. [2018-02-02 10:48:20,912 INFO L78 Accepts]: Start accepts. Automaton has 125 states and 132 transitions. Word has length 29 [2018-02-02 10:48:20,912 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 10:48:20,912 INFO L432 AbstractCegarLoop]: Abstraction has 125 states and 132 transitions. [2018-02-02 10:48:20,912 INFO L433 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-02-02 10:48:20,913 INFO L276 IsEmpty]: Start isEmpty. Operand 125 states and 132 transitions. [2018-02-02 10:48:20,913 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2018-02-02 10:48:20,913 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 10:48:20,913 INFO L351 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-02 10:48:20,913 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-02 10:48:20,914 INFO L82 PathProgramCache]: Analyzing trace with hash 23284980, now seen corresponding path program 1 times [2018-02-02 10:48:20,914 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 10:48:20,922 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 10:48:20,923 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 10:48:20,948 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 10:48:20,949 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-02 10:48:20,949 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-02-02 10:48:20,949 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 10:48:20,949 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 10:48:20,950 INFO L182 omatonBuilderFactory]: Interpolants [1125#true, 1126#false, 1127#(= |#valid| |old(#valid)|)] [2018-02-02 10:48:20,950 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 10:48:20,950 INFO L409 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-02-02 10:48:20,950 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-02-02 10:48:20,950 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-02-02 10:48:20,957 INFO L87 Difference]: Start difference. First operand 125 states and 132 transitions. Second operand 3 states. [2018-02-02 10:48:21,041 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 10:48:21,041 INFO L93 Difference]: Finished difference Result 140 states and 147 transitions. [2018-02-02 10:48:21,041 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-02-02 10:48:21,041 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 27 [2018-02-02 10:48:21,042 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 10:48:21,043 INFO L225 Difference]: With dead ends: 140 [2018-02-02 10:48:21,043 INFO L226 Difference]: Without dead ends: 129 [2018-02-02 10:48:21,043 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-02-02 10:48:21,044 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 129 states. [2018-02-02 10:48:21,051 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 129 to 121. [2018-02-02 10:48:21,052 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 121 states. [2018-02-02 10:48:21,053 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 121 states to 121 states and 127 transitions. [2018-02-02 10:48:21,053 INFO L78 Accepts]: Start accepts. Automaton has 121 states and 127 transitions. Word has length 27 [2018-02-02 10:48:21,053 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 10:48:21,053 INFO L432 AbstractCegarLoop]: Abstraction has 121 states and 127 transitions. [2018-02-02 10:48:21,054 INFO L433 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-02-02 10:48:21,054 INFO L276 IsEmpty]: Start isEmpty. Operand 121 states and 127 transitions. [2018-02-02 10:48:21,054 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2018-02-02 10:48:21,054 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 10:48:21,054 INFO L351 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-02 10:48:21,054 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-02 10:48:21,054 INFO L82 PathProgramCache]: Analyzing trace with hash -1295663626, now seen corresponding path program 1 times [2018-02-02 10:48:21,055 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 10:48:21,062 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 10:48:21,063 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 10:48:21,102 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 10:48:21,102 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-02 10:48:21,103 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-02-02 10:48:21,103 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 10:48:21,103 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 10:48:21,103 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-02 10:48:21,104 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 10:48:21,104 INFO L409 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-02-02 10:48:21,104 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-02-02 10:48:21,104 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-02-02 10:48:21,104 INFO L87 Difference]: Start difference. First operand 121 states and 127 transitions. Second operand 6 states. [2018-02-02 10:48:21,128 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 10:48:21,128 INFO L93 Difference]: Finished difference Result 113 states and 118 transitions. [2018-02-02 10:48:21,128 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-02-02 10:48:21,128 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 29 [2018-02-02 10:48:21,128 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 10:48:21,129 INFO L225 Difference]: With dead ends: 113 [2018-02-02 10:48:21,129 INFO L226 Difference]: Without dead ends: 113 [2018-02-02 10:48:21,129 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2018-02-02 10:48:21,129 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 113 states. [2018-02-02 10:48:21,133 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 113 to 113. [2018-02-02 10:48:21,133 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 113 states. [2018-02-02 10:48:21,134 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 113 states to 113 states and 118 transitions. [2018-02-02 10:48:21,134 INFO L78 Accepts]: Start accepts. Automaton has 113 states and 118 transitions. Word has length 29 [2018-02-02 10:48:21,134 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 10:48:21,134 INFO L432 AbstractCegarLoop]: Abstraction has 113 states and 118 transitions. [2018-02-02 10:48:21,134 INFO L433 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-02-02 10:48:21,134 INFO L276 IsEmpty]: Start isEmpty. Operand 113 states and 118 transitions. [2018-02-02 10:48:21,135 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2018-02-02 10:48:21,135 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 10:48:21,135 INFO L351 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-02 10:48:21,135 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-02 10:48:21,135 INFO L82 PathProgramCache]: Analyzing trace with hash 522747174, now seen corresponding path program 1 times [2018-02-02 10:48:21,136 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 10:48:21,148 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 10:48:21,149 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 10:48:21,168 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 10:48:21,169 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-02 10:48:21,169 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-02-02 10:48:21,169 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 10:48:21,169 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 10:48:21,169 INFO L182 omatonBuilderFactory]: Interpolants [1623#true, 1624#false, 1625#(= |#Ultimate.C_memset_#t~loopctr17| 0), 1626#(<= |#Ultimate.C_memset_#amount| 0)] [2018-02-02 10:48:21,170 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 10:48:21,170 INFO L409 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-02-02 10:48:21,170 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-02-02 10:48:21,170 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-02-02 10:48:21,170 INFO L87 Difference]: Start difference. First operand 113 states and 118 transitions. Second operand 4 states. [2018-02-02 10:48:21,182 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 10:48:21,182 INFO L93 Difference]: Finished difference Result 116 states and 121 transitions. [2018-02-02 10:48:21,182 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-02-02 10:48:21,183 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 34 [2018-02-02 10:48:21,183 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 10:48:21,183 INFO L225 Difference]: With dead ends: 116 [2018-02-02 10:48:21,183 INFO L226 Difference]: Without dead ends: 114 [2018-02-02 10:48:21,183 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-02-02 10:48:21,184 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 114 states. [2018-02-02 10:48:21,185 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 114 to 114. [2018-02-02 10:48:21,186 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 114 states. [2018-02-02 10:48:21,186 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 114 states to 114 states and 119 transitions. [2018-02-02 10:48:21,186 INFO L78 Accepts]: Start accepts. Automaton has 114 states and 119 transitions. Word has length 34 [2018-02-02 10:48:21,186 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 10:48:21,187 INFO L432 AbstractCegarLoop]: Abstraction has 114 states and 119 transitions. [2018-02-02 10:48:21,187 INFO L433 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-02-02 10:48:21,187 INFO L276 IsEmpty]: Start isEmpty. Operand 114 states and 119 transitions. [2018-02-02 10:48:21,187 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2018-02-02 10:48:21,187 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 10:48:21,187 INFO L351 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-02 10:48:21,187 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-02 10:48:21,187 INFO L82 PathProgramCache]: Analyzing trace with hash -1305776369, now seen corresponding path program 1 times [2018-02-02 10:48:21,188 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 10:48:21,195 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 10:48:21,195 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 10:48:21,225 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 10:48:21,225 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-02 10:48:21,225 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5] total 5 [2018-02-02 10:48:21,226 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 10:48:21,226 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 10:48:21,226 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-02 10:48:21,226 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 10:48:21,226 INFO L409 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-02-02 10:48:21,227 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-02-02 10:48:21,227 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2018-02-02 10:48:21,227 INFO L87 Difference]: Start difference. First operand 114 states and 119 transitions. Second operand 5 states. [2018-02-02 10:48:21,239 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 10:48:21,239 INFO L93 Difference]: Finished difference Result 117 states and 122 transitions. [2018-02-02 10:48:21,239 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-02-02 10:48:21,240 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 35 [2018-02-02 10:48:21,240 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 10:48:21,240 INFO L225 Difference]: With dead ends: 117 [2018-02-02 10:48:21,240 INFO L226 Difference]: Without dead ends: 115 [2018-02-02 10:48:21,240 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2018-02-02 10:48:21,241 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 115 states. [2018-02-02 10:48:21,243 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 115 to 115. [2018-02-02 10:48:21,243 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 115 states. [2018-02-02 10:48:21,243 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 115 states to 115 states and 120 transitions. [2018-02-02 10:48:21,244 INFO L78 Accepts]: Start accepts. Automaton has 115 states and 120 transitions. Word has length 35 [2018-02-02 10:48:21,244 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 10:48:21,244 INFO L432 AbstractCegarLoop]: Abstraction has 115 states and 120 transitions. [2018-02-02 10:48:21,244 INFO L433 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-02-02 10:48:21,244 INFO L276 IsEmpty]: Start isEmpty. Operand 115 states and 120 transitions. [2018-02-02 10:48:21,244 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2018-02-02 10:48:21,244 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 10:48:21,245 INFO L351 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-02 10:48:21,245 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-02 10:48:21,245 INFO L82 PathProgramCache]: Analyzing trace with hash 2139535942, now seen corresponding path program 2 times [2018-02-02 10:48:21,246 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 10:48:21,258 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 10:48:21,259 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 10:48:21,293 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 10:48:21,294 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-02 10:48:21,294 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6] total 6 [2018-02-02 10:48:21,294 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 10:48:21,295 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 10:48:21,295 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-02 10:48:21,295 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 10:48:21,295 INFO L409 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-02-02 10:48:21,295 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-02-02 10:48:21,295 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2018-02-02 10:48:21,296 INFO L87 Difference]: Start difference. First operand 115 states and 120 transitions. Second operand 6 states. [2018-02-02 10:48:21,322 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 10:48:21,322 INFO L93 Difference]: Finished difference Result 118 states and 123 transitions. [2018-02-02 10:48:21,323 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-02-02 10:48:21,323 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 36 [2018-02-02 10:48:21,323 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 10:48:21,324 INFO L225 Difference]: With dead ends: 118 [2018-02-02 10:48:21,324 INFO L226 Difference]: Without dead ends: 116 [2018-02-02 10:48:21,324 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=16, Invalid=26, Unknown=0, NotChecked=0, Total=42 [2018-02-02 10:48:21,325 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 116 states. [2018-02-02 10:48:21,327 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 116 to 116. [2018-02-02 10:48:21,327 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 116 states. [2018-02-02 10:48:21,328 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 116 states to 116 states and 121 transitions. [2018-02-02 10:48:21,328 INFO L78 Accepts]: Start accepts. Automaton has 116 states and 121 transitions. Word has length 36 [2018-02-02 10:48:21,328 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 10:48:21,329 INFO L432 AbstractCegarLoop]: Abstraction has 116 states and 121 transitions. [2018-02-02 10:48:21,329 INFO L433 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-02-02 10:48:21,329 INFO L276 IsEmpty]: Start isEmpty. Operand 116 states and 121 transitions. [2018-02-02 10:48:21,329 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2018-02-02 10:48:21,330 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 10:48:21,330 INFO L351 BasicCegarLoop]: trace histogram [3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-02 10:48:21,330 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-02 10:48:21,330 INFO L82 PathProgramCache]: Analyzing trace with hash 1570035183, now seen corresponding path program 3 times [2018-02-02 10:48:21,331 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 10:48:21,344 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 10:48:21,345 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 10:48:21,384 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 10:48:21,384 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-02 10:48:21,384 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7] total 7 [2018-02-02 10:48:21,384 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 10:48:21,385 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 10:48:21,385 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-02 10:48:21,385 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 10:48:21,385 INFO L409 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-02-02 10:48:21,385 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-02-02 10:48:21,386 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2018-02-02 10:48:21,386 INFO L87 Difference]: Start difference. First operand 116 states and 121 transitions. Second operand 7 states. [2018-02-02 10:48:21,404 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 10:48:21,404 INFO L93 Difference]: Finished difference Result 119 states and 124 transitions. [2018-02-02 10:48:21,404 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-02-02 10:48:21,405 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 37 [2018-02-02 10:48:21,405 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 10:48:21,405 INFO L225 Difference]: With dead ends: 119 [2018-02-02 10:48:21,405 INFO L226 Difference]: Without dead ends: 117 [2018-02-02 10:48:21,405 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=35, Unknown=0, NotChecked=0, Total=56 [2018-02-02 10:48:21,406 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 117 states. [2018-02-02 10:48:21,407 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 117 to 117. [2018-02-02 10:48:21,407 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 117 states. [2018-02-02 10:48:21,408 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 117 states to 117 states and 122 transitions. [2018-02-02 10:48:21,408 INFO L78 Accepts]: Start accepts. Automaton has 117 states and 122 transitions. Word has length 37 [2018-02-02 10:48:21,408 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 10:48:21,408 INFO L432 AbstractCegarLoop]: Abstraction has 117 states and 122 transitions. [2018-02-02 10:48:21,408 INFO L433 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-02-02 10:48:21,408 INFO L276 IsEmpty]: Start isEmpty. Operand 117 states and 122 transitions. [2018-02-02 10:48:21,409 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2018-02-02 10:48:21,409 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 10:48:21,409 INFO L351 BasicCegarLoop]: trace histogram [4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-02 10:48:21,409 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-02 10:48:21,410 INFO L82 PathProgramCache]: Analyzing trace with hash 1095380838, now seen corresponding path program 4 times [2018-02-02 10:48:21,411 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 10:48:21,420 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 10:48:21,421 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 10:48:21,464 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 10:48:21,464 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-02 10:48:21,464 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8] total 8 [2018-02-02 10:48:21,464 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 10:48:21,464 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 10:48:21,464 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-02 10:48:21,464 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 10:48:21,465 INFO L409 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-02-02 10:48:21,465 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-02-02 10:48:21,465 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2018-02-02 10:48:21,465 INFO L87 Difference]: Start difference. First operand 117 states and 122 transitions. Second operand 8 states. [2018-02-02 10:48:21,483 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 10:48:21,483 INFO L93 Difference]: Finished difference Result 120 states and 125 transitions. [2018-02-02 10:48:21,495 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-02-02 10:48:21,495 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 38 [2018-02-02 10:48:21,495 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 10:48:21,496 INFO L225 Difference]: With dead ends: 120 [2018-02-02 10:48:21,496 INFO L226 Difference]: Without dead ends: 118 [2018-02-02 10:48:21,496 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2018-02-02 10:48:21,496 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 118 states. [2018-02-02 10:48:21,497 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 118 to 118. [2018-02-02 10:48:21,498 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 118 states. [2018-02-02 10:48:21,498 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 118 states to 118 states and 123 transitions. [2018-02-02 10:48:21,498 INFO L78 Accepts]: Start accepts. Automaton has 118 states and 123 transitions. Word has length 38 [2018-02-02 10:48:21,499 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 10:48:21,499 INFO L432 AbstractCegarLoop]: Abstraction has 118 states and 123 transitions. [2018-02-02 10:48:21,499 INFO L433 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-02-02 10:48:21,499 INFO L276 IsEmpty]: Start isEmpty. Operand 118 states and 123 transitions. [2018-02-02 10:48:21,499 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2018-02-02 10:48:21,499 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 10:48:21,499 INFO L351 BasicCegarLoop]: trace histogram [5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-02 10:48:21,499 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-02 10:48:21,500 INFO L82 PathProgramCache]: Analyzing trace with hash -734001969, now seen corresponding path program 5 times [2018-02-02 10:48:21,500 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 10:48:21,510 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 10:48:21,511 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 10:48:21,549 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 15 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 10:48:21,549 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-02 10:48:21,549 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9] total 9 [2018-02-02 10:48:21,549 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 10:48:21,549 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 10:48:21,549 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-02 10:48:21,549 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 15 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 10:48:21,550 INFO L409 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-02-02 10:48:21,550 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-02-02 10:48:21,550 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2018-02-02 10:48:21,550 INFO L87 Difference]: Start difference. First operand 118 states and 123 transitions. Second operand 9 states. [2018-02-02 10:48:21,569 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 10:48:21,570 INFO L93 Difference]: Finished difference Result 121 states and 126 transitions. [2018-02-02 10:48:21,570 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-02-02 10:48:21,570 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 39 [2018-02-02 10:48:21,570 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 10:48:21,570 INFO L225 Difference]: With dead ends: 121 [2018-02-02 10:48:21,571 INFO L226 Difference]: Without dead ends: 119 [2018-02-02 10:48:21,571 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=34, Invalid=56, Unknown=0, NotChecked=0, Total=90 [2018-02-02 10:48:21,571 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 119 states. [2018-02-02 10:48:21,572 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 119 to 119. [2018-02-02 10:48:21,572 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 119 states. [2018-02-02 10:48:21,573 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 119 states to 119 states and 124 transitions. [2018-02-02 10:48:21,573 INFO L78 Accepts]: Start accepts. Automaton has 119 states and 124 transitions. Word has length 39 [2018-02-02 10:48:21,573 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 10:48:21,573 INFO L432 AbstractCegarLoop]: Abstraction has 119 states and 124 transitions. [2018-02-02 10:48:21,573 INFO L433 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-02-02 10:48:21,573 INFO L276 IsEmpty]: Start isEmpty. Operand 119 states and 124 transitions. [2018-02-02 10:48:21,574 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2018-02-02 10:48:21,574 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 10:48:21,574 INFO L351 BasicCegarLoop]: trace histogram [6, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-02 10:48:21,574 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-02 10:48:21,575 INFO L82 PathProgramCache]: Analyzing trace with hash -1610294138, now seen corresponding path program 6 times [2018-02-02 10:48:21,575 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 10:48:21,586 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 10:48:21,587 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 10:48:21,640 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 0 proven. 21 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 10:48:21,640 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-02 10:48:21,640 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10] total 10 [2018-02-02 10:48:21,640 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 10:48:21,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-02 10:48:21,641 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-02 10:48:21,641 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 0 proven. 21 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 10:48:21,641 INFO L409 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-02-02 10:48:21,641 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-02-02 10:48:21,641 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2018-02-02 10:48:21,641 INFO L87 Difference]: Start difference. First operand 119 states and 124 transitions. Second operand 10 states. [2018-02-02 10:48:21,661 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 10:48:21,661 INFO L93 Difference]: Finished difference Result 122 states and 127 transitions. [2018-02-02 10:48:21,662 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-02-02 10:48:21,662 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 40 [2018-02-02 10:48:21,662 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 10:48:21,663 INFO L225 Difference]: With dead ends: 122 [2018-02-02 10:48:21,663 INFO L226 Difference]: Without dead ends: 120 [2018-02-02 10:48:21,663 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=42, Invalid=68, Unknown=0, NotChecked=0, Total=110 [2018-02-02 10:48:21,663 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 120 states. [2018-02-02 10:48:21,665 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 120 to 120. [2018-02-02 10:48:21,665 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 120 states. [2018-02-02 10:48:21,665 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 120 states to 120 states and 125 transitions. [2018-02-02 10:48:21,666 INFO L78 Accepts]: Start accepts. Automaton has 120 states and 125 transitions. Word has length 40 [2018-02-02 10:48:21,666 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 10:48:21,666 INFO L432 AbstractCegarLoop]: Abstraction has 120 states and 125 transitions. [2018-02-02 10:48:21,666 INFO L433 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-02-02 10:48:21,666 INFO L276 IsEmpty]: Start isEmpty. Operand 120 states and 125 transitions. [2018-02-02 10:48:21,667 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2018-02-02 10:48:21,667 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 10:48:21,667 INFO L351 BasicCegarLoop]: trace histogram [7, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-02 10:48:21,667 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-02 10:48:21,667 INFO L82 PathProgramCache]: Analyzing trace with hash 1289419695, now seen corresponding path program 7 times [2018-02-02 10:48:21,668 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 10:48:21,676 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 10:48:21,677 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 10:48:21,737 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 0 proven. 28 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 10:48:21,737 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-02 10:48:21,738 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [11] total 11 [2018-02-02 10:48:21,738 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 10:48:21,738 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 10:48:21,738 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-02 10:48:21,738 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 0 proven. 28 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 10:48:21,739 INFO L409 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-02-02 10:48:21,739 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-02-02 10:48:21,739 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=63, Unknown=0, NotChecked=0, Total=110 [2018-02-02 10:48:21,739 INFO L87 Difference]: Start difference. First operand 120 states and 125 transitions. Second operand 11 states. [2018-02-02 10:48:21,775 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 10:48:21,775 INFO L93 Difference]: Finished difference Result 123 states and 128 transitions. [2018-02-02 10:48:21,783 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-02-02 10:48:21,783 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 41 [2018-02-02 10:48:21,783 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 10:48:21,784 INFO L225 Difference]: With dead ends: 123 [2018-02-02 10:48:21,784 INFO L226 Difference]: Without dead ends: 121 [2018-02-02 10:48:21,784 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=51, Invalid=81, Unknown=0, NotChecked=0, Total=132 [2018-02-02 10:48:21,784 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 121 states. [2018-02-02 10:48:21,786 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 121 to 121. [2018-02-02 10:48:21,786 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 121 states. [2018-02-02 10:48:21,787 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 121 states to 121 states and 126 transitions. [2018-02-02 10:48:21,787 INFO L78 Accepts]: Start accepts. Automaton has 121 states and 126 transitions. Word has length 41 [2018-02-02 10:48:21,787 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 10:48:21,787 INFO L432 AbstractCegarLoop]: Abstraction has 121 states and 126 transitions. [2018-02-02 10:48:21,787 INFO L433 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-02-02 10:48:21,787 INFO L276 IsEmpty]: Start isEmpty. Operand 121 states and 126 transitions. [2018-02-02 10:48:21,788 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2018-02-02 10:48:21,788 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 10:48:21,788 INFO L351 BasicCegarLoop]: trace histogram [8, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-02 10:48:21,788 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-02 10:48:21,788 INFO L82 PathProgramCache]: Analyzing trace with hash 986235302, now seen corresponding path program 8 times [2018-02-02 10:48:21,789 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 10:48:21,799 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 10:48:21,800 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 10:48:21,882 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 36 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 10:48:21,882 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-02 10:48:21,882 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [12] total 12 [2018-02-02 10:48:21,883 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 10:48:21,883 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 10:48:21,883 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-02 10:48:21,883 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 36 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 10:48:21,883 INFO L409 AbstractCegarLoop]: Interpolant automaton has 12 states [2018-02-02 10:48:21,884 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2018-02-02 10:48:21,884 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=75, Unknown=0, NotChecked=0, Total=132 [2018-02-02 10:48:21,884 INFO L87 Difference]: Start difference. First operand 121 states and 126 transitions. Second operand 12 states. [2018-02-02 10:48:21,917 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 10:48:21,917 INFO L93 Difference]: Finished difference Result 124 states and 129 transitions. [2018-02-02 10:48:21,917 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-02-02 10:48:21,917 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 42 [2018-02-02 10:48:21,918 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 10:48:21,918 INFO L225 Difference]: With dead ends: 124 [2018-02-02 10:48:21,918 INFO L226 Difference]: Without dead ends: 122 [2018-02-02 10:48:21,919 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=61, Invalid=95, Unknown=0, NotChecked=0, Total=156 [2018-02-02 10:48:21,919 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 122 states. [2018-02-02 10:48:21,921 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 122 to 122. [2018-02-02 10:48:21,921 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 122 states. [2018-02-02 10:48:21,922 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 122 states to 122 states and 127 transitions. [2018-02-02 10:48:21,922 INFO L78 Accepts]: Start accepts. Automaton has 122 states and 127 transitions. Word has length 42 [2018-02-02 10:48:21,922 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 10:48:21,922 INFO L432 AbstractCegarLoop]: Abstraction has 122 states and 127 transitions. [2018-02-02 10:48:21,922 INFO L433 AbstractCegarLoop]: Interpolant automaton has 12 states. [2018-02-02 10:48:21,922 INFO L276 IsEmpty]: Start isEmpty. Operand 122 states and 127 transitions. [2018-02-02 10:48:21,923 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2018-02-02 10:48:21,923 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 10:48:21,923 INFO L351 BasicCegarLoop]: trace histogram [9, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-02 10:48:21,923 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-02 10:48:21,923 INFO L82 PathProgramCache]: Analyzing trace with hash 177453711, now seen corresponding path program 9 times [2018-02-02 10:48:21,924 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 10:48:21,936 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 10:48:21,937 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 10:48:22,007 INFO L134 CoverageAnalysis]: Checked inductivity of 45 backedges. 0 proven. 45 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 10:48:22,007 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-02 10:48:22,007 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [13] total 13 [2018-02-02 10:48:22,007 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 10:48:22,008 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 10:48:22,008 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-02 10:48:22,008 INFO L134 CoverageAnalysis]: Checked inductivity of 45 backedges. 0 proven. 45 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 10:48:22,008 INFO L409 AbstractCegarLoop]: Interpolant automaton has 13 states [2018-02-02 10:48:22,008 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2018-02-02 10:48:22,009 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=68, Invalid=88, Unknown=0, NotChecked=0, Total=156 [2018-02-02 10:48:22,009 INFO L87 Difference]: Start difference. First operand 122 states and 127 transitions. Second operand 13 states. [2018-02-02 10:48:22,037 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 10:48:22,037 INFO L93 Difference]: Finished difference Result 125 states and 130 transitions. [2018-02-02 10:48:22,037 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2018-02-02 10:48:22,038 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 43 [2018-02-02 10:48:22,038 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 10:48:22,038 INFO L225 Difference]: With dead ends: 125 [2018-02-02 10:48:22,039 INFO L226 Difference]: Without dead ends: 123 [2018-02-02 10:48:22,039 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=72, Invalid=110, Unknown=0, NotChecked=0, Total=182 [2018-02-02 10:48:22,039 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 123 states. [2018-02-02 10:48:22,041 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 123 to 123. [2018-02-02 10:48:22,041 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 123 states. [2018-02-02 10:48:22,042 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 123 states to 123 states and 128 transitions. [2018-02-02 10:48:22,042 INFO L78 Accepts]: Start accepts. Automaton has 123 states and 128 transitions. Word has length 43 [2018-02-02 10:48:22,042 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 10:48:22,042 INFO L432 AbstractCegarLoop]: Abstraction has 123 states and 128 transitions. [2018-02-02 10:48:22,043 INFO L433 AbstractCegarLoop]: Interpolant automaton has 13 states. [2018-02-02 10:48:22,043 INFO L276 IsEmpty]: Start isEmpty. Operand 123 states and 128 transitions. [2018-02-02 10:48:22,044 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2018-02-02 10:48:22,044 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 10:48:22,044 INFO L351 BasicCegarLoop]: trace histogram [10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-02 10:48:22,044 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-02 10:48:22,044 INFO L82 PathProgramCache]: Analyzing trace with hash 875028166, now seen corresponding path program 10 times [2018-02-02 10:48:22,045 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 10:48:22,057 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 10:48:22,058 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 10:48:22,156 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 0 proven. 55 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 10:48:22,156 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-02 10:48:22,156 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [14] total 14 [2018-02-02 10:48:22,157 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 10:48:22,157 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 10:48:22,157 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-02 10:48:22,157 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 0 proven. 55 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 10:48:22,158 INFO L409 AbstractCegarLoop]: Interpolant automaton has 14 states [2018-02-02 10:48:22,158 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2018-02-02 10:48:22,158 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=80, Invalid=102, Unknown=0, NotChecked=0, Total=182 [2018-02-02 10:48:22,158 INFO L87 Difference]: Start difference. First operand 123 states and 128 transitions. Second operand 14 states. [2018-02-02 10:48:22,191 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 10:48:22,191 INFO L93 Difference]: Finished difference Result 126 states and 131 transitions. [2018-02-02 10:48:22,192 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2018-02-02 10:48:22,192 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 44 [2018-02-02 10:48:22,192 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 10:48:22,193 INFO L225 Difference]: With dead ends: 126 [2018-02-02 10:48:22,193 INFO L226 Difference]: Without dead ends: 124 [2018-02-02 10:48:22,193 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=84, Invalid=126, Unknown=0, NotChecked=0, Total=210 [2018-02-02 10:48:22,194 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 124 states. [2018-02-02 10:48:22,196 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 124 to 124. [2018-02-02 10:48:22,196 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 124 states. [2018-02-02 10:48:22,197 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 124 states to 124 states and 129 transitions. [2018-02-02 10:48:22,197 INFO L78 Accepts]: Start accepts. Automaton has 124 states and 129 transitions. Word has length 44 [2018-02-02 10:48:22,197 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 10:48:22,197 INFO L432 AbstractCegarLoop]: Abstraction has 124 states and 129 transitions. [2018-02-02 10:48:22,197 INFO L433 AbstractCegarLoop]: Interpolant automaton has 14 states. [2018-02-02 10:48:22,197 INFO L276 IsEmpty]: Start isEmpty. Operand 124 states and 129 transitions. [2018-02-02 10:48:22,198 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2018-02-02 10:48:22,198 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 10:48:22,198 INFO L351 BasicCegarLoop]: trace histogram [11, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-02 10:48:22,198 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-02 10:48:22,199 INFO L82 PathProgramCache]: Analyzing trace with hash 1024999791, now seen corresponding path program 11 times [2018-02-02 10:48:22,199 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 10:48:22,212 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 10:48:22,213 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 10:48:22,322 INFO L134 CoverageAnalysis]: Checked inductivity of 66 backedges. 0 proven. 66 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 10:48:22,323 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-02 10:48:22,323 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [15] total 15 [2018-02-02 10:48:22,323 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 10:48:22,324 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 10:48:22,324 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-02 10:48:22,324 INFO L134 CoverageAnalysis]: Checked inductivity of 66 backedges. 0 proven. 66 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 10:48:22,324 INFO L409 AbstractCegarLoop]: Interpolant automaton has 15 states [2018-02-02 10:48:22,324 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2018-02-02 10:48:22,325 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=93, Invalid=117, Unknown=0, NotChecked=0, Total=210 [2018-02-02 10:48:22,325 INFO L87 Difference]: Start difference. First operand 124 states and 129 transitions. Second operand 15 states. [2018-02-02 10:48:22,363 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 10:48:22,363 INFO L93 Difference]: Finished difference Result 127 states and 132 transitions. [2018-02-02 10:48:22,363 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2018-02-02 10:48:22,363 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 45 [2018-02-02 10:48:22,364 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 10:48:22,364 INFO L225 Difference]: With dead ends: 127 [2018-02-02 10:48:22,364 INFO L226 Difference]: Without dead ends: 125 [2018-02-02 10:48:22,365 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=97, Invalid=143, Unknown=0, NotChecked=0, Total=240 [2018-02-02 10:48:22,365 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 125 states. [2018-02-02 10:48:22,367 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 125 to 125. [2018-02-02 10:48:22,367 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 125 states. [2018-02-02 10:48:22,368 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 125 states to 125 states and 130 transitions. [2018-02-02 10:48:22,368 INFO L78 Accepts]: Start accepts. Automaton has 125 states and 130 transitions. Word has length 45 [2018-02-02 10:48:22,368 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 10:48:22,368 INFO L432 AbstractCegarLoop]: Abstraction has 125 states and 130 transitions. [2018-02-02 10:48:22,368 INFO L433 AbstractCegarLoop]: Interpolant automaton has 15 states. [2018-02-02 10:48:22,368 INFO L276 IsEmpty]: Start isEmpty. Operand 125 states and 130 transitions. [2018-02-02 10:48:22,369 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2018-02-02 10:48:22,369 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 10:48:22,369 INFO L351 BasicCegarLoop]: trace histogram [12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-02 10:48:22,369 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-02 10:48:22,369 INFO L82 PathProgramCache]: Analyzing trace with hash 1379152870, now seen corresponding path program 12 times [2018-02-02 10:48:22,370 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 10:48:22,385 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 10:48:22,386 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 10:48:22,500 INFO L134 CoverageAnalysis]: Checked inductivity of 78 backedges. 0 proven. 78 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 10:48:22,500 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-02 10:48:22,500 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [16] total 16 [2018-02-02 10:48:22,500 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 10:48:22,500 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 10:48:22,500 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-02 10:48:22,500 INFO L134 CoverageAnalysis]: Checked inductivity of 78 backedges. 0 proven. 78 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 10:48:22,500 INFO L409 AbstractCegarLoop]: Interpolant automaton has 16 states [2018-02-02 10:48:22,501 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2018-02-02 10:48:22,501 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=107, Invalid=133, Unknown=0, NotChecked=0, Total=240 [2018-02-02 10:48:22,501 INFO L87 Difference]: Start difference. First operand 125 states and 130 transitions. Second operand 16 states. [2018-02-02 10:48:22,531 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 10:48:22,532 INFO L93 Difference]: Finished difference Result 128 states and 133 transitions. [2018-02-02 10:48:22,533 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2018-02-02 10:48:22,533 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 46 [2018-02-02 10:48:22,533 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 10:48:22,533 INFO L225 Difference]: With dead ends: 128 [2018-02-02 10:48:22,534 INFO L226 Difference]: Without dead ends: 126 [2018-02-02 10:48:22,534 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=111, Invalid=161, Unknown=0, NotChecked=0, Total=272 [2018-02-02 10:48:22,534 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 126 states. [2018-02-02 10:48:22,536 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 126 to 126. [2018-02-02 10:48:22,536 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 126 states. [2018-02-02 10:48:22,537 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 126 states to 126 states and 131 transitions. [2018-02-02 10:48:22,537 INFO L78 Accepts]: Start accepts. Automaton has 126 states and 131 transitions. Word has length 46 [2018-02-02 10:48:22,537 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 10:48:22,537 INFO L432 AbstractCegarLoop]: Abstraction has 126 states and 131 transitions. [2018-02-02 10:48:22,537 INFO L433 AbstractCegarLoop]: Interpolant automaton has 16 states. [2018-02-02 10:48:22,538 INFO L276 IsEmpty]: Start isEmpty. Operand 126 states and 131 transitions. [2018-02-02 10:48:22,538 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2018-02-02 10:48:22,538 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 10:48:22,538 INFO L351 BasicCegarLoop]: trace histogram [13, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-02 10:48:22,538 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-02 10:48:22,538 INFO L82 PathProgramCache]: Analyzing trace with hash -527003569, now seen corresponding path program 13 times [2018-02-02 10:48:22,539 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 10:48:22,551 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 10:48:22,552 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 10:48:22,663 INFO L134 CoverageAnalysis]: Checked inductivity of 91 backedges. 0 proven. 91 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 10:48:22,663 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-02 10:48:22,663 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [17] total 17 [2018-02-02 10:48:22,663 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 10:48:22,663 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 10:48:22,663 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-02 10:48:22,664 INFO L134 CoverageAnalysis]: Checked inductivity of 91 backedges. 0 proven. 91 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 10:48:22,664 INFO L409 AbstractCegarLoop]: Interpolant automaton has 17 states [2018-02-02 10:48:22,664 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2018-02-02 10:48:22,664 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=122, Invalid=150, Unknown=0, NotChecked=0, Total=272 [2018-02-02 10:48:22,664 INFO L87 Difference]: Start difference. First operand 126 states and 131 transitions. Second operand 17 states. [2018-02-02 10:48:22,697 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 10:48:22,697 INFO L93 Difference]: Finished difference Result 129 states and 134 transitions. [2018-02-02 10:48:22,702 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2018-02-02 10:48:22,702 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 47 [2018-02-02 10:48:22,702 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 10:48:22,703 INFO L225 Difference]: With dead ends: 129 [2018-02-02 10:48:22,703 INFO L226 Difference]: Without dead ends: 127 [2018-02-02 10:48:22,703 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 13 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=126, Invalid=180, Unknown=0, NotChecked=0, Total=306 [2018-02-02 10:48:22,704 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 127 states. [2018-02-02 10:48:22,706 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 127 to 127. [2018-02-02 10:48:22,706 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 127 states. [2018-02-02 10:48:22,707 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 127 states to 127 states and 132 transitions. [2018-02-02 10:48:22,707 INFO L78 Accepts]: Start accepts. Automaton has 127 states and 132 transitions. Word has length 47 [2018-02-02 10:48:22,707 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 10:48:22,707 INFO L432 AbstractCegarLoop]: Abstraction has 127 states and 132 transitions. [2018-02-02 10:48:22,707 INFO L433 AbstractCegarLoop]: Interpolant automaton has 17 states. [2018-02-02 10:48:22,708 INFO L276 IsEmpty]: Start isEmpty. Operand 127 states and 132 transitions. [2018-02-02 10:48:22,708 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2018-02-02 10:48:22,708 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 10:48:22,708 INFO L351 BasicCegarLoop]: trace histogram [14, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-02 10:48:22,708 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-02 10:48:22,709 INFO L82 PathProgramCache]: Analyzing trace with hash 511688966, now seen corresponding path program 14 times [2018-02-02 10:48:22,709 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 10:48:22,723 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 10:48:22,724 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 10:48:22,844 INFO L134 CoverageAnalysis]: Checked inductivity of 105 backedges. 0 proven. 105 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 10:48:22,844 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-02 10:48:22,845 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [18] total 18 [2018-02-02 10:48:22,845 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 10:48:22,845 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 10:48:22,845 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-02 10:48:22,845 INFO L134 CoverageAnalysis]: Checked inductivity of 105 backedges. 0 proven. 105 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 10:48:22,846 INFO L409 AbstractCegarLoop]: Interpolant automaton has 18 states [2018-02-02 10:48:22,846 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2018-02-02 10:48:22,846 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=138, Invalid=168, Unknown=0, NotChecked=0, Total=306 [2018-02-02 10:48:22,846 INFO L87 Difference]: Start difference. First operand 127 states and 132 transitions. Second operand 18 states. [2018-02-02 10:48:22,897 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 10:48:22,897 INFO L93 Difference]: Finished difference Result 130 states and 135 transitions. [2018-02-02 10:48:22,897 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2018-02-02 10:48:22,897 INFO L78 Accepts]: Start accepts. Automaton has 18 states. Word has length 48 [2018-02-02 10:48:22,897 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 10:48:22,898 INFO L225 Difference]: With dead ends: 130 [2018-02-02 10:48:22,898 INFO L226 Difference]: Without dead ends: 128 [2018-02-02 10:48:22,898 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 14 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=142, Invalid=200, Unknown=0, NotChecked=0, Total=342 [2018-02-02 10:48:22,898 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 128 states. [2018-02-02 10:48:22,900 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 128 to 128. [2018-02-02 10:48:22,900 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 128 states. [2018-02-02 10:48:22,901 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 128 states to 128 states and 133 transitions. [2018-02-02 10:48:22,901 INFO L78 Accepts]: Start accepts. Automaton has 128 states and 133 transitions. Word has length 48 [2018-02-02 10:48:22,901 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 10:48:22,901 INFO L432 AbstractCegarLoop]: Abstraction has 128 states and 133 transitions. [2018-02-02 10:48:22,901 INFO L433 AbstractCegarLoop]: Interpolant automaton has 18 states. [2018-02-02 10:48:22,901 INFO L276 IsEmpty]: Start isEmpty. Operand 128 states and 133 transitions. [2018-02-02 10:48:22,902 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2018-02-02 10:48:22,902 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 10:48:22,902 INFO L351 BasicCegarLoop]: trace histogram [15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-02 10:48:22,902 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-02 10:48:22,902 INFO L82 PathProgramCache]: Analyzing trace with hash -1648580817, now seen corresponding path program 15 times [2018-02-02 10:48:22,903 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 10:48:22,917 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 10:48:22,918 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 10:48:23,074 INFO L134 CoverageAnalysis]: Checked inductivity of 120 backedges. 0 proven. 120 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 10:48:23,074 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-02 10:48:23,074 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [19] total 19 [2018-02-02 10:48:23,074 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 10:48:23,075 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 10:48:23,075 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-02 10:48:23,075 INFO L134 CoverageAnalysis]: Checked inductivity of 120 backedges. 0 proven. 120 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 10:48:23,075 INFO L409 AbstractCegarLoop]: Interpolant automaton has 19 states [2018-02-02 10:48:23,076 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2018-02-02 10:48:23,076 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=155, Invalid=187, Unknown=0, NotChecked=0, Total=342 [2018-02-02 10:48:23,076 INFO L87 Difference]: Start difference. First operand 128 states and 133 transitions. Second operand 19 states. [2018-02-02 10:48:23,124 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 10:48:23,124 INFO L93 Difference]: Finished difference Result 131 states and 136 transitions. [2018-02-02 10:48:23,125 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2018-02-02 10:48:23,125 INFO L78 Accepts]: Start accepts. Automaton has 19 states. Word has length 49 [2018-02-02 10:48:23,125 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 10:48:23,126 INFO L225 Difference]: With dead ends: 131 [2018-02-02 10:48:23,126 INFO L226 Difference]: Without dead ends: 129 [2018-02-02 10:48:23,127 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=159, Invalid=221, Unknown=0, NotChecked=0, Total=380 [2018-02-02 10:48:23,127 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 129 states. [2018-02-02 10:48:23,129 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 129 to 129. [2018-02-02 10:48:23,129 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 129 states. [2018-02-02 10:48:23,130 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 129 states to 129 states and 134 transitions. [2018-02-02 10:48:23,130 INFO L78 Accepts]: Start accepts. Automaton has 129 states and 134 transitions. Word has length 49 [2018-02-02 10:48:23,130 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 10:48:23,130 INFO L432 AbstractCegarLoop]: Abstraction has 129 states and 134 transitions. [2018-02-02 10:48:23,130 INFO L433 AbstractCegarLoop]: Interpolant automaton has 19 states. [2018-02-02 10:48:23,131 INFO L276 IsEmpty]: Start isEmpty. Operand 129 states and 134 transitions. [2018-02-02 10:48:23,131 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2018-02-02 10:48:23,131 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 10:48:23,131 INFO L351 BasicCegarLoop]: trace histogram [16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-02 10:48:23,131 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-02 10:48:23,131 INFO L82 PathProgramCache]: Analyzing trace with hash 102532646, now seen corresponding path program 16 times [2018-02-02 10:48:23,132 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 10:48:23,146 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 10:48:23,147 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 10:48:23,299 INFO L134 CoverageAnalysis]: Checked inductivity of 136 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 136 trivial. 0 not checked. [2018-02-02 10:48:23,300 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-02 10:48:23,300 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2018-02-02 10:48:23,300 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 10:48:23,300 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 10:48:23,300 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-02 10:48:23,301 INFO L134 CoverageAnalysis]: Checked inductivity of 136 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 136 trivial. 0 not checked. [2018-02-02 10:48:23,301 INFO L409 AbstractCegarLoop]: Interpolant automaton has 14 states [2018-02-02 10:48:23,301 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2018-02-02 10:48:23,301 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=156, Unknown=0, NotChecked=0, Total=182 [2018-02-02 10:48:23,301 INFO L87 Difference]: Start difference. First operand 129 states and 134 transitions. Second operand 14 states. [2018-02-02 10:48:23,557 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 10:48:23,557 INFO L93 Difference]: Finished difference Result 128 states and 133 transitions. [2018-02-02 10:48:23,557 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2018-02-02 10:48:23,557 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 50 [2018-02-02 10:48:23,558 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 10:48:23,558 INFO L225 Difference]: With dead ends: 128 [2018-02-02 10:48:23,558 INFO L226 Difference]: Without dead ends: 128 [2018-02-02 10:48:23,559 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 16 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=42, Invalid=264, Unknown=0, NotChecked=0, Total=306 [2018-02-02 10:48:23,559 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 128 states. [2018-02-02 10:48:23,561 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 128 to 128. [2018-02-02 10:48:23,561 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 128 states. [2018-02-02 10:48:23,562 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 128 states to 128 states and 133 transitions. [2018-02-02 10:48:23,562 INFO L78 Accepts]: Start accepts. Automaton has 128 states and 133 transitions. Word has length 50 [2018-02-02 10:48:23,562 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 10:48:23,562 INFO L432 AbstractCegarLoop]: Abstraction has 128 states and 133 transitions. [2018-02-02 10:48:23,562 INFO L433 AbstractCegarLoop]: Interpolant automaton has 14 states. [2018-02-02 10:48:23,562 INFO L276 IsEmpty]: Start isEmpty. Operand 128 states and 133 transitions. [2018-02-02 10:48:23,564 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2018-02-02 10:48:23,565 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 10:48:23,565 INFO L351 BasicCegarLoop]: trace histogram [16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-02 10:48:23,565 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-02 10:48:23,565 INFO L82 PathProgramCache]: Analyzing trace with hash 102532645, now seen corresponding path program 1 times [2018-02-02 10:48:23,566 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 10:48:23,577 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 10:48:23,578 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 10:48:23,650 INFO L134 CoverageAnalysis]: Checked inductivity of 136 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 136 trivial. 0 not checked. [2018-02-02 10:48:23,650 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-02 10:48:23,650 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2018-02-02 10:48:23,650 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 10:48:23,650 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 10:48:23,650 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-02 10:48:23,650 INFO L134 CoverageAnalysis]: Checked inductivity of 136 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 136 trivial. 0 not checked. [2018-02-02 10:48:23,651 INFO L409 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-02-02 10:48:23,651 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-02-02 10:48:23,651 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=73, Unknown=0, NotChecked=0, Total=90 [2018-02-02 10:48:23,651 INFO L87 Difference]: Start difference. First operand 128 states and 133 transitions. Second operand 10 states. [2018-02-02 10:48:23,788 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 10:48:23,788 INFO L93 Difference]: Finished difference Result 127 states and 132 transitions. [2018-02-02 10:48:23,789 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-02-02 10:48:23,789 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 50 [2018-02-02 10:48:23,789 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 10:48:23,789 INFO L225 Difference]: With dead ends: 127 [2018-02-02 10:48:23,789 INFO L226 Difference]: Without dead ends: 127 [2018-02-02 10:48:23,789 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=29, Invalid=127, Unknown=0, NotChecked=0, Total=156 [2018-02-02 10:48:23,790 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 127 states. [2018-02-02 10:48:23,791 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 127 to 127. [2018-02-02 10:48:23,791 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 127 states. [2018-02-02 10:48:23,791 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 127 states to 127 states and 132 transitions. [2018-02-02 10:48:23,791 INFO L78 Accepts]: Start accepts. Automaton has 127 states and 132 transitions. Word has length 50 [2018-02-02 10:48:23,792 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 10:48:23,792 INFO L432 AbstractCegarLoop]: Abstraction has 127 states and 132 transitions. [2018-02-02 10:48:23,792 INFO L433 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-02-02 10:48:23,792 INFO L276 IsEmpty]: Start isEmpty. Operand 127 states and 132 transitions. [2018-02-02 10:48:23,792 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2018-02-02 10:48:23,792 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 10:48:23,792 INFO L351 BasicCegarLoop]: trace histogram [16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-02 10:48:23,792 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-02 10:48:23,792 INFO L82 PathProgramCache]: Analyzing trace with hash 1443896288, now seen corresponding path program 1 times [2018-02-02 10:48:23,793 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 10:48:23,801 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 10:48:23,801 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 10:48:23,852 INFO L134 CoverageAnalysis]: Checked inductivity of 136 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 136 trivial. 0 not checked. [2018-02-02 10:48:23,852 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-02 10:48:23,853 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2018-02-02 10:48:23,853 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 10:48:23,853 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 10:48:23,853 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-02 10:48:23,853 INFO L134 CoverageAnalysis]: Checked inductivity of 136 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 136 trivial. 0 not checked. [2018-02-02 10:48:23,853 INFO L409 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-02-02 10:48:23,853 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-02-02 10:48:23,853 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=73, Unknown=0, NotChecked=0, Total=90 [2018-02-02 10:48:23,853 INFO L87 Difference]: Start difference. First operand 127 states and 132 transitions. Second operand 10 states. [2018-02-02 10:48:23,983 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 10:48:23,983 INFO L93 Difference]: Finished difference Result 125 states and 130 transitions. [2018-02-02 10:48:23,983 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-02-02 10:48:23,983 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 55 [2018-02-02 10:48:23,983 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 10:48:23,984 INFO L225 Difference]: With dead ends: 125 [2018-02-02 10:48:23,984 INFO L226 Difference]: Without dead ends: 125 [2018-02-02 10:48:23,984 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=29, Invalid=127, Unknown=0, NotChecked=0, Total=156 [2018-02-02 10:48:23,984 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 125 states. [2018-02-02 10:48:23,985 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 125 to 125. [2018-02-02 10:48:23,985 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 125 states. [2018-02-02 10:48:23,986 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 125 states to 125 states and 130 transitions. [2018-02-02 10:48:23,986 INFO L78 Accepts]: Start accepts. Automaton has 125 states and 130 transitions. Word has length 55 [2018-02-02 10:48:23,986 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 10:48:23,986 INFO L432 AbstractCegarLoop]: Abstraction has 125 states and 130 transitions. [2018-02-02 10:48:23,986 INFO L433 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-02-02 10:48:23,986 INFO L276 IsEmpty]: Start isEmpty. Operand 125 states and 130 transitions. [2018-02-02 10:48:23,986 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2018-02-02 10:48:23,986 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 10:48:23,986 INFO L351 BasicCegarLoop]: trace histogram [16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-02 10:48:23,986 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-02 10:48:23,987 INFO L82 PathProgramCache]: Analyzing trace with hash 1443896289, now seen corresponding path program 1 times [2018-02-02 10:48:23,987 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 10:48:23,997 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 10:48:23,997 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 10:48:24,115 INFO L134 CoverageAnalysis]: Checked inductivity of 136 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 136 trivial. 0 not checked. [2018-02-02 10:48:24,116 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-02 10:48:24,116 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2018-02-02 10:48:24,116 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 10:48:24,116 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 10:48:24,116 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-02 10:48:24,117 INFO L134 CoverageAnalysis]: Checked inductivity of 136 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 136 trivial. 0 not checked. [2018-02-02 10:48:24,117 INFO L409 AbstractCegarLoop]: Interpolant automaton has 14 states [2018-02-02 10:48:24,117 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2018-02-02 10:48:24,117 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=156, Unknown=0, NotChecked=0, Total=182 [2018-02-02 10:48:24,117 INFO L87 Difference]: Start difference. First operand 125 states and 130 transitions. Second operand 14 states. [2018-02-02 10:48:24,285 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 10:48:24,285 INFO L93 Difference]: Finished difference Result 123 states and 128 transitions. [2018-02-02 10:48:24,285 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2018-02-02 10:48:24,286 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 55 [2018-02-02 10:48:24,286 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 10:48:24,286 INFO L225 Difference]: With dead ends: 123 [2018-02-02 10:48:24,286 INFO L226 Difference]: Without dead ends: 123 [2018-02-02 10:48:24,286 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 16 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=42, Invalid=264, Unknown=0, NotChecked=0, Total=306 [2018-02-02 10:48:24,287 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 123 states. [2018-02-02 10:48:24,288 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 123 to 123. [2018-02-02 10:48:24,288 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 123 states. [2018-02-02 10:48:24,288 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 123 states to 123 states and 128 transitions. [2018-02-02 10:48:24,288 INFO L78 Accepts]: Start accepts. Automaton has 123 states and 128 transitions. Word has length 55 [2018-02-02 10:48:24,288 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 10:48:24,288 INFO L432 AbstractCegarLoop]: Abstraction has 123 states and 128 transitions. [2018-02-02 10:48:24,288 INFO L433 AbstractCegarLoop]: Interpolant automaton has 14 states. [2018-02-02 10:48:24,289 INFO L276 IsEmpty]: Start isEmpty. Operand 123 states and 128 transitions. [2018-02-02 10:48:24,289 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2018-02-02 10:48:24,289 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 10:48:24,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] [2018-02-02 10:48:24,289 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-02 10:48:24,289 INFO L82 PathProgramCache]: Analyzing trace with hash -316102580, now seen corresponding path program 1 times [2018-02-02 10:48:24,290 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 10:48:24,297 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 10:48:24,298 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 10:48:24,374 INFO L134 CoverageAnalysis]: Checked inductivity of 136 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 136 trivial. 0 not checked. [2018-02-02 10:48:24,375 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-02 10:48:24,375 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2018-02-02 10:48:24,375 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 10:48:24,375 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 10:48:24,375 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-02 10:48:24,376 INFO L134 CoverageAnalysis]: Checked inductivity of 136 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 136 trivial. 0 not checked. [2018-02-02 10:48:24,376 INFO L409 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-02-02 10:48:24,376 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-02-02 10:48:24,376 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2018-02-02 10:48:24,376 INFO L87 Difference]: Start difference. First operand 123 states and 128 transitions. Second operand 8 states. [2018-02-02 10:48:24,427 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 10:48:24,427 INFO L93 Difference]: Finished difference Result 125 states and 129 transitions. [2018-02-02 10:48:24,427 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-02-02 10:48:24,427 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 60 [2018-02-02 10:48:24,428 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 10:48:24,428 INFO L225 Difference]: With dead ends: 125 [2018-02-02 10:48:24,428 INFO L226 Difference]: Without dead ends: 123 [2018-02-02 10:48:24,429 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=69, Unknown=0, NotChecked=0, Total=90 [2018-02-02 10:48:24,429 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 123 states. [2018-02-02 10:48:24,431 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 123 to 123. [2018-02-02 10:48:24,431 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 123 states. [2018-02-02 10:48:24,431 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 123 states to 123 states and 127 transitions. [2018-02-02 10:48:24,432 INFO L78 Accepts]: Start accepts. Automaton has 123 states and 127 transitions. Word has length 60 [2018-02-02 10:48:24,432 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 10:48:24,432 INFO L432 AbstractCegarLoop]: Abstraction has 123 states and 127 transitions. [2018-02-02 10:48:24,432 INFO L433 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-02-02 10:48:24,432 INFO L276 IsEmpty]: Start isEmpty. Operand 123 states and 127 transitions. [2018-02-02 10:48:24,433 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2018-02-02 10:48:24,433 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 10:48:24,433 INFO L351 BasicCegarLoop]: trace histogram [16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-02 10:48:24,433 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-02 10:48:24,433 INFO L82 PathProgramCache]: Analyzing trace with hash -2474126, now seen corresponding path program 1 times [2018-02-02 10:48:24,434 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 10:48:24,446 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 10:48:24,447 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 10:48:24,509 INFO L134 CoverageAnalysis]: Checked inductivity of 136 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 136 trivial. 0 not checked. [2018-02-02 10:48:24,510 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-02 10:48:24,510 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2018-02-02 10:48:24,510 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 10:48:24,510 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 10:48:24,511 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-02 10:48:24,511 INFO L134 CoverageAnalysis]: Checked inductivity of 136 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 136 trivial. 0 not checked. [2018-02-02 10:48:24,511 INFO L409 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-02-02 10:48:24,511 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-02-02 10:48:24,511 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=73, Unknown=0, NotChecked=0, Total=90 [2018-02-02 10:48:24,512 INFO L87 Difference]: Start difference. First operand 123 states and 127 transitions. Second operand 10 states. [2018-02-02 10:48:24,577 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 10:48:24,577 INFO L93 Difference]: Finished difference Result 127 states and 130 transitions. [2018-02-02 10:48:24,578 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-02-02 10:48:24,578 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 65 [2018-02-02 10:48:24,578 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 10:48:24,578 INFO L225 Difference]: With dead ends: 127 [2018-02-02 10:48:24,579 INFO L226 Difference]: Without dead ends: 123 [2018-02-02 10:48:24,579 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=29, Invalid=127, Unknown=0, NotChecked=0, Total=156 [2018-02-02 10:48:24,579 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 123 states. [2018-02-02 10:48:24,581 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 123 to 123. [2018-02-02 10:48:24,581 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 123 states. [2018-02-02 10:48:24,581 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 123 states to 123 states and 126 transitions. [2018-02-02 10:48:24,582 INFO L78 Accepts]: Start accepts. Automaton has 123 states and 126 transitions. Word has length 65 [2018-02-02 10:48:24,582 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 10:48:24,582 INFO L432 AbstractCegarLoop]: Abstraction has 123 states and 126 transitions. [2018-02-02 10:48:24,582 INFO L433 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-02-02 10:48:24,582 INFO L276 IsEmpty]: Start isEmpty. Operand 123 states and 126 transitions. [2018-02-02 10:48:24,582 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 77 [2018-02-02 10:48:24,583 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 10:48:24,583 INFO L351 BasicCegarLoop]: trace histogram [16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-02 10:48:24,583 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-02 10:48:24,583 INFO L82 PathProgramCache]: Analyzing trace with hash -1583321193, now seen corresponding path program 1 times [2018-02-02 10:48:24,584 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 10:48:24,598 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 10:48:24,599 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 10:48:24,786 INFO L134 CoverageAnalysis]: Checked inductivity of 136 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 136 trivial. 0 not checked. [2018-02-02 10:48:24,786 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-02 10:48:24,786 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [20] imperfect sequences [] total 20 [2018-02-02 10:48:24,786 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 10:48:24,787 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 10:48:24,787 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-02 10:48:24,787 INFO L134 CoverageAnalysis]: Checked inductivity of 136 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 136 trivial. 0 not checked. [2018-02-02 10:48:24,787 INFO L409 AbstractCegarLoop]: Interpolant automaton has 21 states [2018-02-02 10:48:24,787 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2018-02-02 10:48:24,787 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=41, Invalid=379, Unknown=0, NotChecked=0, Total=420 [2018-02-02 10:48:24,787 INFO L87 Difference]: Start difference. First operand 123 states and 126 transitions. Second operand 21 states. [2018-02-02 10:48:25,219 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 10:48:25,219 INFO L93 Difference]: Finished difference Result 130 states and 133 transitions. [2018-02-02 10:48:25,219 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2018-02-02 10:48:25,220 INFO L78 Accepts]: Start accepts. Automaton has 21 states. Word has length 76 [2018-02-02 10:48:25,220 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 10:48:25,220 INFO L225 Difference]: With dead ends: 130 [2018-02-02 10:48:25,220 INFO L226 Difference]: Without dead ends: 130 [2018-02-02 10:48:25,220 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-02 10:48:25,221 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 130 states. [2018-02-02 10:48:25,222 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 130 to 121. [2018-02-02 10:48:25,222 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 121 states. [2018-02-02 10:48:25,222 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 121 states to 121 states and 124 transitions. [2018-02-02 10:48:25,222 INFO L78 Accepts]: Start accepts. Automaton has 121 states and 124 transitions. Word has length 76 [2018-02-02 10:48:25,222 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 10:48:25,222 INFO L432 AbstractCegarLoop]: Abstraction has 121 states and 124 transitions. [2018-02-02 10:48:25,222 INFO L433 AbstractCegarLoop]: Interpolant automaton has 21 states. [2018-02-02 10:48:25,222 INFO L276 IsEmpty]: Start isEmpty. Operand 121 states and 124 transitions. [2018-02-02 10:48:25,223 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 77 [2018-02-02 10:48:25,223 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 10:48:25,223 INFO L351 BasicCegarLoop]: trace histogram [16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-02 10:48:25,223 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-02 10:48:25,223 INFO L82 PathProgramCache]: Analyzing trace with hash -1583321192, now seen corresponding path program 1 times [2018-02-02 10:48:25,224 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 10:48:25,233 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 10:48:25,234 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 10:48:25,469 INFO L134 CoverageAnalysis]: Checked inductivity of 136 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 136 trivial. 0 not checked. [2018-02-02 10:48:25,470 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-02 10:48:25,470 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [18] imperfect sequences [] total 18 [2018-02-02 10:48:25,470 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 10:48:25,470 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 10:48:25,470 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-02 10:48:25,470 INFO L134 CoverageAnalysis]: Checked inductivity of 136 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 136 trivial. 0 not checked. [2018-02-02 10:48:25,470 INFO L409 AbstractCegarLoop]: Interpolant automaton has 19 states [2018-02-02 10:48:25,471 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2018-02-02 10:48:25,471 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=306, Unknown=0, NotChecked=0, Total=342 [2018-02-02 10:48:25,471 INFO L87 Difference]: Start difference. First operand 121 states and 124 transitions. Second operand 19 states. [2018-02-02 10:48:25,741 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 10:48:25,741 INFO L93 Difference]: Finished difference Result 119 states and 122 transitions. [2018-02-02 10:48:25,742 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2018-02-02 10:48:25,742 INFO L78 Accepts]: Start accepts. Automaton has 19 states. Word has length 76 [2018-02-02 10:48:25,742 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 10:48:25,742 INFO L225 Difference]: With dead ends: 119 [2018-02-02 10:48:25,742 INFO L226 Difference]: Without dead ends: 119 [2018-02-02 10:48:25,743 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 31 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=61, Invalid=539, Unknown=0, NotChecked=0, Total=600 [2018-02-02 10:48:25,743 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 119 states. [2018-02-02 10:48:25,744 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 119 to 119. [2018-02-02 10:48:25,744 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 119 states. [2018-02-02 10:48:25,744 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 119 states to 119 states and 122 transitions. [2018-02-02 10:48:25,744 INFO L78 Accepts]: Start accepts. Automaton has 119 states and 122 transitions. Word has length 76 [2018-02-02 10:48:25,744 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 10:48:25,744 INFO L432 AbstractCegarLoop]: Abstraction has 119 states and 122 transitions. [2018-02-02 10:48:25,744 INFO L433 AbstractCegarLoop]: Interpolant automaton has 19 states. [2018-02-02 10:48:25,745 INFO L276 IsEmpty]: Start isEmpty. Operand 119 states and 122 transitions. [2018-02-02 10:48:25,745 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 75 [2018-02-02 10:48:25,745 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 10:48:25,745 INFO L351 BasicCegarLoop]: trace histogram [16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-02 10:48:25,745 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-02 10:48:25,745 INFO L82 PathProgramCache]: Analyzing trace with hash 576722261, now seen corresponding path program 1 times [2018-02-02 10:48:25,746 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 10:48:25,752 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 10:48:25,753 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 10:48:25,822 INFO L134 CoverageAnalysis]: Checked inductivity of 136 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 136 trivial. 0 not checked. [2018-02-02 10:48:25,823 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-02 10:48:25,823 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2018-02-02 10:48:25,823 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 10:48:25,823 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 10:48:25,823 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-02 10:48:25,823 INFO L134 CoverageAnalysis]: Checked inductivity of 136 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 136 trivial. 0 not checked. [2018-02-02 10:48:25,823 INFO L409 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-02-02 10:48:25,823 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-02-02 10:48:25,824 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=91, Unknown=0, NotChecked=0, Total=110 [2018-02-02 10:48:25,824 INFO L87 Difference]: Start difference. First operand 119 states and 122 transitions. Second operand 11 states. [2018-02-02 10:48:25,876 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 10:48:25,876 INFO L93 Difference]: Finished difference Result 121 states and 123 transitions. [2018-02-02 10:48:25,876 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-02-02 10:48:25,876 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 74 [2018-02-02 10:48:25,876 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 10:48:25,877 INFO L225 Difference]: With dead ends: 121 [2018-02-02 10:48:25,877 INFO L226 Difference]: Without dead ends: 119 [2018-02-02 10:48:25,877 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=31, Invalid=151, Unknown=0, NotChecked=0, Total=182 [2018-02-02 10:48:25,877 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 119 states. [2018-02-02 10:48:25,878 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 119 to 119. [2018-02-02 10:48:25,879 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 119 states. [2018-02-02 10:48:25,879 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 119 states to 119 states and 121 transitions. [2018-02-02 10:48:25,879 INFO L78 Accepts]: Start accepts. Automaton has 119 states and 121 transitions. Word has length 74 [2018-02-02 10:48:25,879 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 10:48:25,880 INFO L432 AbstractCegarLoop]: Abstraction has 119 states and 121 transitions. [2018-02-02 10:48:25,880 INFO L433 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-02-02 10:48:25,880 INFO L276 IsEmpty]: Start isEmpty. Operand 119 states and 121 transitions. [2018-02-02 10:48:25,880 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 91 [2018-02-02 10:48:25,880 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 10:48:25,880 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-02 10:48:25,880 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-02 10:48:25,881 INFO L82 PathProgramCache]: Analyzing trace with hash 33829762, now seen corresponding path program 1 times [2018-02-02 10:48:25,883 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 10:48:25,898 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 10:48:25,899 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 10:48:26,134 INFO L134 CoverageAnalysis]: Checked inductivity of 136 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 136 trivial. 0 not checked. [2018-02-02 10:48:26,134 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-02 10:48:26,134 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [23] imperfect sequences [] total 23 [2018-02-02 10:48:26,134 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 10:48:26,135 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 10:48:26,135 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-02 10:48:26,135 INFO L134 CoverageAnalysis]: Checked inductivity of 136 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 136 trivial. 0 not checked. [2018-02-02 10:48:26,135 INFO L409 AbstractCegarLoop]: Interpolant automaton has 24 states [2018-02-02 10:48:26,135 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2018-02-02 10:48:26,136 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=45, Invalid=507, Unknown=0, NotChecked=0, Total=552 [2018-02-02 10:48:26,136 INFO L87 Difference]: Start difference. First operand 119 states and 121 transitions. Second operand 24 states. [2018-02-02 10:48:26,597 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 10:48:26,597 INFO L93 Difference]: Finished difference Result 122 states and 124 transitions. [2018-02-02 10:48:26,597 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2018-02-02 10:48:26,597 INFO L78 Accepts]: Start accepts. Automaton has 24 states. Word has length 90 [2018-02-02 10:48:26,597 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 10:48:26,598 INFO L225 Difference]: With dead ends: 122 [2018-02-02 10:48:26,598 INFO L226 Difference]: Without dead ends: 122 [2018-02-02 10:48:26,599 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-02 10:48:26,599 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 122 states. [2018-02-02 10:48:26,600 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 122 to 117. [2018-02-02 10:48:26,600 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 117 states. [2018-02-02 10:48:26,601 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 117 states to 117 states and 119 transitions. [2018-02-02 10:48:26,601 INFO L78 Accepts]: Start accepts. Automaton has 117 states and 119 transitions. Word has length 90 [2018-02-02 10:48:26,601 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 10:48:26,601 INFO L432 AbstractCegarLoop]: Abstraction has 117 states and 119 transitions. [2018-02-02 10:48:26,601 INFO L433 AbstractCegarLoop]: Interpolant automaton has 24 states. [2018-02-02 10:48:26,601 INFO L276 IsEmpty]: Start isEmpty. Operand 117 states and 119 transitions. [2018-02-02 10:48:26,602 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 91 [2018-02-02 10:48:26,602 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 10:48:26,602 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-02 10:48:26,602 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-02 10:48:26,602 INFO L82 PathProgramCache]: Analyzing trace with hash 33829763, now seen corresponding path program 1 times [2018-02-02 10:48:26,603 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 10:48:26,621 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 10:48:26,622 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 10:48:26,980 INFO L134 CoverageAnalysis]: Checked inductivity of 136 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 136 trivial. 0 not checked. [2018-02-02 10:48:26,980 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-02 10:48:26,980 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [24] imperfect sequences [] total 24 [2018-02-02 10:48:26,981 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 10:48:26,981 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 10:48:26,981 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-02 10:48:26,981 INFO L134 CoverageAnalysis]: Checked inductivity of 136 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 136 trivial. 0 not checked. [2018-02-02 10:48:26,982 INFO L409 AbstractCegarLoop]: Interpolant automaton has 25 states [2018-02-02 10:48:26,982 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2018-02-02 10:48:26,982 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=49, Invalid=551, Unknown=0, NotChecked=0, Total=600 [2018-02-02 10:48:26,982 INFO L87 Difference]: Start difference. First operand 117 states and 119 transitions. Second operand 25 states. [2018-02-02 10:48:27,388 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 10:48:27,388 INFO L93 Difference]: Finished difference Result 116 states and 118 transitions. [2018-02-02 10:48:27,388 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2018-02-02 10:48:27,388 INFO L78 Accepts]: Start accepts. Automaton has 25 states. Word has length 90 [2018-02-02 10:48:27,389 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 10:48:27,389 INFO L225 Difference]: With dead ends: 116 [2018-02-02 10:48:27,389 INFO L226 Difference]: Without dead ends: 116 [2018-02-02 10:48:27,390 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 36 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 33 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 65 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=92, Invalid=1098, Unknown=0, NotChecked=0, Total=1190 [2018-02-02 10:48:27,390 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 116 states. [2018-02-02 10:48:27,391 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 116 to 116. [2018-02-02 10:48:27,391 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 116 states. [2018-02-02 10:48:27,391 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 116 states to 116 states and 118 transitions. [2018-02-02 10:48:27,391 INFO L78 Accepts]: Start accepts. Automaton has 116 states and 118 transitions. Word has length 90 [2018-02-02 10:48:27,391 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 10:48:27,391 INFO L432 AbstractCegarLoop]: Abstraction has 116 states and 118 transitions. [2018-02-02 10:48:27,391 INFO L433 AbstractCegarLoop]: Interpolant automaton has 25 states. [2018-02-02 10:48:27,391 INFO L276 IsEmpty]: Start isEmpty. Operand 116 states and 118 transitions. [2018-02-02 10:48:27,392 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 93 [2018-02-02 10:48:27,392 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 10:48:27,392 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-02 10:48:27,392 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-02 10:48:27,392 INFO L82 PathProgramCache]: Analyzing trace with hash -1849335101, now seen corresponding path program 1 times [2018-02-02 10:48:27,393 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 10:48:27,406 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 10:48:27,408 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 10:48:27,645 INFO L134 CoverageAnalysis]: Checked inductivity of 136 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 136 trivial. 0 not checked. [2018-02-02 10:48:27,645 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-02 10:48:27,646 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [21] imperfect sequences [] total 21 [2018-02-02 10:48:27,646 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 10:48:27,646 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 10:48:27,646 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-02 10:48:27,646 INFO L134 CoverageAnalysis]: Checked inductivity of 136 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 136 trivial. 0 not checked. [2018-02-02 10:48:27,647 INFO L409 AbstractCegarLoop]: Interpolant automaton has 22 states [2018-02-02 10:48:27,647 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2018-02-02 10:48:27,647 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=42, Invalid=420, Unknown=0, NotChecked=0, Total=462 [2018-02-02 10:48:27,647 INFO L87 Difference]: Start difference. First operand 116 states and 118 transitions. Second operand 22 states. [2018-02-02 10:48:27,835 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 10:48:27,835 INFO L93 Difference]: Finished difference Result 115 states and 117 transitions. [2018-02-02 10:48:27,835 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2018-02-02 10:48:27,835 INFO L78 Accepts]: Start accepts. Automaton has 22 states. Word has length 92 [2018-02-02 10:48:27,836 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 10:48:27,836 INFO L225 Difference]: With dead ends: 115 [2018-02-02 10:48:27,836 INFO L226 Difference]: Without dead ends: 115 [2018-02-02 10:48:27,836 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 31 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 29 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 42 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=80, Invalid=850, Unknown=0, NotChecked=0, Total=930 [2018-02-02 10:48:27,836 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 115 states. [2018-02-02 10:48:27,837 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 115 to 115. [2018-02-02 10:48:27,837 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 115 states. [2018-02-02 10:48:27,838 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 115 states to 115 states and 117 transitions. [2018-02-02 10:48:27,838 INFO L78 Accepts]: Start accepts. Automaton has 115 states and 117 transitions. Word has length 92 [2018-02-02 10:48:27,838 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 10:48:27,838 INFO L432 AbstractCegarLoop]: Abstraction has 115 states and 117 transitions. [2018-02-02 10:48:27,838 INFO L433 AbstractCegarLoop]: Interpolant automaton has 22 states. [2018-02-02 10:48:27,838 INFO L276 IsEmpty]: Start isEmpty. Operand 115 states and 117 transitions. [2018-02-02 10:48:27,838 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 95 [2018-02-02 10:48:27,838 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 10:48:27,838 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-02 10:48:27,838 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-02 10:48:27,839 INFO L82 PathProgramCache]: Analyzing trace with hash 905430660, now seen corresponding path program 1 times [2018-02-02 10:48:27,839 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 10:48:27,906 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 10:48:27,907 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 10:48:27,921 FATAL L292 ToolchainWalker]: The Plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction has thrown an exception: java.lang.UnsupportedOperationException: Unknown lemma type! at de.uni_freiburg.informatik.ultimate.smtinterpol.interpolate.Interpolator.walkLeafNode(Interpolator.java:299) at de.uni_freiburg.informatik.ultimate.smtinterpol.interpolate.Interpolator.access$1(Interpolator.java:263) at de.uni_freiburg.informatik.ultimate.smtinterpol.interpolate.Interpolator$ProofTreeWalker.walk(Interpolator.java:132) at de.uni_freiburg.informatik.ultimate.logic.NonRecursive.run(NonRecursive.java:122) at de.uni_freiburg.informatik.ultimate.logic.NonRecursive.run(NonRecursive.java:113) at de.uni_freiburg.informatik.ultimate.smtinterpol.interpolate.Interpolator.interpolate(Interpolator.java:220) at de.uni_freiburg.informatik.ultimate.smtinterpol.interpolate.Interpolator.getInterpolants(Interpolator.java:201) at de.uni_freiburg.informatik.ultimate.smtinterpol.smtlib2.SMTInterpol.getInterpolants(SMTInterpol.java:915) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.smt.managedscript.ManagedScript.getInterpolants(ManagedScript.java:192) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.singletracecheck.NestedInterpolantsBuilder.computeCraigInterpolants(NestedInterpolantsBuilder.java:281) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.singletracecheck.NestedInterpolantsBuilder.(NestedInterpolantsBuilder.java:164) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.singletracecheck.InterpolatingTraceCheckCraig.computeInterpolantsTree(InterpolatingTraceCheckCraig.java:263) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.singletracecheck.InterpolatingTraceCheckCraig.computeInterpolants(InterpolatingTraceCheckCraig.java:199) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.singletracecheck.InterpolatingTraceCheckCraig.(InterpolatingTraceCheckCraig.java:106) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceCheckConstructor.constructCraig(TraceCheckConstructor.java:222) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceCheckConstructor.get(TraceCheckConstructor.java:179) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.FixedTraceAbstractionRefinementStrategy.getTraceCheck(FixedTraceAbstractionRefinementStrategy.java:131) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.BaseRefinementStrategy.checkFeasibility(BaseRefinementStrategy.java:231) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.BaseRefinementStrategy.executeStrategy(BaseRefinementStrategy.java:205) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.(TraceAbstractionRefinementEngine.java:68) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.isCounterexampleFeasible(BasicCegarLoop.java:397) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterateInternal(AbstractCegarLoop.java:381) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:316) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.iterate(TraceAbstractionStarter.java:292) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:147) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:115) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:119) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:168) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:151) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:128) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:232) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:226) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:142) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:104) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:324) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.runToolchainDefault(DefaultToolchainJob.java:221) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.BasicToolchainJob.run(BasicToolchainJob.java:134) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:55) [2018-02-02 10:48:27,925 INFO L168 Benchmark]: Toolchain (without parser) took 8606.26 ms. Allocated memory was 406.8 MB in the beginning and 856.2 MB in the end (delta: 449.3 MB). Free memory was 363.5 MB in the beginning and 635.2 MB in the end (delta: -271.7 MB). Peak memory consumption was 177.7 MB. Max. memory is 5.3 GB. [2018-02-02 10:48:27,926 INFO L168 Benchmark]: CDTParser took 0.13 ms. Allocated memory is still 406.8 MB. Free memory is still 370.1 MB. There was no memory consumed. Max. memory is 5.3 GB. [2018-02-02 10:48:27,926 INFO L168 Benchmark]: CACSL2BoogieTranslator took 177.25 ms. Allocated memory is still 406.8 MB. Free memory was 363.5 MB in the beginning and 349.0 MB in the end (delta: 14.5 MB). Peak memory consumption was 14.5 MB. Max. memory is 5.3 GB. [2018-02-02 10:48:27,926 INFO L168 Benchmark]: Boogie Preprocessor took 31.58 ms. Allocated memory is still 406.8 MB. Free memory was 349.0 MB in the beginning and 347.7 MB in the end (delta: 1.3 MB). Peak memory consumption was 1.3 MB. Max. memory is 5.3 GB. [2018-02-02 10:48:27,927 INFO L168 Benchmark]: RCFGBuilder took 344.70 ms. Allocated memory is still 406.8 MB. Free memory was 347.7 MB in the beginning and 314.5 MB in the end (delta: 33.1 MB). Peak memory consumption was 33.1 MB. Max. memory is 5.3 GB. [2018-02-02 10:48:27,927 INFO L168 Benchmark]: TraceAbstraction took 8050.00 ms. Allocated memory was 406.8 MB in the beginning and 856.2 MB in the end (delta: 449.3 MB). Free memory was 314.5 MB in the beginning and 635.2 MB in the end (delta: -320.7 MB). Peak memory consumption was 128.7 MB. Max. memory is 5.3 GB. [2018-02-02 10:48:27,928 INFO L344 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.13 ms. Allocated memory is still 406.8 MB. Free memory is still 370.1 MB. There was no memory consumed. Max. memory is 5.3 GB. * CACSL2BoogieTranslator took 177.25 ms. Allocated memory is still 406.8 MB. Free memory was 363.5 MB in the beginning and 349.0 MB in the end (delta: 14.5 MB). Peak memory consumption was 14.5 MB. Max. memory is 5.3 GB. * Boogie Preprocessor took 31.58 ms. Allocated memory is still 406.8 MB. Free memory was 349.0 MB in the beginning and 347.7 MB in the end (delta: 1.3 MB). Peak memory consumption was 1.3 MB. Max. memory is 5.3 GB. * RCFGBuilder took 344.70 ms. Allocated memory is still 406.8 MB. Free memory was 347.7 MB in the beginning and 314.5 MB in the end (delta: 33.1 MB). Peak memory consumption was 33.1 MB. Max. memory is 5.3 GB. * TraceAbstraction took 8050.00 ms. Allocated memory was 406.8 MB in the beginning and 856.2 MB in the end (delta: 449.3 MB). Free memory was 314.5 MB in the beginning and 635.2 MB in the end (delta: -320.7 MB). Peak memory consumption was 128.7 MB. Max. memory is 5.3 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - ExceptionOrErrorResult: UnsupportedOperationException: Unknown lemma type! de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: UnsupportedOperationException: Unknown lemma type!: de.uni_freiburg.informatik.ultimate.smtinterpol.interpolate.Interpolator.walkLeafNode(Interpolator.java:299) RESULT: Ultimate could not prove your program: Toolchain returned no result. 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_NoArray.epf_AutomizerC.xml/Csv-Benchmark-0-2018-02-02_10-48-27-934.csv Received shutdown request...