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_3_true-valid-memsafety_true-termination.i -------------------------------------------------------------------------------- This is Ultimate 0.1.23-26d9e06-m [2018-02-02 10:48:29,370 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-02-02 10:48:29,371 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-02-02 10:48:29,383 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-02-02 10:48:29,384 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-02-02 10:48:29,384 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-02-02 10:48:29,385 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-02-02 10:48:29,387 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-02-02 10:48:29,388 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-02-02 10:48:29,389 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-02-02 10:48:29,389 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-02-02 10:48:29,389 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-02-02 10:48:29,390 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-02-02 10:48:29,391 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-02-02 10:48:29,392 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-02-02 10:48:29,393 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-02-02 10:48:29,395 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-02-02 10:48:29,396 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-02-02 10:48:29,397 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-02-02 10:48:29,398 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-02-02 10:48:29,399 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-02-02 10:48:29,400 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-02-02 10:48:29,400 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-02-02 10:48:29,400 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-02-02 10:48:29,401 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-02-02 10:48:29,402 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-02-02 10:48:29,402 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-02-02 10:48:29,403 INFO L177 SettingsManager]: PEA to Boogie provides no preferences, ignoring... [2018-02-02 10:48:29,403 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-02-02 10:48:29,403 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-02-02 10:48:29,403 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-02-02 10:48:29,404 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:29,412 INFO L110 SettingsManager]: Loading preferences was successful [2018-02-02 10:48:29,413 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-02-02 10:48:29,413 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-02-02 10:48:29,414 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-02-02 10:48:29,414 INFO L133 SettingsManager]: * Use SBE=true [2018-02-02 10:48:29,414 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-02-02 10:48:29,414 INFO L133 SettingsManager]: * sizeof long=4 [2018-02-02 10:48:29,414 INFO L133 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2018-02-02 10:48:29,414 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-02-02 10:48:29,414 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-02-02 10:48:29,415 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-02-02 10:48:29,415 INFO L133 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2018-02-02 10:48:29,415 INFO L133 SettingsManager]: * Bitprecise bitfields=true [2018-02-02 10:48:29,415 INFO L133 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2018-02-02 10:48:29,415 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-02-02 10:48:29,415 INFO L133 SettingsManager]: * sizeof long double=12 [2018-02-02 10:48:29,415 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-02-02 10:48:29,416 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-02-02 10:48:29,416 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-02-02 10:48:29,416 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-02-02 10:48:29,416 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-02-02 10:48:29,416 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-02-02 10:48:29,416 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=Craig_TreeInterpolation [2018-02-02 10:48:29,416 INFO L133 SettingsManager]: * SMT solver=Internal_SMTInterpol_NoArrayInterpol [2018-02-02 10:48:29,447 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-02-02 10:48:29,459 INFO L266 ainManager$Toolchain]: [Toolchain 1]: Parser(s) successfully initialized [2018-02-02 10:48:29,462 INFO L222 ainManager$Toolchain]: [Toolchain 1]: Toolchain data selected. [2018-02-02 10:48:29,463 INFO L271 PluginConnector]: Initializing CDTParser... [2018-02-02 10:48:29,464 INFO L276 PluginConnector]: CDTParser initialized [2018-02-02 10:48:29,464 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/ldv-memsafety/memleaks_test22_3_true-valid-memsafety_true-termination.i [2018-02-02 10:48:29,605 INFO L304 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-02-02 10:48:29,606 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2018-02-02 10:48:29,607 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-02-02 10:48:29,607 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-02-02 10:48:29,613 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-02-02 10:48:29,614 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 02.02 10:48:29" (1/1) ... [2018-02-02 10:48:29,617 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@13fd9ce0 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.02 10:48:29, skipping insertion in model container [2018-02-02 10:48:29,617 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 02.02 10:48:29" (1/1) ... [2018-02-02 10:48:29,631 INFO L153 Dispatcher]: Using SV-COMP mode [2018-02-02 10:48:29,678 INFO L153 Dispatcher]: Using SV-COMP mode [2018-02-02 10:48:29,768 INFO L450 PostProcessor]: Settings: Checked method=main [2018-02-02 10:48:29,785 INFO L450 PostProcessor]: Settings: Checked method=main [2018-02-02 10:48:29,794 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.02 10:48:29 WrapperNode [2018-02-02 10:48:29,794 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-02-02 10:48:29,795 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-02-02 10:48:29,795 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-02-02 10:48:29,795 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-02-02 10:48:29,807 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:29" (1/1) ... [2018-02-02 10:48:29,808 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:29" (1/1) ... [2018-02-02 10:48:29,818 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:29" (1/1) ... [2018-02-02 10:48:29,818 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:29" (1/1) ... [2018-02-02 10:48:29,823 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:29" (1/1) ... [2018-02-02 10:48:29,825 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:29" (1/1) ... [2018-02-02 10:48:29,827 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:29" (1/1) ... [2018-02-02 10:48:29,829 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-02-02 10:48:29,829 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-02-02 10:48:29,829 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-02-02 10:48:29,830 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-02-02 10:48:29,830 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.02 10:48:29" (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:29,867 INFO L136 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-02-02 10:48:29,867 INFO L136 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-02-02 10:48:29,867 INFO L136 BoogieDeclarations]: Found implementation of procedure ##fun~$Pointer$~TO~VOID [2018-02-02 10:48:29,867 INFO L136 BoogieDeclarations]: Found implementation of procedure ldv_malloc [2018-02-02 10:48:29,868 INFO L136 BoogieDeclarations]: Found implementation of procedure LDV_INIT_LIST_HEAD [2018-02-02 10:48:29,868 INFO L136 BoogieDeclarations]: Found implementation of procedure ldv_atomic_add_return [2018-02-02 10:48:29,868 INFO L136 BoogieDeclarations]: Found implementation of procedure ldv_atomic_sub_return [2018-02-02 10:48:29,868 INFO L136 BoogieDeclarations]: Found implementation of procedure ldv_kref_sub [2018-02-02 10:48:29,868 INFO L136 BoogieDeclarations]: Found implementation of procedure ldv_kref_init [2018-02-02 10:48:29,868 INFO L136 BoogieDeclarations]: Found implementation of procedure ldv_kref_get [2018-02-02 10:48:29,868 INFO L136 BoogieDeclarations]: Found implementation of procedure ldv_kref_put [2018-02-02 10:48:29,868 INFO L136 BoogieDeclarations]: Found implementation of procedure ldv_kobject_cleanup [2018-02-02 10:48:29,868 INFO L136 BoogieDeclarations]: Found implementation of procedure ldv_kobject_release [2018-02-02 10:48:29,868 INFO L136 BoogieDeclarations]: Found implementation of procedure ldv_kobject_put [2018-02-02 10:48:29,868 INFO L136 BoogieDeclarations]: Found implementation of procedure ldv_kobject_get [2018-02-02 10:48:29,869 INFO L136 BoogieDeclarations]: Found implementation of procedure ldv_kobject_init_internal [2018-02-02 10:48:29,869 INFO L136 BoogieDeclarations]: Found implementation of procedure ldv_kobject_init [2018-02-02 10:48:29,869 INFO L136 BoogieDeclarations]: Found implementation of procedure ldv_kobject_create [2018-02-02 10:48:29,869 INFO L136 BoogieDeclarations]: Found implementation of procedure f_22_get [2018-02-02 10:48:29,869 INFO L136 BoogieDeclarations]: Found implementation of procedure f_22_put [2018-02-02 10:48:29,869 INFO L136 BoogieDeclarations]: Found implementation of procedure entry_point [2018-02-02 10:48:29,869 INFO L136 BoogieDeclarations]: Found implementation of procedure main [2018-02-02 10:48:29,869 INFO L128 BoogieDeclarations]: Found specification of procedure write~int [2018-02-02 10:48:29,869 INFO L128 BoogieDeclarations]: Found specification of procedure read~int [2018-02-02 10:48:29,869 INFO L128 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2018-02-02 10:48:29,869 INFO L128 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2018-02-02 10:48:29,869 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.free [2018-02-02 10:48:29,869 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2018-02-02 10:48:29,869 INFO L128 BoogieDeclarations]: Found specification of procedure #Ultimate.alloc [2018-02-02 10:48:29,870 INFO L128 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memset [2018-02-02 10:48:29,870 INFO L136 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memset [2018-02-02 10:48:29,870 INFO L128 BoogieDeclarations]: Found specification of procedure malloc [2018-02-02 10:48:29,870 INFO L128 BoogieDeclarations]: Found specification of procedure free [2018-02-02 10:48:29,870 INFO L128 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2018-02-02 10:48:29,870 INFO L128 BoogieDeclarations]: Found specification of procedure memset [2018-02-02 10:48:29,870 INFO L128 BoogieDeclarations]: Found specification of procedure ldv_malloc [2018-02-02 10:48:29,870 INFO L128 BoogieDeclarations]: Found specification of procedure LDV_INIT_LIST_HEAD [2018-02-02 10:48:29,870 INFO L128 BoogieDeclarations]: Found specification of procedure ldv_atomic_add_return [2018-02-02 10:48:29,870 INFO L128 BoogieDeclarations]: Found specification of procedure ldv_atomic_sub_return [2018-02-02 10:48:29,870 INFO L128 BoogieDeclarations]: Found specification of procedure ldv_kref_sub [2018-02-02 10:48:29,870 INFO L128 BoogieDeclarations]: Found specification of procedure ##fun~$Pointer$~TO~VOID [2018-02-02 10:48:29,870 INFO L128 BoogieDeclarations]: Found specification of procedure ldv_kref_init [2018-02-02 10:48:29,870 INFO L128 BoogieDeclarations]: Found specification of procedure ldv_kref_get [2018-02-02 10:48:29,871 INFO L128 BoogieDeclarations]: Found specification of procedure ldv_kref_put [2018-02-02 10:48:29,871 INFO L128 BoogieDeclarations]: Found specification of procedure ldv_kobject_cleanup [2018-02-02 10:48:29,871 INFO L128 BoogieDeclarations]: Found specification of procedure ldv_kobject_release [2018-02-02 10:48:29,871 INFO L128 BoogieDeclarations]: Found specification of procedure ldv_kobject_put [2018-02-02 10:48:29,871 INFO L128 BoogieDeclarations]: Found specification of procedure ldv_kobject_get [2018-02-02 10:48:29,871 INFO L128 BoogieDeclarations]: Found specification of procedure ldv_kobject_init_internal [2018-02-02 10:48:29,871 INFO L128 BoogieDeclarations]: Found specification of procedure ldv_kobject_init [2018-02-02 10:48:29,871 INFO L128 BoogieDeclarations]: Found specification of procedure ldv_kobject_create [2018-02-02 10:48:29,871 INFO L128 BoogieDeclarations]: Found specification of procedure f_22_get [2018-02-02 10:48:29,871 INFO L128 BoogieDeclarations]: Found specification of procedure f_22_put [2018-02-02 10:48:29,871 INFO L128 BoogieDeclarations]: Found specification of procedure entry_point [2018-02-02 10:48:29,872 INFO L128 BoogieDeclarations]: Found specification of procedure main [2018-02-02 10:48:29,872 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-02-02 10:48:29,872 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-02-02 10:48:30,050 WARN L455 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2018-02-02 10:48:30,214 INFO L257 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-02-02 10:48:30,215 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 02.02 10:48:30 BoogieIcfgContainer [2018-02-02 10:48:30,215 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-02-02 10:48:30,216 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-02-02 10:48:30,216 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-02-02 10:48:30,218 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-02-02 10:48:30,218 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 02.02 10:48:29" (1/3) ... [2018-02-02 10:48:30,219 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@45a59390 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 02.02 10:48:30, skipping insertion in model container [2018-02-02 10:48:30,219 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.02 10:48:29" (2/3) ... [2018-02-02 10:48:30,219 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@45a59390 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 02.02 10:48:30, skipping insertion in model container [2018-02-02 10:48:30,220 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 02.02 10:48:30" (3/3) ... [2018-02-02 10:48:30,221 INFO L107 eAbstractionObserver]: Analyzing ICFG memleaks_test22_3_true-valid-memsafety_true-termination.i [2018-02-02 10:48:30,226 INFO L128 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:Craig_TreeInterpolation Determinization: PREDICATE_ABSTRACTION [2018-02-02 10:48:30,232 INFO L140 ceAbstractionStarter]: Appying trace abstraction to program that has 23 error locations. [2018-02-02 10:48:30,254 INFO L322 AbstractCegarLoop]: Interprodecural is true [2018-02-02 10:48:30,254 INFO L323 AbstractCegarLoop]: Hoare is false [2018-02-02 10:48:30,254 INFO L324 AbstractCegarLoop]: Compute interpolants for Craig_TreeInterpolation [2018-02-02 10:48:30,254 INFO L325 AbstractCegarLoop]: Backedges is CANONICAL [2018-02-02 10:48:30,254 INFO L326 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-02-02 10:48:30,254 INFO L327 AbstractCegarLoop]: Difference is false [2018-02-02 10:48:30,254 INFO L328 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-02-02 10:48:30,254 INFO L333 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-02-02 10:48:30,255 INFO L87 2NestedWordAutomaton]: Mode: main mode - execution starts in main procedure [2018-02-02 10:48:30,265 INFO L276 IsEmpty]: Start isEmpty. Operand 151 states. [2018-02-02 10:48:30,272 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2018-02-02 10:48:30,272 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 10:48:30,273 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:30,273 INFO L371 AbstractCegarLoop]: === Iteration 1 === [ldv_kref_initErr0RequiresViolation, ldv_kref_initErr1RequiresViolation, ldv_kobject_createErr0RequiresViolation, ldv_kobject_createErr1RequiresViolation, ldv_atomic_sub_returnErr1RequiresViolation, ldv_atomic_sub_returnErr0RequiresViolation, ldv_atomic_sub_returnErr3RequiresViolation, ldv_atomic_sub_returnErr2RequiresViolation, ldv_atomic_add_returnErr0RequiresViolation, ldv_atomic_add_returnErr1RequiresViolation, ldv_atomic_add_returnErr2RequiresViolation, ldv_atomic_add_returnErr3RequiresViolation, ldv_kobject_cleanupErr4RequiresViolation, ldv_kobject_cleanupErr2RequiresViolation, ldv_kobject_cleanupErr5RequiresViolation, ldv_kobject_cleanupErr3RequiresViolation, ldv_kobject_cleanupErr0RequiresViolation, ldv_kobject_cleanupErr1RequiresViolation, mainErr0EnsuresViolation, LDV_INIT_LIST_HEADErr1RequiresViolation, LDV_INIT_LIST_HEADErr3RequiresViolation, LDV_INIT_LIST_HEADErr2RequiresViolation, LDV_INIT_LIST_HEADErr0RequiresViolation]=== [2018-02-02 10:48:30,276 INFO L82 PathProgramCache]: Analyzing trace with hash 1245228870, now seen corresponding path program 1 times [2018-02-02 10:48:30,312 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 10:48:30,342 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 10:48:30,349 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:30,494 INFO 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:30,496 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-02 10:48:30,496 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-02-02 10:48:30,497 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 10:48:30,497 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 10:48:30,498 INFO L182 omatonBuilderFactory]: Interpolants [154#true, 155#false, 156#(and (= 0 |ldv_malloc_#res.offset|) (= 0 |ldv_malloc_#res.base|)), 157#(and (= 0 |ldv_kobject_create_#t~ret17.base|) (= 0 |ldv_kobject_create_#t~ret17.offset|)), 158#(and (= ldv_kobject_create_~kobj~1.offset 0) (= ldv_kobject_create_~kobj~1.base 0))] [2018-02-02 10:48:30,498 INFO 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:30,499 INFO L409 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-02-02 10:48:30,506 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-02-02 10:48:30,507 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-02-02 10:48:30,508 INFO L87 Difference]: Start difference. First operand 151 states. Second operand 5 states. [2018-02-02 10:48:30,554 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 10:48:30,554 INFO L93 Difference]: Finished difference Result 157 states and 166 transitions. [2018-02-02 10:48:30,555 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-02-02 10:48:30,555 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 17 [2018-02-02 10:48:30,556 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 10:48:30,566 INFO L225 Difference]: With dead ends: 157 [2018-02-02 10:48:30,566 INFO L226 Difference]: Without dead ends: 154 [2018-02-02 10:48:30,567 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:30,579 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 154 states. [2018-02-02 10:48:30,600 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 154 to 152. [2018-02-02 10:48:30,601 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 152 states. [2018-02-02 10:48:30,603 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 152 states to 152 states and 161 transitions. [2018-02-02 10:48:30,604 INFO L78 Accepts]: Start accepts. Automaton has 152 states and 161 transitions. Word has length 17 [2018-02-02 10:48:30,605 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 10:48:30,605 INFO L432 AbstractCegarLoop]: Abstraction has 152 states and 161 transitions. [2018-02-02 10:48:30,605 INFO L433 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-02-02 10:48:30,605 INFO L276 IsEmpty]: Start isEmpty. Operand 152 states and 161 transitions. [2018-02-02 10:48:30,606 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2018-02-02 10:48:30,606 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 10:48:30,606 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:30,606 INFO L371 AbstractCegarLoop]: === Iteration 2 === [ldv_kref_initErr0RequiresViolation, ldv_kref_initErr1RequiresViolation, ldv_kobject_createErr0RequiresViolation, ldv_kobject_createErr1RequiresViolation, ldv_atomic_sub_returnErr1RequiresViolation, ldv_atomic_sub_returnErr0RequiresViolation, ldv_atomic_sub_returnErr3RequiresViolation, ldv_atomic_sub_returnErr2RequiresViolation, ldv_atomic_add_returnErr0RequiresViolation, ldv_atomic_add_returnErr1RequiresViolation, ldv_atomic_add_returnErr2RequiresViolation, ldv_atomic_add_returnErr3RequiresViolation, ldv_kobject_cleanupErr4RequiresViolation, ldv_kobject_cleanupErr2RequiresViolation, ldv_kobject_cleanupErr5RequiresViolation, ldv_kobject_cleanupErr3RequiresViolation, ldv_kobject_cleanupErr0RequiresViolation, ldv_kobject_cleanupErr1RequiresViolation, mainErr0EnsuresViolation, LDV_INIT_LIST_HEADErr1RequiresViolation, LDV_INIT_LIST_HEADErr3RequiresViolation, LDV_INIT_LIST_HEADErr2RequiresViolation, LDV_INIT_LIST_HEADErr0RequiresViolation]=== [2018-02-02 10:48:30,606 INFO L82 PathProgramCache]: Analyzing trace with hash -1572748952, now seen corresponding path program 1 times [2018-02-02 10:48:30,608 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 10:48:30,624 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 10:48:30,625 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:30,678 INFO 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:30,678 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-02 10:48:30,678 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-02-02 10:48:30,679 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 10:48:30,679 INFO 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:30,679 INFO L182 omatonBuilderFactory]: Interpolants [468#true, 469#false, 470#(= 1 (select |#valid| |ldv_malloc_#t~malloc4.base|)), 471#(= 1 (select |#valid| |ldv_malloc_#res.base|)), 472#(= 1 (select |#valid| |ldv_kobject_create_#t~ret17.base|)), 473#(= 1 (select |#valid| ldv_kobject_create_~kobj~1.base))] [2018-02-02 10:48:30,679 INFO 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:30,681 INFO L409 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-02-02 10:48:30,681 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-02-02 10:48:30,681 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-02-02 10:48:30,681 INFO L87 Difference]: Start difference. First operand 152 states and 161 transitions. Second operand 6 states. [2018-02-02 10:48:30,810 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 10:48:30,811 INFO L93 Difference]: Finished difference Result 153 states and 162 transitions. [2018-02-02 10:48:30,811 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-02-02 10:48:30,811 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 19 [2018-02-02 10:48:30,812 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 10:48:30,813 INFO L225 Difference]: With dead ends: 153 [2018-02-02 10:48:30,813 INFO L226 Difference]: Without dead ends: 153 [2018-02-02 10:48:30,814 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:30,814 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 153 states. [2018-02-02 10:48:30,819 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 153 to 151. [2018-02-02 10:48:30,819 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 151 states. [2018-02-02 10:48:30,821 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 151 states to 151 states and 160 transitions. [2018-02-02 10:48:30,821 INFO L78 Accepts]: Start accepts. Automaton has 151 states and 160 transitions. Word has length 19 [2018-02-02 10:48:30,821 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 10:48:30,821 INFO L432 AbstractCegarLoop]: Abstraction has 151 states and 160 transitions. [2018-02-02 10:48:30,821 INFO L433 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-02-02 10:48:30,821 INFO L276 IsEmpty]: Start isEmpty. Operand 151 states and 160 transitions. [2018-02-02 10:48:30,822 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2018-02-02 10:48:30,822 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 10:48:30,822 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:30,822 INFO L371 AbstractCegarLoop]: === Iteration 3 === [ldv_kref_initErr0RequiresViolation, ldv_kref_initErr1RequiresViolation, ldv_kobject_createErr0RequiresViolation, ldv_kobject_createErr1RequiresViolation, ldv_atomic_sub_returnErr1RequiresViolation, ldv_atomic_sub_returnErr0RequiresViolation, ldv_atomic_sub_returnErr3RequiresViolation, ldv_atomic_sub_returnErr2RequiresViolation, ldv_atomic_add_returnErr0RequiresViolation, ldv_atomic_add_returnErr1RequiresViolation, ldv_atomic_add_returnErr2RequiresViolation, ldv_atomic_add_returnErr3RequiresViolation, ldv_kobject_cleanupErr4RequiresViolation, ldv_kobject_cleanupErr2RequiresViolation, ldv_kobject_cleanupErr5RequiresViolation, ldv_kobject_cleanupErr3RequiresViolation, ldv_kobject_cleanupErr0RequiresViolation, ldv_kobject_cleanupErr1RequiresViolation, mainErr0EnsuresViolation, LDV_INIT_LIST_HEADErr1RequiresViolation, LDV_INIT_LIST_HEADErr3RequiresViolation, LDV_INIT_LIST_HEADErr2RequiresViolation, LDV_INIT_LIST_HEADErr0RequiresViolation]=== [2018-02-02 10:48:30,822 INFO L82 PathProgramCache]: Analyzing trace with hash -1572748951, now seen corresponding path program 1 times [2018-02-02 10:48:30,823 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 10:48:30,842 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 10:48:30,843 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:30,996 INFO 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:30,997 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-02 10:48:30,997 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-02-02 10:48:30,997 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 10:48:30,998 INFO 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:30,998 INFO L182 omatonBuilderFactory]: Interpolants [784#(and (= 0 |ldv_malloc_#res.offset|) (or (<= (+ |ldv_malloc_#in~size| 1) 0) (<= |ldv_malloc_#in~size| (select |#length| |ldv_malloc_#res.base|)) (<= 2147483648 |ldv_malloc_#in~size|))), 785#(and (<= 16 (select |#length| |ldv_kobject_create_#t~ret17.base|)) (= 0 |ldv_kobject_create_#t~ret17.offset|)), 786#(and (= ldv_kobject_create_~kobj~1.offset 0) (<= 16 (select |#length| ldv_kobject_create_~kobj~1.base))), 780#true, 781#false, 782#(and (or (< 0 (+ (div ldv_malloc_~size 4294967296) 1)) (<= |ldv_malloc_#in~size| ldv_malloc_~size)) (or (<= (+ (div ldv_malloc_~size 4294967296) 1) 0) (and (<= ldv_malloc_~size |ldv_malloc_#in~size|) (or (< 0 (div ldv_malloc_~size 4294967296)) (<= |ldv_malloc_#in~size| ldv_malloc_~size))))), 783#(and (= 0 |ldv_malloc_#t~malloc4.offset|) (or (<= (+ |ldv_malloc_#in~size| 1) 0) (<= |ldv_malloc_#in~size| (select |#length| |ldv_malloc_#t~malloc4.base|)) (<= 2147483648 |ldv_malloc_#in~size|)))] [2018-02-02 10:48:30,998 INFO 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:30,998 INFO L409 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-02-02 10:48:30,999 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-02-02 10:48:30,999 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2018-02-02 10:48:30,999 INFO L87 Difference]: Start difference. First operand 151 states and 160 transitions. Second operand 7 states. [2018-02-02 10:48:31,153 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 10:48:31,153 INFO L93 Difference]: Finished difference Result 152 states and 161 transitions. [2018-02-02 10:48:31,153 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-02-02 10:48:31,153 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 19 [2018-02-02 10:48:31,153 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 10:48:31,154 INFO L225 Difference]: With dead ends: 152 [2018-02-02 10:48:31,154 INFO L226 Difference]: Without dead ends: 152 [2018-02-02 10:48:31,155 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:31,155 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 152 states. [2018-02-02 10:48:31,161 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 152 to 150. [2018-02-02 10:48:31,161 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 150 states. [2018-02-02 10:48:31,163 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 150 states to 150 states and 159 transitions. [2018-02-02 10:48:31,163 INFO L78 Accepts]: Start accepts. Automaton has 150 states and 159 transitions. Word has length 19 [2018-02-02 10:48:31,163 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 10:48:31,163 INFO L432 AbstractCegarLoop]: Abstraction has 150 states and 159 transitions. [2018-02-02 10:48:31,163 INFO L433 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-02-02 10:48:31,164 INFO L276 IsEmpty]: Start isEmpty. Operand 150 states and 159 transitions. [2018-02-02 10:48:31,164 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2018-02-02 10:48:31,164 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 10:48:31,165 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:31,165 INFO L371 AbstractCegarLoop]: === Iteration 4 === [ldv_kref_initErr0RequiresViolation, ldv_kref_initErr1RequiresViolation, ldv_kobject_createErr0RequiresViolation, ldv_kobject_createErr1RequiresViolation, ldv_atomic_sub_returnErr1RequiresViolation, ldv_atomic_sub_returnErr0RequiresViolation, ldv_atomic_sub_returnErr3RequiresViolation, ldv_atomic_sub_returnErr2RequiresViolation, ldv_atomic_add_returnErr0RequiresViolation, ldv_atomic_add_returnErr1RequiresViolation, ldv_atomic_add_returnErr2RequiresViolation, ldv_atomic_add_returnErr3RequiresViolation, ldv_kobject_cleanupErr4RequiresViolation, ldv_kobject_cleanupErr2RequiresViolation, ldv_kobject_cleanupErr5RequiresViolation, ldv_kobject_cleanupErr3RequiresViolation, ldv_kobject_cleanupErr0RequiresViolation, ldv_kobject_cleanupErr1RequiresViolation, mainErr0EnsuresViolation, LDV_INIT_LIST_HEADErr1RequiresViolation, LDV_INIT_LIST_HEADErr3RequiresViolation, LDV_INIT_LIST_HEADErr2RequiresViolation, LDV_INIT_LIST_HEADErr0RequiresViolation]=== [2018-02-02 10:48:31,165 INFO L82 PathProgramCache]: Analyzing trace with hash -336004596, now seen corresponding path program 1 times [2018-02-02 10:48:31,166 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 10:48:31,178 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 10:48:31,180 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:31,254 INFO 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:31,254 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-02 10:48:31,255 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2018-02-02 10:48:31,255 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 10:48:31,255 INFO 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:31,255 INFO L182 omatonBuilderFactory]: Interpolants [1093#true, 1094#false, 1095#(and (= 0 |ldv_kobject_create_#res.base|) (= 0 |ldv_kobject_create_#res.offset|)), 1096#(and (= 0 |entry_point_#t~ret20.base|) (= 0 |entry_point_#t~ret20.offset|)), 1097#(and (= 0 entry_point_~kobj~2.base) (= 0 entry_point_~kobj~2.offset)), 1098#(and (= 0 |f_22_get_#in~kobj.offset|) (= 0 |f_22_get_#in~kobj.base|)), 1099#(and (= 0 f_22_get_~kobj.offset) (= 0 f_22_get_~kobj.base)), 1100#(and (= 0 |ldv_kobject_get_#in~kobj.base|) (= 0 |ldv_kobject_get_#in~kobj.offset|)), 1101#(and (= 0 ldv_kobject_get_~kobj.offset) (= ldv_kobject_get_~kobj.base 0))] [2018-02-02 10:48:31,255 INFO 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:31,256 INFO L409 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-02-02 10:48:31,256 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-02-02 10:48:31,256 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2018-02-02 10:48:31,256 INFO L87 Difference]: Start difference. First operand 150 states and 159 transitions. Second operand 9 states. [2018-02-02 10:48:31,304 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 10:48:31,304 INFO L93 Difference]: Finished difference Result 171 states and 182 transitions. [2018-02-02 10:48:31,304 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-02-02 10:48:31,304 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 29 [2018-02-02 10:48:31,304 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 10:48:31,305 INFO L225 Difference]: With dead ends: 171 [2018-02-02 10:48:31,305 INFO L226 Difference]: Without dead ends: 171 [2018-02-02 10:48:31,305 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=23, Invalid=87, Unknown=0, NotChecked=0, Total=110 [2018-02-02 10:48:31,306 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 171 states. [2018-02-02 10:48:31,311 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 171 to 164. [2018-02-02 10:48:31,312 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 164 states. [2018-02-02 10:48:31,313 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 164 states to 164 states and 173 transitions. [2018-02-02 10:48:31,313 INFO L78 Accepts]: Start accepts. Automaton has 164 states and 173 transitions. Word has length 29 [2018-02-02 10:48:31,313 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 10:48:31,314 INFO L432 AbstractCegarLoop]: Abstraction has 164 states and 173 transitions. [2018-02-02 10:48:31,314 INFO L433 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-02-02 10:48:31,314 INFO L276 IsEmpty]: Start isEmpty. Operand 164 states and 173 transitions. [2018-02-02 10:48:31,315 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2018-02-02 10:48:31,315 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 10:48:31,315 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:31,315 INFO L371 AbstractCegarLoop]: === Iteration 5 === [ldv_kref_initErr0RequiresViolation, ldv_kref_initErr1RequiresViolation, ldv_kobject_createErr0RequiresViolation, ldv_kobject_createErr1RequiresViolation, ldv_atomic_sub_returnErr1RequiresViolation, ldv_atomic_sub_returnErr0RequiresViolation, ldv_atomic_sub_returnErr3RequiresViolation, ldv_atomic_sub_returnErr2RequiresViolation, ldv_atomic_add_returnErr0RequiresViolation, ldv_atomic_add_returnErr1RequiresViolation, ldv_atomic_add_returnErr2RequiresViolation, ldv_atomic_add_returnErr3RequiresViolation, ldv_kobject_cleanupErr4RequiresViolation, ldv_kobject_cleanupErr2RequiresViolation, ldv_kobject_cleanupErr5RequiresViolation, ldv_kobject_cleanupErr3RequiresViolation, ldv_kobject_cleanupErr0RequiresViolation, ldv_kobject_cleanupErr1RequiresViolation, mainErr0EnsuresViolation, LDV_INIT_LIST_HEADErr1RequiresViolation, LDV_INIT_LIST_HEADErr3RequiresViolation, LDV_INIT_LIST_HEADErr2RequiresViolation, LDV_INIT_LIST_HEADErr0RequiresViolation]=== [2018-02-02 10:48:31,315 INFO L82 PathProgramCache]: Analyzing trace with hash 610577100, now seen corresponding path program 1 times [2018-02-02 10:48:31,316 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 10:48:31,329 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 10:48:31,330 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:31,405 INFO 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:31,405 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-02 10:48:31,405 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2018-02-02 10:48:31,405 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 10:48:31,406 INFO 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:31,406 INFO L182 omatonBuilderFactory]: Interpolants [1441#true, 1442#false, 1443#(= 1 (select |#valid| |#Ultimate.C_memset_#ptr.base|)), 1444#(= 1 (select |#valid| ldv_kobject_create_~kobj~1.base)), 1445#(= 1 (select |#valid| |ldv_kobject_init_#in~kobj.base|)), 1446#(= 1 (select |#valid| ldv_kobject_init_~kobj.base)), 1447#(= 1 (select |#valid| |ldv_kobject_init_internal_#in~kobj.base|)), 1448#(= 1 (select |#valid| ldv_kobject_init_internal_~kobj.base)), 1449#(= 1 (select |#valid| |ldv_kref_init_#in~kref.base|)), 1450#(= 1 (select |#valid| ldv_kref_init_~kref.base))] [2018-02-02 10:48:31,406 INFO 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:31,406 INFO L409 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-02-02 10:48:31,407 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-02-02 10:48:31,407 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=73, Unknown=0, NotChecked=0, Total=90 [2018-02-02 10:48:31,407 INFO L87 Difference]: Start difference. First operand 164 states and 173 transitions. Second operand 10 states. [2018-02-02 10:48:31,592 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 10:48:31,593 INFO L93 Difference]: Finished difference Result 163 states and 172 transitions. [2018-02-02 10:48:31,593 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-02-02 10:48:31,593 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 34 [2018-02-02 10:48:31,593 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 10:48:31,594 INFO L225 Difference]: With dead ends: 163 [2018-02-02 10:48:31,594 INFO L226 Difference]: Without dead ends: 163 [2018-02-02 10:48:31,594 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:31,595 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 163 states. [2018-02-02 10:48:31,601 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 163 to 163. [2018-02-02 10:48:31,602 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 163 states. [2018-02-02 10:48:31,602 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 163 states to 163 states and 172 transitions. [2018-02-02 10:48:31,603 INFO L78 Accepts]: Start accepts. Automaton has 163 states and 172 transitions. Word has length 34 [2018-02-02 10:48:31,604 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 10:48:31,604 INFO L432 AbstractCegarLoop]: Abstraction has 163 states and 172 transitions. [2018-02-02 10:48:31,604 INFO L433 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-02-02 10:48:31,604 INFO L276 IsEmpty]: Start isEmpty. Operand 163 states and 172 transitions. [2018-02-02 10:48:31,605 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2018-02-02 10:48:31,605 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 10:48:31,605 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:31,605 INFO L371 AbstractCegarLoop]: === Iteration 6 === [ldv_kref_initErr0RequiresViolation, ldv_kref_initErr1RequiresViolation, ldv_kobject_createErr0RequiresViolation, ldv_kobject_createErr1RequiresViolation, ldv_atomic_sub_returnErr1RequiresViolation, ldv_atomic_sub_returnErr0RequiresViolation, ldv_atomic_sub_returnErr3RequiresViolation, ldv_atomic_sub_returnErr2RequiresViolation, ldv_atomic_add_returnErr0RequiresViolation, ldv_atomic_add_returnErr1RequiresViolation, ldv_atomic_add_returnErr2RequiresViolation, ldv_atomic_add_returnErr3RequiresViolation, ldv_kobject_cleanupErr4RequiresViolation, ldv_kobject_cleanupErr2RequiresViolation, ldv_kobject_cleanupErr5RequiresViolation, ldv_kobject_cleanupErr3RequiresViolation, ldv_kobject_cleanupErr0RequiresViolation, ldv_kobject_cleanupErr1RequiresViolation, mainErr0EnsuresViolation, LDV_INIT_LIST_HEADErr1RequiresViolation, LDV_INIT_LIST_HEADErr3RequiresViolation, LDV_INIT_LIST_HEADErr2RequiresViolation, LDV_INIT_LIST_HEADErr0RequiresViolation]=== [2018-02-02 10:48:31,605 INFO L82 PathProgramCache]: Analyzing trace with hash 610577101, now seen corresponding path program 1 times [2018-02-02 10:48:31,606 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 10:48:31,620 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 10:48:31,620 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:31,690 INFO 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:31,690 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-02 10:48:31,690 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-02-02 10:48:31,690 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 10:48:31,691 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 10:48:31,691 INFO L182 omatonBuilderFactory]: Interpolants [1783#true, 1784#false, 1785#(= |#Ultimate.C_memset_#t~loopctr21| 0), 1786#(<= |#Ultimate.C_memset_#amount| 0)] [2018-02-02 10:48:31,691 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 10:48:31,691 INFO L409 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-02-02 10:48:31,691 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-02-02 10:48:31,691 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-02-02 10:48:31,692 INFO L87 Difference]: Start difference. First operand 163 states and 172 transitions. Second operand 4 states. [2018-02-02 10:48:31,703 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 10:48:31,703 INFO L93 Difference]: Finished difference Result 166 states and 175 transitions. [2018-02-02 10:48:31,704 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-02-02 10:48:31,704 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 34 [2018-02-02 10:48:31,704 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 10:48:31,705 INFO L225 Difference]: With dead ends: 166 [2018-02-02 10:48:31,705 INFO L226 Difference]: Without dead ends: 164 [2018-02-02 10:48:31,705 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:31,705 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 164 states. [2018-02-02 10:48:31,709 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 164 to 164. [2018-02-02 10:48:31,710 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 164 states. [2018-02-02 10:48:31,710 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 164 states to 164 states and 173 transitions. [2018-02-02 10:48:31,711 INFO L78 Accepts]: Start accepts. Automaton has 164 states and 173 transitions. Word has length 34 [2018-02-02 10:48:31,711 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 10:48:31,711 INFO L432 AbstractCegarLoop]: Abstraction has 164 states and 173 transitions. [2018-02-02 10:48:31,711 INFO L433 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-02-02 10:48:31,711 INFO L276 IsEmpty]: Start isEmpty. Operand 164 states and 173 transitions. [2018-02-02 10:48:31,712 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2018-02-02 10:48:31,712 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 10:48:31,712 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:31,712 INFO L371 AbstractCegarLoop]: === Iteration 7 === [ldv_kref_initErr0RequiresViolation, ldv_kref_initErr1RequiresViolation, ldv_kobject_createErr0RequiresViolation, ldv_kobject_createErr1RequiresViolation, ldv_atomic_sub_returnErr1RequiresViolation, ldv_atomic_sub_returnErr0RequiresViolation, ldv_atomic_sub_returnErr3RequiresViolation, ldv_atomic_sub_returnErr2RequiresViolation, ldv_atomic_add_returnErr0RequiresViolation, ldv_atomic_add_returnErr1RequiresViolation, ldv_atomic_add_returnErr2RequiresViolation, ldv_atomic_add_returnErr3RequiresViolation, ldv_kobject_cleanupErr4RequiresViolation, ldv_kobject_cleanupErr2RequiresViolation, ldv_kobject_cleanupErr5RequiresViolation, ldv_kobject_cleanupErr3RequiresViolation, ldv_kobject_cleanupErr0RequiresViolation, ldv_kobject_cleanupErr1RequiresViolation, mainErr0EnsuresViolation, LDV_INIT_LIST_HEADErr1RequiresViolation, LDV_INIT_LIST_HEADErr3RequiresViolation, LDV_INIT_LIST_HEADErr2RequiresViolation, LDV_INIT_LIST_HEADErr0RequiresViolation]=== [2018-02-02 10:48:31,712 INFO L82 PathProgramCache]: Analyzing trace with hash -838244594, now seen corresponding path program 1 times [2018-02-02 10:48:31,713 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 10:48:31,724 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 10:48:31,725 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:31,748 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:31,749 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-02 10:48:31,749 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5] total 5 [2018-02-02 10:48:31,749 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 10:48:31,749 INFO 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:31,749 INFO L182 omatonBuilderFactory]: Interpolants [2119#true, 2120#false, 2121#(= |#Ultimate.C_memset_#t~loopctr21| 0), 2122#(<= |#Ultimate.C_memset_#t~loopctr21| 1), 2123#(<= |#Ultimate.C_memset_#amount| 1)] [2018-02-02 10:48:31,749 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:31,749 INFO L409 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-02-02 10:48:31,750 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-02-02 10:48:31,750 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2018-02-02 10:48:31,750 INFO L87 Difference]: Start difference. First operand 164 states and 173 transitions. Second operand 5 states. [2018-02-02 10:48:31,763 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 10:48:31,764 INFO L93 Difference]: Finished difference Result 167 states and 176 transitions. [2018-02-02 10:48:31,764 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-02-02 10:48:31,764 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 35 [2018-02-02 10:48:31,764 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 10:48:31,765 INFO L225 Difference]: With dead ends: 167 [2018-02-02 10:48:31,765 INFO L226 Difference]: Without dead ends: 165 [2018-02-02 10:48:31,765 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:31,765 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 165 states. [2018-02-02 10:48:31,768 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 165 to 165. [2018-02-02 10:48:31,768 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 165 states. [2018-02-02 10:48:31,769 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 165 states to 165 states and 174 transitions. [2018-02-02 10:48:31,769 INFO L78 Accepts]: Start accepts. Automaton has 165 states and 174 transitions. Word has length 35 [2018-02-02 10:48:31,769 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 10:48:31,769 INFO L432 AbstractCegarLoop]: Abstraction has 165 states and 174 transitions. [2018-02-02 10:48:31,769 INFO L433 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-02-02 10:48:31,769 INFO L276 IsEmpty]: Start isEmpty. Operand 165 states and 174 transitions. [2018-02-02 10:48:31,770 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2018-02-02 10:48:31,770 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 10:48:31,770 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:31,770 INFO L371 AbstractCegarLoop]: === Iteration 8 === [ldv_kref_initErr0RequiresViolation, ldv_kref_initErr1RequiresViolation, ldv_kobject_createErr0RequiresViolation, ldv_kobject_createErr1RequiresViolation, ldv_atomic_sub_returnErr1RequiresViolation, ldv_atomic_sub_returnErr0RequiresViolation, ldv_atomic_sub_returnErr3RequiresViolation, ldv_atomic_sub_returnErr2RequiresViolation, ldv_atomic_add_returnErr0RequiresViolation, ldv_atomic_add_returnErr1RequiresViolation, ldv_atomic_add_returnErr2RequiresViolation, ldv_atomic_add_returnErr3RequiresViolation, ldv_kobject_cleanupErr4RequiresViolation, ldv_kobject_cleanupErr2RequiresViolation, ldv_kobject_cleanupErr5RequiresViolation, ldv_kobject_cleanupErr3RequiresViolation, ldv_kobject_cleanupErr0RequiresViolation, ldv_kobject_cleanupErr1RequiresViolation, mainErr0EnsuresViolation, LDV_INIT_LIST_HEADErr1RequiresViolation, LDV_INIT_LIST_HEADErr3RequiresViolation, LDV_INIT_LIST_HEADErr2RequiresViolation, LDV_INIT_LIST_HEADErr0RequiresViolation]=== [2018-02-02 10:48:31,771 INFO L82 PathProgramCache]: Analyzing trace with hash 1492923117, now seen corresponding path program 2 times [2018-02-02 10:48:31,771 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 10:48:31,782 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 10:48:31,783 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:31,808 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:31,808 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-02 10:48:31,809 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6] total 6 [2018-02-02 10:48:31,809 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 10:48:31,809 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 10:48:31,809 INFO L182 omatonBuilderFactory]: Interpolants [2458#true, 2459#false, 2460#(= |#Ultimate.C_memset_#t~loopctr21| 0), 2461#(<= |#Ultimate.C_memset_#t~loopctr21| 1), 2462#(<= |#Ultimate.C_memset_#t~loopctr21| 2), 2463#(<= |#Ultimate.C_memset_#amount| 2)] [2018-02-02 10:48:31,809 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:31,809 INFO L409 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-02-02 10:48:31,809 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-02-02 10:48:31,810 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2018-02-02 10:48:31,810 INFO L87 Difference]: Start difference. First operand 165 states and 174 transitions. Second operand 6 states. [2018-02-02 10:48:31,824 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 10:48:31,824 INFO L93 Difference]: Finished difference Result 168 states and 177 transitions. [2018-02-02 10:48:31,824 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-02-02 10:48:31,825 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 36 [2018-02-02 10:48:31,825 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 10:48:31,826 INFO L225 Difference]: With dead ends: 168 [2018-02-02 10:48:31,826 INFO L226 Difference]: Without dead ends: 166 [2018-02-02 10:48:31,826 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:31,826 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 166 states. [2018-02-02 10:48:31,829 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 166 to 166. [2018-02-02 10:48:31,829 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 166 states. [2018-02-02 10:48:31,830 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 166 states to 166 states and 175 transitions. [2018-02-02 10:48:31,832 INFO L78 Accepts]: Start accepts. Automaton has 166 states and 175 transitions. Word has length 36 [2018-02-02 10:48:31,832 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 10:48:31,832 INFO L432 AbstractCegarLoop]: Abstraction has 166 states and 175 transitions. [2018-02-02 10:48:31,832 INFO L433 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-02-02 10:48:31,832 INFO L276 IsEmpty]: Start isEmpty. Operand 166 states and 175 transitions. [2018-02-02 10:48:31,833 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2018-02-02 10:48:31,833 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 10:48:31,834 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:31,834 INFO L371 AbstractCegarLoop]: === Iteration 9 === [ldv_kref_initErr0RequiresViolation, ldv_kref_initErr1RequiresViolation, ldv_kobject_createErr0RequiresViolation, ldv_kobject_createErr1RequiresViolation, ldv_atomic_sub_returnErr1RequiresViolation, ldv_atomic_sub_returnErr0RequiresViolation, ldv_atomic_sub_returnErr3RequiresViolation, ldv_atomic_sub_returnErr2RequiresViolation, ldv_atomic_add_returnErr0RequiresViolation, ldv_atomic_add_returnErr1RequiresViolation, ldv_atomic_add_returnErr2RequiresViolation, ldv_atomic_add_returnErr3RequiresViolation, ldv_kobject_cleanupErr4RequiresViolation, ldv_kobject_cleanupErr2RequiresViolation, ldv_kobject_cleanupErr5RequiresViolation, ldv_kobject_cleanupErr3RequiresViolation, ldv_kobject_cleanupErr0RequiresViolation, ldv_kobject_cleanupErr1RequiresViolation, mainErr0EnsuresViolation, LDV_INIT_LIST_HEADErr1RequiresViolation, LDV_INIT_LIST_HEADErr3RequiresViolation, LDV_INIT_LIST_HEADErr2RequiresViolation, LDV_INIT_LIST_HEADErr0RequiresViolation]=== [2018-02-02 10:48:31,834 INFO L82 PathProgramCache]: Analyzing trace with hash 744678126, now seen corresponding path program 3 times [2018-02-02 10:48:31,835 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 10:48:31,856 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 10:48:31,858 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:31,911 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:31,912 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-02 10:48:31,912 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7] total 7 [2018-02-02 10:48:31,912 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 10:48:31,912 INFO 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:31,912 INFO L182 omatonBuilderFactory]: Interpolants [2800#true, 2801#false, 2802#(= |#Ultimate.C_memset_#t~loopctr21| 0), 2803#(<= |#Ultimate.C_memset_#t~loopctr21| 1), 2804#(<= |#Ultimate.C_memset_#t~loopctr21| 2), 2805#(<= |#Ultimate.C_memset_#t~loopctr21| 3), 2806#(<= |#Ultimate.C_memset_#amount| 3)] [2018-02-02 10:48:31,912 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:31,913 INFO L409 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-02-02 10:48:31,913 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-02-02 10:48:31,913 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2018-02-02 10:48:31,913 INFO L87 Difference]: Start difference. First operand 166 states and 175 transitions. Second operand 7 states. [2018-02-02 10:48:31,955 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 10:48:31,955 INFO L93 Difference]: Finished difference Result 169 states and 178 transitions. [2018-02-02 10:48:31,956 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-02-02 10:48:31,956 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 37 [2018-02-02 10:48:31,956 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 10:48:31,957 INFO L225 Difference]: With dead ends: 169 [2018-02-02 10:48:31,957 INFO L226 Difference]: Without dead ends: 167 [2018-02-02 10:48:31,957 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:31,957 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 167 states. [2018-02-02 10:48:31,961 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 167 to 167. [2018-02-02 10:48:31,961 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 167 states. [2018-02-02 10:48:31,962 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 167 states to 167 states and 176 transitions. [2018-02-02 10:48:31,962 INFO L78 Accepts]: Start accepts. Automaton has 167 states and 176 transitions. Word has length 37 [2018-02-02 10:48:31,962 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 10:48:31,962 INFO L432 AbstractCegarLoop]: Abstraction has 167 states and 176 transitions. [2018-02-02 10:48:31,962 INFO L433 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-02-02 10:48:31,962 INFO L276 IsEmpty]: Start isEmpty. Operand 167 states and 176 transitions. [2018-02-02 10:48:31,965 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2018-02-02 10:48:31,965 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 10:48:31,966 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:31,966 INFO L371 AbstractCegarLoop]: === Iteration 10 === [ldv_kref_initErr0RequiresViolation, ldv_kref_initErr1RequiresViolation, ldv_kobject_createErr0RequiresViolation, ldv_kobject_createErr1RequiresViolation, ldv_atomic_sub_returnErr1RequiresViolation, ldv_atomic_sub_returnErr0RequiresViolation, ldv_atomic_sub_returnErr3RequiresViolation, ldv_atomic_sub_returnErr2RequiresViolation, ldv_atomic_add_returnErr0RequiresViolation, ldv_atomic_add_returnErr1RequiresViolation, ldv_atomic_add_returnErr2RequiresViolation, ldv_atomic_add_returnErr3RequiresViolation, ldv_kobject_cleanupErr4RequiresViolation, ldv_kobject_cleanupErr2RequiresViolation, ldv_kobject_cleanupErr5RequiresViolation, ldv_kobject_cleanupErr3RequiresViolation, ldv_kobject_cleanupErr0RequiresViolation, ldv_kobject_cleanupErr1RequiresViolation, mainErr0EnsuresViolation, LDV_INIT_LIST_HEADErr1RequiresViolation, LDV_INIT_LIST_HEADErr3RequiresViolation, LDV_INIT_LIST_HEADErr2RequiresViolation, LDV_INIT_LIST_HEADErr0RequiresViolation]=== [2018-02-02 10:48:31,966 INFO L82 PathProgramCache]: Analyzing trace with hash -976080115, now seen corresponding path program 4 times [2018-02-02 10:48:31,967 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 10:48:31,982 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 10:48:31,983 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:32,024 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:32,025 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-02 10:48:32,025 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8] total 8 [2018-02-02 10:48:32,025 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 10:48:32,026 INFO 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:32,026 INFO L182 omatonBuilderFactory]: Interpolants [3152#(<= |#Ultimate.C_memset_#amount| 4), 3145#true, 3146#false, 3147#(= |#Ultimate.C_memset_#t~loopctr21| 0), 3148#(<= |#Ultimate.C_memset_#t~loopctr21| 1), 3149#(<= |#Ultimate.C_memset_#t~loopctr21| 2), 3150#(<= |#Ultimate.C_memset_#t~loopctr21| 3), 3151#(<= |#Ultimate.C_memset_#t~loopctr21| 4)] [2018-02-02 10:48:32,026 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:32,026 INFO L409 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-02-02 10:48:32,026 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-02-02 10:48:32,027 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2018-02-02 10:48:32,027 INFO L87 Difference]: Start difference. First operand 167 states and 176 transitions. Second operand 8 states. [2018-02-02 10:48:32,057 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 10:48:32,057 INFO L93 Difference]: Finished difference Result 170 states and 179 transitions. [2018-02-02 10:48:32,057 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-02-02 10:48:32,057 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 38 [2018-02-02 10:48:32,058 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 10:48:32,058 INFO L225 Difference]: With dead ends: 170 [2018-02-02 10:48:32,059 INFO L226 Difference]: Without dead ends: 168 [2018-02-02 10:48:32,059 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:32,059 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 168 states. [2018-02-02 10:48:32,062 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 168 to 168. [2018-02-02 10:48:32,063 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 168 states. [2018-02-02 10:48:32,063 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 168 states to 168 states and 177 transitions. [2018-02-02 10:48:32,064 INFO L78 Accepts]: Start accepts. Automaton has 168 states and 177 transitions. Word has length 38 [2018-02-02 10:48:32,064 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 10:48:32,064 INFO L432 AbstractCegarLoop]: Abstraction has 168 states and 177 transitions. [2018-02-02 10:48:32,064 INFO L433 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-02-02 10:48:32,064 INFO L276 IsEmpty]: Start isEmpty. Operand 168 states and 177 transitions. [2018-02-02 10:48:32,065 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2018-02-02 10:48:32,065 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 10:48:32,065 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:32,065 INFO L371 AbstractCegarLoop]: === Iteration 11 === [ldv_kref_initErr0RequiresViolation, ldv_kref_initErr1RequiresViolation, ldv_kobject_createErr0RequiresViolation, ldv_kobject_createErr1RequiresViolation, ldv_atomic_sub_returnErr1RequiresViolation, ldv_atomic_sub_returnErr0RequiresViolation, ldv_atomic_sub_returnErr3RequiresViolation, ldv_atomic_sub_returnErr2RequiresViolation, ldv_atomic_add_returnErr0RequiresViolation, ldv_atomic_add_returnErr1RequiresViolation, ldv_atomic_add_returnErr2RequiresViolation, ldv_atomic_add_returnErr3RequiresViolation, ldv_kobject_cleanupErr4RequiresViolation, ldv_kobject_cleanupErr2RequiresViolation, ldv_kobject_cleanupErr5RequiresViolation, ldv_kobject_cleanupErr3RequiresViolation, ldv_kobject_cleanupErr0RequiresViolation, ldv_kobject_cleanupErr1RequiresViolation, mainErr0EnsuresViolation, LDV_INIT_LIST_HEADErr1RequiresViolation, LDV_INIT_LIST_HEADErr3RequiresViolation, LDV_INIT_LIST_HEADErr2RequiresViolation, LDV_INIT_LIST_HEADErr0RequiresViolation]=== [2018-02-02 10:48:32,065 INFO L82 PathProgramCache]: Analyzing trace with hash 1514989262, now seen corresponding path program 5 times [2018-02-02 10:48:32,066 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 10:48:32,078 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 10:48:32,079 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:32,126 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:32,127 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-02 10:48:32,127 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9] total 9 [2018-02-02 10:48:32,127 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 10:48:32,128 INFO 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:32,128 INFO L182 omatonBuilderFactory]: Interpolants [3493#true, 3494#false, 3495#(= |#Ultimate.C_memset_#t~loopctr21| 0), 3496#(<= |#Ultimate.C_memset_#t~loopctr21| 1), 3497#(<= |#Ultimate.C_memset_#t~loopctr21| 2), 3498#(<= |#Ultimate.C_memset_#t~loopctr21| 3), 3499#(<= |#Ultimate.C_memset_#t~loopctr21| 4), 3500#(<= |#Ultimate.C_memset_#t~loopctr21| 5), 3501#(<= |#Ultimate.C_memset_#amount| 5)] [2018-02-02 10:48:32,128 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:32,128 INFO L409 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-02-02 10:48:32,128 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-02-02 10:48:32,129 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2018-02-02 10:48:32,129 INFO L87 Difference]: Start difference. First operand 168 states and 177 transitions. Second operand 9 states. [2018-02-02 10:48:32,151 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 10:48:32,151 INFO L93 Difference]: Finished difference Result 171 states and 180 transitions. [2018-02-02 10:48:32,151 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-02-02 10:48:32,151 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 39 [2018-02-02 10:48:32,152 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 10:48:32,152 INFO L225 Difference]: With dead ends: 171 [2018-02-02 10:48:32,153 INFO L226 Difference]: Without dead ends: 169 [2018-02-02 10:48:32,153 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:32,153 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 169 states. [2018-02-02 10:48:32,157 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 169 to 169. [2018-02-02 10:48:32,157 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 169 states. [2018-02-02 10:48:32,158 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 169 states to 169 states and 178 transitions. [2018-02-02 10:48:32,158 INFO L78 Accepts]: Start accepts. Automaton has 169 states and 178 transitions. Word has length 39 [2018-02-02 10:48:32,158 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 10:48:32,158 INFO L432 AbstractCegarLoop]: Abstraction has 169 states and 178 transitions. [2018-02-02 10:48:32,158 INFO L433 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-02-02 10:48:32,159 INFO L276 IsEmpty]: Start isEmpty. Operand 169 states and 178 transitions. [2018-02-02 10:48:32,159 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2018-02-02 10:48:32,159 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 10:48:32,159 INFO L351 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-02 10:48:32,159 INFO L371 AbstractCegarLoop]: === Iteration 12 === [ldv_kref_initErr0RequiresViolation, ldv_kref_initErr1RequiresViolation, ldv_kobject_createErr0RequiresViolation, ldv_kobject_createErr1RequiresViolation, ldv_atomic_sub_returnErr1RequiresViolation, ldv_atomic_sub_returnErr0RequiresViolation, ldv_atomic_sub_returnErr3RequiresViolation, ldv_atomic_sub_returnErr2RequiresViolation, ldv_atomic_add_returnErr0RequiresViolation, ldv_atomic_add_returnErr1RequiresViolation, ldv_atomic_add_returnErr2RequiresViolation, ldv_atomic_add_returnErr3RequiresViolation, ldv_kobject_cleanupErr4RequiresViolation, ldv_kobject_cleanupErr2RequiresViolation, ldv_kobject_cleanupErr5RequiresViolation, ldv_kobject_cleanupErr3RequiresViolation, ldv_kobject_cleanupErr0RequiresViolation, ldv_kobject_cleanupErr1RequiresViolation, mainErr0EnsuresViolation, LDV_INIT_LIST_HEADErr1RequiresViolation, LDV_INIT_LIST_HEADErr3RequiresViolation, LDV_INIT_LIST_HEADErr2RequiresViolation, LDV_INIT_LIST_HEADErr0RequiresViolation]=== [2018-02-02 10:48:32,160 INFO L82 PathProgramCache]: Analyzing trace with hash 278126369, now seen corresponding path program 1 times [2018-02-02 10:48:32,161 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 10:48:32,169 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 10:48:32,170 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:32,264 INFO 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:32,265 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-02 10:48:32,265 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2018-02-02 10:48:32,265 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 10:48:32,265 INFO 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:32,265 INFO L182 omatonBuilderFactory]: Interpolants [3844#true, 3845#false, 3846#(and (= 0 |ldv_kobject_create_#res.base|) (= 0 |ldv_kobject_create_#res.offset|)), 3847#(and (= 0 |entry_point_#t~ret20.base|) (= 0 |entry_point_#t~ret20.offset|)), 3848#(and (= 0 entry_point_~kobj~2.base) (= 0 entry_point_~kobj~2.offset)), 3849#(and (= 0 |f_22_put_#in~kobj.offset|) (= 0 |f_22_put_#in~kobj.base|)), 3850#(and (= 0 f_22_put_~kobj.base) (= 0 f_22_put_~kobj.offset)), 3851#(and (= 0 |ldv_kobject_put_#in~kobj.offset|) (= 0 |ldv_kobject_put_#in~kobj.base|)), 3852#(and (= ldv_kobject_put_~kobj.offset 0) (= 0 ldv_kobject_put_~kobj.base))] [2018-02-02 10:48:32,266 INFO 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:32,266 INFO L409 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-02-02 10:48:32,266 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-02-02 10:48:32,266 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2018-02-02 10:48:32,266 INFO L87 Difference]: Start difference. First operand 169 states and 178 transitions. Second operand 9 states. [2018-02-02 10:48:32,325 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 10:48:32,325 INFO L93 Difference]: Finished difference Result 183 states and 194 transitions. [2018-02-02 10:48:32,325 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-02-02 10:48:32,325 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 42 [2018-02-02 10:48:32,325 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 10:48:32,327 INFO L225 Difference]: With dead ends: 183 [2018-02-02 10:48:32,327 INFO L226 Difference]: Without dead ends: 183 [2018-02-02 10:48:32,327 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=23, Invalid=87, Unknown=0, NotChecked=0, Total=110 [2018-02-02 10:48:32,327 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 183 states. [2018-02-02 10:48:32,330 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 183 to 179. [2018-02-02 10:48:32,330 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 179 states. [2018-02-02 10:48:32,331 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 179 states to 179 states and 189 transitions. [2018-02-02 10:48:32,331 INFO L78 Accepts]: Start accepts. Automaton has 179 states and 189 transitions. Word has length 42 [2018-02-02 10:48:32,331 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 10:48:32,331 INFO L432 AbstractCegarLoop]: Abstraction has 179 states and 189 transitions. [2018-02-02 10:48:32,331 INFO L433 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-02-02 10:48:32,331 INFO L276 IsEmpty]: Start isEmpty. Operand 179 states and 189 transitions. [2018-02-02 10:48:32,331 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2018-02-02 10:48:32,332 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 10:48:32,332 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:32,335 INFO L371 AbstractCegarLoop]: === Iteration 13 === [ldv_kref_initErr0RequiresViolation, ldv_kref_initErr1RequiresViolation, ldv_kobject_createErr0RequiresViolation, ldv_kobject_createErr1RequiresViolation, ldv_atomic_sub_returnErr1RequiresViolation, ldv_atomic_sub_returnErr0RequiresViolation, ldv_atomic_sub_returnErr3RequiresViolation, ldv_atomic_sub_returnErr2RequiresViolation, ldv_atomic_add_returnErr0RequiresViolation, ldv_atomic_add_returnErr1RequiresViolation, ldv_atomic_add_returnErr2RequiresViolation, ldv_atomic_add_returnErr3RequiresViolation, ldv_kobject_cleanupErr4RequiresViolation, ldv_kobject_cleanupErr2RequiresViolation, ldv_kobject_cleanupErr5RequiresViolation, ldv_kobject_cleanupErr3RequiresViolation, ldv_kobject_cleanupErr0RequiresViolation, ldv_kobject_cleanupErr1RequiresViolation, mainErr0EnsuresViolation, LDV_INIT_LIST_HEADErr1RequiresViolation, LDV_INIT_LIST_HEADErr3RequiresViolation, LDV_INIT_LIST_HEADErr2RequiresViolation, LDV_INIT_LIST_HEADErr0RequiresViolation]=== [2018-02-02 10:48:32,335 INFO L82 PathProgramCache]: Analyzing trace with hash 1428728621, now seen corresponding path program 6 times [2018-02-02 10:48:32,336 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 10:48:32,345 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 10:48:32,357 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:32,402 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:32,402 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-02 10:48:32,402 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10] total 10 [2018-02-02 10:48:32,403 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 10:48:32,403 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 10:48:32,403 INFO L182 omatonBuilderFactory]: Interpolants [4224#(<= |#Ultimate.C_memset_#t~loopctr21| 3), 4225#(<= |#Ultimate.C_memset_#t~loopctr21| 4), 4226#(<= |#Ultimate.C_memset_#t~loopctr21| 5), 4227#(<= |#Ultimate.C_memset_#t~loopctr21| 6), 4228#(<= |#Ultimate.C_memset_#amount| 6), 4219#true, 4220#false, 4221#(= |#Ultimate.C_memset_#t~loopctr21| 0), 4222#(<= |#Ultimate.C_memset_#t~loopctr21| 1), 4223#(<= |#Ultimate.C_memset_#t~loopctr21| 2)] [2018-02-02 10:48:32,403 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:32,403 INFO L409 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-02-02 10:48:32,403 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-02-02 10:48:32,403 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2018-02-02 10:48:32,404 INFO L87 Difference]: Start difference. First operand 179 states and 189 transitions. Second operand 10 states. [2018-02-02 10:48:32,426 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 10:48:32,426 INFO L93 Difference]: Finished difference Result 182 states and 192 transitions. [2018-02-02 10:48:32,428 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-02-02 10:48:32,428 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 40 [2018-02-02 10:48:32,428 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 10:48:32,429 INFO L225 Difference]: With dead ends: 182 [2018-02-02 10:48:32,429 INFO L226 Difference]: Without dead ends: 180 [2018-02-02 10:48:32,429 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:32,430 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 180 states. [2018-02-02 10:48:32,432 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 180 to 180. [2018-02-02 10:48:32,433 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 180 states. [2018-02-02 10:48:32,434 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 180 states to 180 states and 190 transitions. [2018-02-02 10:48:32,434 INFO L78 Accepts]: Start accepts. Automaton has 180 states and 190 transitions. Word has length 40 [2018-02-02 10:48:32,434 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 10:48:32,434 INFO L432 AbstractCegarLoop]: Abstraction has 180 states and 190 transitions. [2018-02-02 10:48:32,434 INFO L433 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-02-02 10:48:32,434 INFO L276 IsEmpty]: Start isEmpty. Operand 180 states and 190 transitions. [2018-02-02 10:48:32,440 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2018-02-02 10:48:32,440 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 10:48:32,440 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:32,440 INFO L371 AbstractCegarLoop]: === Iteration 14 === [ldv_kref_initErr0RequiresViolation, ldv_kref_initErr1RequiresViolation, ldv_kobject_createErr0RequiresViolation, ldv_kobject_createErr1RequiresViolation, ldv_atomic_sub_returnErr1RequiresViolation, ldv_atomic_sub_returnErr0RequiresViolation, ldv_atomic_sub_returnErr3RequiresViolation, ldv_atomic_sub_returnErr2RequiresViolation, ldv_atomic_add_returnErr0RequiresViolation, ldv_atomic_add_returnErr1RequiresViolation, ldv_atomic_add_returnErr2RequiresViolation, ldv_atomic_add_returnErr3RequiresViolation, ldv_kobject_cleanupErr4RequiresViolation, ldv_kobject_cleanupErr2RequiresViolation, ldv_kobject_cleanupErr5RequiresViolation, ldv_kobject_cleanupErr3RequiresViolation, ldv_kobject_cleanupErr0RequiresViolation, ldv_kobject_cleanupErr1RequiresViolation, mainErr0EnsuresViolation, LDV_INIT_LIST_HEADErr1RequiresViolation, LDV_INIT_LIST_HEADErr3RequiresViolation, LDV_INIT_LIST_HEADErr2RequiresViolation, LDV_INIT_LIST_HEADErr0RequiresViolation]=== [2018-02-02 10:48:32,440 INFO L82 PathProgramCache]: Analyzing trace with hash -1245351250, now seen corresponding path program 7 times [2018-02-02 10:48:32,441 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 10:48:32,454 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 10:48:32,460 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:32,548 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:32,548 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-02 10:48:32,549 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [11] total 11 [2018-02-02 10:48:32,549 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 10:48:32,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:32,549 INFO L182 omatonBuilderFactory]: Interpolants [4593#true, 4594#false, 4595#(= |#Ultimate.C_memset_#t~loopctr21| 0), 4596#(<= |#Ultimate.C_memset_#t~loopctr21| 1), 4597#(<= |#Ultimate.C_memset_#t~loopctr21| 2), 4598#(<= |#Ultimate.C_memset_#t~loopctr21| 3), 4599#(<= |#Ultimate.C_memset_#t~loopctr21| 4), 4600#(<= |#Ultimate.C_memset_#t~loopctr21| 5), 4601#(<= |#Ultimate.C_memset_#t~loopctr21| 6), 4602#(<= |#Ultimate.C_memset_#t~loopctr21| 7), 4603#(<= |#Ultimate.C_memset_#amount| 7)] [2018-02-02 10:48:32,549 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:32,549 INFO L409 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-02-02 10:48:32,549 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-02-02 10:48:32,549 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=63, Unknown=0, NotChecked=0, Total=110 [2018-02-02 10:48:32,550 INFO L87 Difference]: Start difference. First operand 180 states and 190 transitions. Second operand 11 states. [2018-02-02 10:48:32,571 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 10:48:32,571 INFO L93 Difference]: Finished difference Result 183 states and 193 transitions. [2018-02-02 10:48:32,571 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-02-02 10:48:32,571 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 41 [2018-02-02 10:48:32,571 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 10:48:32,572 INFO L225 Difference]: With dead ends: 183 [2018-02-02 10:48:32,572 INFO L226 Difference]: Without dead ends: 181 [2018-02-02 10:48:32,573 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:32,573 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 181 states. [2018-02-02 10:48:32,576 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 181 to 181. [2018-02-02 10:48:32,576 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 181 states. [2018-02-02 10:48:32,577 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 181 states to 181 states and 191 transitions. [2018-02-02 10:48:32,577 INFO L78 Accepts]: Start accepts. Automaton has 181 states and 191 transitions. Word has length 41 [2018-02-02 10:48:32,577 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 10:48:32,577 INFO L432 AbstractCegarLoop]: Abstraction has 181 states and 191 transitions. [2018-02-02 10:48:32,577 INFO L433 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-02-02 10:48:32,577 INFO L276 IsEmpty]: Start isEmpty. Operand 181 states and 191 transitions. [2018-02-02 10:48:32,578 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2018-02-02 10:48:32,578 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 10:48:32,578 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:32,578 INFO L371 AbstractCegarLoop]: === Iteration 15 === [ldv_kref_initErr0RequiresViolation, ldv_kref_initErr1RequiresViolation, ldv_kobject_createErr0RequiresViolation, ldv_kobject_createErr1RequiresViolation, ldv_atomic_sub_returnErr1RequiresViolation, ldv_atomic_sub_returnErr0RequiresViolation, ldv_atomic_sub_returnErr3RequiresViolation, ldv_atomic_sub_returnErr2RequiresViolation, ldv_atomic_add_returnErr0RequiresViolation, ldv_atomic_add_returnErr1RequiresViolation, ldv_atomic_add_returnErr2RequiresViolation, ldv_atomic_add_returnErr3RequiresViolation, ldv_kobject_cleanupErr4RequiresViolation, ldv_kobject_cleanupErr2RequiresViolation, ldv_kobject_cleanupErr5RequiresViolation, ldv_kobject_cleanupErr3RequiresViolation, ldv_kobject_cleanupErr0RequiresViolation, ldv_kobject_cleanupErr1RequiresViolation, mainErr0EnsuresViolation, LDV_INIT_LIST_HEADErr1RequiresViolation, LDV_INIT_LIST_HEADErr3RequiresViolation, LDV_INIT_LIST_HEADErr2RequiresViolation, LDV_INIT_LIST_HEADErr0RequiresViolation]=== [2018-02-02 10:48:32,578 INFO L82 PathProgramCache]: Analyzing trace with hash 1757518669, now seen corresponding path program 8 times [2018-02-02 10:48:32,579 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 10:48:32,590 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 10:48:32,591 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:32,680 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:32,680 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-02 10:48:32,680 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [12] total 12 [2018-02-02 10:48:32,680 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 10:48:32,680 INFO 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:32,681 INFO L182 omatonBuilderFactory]: Interpolants [4976#(<= |#Ultimate.C_memset_#t~loopctr21| 4), 4977#(<= |#Ultimate.C_memset_#t~loopctr21| 5), 4978#(<= |#Ultimate.C_memset_#t~loopctr21| 6), 4979#(<= |#Ultimate.C_memset_#t~loopctr21| 7), 4980#(<= |#Ultimate.C_memset_#t~loopctr21| 8), 4981#(<= |#Ultimate.C_memset_#amount| 8), 4970#true, 4971#false, 4972#(= |#Ultimate.C_memset_#t~loopctr21| 0), 4973#(<= |#Ultimate.C_memset_#t~loopctr21| 1), 4974#(<= |#Ultimate.C_memset_#t~loopctr21| 2), 4975#(<= |#Ultimate.C_memset_#t~loopctr21| 3)] [2018-02-02 10:48:32,681 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:32,681 INFO L409 AbstractCegarLoop]: Interpolant automaton has 12 states [2018-02-02 10:48:32,681 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2018-02-02 10:48:32,681 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=75, Unknown=0, NotChecked=0, Total=132 [2018-02-02 10:48:32,681 INFO L87 Difference]: Start difference. First operand 181 states and 191 transitions. Second operand 12 states. [2018-02-02 10:48:32,702 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 10:48:32,702 INFO L93 Difference]: Finished difference Result 184 states and 194 transitions. [2018-02-02 10:48:32,703 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-02-02 10:48:32,703 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 42 [2018-02-02 10:48:32,703 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 10:48:32,703 INFO L225 Difference]: With dead ends: 184 [2018-02-02 10:48:32,703 INFO L226 Difference]: Without dead ends: 182 [2018-02-02 10:48:32,704 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:32,704 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 182 states. [2018-02-02 10:48:32,706 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 182 to 182. [2018-02-02 10:48:32,706 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 182 states. [2018-02-02 10:48:32,706 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 182 states to 182 states and 192 transitions. [2018-02-02 10:48:32,706 INFO L78 Accepts]: Start accepts. Automaton has 182 states and 192 transitions. Word has length 42 [2018-02-02 10:48:32,706 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 10:48:32,707 INFO L432 AbstractCegarLoop]: Abstraction has 182 states and 192 transitions. [2018-02-02 10:48:32,707 INFO L433 AbstractCegarLoop]: Interpolant automaton has 12 states. [2018-02-02 10:48:32,707 INFO L276 IsEmpty]: Start isEmpty. Operand 182 states and 192 transitions. [2018-02-02 10:48:32,707 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2018-02-02 10:48:32,707 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 10:48:32,707 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:32,707 INFO L371 AbstractCegarLoop]: === Iteration 16 === [ldv_kref_initErr0RequiresViolation, ldv_kref_initErr1RequiresViolation, ldv_kobject_createErr0RequiresViolation, ldv_kobject_createErr1RequiresViolation, ldv_atomic_sub_returnErr1RequiresViolation, ldv_atomic_sub_returnErr0RequiresViolation, ldv_atomic_sub_returnErr3RequiresViolation, ldv_atomic_sub_returnErr2RequiresViolation, ldv_atomic_add_returnErr0RequiresViolation, ldv_atomic_add_returnErr1RequiresViolation, ldv_atomic_add_returnErr2RequiresViolation, ldv_atomic_add_returnErr3RequiresViolation, ldv_kobject_cleanupErr4RequiresViolation, ldv_kobject_cleanupErr2RequiresViolation, ldv_kobject_cleanupErr5RequiresViolation, ldv_kobject_cleanupErr3RequiresViolation, ldv_kobject_cleanupErr0RequiresViolation, ldv_kobject_cleanupErr1RequiresViolation, mainErr0EnsuresViolation, LDV_INIT_LIST_HEADErr1RequiresViolation, LDV_INIT_LIST_HEADErr3RequiresViolation, LDV_INIT_LIST_HEADErr2RequiresViolation, LDV_INIT_LIST_HEADErr0RequiresViolation]=== [2018-02-02 10:48:32,707 INFO L82 PathProgramCache]: Analyzing trace with hash 357205646, now seen corresponding path program 9 times [2018-02-02 10:48:32,708 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 10:48:32,715 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 10:48:32,716 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:32,801 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:32,802 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-02 10:48:32,802 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [13] total 13 [2018-02-02 10:48:32,802 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 10:48:32,802 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 10:48:32,802 INFO L182 omatonBuilderFactory]: Interpolants [5350#true, 5351#false, 5352#(= |#Ultimate.C_memset_#t~loopctr21| 0), 5353#(<= |#Ultimate.C_memset_#t~loopctr21| 1), 5354#(<= |#Ultimate.C_memset_#t~loopctr21| 2), 5355#(<= |#Ultimate.C_memset_#t~loopctr21| 3), 5356#(<= |#Ultimate.C_memset_#t~loopctr21| 4), 5357#(<= |#Ultimate.C_memset_#t~loopctr21| 5), 5358#(<= |#Ultimate.C_memset_#t~loopctr21| 6), 5359#(<= |#Ultimate.C_memset_#t~loopctr21| 7), 5360#(<= |#Ultimate.C_memset_#t~loopctr21| 8), 5361#(<= |#Ultimate.C_memset_#t~loopctr21| 9), 5362#(<= |#Ultimate.C_memset_#amount| 9)] [2018-02-02 10:48:32,802 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:32,803 INFO L409 AbstractCegarLoop]: Interpolant automaton has 13 states [2018-02-02 10:48:32,803 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2018-02-02 10:48:32,803 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=68, Invalid=88, Unknown=0, NotChecked=0, Total=156 [2018-02-02 10:48:32,803 INFO L87 Difference]: Start difference. First operand 182 states and 192 transitions. Second operand 13 states. [2018-02-02 10:48:32,834 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 10:48:32,834 INFO L93 Difference]: Finished difference Result 185 states and 195 transitions. [2018-02-02 10:48:32,834 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2018-02-02 10:48:32,834 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 43 [2018-02-02 10:48:32,835 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 10:48:32,835 INFO L225 Difference]: With dead ends: 185 [2018-02-02 10:48:32,835 INFO L226 Difference]: Without dead ends: 183 [2018-02-02 10:48:32,836 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:32,836 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 183 states. [2018-02-02 10:48:32,839 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 183 to 183. [2018-02-02 10:48:32,839 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 183 states. [2018-02-02 10:48:32,840 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 183 states to 183 states and 193 transitions. [2018-02-02 10:48:32,840 INFO L78 Accepts]: Start accepts. Automaton has 183 states and 193 transitions. Word has length 43 [2018-02-02 10:48:32,841 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 10:48:32,841 INFO L432 AbstractCegarLoop]: Abstraction has 183 states and 193 transitions. [2018-02-02 10:48:32,841 INFO L433 AbstractCegarLoop]: Interpolant automaton has 13 states. [2018-02-02 10:48:32,841 INFO L276 IsEmpty]: Start isEmpty. Operand 183 states and 193 transitions. [2018-02-02 10:48:32,842 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2018-02-02 10:48:32,842 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 10:48:32,842 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:32,842 INFO L371 AbstractCegarLoop]: === Iteration 17 === [ldv_kref_initErr0RequiresViolation, ldv_kref_initErr1RequiresViolation, ldv_kobject_createErr0RequiresViolation, ldv_kobject_createErr1RequiresViolation, ldv_atomic_sub_returnErr1RequiresViolation, ldv_atomic_sub_returnErr0RequiresViolation, ldv_atomic_sub_returnErr3RequiresViolation, ldv_atomic_sub_returnErr2RequiresViolation, ldv_atomic_add_returnErr0RequiresViolation, ldv_atomic_add_returnErr1RequiresViolation, ldv_atomic_add_returnErr2RequiresViolation, ldv_atomic_add_returnErr3RequiresViolation, ldv_kobject_cleanupErr4RequiresViolation, ldv_kobject_cleanupErr2RequiresViolation, ldv_kobject_cleanupErr5RequiresViolation, ldv_kobject_cleanupErr3RequiresViolation, ldv_kobject_cleanupErr0RequiresViolation, ldv_kobject_cleanupErr1RequiresViolation, mainErr0EnsuresViolation, LDV_INIT_LIST_HEADErr1RequiresViolation, LDV_INIT_LIST_HEADErr3RequiresViolation, LDV_INIT_LIST_HEADErr2RequiresViolation, LDV_INIT_LIST_HEADErr0RequiresViolation]=== [2018-02-02 10:48:32,842 INFO L82 PathProgramCache]: Analyzing trace with hash -102825107, now seen corresponding path program 10 times [2018-02-02 10:48:32,843 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 10:48:32,856 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 10:48:32,857 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:32,943 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:32,944 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-02 10:48:32,944 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [14] total 14 [2018-02-02 10:48:32,944 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 10:48:32,944 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 10:48:32,944 INFO L182 omatonBuilderFactory]: Interpolants [5733#true, 5734#false, 5735#(= |#Ultimate.C_memset_#t~loopctr21| 0), 5736#(<= |#Ultimate.C_memset_#t~loopctr21| 1), 5737#(<= |#Ultimate.C_memset_#t~loopctr21| 2), 5738#(<= |#Ultimate.C_memset_#t~loopctr21| 3), 5739#(<= |#Ultimate.C_memset_#t~loopctr21| 4), 5740#(<= |#Ultimate.C_memset_#t~loopctr21| 5), 5741#(<= |#Ultimate.C_memset_#t~loopctr21| 6), 5742#(<= |#Ultimate.C_memset_#t~loopctr21| 7), 5743#(<= |#Ultimate.C_memset_#t~loopctr21| 8), 5744#(<= |#Ultimate.C_memset_#t~loopctr21| 9), 5745#(<= |#Ultimate.C_memset_#t~loopctr21| 10), 5746#(<= |#Ultimate.C_memset_#amount| 10)] [2018-02-02 10:48:32,944 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:32,944 INFO L409 AbstractCegarLoop]: Interpolant automaton has 14 states [2018-02-02 10:48:32,944 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2018-02-02 10:48:32,944 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=80, Invalid=102, Unknown=0, NotChecked=0, Total=182 [2018-02-02 10:48:32,945 INFO L87 Difference]: Start difference. First operand 183 states and 193 transitions. Second operand 14 states. [2018-02-02 10:48:32,982 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 10:48:32,982 INFO L93 Difference]: Finished difference Result 186 states and 196 transitions. [2018-02-02 10:48:32,983 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2018-02-02 10:48:32,983 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 44 [2018-02-02 10:48:32,984 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 10:48:32,984 INFO L225 Difference]: With dead ends: 186 [2018-02-02 10:48:32,984 INFO L226 Difference]: Without dead ends: 184 [2018-02-02 10:48:32,985 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:32,985 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 184 states. [2018-02-02 10:48:32,988 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 184 to 184. [2018-02-02 10:48:32,988 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 184 states. [2018-02-02 10:48:32,989 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 184 states to 184 states and 194 transitions. [2018-02-02 10:48:32,989 INFO L78 Accepts]: Start accepts. Automaton has 184 states and 194 transitions. Word has length 44 [2018-02-02 10:48:32,989 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 10:48:32,989 INFO L432 AbstractCegarLoop]: Abstraction has 184 states and 194 transitions. [2018-02-02 10:48:32,989 INFO L433 AbstractCegarLoop]: Interpolant automaton has 14 states. [2018-02-02 10:48:32,990 INFO L276 IsEmpty]: Start isEmpty. Operand 184 states and 194 transitions. [2018-02-02 10:48:32,990 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2018-02-02 10:48:32,990 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 10:48:32,990 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:32,990 INFO L371 AbstractCegarLoop]: === Iteration 18 === [ldv_kref_initErr0RequiresViolation, ldv_kref_initErr1RequiresViolation, ldv_kobject_createErr0RequiresViolation, ldv_kobject_createErr1RequiresViolation, ldv_atomic_sub_returnErr1RequiresViolation, ldv_atomic_sub_returnErr0RequiresViolation, ldv_atomic_sub_returnErr3RequiresViolation, ldv_atomic_sub_returnErr2RequiresViolation, ldv_atomic_add_returnErr0RequiresViolation, ldv_atomic_add_returnErr1RequiresViolation, ldv_atomic_add_returnErr2RequiresViolation, ldv_atomic_add_returnErr3RequiresViolation, ldv_kobject_cleanupErr4RequiresViolation, ldv_kobject_cleanupErr2RequiresViolation, ldv_kobject_cleanupErr5RequiresViolation, ldv_kobject_cleanupErr3RequiresViolation, ldv_kobject_cleanupErr0RequiresViolation, ldv_kobject_cleanupErr1RequiresViolation, mainErr0EnsuresViolation, LDV_INIT_LIST_HEADErr1RequiresViolation, LDV_INIT_LIST_HEADErr3RequiresViolation, LDV_INIT_LIST_HEADErr2RequiresViolation, LDV_INIT_LIST_HEADErr0RequiresViolation]=== [2018-02-02 10:48:32,991 INFO L82 PathProgramCache]: Analyzing trace with hash -1478876562, now seen corresponding path program 11 times [2018-02-02 10:48:32,991 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 10:48:33,004 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 10:48:33,005 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:33,093 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:33,094 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-02 10:48:33,094 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [15] total 15 [2018-02-02 10:48:33,094 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 10:48:33,094 INFO 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:33,094 INFO L182 omatonBuilderFactory]: Interpolants [6119#true, 6120#false, 6121#(= |#Ultimate.C_memset_#t~loopctr21| 0), 6122#(<= |#Ultimate.C_memset_#t~loopctr21| 1), 6123#(<= |#Ultimate.C_memset_#t~loopctr21| 2), 6124#(<= |#Ultimate.C_memset_#t~loopctr21| 3), 6125#(<= |#Ultimate.C_memset_#t~loopctr21| 4), 6126#(<= |#Ultimate.C_memset_#t~loopctr21| 5), 6127#(<= |#Ultimate.C_memset_#t~loopctr21| 6), 6128#(<= |#Ultimate.C_memset_#t~loopctr21| 7), 6129#(<= |#Ultimate.C_memset_#t~loopctr21| 8), 6130#(<= |#Ultimate.C_memset_#t~loopctr21| 9), 6131#(<= |#Ultimate.C_memset_#t~loopctr21| 10), 6132#(<= |#Ultimate.C_memset_#t~loopctr21| 11), 6133#(<= |#Ultimate.C_memset_#amount| 11)] [2018-02-02 10:48:33,095 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:33,095 INFO L409 AbstractCegarLoop]: Interpolant automaton has 15 states [2018-02-02 10:48:33,095 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2018-02-02 10:48:33,095 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=93, Invalid=117, Unknown=0, NotChecked=0, Total=210 [2018-02-02 10:48:33,095 INFO L87 Difference]: Start difference. First operand 184 states and 194 transitions. Second operand 15 states. [2018-02-02 10:48:33,133 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 10:48:33,133 INFO L93 Difference]: Finished difference Result 187 states and 197 transitions. [2018-02-02 10:48:33,134 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2018-02-02 10:48:33,134 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 45 [2018-02-02 10:48:33,134 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 10:48:33,135 INFO L225 Difference]: With dead ends: 187 [2018-02-02 10:48:33,135 INFO L226 Difference]: Without dead ends: 185 [2018-02-02 10:48:33,135 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:33,136 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 185 states. [2018-02-02 10:48:33,140 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 185 to 185. [2018-02-02 10:48:33,140 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 185 states. [2018-02-02 10:48:33,141 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 185 states to 185 states and 195 transitions. [2018-02-02 10:48:33,141 INFO L78 Accepts]: Start accepts. Automaton has 185 states and 195 transitions. Word has length 45 [2018-02-02 10:48:33,141 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 10:48:33,141 INFO L432 AbstractCegarLoop]: Abstraction has 185 states and 195 transitions. [2018-02-02 10:48:33,141 INFO L433 AbstractCegarLoop]: Interpolant automaton has 15 states. [2018-02-02 10:48:33,141 INFO L276 IsEmpty]: Start isEmpty. Operand 185 states and 195 transitions. [2018-02-02 10:48:33,142 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2018-02-02 10:48:33,142 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 10:48:33,142 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:33,142 INFO L371 AbstractCegarLoop]: === Iteration 19 === [ldv_kref_initErr0RequiresViolation, ldv_kref_initErr1RequiresViolation, ldv_kobject_createErr0RequiresViolation, ldv_kobject_createErr1RequiresViolation, ldv_atomic_sub_returnErr1RequiresViolation, ldv_atomic_sub_returnErr0RequiresViolation, ldv_atomic_sub_returnErr3RequiresViolation, ldv_atomic_sub_returnErr2RequiresViolation, ldv_atomic_add_returnErr0RequiresViolation, ldv_atomic_add_returnErr1RequiresViolation, ldv_atomic_add_returnErr2RequiresViolation, ldv_atomic_add_returnErr3RequiresViolation, ldv_kobject_cleanupErr4RequiresViolation, ldv_kobject_cleanupErr2RequiresViolation, ldv_kobject_cleanupErr5RequiresViolation, ldv_kobject_cleanupErr3RequiresViolation, ldv_kobject_cleanupErr0RequiresViolation, ldv_kobject_cleanupErr1RequiresViolation, mainErr0EnsuresViolation, LDV_INIT_LIST_HEADErr1RequiresViolation, LDV_INIT_LIST_HEADErr3RequiresViolation, LDV_INIT_LIST_HEADErr2RequiresViolation, LDV_INIT_LIST_HEADErr0RequiresViolation]=== [2018-02-02 10:48:33,143 INFO L82 PathProgramCache]: Analyzing trace with hash -1186798707, now seen corresponding path program 12 times [2018-02-02 10:48:33,143 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 10:48:33,155 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 10:48:33,155 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:33,268 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:33,269 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-02 10:48:33,269 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [16] total 16 [2018-02-02 10:48:33,269 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 10:48:33,269 INFO 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:33,269 INFO L182 omatonBuilderFactory]: Interpolants [6508#true, 6509#false, 6510#(= |#Ultimate.C_memset_#t~loopctr21| 0), 6511#(<= |#Ultimate.C_memset_#t~loopctr21| 1), 6512#(<= |#Ultimate.C_memset_#t~loopctr21| 2), 6513#(<= |#Ultimate.C_memset_#t~loopctr21| 3), 6514#(<= |#Ultimate.C_memset_#t~loopctr21| 4), 6515#(<= |#Ultimate.C_memset_#t~loopctr21| 5), 6516#(<= |#Ultimate.C_memset_#t~loopctr21| 6), 6517#(<= |#Ultimate.C_memset_#t~loopctr21| 7), 6518#(<= |#Ultimate.C_memset_#t~loopctr21| 8), 6519#(<= |#Ultimate.C_memset_#t~loopctr21| 9), 6520#(<= |#Ultimate.C_memset_#t~loopctr21| 10), 6521#(<= |#Ultimate.C_memset_#t~loopctr21| 11), 6522#(<= |#Ultimate.C_memset_#t~loopctr21| 12), 6523#(<= |#Ultimate.C_memset_#amount| 12)] [2018-02-02 10:48:33,269 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:33,269 INFO L409 AbstractCegarLoop]: Interpolant automaton has 16 states [2018-02-02 10:48:33,270 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2018-02-02 10:48:33,270 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=107, Invalid=133, Unknown=0, NotChecked=0, Total=240 [2018-02-02 10:48:33,270 INFO L87 Difference]: Start difference. First operand 185 states and 195 transitions. Second operand 16 states. [2018-02-02 10:48:33,306 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 10:48:33,306 INFO L93 Difference]: Finished difference Result 188 states and 198 transitions. [2018-02-02 10:48:33,307 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2018-02-02 10:48:33,307 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 46 [2018-02-02 10:48:33,307 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 10:48:33,308 INFO L225 Difference]: With dead ends: 188 [2018-02-02 10:48:33,308 INFO L226 Difference]: Without dead ends: 186 [2018-02-02 10:48:33,308 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:33,309 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 186 states. [2018-02-02 10:48:33,313 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 186 to 186. [2018-02-02 10:48:33,313 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 186 states. [2018-02-02 10:48:33,314 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 186 states to 186 states and 196 transitions. [2018-02-02 10:48:33,314 INFO L78 Accepts]: Start accepts. Automaton has 186 states and 196 transitions. Word has length 46 [2018-02-02 10:48:33,315 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 10:48:33,315 INFO L432 AbstractCegarLoop]: Abstraction has 186 states and 196 transitions. [2018-02-02 10:48:33,315 INFO L433 AbstractCegarLoop]: Interpolant automaton has 16 states. [2018-02-02 10:48:33,315 INFO L276 IsEmpty]: Start isEmpty. Operand 186 states and 196 transitions. [2018-02-02 10:48:33,316 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2018-02-02 10:48:33,316 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 10:48:33,316 INFO L351 BasicCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-02 10:48:33,316 INFO L371 AbstractCegarLoop]: === Iteration 20 === [ldv_kref_initErr0RequiresViolation, ldv_kref_initErr1RequiresViolation, ldv_kobject_createErr0RequiresViolation, ldv_kobject_createErr1RequiresViolation, ldv_atomic_sub_returnErr1RequiresViolation, ldv_atomic_sub_returnErr0RequiresViolation, ldv_atomic_sub_returnErr3RequiresViolation, ldv_atomic_sub_returnErr2RequiresViolation, ldv_atomic_add_returnErr0RequiresViolation, ldv_atomic_add_returnErr1RequiresViolation, ldv_atomic_add_returnErr2RequiresViolation, ldv_atomic_add_returnErr3RequiresViolation, ldv_kobject_cleanupErr4RequiresViolation, ldv_kobject_cleanupErr2RequiresViolation, ldv_kobject_cleanupErr5RequiresViolation, ldv_kobject_cleanupErr3RequiresViolation, ldv_kobject_cleanupErr0RequiresViolation, ldv_kobject_cleanupErr1RequiresViolation, mainErr0EnsuresViolation, LDV_INIT_LIST_HEADErr1RequiresViolation, LDV_INIT_LIST_HEADErr3RequiresViolation, LDV_INIT_LIST_HEADErr2RequiresViolation, LDV_INIT_LIST_HEADErr0RequiresViolation]=== [2018-02-02 10:48:33,316 INFO L82 PathProgramCache]: Analyzing trace with hash 689381786, now seen corresponding path program 1 times [2018-02-02 10:48:33,317 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 10:48:33,323 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 10:48:33,324 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:33,357 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2018-02-02 10:48:33,357 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-02 10:48:33,357 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-02-02 10:48:33,357 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 10:48:33,358 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2018-02-02 10:48:33,358 INFO L182 omatonBuilderFactory]: Interpolants [6900#true, 6901#false, 6902#(= |#valid| |old(#valid)|)] [2018-02-02 10:48:33,358 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2018-02-02 10:48:33,358 INFO L409 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-02-02 10:48:33,358 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-02-02 10:48:33,358 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-02-02 10:48:33,358 INFO L87 Difference]: Start difference. First operand 186 states and 196 transitions. Second operand 3 states. [2018-02-02 10:48:33,448 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 10:48:33,449 INFO L93 Difference]: Finished difference Result 205 states and 218 transitions. [2018-02-02 10:48:33,449 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-02-02 10:48:33,449 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 47 [2018-02-02 10:48:33,449 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 10:48:33,450 INFO L225 Difference]: With dead ends: 205 [2018-02-02 10:48:33,450 INFO L226 Difference]: Without dead ends: 192 [2018-02-02 10:48:33,450 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-02-02 10:48:33,451 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 192 states. [2018-02-02 10:48:33,455 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 192 to 182. [2018-02-02 10:48:33,455 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 182 states. [2018-02-02 10:48:33,456 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 182 states to 182 states and 191 transitions. [2018-02-02 10:48:33,456 INFO L78 Accepts]: Start accepts. Automaton has 182 states and 191 transitions. Word has length 47 [2018-02-02 10:48:33,456 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 10:48:33,456 INFO L432 AbstractCegarLoop]: Abstraction has 182 states and 191 transitions. [2018-02-02 10:48:33,456 INFO L433 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-02-02 10:48:33,456 INFO L276 IsEmpty]: Start isEmpty. Operand 182 states and 191 transitions. [2018-02-02 10:48:33,457 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2018-02-02 10:48:33,457 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 10:48:33,457 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:33,457 INFO L371 AbstractCegarLoop]: === Iteration 21 === [ldv_kref_initErr0RequiresViolation, ldv_kref_initErr1RequiresViolation, ldv_kobject_createErr0RequiresViolation, ldv_kobject_createErr1RequiresViolation, ldv_atomic_sub_returnErr1RequiresViolation, ldv_atomic_sub_returnErr0RequiresViolation, ldv_atomic_sub_returnErr3RequiresViolation, ldv_atomic_sub_returnErr2RequiresViolation, ldv_atomic_add_returnErr0RequiresViolation, ldv_atomic_add_returnErr1RequiresViolation, ldv_atomic_add_returnErr2RequiresViolation, ldv_atomic_add_returnErr3RequiresViolation, ldv_kobject_cleanupErr4RequiresViolation, ldv_kobject_cleanupErr2RequiresViolation, ldv_kobject_cleanupErr5RequiresViolation, ldv_kobject_cleanupErr3RequiresViolation, ldv_kobject_cleanupErr0RequiresViolation, ldv_kobject_cleanupErr1RequiresViolation, mainErr0EnsuresViolation, LDV_INIT_LIST_HEADErr1RequiresViolation, LDV_INIT_LIST_HEADErr3RequiresViolation, LDV_INIT_LIST_HEADErr2RequiresViolation, LDV_INIT_LIST_HEADErr0RequiresViolation]=== [2018-02-02 10:48:33,457 INFO L82 PathProgramCache]: Analyzing trace with hash -722319794, now seen corresponding path program 13 times [2018-02-02 10:48:33,458 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 10:48:33,470 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 10:48:33,471 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:33,578 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:33,578 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-02 10:48:33,578 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [17] total 17 [2018-02-02 10:48:33,578 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 10:48:33,579 INFO 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:33,579 INFO L182 omatonBuilderFactory]: Interpolants [7296#(<= |#Ultimate.C_memset_#t~loopctr21| 4), 7297#(<= |#Ultimate.C_memset_#t~loopctr21| 5), 7298#(<= |#Ultimate.C_memset_#t~loopctr21| 6), 7299#(<= |#Ultimate.C_memset_#t~loopctr21| 7), 7300#(<= |#Ultimate.C_memset_#t~loopctr21| 8), 7301#(<= |#Ultimate.C_memset_#t~loopctr21| 9), 7302#(<= |#Ultimate.C_memset_#t~loopctr21| 10), 7303#(<= |#Ultimate.C_memset_#t~loopctr21| 11), 7304#(<= |#Ultimate.C_memset_#t~loopctr21| 12), 7305#(<= |#Ultimate.C_memset_#t~loopctr21| 13), 7306#(<= |#Ultimate.C_memset_#amount| 13), 7290#true, 7291#false, 7292#(= |#Ultimate.C_memset_#t~loopctr21| 0), 7293#(<= |#Ultimate.C_memset_#t~loopctr21| 1), 7294#(<= |#Ultimate.C_memset_#t~loopctr21| 2), 7295#(<= |#Ultimate.C_memset_#t~loopctr21| 3)] [2018-02-02 10:48:33,579 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:33,579 INFO L409 AbstractCegarLoop]: Interpolant automaton has 17 states [2018-02-02 10:48:33,579 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2018-02-02 10:48:33,579 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=122, Invalid=150, Unknown=0, NotChecked=0, Total=272 [2018-02-02 10:48:33,580 INFO L87 Difference]: Start difference. First operand 182 states and 191 transitions. Second operand 17 states. [2018-02-02 10:48:33,615 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 10:48:33,615 INFO L93 Difference]: Finished difference Result 185 states and 194 transitions. [2018-02-02 10:48:33,615 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2018-02-02 10:48:33,615 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 47 [2018-02-02 10:48:33,615 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 10:48:33,616 INFO L225 Difference]: With dead ends: 185 [2018-02-02 10:48:33,616 INFO L226 Difference]: Without dead ends: 183 [2018-02-02 10:48:33,616 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:33,617 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 183 states. [2018-02-02 10:48:33,620 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 183 to 183. [2018-02-02 10:48:33,620 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 183 states. [2018-02-02 10:48:33,621 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 183 states to 183 states and 192 transitions. [2018-02-02 10:48:33,621 INFO L78 Accepts]: Start accepts. Automaton has 183 states and 192 transitions. Word has length 47 [2018-02-02 10:48:33,621 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 10:48:33,621 INFO L432 AbstractCegarLoop]: Abstraction has 183 states and 192 transitions. [2018-02-02 10:48:33,621 INFO L433 AbstractCegarLoop]: Interpolant automaton has 17 states. [2018-02-02 10:48:33,621 INFO L276 IsEmpty]: Start isEmpty. Operand 183 states and 192 transitions. [2018-02-02 10:48:33,622 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2018-02-02 10:48:33,622 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 10:48:33,622 INFO L351 BasicCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-02 10:48:33,622 INFO L371 AbstractCegarLoop]: === Iteration 22 === [ldv_kref_initErr0RequiresViolation, ldv_kref_initErr1RequiresViolation, ldv_kobject_createErr0RequiresViolation, ldv_kobject_createErr1RequiresViolation, ldv_atomic_sub_returnErr1RequiresViolation, ldv_atomic_sub_returnErr0RequiresViolation, ldv_atomic_sub_returnErr3RequiresViolation, ldv_atomic_sub_returnErr2RequiresViolation, ldv_atomic_add_returnErr0RequiresViolation, ldv_atomic_add_returnErr1RequiresViolation, ldv_atomic_add_returnErr2RequiresViolation, ldv_atomic_add_returnErr3RequiresViolation, ldv_kobject_cleanupErr4RequiresViolation, ldv_kobject_cleanupErr2RequiresViolation, ldv_kobject_cleanupErr5RequiresViolation, ldv_kobject_cleanupErr3RequiresViolation, ldv_kobject_cleanupErr0RequiresViolation, ldv_kobject_cleanupErr1RequiresViolation, mainErr0EnsuresViolation, LDV_INIT_LIST_HEADErr1RequiresViolation, LDV_INIT_LIST_HEADErr3RequiresViolation, LDV_INIT_LIST_HEADErr2RequiresViolation, LDV_INIT_LIST_HEADErr0RequiresViolation]=== [2018-02-02 10:48:33,622 INFO L82 PathProgramCache]: Analyzing trace with hash -1335931844, now seen corresponding path program 1 times [2018-02-02 10:48:33,623 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 10:48:33,627 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 10:48:33,628 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:33,652 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2018-02-02 10:48:33,652 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-02 10:48:33,653 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-02-02 10:48:33,653 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 10:48:33,653 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2018-02-02 10:48:33,653 INFO L182 omatonBuilderFactory]: Interpolants [7680#(not (= |ldv_malloc_#res.base| 0)), 7681#(not (= |ldv_kobject_create_#t~ret17.base| 0)), 7682#(not (= ldv_kobject_create_~kobj~1.base 0)), 7677#true, 7678#false, 7679#(not (= |ldv_malloc_#t~malloc4.base| 0))] [2018-02-02 10:48:33,653 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2018-02-02 10:48:33,653 INFO L409 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-02-02 10:48:33,654 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-02-02 10:48:33,654 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-02-02 10:48:33,654 INFO L87 Difference]: Start difference. First operand 183 states and 192 transitions. Second operand 6 states. [2018-02-02 10:48:33,667 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 10:48:33,668 INFO L93 Difference]: Finished difference Result 159 states and 166 transitions. [2018-02-02 10:48:33,670 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-02-02 10:48:33,670 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 49 [2018-02-02 10:48:33,670 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 10:48:33,671 INFO L225 Difference]: With dead ends: 159 [2018-02-02 10:48:33,671 INFO L226 Difference]: Without dead ends: 159 [2018-02-02 10:48:33,672 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:33,672 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 159 states. [2018-02-02 10:48:33,674 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 159 to 159. [2018-02-02 10:48:33,674 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 159 states. [2018-02-02 10:48:33,675 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 159 states to 159 states and 166 transitions. [2018-02-02 10:48:33,675 INFO L78 Accepts]: Start accepts. Automaton has 159 states and 166 transitions. Word has length 49 [2018-02-02 10:48:33,675 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 10:48:33,675 INFO L432 AbstractCegarLoop]: Abstraction has 159 states and 166 transitions. [2018-02-02 10:48:33,675 INFO L433 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-02-02 10:48:33,675 INFO L276 IsEmpty]: Start isEmpty. Operand 159 states and 166 transitions. [2018-02-02 10:48:33,676 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2018-02-02 10:48:33,676 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 10:48:33,676 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:33,676 INFO L371 AbstractCegarLoop]: === Iteration 23 === [ldv_kref_initErr0RequiresViolation, ldv_kref_initErr1RequiresViolation, ldv_kobject_createErr0RequiresViolation, ldv_kobject_createErr1RequiresViolation, ldv_atomic_sub_returnErr1RequiresViolation, ldv_atomic_sub_returnErr0RequiresViolation, ldv_atomic_sub_returnErr3RequiresViolation, ldv_atomic_sub_returnErr2RequiresViolation, ldv_atomic_add_returnErr0RequiresViolation, ldv_atomic_add_returnErr1RequiresViolation, ldv_atomic_add_returnErr2RequiresViolation, ldv_atomic_add_returnErr3RequiresViolation, ldv_kobject_cleanupErr4RequiresViolation, ldv_kobject_cleanupErr2RequiresViolation, ldv_kobject_cleanupErr5RequiresViolation, ldv_kobject_cleanupErr3RequiresViolation, ldv_kobject_cleanupErr0RequiresViolation, ldv_kobject_cleanupErr1RequiresViolation, mainErr0EnsuresViolation, LDV_INIT_LIST_HEADErr1RequiresViolation, LDV_INIT_LIST_HEADErr3RequiresViolation, LDV_INIT_LIST_HEADErr2RequiresViolation, LDV_INIT_LIST_HEADErr0RequiresViolation]=== [2018-02-02 10:48:33,676 INFO L82 PathProgramCache]: Analyzing trace with hash 791624621, now seen corresponding path program 14 times [2018-02-02 10:48:33,677 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 10:48:33,689 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 10:48:33,690 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 10:48:33,820 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:33,820 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-02 10:48:33,820 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [18] total 18 [2018-02-02 10:48:33,820 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 10:48:33,820 INFO 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:33,820 INFO L182 omatonBuilderFactory]: Interpolants [8003#true, 8004#false, 8005#(= |#Ultimate.C_memset_#t~loopctr21| 0), 8006#(<= |#Ultimate.C_memset_#t~loopctr21| 1), 8007#(<= |#Ultimate.C_memset_#t~loopctr21| 2), 8008#(<= |#Ultimate.C_memset_#t~loopctr21| 3), 8009#(<= |#Ultimate.C_memset_#t~loopctr21| 4), 8010#(<= |#Ultimate.C_memset_#t~loopctr21| 5), 8011#(<= |#Ultimate.C_memset_#t~loopctr21| 6), 8012#(<= |#Ultimate.C_memset_#t~loopctr21| 7), 8013#(<= |#Ultimate.C_memset_#t~loopctr21| 8), 8014#(<= |#Ultimate.C_memset_#t~loopctr21| 9), 8015#(<= |#Ultimate.C_memset_#t~loopctr21| 10), 8016#(<= |#Ultimate.C_memset_#t~loopctr21| 11), 8017#(<= |#Ultimate.C_memset_#t~loopctr21| 12), 8018#(<= |#Ultimate.C_memset_#t~loopctr21| 13), 8019#(<= |#Ultimate.C_memset_#t~loopctr21| 14), 8020#(<= |#Ultimate.C_memset_#amount| 14)] [2018-02-02 10:48:33,820 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:33,821 INFO L409 AbstractCegarLoop]: Interpolant automaton has 18 states [2018-02-02 10:48:33,821 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2018-02-02 10:48:33,821 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=138, Invalid=168, Unknown=0, NotChecked=0, Total=306 [2018-02-02 10:48:33,821 INFO L87 Difference]: Start difference. First operand 159 states and 166 transitions. Second operand 18 states. [2018-02-02 10:48:33,878 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 10:48:33,878 INFO L93 Difference]: Finished difference Result 162 states and 169 transitions. [2018-02-02 10:48:33,879 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2018-02-02 10:48:33,879 INFO L78 Accepts]: Start accepts. Automaton has 18 states. Word has length 48 [2018-02-02 10:48:33,879 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 10:48:33,880 INFO L225 Difference]: With dead ends: 162 [2018-02-02 10:48:33,880 INFO L226 Difference]: Without dead ends: 160 [2018-02-02 10:48:33,880 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 14 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=142, Invalid=200, Unknown=0, NotChecked=0, Total=342 [2018-02-02 10:48:33,880 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 160 states. [2018-02-02 10:48:33,883 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 160 to 160. [2018-02-02 10:48:33,883 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 160 states. [2018-02-02 10:48:33,883 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 160 states to 160 states and 167 transitions. [2018-02-02 10:48:33,883 INFO L78 Accepts]: Start accepts. Automaton has 160 states and 167 transitions. Word has length 48 [2018-02-02 10:48:33,884 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 10:48:33,884 INFO L432 AbstractCegarLoop]: Abstraction has 160 states and 167 transitions. [2018-02-02 10:48:33,884 INFO L433 AbstractCegarLoop]: Interpolant automaton has 18 states. [2018-02-02 10:48:33,884 INFO L276 IsEmpty]: Start isEmpty. Operand 160 states and 167 transitions. [2018-02-02 10:48:33,884 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2018-02-02 10:48:33,884 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 10:48:33,884 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:33,885 INFO L371 AbstractCegarLoop]: === Iteration 24 === [ldv_kref_initErr0RequiresViolation, ldv_kref_initErr1RequiresViolation, ldv_kobject_createErr0RequiresViolation, ldv_kobject_createErr1RequiresViolation, ldv_atomic_sub_returnErr1RequiresViolation, ldv_atomic_sub_returnErr0RequiresViolation, ldv_atomic_sub_returnErr3RequiresViolation, ldv_atomic_sub_returnErr2RequiresViolation, ldv_atomic_add_returnErr0RequiresViolation, ldv_atomic_add_returnErr1RequiresViolation, ldv_atomic_add_returnErr2RequiresViolation, ldv_atomic_add_returnErr3RequiresViolation, ldv_kobject_cleanupErr4RequiresViolation, ldv_kobject_cleanupErr2RequiresViolation, ldv_kobject_cleanupErr5RequiresViolation, ldv_kobject_cleanupErr3RequiresViolation, ldv_kobject_cleanupErr0RequiresViolation, ldv_kobject_cleanupErr1RequiresViolation, mainErr0EnsuresViolation, LDV_INIT_LIST_HEADErr1RequiresViolation, LDV_INIT_LIST_HEADErr3RequiresViolation, LDV_INIT_LIST_HEADErr2RequiresViolation, LDV_INIT_LIST_HEADErr0RequiresViolation]=== [2018-02-02 10:48:33,885 INFO L82 PathProgramCache]: Analyzing trace with hash 479261230, now seen corresponding path program 15 times [2018-02-02 10:48:33,885 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 10:48:33,899 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 10:48:33,900 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:34,063 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:34,064 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-02 10:48:34,064 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [19] total 19 [2018-02-02 10:48:34,064 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 10:48:34,064 INFO 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:34,064 INFO L182 omatonBuilderFactory]: Interpolants [8352#(<= |#Ultimate.C_memset_#t~loopctr21| 5), 8353#(<= |#Ultimate.C_memset_#t~loopctr21| 6), 8354#(<= |#Ultimate.C_memset_#t~loopctr21| 7), 8355#(<= |#Ultimate.C_memset_#t~loopctr21| 8), 8356#(<= |#Ultimate.C_memset_#t~loopctr21| 9), 8357#(<= |#Ultimate.C_memset_#t~loopctr21| 10), 8358#(<= |#Ultimate.C_memset_#t~loopctr21| 11), 8359#(<= |#Ultimate.C_memset_#t~loopctr21| 12), 8360#(<= |#Ultimate.C_memset_#t~loopctr21| 13), 8361#(<= |#Ultimate.C_memset_#t~loopctr21| 14), 8362#(<= |#Ultimate.C_memset_#t~loopctr21| 15), 8363#(<= |#Ultimate.C_memset_#amount| 15), 8345#true, 8346#false, 8347#(= |#Ultimate.C_memset_#t~loopctr21| 0), 8348#(<= |#Ultimate.C_memset_#t~loopctr21| 1), 8349#(<= |#Ultimate.C_memset_#t~loopctr21| 2), 8350#(<= |#Ultimate.C_memset_#t~loopctr21| 3), 8351#(<= |#Ultimate.C_memset_#t~loopctr21| 4)] [2018-02-02 10:48:34,065 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:34,065 INFO L409 AbstractCegarLoop]: Interpolant automaton has 19 states [2018-02-02 10:48:34,065 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2018-02-02 10:48:34,065 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=155, Invalid=187, Unknown=0, NotChecked=0, Total=342 [2018-02-02 10:48:34,065 INFO L87 Difference]: Start difference. First operand 160 states and 167 transitions. Second operand 19 states. [2018-02-02 10:48:34,098 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 10:48:34,098 INFO L93 Difference]: Finished difference Result 163 states and 170 transitions. [2018-02-02 10:48:34,098 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2018-02-02 10:48:34,098 INFO L78 Accepts]: Start accepts. Automaton has 19 states. Word has length 49 [2018-02-02 10:48:34,098 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 10:48:34,099 INFO L225 Difference]: With dead ends: 163 [2018-02-02 10:48:34,099 INFO L226 Difference]: Without dead ends: 161 [2018-02-02 10:48:34,099 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:34,100 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 161 states. [2018-02-02 10:48:34,102 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 161 to 161. [2018-02-02 10:48:34,102 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 161 states. [2018-02-02 10:48:34,103 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 161 states to 161 states and 168 transitions. [2018-02-02 10:48:34,103 INFO L78 Accepts]: Start accepts. Automaton has 161 states and 168 transitions. Word has length 49 [2018-02-02 10:48:34,103 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 10:48:34,103 INFO L432 AbstractCegarLoop]: Abstraction has 161 states and 168 transitions. [2018-02-02 10:48:34,103 INFO L433 AbstractCegarLoop]: Interpolant automaton has 19 states. [2018-02-02 10:48:34,103 INFO L276 IsEmpty]: Start isEmpty. Operand 161 states and 168 transitions. [2018-02-02 10:48:34,103 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2018-02-02 10:48:34,104 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 10:48:34,104 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:34,104 INFO L371 AbstractCegarLoop]: === Iteration 25 === [ldv_kref_initErr0RequiresViolation, ldv_kref_initErr1RequiresViolation, ldv_kobject_createErr0RequiresViolation, ldv_kobject_createErr1RequiresViolation, ldv_atomic_sub_returnErr1RequiresViolation, ldv_atomic_sub_returnErr0RequiresViolation, ldv_atomic_sub_returnErr3RequiresViolation, ldv_atomic_sub_returnErr2RequiresViolation, ldv_atomic_add_returnErr0RequiresViolation, ldv_atomic_add_returnErr1RequiresViolation, ldv_atomic_add_returnErr2RequiresViolation, ldv_atomic_add_returnErr3RequiresViolation, ldv_kobject_cleanupErr4RequiresViolation, ldv_kobject_cleanupErr2RequiresViolation, ldv_kobject_cleanupErr5RequiresViolation, ldv_kobject_cleanupErr3RequiresViolation, ldv_kobject_cleanupErr0RequiresViolation, ldv_kobject_cleanupErr1RequiresViolation, mainErr0EnsuresViolation, LDV_INIT_LIST_HEADErr1RequiresViolation, LDV_INIT_LIST_HEADErr3RequiresViolation, LDV_INIT_LIST_HEADErr2RequiresViolation, LDV_INIT_LIST_HEADErr0RequiresViolation]=== [2018-02-02 10:48:34,104 INFO L82 PathProgramCache]: Analyzing trace with hash -614069299, now seen corresponding path program 16 times [2018-02-02 10:48:34,105 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 10:48:34,118 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 10:48:34,118 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:34,302 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:34,302 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-02 10:48:34,302 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2018-02-02 10:48:34,302 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 10:48:34,302 INFO 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:34,302 INFO L182 omatonBuilderFactory]: Interpolants [8690#true, 8691#false, 8692#(= 0 |ldv_malloc_#t~malloc4.offset|), 8693#(= 0 |ldv_malloc_#res.offset|), 8694#(= 0 |ldv_kobject_create_#t~ret17.offset|), 8695#(= 0 ldv_kobject_create_~kobj~1.offset), 8696#(or (<= (+ |#Ultimate.C_memset_#ptr.offset| |#Ultimate.C_memset_#amount|) (select |#length| |#Ultimate.C_memset_#ptr.base|)) (not (= |#Ultimate.C_memset_#ptr.offset| 0))), 8697#(and (= 0 ldv_kobject_create_~kobj~1.offset) (<= 16 (select |#length| ldv_kobject_create_~kobj~1.base))), 8698#(and (= 0 |ldv_kobject_init_#in~kobj.offset|) (<= 16 (select |#length| |ldv_kobject_init_#in~kobj.base|))), 8699#(and (= 0 ldv_kobject_init_~kobj.offset) (<= 16 (select |#length| ldv_kobject_init_~kobj.base))), 8700#(and (<= 16 (select |#length| |ldv_kobject_init_internal_#in~kobj.base|)) (= 0 |ldv_kobject_init_internal_#in~kobj.offset|)), 8701#(and (<= 16 (select |#length| ldv_kobject_init_internal_~kobj.base)) (= ldv_kobject_init_internal_~kobj.offset 0)), 8702#(and (<= (+ |ldv_kref_init_#in~kref.offset| 4) (select |#length| |ldv_kref_init_#in~kref.base|)) (<= 12 |ldv_kref_init_#in~kref.offset|)), 8703#(and (<= 12 ldv_kref_init_~kref.offset) (<= (+ ldv_kref_init_~kref.offset 4) (select |#length| ldv_kref_init_~kref.base)))] [2018-02-02 10:48:34,303 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:34,303 INFO L409 AbstractCegarLoop]: Interpolant automaton has 14 states [2018-02-02 10:48:34,303 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2018-02-02 10:48:34,303 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=156, Unknown=0, NotChecked=0, Total=182 [2018-02-02 10:48:34,303 INFO L87 Difference]: Start difference. First operand 161 states and 168 transitions. Second operand 14 states. [2018-02-02 10:48:34,505 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 10:48:34,505 INFO L93 Difference]: Finished difference Result 160 states and 167 transitions. [2018-02-02 10:48:34,505 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2018-02-02 10:48:34,505 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 50 [2018-02-02 10:48:34,505 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 10:48:34,506 INFO L225 Difference]: With dead ends: 160 [2018-02-02 10:48:34,506 INFO L226 Difference]: Without dead ends: 160 [2018-02-02 10:48:34,506 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:34,506 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 160 states. [2018-02-02 10:48:34,508 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 160 to 160. [2018-02-02 10:48:34,508 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 160 states. [2018-02-02 10:48:34,509 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 160 states to 160 states and 167 transitions. [2018-02-02 10:48:34,509 INFO L78 Accepts]: Start accepts. Automaton has 160 states and 167 transitions. Word has length 50 [2018-02-02 10:48:34,509 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 10:48:34,509 INFO L432 AbstractCegarLoop]: Abstraction has 160 states and 167 transitions. [2018-02-02 10:48:34,509 INFO L433 AbstractCegarLoop]: Interpolant automaton has 14 states. [2018-02-02 10:48:34,510 INFO L276 IsEmpty]: Start isEmpty. Operand 160 states and 167 transitions. [2018-02-02 10:48:34,510 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2018-02-02 10:48:34,510 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 10:48:34,510 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:34,510 INFO L371 AbstractCegarLoop]: === Iteration 26 === [ldv_kref_initErr0RequiresViolation, ldv_kref_initErr1RequiresViolation, ldv_kobject_createErr0RequiresViolation, ldv_kobject_createErr1RequiresViolation, ldv_atomic_sub_returnErr1RequiresViolation, ldv_atomic_sub_returnErr0RequiresViolation, ldv_atomic_sub_returnErr3RequiresViolation, ldv_atomic_sub_returnErr2RequiresViolation, ldv_atomic_add_returnErr0RequiresViolation, ldv_atomic_add_returnErr1RequiresViolation, ldv_atomic_add_returnErr2RequiresViolation, ldv_atomic_add_returnErr3RequiresViolation, ldv_kobject_cleanupErr4RequiresViolation, ldv_kobject_cleanupErr2RequiresViolation, ldv_kobject_cleanupErr5RequiresViolation, ldv_kobject_cleanupErr3RequiresViolation, ldv_kobject_cleanupErr0RequiresViolation, ldv_kobject_cleanupErr1RequiresViolation, mainErr0EnsuresViolation, LDV_INIT_LIST_HEADErr1RequiresViolation, LDV_INIT_LIST_HEADErr3RequiresViolation, LDV_INIT_LIST_HEADErr2RequiresViolation, LDV_INIT_LIST_HEADErr0RequiresViolation]=== [2018-02-02 10:48:34,510 INFO L82 PathProgramCache]: Analyzing trace with hash 2018632319, now seen corresponding path program 1 times [2018-02-02 10:48:34,511 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 10:48:34,524 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 10:48:34,525 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:34,594 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:34,594 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-02 10:48:34,594 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2018-02-02 10:48:34,594 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 10:48:34,595 INFO 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:34,595 INFO L182 omatonBuilderFactory]: Interpolants [9040#(= 1 (select |#valid| |LDV_INIT_LIST_HEAD_#in~list.base|)), 9041#(= 1 (select |#valid| LDV_INIT_LIST_HEAD_~list.base)), 9032#true, 9033#false, 9034#(= 1 (select |#valid| |#Ultimate.C_memset_#ptr.base|)), 9035#(= 1 (select |#valid| ldv_kobject_create_~kobj~1.base)), 9036#(= 1 (select |#valid| |ldv_kobject_init_#in~kobj.base|)), 9037#(= 1 (select |#valid| ldv_kobject_init_~kobj.base)), 9038#(= 1 (select |#valid| |ldv_kobject_init_internal_#in~kobj.base|)), 9039#(= 1 (select |#valid| ldv_kobject_init_internal_~kobj.base))] [2018-02-02 10:48:34,595 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:34,595 INFO L409 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-02-02 10:48:34,595 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-02-02 10:48:34,595 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=73, Unknown=0, NotChecked=0, Total=90 [2018-02-02 10:48:34,595 INFO L87 Difference]: Start difference. First operand 160 states and 167 transitions. Second operand 10 states. [2018-02-02 10:48:34,791 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 10:48:34,791 INFO L93 Difference]: Finished difference Result 158 states and 165 transitions. [2018-02-02 10:48:34,792 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-02-02 10:48:34,792 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 55 [2018-02-02 10:48:34,792 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 10:48:34,793 INFO L225 Difference]: With dead ends: 158 [2018-02-02 10:48:34,793 INFO L226 Difference]: Without dead ends: 158 [2018-02-02 10:48:34,793 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:34,793 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 158 states. [2018-02-02 10:48:34,796 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 158 to 158. [2018-02-02 10:48:34,796 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 158 states. [2018-02-02 10:48:34,797 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 158 states to 158 states and 165 transitions. [2018-02-02 10:48:34,797 INFO L78 Accepts]: Start accepts. Automaton has 158 states and 165 transitions. Word has length 55 [2018-02-02 10:48:34,797 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 10:48:34,798 INFO L432 AbstractCegarLoop]: Abstraction has 158 states and 165 transitions. [2018-02-02 10:48:34,798 INFO L433 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-02-02 10:48:34,798 INFO L276 IsEmpty]: Start isEmpty. Operand 158 states and 165 transitions. [2018-02-02 10:48:34,798 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2018-02-02 10:48:34,798 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 10:48:34,798 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:34,798 INFO L371 AbstractCegarLoop]: === Iteration 27 === [ldv_kref_initErr0RequiresViolation, ldv_kref_initErr1RequiresViolation, ldv_kobject_createErr0RequiresViolation, ldv_kobject_createErr1RequiresViolation, ldv_atomic_sub_returnErr1RequiresViolation, ldv_atomic_sub_returnErr0RequiresViolation, ldv_atomic_sub_returnErr3RequiresViolation, ldv_atomic_sub_returnErr2RequiresViolation, ldv_atomic_add_returnErr0RequiresViolation, ldv_atomic_add_returnErr1RequiresViolation, ldv_atomic_add_returnErr2RequiresViolation, ldv_atomic_add_returnErr3RequiresViolation, ldv_kobject_cleanupErr4RequiresViolation, ldv_kobject_cleanupErr2RequiresViolation, ldv_kobject_cleanupErr5RequiresViolation, ldv_kobject_cleanupErr3RequiresViolation, ldv_kobject_cleanupErr0RequiresViolation, ldv_kobject_cleanupErr1RequiresViolation, mainErr0EnsuresViolation, LDV_INIT_LIST_HEADErr1RequiresViolation, LDV_INIT_LIST_HEADErr3RequiresViolation, LDV_INIT_LIST_HEADErr2RequiresViolation, LDV_INIT_LIST_HEADErr0RequiresViolation]=== [2018-02-02 10:48:34,799 INFO L82 PathProgramCache]: Analyzing trace with hash 2018632320, now seen corresponding path program 1 times [2018-02-02 10:48:34,799 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 10:48:34,816 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 10:48:34,817 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:34,986 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:34,986 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-02 10:48:34,986 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2018-02-02 10:48:34,986 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 10:48:34,986 INFO 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:34,987 INFO L182 omatonBuilderFactory]: Interpolants [9376#(and (<= 4 |LDV_INIT_LIST_HEAD_#in~list.offset|) (<= (+ |LDV_INIT_LIST_HEAD_#in~list.offset| 12) (select |#length| |LDV_INIT_LIST_HEAD_#in~list.base|))), 9377#(and (<= (+ LDV_INIT_LIST_HEAD_~list.offset 12) (select |#length| LDV_INIT_LIST_HEAD_~list.base)) (<= 4 LDV_INIT_LIST_HEAD_~list.offset)), 9364#true, 9365#false, 9366#(= 0 |ldv_malloc_#t~malloc4.offset|), 9367#(= 0 |ldv_malloc_#res.offset|), 9368#(= 0 |ldv_kobject_create_#t~ret17.offset|), 9369#(= 0 ldv_kobject_create_~kobj~1.offset), 9370#(or (<= (+ |#Ultimate.C_memset_#ptr.offset| |#Ultimate.C_memset_#amount|) (select |#length| |#Ultimate.C_memset_#ptr.base|)) (not (= |#Ultimate.C_memset_#ptr.offset| 0))), 9371#(and (= 0 ldv_kobject_create_~kobj~1.offset) (<= 16 (select |#length| ldv_kobject_create_~kobj~1.base))), 9372#(and (= 0 |ldv_kobject_init_#in~kobj.offset|) (<= 16 (select |#length| |ldv_kobject_init_#in~kobj.base|))), 9373#(and (= 0 ldv_kobject_init_~kobj.offset) (<= 16 (select |#length| ldv_kobject_init_~kobj.base))), 9374#(and (<= 16 (select |#length| |ldv_kobject_init_internal_#in~kobj.base|)) (= 0 |ldv_kobject_init_internal_#in~kobj.offset|)), 9375#(and (<= 16 (select |#length| ldv_kobject_init_internal_~kobj.base)) (= ldv_kobject_init_internal_~kobj.offset 0))] [2018-02-02 10:48:34,987 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:34,987 INFO L409 AbstractCegarLoop]: Interpolant automaton has 14 states [2018-02-02 10:48:34,987 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2018-02-02 10:48:34,987 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=156, Unknown=0, NotChecked=0, Total=182 [2018-02-02 10:48:34,987 INFO L87 Difference]: Start difference. First operand 158 states and 165 transitions. Second operand 14 states. [2018-02-02 10:48:35,212 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 10:48:35,212 INFO L93 Difference]: Finished difference Result 156 states and 163 transitions. [2018-02-02 10:48:35,212 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2018-02-02 10:48:35,212 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 55 [2018-02-02 10:48:35,212 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 10:48:35,213 INFO L225 Difference]: With dead ends: 156 [2018-02-02 10:48:35,213 INFO L226 Difference]: Without dead ends: 156 [2018-02-02 10:48:35,213 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:35,214 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 156 states. [2018-02-02 10:48:35,215 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 156 to 156. [2018-02-02 10:48:35,216 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 156 states. [2018-02-02 10:48:35,216 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 156 states to 156 states and 163 transitions. [2018-02-02 10:48:35,216 INFO L78 Accepts]: Start accepts. Automaton has 156 states and 163 transitions. Word has length 55 [2018-02-02 10:48:35,216 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 10:48:35,216 INFO L432 AbstractCegarLoop]: Abstraction has 156 states and 163 transitions. [2018-02-02 10:48:35,216 INFO L433 AbstractCegarLoop]: Interpolant automaton has 14 states. [2018-02-02 10:48:35,217 INFO L276 IsEmpty]: Start isEmpty. Operand 156 states and 163 transitions. [2018-02-02 10:48:35,217 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2018-02-02 10:48:35,217 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 10:48:35,217 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:35,217 INFO L371 AbstractCegarLoop]: === Iteration 28 === [ldv_kref_initErr0RequiresViolation, ldv_kref_initErr1RequiresViolation, ldv_kobject_createErr0RequiresViolation, ldv_kobject_createErr1RequiresViolation, ldv_atomic_sub_returnErr1RequiresViolation, ldv_atomic_sub_returnErr0RequiresViolation, ldv_atomic_sub_returnErr3RequiresViolation, ldv_atomic_sub_returnErr2RequiresViolation, ldv_atomic_add_returnErr0RequiresViolation, ldv_atomic_add_returnErr1RequiresViolation, ldv_atomic_add_returnErr2RequiresViolation, ldv_atomic_add_returnErr3RequiresViolation, ldv_kobject_cleanupErr4RequiresViolation, ldv_kobject_cleanupErr2RequiresViolation, ldv_kobject_cleanupErr5RequiresViolation, ldv_kobject_cleanupErr3RequiresViolation, ldv_kobject_cleanupErr0RequiresViolation, ldv_kobject_cleanupErr1RequiresViolation, mainErr0EnsuresViolation, LDV_INIT_LIST_HEADErr1RequiresViolation, LDV_INIT_LIST_HEADErr3RequiresViolation, LDV_INIT_LIST_HEADErr2RequiresViolation, LDV_INIT_LIST_HEADErr0RequiresViolation]=== [2018-02-02 10:48:35,217 INFO L82 PathProgramCache]: Analyzing trace with hash -1509185372, now seen corresponding path program 1 times [2018-02-02 10:48:35,218 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 10:48:35,231 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 10:48:35,232 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:35,284 INFO L134 CoverageAnalysis]: Checked inductivity of 136 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 136 trivial. 0 not checked. [2018-02-02 10:48:35,285 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-02 10:48:35,285 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2018-02-02 10:48:35,285 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 10:48:35,285 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 10:48:35,285 INFO L182 omatonBuilderFactory]: Interpolants [9698#true, 9699#false, 9700#(not (= |ldv_malloc_#t~malloc4.base| 0)), 9701#(not (= |ldv_malloc_#res.base| 0)), 9702#(not (= |ldv_kobject_create_#t~ret17.base| 0)), 9703#(not (= ldv_kobject_create_~kobj~1.base 0)), 9704#(= ldv_kobject_init_~kobj.base |ldv_kobject_init_#in~kobj.base|), 9705#(= 0 |ldv_kobject_init_#in~kobj.base|)] [2018-02-02 10:48:35,285 INFO L134 CoverageAnalysis]: Checked inductivity of 136 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 136 trivial. 0 not checked. [2018-02-02 10:48:35,285 INFO L409 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-02-02 10:48:35,285 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-02-02 10:48:35,285 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2018-02-02 10:48:35,286 INFO L87 Difference]: Start difference. First operand 156 states and 163 transitions. Second operand 8 states. [2018-02-02 10:48:35,313 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 10:48:35,313 INFO L93 Difference]: Finished difference Result 158 states and 164 transitions. [2018-02-02 10:48:35,313 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-02-02 10:48:35,313 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 60 [2018-02-02 10:48:35,313 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 10:48:35,314 INFO L225 Difference]: With dead ends: 158 [2018-02-02 10:48:35,314 INFO L226 Difference]: Without dead ends: 156 [2018-02-02 10:48:35,314 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:35,314 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 156 states. [2018-02-02 10:48:35,315 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 156 to 156. [2018-02-02 10:48:35,315 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 156 states. [2018-02-02 10:48:35,316 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 156 states to 156 states and 162 transitions. [2018-02-02 10:48:35,316 INFO L78 Accepts]: Start accepts. Automaton has 156 states and 162 transitions. Word has length 60 [2018-02-02 10:48:35,316 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 10:48:35,316 INFO L432 AbstractCegarLoop]: Abstraction has 156 states and 162 transitions. [2018-02-02 10:48:35,316 INFO L433 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-02-02 10:48:35,316 INFO L276 IsEmpty]: Start isEmpty. Operand 156 states and 162 transitions. [2018-02-02 10:48:35,316 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2018-02-02 10:48:35,316 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 10:48:35,316 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:35,316 INFO L371 AbstractCegarLoop]: === Iteration 29 === [ldv_kref_initErr0RequiresViolation, ldv_kref_initErr1RequiresViolation, ldv_kobject_createErr0RequiresViolation, ldv_kobject_createErr1RequiresViolation, ldv_atomic_sub_returnErr1RequiresViolation, ldv_atomic_sub_returnErr0RequiresViolation, ldv_atomic_sub_returnErr3RequiresViolation, ldv_atomic_sub_returnErr2RequiresViolation, ldv_atomic_add_returnErr0RequiresViolation, ldv_atomic_add_returnErr1RequiresViolation, ldv_atomic_add_returnErr2RequiresViolation, ldv_atomic_add_returnErr3RequiresViolation, ldv_kobject_cleanupErr4RequiresViolation, ldv_kobject_cleanupErr2RequiresViolation, ldv_kobject_cleanupErr5RequiresViolation, ldv_kobject_cleanupErr3RequiresViolation, ldv_kobject_cleanupErr0RequiresViolation, ldv_kobject_cleanupErr1RequiresViolation, mainErr0EnsuresViolation, LDV_INIT_LIST_HEADErr1RequiresViolation, LDV_INIT_LIST_HEADErr3RequiresViolation, LDV_INIT_LIST_HEADErr2RequiresViolation, LDV_INIT_LIST_HEADErr0RequiresViolation]=== [2018-02-02 10:48:35,317 INFO L82 PathProgramCache]: Analyzing trace with hash -1200464284, now seen corresponding path program 1 times [2018-02-02 10:48:35,317 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 10:48:35,326 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 10:48:35,327 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:35,401 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:35,402 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-02 10:48:35,402 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2018-02-02 10:48:35,402 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 10:48:35,402 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 10:48:35,402 INFO L182 omatonBuilderFactory]: Interpolants [10032#(= 0 |ldv_kobject_init_internal_#in~kobj.base|), 10033#(= 0 |ldv_kobject_init_#in~kobj.base|), 10024#true, 10025#false, 10026#(not (= |ldv_malloc_#t~malloc4.base| 0)), 10027#(not (= |ldv_malloc_#res.base| 0)), 10028#(not (= |ldv_kobject_create_#t~ret17.base| 0)), 10029#(not (= ldv_kobject_create_~kobj~1.base 0)), 10030#(= ldv_kobject_init_~kobj.base |ldv_kobject_init_#in~kobj.base|), 10031#(= ldv_kobject_init_internal_~kobj.base |ldv_kobject_init_internal_#in~kobj.base|)] [2018-02-02 10:48:35,402 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:35,403 INFO L409 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-02-02 10:48:35,403 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-02-02 10:48:35,403 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=73, Unknown=0, NotChecked=0, Total=90 [2018-02-02 10:48:35,403 INFO L87 Difference]: Start difference. First operand 156 states and 162 transitions. Second operand 10 states. [2018-02-02 10:48:35,464 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 10:48:35,464 INFO L93 Difference]: Finished difference Result 160 states and 165 transitions. [2018-02-02 10:48:35,467 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-02-02 10:48:35,467 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 65 [2018-02-02 10:48:35,467 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 10:48:35,468 INFO L225 Difference]: With dead ends: 160 [2018-02-02 10:48:35,468 INFO L226 Difference]: Without dead ends: 156 [2018-02-02 10:48:35,468 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:35,468 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 156 states. [2018-02-02 10:48:35,470 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 156 to 156. [2018-02-02 10:48:35,471 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 156 states. [2018-02-02 10:48:35,471 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 156 states to 156 states and 161 transitions. [2018-02-02 10:48:35,471 INFO L78 Accepts]: Start accepts. Automaton has 156 states and 161 transitions. Word has length 65 [2018-02-02 10:48:35,472 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 10:48:35,472 INFO L432 AbstractCegarLoop]: Abstraction has 156 states and 161 transitions. [2018-02-02 10:48:35,472 INFO L433 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-02-02 10:48:35,472 INFO L276 IsEmpty]: Start isEmpty. Operand 156 states and 161 transitions. [2018-02-02 10:48:35,472 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 77 [2018-02-02 10:48:35,472 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 10:48:35,473 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:35,473 INFO L371 AbstractCegarLoop]: === Iteration 30 === [ldv_kref_initErr0RequiresViolation, ldv_kref_initErr1RequiresViolation, ldv_kobject_createErr0RequiresViolation, ldv_kobject_createErr1RequiresViolation, ldv_atomic_sub_returnErr1RequiresViolation, ldv_atomic_sub_returnErr0RequiresViolation, ldv_atomic_sub_returnErr3RequiresViolation, ldv_atomic_sub_returnErr2RequiresViolation, ldv_atomic_add_returnErr0RequiresViolation, ldv_atomic_add_returnErr1RequiresViolation, ldv_atomic_add_returnErr2RequiresViolation, ldv_atomic_add_returnErr3RequiresViolation, ldv_kobject_cleanupErr4RequiresViolation, ldv_kobject_cleanupErr2RequiresViolation, ldv_kobject_cleanupErr5RequiresViolation, ldv_kobject_cleanupErr3RequiresViolation, ldv_kobject_cleanupErr0RequiresViolation, ldv_kobject_cleanupErr1RequiresViolation, mainErr0EnsuresViolation, LDV_INIT_LIST_HEADErr1RequiresViolation, LDV_INIT_LIST_HEADErr3RequiresViolation, LDV_INIT_LIST_HEADErr2RequiresViolation, LDV_INIT_LIST_HEADErr0RequiresViolation]=== [2018-02-02 10:48:35,473 INFO L82 PathProgramCache]: Analyzing trace with hash -801417679, now seen corresponding path program 1 times [2018-02-02 10:48:35,474 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 10:48:35,489 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 10:48:35,490 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:35,603 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:35,603 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-02 10:48:35,603 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2018-02-02 10:48:35,603 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 10:48:35,603 INFO 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:35,604 INFO L182 omatonBuilderFactory]: Interpolants [10368#(= 1 (select |#valid| ldv_kref_get_~kref.base)), 10369#(= 1 (select |#valid| |ldv_atomic_add_return_#in~v.base|)), 10370#(= 1 (select |#valid| ldv_atomic_add_return_~v.base)), 10356#true, 10357#false, 10358#(= 1 (select |#valid| |#Ultimate.C_memset_#ptr.base|)), 10359#(= 1 (select |#valid| ldv_kobject_create_~kobj~1.base)), 10360#(= 1 (select |#valid| |ldv_kobject_create_#res.base|)), 10361#(= 1 (select |#valid| |entry_point_#t~ret20.base|)), 10362#(= 1 (select |#valid| entry_point_~kobj~2.base)), 10363#(= 1 (select |#valid| |f_22_get_#in~kobj.base|)), 10364#(= 1 (select |#valid| f_22_get_~kobj.base)), 10365#(= 1 (select |#valid| |ldv_kobject_get_#in~kobj.base|)), 10366#(= 1 (select |#valid| ldv_kobject_get_~kobj.base)), 10367#(= 1 (select |#valid| |ldv_kref_get_#in~kref.base|))] [2018-02-02 10:48:35,604 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:35,604 INFO L409 AbstractCegarLoop]: Interpolant automaton has 15 states [2018-02-02 10:48:35,604 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2018-02-02 10:48:35,604 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=183, Unknown=0, NotChecked=0, Total=210 [2018-02-02 10:48:35,604 INFO L87 Difference]: Start difference. First operand 156 states and 161 transitions. Second operand 15 states. [2018-02-02 10:48:35,872 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 10:48:35,872 INFO L93 Difference]: Finished difference Result 154 states and 159 transitions. [2018-02-02 10:48:35,873 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2018-02-02 10:48:35,873 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 76 [2018-02-02 10:48:35,873 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 10:48:35,874 INFO L225 Difference]: With dead ends: 154 [2018-02-02 10:48:35,874 INFO L226 Difference]: Without dead ends: 154 [2018-02-02 10:48:35,874 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=47, Invalid=333, Unknown=0, NotChecked=0, Total=380 [2018-02-02 10:48:35,875 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 154 states. [2018-02-02 10:48:35,877 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 154 to 154. [2018-02-02 10:48:35,877 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 154 states. [2018-02-02 10:48:35,877 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 154 states to 154 states and 159 transitions. [2018-02-02 10:48:35,878 INFO L78 Accepts]: Start accepts. Automaton has 154 states and 159 transitions. Word has length 76 [2018-02-02 10:48:35,878 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 10:48:35,878 INFO L432 AbstractCegarLoop]: Abstraction has 154 states and 159 transitions. [2018-02-02 10:48:35,878 INFO L433 AbstractCegarLoop]: Interpolant automaton has 15 states. [2018-02-02 10:48:35,878 INFO L276 IsEmpty]: Start isEmpty. Operand 154 states and 159 transitions. [2018-02-02 10:48:35,879 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 77 [2018-02-02 10:48:35,879 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 10:48:35,879 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:35,879 INFO L371 AbstractCegarLoop]: === Iteration 31 === [ldv_kref_initErr0RequiresViolation, ldv_kref_initErr1RequiresViolation, ldv_kobject_createErr0RequiresViolation, ldv_kobject_createErr1RequiresViolation, ldv_atomic_sub_returnErr1RequiresViolation, ldv_atomic_sub_returnErr0RequiresViolation, ldv_atomic_sub_returnErr3RequiresViolation, ldv_atomic_sub_returnErr2RequiresViolation, ldv_atomic_add_returnErr0RequiresViolation, ldv_atomic_add_returnErr1RequiresViolation, ldv_atomic_add_returnErr2RequiresViolation, ldv_atomic_add_returnErr3RequiresViolation, ldv_kobject_cleanupErr4RequiresViolation, ldv_kobject_cleanupErr2RequiresViolation, ldv_kobject_cleanupErr5RequiresViolation, ldv_kobject_cleanupErr3RequiresViolation, ldv_kobject_cleanupErr0RequiresViolation, ldv_kobject_cleanupErr1RequiresViolation, mainErr0EnsuresViolation, LDV_INIT_LIST_HEADErr1RequiresViolation, LDV_INIT_LIST_HEADErr3RequiresViolation, LDV_INIT_LIST_HEADErr2RequiresViolation, LDV_INIT_LIST_HEADErr0RequiresViolation]=== [2018-02-02 10:48:35,879 INFO L82 PathProgramCache]: Analyzing trace with hash -801417678, now seen corresponding path program 1 times [2018-02-02 10:48:35,880 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 10:48:35,896 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 10:48:35,896 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:36,149 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:36,149 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-02 10:48:36,150 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [18] imperfect sequences [] total 18 [2018-02-02 10:48:36,150 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 10:48:36,150 INFO 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:36,150 INFO L182 omatonBuilderFactory]: Interpolants [10689#true, 10690#false, 10691#(= 0 |ldv_malloc_#t~malloc4.offset|), 10692#(= 0 |ldv_malloc_#res.offset|), 10693#(= 0 |ldv_kobject_create_#t~ret17.offset|), 10694#(= 0 ldv_kobject_create_~kobj~1.offset), 10695#(or (<= (+ |#Ultimate.C_memset_#ptr.offset| |#Ultimate.C_memset_#amount|) (select |#length| |#Ultimate.C_memset_#ptr.base|)) (not (= |#Ultimate.C_memset_#ptr.offset| 0))), 10696#(and (= 0 ldv_kobject_create_~kobj~1.offset) (<= 16 (select |#length| ldv_kobject_create_~kobj~1.base))), 10697#(and (= 0 |ldv_kobject_create_#res.offset|) (<= 16 (select |#length| |ldv_kobject_create_#res.base|))), 10698#(and (<= 16 (select |#length| |entry_point_#t~ret20.base|)) (= 0 |entry_point_#t~ret20.offset|)), 10699#(and (= 0 entry_point_~kobj~2.offset) (<= 16 (select |#length| entry_point_~kobj~2.base))), 10700#(and (= 0 |f_22_get_#in~kobj.offset|) (<= 16 (select |#length| |f_22_get_#in~kobj.base|))), 10701#(and (= 0 f_22_get_~kobj.offset) (<= 16 (select |#length| f_22_get_~kobj.base))), 10702#(and (<= 16 (select |#length| |ldv_kobject_get_#in~kobj.base|)) (= 0 |ldv_kobject_get_#in~kobj.offset|)), 10703#(and (<= 16 (select |#length| ldv_kobject_get_~kobj.base)) (= ldv_kobject_get_~kobj.offset 0)), 10704#(and (<= 12 |ldv_kref_get_#in~kref.offset|) (<= (+ |ldv_kref_get_#in~kref.offset| 4) (select |#length| |ldv_kref_get_#in~kref.base|))), 10705#(and (<= 12 ldv_kref_get_~kref.offset) (<= (+ ldv_kref_get_~kref.offset 4) (select |#length| ldv_kref_get_~kref.base))), 10706#(and (<= 12 |ldv_atomic_add_return_#in~v.offset|) (<= (+ |ldv_atomic_add_return_#in~v.offset| 4) (select |#length| |ldv_atomic_add_return_#in~v.base|))), 10707#(and (<= 12 ldv_atomic_add_return_~v.offset) (<= (+ ldv_atomic_add_return_~v.offset 4) (select |#length| ldv_atomic_add_return_~v.base)))] [2018-02-02 10:48:36,150 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:36,151 INFO L409 AbstractCegarLoop]: Interpolant automaton has 19 states [2018-02-02 10:48:36,151 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2018-02-02 10:48:36,151 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=306, Unknown=0, NotChecked=0, Total=342 [2018-02-02 10:48:36,151 INFO L87 Difference]: Start difference. First operand 154 states and 159 transitions. Second operand 19 states. [2018-02-02 10:48:36,565 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 10:48:36,565 INFO L93 Difference]: Finished difference Result 152 states and 157 transitions. [2018-02-02 10:48:36,566 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2018-02-02 10:48:36,566 INFO L78 Accepts]: Start accepts. Automaton has 19 states. Word has length 76 [2018-02-02 10:48:36,566 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 10:48:36,566 INFO L225 Difference]: With dead ends: 152 [2018-02-02 10:48:36,567 INFO L226 Difference]: Without dead ends: 152 [2018-02-02 10:48:36,567 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:36,567 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 152 states. [2018-02-02 10:48:36,568 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 152 to 152. [2018-02-02 10:48:36,568 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 152 states. [2018-02-02 10:48:36,569 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 152 states to 152 states and 157 transitions. [2018-02-02 10:48:36,569 INFO L78 Accepts]: Start accepts. Automaton has 152 states and 157 transitions. Word has length 76 [2018-02-02 10:48:36,569 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 10:48:36,569 INFO L432 AbstractCegarLoop]: Abstraction has 152 states and 157 transitions. [2018-02-02 10:48:36,569 INFO L433 AbstractCegarLoop]: Interpolant automaton has 19 states. [2018-02-02 10:48:36,569 INFO L276 IsEmpty]: Start isEmpty. Operand 152 states and 157 transitions. [2018-02-02 10:48:36,569 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 90 [2018-02-02 10:48:36,569 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 10:48:36,570 INFO L351 BasicCegarLoop]: trace histogram [16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-02 10:48:36,570 INFO L371 AbstractCegarLoop]: === Iteration 32 === [ldv_kref_initErr0RequiresViolation, ldv_kref_initErr1RequiresViolation, ldv_kobject_createErr0RequiresViolation, ldv_kobject_createErr1RequiresViolation, ldv_atomic_sub_returnErr1RequiresViolation, ldv_atomic_sub_returnErr0RequiresViolation, ldv_atomic_sub_returnErr3RequiresViolation, ldv_atomic_sub_returnErr2RequiresViolation, ldv_atomic_add_returnErr0RequiresViolation, ldv_atomic_add_returnErr1RequiresViolation, ldv_atomic_add_returnErr2RequiresViolation, ldv_atomic_add_returnErr3RequiresViolation, ldv_kobject_cleanupErr4RequiresViolation, ldv_kobject_cleanupErr2RequiresViolation, ldv_kobject_cleanupErr5RequiresViolation, ldv_kobject_cleanupErr3RequiresViolation, ldv_kobject_cleanupErr0RequiresViolation, ldv_kobject_cleanupErr1RequiresViolation, mainErr0EnsuresViolation, LDV_INIT_LIST_HEADErr1RequiresViolation, LDV_INIT_LIST_HEADErr3RequiresViolation, LDV_INIT_LIST_HEADErr2RequiresViolation, LDV_INIT_LIST_HEADErr0RequiresViolation]=== [2018-02-02 10:48:36,570 INFO L82 PathProgramCache]: Analyzing trace with hash 18163484, now seen corresponding path program 1 times [2018-02-02 10:48:36,570 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 10:48:36,579 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 10:48:36,580 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:36,643 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:36,643 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-02 10:48:36,643 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2018-02-02 10:48:36,644 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 10:48:36,644 INFO 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:36,644 INFO L182 omatonBuilderFactory]: Interpolants [11024#true, 11025#false, 11026#(not (= |ldv_malloc_#t~malloc4.base| 0)), 11027#(not (= |ldv_malloc_#res.base| 0)), 11028#(not (= |ldv_kobject_create_#t~ret17.base| 0)), 11029#(not (= ldv_kobject_create_~kobj~1.base 0)), 11030#(not (= |ldv_kobject_create_#res.base| 0)), 11031#(not (= |entry_point_#t~ret20.base| 0)), 11032#(not (= entry_point_~kobj~2.base 0)), 11033#(= f_22_get_~kobj.base |f_22_get_#in~kobj.base|), 11034#(= ldv_kobject_get_~kobj.base |ldv_kobject_get_#in~kobj.base|), 11035#(= 0 |ldv_kobject_get_#in~kobj.base|), 11036#(= 0 |f_22_get_#in~kobj.base|)] [2018-02-02 10:48:36,644 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:36,644 INFO L409 AbstractCegarLoop]: Interpolant automaton has 13 states [2018-02-02 10:48:36,644 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2018-02-02 10:48:36,644 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=133, Unknown=0, NotChecked=0, Total=156 [2018-02-02 10:48:36,644 INFO L87 Difference]: Start difference. First operand 152 states and 157 transitions. Second operand 13 states. [2018-02-02 10:48:36,706 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 10:48:36,706 INFO L93 Difference]: Finished difference Result 158 states and 162 transitions. [2018-02-02 10:48:36,707 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2018-02-02 10:48:36,707 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 89 [2018-02-02 10:48:36,707 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 10:48:36,707 INFO L225 Difference]: With dead ends: 158 [2018-02-02 10:48:36,707 INFO L226 Difference]: Without dead ends: 152 [2018-02-02 10:48:36,707 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=39, Invalid=233, Unknown=0, NotChecked=0, Total=272 [2018-02-02 10:48:36,708 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 152 states. [2018-02-02 10:48:36,708 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 152 to 152. [2018-02-02 10:48:36,709 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 152 states. [2018-02-02 10:48:36,709 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 152 states to 152 states and 156 transitions. [2018-02-02 10:48:36,709 INFO L78 Accepts]: Start accepts. Automaton has 152 states and 156 transitions. Word has length 89 [2018-02-02 10:48:36,709 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 10:48:36,709 INFO L432 AbstractCegarLoop]: Abstraction has 152 states and 156 transitions. [2018-02-02 10:48:36,709 INFO L433 AbstractCegarLoop]: Interpolant automaton has 13 states. [2018-02-02 10:48:36,709 INFO L276 IsEmpty]: Start isEmpty. Operand 152 states and 156 transitions. [2018-02-02 10:48:36,710 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 103 [2018-02-02 10:48:36,710 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 10:48:36,710 INFO L351 BasicCegarLoop]: trace histogram [16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-02 10:48:36,710 INFO L371 AbstractCegarLoop]: === Iteration 33 === [ldv_kref_initErr0RequiresViolation, ldv_kref_initErr1RequiresViolation, ldv_kobject_createErr0RequiresViolation, ldv_kobject_createErr1RequiresViolation, ldv_atomic_sub_returnErr1RequiresViolation, ldv_atomic_sub_returnErr0RequiresViolation, ldv_atomic_sub_returnErr3RequiresViolation, ldv_atomic_sub_returnErr2RequiresViolation, ldv_atomic_add_returnErr0RequiresViolation, ldv_atomic_add_returnErr1RequiresViolation, ldv_atomic_add_returnErr2RequiresViolation, ldv_atomic_add_returnErr3RequiresViolation, ldv_kobject_cleanupErr4RequiresViolation, ldv_kobject_cleanupErr2RequiresViolation, ldv_kobject_cleanupErr5RequiresViolation, ldv_kobject_cleanupErr3RequiresViolation, ldv_kobject_cleanupErr0RequiresViolation, ldv_kobject_cleanupErr1RequiresViolation, mainErr0EnsuresViolation, LDV_INIT_LIST_HEADErr1RequiresViolation, LDV_INIT_LIST_HEADErr3RequiresViolation, LDV_INIT_LIST_HEADErr2RequiresViolation, LDV_INIT_LIST_HEADErr0RequiresViolation]=== [2018-02-02 10:48:36,710 INFO L82 PathProgramCache]: Analyzing trace with hash -1782732078, now seen corresponding path program 1 times [2018-02-02 10:48:36,711 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 10:48:36,720 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 10:48:36,721 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:36,920 INFO L134 CoverageAnalysis]: Checked inductivity of 136 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 136 trivial. 0 not checked. [2018-02-02 10:48:36,921 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-02 10:48:36,921 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [21] imperfect sequences [] total 21 [2018-02-02 10:48:36,921 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 10:48:36,921 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 10:48:36,921 INFO L182 omatonBuilderFactory]: Interpolants [11360#(= ldv_atomic_add_return_~v.base |ldv_atomic_add_return_#in~v.base|), 11361#(and (= 1 (select |#valid| ldv_atomic_add_return_~v.base)) (= ldv_atomic_add_return_~v.base |ldv_atomic_add_return_#in~v.base|)), 11362#(= 1 (select |#valid| |ldv_atomic_add_return_#in~v.base|)), 11363#(= 1 (select |#valid| |ldv_kref_get_#in~kref.base|)), 11364#(= 1 (select |#valid| |ldv_kobject_get_#in~kobj.base|)), 11365#(= 1 (select |#valid| |f_22_get_#in~kobj.base|)), 11366#(= 1 (select |#valid| entry_point_~kobj~2.base)), 11367#(= 1 (select |#valid| |f_22_put_#in~kobj.base|)), 11368#(= 1 (select |#valid| f_22_put_~kobj.base)), 11369#(= 1 (select |#valid| |ldv_kobject_put_#in~kobj.base|)), 11370#(= 1 (select |#valid| ldv_kobject_put_~kobj.base)), 11371#(= 1 (select |#valid| |ldv_kref_put_#in~kref.base|)), 11372#(= 1 (select |#valid| ldv_kref_put_~kref.base)), 11373#(= 1 (select |#valid| |ldv_kref_sub_#in~kref.base|)), 11374#(= 1 (select |#valid| ldv_kref_sub_~kref.base)), 11375#(= 1 (select |#valid| |ldv_atomic_sub_return_#in~v.base|)), 11376#(= 1 (select |#valid| ldv_atomic_sub_return_~v.base)), 11355#true, 11356#false, 11357#(= f_22_get_~kobj.base |f_22_get_#in~kobj.base|), 11358#(= ldv_kobject_get_~kobj.base |ldv_kobject_get_#in~kobj.base|), 11359#(= ldv_kref_get_~kref.base |ldv_kref_get_#in~kref.base|)] [2018-02-02 10:48:36,922 INFO L134 CoverageAnalysis]: Checked inductivity of 136 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 136 trivial. 0 not checked. [2018-02-02 10:48:36,922 INFO L409 AbstractCegarLoop]: Interpolant automaton has 22 states [2018-02-02 10:48:36,922 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2018-02-02 10:48:36,922 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=43, Invalid=419, Unknown=0, NotChecked=0, Total=462 [2018-02-02 10:48:36,922 INFO L87 Difference]: Start difference. First operand 152 states and 156 transitions. Second operand 22 states. [2018-02-02 10:48:37,281 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 10:48:37,281 INFO L93 Difference]: Finished difference Result 179 states and 188 transitions. [2018-02-02 10:48:37,281 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2018-02-02 10:48:37,282 INFO L78 Accepts]: Start accepts. Automaton has 22 states. Word has length 102 [2018-02-02 10:48:37,282 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 10:48:37,282 INFO L225 Difference]: With dead ends: 179 [2018-02-02 10:48:37,282 INFO L226 Difference]: Without dead ends: 179 [2018-02-02 10:48:37,283 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 29 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 65 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=75, Invalid=795, Unknown=0, NotChecked=0, Total=870 [2018-02-02 10:48:37,283 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 179 states. [2018-02-02 10:48:37,286 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 179 to 174. [2018-02-02 10:48:37,286 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 174 states. [2018-02-02 10:48:37,287 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 174 states to 174 states and 184 transitions. [2018-02-02 10:48:37,287 INFO L78 Accepts]: Start accepts. Automaton has 174 states and 184 transitions. Word has length 102 [2018-02-02 10:48:37,287 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 10:48:37,287 INFO L432 AbstractCegarLoop]: Abstraction has 174 states and 184 transitions. [2018-02-02 10:48:37,287 INFO L433 AbstractCegarLoop]: Interpolant automaton has 22 states. [2018-02-02 10:48:37,288 INFO L276 IsEmpty]: Start isEmpty. Operand 174 states and 184 transitions. [2018-02-02 10:48:37,288 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 103 [2018-02-02 10:48:37,288 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 10:48:37,288 INFO L351 BasicCegarLoop]: trace histogram [16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-02 10:48:37,288 INFO L371 AbstractCegarLoop]: === Iteration 34 === [ldv_kref_initErr0RequiresViolation, ldv_kref_initErr1RequiresViolation, ldv_kobject_createErr0RequiresViolation, ldv_kobject_createErr1RequiresViolation, ldv_atomic_sub_returnErr1RequiresViolation, ldv_atomic_sub_returnErr0RequiresViolation, ldv_atomic_sub_returnErr3RequiresViolation, ldv_atomic_sub_returnErr2RequiresViolation, ldv_atomic_add_returnErr0RequiresViolation, ldv_atomic_add_returnErr1RequiresViolation, ldv_atomic_add_returnErr2RequiresViolation, ldv_atomic_add_returnErr3RequiresViolation, ldv_kobject_cleanupErr4RequiresViolation, ldv_kobject_cleanupErr2RequiresViolation, ldv_kobject_cleanupErr5RequiresViolation, ldv_kobject_cleanupErr3RequiresViolation, ldv_kobject_cleanupErr0RequiresViolation, ldv_kobject_cleanupErr1RequiresViolation, mainErr0EnsuresViolation, LDV_INIT_LIST_HEADErr1RequiresViolation, LDV_INIT_LIST_HEADErr3RequiresViolation, LDV_INIT_LIST_HEADErr2RequiresViolation, LDV_INIT_LIST_HEADErr0RequiresViolation]=== [2018-02-02 10:48:37,289 INFO L82 PathProgramCache]: Analyzing trace with hash -1782732077, now seen corresponding path program 1 times [2018-02-02 10:48:37,290 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 10:48:37,308 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 10:48:37,310 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:37,620 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:37,620 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-02 10:48:37,620 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [20] imperfect sequences [] total 20 [2018-02-02 10:48:37,620 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 10:48:37,621 INFO 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:37,621 INFO L182 omatonBuilderFactory]: Interpolants [11746#true, 11747#false, 11748#(= 0 |ldv_malloc_#t~malloc4.offset|), 11749#(= 0 |ldv_malloc_#res.offset|), 11750#(= 0 |ldv_kobject_create_#t~ret17.offset|), 11751#(= 0 ldv_kobject_create_~kobj~1.offset), 11752#(or (<= (+ |#Ultimate.C_memset_#ptr.offset| |#Ultimate.C_memset_#amount|) (select |#length| |#Ultimate.C_memset_#ptr.base|)) (not (= |#Ultimate.C_memset_#ptr.offset| 0))), 11753#(and (= 0 ldv_kobject_create_~kobj~1.offset) (<= 16 (select |#length| ldv_kobject_create_~kobj~1.base))), 11754#(and (= 0 |ldv_kobject_create_#res.offset|) (<= 16 (select |#length| |ldv_kobject_create_#res.base|))), 11755#(and (<= 16 (select |#length| |entry_point_#t~ret20.base|)) (= 0 |entry_point_#t~ret20.offset|)), 11756#(and (= 0 entry_point_~kobj~2.offset) (<= 16 (select |#length| entry_point_~kobj~2.base))), 11757#(and (<= 16 (select |#length| |f_22_put_#in~kobj.base|)) (= 0 |f_22_put_#in~kobj.offset|)), 11758#(and (= 0 f_22_put_~kobj.offset) (<= 16 (select |#length| f_22_put_~kobj.base))), 11759#(and (<= 16 (select |#length| |ldv_kobject_put_#in~kobj.base|)) (= 0 |ldv_kobject_put_#in~kobj.offset|)), 11760#(and (= ldv_kobject_put_~kobj.offset 0) (<= 16 (select |#length| ldv_kobject_put_~kobj.base))), 11761#(and (<= 12 |ldv_kref_put_#in~kref.offset|) (<= (+ |ldv_kref_put_#in~kref.offset| 4) (select |#length| |ldv_kref_put_#in~kref.base|))), 11762#(and (<= 12 ldv_kref_put_~kref.offset) (<= (+ ldv_kref_put_~kref.offset 4) (select |#length| ldv_kref_put_~kref.base))), 11763#(and (<= (+ |ldv_kref_sub_#in~kref.offset| 4) (select |#length| |ldv_kref_sub_#in~kref.base|)) (<= 12 |ldv_kref_sub_#in~kref.offset|)), 11764#(and (<= (+ ldv_kref_sub_~kref.offset 4) (select |#length| ldv_kref_sub_~kref.base)) (<= 12 ldv_kref_sub_~kref.offset)), 11765#(and (<= (+ |ldv_atomic_sub_return_#in~v.offset| 4) (select |#length| |ldv_atomic_sub_return_#in~v.base|)) (<= 12 |ldv_atomic_sub_return_#in~v.offset|)), 11766#(and (<= (+ ldv_atomic_sub_return_~v.offset 4) (select |#length| ldv_atomic_sub_return_~v.base)) (<= 12 ldv_atomic_sub_return_~v.offset))] [2018-02-02 10:48:37,621 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:37,621 INFO L409 AbstractCegarLoop]: Interpolant automaton has 21 states [2018-02-02 10:48:37,621 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2018-02-02 10:48:37,622 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=40, Invalid=380, Unknown=0, NotChecked=0, Total=420 [2018-02-02 10:48:37,622 INFO L87 Difference]: Start difference. First operand 174 states and 184 transitions. Second operand 21 states. [2018-02-02 10:48:37,983 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 10:48:37,983 INFO L93 Difference]: Finished difference Result 172 states and 180 transitions. [2018-02-02 10:48:37,983 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2018-02-02 10:48:37,984 INFO L78 Accepts]: Start accepts. Automaton has 21 states. Word has length 102 [2018-02-02 10:48:37,984 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 10:48:37,984 INFO L225 Difference]: With dead ends: 172 [2018-02-02 10:48:37,984 INFO L226 Difference]: Without dead ends: 172 [2018-02-02 10:48:37,984 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 40 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=69, Invalid=687, Unknown=0, NotChecked=0, Total=756 [2018-02-02 10:48:37,985 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 172 states. [2018-02-02 10:48:37,987 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 172 to 172. [2018-02-02 10:48:37,987 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 172 states. [2018-02-02 10:48:37,988 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 172 states to 172 states and 180 transitions. [2018-02-02 10:48:37,988 INFO L78 Accepts]: Start accepts. Automaton has 172 states and 180 transitions. Word has length 102 [2018-02-02 10:48:37,988 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 10:48:37,988 INFO L432 AbstractCegarLoop]: Abstraction has 172 states and 180 transitions. [2018-02-02 10:48:37,988 INFO L433 AbstractCegarLoop]: Interpolant automaton has 21 states. [2018-02-02 10:48:37,988 INFO L276 IsEmpty]: Start isEmpty. Operand 172 states and 180 transitions. [2018-02-02 10:48:37,989 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 110 [2018-02-02 10:48:37,989 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 10:48:37,989 INFO L351 BasicCegarLoop]: trace histogram [16, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-02 10:48:37,989 INFO L371 AbstractCegarLoop]: === Iteration 35 === [ldv_kref_initErr0RequiresViolation, ldv_kref_initErr1RequiresViolation, ldv_kobject_createErr0RequiresViolation, ldv_kobject_createErr1RequiresViolation, ldv_atomic_sub_returnErr1RequiresViolation, ldv_atomic_sub_returnErr0RequiresViolation, ldv_atomic_sub_returnErr3RequiresViolation, ldv_atomic_sub_returnErr2RequiresViolation, ldv_atomic_add_returnErr0RequiresViolation, ldv_atomic_add_returnErr1RequiresViolation, ldv_atomic_add_returnErr2RequiresViolation, ldv_atomic_add_returnErr3RequiresViolation, ldv_kobject_cleanupErr4RequiresViolation, ldv_kobject_cleanupErr2RequiresViolation, ldv_kobject_cleanupErr5RequiresViolation, ldv_kobject_cleanupErr3RequiresViolation, ldv_kobject_cleanupErr0RequiresViolation, ldv_kobject_cleanupErr1RequiresViolation, mainErr0EnsuresViolation, LDV_INIT_LIST_HEADErr1RequiresViolation, LDV_INIT_LIST_HEADErr3RequiresViolation, LDV_INIT_LIST_HEADErr2RequiresViolation, LDV_INIT_LIST_HEADErr0RequiresViolation]=== [2018-02-02 10:48:37,989 INFO L82 PathProgramCache]: Analyzing trace with hash -1973215805, now seen corresponding path program 1 times [2018-02-02 10:48:37,990 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 10:48:37,999 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 10:48:38,000 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 10:48:38,099 INFO L134 CoverageAnalysis]: Checked inductivity of 138 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 136 trivial. 0 not checked. [2018-02-02 10:48:38,099 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-02 10:48:38,099 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2018-02-02 10:48:38,100 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 10:48:38,100 INFO 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:38,100 INFO L182 omatonBuilderFactory]: Interpolants [12128#(not (= |ldv_malloc_#res.base| 0)), 12129#(not (= |ldv_kobject_create_#t~ret17.base| 0)), 12130#(not (= ldv_kobject_create_~kobj~1.base 0)), 12131#(not (= |ldv_kobject_create_#res.base| 0)), 12132#(not (= |entry_point_#t~ret20.base| 0)), 12133#(not (= entry_point_~kobj~2.base 0)), 12134#(= f_22_put_~kobj.base |f_22_put_#in~kobj.base|), 12135#(= ldv_kobject_put_~kobj.base |ldv_kobject_put_#in~kobj.base|), 12136#(= 0 |ldv_kobject_put_#in~kobj.base|), 12137#(= 0 |f_22_put_#in~kobj.base|), 12125#true, 12126#false, 12127#(not (= |ldv_malloc_#t~malloc4.base| 0))] [2018-02-02 10:48:38,100 INFO L134 CoverageAnalysis]: Checked inductivity of 138 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 136 trivial. 0 not checked. [2018-02-02 10:48:38,100 INFO L409 AbstractCegarLoop]: Interpolant automaton has 13 states [2018-02-02 10:48:38,101 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2018-02-02 10:48:38,101 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=133, Unknown=0, NotChecked=0, Total=156 [2018-02-02 10:48:38,101 INFO L87 Difference]: Start difference. First operand 172 states and 180 transitions. Second operand 13 states. [2018-02-02 10:48:38,183 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 10:48:38,183 INFO L93 Difference]: Finished difference Result 176 states and 182 transitions. [2018-02-02 10:48:38,183 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2018-02-02 10:48:38,183 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 109 [2018-02-02 10:48:38,184 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 10:48:38,184 INFO L225 Difference]: With dead ends: 176 [2018-02-02 10:48:38,184 INFO L226 Difference]: Without dead ends: 170 [2018-02-02 10:48:38,185 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=39, Invalid=233, Unknown=0, NotChecked=0, Total=272 [2018-02-02 10:48:38,185 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 170 states. [2018-02-02 10:48:38,187 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 170 to 170. [2018-02-02 10:48:38,187 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 170 states. [2018-02-02 10:48:38,188 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 170 states to 170 states and 176 transitions. [2018-02-02 10:48:38,188 INFO L78 Accepts]: Start accepts. Automaton has 170 states and 176 transitions. Word has length 109 [2018-02-02 10:48:38,188 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 10:48:38,188 INFO L432 AbstractCegarLoop]: Abstraction has 170 states and 176 transitions. [2018-02-02 10:48:38,188 INFO L433 AbstractCegarLoop]: Interpolant automaton has 13 states. [2018-02-02 10:48:38,188 INFO L276 IsEmpty]: Start isEmpty. Operand 170 states and 176 transitions. [2018-02-02 10:48:38,189 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 117 [2018-02-02 10:48:38,189 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 10:48:38,189 INFO L351 BasicCegarLoop]: trace histogram [16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-02 10:48:38,189 INFO L371 AbstractCegarLoop]: === Iteration 36 === [ldv_kref_initErr0RequiresViolation, ldv_kref_initErr1RequiresViolation, ldv_kobject_createErr0RequiresViolation, ldv_kobject_createErr1RequiresViolation, ldv_atomic_sub_returnErr1RequiresViolation, ldv_atomic_sub_returnErr0RequiresViolation, ldv_atomic_sub_returnErr3RequiresViolation, ldv_atomic_sub_returnErr2RequiresViolation, ldv_atomic_add_returnErr0RequiresViolation, ldv_atomic_add_returnErr1RequiresViolation, ldv_atomic_add_returnErr2RequiresViolation, ldv_atomic_add_returnErr3RequiresViolation, ldv_kobject_cleanupErr4RequiresViolation, ldv_kobject_cleanupErr2RequiresViolation, ldv_kobject_cleanupErr5RequiresViolation, ldv_kobject_cleanupErr3RequiresViolation, ldv_kobject_cleanupErr0RequiresViolation, ldv_kobject_cleanupErr1RequiresViolation, mainErr0EnsuresViolation, LDV_INIT_LIST_HEADErr1RequiresViolation, LDV_INIT_LIST_HEADErr3RequiresViolation, LDV_INIT_LIST_HEADErr2RequiresViolation, LDV_INIT_LIST_HEADErr0RequiresViolation]=== [2018-02-02 10:48:38,189 INFO L82 PathProgramCache]: Analyzing trace with hash 842639827, now seen corresponding path program 1 times [2018-02-02 10:48:38,190 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 10:48:38,205 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 10:48:38,206 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:38,505 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:38,506 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-02 10:48:38,506 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [24] imperfect sequences [] total 24 [2018-02-02 10:48:38,506 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 10:48:38,506 INFO 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:38,506 INFO L182 omatonBuilderFactory]: Interpolants [12492#true, 12493#false, 12494#(= f_22_get_~kobj.base |f_22_get_#in~kobj.base|), 12495#(= ldv_kobject_get_~kobj.base |ldv_kobject_get_#in~kobj.base|), 12496#(= ldv_kref_get_~kref.base |ldv_kref_get_#in~kref.base|), 12497#(= ldv_atomic_add_return_~v.base |ldv_atomic_add_return_#in~v.base|), 12498#(= 1 (select |#valid| |ldv_atomic_add_return_#in~v.base|)), 12499#(= 1 (select |#valid| |ldv_kref_get_#in~kref.base|)), 12500#(= 1 (select |#valid| |ldv_kobject_get_#in~kobj.base|)), 12501#(= 1 (select |#valid| |f_22_get_#in~kobj.base|)), 12502#(= 1 (select |#valid| entry_point_~kobj~2.base)), 12503#(= 1 (select |#valid| |f_22_put_#in~kobj.base|)), 12504#(= 1 (select |#valid| f_22_put_~kobj.base)), 12505#(= 1 (select |#valid| |ldv_kobject_put_#in~kobj.base|)), 12506#(= 1 (select |#valid| ldv_kobject_put_~kobj.base)), 12507#(= 1 (select |#valid| |ldv_kref_put_#in~kref.base|)), 12508#(= 1 (select |#valid| ldv_kref_put_~kref.base)), 12509#(= 1 (select |#valid| |ldv_kref_sub_#in~kref.base|)), 12510#(= 1 (select |#valid| ldv_kref_sub_~kref.base)), 12511#(= 1 (select |#valid| |##fun~$Pointer$~TO~VOID_#in~kref.base|)), 12512#(= 1 (select |#valid| |##fun~$Pointer$~TO~VOID_#~kref.base|)), 12513#(= 1 (select |#valid| |ldv_kobject_release_#in~kref.base|)), 12514#(= 1 (select |#valid| ldv_kobject_release_~kobj~0.base)), 12515#(= 1 (select |#valid| |ldv_kobject_cleanup_#in~kobj.base|)), 12516#(= 1 (select |#valid| ldv_kobject_cleanup_~kobj.base))] [2018-02-02 10:48:38,507 INFO L134 CoverageAnalysis]: Checked inductivity of 136 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 136 trivial. 0 not checked. [2018-02-02 10:48:38,507 INFO L409 AbstractCegarLoop]: Interpolant automaton has 25 states [2018-02-02 10:48:38,507 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2018-02-02 10:48:38,507 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=553, Unknown=0, NotChecked=0, Total=600 [2018-02-02 10:48:38,507 INFO L87 Difference]: Start difference. First operand 170 states and 176 transitions. Second operand 25 states. [2018-02-02 10:48:39,023 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 10:48:39,023 INFO L93 Difference]: Finished difference Result 180 states and 189 transitions. [2018-02-02 10:48:39,023 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2018-02-02 10:48:39,023 INFO L78 Accepts]: Start accepts. Automaton has 25 states. Word has length 116 [2018-02-02 10:48:39,024 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 10:48:39,024 INFO L225 Difference]: With dead ends: 180 [2018-02-02 10:48:39,024 INFO L226 Difference]: Without dead ends: 180 [2018-02-02 10:48:39,025 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 35 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 34 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 55 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=91, Invalid=1169, Unknown=0, NotChecked=0, Total=1260 [2018-02-02 10:48:39,025 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 180 states. [2018-02-02 10:48:39,027 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 180 to 176. [2018-02-02 10:48:39,027 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 176 states. [2018-02-02 10:48:39,028 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 176 states to 176 states and 186 transitions. [2018-02-02 10:48:39,028 INFO L78 Accepts]: Start accepts. Automaton has 176 states and 186 transitions. Word has length 116 [2018-02-02 10:48:39,028 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 10:48:39,028 INFO L432 AbstractCegarLoop]: Abstraction has 176 states and 186 transitions. [2018-02-02 10:48:39,028 INFO L433 AbstractCegarLoop]: Interpolant automaton has 25 states. [2018-02-02 10:48:39,028 INFO L276 IsEmpty]: Start isEmpty. Operand 176 states and 186 transitions. [2018-02-02 10:48:39,028 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 117 [2018-02-02 10:48:39,028 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 10:48:39,028 INFO L351 BasicCegarLoop]: trace histogram [16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-02 10:48:39,029 INFO L371 AbstractCegarLoop]: === Iteration 37 === [ldv_kref_initErr0RequiresViolation, ldv_kref_initErr1RequiresViolation, ldv_kobject_createErr0RequiresViolation, ldv_kobject_createErr1RequiresViolation, ldv_atomic_sub_returnErr1RequiresViolation, ldv_atomic_sub_returnErr0RequiresViolation, ldv_atomic_sub_returnErr3RequiresViolation, ldv_atomic_sub_returnErr2RequiresViolation, ldv_atomic_add_returnErr0RequiresViolation, ldv_atomic_add_returnErr1RequiresViolation, ldv_atomic_add_returnErr2RequiresViolation, ldv_atomic_add_returnErr3RequiresViolation, ldv_kobject_cleanupErr4RequiresViolation, ldv_kobject_cleanupErr2RequiresViolation, ldv_kobject_cleanupErr5RequiresViolation, ldv_kobject_cleanupErr3RequiresViolation, ldv_kobject_cleanupErr0RequiresViolation, ldv_kobject_cleanupErr1RequiresViolation, mainErr0EnsuresViolation, LDV_INIT_LIST_HEADErr1RequiresViolation, LDV_INIT_LIST_HEADErr3RequiresViolation, LDV_INIT_LIST_HEADErr2RequiresViolation, LDV_INIT_LIST_HEADErr0RequiresViolation]=== [2018-02-02 10:48:39,029 INFO L82 PathProgramCache]: Analyzing trace with hash 842639828, now seen corresponding path program 1 times [2018-02-02 10:48:39,029 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 10:48:39,043 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 10:48:39,044 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:39,416 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:39,416 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-02 10:48:39,416 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [24] imperfect sequences [] total 24 [2018-02-02 10:48:39,416 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 10:48:39,416 INFO 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:39,417 INFO L182 omatonBuilderFactory]: Interpolants [12895#true, 12896#false, 12897#(= 0 |ldv_malloc_#t~malloc4.offset|), 12898#(= 0 |ldv_malloc_#res.offset|), 12899#(= 0 |ldv_kobject_create_#t~ret17.offset|), 12900#(= 0 ldv_kobject_create_~kobj~1.offset), 12901#(or (<= (+ |#Ultimate.C_memset_#ptr.offset| |#Ultimate.C_memset_#amount|) (select |#length| |#Ultimate.C_memset_#ptr.base|)) (not (= |#Ultimate.C_memset_#ptr.offset| 0))), 12902#(and (= 0 ldv_kobject_create_~kobj~1.offset) (<= 16 (select |#length| ldv_kobject_create_~kobj~1.base))), 12903#(and (= 0 |ldv_kobject_create_#res.offset|) (<= 16 (select |#length| |ldv_kobject_create_#res.base|))), 12904#(and (<= 16 (select |#length| |entry_point_#t~ret20.base|)) (= 0 |entry_point_#t~ret20.offset|)), 12905#(and (= 0 entry_point_~kobj~2.offset) (<= 16 (select |#length| entry_point_~kobj~2.base))), 12906#(and (<= 16 (select |#length| |f_22_put_#in~kobj.base|)) (= 0 |f_22_put_#in~kobj.offset|)), 12907#(and (= 0 f_22_put_~kobj.offset) (<= 16 (select |#length| f_22_put_~kobj.base))), 12908#(and (<= 16 (select |#length| |ldv_kobject_put_#in~kobj.base|)) (= 0 |ldv_kobject_put_#in~kobj.offset|)), 12909#(and (= ldv_kobject_put_~kobj.offset 0) (<= 16 (select |#length| ldv_kobject_put_~kobj.base))), 12910#(and (<= 12 |ldv_kref_put_#in~kref.offset|) (<= (+ |ldv_kref_put_#in~kref.offset| 4) (select |#length| |ldv_kref_put_#in~kref.base|))), 12911#(and (<= 12 ldv_kref_put_~kref.offset) (<= (+ ldv_kref_put_~kref.offset 4) (select |#length| ldv_kref_put_~kref.base))), 12912#(and (<= (+ |ldv_kref_sub_#in~kref.offset| 4) (select |#length| |ldv_kref_sub_#in~kref.base|)) (<= 12 |ldv_kref_sub_#in~kref.offset|)), 12913#(and (<= (+ ldv_kref_sub_~kref.offset 4) (select |#length| ldv_kref_sub_~kref.base)) (<= 12 ldv_kref_sub_~kref.offset)), 12914#(and (<= 12 |##fun~$Pointer$~TO~VOID_#in~kref.offset|) (<= (+ |##fun~$Pointer$~TO~VOID_#in~kref.offset| 4) (select |#length| |##fun~$Pointer$~TO~VOID_#in~kref.base|))), 12915#(and (<= 12 |##fun~$Pointer$~TO~VOID_#~kref.offset|) (<= (+ |##fun~$Pointer$~TO~VOID_#~kref.offset| 4) (select |#length| |##fun~$Pointer$~TO~VOID_#~kref.base|))), 12916#(and (<= 12 |ldv_kobject_release_#in~kref.offset|) (<= (+ |ldv_kobject_release_#in~kref.offset| 4) (select |#length| |ldv_kobject_release_#in~kref.base|))), 12917#(and (<= (+ ldv_kobject_release_~kobj~0.offset 16) (select |#length| ldv_kobject_release_~kobj~0.base)) (<= 0 ldv_kobject_release_~kobj~0.offset)), 12918#(and (<= (+ |ldv_kobject_cleanup_#in~kobj.offset| 16) (select |#length| |ldv_kobject_cleanup_#in~kobj.base|)) (<= 0 |ldv_kobject_cleanup_#in~kobj.offset|)), 12919#(and (<= 0 ldv_kobject_cleanup_~kobj.offset) (<= (+ ldv_kobject_cleanup_~kobj.offset 16) (select |#length| ldv_kobject_cleanup_~kobj.base)))] [2018-02-02 10:48:39,417 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:39,417 INFO L409 AbstractCegarLoop]: Interpolant automaton has 25 states [2018-02-02 10:48:39,417 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2018-02-02 10:48:39,417 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=48, Invalid=552, Unknown=0, NotChecked=0, Total=600 [2018-02-02 10:48:39,417 INFO L87 Difference]: Start difference. First operand 176 states and 186 transitions. Second operand 25 states. [2018-02-02 10:48:40,041 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 10:48:40,042 INFO L93 Difference]: Finished difference Result 175 states and 184 transitions. [2018-02-02 10:48:40,042 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2018-02-02 10:48:40,042 INFO L78 Accepts]: Start accepts. Automaton has 25 states. Word has length 116 [2018-02-02 10:48:40,042 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 10:48:40,043 INFO L225 Difference]: With dead ends: 175 [2018-02-02 10:48:40,043 INFO L226 Difference]: Without dead ends: 175 [2018-02-02 10:48:40,043 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 34 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 32 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 61 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=85, Invalid=1037, Unknown=0, NotChecked=0, Total=1122 [2018-02-02 10:48:40,043 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 175 states. [2018-02-02 10:48:40,045 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 175 to 175. [2018-02-02 10:48:40,045 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 175 states. [2018-02-02 10:48:40,045 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 175 states to 175 states and 184 transitions. [2018-02-02 10:48:40,045 INFO L78 Accepts]: Start accepts. Automaton has 175 states and 184 transitions. Word has length 116 [2018-02-02 10:48:40,046 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 10:48:40,046 INFO L432 AbstractCegarLoop]: Abstraction has 175 states and 184 transitions. [2018-02-02 10:48:40,046 INFO L433 AbstractCegarLoop]: Interpolant automaton has 25 states. [2018-02-02 10:48:40,046 INFO L276 IsEmpty]: Start isEmpty. Operand 175 states and 184 transitions. [2018-02-02 10:48:40,046 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 119 [2018-02-02 10:48:40,046 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 10:48:40,046 INFO L351 BasicCegarLoop]: trace histogram [16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-02 10:48:40,046 INFO L371 AbstractCegarLoop]: === Iteration 38 === [ldv_kref_initErr0RequiresViolation, ldv_kref_initErr1RequiresViolation, ldv_kobject_createErr0RequiresViolation, ldv_kobject_createErr1RequiresViolation, ldv_atomic_sub_returnErr1RequiresViolation, ldv_atomic_sub_returnErr0RequiresViolation, ldv_atomic_sub_returnErr3RequiresViolation, ldv_atomic_sub_returnErr2RequiresViolation, ldv_atomic_add_returnErr0RequiresViolation, ldv_atomic_add_returnErr1RequiresViolation, ldv_atomic_add_returnErr2RequiresViolation, ldv_atomic_add_returnErr3RequiresViolation, ldv_kobject_cleanupErr4RequiresViolation, ldv_kobject_cleanupErr2RequiresViolation, ldv_kobject_cleanupErr5RequiresViolation, ldv_kobject_cleanupErr3RequiresViolation, ldv_kobject_cleanupErr0RequiresViolation, ldv_kobject_cleanupErr1RequiresViolation, mainErr0EnsuresViolation, LDV_INIT_LIST_HEADErr1RequiresViolation, LDV_INIT_LIST_HEADErr3RequiresViolation, LDV_INIT_LIST_HEADErr2RequiresViolation, LDV_INIT_LIST_HEADErr0RequiresViolation]=== [2018-02-02 10:48:40,047 INFO L82 PathProgramCache]: Analyzing trace with hash -1971942700, now seen corresponding path program 1 times [2018-02-02 10:48:40,047 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 10:48:40,061 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 10:48:40,062 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:40,422 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:40,423 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-02 10:48:40,423 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [23] imperfect sequences [] total 23 [2018-02-02 10:48:40,423 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 10:48:40,423 INFO 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:40,423 INFO L182 omatonBuilderFactory]: Interpolants [13288#true, 13289#false, 13290#(= 0 |ldv_malloc_#t~malloc4.offset|), 13291#(= 0 |ldv_malloc_#res.offset|), 13292#(= 0 |ldv_kobject_create_#t~ret17.offset|), 13293#(= 0 ldv_kobject_create_~kobj~1.offset), 13294#(= 0 |ldv_kobject_create_#res.offset|), 13295#(= 0 |entry_point_#t~ret20.offset|), 13296#(= 0 entry_point_~kobj~2.offset), 13297#(= 0 |f_22_put_#in~kobj.offset|), 13298#(= 0 f_22_put_~kobj.offset), 13299#(= 0 |ldv_kobject_put_#in~kobj.offset|), 13300#(= ldv_kobject_put_~kobj.offset 0), 13301#(<= |ldv_kref_put_#in~kref.offset| 12), 13302#(<= ldv_kref_put_~kref.offset 12), 13303#(<= |ldv_kref_sub_#in~kref.offset| 12), 13304#(<= ldv_kref_sub_~kref.offset 12), 13305#(<= |##fun~$Pointer$~TO~VOID_#in~kref.offset| 12), 13306#(<= |##fun~$Pointer$~TO~VOID_#~kref.offset| 12), 13307#(<= |ldv_kobject_release_#in~kref.offset| 12), 13308#(<= ldv_kobject_release_~kobj~0.offset 0), 13309#(<= |ldv_kobject_cleanup_#in~kobj.offset| 0), 13310#(<= ldv_kobject_cleanup_~kobj.offset 0), 13311#(and (<= 0 ldv_kobject_cleanup_~kobj.offset) (<= ldv_kobject_cleanup_~kobj.offset 0))] [2018-02-02 10:48:40,423 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:40,423 INFO L409 AbstractCegarLoop]: Interpolant automaton has 24 states [2018-02-02 10:48:40,423 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2018-02-02 10:48:40,424 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=46, Invalid=506, Unknown=0, NotChecked=0, Total=552 [2018-02-02 10:48:40,424 INFO L87 Difference]: Start difference. First operand 175 states and 184 transitions. Second operand 24 states. [2018-02-02 10:48:40,674 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 10:48:40,674 INFO L93 Difference]: Finished difference Result 174 states and 183 transitions. [2018-02-02 10:48:40,674 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2018-02-02 10:48:40,674 INFO L78 Accepts]: Start accepts. Automaton has 24 states. Word has length 118 [2018-02-02 10:48:40,675 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 10:48:40,675 INFO L225 Difference]: With dead ends: 174 [2018-02-02 10:48:40,675 INFO L226 Difference]: Without dead ends: 174 [2018-02-02 10:48:40,675 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 34 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 32 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 52 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=88, Invalid=1034, Unknown=0, NotChecked=0, Total=1122 [2018-02-02 10:48:40,676 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 174 states. [2018-02-02 10:48:40,677 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 174 to 174. [2018-02-02 10:48:40,677 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 174 states. [2018-02-02 10:48:40,677 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 174 states to 174 states and 183 transitions. [2018-02-02 10:48:40,678 INFO L78 Accepts]: Start accepts. Automaton has 174 states and 183 transitions. Word has length 118 [2018-02-02 10:48:40,678 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 10:48:40,678 INFO L432 AbstractCegarLoop]: Abstraction has 174 states and 183 transitions. [2018-02-02 10:48:40,678 INFO L433 AbstractCegarLoop]: Interpolant automaton has 24 states. [2018-02-02 10:48:40,678 INFO L276 IsEmpty]: Start isEmpty. Operand 174 states and 183 transitions. [2018-02-02 10:48:40,678 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 121 [2018-02-02 10:48:40,678 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 10:48:40,678 INFO L351 BasicCegarLoop]: trace histogram [16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-02 10:48:40,679 INFO L371 AbstractCegarLoop]: === Iteration 39 === [ldv_kref_initErr0RequiresViolation, ldv_kref_initErr1RequiresViolation, ldv_kobject_createErr0RequiresViolation, ldv_kobject_createErr1RequiresViolation, ldv_atomic_sub_returnErr1RequiresViolation, ldv_atomic_sub_returnErr0RequiresViolation, ldv_atomic_sub_returnErr3RequiresViolation, ldv_atomic_sub_returnErr2RequiresViolation, ldv_atomic_add_returnErr0RequiresViolation, ldv_atomic_add_returnErr1RequiresViolation, ldv_atomic_add_returnErr2RequiresViolation, ldv_atomic_add_returnErr3RequiresViolation, ldv_kobject_cleanupErr4RequiresViolation, ldv_kobject_cleanupErr2RequiresViolation, ldv_kobject_cleanupErr5RequiresViolation, ldv_kobject_cleanupErr3RequiresViolation, ldv_kobject_cleanupErr0RequiresViolation, ldv_kobject_cleanupErr1RequiresViolation, mainErr0EnsuresViolation, LDV_INIT_LIST_HEADErr1RequiresViolation, LDV_INIT_LIST_HEADErr3RequiresViolation, LDV_INIT_LIST_HEADErr2RequiresViolation, LDV_INIT_LIST_HEADErr0RequiresViolation]=== [2018-02-02 10:48:40,679 INFO L82 PathProgramCache]: Analyzing trace with hash -956354475, now seen corresponding path program 1 times [2018-02-02 10:48:40,679 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 10:48:40,720 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 10:48:40,721 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:40,746 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:40,749 INFO L168 Benchmark]: Toolchain (without parser) took 11143.38 ms. Allocated memory was 402.1 MB in the beginning and 976.7 MB in the end (delta: 574.6 MB). Free memory was 358.8 MB in the beginning and 838.4 MB in the end (delta: -479.5 MB). Peak memory consumption was 95.1 MB. Max. memory is 5.3 GB. [2018-02-02 10:48:40,751 INFO L168 Benchmark]: CDTParser took 0.13 ms. Allocated memory is still 402.1 MB. Free memory is still 364.1 MB. There was no memory consumed. Max. memory is 5.3 GB. [2018-02-02 10:48:40,751 INFO L168 Benchmark]: CACSL2BoogieTranslator took 187.24 ms. Allocated memory is still 402.1 MB. Free memory was 358.8 MB in the beginning and 343.0 MB in the end (delta: 15.9 MB). Peak memory consumption was 15.9 MB. Max. memory is 5.3 GB. [2018-02-02 10:48:40,751 INFO L168 Benchmark]: Boogie Preprocessor took 34.45 ms. Allocated memory is still 402.1 MB. Free memory is still 343.0 MB. There was no memory consumed. Max. memory is 5.3 GB. [2018-02-02 10:48:40,751 INFO L168 Benchmark]: RCFGBuilder took 385.72 ms. Allocated memory is still 402.1 MB. Free memory was 343.0 MB in the beginning and 304.6 MB in the end (delta: 38.4 MB). Peak memory consumption was 38.4 MB. Max. memory is 5.3 GB. [2018-02-02 10:48:40,752 INFO L168 Benchmark]: TraceAbstraction took 10532.83 ms. Allocated memory was 402.1 MB in the beginning and 976.7 MB in the end (delta: 574.6 MB). Free memory was 304.6 MB in the beginning and 838.4 MB in the end (delta: -533.8 MB). Peak memory consumption was 40.9 MB. Max. memory is 5.3 GB. [2018-02-02 10:48:40,753 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 402.1 MB. Free memory is still 364.1 MB. There was no memory consumed. Max. memory is 5.3 GB. * CACSL2BoogieTranslator took 187.24 ms. Allocated memory is still 402.1 MB. Free memory was 358.8 MB in the beginning and 343.0 MB in the end (delta: 15.9 MB). Peak memory consumption was 15.9 MB. Max. memory is 5.3 GB. * Boogie Preprocessor took 34.45 ms. Allocated memory is still 402.1 MB. Free memory is still 343.0 MB. There was no memory consumed. Max. memory is 5.3 GB. * RCFGBuilder took 385.72 ms. Allocated memory is still 402.1 MB. Free memory was 343.0 MB in the beginning and 304.6 MB in the end (delta: 38.4 MB). Peak memory consumption was 38.4 MB. Max. memory is 5.3 GB. * TraceAbstraction took 10532.83 ms. Allocated memory was 402.1 MB in the beginning and 976.7 MB in the end (delta: 574.6 MB). Free memory was 304.6 MB in the beginning and 838.4 MB in the end (delta: -533.8 MB). Peak memory consumption was 40.9 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_3_true-valid-memsafety_true-termination.i_svcomp-DerefFreeMemtrack-32bit-Automizer_SmtInterpol_NoArray.epf_AutomizerC.xml/Csv-Benchmark-0-2018-02-02_10-48-40-764.csv Received shutdown request...