java -Xmx6000000000 -jar ./plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data ./data --generate-csv --csv-dir ../../../releaseScripts/default/UAutomizer-linux/csv -tc ../../../trunk/examples/toolchains/AutomizerC.xml -s ../../../trunk/examples/settings/cav18-smtinterpol/svcomp-DerefFreeMemtrack-32bit-Automizer_SmtInterpol_NoArray.epf -i ../../../trunk/examples/svcomp/ldv-memsafety/memleaks_test22_1_false-valid-memtrack_true-termination.i -------------------------------------------------------------------------------- This is Ultimate 0.1.23-26d9e06-m [2018-02-02 10:47:30,321 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-02-02 10:47:30,322 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-02-02 10:47:30,335 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-02-02 10:47:30,335 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-02-02 10:47:30,336 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-02-02 10:47:30,336 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-02-02 10:47:30,338 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-02-02 10:47:30,339 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-02-02 10:47:30,340 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-02-02 10:47:30,341 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-02-02 10:47:30,341 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-02-02 10:47:30,342 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-02-02 10:47:30,343 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-02-02 10:47:30,344 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-02-02 10:47:30,345 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-02-02 10:47:30,347 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-02-02 10:47:30,349 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-02-02 10:47:30,350 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-02-02 10:47:30,351 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-02-02 10:47:30,352 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-02-02 10:47:30,353 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-02-02 10:47:30,353 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-02-02 10:47:30,354 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-02-02 10:47:30,354 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-02-02 10:47:30,355 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-02-02 10:47:30,355 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-02-02 10:47:30,356 INFO L177 SettingsManager]: PEA to Boogie provides no preferences, ignoring... [2018-02-02 10:47:30,356 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-02-02 10:47:30,356 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-02-02 10:47:30,357 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-02-02 10:47:30,357 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:47:30,366 INFO L110 SettingsManager]: Loading preferences was successful [2018-02-02 10:47:30,367 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-02-02 10:47:30,368 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-02-02 10:47:30,368 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-02-02 10:47:30,368 INFO L133 SettingsManager]: * Use SBE=true [2018-02-02 10:47:30,368 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-02-02 10:47:30,368 INFO L133 SettingsManager]: * sizeof long=4 [2018-02-02 10:47:30,368 INFO L133 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2018-02-02 10:47:30,368 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-02-02 10:47:30,369 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-02-02 10:47:30,369 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-02-02 10:47:30,369 INFO L133 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2018-02-02 10:47:30,369 INFO L133 SettingsManager]: * Bitprecise bitfields=true [2018-02-02 10:47:30,369 INFO L133 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2018-02-02 10:47:30,369 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-02-02 10:47:30,369 INFO L133 SettingsManager]: * sizeof long double=12 [2018-02-02 10:47:30,369 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-02-02 10:47:30,369 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-02-02 10:47:30,370 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-02-02 10:47:30,370 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-02-02 10:47:30,370 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-02-02 10:47:30,370 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-02-02 10:47:30,370 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=Craig_TreeInterpolation [2018-02-02 10:47:30,370 INFO L133 SettingsManager]: * SMT solver=Internal_SMTInterpol_NoArrayInterpol [2018-02-02 10:47:30,398 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-02-02 10:47:30,406 INFO L266 ainManager$Toolchain]: [Toolchain 1]: Parser(s) successfully initialized [2018-02-02 10:47:30,409 INFO L222 ainManager$Toolchain]: [Toolchain 1]: Toolchain data selected. [2018-02-02 10:47:30,410 INFO L271 PluginConnector]: Initializing CDTParser... [2018-02-02 10:47:30,410 INFO L276 PluginConnector]: CDTParser initialized [2018-02-02 10:47:30,411 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/ldv-memsafety/memleaks_test22_1_false-valid-memtrack_true-termination.i [2018-02-02 10:47:30,540 INFO L304 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-02-02 10:47:30,541 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2018-02-02 10:47:30,541 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-02-02 10:47:30,542 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-02-02 10:47:30,545 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-02-02 10:47:30,546 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 02.02 10:47:30" (1/1) ... [2018-02-02 10:47:30,548 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@73d1e458 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.02 10:47:30, skipping insertion in model container [2018-02-02 10:47:30,548 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 02.02 10:47:30" (1/1) ... [2018-02-02 10:47:30,557 INFO L153 Dispatcher]: Using SV-COMP mode [2018-02-02 10:47:30,590 INFO L153 Dispatcher]: Using SV-COMP mode [2018-02-02 10:47:30,685 INFO L450 PostProcessor]: Settings: Checked method=main [2018-02-02 10:47:30,701 INFO L450 PostProcessor]: Settings: Checked method=main [2018-02-02 10:47:30,710 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.02 10:47:30 WrapperNode [2018-02-02 10:47:30,711 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-02-02 10:47:30,711 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-02-02 10:47:30,711 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-02-02 10:47:30,712 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-02-02 10:47:30,725 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.02 10:47:30" (1/1) ... [2018-02-02 10:47:30,725 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.02 10:47:30" (1/1) ... [2018-02-02 10:47:30,736 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.02 10:47:30" (1/1) ... [2018-02-02 10:47:30,737 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.02 10:47:30" (1/1) ... [2018-02-02 10:47:30,744 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.02 10:47:30" (1/1) ... [2018-02-02 10:47:30,747 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.02 10:47:30" (1/1) ... [2018-02-02 10:47:30,749 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.02 10:47:30" (1/1) ... [2018-02-02 10:47:30,752 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-02-02 10:47:30,752 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-02-02 10:47:30,752 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-02-02 10:47:30,753 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-02-02 10:47:30,754 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.02 10:47:30" (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:47:30,793 INFO L136 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-02-02 10:47:30,793 INFO L136 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-02-02 10:47:30,794 INFO L136 BoogieDeclarations]: Found implementation of procedure ##fun~$Pointer$~TO~VOID [2018-02-02 10:47:30,794 INFO L136 BoogieDeclarations]: Found implementation of procedure ldv_malloc [2018-02-02 10:47:30,794 INFO L136 BoogieDeclarations]: Found implementation of procedure LDV_INIT_LIST_HEAD [2018-02-02 10:47:30,794 INFO L136 BoogieDeclarations]: Found implementation of procedure ldv_atomic_add_return [2018-02-02 10:47:30,794 INFO L136 BoogieDeclarations]: Found implementation of procedure ldv_atomic_sub_return [2018-02-02 10:47:30,794 INFO L136 BoogieDeclarations]: Found implementation of procedure ldv_kref_sub [2018-02-02 10:47:30,794 INFO L136 BoogieDeclarations]: Found implementation of procedure ldv_kref_init [2018-02-02 10:47:30,795 INFO L136 BoogieDeclarations]: Found implementation of procedure ldv_kref_get [2018-02-02 10:47:30,795 INFO L136 BoogieDeclarations]: Found implementation of procedure ldv_kref_put [2018-02-02 10:47:30,795 INFO L136 BoogieDeclarations]: Found implementation of procedure ldv_kobject_cleanup [2018-02-02 10:47:30,795 INFO L136 BoogieDeclarations]: Found implementation of procedure ldv_kobject_release [2018-02-02 10:47:30,795 INFO L136 BoogieDeclarations]: Found implementation of procedure ldv_kobject_put [2018-02-02 10:47:30,795 INFO L136 BoogieDeclarations]: Found implementation of procedure ldv_kobject_get [2018-02-02 10:47:30,795 INFO L136 BoogieDeclarations]: Found implementation of procedure ldv_kobject_init_internal [2018-02-02 10:47:30,795 INFO L136 BoogieDeclarations]: Found implementation of procedure ldv_kobject_init [2018-02-02 10:47:30,795 INFO L136 BoogieDeclarations]: Found implementation of procedure ldv_kobject_create [2018-02-02 10:47:30,796 INFO L136 BoogieDeclarations]: Found implementation of procedure entry_point [2018-02-02 10:47:30,796 INFO L136 BoogieDeclarations]: Found implementation of procedure main [2018-02-02 10:47:30,796 INFO L128 BoogieDeclarations]: Found specification of procedure write~int [2018-02-02 10:47:30,796 INFO L128 BoogieDeclarations]: Found specification of procedure read~int [2018-02-02 10:47:30,796 INFO L128 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2018-02-02 10:47:30,796 INFO L128 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2018-02-02 10:47:30,796 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.free [2018-02-02 10:47:30,796 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2018-02-02 10:47:30,797 INFO L128 BoogieDeclarations]: Found specification of procedure #Ultimate.alloc [2018-02-02 10:47:30,797 INFO L128 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memset [2018-02-02 10:47:30,797 INFO L136 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memset [2018-02-02 10:47:30,797 INFO L128 BoogieDeclarations]: Found specification of procedure malloc [2018-02-02 10:47:30,797 INFO L128 BoogieDeclarations]: Found specification of procedure free [2018-02-02 10:47:30,797 INFO L128 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2018-02-02 10:47:30,797 INFO L128 BoogieDeclarations]: Found specification of procedure memset [2018-02-02 10:47:30,797 INFO L128 BoogieDeclarations]: Found specification of procedure ldv_malloc [2018-02-02 10:47:30,798 INFO L128 BoogieDeclarations]: Found specification of procedure LDV_INIT_LIST_HEAD [2018-02-02 10:47:30,798 INFO L128 BoogieDeclarations]: Found specification of procedure ldv_atomic_add_return [2018-02-02 10:47:30,798 INFO L128 BoogieDeclarations]: Found specification of procedure ldv_atomic_sub_return [2018-02-02 10:47:30,798 INFO L128 BoogieDeclarations]: Found specification of procedure ldv_kref_sub [2018-02-02 10:47:30,802 INFO L128 BoogieDeclarations]: Found specification of procedure ##fun~$Pointer$~TO~VOID [2018-02-02 10:47:30,802 INFO L128 BoogieDeclarations]: Found specification of procedure ldv_kref_init [2018-02-02 10:47:30,802 INFO L128 BoogieDeclarations]: Found specification of procedure ldv_kref_get [2018-02-02 10:47:30,802 INFO L128 BoogieDeclarations]: Found specification of procedure ldv_kref_put [2018-02-02 10:47:30,802 INFO L128 BoogieDeclarations]: Found specification of procedure ldv_kobject_cleanup [2018-02-02 10:47:30,802 INFO L128 BoogieDeclarations]: Found specification of procedure ldv_kobject_release [2018-02-02 10:47:30,802 INFO L128 BoogieDeclarations]: Found specification of procedure ldv_kobject_put [2018-02-02 10:47:30,802 INFO L128 BoogieDeclarations]: Found specification of procedure ldv_kobject_get [2018-02-02 10:47:30,802 INFO L128 BoogieDeclarations]: Found specification of procedure ldv_kobject_init_internal [2018-02-02 10:47:30,802 INFO L128 BoogieDeclarations]: Found specification of procedure ldv_kobject_init [2018-02-02 10:47:30,802 INFO L128 BoogieDeclarations]: Found specification of procedure ldv_kobject_create [2018-02-02 10:47:30,802 INFO L128 BoogieDeclarations]: Found specification of procedure entry_point [2018-02-02 10:47:30,803 INFO L128 BoogieDeclarations]: Found specification of procedure main [2018-02-02 10:47:30,803 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-02-02 10:47:30,803 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-02-02 10:47:31,001 WARN L455 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2018-02-02 10:47:31,159 INFO L257 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-02-02 10:47:31,160 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 02.02 10:47:31 BoogieIcfgContainer [2018-02-02 10:47:31,160 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-02-02 10:47:31,161 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-02-02 10:47:31,161 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-02-02 10:47:31,163 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-02-02 10:47:31,164 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 02.02 10:47:30" (1/3) ... [2018-02-02 10:47:31,164 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@698fa573 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 02.02 10:47:31, skipping insertion in model container [2018-02-02 10:47:31,164 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.02 10:47:30" (2/3) ... [2018-02-02 10:47:31,165 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@698fa573 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 02.02 10:47:31, skipping insertion in model container [2018-02-02 10:47:31,165 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 02.02 10:47:31" (3/3) ... [2018-02-02 10:47:31,166 INFO L107 eAbstractionObserver]: Analyzing ICFG memleaks_test22_1_false-valid-memtrack_true-termination.i [2018-02-02 10:47:31,174 INFO L128 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:Craig_TreeInterpolation Determinization: PREDICATE_ABSTRACTION [2018-02-02 10:47:31,181 INFO L140 ceAbstractionStarter]: Appying trace abstraction to program that has 23 error locations. [2018-02-02 10:47:31,214 INFO L322 AbstractCegarLoop]: Interprodecural is true [2018-02-02 10:47:31,214 INFO L323 AbstractCegarLoop]: Hoare is false [2018-02-02 10:47:31,214 INFO L324 AbstractCegarLoop]: Compute interpolants for Craig_TreeInterpolation [2018-02-02 10:47:31,214 INFO L325 AbstractCegarLoop]: Backedges is CANONICAL [2018-02-02 10:47:31,214 INFO L326 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-02-02 10:47:31,214 INFO L327 AbstractCegarLoop]: Difference is false [2018-02-02 10:47:31,214 INFO L328 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-02-02 10:47:31,215 INFO L333 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-02-02 10:47:31,215 INFO L87 2NestedWordAutomaton]: Mode: main mode - execution starts in main procedure [2018-02-02 10:47:31,226 INFO L276 IsEmpty]: Start isEmpty. Operand 142 states. [2018-02-02 10:47:31,233 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2018-02-02 10:47:31,233 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 10:47:31,234 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:47:31,234 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:47:31,237 INFO L82 PathProgramCache]: Analyzing trace with hash -1956546830, now seen corresponding path program 1 times [2018-02-02 10:47:31,289 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 10:47:31,321 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 10:47:31,326 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 10:47: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:47:31,408 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-02 10:47:31,409 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-02-02 10:47:31,409 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 10:47:31,410 INFO 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:47:31,410 INFO L182 omatonBuilderFactory]: Interpolants [145#true, 146#false, 147#(and (= 0 |ldv_malloc_#res.offset|) (= 0 |ldv_malloc_#res.base|)), 148#(and (= 0 |ldv_kobject_create_#t~ret17.base|) (= 0 |ldv_kobject_create_#t~ret17.offset|)), 149#(and (= ldv_kobject_create_~kobj~1.offset 0) (= ldv_kobject_create_~kobj~1.base 0))] [2018-02-02 10:47:31,410 INFO 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:47:31,411 INFO L409 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-02-02 10:47:31,479 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-02-02 10:47:31,480 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-02-02 10:47:31,481 INFO L87 Difference]: Start difference. First operand 142 states. Second operand 5 states. [2018-02-02 10:47:31,524 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 10:47:31,524 INFO L93 Difference]: Finished difference Result 148 states and 156 transitions. [2018-02-02 10:47:31,524 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-02-02 10:47:31,525 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 17 [2018-02-02 10:47:31,526 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 10:47:31,537 INFO L225 Difference]: With dead ends: 148 [2018-02-02 10:47:31,538 INFO L226 Difference]: Without dead ends: 145 [2018-02-02 10:47:31,539 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:47:31,551 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 145 states. [2018-02-02 10:47:31,568 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 145 to 143. [2018-02-02 10:47:31,570 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 143 states. [2018-02-02 10:47:31,572 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 143 states to 143 states and 151 transitions. [2018-02-02 10:47:31,573 INFO L78 Accepts]: Start accepts. Automaton has 143 states and 151 transitions. Word has length 17 [2018-02-02 10:47:31,573 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 10:47:31,573 INFO L432 AbstractCegarLoop]: Abstraction has 143 states and 151 transitions. [2018-02-02 10:47:31,574 INFO L433 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-02-02 10:47:31,574 INFO L276 IsEmpty]: Start isEmpty. Operand 143 states and 151 transitions. [2018-02-02 10:47:31,574 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2018-02-02 10:47:31,574 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 10:47:31,575 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:47:31,575 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:47:31,575 INFO L82 PathProgramCache]: Analyzing trace with hash 1123892084, now seen corresponding path program 1 times [2018-02-02 10:47:31,576 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 10:47:31,590 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 10:47:31,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:47:31,632 INFO 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:47:31,633 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-02 10:47:31,633 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-02-02 10:47:31,633 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 10:47:31,633 INFO 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:47:31,634 INFO L182 omatonBuilderFactory]: Interpolants [441#true, 442#false, 443#(= 1 (select |#valid| |ldv_malloc_#t~malloc4.base|)), 444#(= 1 (select |#valid| |ldv_malloc_#res.base|)), 445#(= 1 (select |#valid| |ldv_kobject_create_#t~ret17.base|)), 446#(= 1 (select |#valid| ldv_kobject_create_~kobj~1.base))] [2018-02-02 10:47:31,634 INFO 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:47:31,635 INFO L409 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-02-02 10:47:31,636 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-02-02 10:47:31,636 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-02-02 10:47:31,636 INFO L87 Difference]: Start difference. First operand 143 states and 151 transitions. Second operand 6 states. [2018-02-02 10:47:31,774 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 10:47:31,774 INFO L93 Difference]: Finished difference Result 144 states and 152 transitions. [2018-02-02 10:47:31,774 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-02-02 10:47:31,774 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 19 [2018-02-02 10:47:31,775 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 10:47:31,776 INFO L225 Difference]: With dead ends: 144 [2018-02-02 10:47:31,776 INFO L226 Difference]: Without dead ends: 144 [2018-02-02 10:47:31,777 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:47:31,777 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 144 states. [2018-02-02 10:47:31,783 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 144 to 142. [2018-02-02 10:47:31,783 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 142 states. [2018-02-02 10:47:31,785 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 142 states to 142 states and 150 transitions. [2018-02-02 10:47:31,785 INFO L78 Accepts]: Start accepts. Automaton has 142 states and 150 transitions. Word has length 19 [2018-02-02 10:47:31,786 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 10:47:31,786 INFO L432 AbstractCegarLoop]: Abstraction has 142 states and 150 transitions. [2018-02-02 10:47:31,786 INFO L433 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-02-02 10:47:31,786 INFO L276 IsEmpty]: Start isEmpty. Operand 142 states and 150 transitions. [2018-02-02 10:47:31,787 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2018-02-02 10:47:31,787 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 10:47:31,787 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:47:31,787 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:47:31,787 INFO L82 PathProgramCache]: Analyzing trace with hash 1123892085, now seen corresponding path program 1 times [2018-02-02 10:47:31,788 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 10:47:31,804 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 10:47:31,805 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 10:47:31,961 INFO 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:47:31,961 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-02 10:47:31,961 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-02-02 10:47:31,961 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 10:47:31,962 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 10:47:31,962 INFO L182 omatonBuilderFactory]: Interpolants [736#false, 737#(and (or (< 0 (div ldv_malloc_~size 4294967296)) (and (or (<= ldv_malloc_~size |ldv_malloc_#in~size|) (<= (+ (div ldv_malloc_~size 4294967296) 1) 0)) (<= |ldv_malloc_#in~size| ldv_malloc_~size))) (or (<= ldv_malloc_~size |ldv_malloc_#in~size|) (<= (div ldv_malloc_~size 4294967296) 0))), 738#(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|))), 739#(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|))), 740#(and (<= 16 (select |#length| |ldv_kobject_create_#t~ret17.base|)) (= 0 |ldv_kobject_create_#t~ret17.offset|)), 741#(and (= ldv_kobject_create_~kobj~1.offset 0) (<= 16 (select |#length| ldv_kobject_create_~kobj~1.base))), 735#true] [2018-02-02 10:47:31,962 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 10:47:31,963 INFO L409 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-02-02 10:47:31,963 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-02-02 10:47:31,963 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2018-02-02 10:47:31,963 INFO L87 Difference]: Start difference. First operand 142 states and 150 transitions. Second operand 7 states. [2018-02-02 10:47:32,180 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 10:47:32,180 INFO L93 Difference]: Finished difference Result 143 states and 151 transitions. [2018-02-02 10:47:32,181 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-02-02 10:47:32,181 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 19 [2018-02-02 10:47:32,181 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 10:47:32,182 INFO L225 Difference]: With dead ends: 143 [2018-02-02 10:47:32,182 INFO L226 Difference]: Without dead ends: 143 [2018-02-02 10:47:32,183 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:47:32,183 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 143 states. [2018-02-02 10:47:32,190 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 143 to 141. [2018-02-02 10:47:32,190 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 141 states. [2018-02-02 10:47:32,196 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 141 states to 141 states and 149 transitions. [2018-02-02 10:47:32,196 INFO L78 Accepts]: Start accepts. Automaton has 141 states and 149 transitions. Word has length 19 [2018-02-02 10:47:32,196 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 10:47:32,196 INFO L432 AbstractCegarLoop]: Abstraction has 141 states and 149 transitions. [2018-02-02 10:47:32,196 INFO L433 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-02-02 10:47:32,197 INFO L276 IsEmpty]: Start isEmpty. Operand 141 states and 149 transitions. [2018-02-02 10:47:32,197 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2018-02-02 10:47:32,197 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 10:47:32,197 INFO L351 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-02 10:47:32,198 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:47:32,198 INFO L82 PathProgramCache]: Analyzing trace with hash -1414777661, now seen corresponding path program 1 times [2018-02-02 10:47:32,199 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 10:47:32,218 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 10:47:32,219 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 10:47:32,278 INFO 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:47:32,278 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-02 10:47:32,278 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-02-02 10:47:32,278 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 10:47:32,279 INFO 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:47:32,279 INFO L182 omatonBuilderFactory]: Interpolants [1030#true, 1031#false, 1032#(and (= 0 |ldv_kobject_create_#res.base|) (= 0 |ldv_kobject_create_#res.offset|)), 1033#(and (= 0 |entry_point_#t~ret19.base|) (= 0 |entry_point_#t~ret19.offset|)), 1034#(and (= 0 entry_point_~kobj~2.base) (= 0 entry_point_~kobj~2.offset)), 1035#(and (= 0 |ldv_kobject_get_#in~kobj.base|) (= 0 |ldv_kobject_get_#in~kobj.offset|)), 1036#(and (= 0 ldv_kobject_get_~kobj.offset) (= ldv_kobject_get_~kobj.base 0))] [2018-02-02 10:47:32,279 INFO 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:47:32,279 INFO L409 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-02-02 10:47:32,280 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-02-02 10:47:32,280 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2018-02-02 10:47:32,280 INFO L87 Difference]: Start difference. First operand 141 states and 149 transitions. Second operand 7 states. [2018-02-02 10:47:32,328 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 10:47:32,328 INFO L93 Difference]: Finished difference Result 157 states and 166 transitions. [2018-02-02 10:47:32,330 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-02-02 10:47:32,330 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 27 [2018-02-02 10:47:32,330 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 10:47:32,332 INFO L225 Difference]: With dead ends: 157 [2018-02-02 10:47:32,332 INFO L226 Difference]: Without dead ends: 157 [2018-02-02 10:47:32,333 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2018-02-02 10:47:32,333 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 157 states. [2018-02-02 10:47:32,344 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 157 to 150. [2018-02-02 10:47:32,344 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 150 states. [2018-02-02 10:47:32,345 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 150 states to 150 states and 158 transitions. [2018-02-02 10:47:32,346 INFO L78 Accepts]: Start accepts. Automaton has 150 states and 158 transitions. Word has length 27 [2018-02-02 10:47:32,346 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 10:47:32,346 INFO L432 AbstractCegarLoop]: Abstraction has 150 states and 158 transitions. [2018-02-02 10:47:32,346 INFO L433 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-02-02 10:47:32,346 INFO L276 IsEmpty]: Start isEmpty. Operand 150 states and 158 transitions. [2018-02-02 10:47:32,347 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2018-02-02 10:47:32,347 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 10:47:32,347 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:47:32,347 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:47:32,347 INFO L82 PathProgramCache]: Analyzing trace with hash 1439517623, now seen corresponding path program 1 times [2018-02-02 10:47:32,349 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 10:47:32,359 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 10:47:32,360 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 10:47:32,430 INFO 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:47:32,430 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-02 10:47:32,430 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2018-02-02 10:47:32,430 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 10:47:32,431 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 10:47:32,431 INFO L182 omatonBuilderFactory]: Interpolants [1346#true, 1347#false, 1348#(= 1 (select |#valid| |#Ultimate.C_memset_#ptr.base|)), 1349#(= 1 (select |#valid| ldv_kobject_create_~kobj~1.base)), 1350#(= 1 (select |#valid| |ldv_kobject_init_#in~kobj.base|)), 1351#(= 1 (select |#valid| ldv_kobject_init_~kobj.base)), 1352#(= 1 (select |#valid| |ldv_kobject_init_internal_#in~kobj.base|)), 1353#(= 1 (select |#valid| ldv_kobject_init_internal_~kobj.base)), 1354#(= 1 (select |#valid| |ldv_kref_init_#in~kref.base|)), 1355#(= 1 (select |#valid| ldv_kref_init_~kref.base))] [2018-02-02 10:47:32,431 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 10:47:32,431 INFO L409 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-02-02 10:47:32,432 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-02-02 10:47:32,432 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=73, Unknown=0, NotChecked=0, Total=90 [2018-02-02 10:47:32,432 INFO L87 Difference]: Start difference. First operand 150 states and 158 transitions. Second operand 10 states. [2018-02-02 10:47:32,602 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 10:47:32,602 INFO L93 Difference]: Finished difference Result 149 states and 157 transitions. [2018-02-02 10:47:32,603 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-02-02 10:47:32,603 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 34 [2018-02-02 10:47:32,603 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 10:47:32,604 INFO L225 Difference]: With dead ends: 149 [2018-02-02 10:47:32,604 INFO L226 Difference]: Without dead ends: 149 [2018-02-02 10:47:32,604 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:47:32,604 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 149 states. [2018-02-02 10:47:32,607 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 149 to 149. [2018-02-02 10:47:32,607 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 149 states. [2018-02-02 10:47:32,608 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 149 states to 149 states and 157 transitions. [2018-02-02 10:47:32,608 INFO L78 Accepts]: Start accepts. Automaton has 149 states and 157 transitions. Word has length 34 [2018-02-02 10:47:32,608 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 10:47:32,608 INFO L432 AbstractCegarLoop]: Abstraction has 149 states and 157 transitions. [2018-02-02 10:47:32,608 INFO L433 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-02-02 10:47:32,608 INFO L276 IsEmpty]: Start isEmpty. Operand 149 states and 157 transitions. [2018-02-02 10:47:32,609 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2018-02-02 10:47:32,609 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 10:47:32,609 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:47:32,609 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:47:32,610 INFO L82 PathProgramCache]: Analyzing trace with hash 1439517624, now seen corresponding path program 1 times [2018-02-02 10:47:32,610 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 10:47:32,621 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 10:47:32,622 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 10:47:32,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:47:32,644 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-02 10:47:32,644 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-02-02 10:47:32,644 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 10:47:32,645 INFO 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:47:32,645 INFO L182 omatonBuilderFactory]: Interpolants [1660#true, 1661#false, 1662#(= |#Ultimate.C_memset_#t~loopctr21| 0), 1663#(<= |#Ultimate.C_memset_#amount| 0)] [2018-02-02 10:47:32,645 INFO 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:47:32,645 INFO L409 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-02-02 10:47:32,645 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-02-02 10:47:32,645 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-02-02 10:47:32,645 INFO L87 Difference]: Start difference. First operand 149 states and 157 transitions. Second operand 4 states. [2018-02-02 10:47:32,659 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 10:47:32,659 INFO L93 Difference]: Finished difference Result 152 states and 160 transitions. [2018-02-02 10:47:32,660 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-02-02 10:47:32,660 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 34 [2018-02-02 10:47:32,660 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 10:47:32,661 INFO L225 Difference]: With dead ends: 152 [2018-02-02 10:47:32,661 INFO L226 Difference]: Without dead ends: 150 [2018-02-02 10:47:32,661 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:47:32,662 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 150 states. [2018-02-02 10:47:32,666 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 150 to 150. [2018-02-02 10:47:32,666 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 150 states. [2018-02-02 10:47:32,667 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 150 states to 150 states and 158 transitions. [2018-02-02 10:47:32,667 INFO L78 Accepts]: Start accepts. Automaton has 150 states and 158 transitions. Word has length 34 [2018-02-02 10:47:32,667 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 10:47:32,667 INFO L432 AbstractCegarLoop]: Abstraction has 150 states and 158 transitions. [2018-02-02 10:47:32,667 INFO L433 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-02-02 10:47:32,667 INFO L276 IsEmpty]: Start isEmpty. Operand 150 states and 158 transitions. [2018-02-02 10:47:32,668 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2018-02-02 10:47:32,668 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 10:47:32,668 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:47:32,668 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:47:32,668 INFO L82 PathProgramCache]: Analyzing trace with hash -204456797, now seen corresponding path program 1 times [2018-02-02 10:47:32,669 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 10:47:32,680 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 10:47:32,681 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 10:47:32,711 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:47:32,711 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-02 10:47:32,712 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5] total 5 [2018-02-02 10:47:32,712 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 10:47:32,712 INFO 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:47:32,712 INFO L182 omatonBuilderFactory]: Interpolants [1968#true, 1969#false, 1970#(= |#Ultimate.C_memset_#t~loopctr21| 0), 1971#(<= |#Ultimate.C_memset_#t~loopctr21| 1), 1972#(<= |#Ultimate.C_memset_#amount| 1)] [2018-02-02 10:47:32,712 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:47:32,713 INFO L409 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-02-02 10:47:32,713 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-02-02 10:47:32,713 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2018-02-02 10:47:32,713 INFO L87 Difference]: Start difference. First operand 150 states and 158 transitions. Second operand 5 states. [2018-02-02 10:47:32,747 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 10:47:32,748 INFO L93 Difference]: Finished difference Result 153 states and 161 transitions. [2018-02-02 10:47:32,748 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-02-02 10:47:32,748 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 35 [2018-02-02 10:47:32,748 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 10:47:32,749 INFO L225 Difference]: With dead ends: 153 [2018-02-02 10:47:32,749 INFO L226 Difference]: Without dead ends: 151 [2018-02-02 10:47:32,749 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:47:32,750 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 151 states. [2018-02-02 10:47:32,753 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 151 to 151. [2018-02-02 10:47:32,753 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 151 states. [2018-02-02 10:47:32,753 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 151 states to 151 states and 159 transitions. [2018-02-02 10:47:32,754 INFO L78 Accepts]: Start accepts. Automaton has 151 states and 159 transitions. Word has length 35 [2018-02-02 10:47:32,754 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 10:47:32,754 INFO L432 AbstractCegarLoop]: Abstraction has 151 states and 159 transitions. [2018-02-02 10:47:32,754 INFO L433 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-02-02 10:47:32,754 INFO L276 IsEmpty]: Start isEmpty. Operand 151 states and 159 transitions. [2018-02-02 10:47:32,755 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2018-02-02 10:47:32,755 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 10:47:32,755 INFO L351 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-02 10:47:32,755 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:47:32,756 INFO L82 PathProgramCache]: Analyzing trace with hash -1829139958, now seen corresponding path program 1 times [2018-02-02 10:47:32,757 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 10:47:32,768 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 10:47:32,769 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 10:47:32,831 INFO 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:47:32,831 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-02 10:47:32,831 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-02-02 10:47:32,831 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 10:47:32,832 INFO 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:47:32,832 INFO L182 omatonBuilderFactory]: Interpolants [2279#true, 2280#false, 2281#(and (= 0 |ldv_kobject_create_#res.base|) (= 0 |ldv_kobject_create_#res.offset|)), 2282#(and (= 0 |entry_point_#t~ret19.base|) (= 0 |entry_point_#t~ret19.offset|)), 2283#(and (= 0 entry_point_~kobj~2.base) (= 0 entry_point_~kobj~2.offset)), 2284#(and (= 0 |ldv_kobject_put_#in~kobj.offset|) (= 0 |ldv_kobject_put_#in~kobj.base|)), 2285#(and (= ldv_kobject_put_~kobj.offset 0) (= 0 ldv_kobject_put_~kobj.base))] [2018-02-02 10:47:32,832 INFO 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:47:32,832 INFO L409 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-02-02 10:47:32,832 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-02-02 10:47:32,833 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2018-02-02 10:47:32,833 INFO L87 Difference]: Start difference. First operand 151 states and 159 transitions. Second operand 7 states. [2018-02-02 10:47:32,865 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 10:47:32,866 INFO L93 Difference]: Finished difference Result 161 states and 169 transitions. [2018-02-02 10:47:32,866 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-02-02 10:47:32,866 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 36 [2018-02-02 10:47:32,866 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 10:47:32,868 INFO L225 Difference]: With dead ends: 161 [2018-02-02 10:47:32,868 INFO L226 Difference]: Without dead ends: 161 [2018-02-02 10:47:32,868 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2018-02-02 10:47:32,868 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 161 states. [2018-02-02 10:47:32,871 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 161 to 157. [2018-02-02 10:47:32,872 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 157 states. [2018-02-02 10:47:32,872 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 157 states to 157 states and 165 transitions. [2018-02-02 10:47:32,873 INFO L78 Accepts]: Start accepts. Automaton has 157 states and 165 transitions. Word has length 36 [2018-02-02 10:47:32,873 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 10:47:32,873 INFO L432 AbstractCegarLoop]: Abstraction has 157 states and 165 transitions. [2018-02-02 10:47:32,873 INFO L433 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-02-02 10:47:32,873 INFO L276 IsEmpty]: Start isEmpty. Operand 157 states and 165 transitions. [2018-02-02 10:47:32,874 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2018-02-02 10:47:32,874 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 10:47:32,874 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:47:32,874 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:47:32,875 INFO L82 PathProgramCache]: Analyzing trace with hash 371943704, now seen corresponding path program 2 times [2018-02-02 10:47:32,876 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 10:47:32,887 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 10:47:32,888 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 10:47:32,918 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:47:32,919 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-02 10:47:32,919 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6] total 6 [2018-02-02 10:47:32,919 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 10:47:32,919 INFO 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:47:32,919 INFO L182 omatonBuilderFactory]: Interpolants [2608#(= |#Ultimate.C_memset_#t~loopctr21| 0), 2609#(<= |#Ultimate.C_memset_#t~loopctr21| 1), 2610#(<= |#Ultimate.C_memset_#t~loopctr21| 2), 2611#(<= |#Ultimate.C_memset_#amount| 2), 2606#true, 2607#false] [2018-02-02 10:47:32,919 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:47:32,920 INFO L409 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-02-02 10:47:32,920 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-02-02 10:47:32,920 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2018-02-02 10:47:32,920 INFO L87 Difference]: Start difference. First operand 157 states and 165 transitions. Second operand 6 states. [2018-02-02 10:47:32,941 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 10:47:32,941 INFO L93 Difference]: Finished difference Result 160 states and 168 transitions. [2018-02-02 10:47:32,953 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-02-02 10:47:32,954 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 36 [2018-02-02 10:47:32,954 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 10:47:32,954 INFO L225 Difference]: With dead ends: 160 [2018-02-02 10:47:32,955 INFO L226 Difference]: Without dead ends: 158 [2018-02-02 10:47:32,955 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:47:32,955 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 158 states. [2018-02-02 10:47:32,957 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 158 to 158. [2018-02-02 10:47:32,957 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 158 states. [2018-02-02 10:47:32,958 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 158 states to 158 states and 166 transitions. [2018-02-02 10:47:32,958 INFO L78 Accepts]: Start accepts. Automaton has 158 states and 166 transitions. Word has length 36 [2018-02-02 10:47:32,958 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 10:47:32,958 INFO L432 AbstractCegarLoop]: Abstraction has 158 states and 166 transitions. [2018-02-02 10:47:32,959 INFO L433 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-02-02 10:47:32,959 INFO L276 IsEmpty]: Start isEmpty. Operand 158 states and 166 transitions. [2018-02-02 10:47:32,959 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2018-02-02 10:47:32,959 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 10:47:32,959 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:47:32,960 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:47:32,960 INFO L82 PathProgramCache]: Analyzing trace with hash -1983848104, now seen corresponding path program 1 times [2018-02-02 10:47:32,961 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 10:47:32,965 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 10:47:32,965 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 10:47:32,989 INFO 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:47:32,989 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-02 10:47:32,990 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-02-02 10:47:32,990 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 10:47:32,990 INFO 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:47:32,990 INFO L182 omatonBuilderFactory]: Interpolants [2932#true, 2933#false, 2934#(= |#valid| |old(#valid)|)] [2018-02-02 10:47:32,990 INFO 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:47:32,990 INFO L409 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-02-02 10:47:32,991 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-02-02 10:47:32,991 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-02-02 10:47:32,991 INFO L87 Difference]: Start difference. First operand 158 states and 166 transitions. Second operand 3 states. [2018-02-02 10:47:33,066 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 10:47:33,066 INFO L93 Difference]: Finished difference Result 175 states and 184 transitions. [2018-02-02 10:47:33,067 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-02-02 10:47:33,067 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 34 [2018-02-02 10:47:33,067 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 10:47:33,068 INFO L225 Difference]: With dead ends: 175 [2018-02-02 10:47:33,068 INFO L226 Difference]: Without dead ends: 162 [2018-02-02 10:47:33,068 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-02-02 10:47:33,069 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 162 states. [2018-02-02 10:47:33,072 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 162 to 154. [2018-02-02 10:47:33,073 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 154 states. [2018-02-02 10:47:33,073 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 154 states to 154 states and 161 transitions. [2018-02-02 10:47:33,073 INFO L78 Accepts]: Start accepts. Automaton has 154 states and 161 transitions. Word has length 34 [2018-02-02 10:47:33,074 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 10:47:33,074 INFO L432 AbstractCegarLoop]: Abstraction has 154 states and 161 transitions. [2018-02-02 10:47:33,074 INFO L433 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-02-02 10:47:33,074 INFO L276 IsEmpty]: Start isEmpty. Operand 154 states and 161 transitions. [2018-02-02 10:47:33,074 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2018-02-02 10:47:33,074 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 10:47:33,075 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:47:33,075 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:47:33,075 INFO L82 PathProgramCache]: Analyzing trace with hash 1060490051, now seen corresponding path program 3 times [2018-02-02 10:47:33,076 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 10:47:33,084 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 10:47:33,085 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 10:47:33,110 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:47:33,110 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-02 10:47:33,110 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7] total 7 [2018-02-02 10:47:33,110 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 10:47:33,110 INFO 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:47:33,111 INFO L182 omatonBuilderFactory]: Interpolants [3264#true, 3265#false, 3266#(= |#Ultimate.C_memset_#t~loopctr21| 0), 3267#(<= |#Ultimate.C_memset_#t~loopctr21| 1), 3268#(<= |#Ultimate.C_memset_#t~loopctr21| 2), 3269#(<= |#Ultimate.C_memset_#t~loopctr21| 3), 3270#(<= |#Ultimate.C_memset_#amount| 3)] [2018-02-02 10:47:33,111 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:47:33,111 INFO L409 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-02-02 10:47:33,111 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-02-02 10:47:33,111 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2018-02-02 10:47:33,111 INFO L87 Difference]: Start difference. First operand 154 states and 161 transitions. Second operand 7 states. [2018-02-02 10:47:33,126 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 10:47:33,127 INFO L93 Difference]: Finished difference Result 157 states and 164 transitions. [2018-02-02 10:47:33,127 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-02-02 10:47:33,127 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 37 [2018-02-02 10:47:33,127 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 10:47:33,128 INFO L225 Difference]: With dead ends: 157 [2018-02-02 10:47:33,128 INFO L226 Difference]: Without dead ends: 155 [2018-02-02 10:47:33,128 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:47:33,128 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 155 states. [2018-02-02 10:47:33,130 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 155 to 155. [2018-02-02 10:47:33,130 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 155 states. [2018-02-02 10:47:33,131 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 155 states to 155 states and 162 transitions. [2018-02-02 10:47:33,131 INFO L78 Accepts]: Start accepts. Automaton has 155 states and 162 transitions. Word has length 37 [2018-02-02 10:47:33,131 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 10:47:33,131 INFO L432 AbstractCegarLoop]: Abstraction has 155 states and 162 transitions. [2018-02-02 10:47:33,131 INFO L433 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-02-02 10:47:33,131 INFO L276 IsEmpty]: Start isEmpty. Operand 155 states and 162 transitions. [2018-02-02 10:47:33,132 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2018-02-02 10:47:33,132 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 10:47:33,132 INFO L351 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-02 10:47:33,132 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:47:33,132 INFO L82 PathProgramCache]: Analyzing trace with hash 515535126, now seen corresponding path program 1 times [2018-02-02 10:47:33,133 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 10:47:33,137 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 10:47:33,137 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 10:47:33,156 INFO 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:47:33,156 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-02 10:47:33,156 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-02-02 10:47:33,156 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 10:47:33,156 INFO 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:47:33,156 INFO L182 omatonBuilderFactory]: Interpolants [3585#true, 3586#false, 3587#(not (= |ldv_malloc_#t~malloc4.base| 0)), 3588#(not (= |ldv_malloc_#res.base| 0)), 3589#(not (= |ldv_kobject_create_#t~ret17.base| 0)), 3590#(not (= ldv_kobject_create_~kobj~1.base 0))] [2018-02-02 10:47:33,157 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 10:47:33,157 INFO L409 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-02-02 10:47:33,157 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-02-02 10:47:33,157 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-02-02 10:47:33,157 INFO L87 Difference]: Start difference. First operand 155 states and 162 transitions. Second operand 6 states. [2018-02-02 10:47:33,168 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 10:47:33,168 INFO L93 Difference]: Finished difference Result 140 states and 146 transitions. [2018-02-02 10:47:33,169 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-02-02 10:47:33,169 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 36 [2018-02-02 10:47:33,169 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 10:47:33,169 INFO L225 Difference]: With dead ends: 140 [2018-02-02 10:47:33,169 INFO L226 Difference]: Without dead ends: 140 [2018-02-02 10:47:33,169 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:47:33,170 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 140 states. [2018-02-02 10:47:33,171 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 140 to 140. [2018-02-02 10:47:33,172 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 140 states. [2018-02-02 10:47:33,172 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 140 states to 140 states and 146 transitions. [2018-02-02 10:47:33,172 INFO L78 Accepts]: Start accepts. Automaton has 140 states and 146 transitions. Word has length 36 [2018-02-02 10:47:33,172 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 10:47:33,172 INFO L432 AbstractCegarLoop]: Abstraction has 140 states and 146 transitions. [2018-02-02 10:47:33,172 INFO L433 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-02-02 10:47:33,173 INFO L276 IsEmpty]: Start isEmpty. Operand 140 states and 146 transitions. [2018-02-02 10:47:33,173 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2018-02-02 10:47:33,173 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 10:47:33,173 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:47:33,173 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:47:33,173 INFO L82 PathProgramCache]: Analyzing trace with hash 930590328, now seen corresponding path program 4 times [2018-02-02 10:47:33,174 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 10:47:33,182 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 10:47:33,183 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 10:47:33,216 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:47:33,216 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-02 10:47:33,216 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8] total 8 [2018-02-02 10:47:33,216 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 10:47:33,217 INFO 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:47:33,217 INFO L182 omatonBuilderFactory]: Interpolants [3873#true, 3874#false, 3875#(= |#Ultimate.C_memset_#t~loopctr21| 0), 3876#(<= |#Ultimate.C_memset_#t~loopctr21| 1), 3877#(<= |#Ultimate.C_memset_#t~loopctr21| 2), 3878#(<= |#Ultimate.C_memset_#t~loopctr21| 3), 3879#(<= |#Ultimate.C_memset_#t~loopctr21| 4), 3880#(<= |#Ultimate.C_memset_#amount| 4)] [2018-02-02 10:47:33,217 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:47:33,217 INFO L409 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-02-02 10:47:33,218 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-02-02 10:47:33,218 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2018-02-02 10:47:33,218 INFO L87 Difference]: Start difference. First operand 140 states and 146 transitions. Second operand 8 states. [2018-02-02 10:47:33,235 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 10:47:33,236 INFO L93 Difference]: Finished difference Result 143 states and 149 transitions. [2018-02-02 10:47:33,236 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-02-02 10:47:33,236 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 38 [2018-02-02 10:47:33,236 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 10:47:33,237 INFO L225 Difference]: With dead ends: 143 [2018-02-02 10:47:33,237 INFO L226 Difference]: Without dead ends: 141 [2018-02-02 10:47:33,237 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:47:33,237 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 141 states. [2018-02-02 10:47:33,240 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 141 to 141. [2018-02-02 10:47:33,240 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 141 states. [2018-02-02 10:47:33,241 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 141 states to 141 states and 147 transitions. [2018-02-02 10:47:33,241 INFO L78 Accepts]: Start accepts. Automaton has 141 states and 147 transitions. Word has length 38 [2018-02-02 10:47:33,241 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 10:47:33,241 INFO L432 AbstractCegarLoop]: Abstraction has 141 states and 147 transitions. [2018-02-02 10:47:33,241 INFO L433 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-02-02 10:47:33,241 INFO L276 IsEmpty]: Start isEmpty. Operand 141 states and 147 transitions. [2018-02-02 10:47:33,242 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2018-02-02 10:47:33,242 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 10:47:33,242 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:47:33,242 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:47:33,242 INFO L82 PathProgramCache]: Analyzing trace with hash 1198666211, now seen corresponding path program 5 times [2018-02-02 10:47:33,243 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 10:47:33,252 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 10:47:33,253 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 10:47:33,309 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:47:33,310 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-02 10:47:33,320 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9] total 9 [2018-02-02 10:47:33,321 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 10:47:33,321 INFO 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:47:33,321 INFO L182 omatonBuilderFactory]: Interpolants [4167#true, 4168#false, 4169#(= |#Ultimate.C_memset_#t~loopctr21| 0), 4170#(<= |#Ultimate.C_memset_#t~loopctr21| 1), 4171#(<= |#Ultimate.C_memset_#t~loopctr21| 2), 4172#(<= |#Ultimate.C_memset_#t~loopctr21| 3), 4173#(<= |#Ultimate.C_memset_#t~loopctr21| 4), 4174#(<= |#Ultimate.C_memset_#t~loopctr21| 5), 4175#(<= |#Ultimate.C_memset_#amount| 5)] [2018-02-02 10:47:33,321 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:47:33,321 INFO L409 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-02-02 10:47:33,322 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-02-02 10:47:33,322 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2018-02-02 10:47:33,322 INFO L87 Difference]: Start difference. First operand 141 states and 147 transitions. Second operand 9 states. [2018-02-02 10:47:33,349 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 10:47:33,349 INFO L93 Difference]: Finished difference Result 144 states and 150 transitions. [2018-02-02 10:47:33,349 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-02-02 10:47:33,349 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 39 [2018-02-02 10:47:33,349 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 10:47:33,350 INFO L225 Difference]: With dead ends: 144 [2018-02-02 10:47:33,350 INFO L226 Difference]: Without dead ends: 142 [2018-02-02 10:47:33,350 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:47:33,351 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 142 states. [2018-02-02 10:47:33,353 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 142 to 142. [2018-02-02 10:47:33,353 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 142 states. [2018-02-02 10:47:33,353 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 142 states to 142 states and 148 transitions. [2018-02-02 10:47:33,354 INFO L78 Accepts]: Start accepts. Automaton has 142 states and 148 transitions. Word has length 39 [2018-02-02 10:47:33,354 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 10:47:33,354 INFO L432 AbstractCegarLoop]: Abstraction has 142 states and 148 transitions. [2018-02-02 10:47:33,354 INFO L433 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-02-02 10:47:33,354 INFO L276 IsEmpty]: Start isEmpty. Operand 142 states and 148 transitions. [2018-02-02 10:47:33,354 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2018-02-02 10:47:33,354 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 10:47:33,355 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:47:33,355 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:47:33,355 INFO L82 PathProgramCache]: Analyzing trace with hash 919083992, now seen corresponding path program 6 times [2018-02-02 10:47:33,355 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 10:47:33,363 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 10:47:33,364 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 10:47:33,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:47:33,402 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-02 10:47:33,402 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10] total 10 [2018-02-02 10:47:33,402 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 10:47:33,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:47:33,402 INFO L182 omatonBuilderFactory]: Interpolants [4464#true, 4465#false, 4466#(= |#Ultimate.C_memset_#t~loopctr21| 0), 4467#(<= |#Ultimate.C_memset_#t~loopctr21| 1), 4468#(<= |#Ultimate.C_memset_#t~loopctr21| 2), 4469#(<= |#Ultimate.C_memset_#t~loopctr21| 3), 4470#(<= |#Ultimate.C_memset_#t~loopctr21| 4), 4471#(<= |#Ultimate.C_memset_#t~loopctr21| 5), 4472#(<= |#Ultimate.C_memset_#t~loopctr21| 6), 4473#(<= |#Ultimate.C_memset_#amount| 6)] [2018-02-02 10:47:33,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:47:33,403 INFO L409 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-02-02 10:47:33,403 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-02-02 10:47:33,403 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2018-02-02 10:47:33,403 INFO L87 Difference]: Start difference. First operand 142 states and 148 transitions. Second operand 10 states. [2018-02-02 10:47:33,423 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 10:47:33,423 INFO L93 Difference]: Finished difference Result 145 states and 151 transitions. [2018-02-02 10:47:33,423 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-02-02 10:47:33,423 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 40 [2018-02-02 10:47:33,423 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 10:47:33,424 INFO L225 Difference]: With dead ends: 145 [2018-02-02 10:47:33,424 INFO L226 Difference]: Without dead ends: 143 [2018-02-02 10:47:33,424 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:47:33,425 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 143 states. [2018-02-02 10:47:33,427 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 143 to 143. [2018-02-02 10:47:33,427 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 143 states. [2018-02-02 10:47:33,427 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 143 states to 143 states and 149 transitions. [2018-02-02 10:47:33,427 INFO L78 Accepts]: Start accepts. Automaton has 143 states and 149 transitions. Word has length 40 [2018-02-02 10:47:33,428 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 10:47:33,428 INFO L432 AbstractCegarLoop]: Abstraction has 143 states and 149 transitions. [2018-02-02 10:47:33,428 INFO L433 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-02-02 10:47:33,428 INFO L276 IsEmpty]: Start isEmpty. Operand 143 states and 149 transitions. [2018-02-02 10:47:33,428 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2018-02-02 10:47:33,428 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 10:47:33,428 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:47:33,428 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:47:33,428 INFO L82 PathProgramCache]: Analyzing trace with hash 841969795, now seen corresponding path program 7 times [2018-02-02 10:47:33,429 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 10:47:33,438 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 10:47:33,440 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 10:47:33,497 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:47:33,497 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-02 10:47:33,497 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [11] total 11 [2018-02-02 10:47:33,497 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 10:47:33,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:47:33,498 INFO L182 omatonBuilderFactory]: Interpolants [4768#(<= |#Ultimate.C_memset_#t~loopctr21| 2), 4769#(<= |#Ultimate.C_memset_#t~loopctr21| 3), 4770#(<= |#Ultimate.C_memset_#t~loopctr21| 4), 4771#(<= |#Ultimate.C_memset_#t~loopctr21| 5), 4772#(<= |#Ultimate.C_memset_#t~loopctr21| 6), 4773#(<= |#Ultimate.C_memset_#t~loopctr21| 7), 4774#(<= |#Ultimate.C_memset_#amount| 7), 4764#true, 4765#false, 4766#(= |#Ultimate.C_memset_#t~loopctr21| 0), 4767#(<= |#Ultimate.C_memset_#t~loopctr21| 1)] [2018-02-02 10:47:33,498 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:47:33,498 INFO L409 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-02-02 10:47:33,498 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-02-02 10:47:33,498 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=63, Unknown=0, NotChecked=0, Total=110 [2018-02-02 10:47:33,499 INFO L87 Difference]: Start difference. First operand 143 states and 149 transitions. Second operand 11 states. [2018-02-02 10:47:33,521 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 10:47:33,522 INFO L93 Difference]: Finished difference Result 146 states and 152 transitions. [2018-02-02 10:47:33,522 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-02-02 10:47:33,522 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 41 [2018-02-02 10:47:33,522 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 10:47:33,523 INFO L225 Difference]: With dead ends: 146 [2018-02-02 10:47:33,523 INFO L226 Difference]: Without dead ends: 144 [2018-02-02 10:47:33,523 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:47:33,523 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 144 states. [2018-02-02 10:47:33,525 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 144 to 144. [2018-02-02 10:47:33,525 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 144 states. [2018-02-02 10:47:33,526 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 144 states to 144 states and 150 transitions. [2018-02-02 10:47:33,526 INFO L78 Accepts]: Start accepts. Automaton has 144 states and 150 transitions. Word has length 41 [2018-02-02 10:47:33,526 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 10:47:33,526 INFO L432 AbstractCegarLoop]: Abstraction has 144 states and 150 transitions. [2018-02-02 10:47:33,526 INFO L433 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-02-02 10:47:33,527 INFO L276 IsEmpty]: Start isEmpty. Operand 144 states and 150 transitions. [2018-02-02 10:47:33,527 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2018-02-02 10:47:33,527 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 10:47:33,527 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:47:33,527 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:47:33,528 INFO L82 PathProgramCache]: Analyzing trace with hash -1548570312, now seen corresponding path program 8 times [2018-02-02 10:47:33,528 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 10:47:33,536 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 10:47:33,537 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 10:47:33,606 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:47:33,606 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-02 10:47:33,606 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [12] total 12 [2018-02-02 10:47:33,607 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 10:47:33,607 INFO 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:47:33,607 INFO L182 omatonBuilderFactory]: Interpolants [5072#(<= |#Ultimate.C_memset_#t~loopctr21| 3), 5073#(<= |#Ultimate.C_memset_#t~loopctr21| 4), 5074#(<= |#Ultimate.C_memset_#t~loopctr21| 5), 5075#(<= |#Ultimate.C_memset_#t~loopctr21| 6), 5076#(<= |#Ultimate.C_memset_#t~loopctr21| 7), 5077#(<= |#Ultimate.C_memset_#t~loopctr21| 8), 5078#(<= |#Ultimate.C_memset_#amount| 8), 5067#true, 5068#false, 5069#(= |#Ultimate.C_memset_#t~loopctr21| 0), 5070#(<= |#Ultimate.C_memset_#t~loopctr21| 1), 5071#(<= |#Ultimate.C_memset_#t~loopctr21| 2)] [2018-02-02 10:47:33,607 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:47:33,607 INFO L409 AbstractCegarLoop]: Interpolant automaton has 12 states [2018-02-02 10:47:33,607 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2018-02-02 10:47:33,608 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=75, Unknown=0, NotChecked=0, Total=132 [2018-02-02 10:47:33,608 INFO L87 Difference]: Start difference. First operand 144 states and 150 transitions. Second operand 12 states. [2018-02-02 10:47:33,630 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 10:47:33,630 INFO L93 Difference]: Finished difference Result 147 states and 153 transitions. [2018-02-02 10:47:33,631 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-02-02 10:47:33,631 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 42 [2018-02-02 10:47:33,631 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 10:47:33,631 INFO L225 Difference]: With dead ends: 147 [2018-02-02 10:47:33,631 INFO L226 Difference]: Without dead ends: 145 [2018-02-02 10:47:33,632 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:47:33,632 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 145 states. [2018-02-02 10:47:33,633 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 145 to 145. [2018-02-02 10:47:33,633 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 145 states. [2018-02-02 10:47:33,634 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 145 states to 145 states and 151 transitions. [2018-02-02 10:47:33,634 INFO L78 Accepts]: Start accepts. Automaton has 145 states and 151 transitions. Word has length 42 [2018-02-02 10:47:33,634 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 10:47:33,634 INFO L432 AbstractCegarLoop]: Abstraction has 145 states and 151 transitions. [2018-02-02 10:47:33,634 INFO L433 AbstractCegarLoop]: Interpolant automaton has 12 states. [2018-02-02 10:47:33,634 INFO L276 IsEmpty]: Start isEmpty. Operand 145 states and 151 transitions. [2018-02-02 10:47:33,634 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2018-02-02 10:47:33,635 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 10:47:33,635 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:47:33,635 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:47:33,635 INFO L82 PathProgramCache]: Analyzing trace with hash 1654097699, now seen corresponding path program 9 times [2018-02-02 10:47:33,636 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 10:47:33,644 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 10:47:33,645 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 10:47:33,703 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:47:33,703 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-02 10:47:33,704 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [13] total 13 [2018-02-02 10:47:33,704 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 10:47:33,704 INFO 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:47:33,704 INFO L182 omatonBuilderFactory]: Interpolants [5376#(<= |#Ultimate.C_memset_#t~loopctr21| 1), 5377#(<= |#Ultimate.C_memset_#t~loopctr21| 2), 5378#(<= |#Ultimate.C_memset_#t~loopctr21| 3), 5379#(<= |#Ultimate.C_memset_#t~loopctr21| 4), 5380#(<= |#Ultimate.C_memset_#t~loopctr21| 5), 5381#(<= |#Ultimate.C_memset_#t~loopctr21| 6), 5382#(<= |#Ultimate.C_memset_#t~loopctr21| 7), 5383#(<= |#Ultimate.C_memset_#t~loopctr21| 8), 5384#(<= |#Ultimate.C_memset_#t~loopctr21| 9), 5385#(<= |#Ultimate.C_memset_#amount| 9), 5373#true, 5374#false, 5375#(= |#Ultimate.C_memset_#t~loopctr21| 0)] [2018-02-02 10:47:33,704 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:47:33,704 INFO L409 AbstractCegarLoop]: Interpolant automaton has 13 states [2018-02-02 10:47:33,704 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2018-02-02 10:47:33,705 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=68, Invalid=88, Unknown=0, NotChecked=0, Total=156 [2018-02-02 10:47:33,705 INFO L87 Difference]: Start difference. First operand 145 states and 151 transitions. Second operand 13 states. [2018-02-02 10:47:33,730 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 10:47:33,730 INFO L93 Difference]: Finished difference Result 148 states and 154 transitions. [2018-02-02 10:47:33,730 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2018-02-02 10:47:33,730 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 43 [2018-02-02 10:47:33,730 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 10:47:33,731 INFO L225 Difference]: With dead ends: 148 [2018-02-02 10:47:33,731 INFO L226 Difference]: Without dead ends: 146 [2018-02-02 10:47:33,731 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:47:33,731 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 146 states. [2018-02-02 10:47:33,733 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 146 to 146. [2018-02-02 10:47:33,733 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 146 states. [2018-02-02 10:47:33,733 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 146 states to 146 states and 152 transitions. [2018-02-02 10:47:33,733 INFO L78 Accepts]: Start accepts. Automaton has 146 states and 152 transitions. Word has length 43 [2018-02-02 10:47:33,734 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 10:47:33,734 INFO L432 AbstractCegarLoop]: Abstraction has 146 states and 152 transitions. [2018-02-02 10:47:33,734 INFO L433 AbstractCegarLoop]: Interpolant automaton has 13 states. [2018-02-02 10:47:33,734 INFO L276 IsEmpty]: Start isEmpty. Operand 146 states and 152 transitions. [2018-02-02 10:47:33,734 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2018-02-02 10:47:33,734 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 10:47:33,734 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:47:33,734 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:47:33,735 INFO L82 PathProgramCache]: Analyzing trace with hash -2142409064, now seen corresponding path program 10 times [2018-02-02 10:47:33,735 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 10:47:33,744 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 10:47:33,745 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 10:47:33,815 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:47:33,815 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-02 10:47:33,815 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [14] total 14 [2018-02-02 10:47:33,815 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 10:47:33,815 INFO 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:47:33,815 INFO L182 omatonBuilderFactory]: Interpolants [5682#true, 5683#false, 5684#(= |#Ultimate.C_memset_#t~loopctr21| 0), 5685#(<= |#Ultimate.C_memset_#t~loopctr21| 1), 5686#(<= |#Ultimate.C_memset_#t~loopctr21| 2), 5687#(<= |#Ultimate.C_memset_#t~loopctr21| 3), 5688#(<= |#Ultimate.C_memset_#t~loopctr21| 4), 5689#(<= |#Ultimate.C_memset_#t~loopctr21| 5), 5690#(<= |#Ultimate.C_memset_#t~loopctr21| 6), 5691#(<= |#Ultimate.C_memset_#t~loopctr21| 7), 5692#(<= |#Ultimate.C_memset_#t~loopctr21| 8), 5693#(<= |#Ultimate.C_memset_#t~loopctr21| 9), 5694#(<= |#Ultimate.C_memset_#t~loopctr21| 10), 5695#(<= |#Ultimate.C_memset_#amount| 10)] [2018-02-02 10:47:33,816 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:47:33,816 INFO L409 AbstractCegarLoop]: Interpolant automaton has 14 states [2018-02-02 10:47:33,816 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2018-02-02 10:47:33,816 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=80, Invalid=102, Unknown=0, NotChecked=0, Total=182 [2018-02-02 10:47:33,816 INFO L87 Difference]: Start difference. First operand 146 states and 152 transitions. Second operand 14 states. [2018-02-02 10:47:33,845 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 10:47:33,846 INFO L93 Difference]: Finished difference Result 149 states and 155 transitions. [2018-02-02 10:47:33,846 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2018-02-02 10:47:33,846 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 44 [2018-02-02 10:47:33,846 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 10:47:33,847 INFO L225 Difference]: With dead ends: 149 [2018-02-02 10:47:33,847 INFO L226 Difference]: Without dead ends: 147 [2018-02-02 10:47:33,847 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:47:33,847 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 147 states. [2018-02-02 10:47:33,849 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 147 to 147. [2018-02-02 10:47:33,849 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 147 states. [2018-02-02 10:47:33,850 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 147 states to 147 states and 153 transitions. [2018-02-02 10:47:33,850 INFO L78 Accepts]: Start accepts. Automaton has 147 states and 153 transitions. Word has length 44 [2018-02-02 10:47:33,850 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 10:47:33,850 INFO L432 AbstractCegarLoop]: Abstraction has 147 states and 153 transitions. [2018-02-02 10:47:33,850 INFO L433 AbstractCegarLoop]: Interpolant automaton has 14 states. [2018-02-02 10:47:33,850 INFO L276 IsEmpty]: Start isEmpty. Operand 147 states and 153 transitions. [2018-02-02 10:47:33,851 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2018-02-02 10:47:33,851 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 10:47:33,851 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:47:33,851 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:47:33,851 INFO L82 PathProgramCache]: Analyzing trace with hash 424965571, now seen corresponding path program 11 times [2018-02-02 10:47:33,852 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 10:47:33,860 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 10:47:33,861 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 10:47:33,939 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:47:33,939 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-02 10:47:33,939 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [15] total 15 [2018-02-02 10:47:33,939 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 10:47:33,939 INFO 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:47:33,940 INFO L182 omatonBuilderFactory]: Interpolants [5994#true, 5995#false, 5996#(= |#Ultimate.C_memset_#t~loopctr21| 0), 5997#(<= |#Ultimate.C_memset_#t~loopctr21| 1), 5998#(<= |#Ultimate.C_memset_#t~loopctr21| 2), 5999#(<= |#Ultimate.C_memset_#t~loopctr21| 3), 6000#(<= |#Ultimate.C_memset_#t~loopctr21| 4), 6001#(<= |#Ultimate.C_memset_#t~loopctr21| 5), 6002#(<= |#Ultimate.C_memset_#t~loopctr21| 6), 6003#(<= |#Ultimate.C_memset_#t~loopctr21| 7), 6004#(<= |#Ultimate.C_memset_#t~loopctr21| 8), 6005#(<= |#Ultimate.C_memset_#t~loopctr21| 9), 6006#(<= |#Ultimate.C_memset_#t~loopctr21| 10), 6007#(<= |#Ultimate.C_memset_#t~loopctr21| 11), 6008#(<= |#Ultimate.C_memset_#amount| 11)] [2018-02-02 10:47:33,940 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:47:33,940 INFO L409 AbstractCegarLoop]: Interpolant automaton has 15 states [2018-02-02 10:47:33,940 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2018-02-02 10:47:33,940 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=93, Invalid=117, Unknown=0, NotChecked=0, Total=210 [2018-02-02 10:47:33,940 INFO L87 Difference]: Start difference. First operand 147 states and 153 transitions. Second operand 15 states. [2018-02-02 10:47:33,966 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 10:47:33,966 INFO L93 Difference]: Finished difference Result 150 states and 156 transitions. [2018-02-02 10:47:33,966 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2018-02-02 10:47:33,966 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 45 [2018-02-02 10:47:33,967 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 10:47:33,967 INFO L225 Difference]: With dead ends: 150 [2018-02-02 10:47:33,967 INFO L226 Difference]: Without dead ends: 148 [2018-02-02 10:47:33,967 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:47:33,968 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 148 states. [2018-02-02 10:47:33,969 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 148 to 148. [2018-02-02 10:47:33,969 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 148 states. [2018-02-02 10:47:33,970 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 148 states to 148 states and 154 transitions. [2018-02-02 10:47:33,970 INFO L78 Accepts]: Start accepts. Automaton has 148 states and 154 transitions. Word has length 45 [2018-02-02 10:47:33,970 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 10:47:33,970 INFO L432 AbstractCegarLoop]: Abstraction has 148 states and 154 transitions. [2018-02-02 10:47:33,970 INFO L433 AbstractCegarLoop]: Interpolant automaton has 15 states. [2018-02-02 10:47:33,970 INFO L276 IsEmpty]: Start isEmpty. Operand 148 states and 154 transitions. [2018-02-02 10:47:33,970 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2018-02-02 10:47:33,970 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 10:47:33,970 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:47:33,971 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:47:33,971 INFO L82 PathProgramCache]: Analyzing trace with hash -1590799368, now seen corresponding path program 12 times [2018-02-02 10:47:33,971 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 10:47:33,986 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 10:47:33,987 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 10:47:34,159 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:47:34,160 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-02 10:47:34,160 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [16] total 16 [2018-02-02 10:47:34,160 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 10:47:34,160 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 10:47:34,160 INFO L182 omatonBuilderFactory]: Interpolants [6309#true, 6310#false, 6311#(= |#Ultimate.C_memset_#t~loopctr21| 0), 6312#(<= |#Ultimate.C_memset_#t~loopctr21| 1), 6313#(<= |#Ultimate.C_memset_#t~loopctr21| 2), 6314#(<= |#Ultimate.C_memset_#t~loopctr21| 3), 6315#(<= |#Ultimate.C_memset_#t~loopctr21| 4), 6316#(<= |#Ultimate.C_memset_#t~loopctr21| 5), 6317#(<= |#Ultimate.C_memset_#t~loopctr21| 6), 6318#(<= |#Ultimate.C_memset_#t~loopctr21| 7), 6319#(<= |#Ultimate.C_memset_#t~loopctr21| 8), 6320#(<= |#Ultimate.C_memset_#t~loopctr21| 9), 6321#(<= |#Ultimate.C_memset_#t~loopctr21| 10), 6322#(<= |#Ultimate.C_memset_#t~loopctr21| 11), 6323#(<= |#Ultimate.C_memset_#t~loopctr21| 12), 6324#(<= |#Ultimate.C_memset_#amount| 12)] [2018-02-02 10:47:34,161 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:47:34,161 INFO L409 AbstractCegarLoop]: Interpolant automaton has 16 states [2018-02-02 10:47:34,161 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2018-02-02 10:47:34,161 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=107, Invalid=133, Unknown=0, NotChecked=0, Total=240 [2018-02-02 10:47:34,161 INFO L87 Difference]: Start difference. First operand 148 states and 154 transitions. Second operand 16 states. [2018-02-02 10:47:34,221 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 10:47:34,221 INFO L93 Difference]: Finished difference Result 151 states and 157 transitions. [2018-02-02 10:47:34,226 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2018-02-02 10:47:34,226 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 46 [2018-02-02 10:47:34,226 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 10:47:34,227 INFO L225 Difference]: With dead ends: 151 [2018-02-02 10:47:34,227 INFO L226 Difference]: Without dead ends: 149 [2018-02-02 10:47:34,227 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=111, Invalid=161, Unknown=0, NotChecked=0, Total=272 [2018-02-02 10:47:34,227 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 149 states. [2018-02-02 10:47:34,229 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 149 to 149. [2018-02-02 10:47:34,229 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 149 states. [2018-02-02 10:47:34,229 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 149 states to 149 states and 155 transitions. [2018-02-02 10:47:34,229 INFO L78 Accepts]: Start accepts. Automaton has 149 states and 155 transitions. Word has length 46 [2018-02-02 10:47:34,229 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 10:47:34,229 INFO L432 AbstractCegarLoop]: Abstraction has 149 states and 155 transitions. [2018-02-02 10:47:34,229 INFO L433 AbstractCegarLoop]: Interpolant automaton has 16 states. [2018-02-02 10:47:34,230 INFO L276 IsEmpty]: Start isEmpty. Operand 149 states and 155 transitions. [2018-02-02 10:47:34,230 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2018-02-02 10:47:34,230 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 10:47:34,230 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:47:34,230 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:47:34,230 INFO L82 PathProgramCache]: Analyzing trace with hash 344996963, now seen corresponding path program 13 times [2018-02-02 10:47:34,231 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 10:47:34,242 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 10:47:34,243 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 10:47:34,358 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:47:34,358 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-02 10:47:34,358 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [17] total 17 [2018-02-02 10:47:34,358 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 10:47:34,358 INFO 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:47:34,358 INFO L182 omatonBuilderFactory]: Interpolants [6627#true, 6628#false, 6629#(= |#Ultimate.C_memset_#t~loopctr21| 0), 6630#(<= |#Ultimate.C_memset_#t~loopctr21| 1), 6631#(<= |#Ultimate.C_memset_#t~loopctr21| 2), 6632#(<= |#Ultimate.C_memset_#t~loopctr21| 3), 6633#(<= |#Ultimate.C_memset_#t~loopctr21| 4), 6634#(<= |#Ultimate.C_memset_#t~loopctr21| 5), 6635#(<= |#Ultimate.C_memset_#t~loopctr21| 6), 6636#(<= |#Ultimate.C_memset_#t~loopctr21| 7), 6637#(<= |#Ultimate.C_memset_#t~loopctr21| 8), 6638#(<= |#Ultimate.C_memset_#t~loopctr21| 9), 6639#(<= |#Ultimate.C_memset_#t~loopctr21| 10), 6640#(<= |#Ultimate.C_memset_#t~loopctr21| 11), 6641#(<= |#Ultimate.C_memset_#t~loopctr21| 12), 6642#(<= |#Ultimate.C_memset_#t~loopctr21| 13), 6643#(<= |#Ultimate.C_memset_#amount| 13)] [2018-02-02 10:47:34,359 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:47:34,359 INFO L409 AbstractCegarLoop]: Interpolant automaton has 17 states [2018-02-02 10:47:34,359 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2018-02-02 10:47:34,359 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=122, Invalid=150, Unknown=0, NotChecked=0, Total=272 [2018-02-02 10:47:34,359 INFO L87 Difference]: Start difference. First operand 149 states and 155 transitions. Second operand 17 states. [2018-02-02 10:47:34,387 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 10:47:34,387 INFO L93 Difference]: Finished difference Result 152 states and 158 transitions. [2018-02-02 10:47:34,392 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2018-02-02 10:47:34,393 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 47 [2018-02-02 10:47:34,393 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 10:47:34,393 INFO L225 Difference]: With dead ends: 152 [2018-02-02 10:47:34,393 INFO L226 Difference]: Without dead ends: 150 [2018-02-02 10:47:34,394 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:47:34,394 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 150 states. [2018-02-02 10:47:34,395 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 150 to 150. [2018-02-02 10:47:34,395 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 150 states. [2018-02-02 10:47:34,396 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 150 states to 150 states and 156 transitions. [2018-02-02 10:47:34,396 INFO L78 Accepts]: Start accepts. Automaton has 150 states and 156 transitions. Word has length 47 [2018-02-02 10:47:34,396 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 10:47:34,396 INFO L432 AbstractCegarLoop]: Abstraction has 150 states and 156 transitions. [2018-02-02 10:47:34,396 INFO L433 AbstractCegarLoop]: Interpolant automaton has 17 states. [2018-02-02 10:47:34,396 INFO L276 IsEmpty]: Start isEmpty. Operand 150 states and 156 transitions. [2018-02-02 10:47:34,396 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2018-02-02 10:47:34,396 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 10:47:34,397 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:47:34,397 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:47:34,397 INFO L82 PathProgramCache]: Analyzing trace with hash 225141080, now seen corresponding path program 14 times [2018-02-02 10:47:34,398 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 10:47:34,407 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 10:47:34,408 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 10:47:34,528 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:47:34,529 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-02 10:47:34,529 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [18] total 18 [2018-02-02 10:47:34,529 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 10:47:34,529 INFO 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:47:34,529 INFO L182 omatonBuilderFactory]: Interpolants [6948#true, 6949#false, 6950#(= |#Ultimate.C_memset_#t~loopctr21| 0), 6951#(<= |#Ultimate.C_memset_#t~loopctr21| 1), 6952#(<= |#Ultimate.C_memset_#t~loopctr21| 2), 6953#(<= |#Ultimate.C_memset_#t~loopctr21| 3), 6954#(<= |#Ultimate.C_memset_#t~loopctr21| 4), 6955#(<= |#Ultimate.C_memset_#t~loopctr21| 5), 6956#(<= |#Ultimate.C_memset_#t~loopctr21| 6), 6957#(<= |#Ultimate.C_memset_#t~loopctr21| 7), 6958#(<= |#Ultimate.C_memset_#t~loopctr21| 8), 6959#(<= |#Ultimate.C_memset_#t~loopctr21| 9), 6960#(<= |#Ultimate.C_memset_#t~loopctr21| 10), 6961#(<= |#Ultimate.C_memset_#t~loopctr21| 11), 6962#(<= |#Ultimate.C_memset_#t~loopctr21| 12), 6963#(<= |#Ultimate.C_memset_#t~loopctr21| 13), 6964#(<= |#Ultimate.C_memset_#t~loopctr21| 14), 6965#(<= |#Ultimate.C_memset_#amount| 14)] [2018-02-02 10:47:34,529 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:47:34,529 INFO L409 AbstractCegarLoop]: Interpolant automaton has 18 states [2018-02-02 10:47:34,529 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2018-02-02 10:47:34,530 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=138, Invalid=168, Unknown=0, NotChecked=0, Total=306 [2018-02-02 10:47:34,530 INFO L87 Difference]: Start difference. First operand 150 states and 156 transitions. Second operand 18 states. [2018-02-02 10:47:34,565 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 10:47:34,565 INFO L93 Difference]: Finished difference Result 153 states and 159 transitions. [2018-02-02 10:47:34,566 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2018-02-02 10:47:34,566 INFO L78 Accepts]: Start accepts. Automaton has 18 states. Word has length 48 [2018-02-02 10:47:34,566 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 10:47:34,567 INFO L225 Difference]: With dead ends: 153 [2018-02-02 10:47:34,567 INFO L226 Difference]: Without dead ends: 151 [2018-02-02 10:47:34,567 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:47:34,567 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 151 states. [2018-02-02 10:47:34,570 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 151 to 151. [2018-02-02 10:47:34,570 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 151 states. [2018-02-02 10:47:34,571 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 151 states to 151 states and 157 transitions. [2018-02-02 10:47:34,571 INFO L78 Accepts]: Start accepts. Automaton has 151 states and 157 transitions. Word has length 48 [2018-02-02 10:47:34,571 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 10:47:34,571 INFO L432 AbstractCegarLoop]: Abstraction has 151 states and 157 transitions. [2018-02-02 10:47:34,571 INFO L433 AbstractCegarLoop]: Interpolant automaton has 18 states. [2018-02-02 10:47:34,571 INFO L276 IsEmpty]: Start isEmpty. Operand 151 states and 157 transitions. [2018-02-02 10:47:34,572 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2018-02-02 10:47:34,572 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 10:47:34,572 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:47:34,572 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:47:34,572 INFO L82 PathProgramCache]: Analyzing trace with hash 804576003, now seen corresponding path program 15 times [2018-02-02 10:47:34,573 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 10:47:34,588 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 10:47:34,589 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 10:47:34,743 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:47:34,743 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-02 10:47:34,743 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [19] total 19 [2018-02-02 10:47:34,744 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 10:47:34,744 INFO 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:47:34,744 INFO L182 omatonBuilderFactory]: Interpolants [7272#true, 7273#false, 7274#(= |#Ultimate.C_memset_#t~loopctr21| 0), 7275#(<= |#Ultimate.C_memset_#t~loopctr21| 1), 7276#(<= |#Ultimate.C_memset_#t~loopctr21| 2), 7277#(<= |#Ultimate.C_memset_#t~loopctr21| 3), 7278#(<= |#Ultimate.C_memset_#t~loopctr21| 4), 7279#(<= |#Ultimate.C_memset_#t~loopctr21| 5), 7280#(<= |#Ultimate.C_memset_#t~loopctr21| 6), 7281#(<= |#Ultimate.C_memset_#t~loopctr21| 7), 7282#(<= |#Ultimate.C_memset_#t~loopctr21| 8), 7283#(<= |#Ultimate.C_memset_#t~loopctr21| 9), 7284#(<= |#Ultimate.C_memset_#t~loopctr21| 10), 7285#(<= |#Ultimate.C_memset_#t~loopctr21| 11), 7286#(<= |#Ultimate.C_memset_#t~loopctr21| 12), 7287#(<= |#Ultimate.C_memset_#t~loopctr21| 13), 7288#(<= |#Ultimate.C_memset_#t~loopctr21| 14), 7289#(<= |#Ultimate.C_memset_#t~loopctr21| 15), 7290#(<= |#Ultimate.C_memset_#amount| 15)] [2018-02-02 10:47:34,744 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:47:34,745 INFO L409 AbstractCegarLoop]: Interpolant automaton has 19 states [2018-02-02 10:47:34,745 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2018-02-02 10:47:34,745 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=155, Invalid=187, Unknown=0, NotChecked=0, Total=342 [2018-02-02 10:47:34,745 INFO L87 Difference]: Start difference. First operand 151 states and 157 transitions. Second operand 19 states. [2018-02-02 10:47:34,785 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 10:47:34,785 INFO L93 Difference]: Finished difference Result 154 states and 160 transitions. [2018-02-02 10:47:34,786 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2018-02-02 10:47:34,786 INFO L78 Accepts]: Start accepts. Automaton has 19 states. Word has length 49 [2018-02-02 10:47:34,786 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 10:47:34,787 INFO L225 Difference]: With dead ends: 154 [2018-02-02 10:47:34,787 INFO L226 Difference]: Without dead ends: 152 [2018-02-02 10:47:34,787 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:47:34,787 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 152 states. [2018-02-02 10:47:34,789 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 152 to 152. [2018-02-02 10:47:34,790 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 152 states. [2018-02-02 10:47:34,790 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 152 states to 152 states and 158 transitions. [2018-02-02 10:47:34,790 INFO L78 Accepts]: Start accepts. Automaton has 152 states and 158 transitions. Word has length 49 [2018-02-02 10:47:34,792 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 10:47:34,793 INFO L432 AbstractCegarLoop]: Abstraction has 152 states and 158 transitions. [2018-02-02 10:47:34,793 INFO L433 AbstractCegarLoop]: Interpolant automaton has 19 states. [2018-02-02 10:47:34,793 INFO L276 IsEmpty]: Start isEmpty. Operand 152 states and 158 transitions. [2018-02-02 10:47:34,793 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2018-02-02 10:47:34,793 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 10:47:34,794 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:47:34,794 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:47:34,794 INFO L82 PathProgramCache]: Analyzing trace with hash 1587189432, now seen corresponding path program 16 times [2018-02-02 10:47:34,795 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 10:47:34,809 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 10:47:34,810 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 10:47: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:47:34,987 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-02 10:47:34,987 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2018-02-02 10:47:34,987 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 10:47:34,987 INFO 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:47:34,988 INFO L182 omatonBuilderFactory]: Interpolants [7599#true, 7600#false, 7601#(= 0 |ldv_malloc_#t~malloc4.offset|), 7602#(= 0 |ldv_malloc_#res.offset|), 7603#(= 0 |ldv_kobject_create_#t~ret17.offset|), 7604#(= 0 ldv_kobject_create_~kobj~1.offset), 7605#(or (<= (+ |#Ultimate.C_memset_#ptr.offset| |#Ultimate.C_memset_#amount|) (select |#length| |#Ultimate.C_memset_#ptr.base|)) (not (= |#Ultimate.C_memset_#ptr.offset| 0))), 7606#(and (= 0 ldv_kobject_create_~kobj~1.offset) (<= 16 (select |#length| ldv_kobject_create_~kobj~1.base))), 7607#(and (= 0 |ldv_kobject_init_#in~kobj.offset|) (<= 16 (select |#length| |ldv_kobject_init_#in~kobj.base|))), 7608#(and (= 0 ldv_kobject_init_~kobj.offset) (<= 16 (select |#length| ldv_kobject_init_~kobj.base))), 7609#(and (<= 16 (select |#length| |ldv_kobject_init_internal_#in~kobj.base|)) (= 0 |ldv_kobject_init_internal_#in~kobj.offset|)), 7610#(and (<= 16 (select |#length| ldv_kobject_init_internal_~kobj.base)) (= ldv_kobject_init_internal_~kobj.offset 0)), 7611#(and (<= (+ |ldv_kref_init_#in~kref.offset| 4) (select |#length| |ldv_kref_init_#in~kref.base|)) (<= 12 |ldv_kref_init_#in~kref.offset|)), 7612#(and (<= 12 ldv_kref_init_~kref.offset) (<= (+ ldv_kref_init_~kref.offset 4) (select |#length| ldv_kref_init_~kref.base)))] [2018-02-02 10:47:34,988 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:47:34,988 INFO L409 AbstractCegarLoop]: Interpolant automaton has 14 states [2018-02-02 10:47:34,988 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2018-02-02 10:47:34,988 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=156, Unknown=0, NotChecked=0, Total=182 [2018-02-02 10:47:34,989 INFO L87 Difference]: Start difference. First operand 152 states and 158 transitions. Second operand 14 states. [2018-02-02 10:47:35,311 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 10:47:35,311 INFO L93 Difference]: Finished difference Result 151 states and 157 transitions. [2018-02-02 10:47:35,311 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2018-02-02 10:47:35,311 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 50 [2018-02-02 10:47:35,312 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 10:47:35,312 INFO L225 Difference]: With dead ends: 151 [2018-02-02 10:47:35,312 INFO L226 Difference]: Without dead ends: 151 [2018-02-02 10:47:35,313 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:47:35,313 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 151 states. [2018-02-02 10:47:35,316 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 151 to 151. [2018-02-02 10:47:35,316 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 151 states. [2018-02-02 10:47:35,317 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 151 states to 151 states and 157 transitions. [2018-02-02 10:47:35,317 INFO L78 Accepts]: Start accepts. Automaton has 151 states and 157 transitions. Word has length 50 [2018-02-02 10:47:35,317 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 10:47:35,317 INFO L432 AbstractCegarLoop]: Abstraction has 151 states and 157 transitions. [2018-02-02 10:47:35,317 INFO L433 AbstractCegarLoop]: Interpolant automaton has 14 states. [2018-02-02 10:47:35,318 INFO L276 IsEmpty]: Start isEmpty. Operand 151 states and 157 transitions. [2018-02-02 10:47:35,318 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2018-02-02 10:47:35,318 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 10:47:35,318 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:47:35,318 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:47:35,318 INFO L82 PathProgramCache]: Analyzing trace with hash -480102060, now seen corresponding path program 1 times [2018-02-02 10:47:35,319 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 10:47:35,332 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 10:47:35,333 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 10:47:35,400 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:47:35,400 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-02 10:47:35,400 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2018-02-02 10:47:35,400 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 10:47:35,401 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 10:47:35,401 INFO L182 omatonBuilderFactory]: Interpolants [7923#true, 7924#false, 7925#(= 1 (select |#valid| |#Ultimate.C_memset_#ptr.base|)), 7926#(= 1 (select |#valid| ldv_kobject_create_~kobj~1.base)), 7927#(= 1 (select |#valid| |ldv_kobject_init_#in~kobj.base|)), 7928#(= 1 (select |#valid| ldv_kobject_init_~kobj.base)), 7929#(= 1 (select |#valid| |ldv_kobject_init_internal_#in~kobj.base|)), 7930#(= 1 (select |#valid| ldv_kobject_init_internal_~kobj.base)), 7931#(= 1 (select |#valid| |LDV_INIT_LIST_HEAD_#in~list.base|)), 7932#(= 1 (select |#valid| LDV_INIT_LIST_HEAD_~list.base))] [2018-02-02 10:47: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:47:35,401 INFO L409 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-02-02 10:47:35,401 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-02-02 10:47:35,402 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=73, Unknown=0, NotChecked=0, Total=90 [2018-02-02 10:47:35,402 INFO L87 Difference]: Start difference. First operand 151 states and 157 transitions. Second operand 10 states. [2018-02-02 10:47:35,606 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 10:47:35,606 INFO L93 Difference]: Finished difference Result 149 states and 155 transitions. [2018-02-02 10:47:35,606 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-02-02 10:47:35,607 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 55 [2018-02-02 10:47:35,607 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 10:47:35,607 INFO L225 Difference]: With dead ends: 149 [2018-02-02 10:47:35,607 INFO L226 Difference]: Without dead ends: 149 [2018-02-02 10:47:35,607 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:47:35,608 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 149 states. [2018-02-02 10:47:35,609 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 149 to 149. [2018-02-02 10:47:35,609 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 149 states. [2018-02-02 10:47:35,609 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 149 states to 149 states and 155 transitions. [2018-02-02 10:47:35,609 INFO L78 Accepts]: Start accepts. Automaton has 149 states and 155 transitions. Word has length 55 [2018-02-02 10:47:35,609 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 10:47:35,609 INFO L432 AbstractCegarLoop]: Abstraction has 149 states and 155 transitions. [2018-02-02 10:47:35,609 INFO L433 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-02-02 10:47:35,610 INFO L276 IsEmpty]: Start isEmpty. Operand 149 states and 155 transitions. [2018-02-02 10:47:35,610 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2018-02-02 10:47:35,610 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 10:47:35,610 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:47:35,610 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:47:35,610 INFO L82 PathProgramCache]: Analyzing trace with hash -480102059, now seen corresponding path program 1 times [2018-02-02 10:47:35,611 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 10:47:35,621 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 10:47:35,622 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 10:47:35,742 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:47:35,742 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-02 10:47:35,743 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2018-02-02 10:47:35,743 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 10:47:35,743 INFO 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:47:35,743 INFO L182 omatonBuilderFactory]: Interpolants [8237#true, 8238#false, 8239#(= 0 |ldv_malloc_#t~malloc4.offset|), 8240#(= 0 |ldv_malloc_#res.offset|), 8241#(= 0 |ldv_kobject_create_#t~ret17.offset|), 8242#(= 0 ldv_kobject_create_~kobj~1.offset), 8243#(or (<= (+ |#Ultimate.C_memset_#ptr.offset| |#Ultimate.C_memset_#amount|) (select |#length| |#Ultimate.C_memset_#ptr.base|)) (not (= |#Ultimate.C_memset_#ptr.offset| 0))), 8244#(and (= 0 ldv_kobject_create_~kobj~1.offset) (<= 16 (select |#length| ldv_kobject_create_~kobj~1.base))), 8245#(and (= 0 |ldv_kobject_init_#in~kobj.offset|) (<= 16 (select |#length| |ldv_kobject_init_#in~kobj.base|))), 8246#(and (= 0 ldv_kobject_init_~kobj.offset) (<= 16 (select |#length| ldv_kobject_init_~kobj.base))), 8247#(and (<= 16 (select |#length| |ldv_kobject_init_internal_#in~kobj.base|)) (= 0 |ldv_kobject_init_internal_#in~kobj.offset|)), 8248#(and (<= 16 (select |#length| ldv_kobject_init_internal_~kobj.base)) (= ldv_kobject_init_internal_~kobj.offset 0)), 8249#(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|))), 8250#(and (<= (+ LDV_INIT_LIST_HEAD_~list.offset 12) (select |#length| LDV_INIT_LIST_HEAD_~list.base)) (<= 4 LDV_INIT_LIST_HEAD_~list.offset))] [2018-02-02 10:47:35,743 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:47:35,743 INFO L409 AbstractCegarLoop]: Interpolant automaton has 14 states [2018-02-02 10:47:35,743 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2018-02-02 10:47:35,743 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=156, Unknown=0, NotChecked=0, Total=182 [2018-02-02 10:47:35,744 INFO L87 Difference]: Start difference. First operand 149 states and 155 transitions. Second operand 14 states. [2018-02-02 10:47:35,981 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 10:47:35,981 INFO L93 Difference]: Finished difference Result 147 states and 153 transitions. [2018-02-02 10:47:35,981 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2018-02-02 10:47:35,982 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 55 [2018-02-02 10:47:35,982 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 10:47:35,982 INFO L225 Difference]: With dead ends: 147 [2018-02-02 10:47:35,983 INFO L226 Difference]: Without dead ends: 147 [2018-02-02 10:47:35,983 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:47:35,983 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 147 states. [2018-02-02 10:47:35,985 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 147 to 147. [2018-02-02 10:47:35,985 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 147 states. [2018-02-02 10:47:35,986 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 147 states to 147 states and 153 transitions. [2018-02-02 10:47:35,986 INFO L78 Accepts]: Start accepts. Automaton has 147 states and 153 transitions. Word has length 55 [2018-02-02 10:47:35,986 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 10:47:35,986 INFO L432 AbstractCegarLoop]: Abstraction has 147 states and 153 transitions. [2018-02-02 10:47:35,986 INFO L433 AbstractCegarLoop]: Interpolant automaton has 14 states. [2018-02-02 10:47:35,986 INFO L276 IsEmpty]: Start isEmpty. Operand 147 states and 153 transitions. [2018-02-02 10:47:35,987 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2018-02-02 10:47:35,987 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 10:47:35,987 INFO L351 BasicCegarLoop]: trace histogram [16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-02 10:47:35,987 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:47:35,987 INFO L82 PathProgramCache]: Analyzing trace with hash 149395253, now seen corresponding path program 1 times [2018-02-02 10:47:35,988 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 10:47:35,994 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 10:47:35,995 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 10:47:36,035 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:47:36,035 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-02 10:47:36,035 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2018-02-02 10:47:36,035 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 10:47:36,035 INFO 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:47:36,036 INFO L182 omatonBuilderFactory]: Interpolants [8560#(= 0 |ldv_kobject_init_#in~kobj.base|), 8553#true, 8554#false, 8555#(not (= |ldv_malloc_#t~malloc4.base| 0)), 8556#(not (= |ldv_malloc_#res.base| 0)), 8557#(not (= |ldv_kobject_create_#t~ret17.base| 0)), 8558#(not (= ldv_kobject_create_~kobj~1.base 0)), 8559#(= ldv_kobject_init_~kobj.base |ldv_kobject_init_#in~kobj.base|)] [2018-02-02 10:47:36,036 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:47:36,036 INFO L409 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-02-02 10:47:36,036 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-02-02 10:47:36,036 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2018-02-02 10:47:36,036 INFO L87 Difference]: Start difference. First operand 147 states and 153 transitions. Second operand 8 states. [2018-02-02 10:47:36,062 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 10:47:36,062 INFO L93 Difference]: Finished difference Result 149 states and 154 transitions. [2018-02-02 10:47:36,062 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-02-02 10:47:36,062 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 58 [2018-02-02 10:47:36,062 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 10:47:36,063 INFO L225 Difference]: With dead ends: 149 [2018-02-02 10:47:36,063 INFO L226 Difference]: Without dead ends: 147 [2018-02-02 10:47:36,063 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:47:36,063 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 147 states. [2018-02-02 10:47:36,064 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 147 to 147. [2018-02-02 10:47:36,064 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 147 states. [2018-02-02 10:47:36,065 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 147 states to 147 states and 152 transitions. [2018-02-02 10:47:36,065 INFO L78 Accepts]: Start accepts. Automaton has 147 states and 152 transitions. Word has length 58 [2018-02-02 10:47:36,065 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 10:47:36,065 INFO L432 AbstractCegarLoop]: Abstraction has 147 states and 152 transitions. [2018-02-02 10:47:36,065 INFO L433 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-02-02 10:47:36,065 INFO L276 IsEmpty]: Start isEmpty. Operand 147 states and 152 transitions. [2018-02-02 10:47:36,065 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2018-02-02 10:47:36,066 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 10:47:36,066 INFO L351 BasicCegarLoop]: trace histogram [16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-02 10:47:36,066 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:47:36,066 INFO L82 PathProgramCache]: Analyzing trace with hash -172085011, now seen corresponding path program 1 times [2018-02-02 10:47:36,066 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 10:47:36,100 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 10:47:36,101 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 10:47:36,166 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:47:36,166 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-02 10:47:36,167 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2018-02-02 10:47:36,167 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 10:47:36,167 INFO 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:47:36,167 INFO L182 omatonBuilderFactory]: Interpolants [8864#(not (= |ldv_malloc_#res.base| 0)), 8865#(not (= |ldv_kobject_create_#t~ret17.base| 0)), 8866#(not (= ldv_kobject_create_~kobj~1.base 0)), 8867#(= ldv_kobject_init_~kobj.base |ldv_kobject_init_#in~kobj.base|), 8868#(= ldv_kobject_init_internal_~kobj.base |ldv_kobject_init_internal_#in~kobj.base|), 8869#(= 0 |ldv_kobject_init_internal_#in~kobj.base|), 8870#(= 0 |ldv_kobject_init_#in~kobj.base|), 8861#true, 8862#false, 8863#(not (= |ldv_malloc_#t~malloc4.base| 0))] [2018-02-02 10:47:36,167 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:47:36,168 INFO L409 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-02-02 10:47:36,168 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-02-02 10:47:36,168 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=73, Unknown=0, NotChecked=0, Total=90 [2018-02-02 10:47:36,168 INFO L87 Difference]: Start difference. First operand 147 states and 152 transitions. Second operand 10 states. [2018-02-02 10:47:36,233 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 10:47:36,233 INFO L93 Difference]: Finished difference Result 151 states and 155 transitions. [2018-02-02 10:47:36,233 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-02-02 10:47:36,234 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 63 [2018-02-02 10:47:36,234 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 10:47:36,234 INFO L225 Difference]: With dead ends: 151 [2018-02-02 10:47:36,234 INFO L226 Difference]: Without dead ends: 147 [2018-02-02 10:47:36,235 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:47:36,235 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 147 states. [2018-02-02 10:47:36,237 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 147 to 147. [2018-02-02 10:47:36,237 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 147 states. [2018-02-02 10:47:36,238 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 147 states to 147 states and 151 transitions. [2018-02-02 10:47:36,238 INFO L78 Accepts]: Start accepts. Automaton has 147 states and 151 transitions. Word has length 63 [2018-02-02 10:47:36,238 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 10:47:36,238 INFO L432 AbstractCegarLoop]: Abstraction has 147 states and 151 transitions. [2018-02-02 10:47:36,238 INFO L433 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-02-02 10:47:36,238 INFO L276 IsEmpty]: Start isEmpty. Operand 147 states and 151 transitions. [2018-02-02 10:47:36,239 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 75 [2018-02-02 10:47:36,239 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 10:47:36,239 INFO L351 BasicCegarLoop]: trace histogram [16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-02 10:47:36,239 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:47:36,239 INFO L82 PathProgramCache]: Analyzing trace with hash 1593481520, now seen corresponding path program 1 times [2018-02-02 10:47:36,240 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 10:47:36,256 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 10:47:36,258 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 10:47:36,363 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:47:36,363 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-02 10:47:36,363 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2018-02-02 10:47:36,363 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 10:47:36,363 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 10:47:36,364 INFO L182 omatonBuilderFactory]: Interpolants [9184#(= 1 (select |#valid| |ldv_kref_get_#in~kref.base|)), 9185#(= 1 (select |#valid| ldv_kref_get_~kref.base)), 9186#(= 1 (select |#valid| |ldv_atomic_add_return_#in~v.base|)), 9187#(= 1 (select |#valid| ldv_atomic_add_return_~v.base)), 9175#true, 9176#false, 9177#(= 1 (select |#valid| |#Ultimate.C_memset_#ptr.base|)), 9178#(= 1 (select |#valid| ldv_kobject_create_~kobj~1.base)), 9179#(= 1 (select |#valid| |ldv_kobject_create_#res.base|)), 9180#(= 1 (select |#valid| |entry_point_#t~ret19.base|)), 9181#(= 1 (select |#valid| entry_point_~kobj~2.base)), 9182#(= 1 (select |#valid| |ldv_kobject_get_#in~kobj.base|)), 9183#(= 1 (select |#valid| ldv_kobject_get_~kobj.base))] [2018-02-02 10:47:36,364 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:47:36,364 INFO L409 AbstractCegarLoop]: Interpolant automaton has 13 states [2018-02-02 10:47:36,364 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2018-02-02 10:47:36,364 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=133, Unknown=0, NotChecked=0, Total=156 [2018-02-02 10:47:36,364 INFO L87 Difference]: Start difference. First operand 147 states and 151 transitions. Second operand 13 states. [2018-02-02 10:47:36,618 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 10:47:36,618 INFO L93 Difference]: Finished difference Result 145 states and 149 transitions. [2018-02-02 10:47:36,618 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2018-02-02 10:47:36,619 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 74 [2018-02-02 10:47:36,619 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 10:47:36,619 INFO L225 Difference]: With dead ends: 145 [2018-02-02 10:47:36,620 INFO L226 Difference]: Without dead ends: 145 [2018-02-02 10:47:36,620 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=39, Invalid=233, Unknown=0, NotChecked=0, Total=272 [2018-02-02 10:47:36,620 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 145 states. [2018-02-02 10:47:36,622 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 145 to 145. [2018-02-02 10:47:36,623 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 145 states. [2018-02-02 10:47:36,623 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 145 states to 145 states and 149 transitions. [2018-02-02 10:47:36,623 INFO L78 Accepts]: Start accepts. Automaton has 145 states and 149 transitions. Word has length 74 [2018-02-02 10:47:36,624 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 10:47:36,624 INFO L432 AbstractCegarLoop]: Abstraction has 145 states and 149 transitions. [2018-02-02 10:47:36,624 INFO L433 AbstractCegarLoop]: Interpolant automaton has 13 states. [2018-02-02 10:47:36,624 INFO L276 IsEmpty]: Start isEmpty. Operand 145 states and 149 transitions. [2018-02-02 10:47:36,625 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 75 [2018-02-02 10:47:36,625 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 10:47:36,625 INFO L351 BasicCegarLoop]: trace histogram [16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-02 10:47:36,625 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:47:36,626 INFO L82 PathProgramCache]: Analyzing trace with hash 1593481521, now seen corresponding path program 1 times [2018-02-02 10:47:36,627 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 10:47:36,643 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 10:47:36,644 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 10:47:36,839 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:47:36,839 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-02 10:47:36,839 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [16] imperfect sequences [] total 16 [2018-02-02 10:47:36,840 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 10:47:36,840 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 10:47:36,840 INFO L182 omatonBuilderFactory]: Interpolants [9486#true, 9487#false, 9488#(= 0 |ldv_malloc_#t~malloc4.offset|), 9489#(= 0 |ldv_malloc_#res.offset|), 9490#(= 0 |ldv_kobject_create_#t~ret17.offset|), 9491#(= 0 ldv_kobject_create_~kobj~1.offset), 9492#(or (<= (+ |#Ultimate.C_memset_#ptr.offset| |#Ultimate.C_memset_#amount|) (select |#length| |#Ultimate.C_memset_#ptr.base|)) (not (= |#Ultimate.C_memset_#ptr.offset| 0))), 9493#(and (= 0 ldv_kobject_create_~kobj~1.offset) (<= 16 (select |#length| ldv_kobject_create_~kobj~1.base))), 9494#(and (= 0 |ldv_kobject_create_#res.offset|) (<= 16 (select |#length| |ldv_kobject_create_#res.base|))), 9495#(and (= 0 |entry_point_#t~ret19.offset|) (<= 16 (select |#length| |entry_point_#t~ret19.base|))), 9496#(and (= 0 entry_point_~kobj~2.offset) (<= 16 (select |#length| entry_point_~kobj~2.base))), 9497#(and (<= 16 (select |#length| |ldv_kobject_get_#in~kobj.base|)) (= 0 |ldv_kobject_get_#in~kobj.offset|)), 9498#(and (<= 16 (select |#length| ldv_kobject_get_~kobj.base)) (= ldv_kobject_get_~kobj.offset 0)), 9499#(and (<= 12 |ldv_kref_get_#in~kref.offset|) (<= (+ |ldv_kref_get_#in~kref.offset| 4) (select |#length| |ldv_kref_get_#in~kref.base|))), 9500#(and (<= 12 ldv_kref_get_~kref.offset) (<= (+ ldv_kref_get_~kref.offset 4) (select |#length| ldv_kref_get_~kref.base))), 9501#(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|))), 9502#(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:47:36,840 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:47:36,840 INFO L409 AbstractCegarLoop]: Interpolant automaton has 17 states [2018-02-02 10:47:36,840 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2018-02-02 10:47:36,840 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=240, Unknown=0, NotChecked=0, Total=272 [2018-02-02 10:47:36,840 INFO L87 Difference]: Start difference. First operand 145 states and 149 transitions. Second operand 17 states. [2018-02-02 10:47:37,066 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 10:47:37,066 INFO L93 Difference]: Finished difference Result 143 states and 147 transitions. [2018-02-02 10:47:37,067 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2018-02-02 10:47:37,067 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 74 [2018-02-02 10:47:37,067 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 10:47:37,085 INFO L225 Difference]: With dead ends: 143 [2018-02-02 10:47:37,085 INFO L226 Difference]: Without dead ends: 143 [2018-02-02 10:47:37,085 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 23 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=53, Invalid=409, Unknown=0, NotChecked=0, Total=462 [2018-02-02 10:47:37,086 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 143 states. [2018-02-02 10:47:37,087 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 143 to 143. [2018-02-02 10:47:37,087 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 143 states. [2018-02-02 10:47:37,087 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 143 states to 143 states and 147 transitions. [2018-02-02 10:47:37,087 INFO L78 Accepts]: Start accepts. Automaton has 143 states and 147 transitions. Word has length 74 [2018-02-02 10:47:37,087 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 10:47:37,088 INFO L432 AbstractCegarLoop]: Abstraction has 143 states and 147 transitions. [2018-02-02 10:47:37,088 INFO L433 AbstractCegarLoop]: Interpolant automaton has 17 states. [2018-02-02 10:47:37,088 INFO L276 IsEmpty]: Start isEmpty. Operand 143 states and 147 transitions. [2018-02-02 10:47:37,088 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 84 [2018-02-02 10:47:37,088 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 10:47:37,088 INFO L351 BasicCegarLoop]: trace histogram [16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-02 10:47:37,089 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:47:37,089 INFO L82 PathProgramCache]: Analyzing trace with hash 1793118269, now seen corresponding path program 1 times [2018-02-02 10:47:37,090 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 10:47:37,104 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 10:47:37,105 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 10:47:37,184 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:47:37,184 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-02 10:47:37,185 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2018-02-02 10:47:37,185 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 10:47:37,185 INFO 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:47:37,185 INFO L182 omatonBuilderFactory]: Interpolants [9808#(= ldv_kobject_get_~kobj.base |ldv_kobject_get_#in~kobj.base|), 9809#(= 0 |ldv_kobject_get_#in~kobj.base|), 9799#true, 9800#false, 9801#(not (= |ldv_malloc_#t~malloc4.base| 0)), 9802#(not (= |ldv_malloc_#res.base| 0)), 9803#(not (= |ldv_kobject_create_#t~ret17.base| 0)), 9804#(not (= ldv_kobject_create_~kobj~1.base 0)), 9805#(not (= |ldv_kobject_create_#res.base| 0)), 9806#(not (= |entry_point_#t~ret19.base| 0)), 9807#(not (= entry_point_~kobj~2.base 0))] [2018-02-02 10:47:37,185 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:47:37,186 INFO L409 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-02-02 10:47:37,186 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-02-02 10:47:37,186 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=91, Unknown=0, NotChecked=0, Total=110 [2018-02-02 10:47:37,186 INFO L87 Difference]: Start difference. First operand 143 states and 147 transitions. Second operand 11 states. [2018-02-02 10:47:37,236 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 10:47:37,236 INFO L93 Difference]: Finished difference Result 146 states and 149 transitions. [2018-02-02 10:47:37,239 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-02-02 10:47:37,239 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 83 [2018-02-02 10:47:37,239 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 10:47:37,240 INFO L225 Difference]: With dead ends: 146 [2018-02-02 10:47:37,240 INFO L226 Difference]: Without dead ends: 143 [2018-02-02 10:47:37,240 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=31, Invalid=151, Unknown=0, NotChecked=0, Total=182 [2018-02-02 10:47:37,240 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 143 states. [2018-02-02 10:47:37,242 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 143 to 143. [2018-02-02 10:47:37,242 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 143 states. [2018-02-02 10:47:37,243 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 143 states to 143 states and 146 transitions. [2018-02-02 10:47:37,244 INFO L78 Accepts]: Start accepts. Automaton has 143 states and 146 transitions. Word has length 83 [2018-02-02 10:47:37,244 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 10:47:37,244 INFO L432 AbstractCegarLoop]: Abstraction has 143 states and 146 transitions. [2018-02-02 10:47:37,244 INFO L433 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-02-02 10:47:37,244 INFO L276 IsEmpty]: Start isEmpty. Operand 143 states and 146 transitions. [2018-02-02 10:47:37,245 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 97 [2018-02-02 10:47:37,245 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 10:47:37,245 INFO L351 BasicCegarLoop]: trace histogram [16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-02 10:47:37,245 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:47:37,245 INFO L82 PathProgramCache]: Analyzing trace with hash -1631294017, now seen corresponding path program 1 times [2018-02-02 10:47:37,246 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 10:47:37,263 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 10:47:37,264 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 10:47:37,453 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:47:37,454 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-02 10:47:37,454 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [17] imperfect sequences [] total 17 [2018-02-02 10:47:37,454 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 10:47:37,454 INFO 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:47:37,456 INFO L182 omatonBuilderFactory]: Interpolants [10112#(= 1 (select |#valid| |ldv_kref_get_#in~kref.base|)), 10113#(= 1 (select |#valid| |ldv_kobject_get_#in~kobj.base|)), 10114#(= 1 (select |#valid| entry_point_~kobj~2.base)), 10115#(= 1 (select |#valid| |ldv_kobject_put_#in~kobj.base|)), 10116#(= 1 (select |#valid| ldv_kobject_put_~kobj.base)), 10117#(= 1 (select |#valid| |ldv_kref_put_#in~kref.base|)), 10118#(= 1 (select |#valid| ldv_kref_put_~kref.base)), 10119#(= 1 (select |#valid| |ldv_kref_sub_#in~kref.base|)), 10120#(= 1 (select |#valid| ldv_kref_sub_~kref.base)), 10121#(= 1 (select |#valid| |ldv_atomic_sub_return_#in~v.base|)), 10122#(= 1 (select |#valid| ldv_atomic_sub_return_~v.base)), 10105#true, 10106#false, 10107#(= ldv_kobject_get_~kobj.base |ldv_kobject_get_#in~kobj.base|), 10108#(= ldv_kref_get_~kref.base |ldv_kref_get_#in~kref.base|), 10109#(= ldv_atomic_add_return_~v.base |ldv_atomic_add_return_#in~v.base|), 10110#(and (= 1 (select |#valid| ldv_atomic_add_return_~v.base)) (= ldv_atomic_add_return_~v.base |ldv_atomic_add_return_#in~v.base|)), 10111#(= 1 (select |#valid| |ldv_atomic_add_return_#in~v.base|))] [2018-02-02 10:47:37,456 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:47:37,456 INFO L409 AbstractCegarLoop]: Interpolant automaton has 18 states [2018-02-02 10:47:37,456 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2018-02-02 10:47:37,457 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=271, Unknown=0, NotChecked=0, Total=306 [2018-02-02 10:47:37,457 INFO L87 Difference]: Start difference. First operand 143 states and 146 transitions. Second operand 18 states. [2018-02-02 10:47:37,732 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 10:47:37,732 INFO L93 Difference]: Finished difference Result 150 states and 153 transitions. [2018-02-02 10:47:37,732 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2018-02-02 10:47:37,732 INFO L78 Accepts]: Start accepts. Automaton has 18 states. Word has length 96 [2018-02-02 10:47:37,732 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 10:47:37,733 INFO L225 Difference]: With dead ends: 150 [2018-02-02 10:47:37,733 INFO L226 Difference]: Without dead ends: 150 [2018-02-02 10:47:37,733 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 44 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=59, Invalid=493, Unknown=0, NotChecked=0, Total=552 [2018-02-02 10:47:37,733 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 150 states. [2018-02-02 10:47:37,735 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 150 to 141. [2018-02-02 10:47:37,736 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 141 states. [2018-02-02 10:47:37,736 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 141 states to 141 states and 144 transitions. [2018-02-02 10:47:37,736 INFO L78 Accepts]: Start accepts. Automaton has 141 states and 144 transitions. Word has length 96 [2018-02-02 10:47:37,737 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 10:47:37,737 INFO L432 AbstractCegarLoop]: Abstraction has 141 states and 144 transitions. [2018-02-02 10:47:37,737 INFO L433 AbstractCegarLoop]: Interpolant automaton has 18 states. [2018-02-02 10:47:37,737 INFO L276 IsEmpty]: Start isEmpty. Operand 141 states and 144 transitions. [2018-02-02 10:47:37,737 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 97 [2018-02-02 10:47:37,737 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 10:47:37,737 INFO L351 BasicCegarLoop]: trace histogram [16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-02 10:47:37,738 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:47:37,738 INFO L82 PathProgramCache]: Analyzing trace with hash -1631294016, now seen corresponding path program 1 times [2018-02-02 10:47:37,739 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 10:47:37,757 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 10:47:37,758 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 10:47:37,998 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:47:37,999 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-02 10:47:37,999 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [18] imperfect sequences [] total 18 [2018-02-02 10:47:37,999 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 10:47:37,999 INFO 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:47:37,999 INFO L182 omatonBuilderFactory]: Interpolants [10432#(or (<= (+ |#Ultimate.C_memset_#ptr.offset| |#Ultimate.C_memset_#amount|) (select |#length| |#Ultimate.C_memset_#ptr.base|)) (not (= |#Ultimate.C_memset_#ptr.offset| 0))), 10433#(and (= 0 ldv_kobject_create_~kobj~1.offset) (<= 16 (select |#length| ldv_kobject_create_~kobj~1.base))), 10434#(and (= 0 |ldv_kobject_create_#res.offset|) (<= 16 (select |#length| |ldv_kobject_create_#res.base|))), 10435#(and (= 0 |entry_point_#t~ret19.offset|) (<= 16 (select |#length| |entry_point_#t~ret19.base|))), 10436#(and (= 0 entry_point_~kobj~2.offset) (<= 16 (select |#length| entry_point_~kobj~2.base))), 10437#(and (<= 16 (select |#length| |ldv_kobject_put_#in~kobj.base|)) (= 0 |ldv_kobject_put_#in~kobj.offset|)), 10438#(and (= ldv_kobject_put_~kobj.offset 0) (<= 16 (select |#length| ldv_kobject_put_~kobj.base))), 10439#(and (<= 12 |ldv_kref_put_#in~kref.offset|) (<= (+ |ldv_kref_put_#in~kref.offset| 4) (select |#length| |ldv_kref_put_#in~kref.base|))), 10440#(and (<= 12 ldv_kref_put_~kref.offset) (<= (+ ldv_kref_put_~kref.offset 4) (select |#length| ldv_kref_put_~kref.base))), 10441#(and (<= (+ |ldv_kref_sub_#in~kref.offset| 4) (select |#length| |ldv_kref_sub_#in~kref.base|)) (<= 12 |ldv_kref_sub_#in~kref.offset|)), 10442#(and (<= (+ ldv_kref_sub_~kref.offset 4) (select |#length| ldv_kref_sub_~kref.base)) (<= 12 ldv_kref_sub_~kref.offset)), 10443#(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|)), 10444#(and (<= (+ ldv_atomic_sub_return_~v.offset 4) (select |#length| ldv_atomic_sub_return_~v.base)) (<= 12 ldv_atomic_sub_return_~v.offset)), 10426#true, 10427#false, 10428#(= 0 |ldv_malloc_#t~malloc4.offset|), 10429#(= 0 |ldv_malloc_#res.offset|), 10430#(= 0 |ldv_kobject_create_#t~ret17.offset|), 10431#(= 0 ldv_kobject_create_~kobj~1.offset)] [2018-02-02 10:47:37,999 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:47:37,999 INFO L409 AbstractCegarLoop]: Interpolant automaton has 19 states [2018-02-02 10:47:37,999 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2018-02-02 10:47:38,000 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=306, Unknown=0, NotChecked=0, Total=342 [2018-02-02 10:47:38,000 INFO L87 Difference]: Start difference. First operand 141 states and 144 transitions. Second operand 19 states. [2018-02-02 10:47:38,325 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 10:47:38,325 INFO L93 Difference]: Finished difference Result 139 states and 142 transitions. [2018-02-02 10:47:38,325 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2018-02-02 10:47:38,325 INFO L78 Accepts]: Start accepts. Automaton has 19 states. Word has length 96 [2018-02-02 10:47:38,325 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 10:47:38,325 INFO L225 Difference]: With dead ends: 139 [2018-02-02 10:47:38,325 INFO L226 Difference]: Without dead ends: 139 [2018-02-02 10:47:38,326 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:47:38,326 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 139 states. [2018-02-02 10:47:38,327 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 139 to 139. [2018-02-02 10:47:38,327 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 139 states. [2018-02-02 10:47:38,327 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 139 states to 139 states and 142 transitions. [2018-02-02 10:47:38,327 INFO L78 Accepts]: Start accepts. Automaton has 139 states and 142 transitions. Word has length 96 [2018-02-02 10:47:38,327 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 10:47:38,328 INFO L432 AbstractCegarLoop]: Abstraction has 139 states and 142 transitions. [2018-02-02 10:47:38,328 INFO L433 AbstractCegarLoop]: Interpolant automaton has 19 states. [2018-02-02 10:47:38,328 INFO L276 IsEmpty]: Start isEmpty. Operand 139 states and 142 transitions. [2018-02-02 10:47:38,328 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 95 [2018-02-02 10:47:38,328 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 10:47:38,328 INFO L351 BasicCegarLoop]: trace histogram [16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-02 10:47:38,328 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:47:38,329 INFO L82 PathProgramCache]: Analyzing trace with hash 921382477, now seen corresponding path program 1 times [2018-02-02 10:47:38,329 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 10:47:38,338 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 10:47:38,339 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 10:47:38,390 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:47:38,391 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-02 10:47:38,391 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2018-02-02 10:47:38,391 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 10:47:38,391 INFO 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:47:38,391 INFO L182 omatonBuilderFactory]: Interpolants [10736#false, 10737#(not (= |ldv_malloc_#t~malloc4.base| 0)), 10738#(not (= |ldv_malloc_#res.base| 0)), 10739#(not (= |ldv_kobject_create_#t~ret17.base| 0)), 10740#(not (= ldv_kobject_create_~kobj~1.base 0)), 10741#(not (= |ldv_kobject_create_#res.base| 0)), 10742#(not (= |entry_point_#t~ret19.base| 0)), 10743#(not (= entry_point_~kobj~2.base 0)), 10744#(= ldv_kobject_put_~kobj.base |ldv_kobject_put_#in~kobj.base|), 10745#(= 0 |ldv_kobject_put_#in~kobj.base|), 10735#true] [2018-02-02 10:47:38,391 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:47:38,391 INFO L409 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-02-02 10:47:38,392 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-02-02 10:47:38,392 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=91, Unknown=0, NotChecked=0, Total=110 [2018-02-02 10:47:38,392 INFO L87 Difference]: Start difference. First operand 139 states and 142 transitions. Second operand 11 states. [2018-02-02 10:47:38,433 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 10:47:38,433 INFO L93 Difference]: Finished difference Result 141 states and 143 transitions. [2018-02-02 10:47:38,433 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-02-02 10:47:38,433 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 94 [2018-02-02 10:47:38,434 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 10:47:38,434 INFO L225 Difference]: With dead ends: 141 [2018-02-02 10:47:38,434 INFO L226 Difference]: Without dead ends: 139 [2018-02-02 10:47:38,434 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=31, Invalid=151, Unknown=0, NotChecked=0, Total=182 [2018-02-02 10:47:38,434 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 139 states. [2018-02-02 10:47:38,435 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 139 to 139. [2018-02-02 10:47:38,436 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 139 states. [2018-02-02 10:47:38,436 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 139 states to 139 states and 141 transitions. [2018-02-02 10:47:38,436 INFO L78 Accepts]: Start accepts. Automaton has 139 states and 141 transitions. Word has length 94 [2018-02-02 10:47:38,436 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 10:47:38,436 INFO L432 AbstractCegarLoop]: Abstraction has 139 states and 141 transitions. [2018-02-02 10:47:38,436 INFO L433 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-02-02 10:47:38,436 INFO L276 IsEmpty]: Start isEmpty. Operand 139 states and 141 transitions. [2018-02-02 10:47:38,437 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 111 [2018-02-02 10:47:38,437 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 10:47:38,437 INFO L351 BasicCegarLoop]: trace histogram [16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-02 10:47:38,437 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:47:38,437 INFO L82 PathProgramCache]: Analyzing trace with hash -61442992, now seen corresponding path program 1 times [2018-02-02 10:47:38,437 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 10:47:38,449 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 10:47:38,450 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 10:47:38,836 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:47:38,836 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-02 10:47:38,836 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [21] imperfect sequences [] total 21 [2018-02-02 10:47:38,836 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 10:47:38,836 INFO 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:47:38,836 INFO L182 omatonBuilderFactory]: Interpolants [11040#(= 1 (select |#valid| |ldv_kobject_get_#in~kobj.base|)), 11041#(= 1 (select |#valid| entry_point_~kobj~2.base)), 11042#(= 1 (select |#valid| |ldv_kobject_put_#in~kobj.base|)), 11043#(= 1 (select |#valid| ldv_kobject_put_~kobj.base)), 11044#(= 1 (select |#valid| |ldv_kref_put_#in~kref.base|)), 11045#(= 1 (select |#valid| ldv_kref_put_~kref.base)), 11046#(= 1 (select |#valid| |ldv_kref_sub_#in~kref.base|)), 11047#(= 1 (select |#valid| ldv_kref_sub_~kref.base)), 11048#(= 1 (select |#valid| |##fun~$Pointer$~TO~VOID_#in~kref.base|)), 11049#(= 1 (select |#valid| |##fun~$Pointer$~TO~VOID_#~kref.base|)), 11050#(= 1 (select |#valid| |ldv_kobject_release_#in~kref.base|)), 11051#(= 1 (select |#valid| ldv_kobject_release_~kobj~0.base)), 11052#(= 1 (select |#valid| |ldv_kobject_cleanup_#in~kobj.base|)), 11053#(= 1 (select |#valid| ldv_kobject_cleanup_~kobj.base)), 11032#true, 11033#false, 11034#(= ldv_kobject_get_~kobj.base |ldv_kobject_get_#in~kobj.base|), 11035#(= ldv_kref_get_~kref.base |ldv_kref_get_#in~kref.base|), 11036#(= ldv_atomic_add_return_~v.base |ldv_atomic_add_return_#in~v.base|), 11037#(and (= 1 (select |#valid| ldv_atomic_add_return_~v.base)) (= ldv_atomic_add_return_~v.base |ldv_atomic_add_return_#in~v.base|)), 11038#(= 1 (select |#valid| |ldv_atomic_add_return_#in~v.base|)), 11039#(= 1 (select |#valid| |ldv_kref_get_#in~kref.base|))] [2018-02-02 10:47:38,836 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:47:38,836 INFO L409 AbstractCegarLoop]: Interpolant automaton has 22 states [2018-02-02 10:47:38,837 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2018-02-02 10:47:38,837 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=43, Invalid=419, Unknown=0, NotChecked=0, Total=462 [2018-02-02 10:47:38,837 INFO L87 Difference]: Start difference. First operand 139 states and 141 transitions. Second operand 22 states. [2018-02-02 10:47:39,154 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 10:47:39,154 INFO L93 Difference]: Finished difference Result 142 states and 144 transitions. [2018-02-02 10:47:39,154 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2018-02-02 10:47:39,154 INFO L78 Accepts]: Start accepts. Automaton has 22 states. Word has length 110 [2018-02-02 10:47:39,155 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 10:47:39,155 INFO L225 Difference]: With dead ends: 142 [2018-02-02 10:47:39,155 INFO L226 Difference]: Without dead ends: 142 [2018-02-02 10:47:39,155 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 29 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 67 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=75, Invalid=795, Unknown=0, NotChecked=0, Total=870 [2018-02-02 10:47:39,156 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 142 states. [2018-02-02 10:47:39,156 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 142 to 137. [2018-02-02 10:47:39,157 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 137 states. [2018-02-02 10:47:39,157 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 137 states to 137 states and 139 transitions. [2018-02-02 10:47:39,157 INFO L78 Accepts]: Start accepts. Automaton has 137 states and 139 transitions. Word has length 110 [2018-02-02 10:47:39,157 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 10:47:39,157 INFO L432 AbstractCegarLoop]: Abstraction has 137 states and 139 transitions. [2018-02-02 10:47:39,157 INFO L433 AbstractCegarLoop]: Interpolant automaton has 22 states. [2018-02-02 10:47:39,157 INFO L276 IsEmpty]: Start isEmpty. Operand 137 states and 139 transitions. [2018-02-02 10:47:39,158 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 111 [2018-02-02 10:47:39,158 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 10:47:39,158 INFO L351 BasicCegarLoop]: trace histogram [16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-02 10:47:39,158 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:47:39,158 INFO L82 PathProgramCache]: Analyzing trace with hash -61442991, now seen corresponding path program 1 times [2018-02-02 10:47:39,159 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 10:47:39,175 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 10:47:39,176 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 10:47:39,529 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:47:39,529 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-02 10:47:39,529 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [22] imperfect sequences [] total 22 [2018-02-02 10:47:39,529 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 10:47:39,530 INFO 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:47:39,530 INFO L182 omatonBuilderFactory]: Interpolants [11360#(and (<= 16 (select |#length| |ldv_kobject_put_#in~kobj.base|)) (= 0 |ldv_kobject_put_#in~kobj.offset|)), 11361#(and (= ldv_kobject_put_~kobj.offset 0) (<= 16 (select |#length| ldv_kobject_put_~kobj.base))), 11362#(and (<= 12 |ldv_kref_put_#in~kref.offset|) (<= (+ |ldv_kref_put_#in~kref.offset| 4) (select |#length| |ldv_kref_put_#in~kref.base|))), 11363#(and (<= 12 ldv_kref_put_~kref.offset) (<= (+ ldv_kref_put_~kref.offset 4) (select |#length| ldv_kref_put_~kref.base))), 11364#(and (<= (+ |ldv_kref_sub_#in~kref.offset| 4) (select |#length| |ldv_kref_sub_#in~kref.base|)) (<= 12 |ldv_kref_sub_#in~kref.offset|)), 11365#(and (<= (+ ldv_kref_sub_~kref.offset 4) (select |#length| ldv_kref_sub_~kref.base)) (<= 12 ldv_kref_sub_~kref.offset)), 11366#(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|))), 11367#(and (<= 12 |##fun~$Pointer$~TO~VOID_#~kref.offset|) (<= (+ |##fun~$Pointer$~TO~VOID_#~kref.offset| 4) (select |#length| |##fun~$Pointer$~TO~VOID_#~kref.base|))), 11368#(and (<= 12 |ldv_kobject_release_#in~kref.offset|) (<= (+ |ldv_kobject_release_#in~kref.offset| 4) (select |#length| |ldv_kobject_release_#in~kref.base|))), 11369#(and (<= (+ ldv_kobject_release_~kobj~0.offset 16) (select |#length| ldv_kobject_release_~kobj~0.base)) (<= 0 ldv_kobject_release_~kobj~0.offset)), 11370#(and (<= (+ |ldv_kobject_cleanup_#in~kobj.offset| 16) (select |#length| |ldv_kobject_cleanup_#in~kobj.base|)) (<= 0 |ldv_kobject_cleanup_#in~kobj.offset|)), 11371#(and (<= 0 ldv_kobject_cleanup_~kobj.offset) (<= (+ ldv_kobject_cleanup_~kobj.offset 16) (select |#length| ldv_kobject_cleanup_~kobj.base))), 11349#true, 11350#false, 11351#(= 0 |ldv_malloc_#t~malloc4.offset|), 11352#(= 0 |ldv_malloc_#res.offset|), 11353#(= 0 |ldv_kobject_create_#t~ret17.offset|), 11354#(= 0 ldv_kobject_create_~kobj~1.offset), 11355#(or (<= (+ |#Ultimate.C_memset_#ptr.offset| |#Ultimate.C_memset_#amount|) (select |#length| |#Ultimate.C_memset_#ptr.base|)) (not (= |#Ultimate.C_memset_#ptr.offset| 0))), 11356#(and (= 0 ldv_kobject_create_~kobj~1.offset) (<= 16 (select |#length| ldv_kobject_create_~kobj~1.base))), 11357#(and (= 0 |ldv_kobject_create_#res.offset|) (<= 16 (select |#length| |ldv_kobject_create_#res.base|))), 11358#(and (= 0 |entry_point_#t~ret19.offset|) (<= 16 (select |#length| |entry_point_#t~ret19.base|))), 11359#(and (= 0 entry_point_~kobj~2.offset) (<= 16 (select |#length| entry_point_~kobj~2.base)))] [2018-02-02 10:47:39,530 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:47:39,530 INFO L409 AbstractCegarLoop]: Interpolant automaton has 23 states [2018-02-02 10:47:39,530 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2018-02-02 10:47:39,530 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=44, Invalid=462, Unknown=0, NotChecked=0, Total=506 [2018-02-02 10:47:39,531 INFO L87 Difference]: Start difference. First operand 137 states and 139 transitions. Second operand 23 states. [2018-02-02 10:47:40,059 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 10:47:40,059 INFO L93 Difference]: Finished difference Result 136 states and 138 transitions. [2018-02-02 10:47:40,059 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2018-02-02 10:47:40,060 INFO L78 Accepts]: Start accepts. Automaton has 23 states. Word has length 110 [2018-02-02 10:47:40,060 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 10:47:40,061 INFO L225 Difference]: With dead ends: 136 [2018-02-02 10:47:40,061 INFO L226 Difference]: Without dead ends: 136 [2018-02-02 10:47:40,061 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 31 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 29 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 50 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=77, Invalid=853, Unknown=0, NotChecked=0, Total=930 [2018-02-02 10:47:40,061 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 136 states. [2018-02-02 10:47:40,063 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 136 to 136. [2018-02-02 10:47:40,063 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 136 states. [2018-02-02 10:47:40,064 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 136 states to 136 states and 138 transitions. [2018-02-02 10:47:40,064 INFO L78 Accepts]: Start accepts. Automaton has 136 states and 138 transitions. Word has length 110 [2018-02-02 10:47:40,064 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 10:47:40,065 INFO L432 AbstractCegarLoop]: Abstraction has 136 states and 138 transitions. [2018-02-02 10:47:40,065 INFO L433 AbstractCegarLoop]: Interpolant automaton has 23 states. [2018-02-02 10:47:40,065 INFO L276 IsEmpty]: Start isEmpty. Operand 136 states and 138 transitions. [2018-02-02 10:47:40,065 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 113 [2018-02-02 10:47:40,065 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 10:47:40,066 INFO L351 BasicCegarLoop]: trace histogram [16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-02 10:47:40,066 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:47:40,066 INFO L82 PathProgramCache]: Analyzing trace with hash 1082829329, now seen corresponding path program 1 times [2018-02-02 10:47:40,067 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 10:47:40,086 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 10:47:40,087 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 10:47:40,295 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:47:40,295 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-02 10:47:40,296 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [21] imperfect sequences [] total 21 [2018-02-02 10:47:40,296 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 10:47:40,296 INFO 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:47:40,296 INFO L182 omatonBuilderFactory]: Interpolants [11680#(<= ldv_kobject_cleanup_~kobj.offset 0), 11681#(and (<= 0 ldv_kobject_cleanup_~kobj.offset) (<= ldv_kobject_cleanup_~kobj.offset 0)), 11660#true, 11661#false, 11662#(= 0 |ldv_malloc_#t~malloc4.offset|), 11663#(= 0 |ldv_malloc_#res.offset|), 11664#(= 0 |ldv_kobject_create_#t~ret17.offset|), 11665#(= 0 ldv_kobject_create_~kobj~1.offset), 11666#(= 0 |ldv_kobject_create_#res.offset|), 11667#(= 0 |entry_point_#t~ret19.offset|), 11668#(= 0 entry_point_~kobj~2.offset), 11669#(= 0 |ldv_kobject_put_#in~kobj.offset|), 11670#(= ldv_kobject_put_~kobj.offset 0), 11671#(<= |ldv_kref_put_#in~kref.offset| 12), 11672#(<= ldv_kref_put_~kref.offset 12), 11673#(<= |ldv_kref_sub_#in~kref.offset| 12), 11674#(<= ldv_kref_sub_~kref.offset 12), 11675#(<= |##fun~$Pointer$~TO~VOID_#in~kref.offset| 12), 11676#(<= |##fun~$Pointer$~TO~VOID_#~kref.offset| 12), 11677#(<= |ldv_kobject_release_#in~kref.offset| 12), 11678#(<= ldv_kobject_release_~kobj~0.offset 0), 11679#(<= |ldv_kobject_cleanup_#in~kobj.offset| 0)] [2018-02-02 10:47:40,296 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:47:40,296 INFO L409 AbstractCegarLoop]: Interpolant automaton has 22 states [2018-02-02 10:47:40,296 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2018-02-02 10:47:40,297 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=42, Invalid=420, Unknown=0, NotChecked=0, Total=462 [2018-02-02 10:47:40,297 INFO L87 Difference]: Start difference. First operand 136 states and 138 transitions. Second operand 22 states. [2018-02-02 10:47:40,540 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 10:47:40,540 INFO L93 Difference]: Finished difference Result 135 states and 137 transitions. [2018-02-02 10:47:40,540 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2018-02-02 10:47:40,540 INFO L78 Accepts]: Start accepts. Automaton has 22 states. Word has length 112 [2018-02-02 10:47:40,541 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 10:47:40,541 INFO L225 Difference]: With dead ends: 135 [2018-02-02 10:47:40,541 INFO L226 Difference]: Without dead ends: 135 [2018-02-02 10:47:40,542 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 31 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 29 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 42 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=80, Invalid=850, Unknown=0, NotChecked=0, Total=930 [2018-02-02 10:47:40,542 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 135 states. [2018-02-02 10:47:40,544 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 135 to 135. [2018-02-02 10:47:40,544 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 135 states. [2018-02-02 10:47:40,544 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 135 states to 135 states and 137 transitions. [2018-02-02 10:47:40,544 INFO L78 Accepts]: Start accepts. Automaton has 135 states and 137 transitions. Word has length 112 [2018-02-02 10:47:40,545 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 10:47:40,545 INFO L432 AbstractCegarLoop]: Abstraction has 135 states and 137 transitions. [2018-02-02 10:47:40,545 INFO L433 AbstractCegarLoop]: Interpolant automaton has 22 states. [2018-02-02 10:47:40,545 INFO L276 IsEmpty]: Start isEmpty. Operand 135 states and 137 transitions. [2018-02-02 10:47:40,545 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 115 [2018-02-02 10:47:40,545 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 10:47:40,546 INFO L351 BasicCegarLoop]: trace histogram [16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-02 10:47:40,546 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:47:40,546 INFO L82 PathProgramCache]: Analyzing trace with hash 1216902226, now seen corresponding path program 1 times [2018-02-02 10:47:40,547 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 10:47:40,594 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 10:47:40,596 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 10:47:40,613 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:47:40,616 INFO L168 Benchmark]: Toolchain (without parser) took 10076.13 ms. Allocated memory was 399.5 MB in the beginning and 893.9 MB in the end (delta: 494.4 MB). Free memory was 356.0 MB in the beginning and 796.0 MB in the end (delta: -440.1 MB). Peak memory consumption was 54.3 MB. Max. memory is 5.3 GB. [2018-02-02 10:47:40,617 INFO L168 Benchmark]: CDTParser took 0.12 ms. Allocated memory is still 399.5 MB. Free memory is still 362.6 MB. There was no memory consumed. Max. memory is 5.3 GB. [2018-02-02 10:47:40,617 INFO L168 Benchmark]: CACSL2BoogieTranslator took 169.61 ms. Allocated memory is still 399.5 MB. Free memory was 356.0 MB in the beginning and 341.4 MB in the end (delta: 14.5 MB). Peak memory consumption was 14.5 MB. Max. memory is 5.3 GB. [2018-02-02 10:47:40,618 INFO L168 Benchmark]: Boogie Preprocessor took 40.56 ms. Allocated memory is still 399.5 MB. Free memory was 341.4 MB in the beginning and 340.1 MB in the end (delta: 1.3 MB). Peak memory consumption was 1.3 MB. Max. memory is 5.3 GB. [2018-02-02 10:47:40,618 INFO L168 Benchmark]: RCFGBuilder took 407.70 ms. Allocated memory is still 399.5 MB. Free memory was 340.1 MB in the beginning and 303.0 MB in the end (delta: 37.1 MB). Peak memory consumption was 37.1 MB. Max. memory is 5.3 GB. [2018-02-02 10:47:40,618 INFO L168 Benchmark]: TraceAbstraction took 9455.19 ms. Allocated memory was 399.5 MB in the beginning and 893.9 MB in the end (delta: 494.4 MB). Free memory was 303.0 MB in the beginning and 796.0 MB in the end (delta: -493.0 MB). Peak memory consumption was 1.4 MB. Max. memory is 5.3 GB. [2018-02-02 10:47:40,620 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.12 ms. Allocated memory is still 399.5 MB. Free memory is still 362.6 MB. There was no memory consumed. Max. memory is 5.3 GB. * CACSL2BoogieTranslator took 169.61 ms. Allocated memory is still 399.5 MB. Free memory was 356.0 MB in the beginning and 341.4 MB in the end (delta: 14.5 MB). Peak memory consumption was 14.5 MB. Max. memory is 5.3 GB. * Boogie Preprocessor took 40.56 ms. Allocated memory is still 399.5 MB. Free memory was 341.4 MB in the beginning and 340.1 MB in the end (delta: 1.3 MB). Peak memory consumption was 1.3 MB. Max. memory is 5.3 GB. * RCFGBuilder took 407.70 ms. Allocated memory is still 399.5 MB. Free memory was 340.1 MB in the beginning and 303.0 MB in the end (delta: 37.1 MB). Peak memory consumption was 37.1 MB. Max. memory is 5.3 GB. * TraceAbstraction took 9455.19 ms. Allocated memory was 399.5 MB in the beginning and 893.9 MB in the end (delta: 494.4 MB). Free memory was 303.0 MB in the beginning and 796.0 MB in the end (delta: -493.0 MB). Peak memory consumption was 1.4 MB. Max. memory is 5.3 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - ExceptionOrErrorResult: UnsupportedOperationException: Unknown lemma type! de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: UnsupportedOperationException: Unknown lemma type!: de.uni_freiburg.informatik.ultimate.smtinterpol.interpolate.Interpolator.walkLeafNode(Interpolator.java:299) RESULT: Ultimate could not prove your program: Toolchain returned no result. Written .csv to /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/memleaks_test22_1_false-valid-memtrack_true-termination.i_svcomp-DerefFreeMemtrack-32bit-Automizer_SmtInterpol_NoArray.epf_AutomizerC.xml/Csv-Benchmark-0-2018-02-02_10-47-40-626.csv Received shutdown request...