java -Xmx6000000000 -jar ./plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data ./data --generate-csv --csv-dir ../../../releaseScripts/default/UAutomizer-linux/csv -tc ../../../trunk/examples/toolchains/AutomizerC.xml -s ../../../trunk/examples/settings/cav18-smtinterpol/svcomp-DerefFreeMemtrack-32bit-Automizer_SmtInterpol_NoArray.epf -i ../../../trunk/examples/svcomp/ldv-memsafety/memleaks_test22_3_false-valid-deref.i -------------------------------------------------------------------------------- This is Ultimate 0.1.23-26d9e06-m [2018-02-02 10:46:22,961 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-02-02 10:46:22,963 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-02-02 10:46:22,973 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-02-02 10:46:22,973 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-02-02 10:46:22,974 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-02-02 10:46:22,975 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-02-02 10:46:22,976 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-02-02 10:46:22,978 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-02-02 10:46:22,978 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-02-02 10:46:22,979 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-02-02 10:46:22,979 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-02-02 10:46:22,980 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-02-02 10:46:22,981 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-02-02 10:46:22,982 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-02-02 10:46:22,984 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-02-02 10:46:22,985 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-02-02 10:46:22,986 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-02-02 10:46:22,987 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-02-02 10:46:22,988 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-02-02 10:46:22,990 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-02-02 10:46:22,990 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-02-02 10:46:22,990 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-02-02 10:46:22,991 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-02-02 10:46:22,992 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-02-02 10:46:22,992 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-02-02 10:46:22,993 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-02-02 10:46:22,993 INFO L177 SettingsManager]: PEA to Boogie provides no preferences, ignoring... [2018-02-02 10:46:22,993 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-02-02 10:46:22,994 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-02-02 10:46:22,994 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-02-02 10:46:22,994 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:46:23,004 INFO L110 SettingsManager]: Loading preferences was successful [2018-02-02 10:46:23,004 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-02-02 10:46:23,005 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-02-02 10:46:23,005 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-02-02 10:46:23,005 INFO L133 SettingsManager]: * Use SBE=true [2018-02-02 10:46:23,005 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-02-02 10:46:23,005 INFO L133 SettingsManager]: * sizeof long=4 [2018-02-02 10:46:23,005 INFO L133 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2018-02-02 10:46:23,006 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-02-02 10:46:23,006 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-02-02 10:46:23,006 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-02-02 10:46:23,006 INFO L133 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2018-02-02 10:46:23,006 INFO L133 SettingsManager]: * Bitprecise bitfields=true [2018-02-02 10:46:23,006 INFO L133 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2018-02-02 10:46:23,007 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-02-02 10:46:23,007 INFO L133 SettingsManager]: * sizeof long double=12 [2018-02-02 10:46:23,007 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-02-02 10:46:23,007 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-02-02 10:46:23,007 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-02-02 10:46:23,007 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-02-02 10:46:23,007 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-02-02 10:46:23,008 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-02-02 10:46:23,008 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=Craig_TreeInterpolation [2018-02-02 10:46:23,008 INFO L133 SettingsManager]: * SMT solver=Internal_SMTInterpol_NoArrayInterpol [2018-02-02 10:46:23,035 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-02-02 10:46:23,045 INFO L266 ainManager$Toolchain]: [Toolchain 1]: Parser(s) successfully initialized [2018-02-02 10:46:23,048 INFO L222 ainManager$Toolchain]: [Toolchain 1]: Toolchain data selected. [2018-02-02 10:46:23,049 INFO L271 PluginConnector]: Initializing CDTParser... [2018-02-02 10:46:23,049 INFO L276 PluginConnector]: CDTParser initialized [2018-02-02 10:46:23,050 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/ldv-memsafety/memleaks_test22_3_false-valid-deref.i [2018-02-02 10:46:23,196 INFO L304 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-02-02 10:46:23,197 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2018-02-02 10:46:23,198 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-02-02 10:46:23,198 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-02-02 10:46:23,206 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-02-02 10:46:23,207 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 02.02 10:46:23" (1/1) ... [2018-02-02 10:46:23,210 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@30ce2b5 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.02 10:46:23, skipping insertion in model container [2018-02-02 10:46:23,210 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 02.02 10:46:23" (1/1) ... [2018-02-02 10:46:23,227 INFO L153 Dispatcher]: Using SV-COMP mode [2018-02-02 10:46:23,265 INFO L153 Dispatcher]: Using SV-COMP mode [2018-02-02 10:46:23,363 INFO L450 PostProcessor]: Settings: Checked method=main [2018-02-02 10:46:23,378 INFO L450 PostProcessor]: Settings: Checked method=main [2018-02-02 10:46:23,386 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.02 10:46:23 WrapperNode [2018-02-02 10:46:23,386 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-02-02 10:46:23,387 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-02-02 10:46:23,387 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-02-02 10:46:23,387 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-02-02 10:46:23,399 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.02 10:46:23" (1/1) ... [2018-02-02 10:46:23,399 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.02 10:46:23" (1/1) ... [2018-02-02 10:46:23,408 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.02 10:46:23" (1/1) ... [2018-02-02 10:46:23,408 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.02 10:46:23" (1/1) ... [2018-02-02 10:46:23,414 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.02 10:46:23" (1/1) ... [2018-02-02 10:46:23,416 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.02 10:46:23" (1/1) ... [2018-02-02 10:46:23,417 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.02 10:46:23" (1/1) ... [2018-02-02 10:46:23,419 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-02-02 10:46:23,419 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-02-02 10:46:23,419 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-02-02 10:46:23,419 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-02-02 10:46:23,420 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.02 10:46:23" (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:46:23,455 INFO L136 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-02-02 10:46:23,455 INFO L136 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-02-02 10:46:23,455 INFO L136 BoogieDeclarations]: Found implementation of procedure ##fun~$Pointer$~TO~VOID [2018-02-02 10:46:23,455 INFO L136 BoogieDeclarations]: Found implementation of procedure ldv_malloc [2018-02-02 10:46:23,455 INFO L136 BoogieDeclarations]: Found implementation of procedure LDV_INIT_LIST_HEAD [2018-02-02 10:46:23,455 INFO L136 BoogieDeclarations]: Found implementation of procedure ldv_atomic_sub_return [2018-02-02 10:46:23,455 INFO L136 BoogieDeclarations]: Found implementation of procedure ldv_kref_sub [2018-02-02 10:46:23,455 INFO L136 BoogieDeclarations]: Found implementation of procedure ldv_kref_init [2018-02-02 10:46:23,455 INFO L136 BoogieDeclarations]: Found implementation of procedure ldv_kref_put [2018-02-02 10:46:23,456 INFO L136 BoogieDeclarations]: Found implementation of procedure ldv_kobject_cleanup [2018-02-02 10:46:23,456 INFO L136 BoogieDeclarations]: Found implementation of procedure ldv_kobject_release [2018-02-02 10:46:23,456 INFO L136 BoogieDeclarations]: Found implementation of procedure ldv_kobject_put [2018-02-02 10:46:23,456 INFO L136 BoogieDeclarations]: Found implementation of procedure ldv_kobject_init_internal [2018-02-02 10:46:23,456 INFO L136 BoogieDeclarations]: Found implementation of procedure ldv_kobject_init [2018-02-02 10:46:23,456 INFO L136 BoogieDeclarations]: Found implementation of procedure ldv_kobject_create [2018-02-02 10:46:23,456 INFO L136 BoogieDeclarations]: Found implementation of procedure entry_point [2018-02-02 10:46:23,456 INFO L136 BoogieDeclarations]: Found implementation of procedure main [2018-02-02 10:46:23,456 INFO L128 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2018-02-02 10:46:23,456 INFO L128 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2018-02-02 10:46:23,456 INFO L128 BoogieDeclarations]: Found specification of procedure write~int [2018-02-02 10:46:23,456 INFO L128 BoogieDeclarations]: Found specification of procedure read~int [2018-02-02 10:46:23,456 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.free [2018-02-02 10:46:23,456 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2018-02-02 10:46:23,456 INFO L128 BoogieDeclarations]: Found specification of procedure #Ultimate.alloc [2018-02-02 10:46:23,457 INFO L128 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memset [2018-02-02 10:46:23,457 INFO L136 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memset [2018-02-02 10:46:23,457 INFO L128 BoogieDeclarations]: Found specification of procedure malloc [2018-02-02 10:46:23,457 INFO L128 BoogieDeclarations]: Found specification of procedure free [2018-02-02 10:46:23,457 INFO L128 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2018-02-02 10:46:23,457 INFO L128 BoogieDeclarations]: Found specification of procedure memset [2018-02-02 10:46:23,457 INFO L128 BoogieDeclarations]: Found specification of procedure ldv_malloc [2018-02-02 10:46:23,457 INFO L128 BoogieDeclarations]: Found specification of procedure LDV_INIT_LIST_HEAD [2018-02-02 10:46:23,457 INFO L128 BoogieDeclarations]: Found specification of procedure ldv_atomic_sub_return [2018-02-02 10:46:23,457 INFO L128 BoogieDeclarations]: Found specification of procedure ldv_kref_sub [2018-02-02 10:46:23,457 INFO L128 BoogieDeclarations]: Found specification of procedure ##fun~$Pointer$~TO~VOID [2018-02-02 10:46:23,458 INFO L128 BoogieDeclarations]: Found specification of procedure ldv_kref_init [2018-02-02 10:46:23,458 INFO L128 BoogieDeclarations]: Found specification of procedure ldv_kref_put [2018-02-02 10:46:23,458 INFO L128 BoogieDeclarations]: Found specification of procedure ldv_kobject_cleanup [2018-02-02 10:46:23,458 INFO L128 BoogieDeclarations]: Found specification of procedure ldv_kobject_release [2018-02-02 10:46:23,458 INFO L128 BoogieDeclarations]: Found specification of procedure ldv_kobject_put [2018-02-02 10:46:23,458 INFO L128 BoogieDeclarations]: Found specification of procedure ldv_kobject_init_internal [2018-02-02 10:46:23,458 INFO L128 BoogieDeclarations]: Found specification of procedure ldv_kobject_init [2018-02-02 10:46:23,459 INFO L128 BoogieDeclarations]: Found specification of procedure ldv_kobject_create [2018-02-02 10:46:23,459 INFO L128 BoogieDeclarations]: Found specification of procedure entry_point [2018-02-02 10:46:23,459 INFO L128 BoogieDeclarations]: Found specification of procedure main [2018-02-02 10:46:23,459 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-02-02 10:46:23,459 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-02-02 10:46:23,675 WARN L455 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2018-02-02 10:46:23,759 INFO L257 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-02-02 10:46:23,760 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 02.02 10:46:23 BoogieIcfgContainer [2018-02-02 10:46:23,760 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-02-02 10:46:23,760 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-02-02 10:46:23,760 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-02-02 10:46:23,762 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-02-02 10:46:23,763 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 02.02 10:46:23" (1/3) ... [2018-02-02 10:46:23,763 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1f9602ee and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 02.02 10:46:23, skipping insertion in model container [2018-02-02 10:46:23,763 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.02 10:46:23" (2/3) ... [2018-02-02 10:46:23,763 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1f9602ee and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 02.02 10:46:23, skipping insertion in model container [2018-02-02 10:46:23,764 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 02.02 10:46:23" (3/3) ... [2018-02-02 10:46:23,765 INFO L107 eAbstractionObserver]: Analyzing ICFG memleaks_test22_3_false-valid-deref.i [2018-02-02 10:46:23,770 INFO L128 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:Craig_TreeInterpolation Determinization: PREDICATE_ABSTRACTION [2018-02-02 10:46:23,775 INFO L140 ceAbstractionStarter]: Appying trace abstraction to program that has 19 error locations. [2018-02-02 10:46:23,798 INFO L322 AbstractCegarLoop]: Interprodecural is true [2018-02-02 10:46:23,798 INFO L323 AbstractCegarLoop]: Hoare is false [2018-02-02 10:46:23,798 INFO L324 AbstractCegarLoop]: Compute interpolants for Craig_TreeInterpolation [2018-02-02 10:46:23,798 INFO L325 AbstractCegarLoop]: Backedges is CANONICAL [2018-02-02 10:46:23,798 INFO L326 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-02-02 10:46:23,798 INFO L327 AbstractCegarLoop]: Difference is false [2018-02-02 10:46:23,798 INFO L328 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-02-02 10:46:23,798 INFO L333 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-02-02 10:46:23,799 INFO L87 2NestedWordAutomaton]: Mode: main mode - execution starts in main procedure [2018-02-02 10:46:23,808 INFO L276 IsEmpty]: Start isEmpty. Operand 119 states. [2018-02-02 10:46:23,815 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2018-02-02 10:46:23,816 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 10:46:23,816 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:46:23,816 INFO L371 AbstractCegarLoop]: === Iteration 1 === [ldv_kref_initErr0RequiresViolation, ldv_kref_initErr1RequiresViolation, ldv_kobject_createErr0RequiresViolation, ldv_kobject_createErr1RequiresViolation, ldv_atomic_sub_returnErr1RequiresViolation, ldv_atomic_sub_returnErr0RequiresViolation, ldv_atomic_sub_returnErr3RequiresViolation, ldv_atomic_sub_returnErr2RequiresViolation, ldv_kobject_cleanupErr4RequiresViolation, ldv_kobject_cleanupErr2RequiresViolation, ldv_kobject_cleanupErr5RequiresViolation, ldv_kobject_cleanupErr3RequiresViolation, ldv_kobject_cleanupErr0RequiresViolation, ldv_kobject_cleanupErr1RequiresViolation, mainErr0EnsuresViolation, LDV_INIT_LIST_HEADErr1RequiresViolation, LDV_INIT_LIST_HEADErr3RequiresViolation, LDV_INIT_LIST_HEADErr2RequiresViolation, LDV_INIT_LIST_HEADErr0RequiresViolation]=== [2018-02-02 10:46:23,819 INFO L82 PathProgramCache]: Analyzing trace with hash 556227080, now seen corresponding path program 1 times [2018-02-02 10:46:23,856 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 10:46:23,886 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 10:46:23,892 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 10:46:23,970 INFO 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:46:23,972 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-02 10:46:23,973 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-02-02 10:46:23,973 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 10:46:23,974 INFO 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:46:23,974 INFO L182 omatonBuilderFactory]: Interpolants [122#true, 123#false, 124#(and (= 0 |ldv_malloc_#res.offset|) (= 0 |ldv_malloc_#res.base|)), 125#(and (= 0 |ldv_kobject_create_#t~ret14.base|) (= 0 |ldv_kobject_create_#t~ret14.offset|)), 126#(and (= ldv_kobject_create_~kobj~1.offset 0) (= ldv_kobject_create_~kobj~1.base 0))] [2018-02-02 10:46:23,974 INFO 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:46:23,975 INFO L409 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-02-02 10:46:24,040 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-02-02 10:46:24,040 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-02-02 10:46:24,042 INFO L87 Difference]: Start difference. First operand 119 states. Second operand 5 states. [2018-02-02 10:46:24,091 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 10:46:24,091 INFO L93 Difference]: Finished difference Result 125 states and 133 transitions. [2018-02-02 10:46:24,091 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-02-02 10:46:24,092 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 17 [2018-02-02 10:46:24,092 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 10:46:24,101 INFO L225 Difference]: With dead ends: 125 [2018-02-02 10:46:24,101 INFO L226 Difference]: Without dead ends: 122 [2018-02-02 10:46:24,102 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:46:24,112 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 122 states. [2018-02-02 10:46:24,130 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 122 to 120. [2018-02-02 10:46:24,131 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 120 states. [2018-02-02 10:46:24,133 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 120 states to 120 states and 128 transitions. [2018-02-02 10:46:24,135 INFO L78 Accepts]: Start accepts. Automaton has 120 states and 128 transitions. Word has length 17 [2018-02-02 10:46:24,135 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 10:46:24,135 INFO L432 AbstractCegarLoop]: Abstraction has 120 states and 128 transitions. [2018-02-02 10:46:24,135 INFO L433 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-02-02 10:46:24,135 INFO L276 IsEmpty]: Start isEmpty. Operand 120 states and 128 transitions. [2018-02-02 10:46:24,136 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2018-02-02 10:46:24,136 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 10:46:24,136 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:46:24,136 INFO L371 AbstractCegarLoop]: === Iteration 2 === [ldv_kref_initErr0RequiresViolation, ldv_kref_initErr1RequiresViolation, ldv_kobject_createErr0RequiresViolation, ldv_kobject_createErr1RequiresViolation, ldv_atomic_sub_returnErr1RequiresViolation, ldv_atomic_sub_returnErr0RequiresViolation, ldv_atomic_sub_returnErr3RequiresViolation, ldv_atomic_sub_returnErr2RequiresViolation, ldv_kobject_cleanupErr4RequiresViolation, ldv_kobject_cleanupErr2RequiresViolation, ldv_kobject_cleanupErr5RequiresViolation, ldv_kobject_cleanupErr3RequiresViolation, ldv_kobject_cleanupErr0RequiresViolation, ldv_kobject_cleanupErr1RequiresViolation, mainErr0EnsuresViolation, LDV_INIT_LIST_HEADErr1RequiresViolation, LDV_INIT_LIST_HEADErr3RequiresViolation, LDV_INIT_LIST_HEADErr2RequiresViolation, LDV_INIT_LIST_HEADErr0RequiresViolation]=== [2018-02-02 10:46:24,136 INFO L82 PathProgramCache]: Analyzing trace with hash -1895274134, now seen corresponding path program 1 times [2018-02-02 10:46:24,138 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 10:46:24,154 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 10:46:24,155 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 10:46:24,201 INFO 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:46:24,201 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-02 10:46:24,202 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-02-02 10:46:24,202 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 10:46:24,202 INFO 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:46:24,202 INFO L182 omatonBuilderFactory]: Interpolants [372#true, 373#false, 374#(= 1 (select |#valid| |ldv_malloc_#t~malloc4.base|)), 375#(= 1 (select |#valid| |ldv_malloc_#res.base|)), 376#(= 1 (select |#valid| |ldv_kobject_create_#t~ret14.base|)), 377#(= 1 (select |#valid| ldv_kobject_create_~kobj~1.base))] [2018-02-02 10:46:24,202 INFO 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:46:24,204 INFO L409 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-02-02 10:46:24,204 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-02-02 10:46:24,204 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-02-02 10:46:24,204 INFO L87 Difference]: Start difference. First operand 120 states and 128 transitions. Second operand 6 states. [2018-02-02 10:46:24,304 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 10:46:24,304 INFO L93 Difference]: Finished difference Result 121 states and 129 transitions. [2018-02-02 10:46:24,305 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-02-02 10:46:24,305 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 19 [2018-02-02 10:46:24,305 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 10:46:24,306 INFO L225 Difference]: With dead ends: 121 [2018-02-02 10:46:24,306 INFO L226 Difference]: Without dead ends: 121 [2018-02-02 10:46:24,307 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:46:24,307 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 121 states. [2018-02-02 10:46:24,313 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 121 to 119. [2018-02-02 10:46:24,313 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 119 states. [2018-02-02 10:46:24,314 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 119 states to 119 states and 127 transitions. [2018-02-02 10:46:24,314 INFO L78 Accepts]: Start accepts. Automaton has 119 states and 127 transitions. Word has length 19 [2018-02-02 10:46:24,314 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 10:46:24,315 INFO L432 AbstractCegarLoop]: Abstraction has 119 states and 127 transitions. [2018-02-02 10:46:24,315 INFO L433 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-02-02 10:46:24,315 INFO L276 IsEmpty]: Start isEmpty. Operand 119 states and 127 transitions. [2018-02-02 10:46:24,315 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2018-02-02 10:46:24,315 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 10:46:24,315 INFO L351 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-02 10:46:24,315 INFO L371 AbstractCegarLoop]: === Iteration 3 === [ldv_kref_initErr0RequiresViolation, ldv_kref_initErr1RequiresViolation, ldv_kobject_createErr0RequiresViolation, ldv_kobject_createErr1RequiresViolation, ldv_atomic_sub_returnErr1RequiresViolation, ldv_atomic_sub_returnErr0RequiresViolation, ldv_atomic_sub_returnErr3RequiresViolation, ldv_atomic_sub_returnErr2RequiresViolation, ldv_kobject_cleanupErr4RequiresViolation, ldv_kobject_cleanupErr2RequiresViolation, ldv_kobject_cleanupErr5RequiresViolation, ldv_kobject_cleanupErr3RequiresViolation, ldv_kobject_cleanupErr0RequiresViolation, ldv_kobject_cleanupErr1RequiresViolation, mainErr0EnsuresViolation, LDV_INIT_LIST_HEADErr1RequiresViolation, LDV_INIT_LIST_HEADErr3RequiresViolation, LDV_INIT_LIST_HEADErr2RequiresViolation, LDV_INIT_LIST_HEADErr0RequiresViolation]=== [2018-02-02 10:46:24,315 INFO L82 PathProgramCache]: Analyzing trace with hash -1895274133, now seen corresponding path program 1 times [2018-02-02 10:46:24,316 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 10:46:24,331 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 10:46:24,332 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 10:46:24,472 INFO 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:46:24,472 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-02 10:46:24,473 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-02-02 10:46:24,473 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 10:46:24,473 INFO 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:46:24,473 INFO L182 omatonBuilderFactory]: Interpolants [624#(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|))), 625#(and (<= 16 (select |#length| |ldv_kobject_create_#t~ret14.base|)) (= 0 |ldv_kobject_create_#t~ret14.offset|)), 626#(and (= ldv_kobject_create_~kobj~1.offset 0) (<= 16 (select |#length| ldv_kobject_create_~kobj~1.base))), 620#true, 621#false, 622#(and (or (< 0 (div ldv_malloc_~size 4294967296)) (<= |ldv_malloc_#in~size| ldv_malloc_~size)) (or (<= ldv_malloc_~size |ldv_malloc_#in~size|) (<= (+ (div ldv_malloc_~size 4294967296) 1) 0))), 623#(and (= 0 |ldv_malloc_#t~malloc4.offset|) (or (<= (+ |ldv_malloc_#in~size| 1) 0) (<= |ldv_malloc_#in~size| (select |#length| |ldv_malloc_#t~malloc4.base|)) (<= 2147483648 |ldv_malloc_#in~size|)))] [2018-02-02 10:46:24,473 INFO 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:46:24,474 INFO L409 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-02-02 10:46:24,474 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-02-02 10:46:24,474 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2018-02-02 10:46:24,474 INFO L87 Difference]: Start difference. First operand 119 states and 127 transitions. Second operand 7 states. [2018-02-02 10:46:24,614 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 10:46:24,614 INFO L93 Difference]: Finished difference Result 120 states and 128 transitions. [2018-02-02 10:46:24,615 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-02-02 10:46:24,615 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 19 [2018-02-02 10:46:24,615 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 10:46:24,616 INFO L225 Difference]: With dead ends: 120 [2018-02-02 10:46:24,616 INFO L226 Difference]: Without dead ends: 120 [2018-02-02 10:46:24,616 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:46:24,617 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 120 states. [2018-02-02 10:46:24,622 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 120 to 118. [2018-02-02 10:46:24,622 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 118 states. [2018-02-02 10:46:24,624 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 118 states to 118 states and 126 transitions. [2018-02-02 10:46:24,624 INFO L78 Accepts]: Start accepts. Automaton has 118 states and 126 transitions. Word has length 19 [2018-02-02 10:46:24,624 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 10:46:24,624 INFO L432 AbstractCegarLoop]: Abstraction has 118 states and 126 transitions. [2018-02-02 10:46:24,624 INFO L433 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-02-02 10:46:24,624 INFO L276 IsEmpty]: Start isEmpty. Operand 118 states and 126 transitions. [2018-02-02 10:46:24,625 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2018-02-02 10:46:24,625 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 10:46:24,625 INFO L351 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-02 10:46:24,626 INFO L371 AbstractCegarLoop]: === Iteration 4 === [ldv_kref_initErr0RequiresViolation, ldv_kref_initErr1RequiresViolation, ldv_kobject_createErr0RequiresViolation, ldv_kobject_createErr1RequiresViolation, ldv_atomic_sub_returnErr1RequiresViolation, ldv_atomic_sub_returnErr0RequiresViolation, ldv_atomic_sub_returnErr3RequiresViolation, ldv_atomic_sub_returnErr2RequiresViolation, ldv_kobject_cleanupErr4RequiresViolation, ldv_kobject_cleanupErr2RequiresViolation, ldv_kobject_cleanupErr5RequiresViolation, ldv_kobject_cleanupErr3RequiresViolation, ldv_kobject_cleanupErr0RequiresViolation, ldv_kobject_cleanupErr1RequiresViolation, mainErr0EnsuresViolation, LDV_INIT_LIST_HEADErr1RequiresViolation, LDV_INIT_LIST_HEADErr3RequiresViolation, LDV_INIT_LIST_HEADErr2RequiresViolation, LDV_INIT_LIST_HEADErr0RequiresViolation]=== [2018-02-02 10:46:24,626 INFO L82 PathProgramCache]: Analyzing trace with hash 1715794329, now seen corresponding path program 1 times [2018-02-02 10:46:24,627 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 10:46:24,642 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 10:46:24,643 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 10:46:24,700 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 10:46:24,700 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-02 10:46:24,700 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-02-02 10:46:24,700 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 10:46:24,700 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 10:46:24,701 INFO L182 omatonBuilderFactory]: Interpolants [869#true, 870#false, 871#(and (= 0 |ldv_kobject_create_#res.base|) (= 0 |ldv_kobject_create_#res.offset|)), 872#(and (= 0 |entry_point_#t~ret16.base|) (= 0 |entry_point_#t~ret16.offset|)), 873#(and (= 0 entry_point_~kobj~2.base) (= 0 entry_point_~kobj~2.offset)), 874#(and (= 0 |ldv_kobject_put_#in~kobj.offset|) (= 0 |ldv_kobject_put_#in~kobj.base|)), 875#(and (= ldv_kobject_put_~kobj.offset 0) (= 0 ldv_kobject_put_~kobj.base))] [2018-02-02 10:46:24,701 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 10:46:24,701 INFO L409 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-02-02 10:46:24,701 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-02-02 10:46:24,701 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2018-02-02 10:46:24,701 INFO L87 Difference]: Start difference. First operand 118 states and 126 transitions. Second operand 7 states. [2018-02-02 10:46:24,737 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 10:46:24,737 INFO L93 Difference]: Finished difference Result 131 states and 141 transitions. [2018-02-02 10:46:24,737 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-02-02 10:46:24,737 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 29 [2018-02-02 10:46:24,737 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 10:46:24,738 INFO L225 Difference]: With dead ends: 131 [2018-02-02 10:46:24,738 INFO L226 Difference]: Without dead ends: 131 [2018-02-02 10:46:24,739 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:46:24,739 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 131 states. [2018-02-02 10:46:24,746 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 131 to 127. [2018-02-02 10:46:24,746 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 127 states. [2018-02-02 10:46:24,747 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 127 states to 127 states and 136 transitions. [2018-02-02 10:46:24,748 INFO L78 Accepts]: Start accepts. Automaton has 127 states and 136 transitions. Word has length 29 [2018-02-02 10:46:24,748 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 10:46:24,748 INFO L432 AbstractCegarLoop]: Abstraction has 127 states and 136 transitions. [2018-02-02 10:46:24,748 INFO L433 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-02-02 10:46:24,748 INFO L276 IsEmpty]: Start isEmpty. Operand 127 states and 136 transitions. [2018-02-02 10:46:24,749 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2018-02-02 10:46:24,749 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 10:46:24,749 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:46:24,749 INFO L371 AbstractCegarLoop]: === Iteration 5 === [ldv_kref_initErr0RequiresViolation, ldv_kref_initErr1RequiresViolation, ldv_kobject_createErr0RequiresViolation, ldv_kobject_createErr1RequiresViolation, ldv_atomic_sub_returnErr1RequiresViolation, ldv_atomic_sub_returnErr0RequiresViolation, ldv_atomic_sub_returnErr3RequiresViolation, ldv_atomic_sub_returnErr2RequiresViolation, ldv_kobject_cleanupErr4RequiresViolation, ldv_kobject_cleanupErr2RequiresViolation, ldv_kobject_cleanupErr5RequiresViolation, ldv_kobject_cleanupErr3RequiresViolation, ldv_kobject_cleanupErr0RequiresViolation, ldv_kobject_cleanupErr1RequiresViolation, mainErr0EnsuresViolation, LDV_INIT_LIST_HEADErr1RequiresViolation, LDV_INIT_LIST_HEADErr3RequiresViolation, LDV_INIT_LIST_HEADErr2RequiresViolation, LDV_INIT_LIST_HEADErr0RequiresViolation]=== [2018-02-02 10:46:24,749 INFO L82 PathProgramCache]: Analyzing trace with hash -785661208, now seen corresponding path program 1 times [2018-02-02 10:46:24,750 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 10:46:24,763 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 10:46:24,764 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 10:46:24,827 INFO 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:46:24,827 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-02 10:46:24,828 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2018-02-02 10:46:24,828 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 10:46:24,828 INFO 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:46:24,828 INFO L182 omatonBuilderFactory]: Interpolants [1136#true, 1137#false, 1138#(= 1 (select |#valid| |#Ultimate.C_memset_#ptr.base|)), 1139#(= 1 (select |#valid| ldv_kobject_create_~kobj~1.base)), 1140#(= 1 (select |#valid| |ldv_kobject_init_#in~kobj.base|)), 1141#(= 1 (select |#valid| ldv_kobject_init_~kobj.base)), 1142#(= 1 (select |#valid| |ldv_kobject_init_internal_#in~kobj.base|)), 1143#(= 1 (select |#valid| ldv_kobject_init_internal_~kobj.base)), 1144#(= 1 (select |#valid| |ldv_kref_init_#in~kref.base|)), 1145#(= 1 (select |#valid| ldv_kref_init_~kref.base))] [2018-02-02 10:46:24,828 INFO 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:46:24,828 INFO L409 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-02-02 10:46:24,829 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-02-02 10:46:24,829 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=73, Unknown=0, NotChecked=0, Total=90 [2018-02-02 10:46:24,829 INFO L87 Difference]: Start difference. First operand 127 states and 136 transitions. Second operand 10 states. [2018-02-02 10:46:25,035 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 10:46:25,035 INFO L93 Difference]: Finished difference Result 126 states and 135 transitions. [2018-02-02 10:46:25,035 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-02-02 10:46:25,035 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 34 [2018-02-02 10:46:25,036 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 10:46:25,036 INFO L225 Difference]: With dead ends: 126 [2018-02-02 10:46:25,036 INFO L226 Difference]: Without dead ends: 126 [2018-02-02 10:46:25,036 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:46:25,037 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 126 states. [2018-02-02 10:46:25,041 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 126 to 126. [2018-02-02 10:46:25,041 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 126 states. [2018-02-02 10:46:25,042 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 126 states to 126 states and 135 transitions. [2018-02-02 10:46:25,042 INFO L78 Accepts]: Start accepts. Automaton has 126 states and 135 transitions. Word has length 34 [2018-02-02 10:46:25,042 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 10:46:25,042 INFO L432 AbstractCegarLoop]: Abstraction has 126 states and 135 transitions. [2018-02-02 10:46:25,043 INFO L433 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-02-02 10:46:25,043 INFO L276 IsEmpty]: Start isEmpty. Operand 126 states and 135 transitions. [2018-02-02 10:46:25,043 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2018-02-02 10:46:25,043 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 10:46:25,044 INFO L351 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-02 10:46:25,044 INFO L371 AbstractCegarLoop]: === Iteration 6 === [ldv_kref_initErr0RequiresViolation, ldv_kref_initErr1RequiresViolation, ldv_kobject_createErr0RequiresViolation, ldv_kobject_createErr1RequiresViolation, ldv_atomic_sub_returnErr1RequiresViolation, ldv_atomic_sub_returnErr0RequiresViolation, ldv_atomic_sub_returnErr3RequiresViolation, ldv_atomic_sub_returnErr2RequiresViolation, ldv_kobject_cleanupErr4RequiresViolation, ldv_kobject_cleanupErr2RequiresViolation, ldv_kobject_cleanupErr5RequiresViolation, ldv_kobject_cleanupErr3RequiresViolation, ldv_kobject_cleanupErr0RequiresViolation, ldv_kobject_cleanupErr1RequiresViolation, mainErr0EnsuresViolation, LDV_INIT_LIST_HEADErr1RequiresViolation, LDV_INIT_LIST_HEADErr3RequiresViolation, LDV_INIT_LIST_HEADErr2RequiresViolation, LDV_INIT_LIST_HEADErr0RequiresViolation]=== [2018-02-02 10:46:25,044 INFO L82 PathProgramCache]: Analyzing trace with hash -785661207, now seen corresponding path program 1 times [2018-02-02 10:46:25,045 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 10:46:25,057 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 10:46:25,058 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 10:46:25,082 INFO 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:46:25,083 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-02 10:46:25,083 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-02-02 10:46:25,083 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 10:46:25,083 INFO 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:46:25,083 INFO L182 omatonBuilderFactory]: Interpolants [1404#true, 1405#false, 1406#(= |#Ultimate.C_memset_#t~loopctr17| 0), 1407#(<= |#Ultimate.C_memset_#amount| 0)] [2018-02-02 10:46:25,084 INFO 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:46:25,084 INFO L409 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-02-02 10:46:25,084 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-02-02 10:46:25,084 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-02-02 10:46:25,084 INFO L87 Difference]: Start difference. First operand 126 states and 135 transitions. Second operand 4 states. [2018-02-02 10:46:25,100 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 10:46:25,100 INFO L93 Difference]: Finished difference Result 129 states and 138 transitions. [2018-02-02 10:46:25,101 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-02-02 10:46:25,101 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 34 [2018-02-02 10:46:25,101 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 10:46:25,102 INFO L225 Difference]: With dead ends: 129 [2018-02-02 10:46:25,102 INFO L226 Difference]: Without dead ends: 127 [2018-02-02 10:46:25,102 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:46:25,103 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 127 states. [2018-02-02 10:46:25,107 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 127 to 127. [2018-02-02 10:46:25,108 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 127 states. [2018-02-02 10:46:25,108 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 127 states to 127 states and 136 transitions. [2018-02-02 10:46:25,109 INFO L78 Accepts]: Start accepts. Automaton has 127 states and 136 transitions. Word has length 34 [2018-02-02 10:46:25,109 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 10:46:25,109 INFO L432 AbstractCegarLoop]: Abstraction has 127 states and 136 transitions. [2018-02-02 10:46:25,109 INFO L433 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-02-02 10:46:25,109 INFO L276 IsEmpty]: Start isEmpty. Operand 127 states and 136 transitions. [2018-02-02 10:46:25,110 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2018-02-02 10:46:25,110 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 10:46:25,110 INFO L351 BasicCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-02 10:46:25,110 INFO L371 AbstractCegarLoop]: === Iteration 7 === [ldv_kref_initErr0RequiresViolation, ldv_kref_initErr1RequiresViolation, ldv_kobject_createErr0RequiresViolation, ldv_kobject_createErr1RequiresViolation, ldv_atomic_sub_returnErr1RequiresViolation, ldv_atomic_sub_returnErr0RequiresViolation, ldv_atomic_sub_returnErr3RequiresViolation, ldv_atomic_sub_returnErr2RequiresViolation, ldv_kobject_cleanupErr4RequiresViolation, ldv_kobject_cleanupErr2RequiresViolation, ldv_kobject_cleanupErr5RequiresViolation, ldv_kobject_cleanupErr3RequiresViolation, ldv_kobject_cleanupErr0RequiresViolation, ldv_kobject_cleanupErr1RequiresViolation, mainErr0EnsuresViolation, LDV_INIT_LIST_HEADErr1RequiresViolation, LDV_INIT_LIST_HEADErr3RequiresViolation, LDV_INIT_LIST_HEADErr2RequiresViolation, LDV_INIT_LIST_HEADErr0RequiresViolation]=== [2018-02-02 10:46:25,110 INFO L82 PathProgramCache]: Analyzing trace with hash -1322241719, now seen corresponding path program 1 times [2018-02-02 10:46:25,111 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 10:46:25,118 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 10:46:25,119 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 10:46:25,143 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2018-02-02 10:46:25,143 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-02 10:46:25,144 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-02-02 10:46:25,144 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 10:46:25,144 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2018-02-02 10:46:25,144 INFO L182 omatonBuilderFactory]: Interpolants [1666#true, 1667#false, 1668#(= |#valid| |old(#valid)|)] [2018-02-02 10:46:25,144 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2018-02-02 10:46:25,145 INFO L409 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-02-02 10:46:25,145 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-02-02 10:46:25,145 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-02-02 10:46:25,145 INFO L87 Difference]: Start difference. First operand 127 states and 136 transitions. Second operand 3 states. [2018-02-02 10:46:25,228 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 10:46:25,228 INFO L93 Difference]: Finished difference Result 143 states and 154 transitions. [2018-02-02 10:46:25,228 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-02-02 10:46:25,229 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 32 [2018-02-02 10:46:25,229 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 10:46:25,230 INFO L225 Difference]: With dead ends: 143 [2018-02-02 10:46:25,230 INFO L226 Difference]: Without dead ends: 131 [2018-02-02 10:46:25,230 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 11 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:46:25,230 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 131 states. [2018-02-02 10:46:25,235 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 131 to 123. [2018-02-02 10:46:25,235 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 123 states. [2018-02-02 10:46:25,236 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 123 states to 123 states and 131 transitions. [2018-02-02 10:46:25,236 INFO L78 Accepts]: Start accepts. Automaton has 123 states and 131 transitions. Word has length 32 [2018-02-02 10:46:25,236 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 10:46:25,236 INFO L432 AbstractCegarLoop]: Abstraction has 123 states and 131 transitions. [2018-02-02 10:46:25,236 INFO L433 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-02-02 10:46:25,236 INFO L276 IsEmpty]: Start isEmpty. Operand 123 states and 131 transitions. [2018-02-02 10:46:25,237 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2018-02-02 10:46:25,237 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 10:46:25,237 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:46:25,237 INFO L371 AbstractCegarLoop]: === Iteration 8 === [ldv_kref_initErr0RequiresViolation, ldv_kref_initErr1RequiresViolation, ldv_kobject_createErr0RequiresViolation, ldv_kobject_createErr1RequiresViolation, ldv_atomic_sub_returnErr1RequiresViolation, ldv_atomic_sub_returnErr0RequiresViolation, ldv_atomic_sub_returnErr3RequiresViolation, ldv_atomic_sub_returnErr2RequiresViolation, ldv_kobject_cleanupErr4RequiresViolation, ldv_kobject_cleanupErr2RequiresViolation, ldv_kobject_cleanupErr5RequiresViolation, ldv_kobject_cleanupErr3RequiresViolation, ldv_kobject_cleanupErr0RequiresViolation, ldv_kobject_cleanupErr1RequiresViolation, mainErr0EnsuresViolation, LDV_INIT_LIST_HEADErr1RequiresViolation, LDV_INIT_LIST_HEADErr3RequiresViolation, LDV_INIT_LIST_HEADErr2RequiresViolation, LDV_INIT_LIST_HEADErr0RequiresViolation]=== [2018-02-02 10:46:25,238 INFO L82 PathProgramCache]: Analyzing trace with hash 1082750419, now seen corresponding path program 1 times [2018-02-02 10:46:25,239 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 10:46:25,249 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 10:46:25,250 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 10:46:25,278 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:46:25,278 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-02 10:46:25,278 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5] total 5 [2018-02-02 10:46:25,279 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 10:46:25,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:46:25,279 INFO L182 omatonBuilderFactory]: Interpolants [1936#false, 1937#(= |#Ultimate.C_memset_#t~loopctr17| 0), 1938#(<= |#Ultimate.C_memset_#t~loopctr17| 1), 1939#(<= |#Ultimate.C_memset_#amount| 1), 1935#true] [2018-02-02 10:46:25,279 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:46:25,279 INFO L409 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-02-02 10:46:25,280 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-02-02 10:46:25,280 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2018-02-02 10:46:25,280 INFO L87 Difference]: Start difference. First operand 123 states and 131 transitions. Second operand 5 states. [2018-02-02 10:46:25,298 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 10:46:25,298 INFO L93 Difference]: Finished difference Result 126 states and 134 transitions. [2018-02-02 10:46:25,298 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-02-02 10:46:25,298 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 35 [2018-02-02 10:46:25,299 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 10:46:25,299 INFO L225 Difference]: With dead ends: 126 [2018-02-02 10:46:25,299 INFO L226 Difference]: Without dead ends: 124 [2018-02-02 10:46:25,300 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:46:25,300 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 124 states. [2018-02-02 10:46:25,303 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 124 to 124. [2018-02-02 10:46:25,304 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 124 states. [2018-02-02 10:46:25,304 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 124 states to 124 states and 132 transitions. [2018-02-02 10:46:25,304 INFO L78 Accepts]: Start accepts. Automaton has 124 states and 132 transitions. Word has length 35 [2018-02-02 10:46:25,304 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 10:46:25,304 INFO L432 AbstractCegarLoop]: Abstraction has 124 states and 132 transitions. [2018-02-02 10:46:25,305 INFO L433 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-02-02 10:46:25,305 INFO L276 IsEmpty]: Start isEmpty. Operand 124 states and 132 transitions. [2018-02-02 10:46:25,305 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2018-02-02 10:46:25,305 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 10:46:25,305 INFO L351 BasicCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-02 10:46:25,305 INFO L371 AbstractCegarLoop]: === Iteration 9 === [ldv_kref_initErr0RequiresViolation, ldv_kref_initErr1RequiresViolation, ldv_kobject_createErr0RequiresViolation, ldv_kobject_createErr1RequiresViolation, ldv_atomic_sub_returnErr1RequiresViolation, ldv_atomic_sub_returnErr0RequiresViolation, ldv_atomic_sub_returnErr3RequiresViolation, ldv_atomic_sub_returnErr2RequiresViolation, ldv_kobject_cleanupErr4RequiresViolation, ldv_kobject_cleanupErr2RequiresViolation, ldv_kobject_cleanupErr5RequiresViolation, ldv_kobject_cleanupErr3RequiresViolation, ldv_kobject_cleanupErr0RequiresViolation, ldv_kobject_cleanupErr1RequiresViolation, mainErr0EnsuresViolation, LDV_INIT_LIST_HEADErr1RequiresViolation, LDV_INIT_LIST_HEADErr3RequiresViolation, LDV_INIT_LIST_HEADErr2RequiresViolation, LDV_INIT_LIST_HEADErr0RequiresViolation]=== [2018-02-02 10:46:25,305 INFO L82 PathProgramCache]: Analyzing trace with hash -1962528345, now seen corresponding path program 1 times [2018-02-02 10:46:25,306 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 10:46:25,312 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 10:46:25,313 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 10:46:25,345 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2018-02-02 10:46:25,345 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-02 10:46:25,345 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-02-02 10:46:25,345 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 10:46:25,346 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2018-02-02 10:46:25,346 INFO L182 omatonBuilderFactory]: Interpolants [2192#true, 2193#false, 2194#(not (= |ldv_malloc_#t~malloc4.base| 0)), 2195#(not (= |ldv_malloc_#res.base| 0)), 2196#(not (= |ldv_kobject_create_#t~ret14.base| 0)), 2197#(not (= ldv_kobject_create_~kobj~1.base 0))] [2018-02-02 10:46:25,346 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2018-02-02 10:46:25,346 INFO L409 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-02-02 10:46:25,346 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-02-02 10:46:25,347 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-02-02 10:46:25,347 INFO L87 Difference]: Start difference. First operand 124 states and 132 transitions. Second operand 6 states. [2018-02-02 10:46:25,372 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 10:46:25,372 INFO L93 Difference]: Finished difference Result 115 states and 121 transitions. [2018-02-02 10:46:25,373 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-02-02 10:46:25,373 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 34 [2018-02-02 10:46:25,373 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 10:46:25,374 INFO L225 Difference]: With dead ends: 115 [2018-02-02 10:46:25,374 INFO L226 Difference]: Without dead ends: 115 [2018-02-02 10:46:25,374 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:46:25,375 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 115 states. [2018-02-02 10:46:25,377 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 115 to 115. [2018-02-02 10:46:25,377 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 115 states. [2018-02-02 10:46:25,377 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 115 states to 115 states and 121 transitions. [2018-02-02 10:46:25,378 INFO L78 Accepts]: Start accepts. Automaton has 115 states and 121 transitions. Word has length 34 [2018-02-02 10:46:25,378 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 10:46:25,378 INFO L432 AbstractCegarLoop]: Abstraction has 115 states and 121 transitions. [2018-02-02 10:46:25,378 INFO L433 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-02-02 10:46:25,378 INFO L276 IsEmpty]: Start isEmpty. Operand 115 states and 121 transitions. [2018-02-02 10:46:25,379 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2018-02-02 10:46:25,379 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 10:46:25,379 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:46:25,379 INFO L371 AbstractCegarLoop]: === Iteration 10 === [ldv_kref_initErr0RequiresViolation, ldv_kref_initErr1RequiresViolation, ldv_kobject_createErr0RequiresViolation, ldv_kobject_createErr1RequiresViolation, ldv_atomic_sub_returnErr1RequiresViolation, ldv_atomic_sub_returnErr0RequiresViolation, ldv_atomic_sub_returnErr3RequiresViolation, ldv_atomic_sub_returnErr2RequiresViolation, ldv_kobject_cleanupErr4RequiresViolation, ldv_kobject_cleanupErr2RequiresViolation, ldv_kobject_cleanupErr5RequiresViolation, ldv_kobject_cleanupErr3RequiresViolation, ldv_kobject_cleanupErr0RequiresViolation, ldv_kobject_cleanupErr1RequiresViolation, mainErr0EnsuresViolation, LDV_INIT_LIST_HEADErr1RequiresViolation, LDV_INIT_LIST_HEADErr3RequiresViolation, LDV_INIT_LIST_HEADErr2RequiresViolation, LDV_INIT_LIST_HEADErr0RequiresViolation]=== [2018-02-02 10:46:25,380 INFO L82 PathProgramCache]: Analyzing trace with hash -1126031319, now seen corresponding path program 2 times [2018-02-02 10:46:25,380 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 10:46:25,390 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 10:46:25,391 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 10:46:25,477 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:46:25,477 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-02 10:46:25,477 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6] total 6 [2018-02-02 10:46:25,478 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 10:46:25,478 INFO 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:46:25,478 INFO L182 omatonBuilderFactory]: Interpolants [2432#(= |#Ultimate.C_memset_#t~loopctr17| 0), 2433#(<= |#Ultimate.C_memset_#t~loopctr17| 1), 2434#(<= |#Ultimate.C_memset_#t~loopctr17| 2), 2435#(<= |#Ultimate.C_memset_#amount| 2), 2430#true, 2431#false] [2018-02-02 10:46:25,478 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:46:25,478 INFO L409 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-02-02 10:46:25,479 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-02-02 10:46:25,479 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2018-02-02 10:46:25,479 INFO L87 Difference]: Start difference. First operand 115 states and 121 transitions. Second operand 6 states. [2018-02-02 10:46:25,496 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 10:46:25,497 INFO L93 Difference]: Finished difference Result 118 states and 124 transitions. [2018-02-02 10:46:25,498 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-02-02 10:46:25,498 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 36 [2018-02-02 10:46:25,498 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 10:46:25,499 INFO L225 Difference]: With dead ends: 118 [2018-02-02 10:46:25,499 INFO L226 Difference]: Without dead ends: 116 [2018-02-02 10:46:25,499 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:46:25,500 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 116 states. [2018-02-02 10:46:25,502 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 116 to 116. [2018-02-02 10:46:25,502 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 116 states. [2018-02-02 10:46:25,503 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 116 states to 116 states and 122 transitions. [2018-02-02 10:46:25,503 INFO L78 Accepts]: Start accepts. Automaton has 116 states and 122 transitions. Word has length 36 [2018-02-02 10:46:25,504 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 10:46:25,504 INFO L432 AbstractCegarLoop]: Abstraction has 116 states and 122 transitions. [2018-02-02 10:46:25,504 INFO L433 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-02-02 10:46:25,504 INFO L276 IsEmpty]: Start isEmpty. Operand 116 states and 122 transitions. [2018-02-02 10:46:25,505 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2018-02-02 10:46:25,505 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 10:46:25,505 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:46:25,505 INFO L371 AbstractCegarLoop]: === Iteration 11 === [ldv_kref_initErr0RequiresViolation, ldv_kref_initErr1RequiresViolation, ldv_kobject_createErr0RequiresViolation, ldv_kobject_createErr1RequiresViolation, ldv_atomic_sub_returnErr1RequiresViolation, ldv_atomic_sub_returnErr0RequiresViolation, ldv_atomic_sub_returnErr3RequiresViolation, ldv_atomic_sub_returnErr2RequiresViolation, ldv_kobject_cleanupErr4RequiresViolation, ldv_kobject_cleanupErr2RequiresViolation, ldv_kobject_cleanupErr5RequiresViolation, ldv_kobject_cleanupErr3RequiresViolation, ldv_kobject_cleanupErr0RequiresViolation, ldv_kobject_cleanupErr1RequiresViolation, mainErr0EnsuresViolation, LDV_INIT_LIST_HEADErr1RequiresViolation, LDV_INIT_LIST_HEADErr3RequiresViolation, LDV_INIT_LIST_HEADErr2RequiresViolation, LDV_INIT_LIST_HEADErr0RequiresViolation]=== [2018-02-02 10:46:25,505 INFO L82 PathProgramCache]: Analyzing trace with hash -878788461, now seen corresponding path program 3 times [2018-02-02 10:46:25,506 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 10:46:25,518 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 10:46:25,519 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 10:46:25,563 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:46:25,564 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-02 10:46:25,564 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7] total 7 [2018-02-02 10:46:25,564 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 10:46:25,565 INFO 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:46:25,565 INFO L182 omatonBuilderFactory]: Interpolants [2672#true, 2673#false, 2674#(= |#Ultimate.C_memset_#t~loopctr17| 0), 2675#(<= |#Ultimate.C_memset_#t~loopctr17| 1), 2676#(<= |#Ultimate.C_memset_#t~loopctr17| 2), 2677#(<= |#Ultimate.C_memset_#t~loopctr17| 3), 2678#(<= |#Ultimate.C_memset_#amount| 3)] [2018-02-02 10:46:25,565 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:46:25,565 INFO L409 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-02-02 10:46:25,565 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-02-02 10:46:25,565 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2018-02-02 10:46:25,566 INFO L87 Difference]: Start difference. First operand 116 states and 122 transitions. Second operand 7 states. [2018-02-02 10:46:25,585 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 10:46:25,585 INFO L93 Difference]: Finished difference Result 119 states and 125 transitions. [2018-02-02 10:46:25,587 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-02-02 10:46:25,588 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 37 [2018-02-02 10:46:25,588 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 10:46:25,589 INFO L225 Difference]: With dead ends: 119 [2018-02-02 10:46:25,589 INFO L226 Difference]: Without dead ends: 117 [2018-02-02 10:46:25,589 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:46:25,589 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 117 states. [2018-02-02 10:46:25,592 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 117 to 117. [2018-02-02 10:46:25,592 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 117 states. [2018-02-02 10:46:25,592 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 117 states to 117 states and 123 transitions. [2018-02-02 10:46:25,593 INFO L78 Accepts]: Start accepts. Automaton has 117 states and 123 transitions. Word has length 37 [2018-02-02 10:46:25,593 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 10:46:25,593 INFO L432 AbstractCegarLoop]: Abstraction has 117 states and 123 transitions. [2018-02-02 10:46:25,593 INFO L433 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-02-02 10:46:25,593 INFO L276 IsEmpty]: Start isEmpty. Operand 117 states and 123 transitions. [2018-02-02 10:46:25,594 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2018-02-02 10:46:25,594 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 10:46:25,594 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:46:25,594 INFO L371 AbstractCegarLoop]: === Iteration 12 === [ldv_kref_initErr0RequiresViolation, ldv_kref_initErr1RequiresViolation, ldv_kobject_createErr0RequiresViolation, ldv_kobject_createErr1RequiresViolation, ldv_atomic_sub_returnErr1RequiresViolation, ldv_atomic_sub_returnErr0RequiresViolation, ldv_atomic_sub_returnErr3RequiresViolation, ldv_atomic_sub_returnErr2RequiresViolation, ldv_kobject_cleanupErr4RequiresViolation, ldv_kobject_cleanupErr2RequiresViolation, ldv_kobject_cleanupErr5RequiresViolation, ldv_kobject_cleanupErr3RequiresViolation, ldv_kobject_cleanupErr0RequiresViolation, ldv_kobject_cleanupErr1RequiresViolation, mainErr0EnsuresViolation, LDV_INIT_LIST_HEADErr1RequiresViolation, LDV_INIT_LIST_HEADErr3RequiresViolation, LDV_INIT_LIST_HEADErr2RequiresViolation, LDV_INIT_LIST_HEADErr0RequiresViolation]=== [2018-02-02 10:46:25,594 INFO L82 PathProgramCache]: Analyzing trace with hash -1804194455, now seen corresponding path program 4 times [2018-02-02 10:46:25,595 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 10:46:25,607 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 10:46:25,608 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 10:46:25,648 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:46:25,648 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-02 10:46:25,649 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8] total 8 [2018-02-02 10:46:25,649 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 10:46:25,649 INFO 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:46:25,649 INFO L182 omatonBuilderFactory]: Interpolants [2917#true, 2918#false, 2919#(= |#Ultimate.C_memset_#t~loopctr17| 0), 2920#(<= |#Ultimate.C_memset_#t~loopctr17| 1), 2921#(<= |#Ultimate.C_memset_#t~loopctr17| 2), 2922#(<= |#Ultimate.C_memset_#t~loopctr17| 3), 2923#(<= |#Ultimate.C_memset_#t~loopctr17| 4), 2924#(<= |#Ultimate.C_memset_#amount| 4)] [2018-02-02 10:46:25,649 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:46:25,649 INFO L409 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-02-02 10:46:25,649 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-02-02 10:46:25,649 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2018-02-02 10:46:25,649 INFO L87 Difference]: Start difference. First operand 117 states and 123 transitions. Second operand 8 states. [2018-02-02 10:46:25,664 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 10:46:25,664 INFO L93 Difference]: Finished difference Result 120 states and 126 transitions. [2018-02-02 10:46:25,676 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-02-02 10:46:25,676 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 38 [2018-02-02 10:46:25,676 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 10:46:25,677 INFO L225 Difference]: With dead ends: 120 [2018-02-02 10:46:25,677 INFO L226 Difference]: Without dead ends: 118 [2018-02-02 10:46:25,677 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:46:25,678 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 118 states. [2018-02-02 10:46:25,679 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 118 to 118. [2018-02-02 10:46:25,679 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 118 states. [2018-02-02 10:46:25,680 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 118 states to 118 states and 124 transitions. [2018-02-02 10:46:25,680 INFO L78 Accepts]: Start accepts. Automaton has 118 states and 124 transitions. Word has length 38 [2018-02-02 10:46:25,680 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 10:46:25,680 INFO L432 AbstractCegarLoop]: Abstraction has 118 states and 124 transitions. [2018-02-02 10:46:25,680 INFO L433 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-02-02 10:46:25,680 INFO L276 IsEmpty]: Start isEmpty. Operand 118 states and 124 transitions. [2018-02-02 10:46:25,681 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2018-02-02 10:46:25,681 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 10:46:25,681 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:46:25,681 INFO L371 AbstractCegarLoop]: === Iteration 13 === [ldv_kref_initErr0RequiresViolation, ldv_kref_initErr1RequiresViolation, ldv_kobject_createErr0RequiresViolation, ldv_kobject_createErr1RequiresViolation, ldv_atomic_sub_returnErr1RequiresViolation, ldv_atomic_sub_returnErr0RequiresViolation, ldv_atomic_sub_returnErr3RequiresViolation, ldv_atomic_sub_returnErr2RequiresViolation, ldv_kobject_cleanupErr4RequiresViolation, ldv_kobject_cleanupErr2RequiresViolation, ldv_kobject_cleanupErr5RequiresViolation, ldv_kobject_cleanupErr3RequiresViolation, ldv_kobject_cleanupErr0RequiresViolation, ldv_kobject_cleanupErr1RequiresViolation, mainErr0EnsuresViolation, LDV_INIT_LIST_HEADErr1RequiresViolation, LDV_INIT_LIST_HEADErr3RequiresViolation, LDV_INIT_LIST_HEADErr2RequiresViolation, LDV_INIT_LIST_HEADErr0RequiresViolation]=== [2018-02-02 10:46:25,681 INFO L82 PathProgramCache]: Analyzing trace with hash -427009197, now seen corresponding path program 5 times [2018-02-02 10:46:25,682 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 10:46:25,691 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 10:46:25,692 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 10:46:25,744 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:46:25,744 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-02 10:46:25,744 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9] total 9 [2018-02-02 10:46:25,744 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 10:46:25,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:46:25,745 INFO L182 omatonBuilderFactory]: Interpolants [3168#(<= |#Ultimate.C_memset_#t~loopctr17| 1), 3169#(<= |#Ultimate.C_memset_#t~loopctr17| 2), 3170#(<= |#Ultimate.C_memset_#t~loopctr17| 3), 3171#(<= |#Ultimate.C_memset_#t~loopctr17| 4), 3172#(<= |#Ultimate.C_memset_#t~loopctr17| 5), 3173#(<= |#Ultimate.C_memset_#amount| 5), 3165#true, 3166#false, 3167#(= |#Ultimate.C_memset_#t~loopctr17| 0)] [2018-02-02 10:46:25,745 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:46:25,745 INFO L409 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-02-02 10:46:25,745 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-02-02 10:46:25,745 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2018-02-02 10:46:25,745 INFO L87 Difference]: Start difference. First operand 118 states and 124 transitions. Second operand 9 states. [2018-02-02 10:46:25,763 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 10:46:25,763 INFO L93 Difference]: Finished difference Result 121 states and 127 transitions. [2018-02-02 10:46:25,763 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-02-02 10:46:25,763 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 39 [2018-02-02 10:46:25,763 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 10:46:25,764 INFO L225 Difference]: With dead ends: 121 [2018-02-02 10:46:25,764 INFO L226 Difference]: Without dead ends: 119 [2018-02-02 10:46:25,764 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:46:25,764 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 119 states. [2018-02-02 10:46:25,766 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 119 to 119. [2018-02-02 10:46:25,766 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 119 states. [2018-02-02 10:46:25,767 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 119 states to 119 states and 125 transitions. [2018-02-02 10:46:25,767 INFO L78 Accepts]: Start accepts. Automaton has 119 states and 125 transitions. Word has length 39 [2018-02-02 10:46:25,767 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 10:46:25,767 INFO L432 AbstractCegarLoop]: Abstraction has 119 states and 125 transitions. [2018-02-02 10:46:25,767 INFO L433 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-02-02 10:46:25,767 INFO L276 IsEmpty]: Start isEmpty. Operand 119 states and 125 transitions. [2018-02-02 10:46:25,768 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2018-02-02 10:46:25,768 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 10:46:25,768 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:46:25,768 INFO L371 AbstractCegarLoop]: === Iteration 14 === [ldv_kref_initErr0RequiresViolation, ldv_kref_initErr1RequiresViolation, ldv_kobject_createErr0RequiresViolation, ldv_kobject_createErr1RequiresViolation, ldv_atomic_sub_returnErr1RequiresViolation, ldv_atomic_sub_returnErr0RequiresViolation, ldv_atomic_sub_returnErr3RequiresViolation, ldv_atomic_sub_returnErr2RequiresViolation, ldv_kobject_cleanupErr4RequiresViolation, ldv_kobject_cleanupErr2RequiresViolation, ldv_kobject_cleanupErr5RequiresViolation, ldv_kobject_cleanupErr3RequiresViolation, ldv_kobject_cleanupErr0RequiresViolation, ldv_kobject_cleanupErr1RequiresViolation, mainErr0EnsuresViolation, LDV_INIT_LIST_HEADErr1RequiresViolation, LDV_INIT_LIST_HEADErr3RequiresViolation, LDV_INIT_LIST_HEADErr2RequiresViolation, LDV_INIT_LIST_HEADErr0RequiresViolation]=== [2018-02-02 10:46:25,768 INFO L82 PathProgramCache]: Analyzing trace with hash -683939159, now seen corresponding path program 6 times [2018-02-02 10:46:25,769 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 10:46:25,778 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 10:46:25,779 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 10:46:25,817 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:46:25,817 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-02 10:46:25,817 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10] total 10 [2018-02-02 10:46:25,817 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 10:46:25,818 INFO 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:46:25,818 INFO L182 omatonBuilderFactory]: Interpolants [3424#(<= |#Ultimate.C_memset_#t~loopctr17| 6), 3425#(<= |#Ultimate.C_memset_#amount| 6), 3416#true, 3417#false, 3418#(= |#Ultimate.C_memset_#t~loopctr17| 0), 3419#(<= |#Ultimate.C_memset_#t~loopctr17| 1), 3420#(<= |#Ultimate.C_memset_#t~loopctr17| 2), 3421#(<= |#Ultimate.C_memset_#t~loopctr17| 3), 3422#(<= |#Ultimate.C_memset_#t~loopctr17| 4), 3423#(<= |#Ultimate.C_memset_#t~loopctr17| 5)] [2018-02-02 10:46:25,818 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:46:25,818 INFO L409 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-02-02 10:46:25,819 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-02-02 10:46:25,819 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2018-02-02 10:46:25,819 INFO L87 Difference]: Start difference. First operand 119 states and 125 transitions. Second operand 10 states. [2018-02-02 10:46:25,840 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 10:46:25,840 INFO L93 Difference]: Finished difference Result 122 states and 128 transitions. [2018-02-02 10:46:25,840 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-02-02 10:46:25,840 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 40 [2018-02-02 10:46:25,840 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 10:46:25,841 INFO L225 Difference]: With dead ends: 122 [2018-02-02 10:46:25,841 INFO L226 Difference]: Without dead ends: 120 [2018-02-02 10:46:25,841 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:46:25,842 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 120 states. [2018-02-02 10:46:25,844 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 120 to 120. [2018-02-02 10:46:25,844 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 120 states. [2018-02-02 10:46:25,844 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 120 states to 120 states and 126 transitions. [2018-02-02 10:46:25,844 INFO L78 Accepts]: Start accepts. Automaton has 120 states and 126 transitions. Word has length 40 [2018-02-02 10:46:25,844 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 10:46:25,844 INFO L432 AbstractCegarLoop]: Abstraction has 120 states and 126 transitions. [2018-02-02 10:46:25,844 INFO L433 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-02-02 10:46:25,845 INFO L276 IsEmpty]: Start isEmpty. Operand 120 states and 126 transitions. [2018-02-02 10:46:25,845 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2018-02-02 10:46:25,845 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 10:46:25,845 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:46:25,845 INFO L371 AbstractCegarLoop]: === Iteration 15 === [ldv_kref_initErr0RequiresViolation, ldv_kref_initErr1RequiresViolation, ldv_kobject_createErr0RequiresViolation, ldv_kobject_createErr1RequiresViolation, ldv_atomic_sub_returnErr1RequiresViolation, ldv_atomic_sub_returnErr0RequiresViolation, ldv_atomic_sub_returnErr3RequiresViolation, ldv_atomic_sub_returnErr2RequiresViolation, ldv_kobject_cleanupErr4RequiresViolation, ldv_kobject_cleanupErr2RequiresViolation, ldv_kobject_cleanupErr5RequiresViolation, ldv_kobject_cleanupErr3RequiresViolation, ldv_kobject_cleanupErr0RequiresViolation, ldv_kobject_cleanupErr1RequiresViolation, mainErr0EnsuresViolation, LDV_INIT_LIST_HEADErr1RequiresViolation, LDV_INIT_LIST_HEADErr3RequiresViolation, LDV_INIT_LIST_HEADErr2RequiresViolation, LDV_INIT_LIST_HEADErr0RequiresViolation]=== [2018-02-02 10:46:25,845 INFO L82 PathProgramCache]: Analyzing trace with hash -58833389, now seen corresponding path program 7 times [2018-02-02 10:46:25,846 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 10:46:25,858 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 10:46:25,859 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 10:46:25,920 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:46:25,920 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-02 10:46:25,921 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [11] total 11 [2018-02-02 10:46:25,921 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 10:46:25,921 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 10:46:25,921 INFO L182 omatonBuilderFactory]: Interpolants [3680#(<= |#Ultimate.C_memset_#amount| 7), 3670#true, 3671#false, 3672#(= |#Ultimate.C_memset_#t~loopctr17| 0), 3673#(<= |#Ultimate.C_memset_#t~loopctr17| 1), 3674#(<= |#Ultimate.C_memset_#t~loopctr17| 2), 3675#(<= |#Ultimate.C_memset_#t~loopctr17| 3), 3676#(<= |#Ultimate.C_memset_#t~loopctr17| 4), 3677#(<= |#Ultimate.C_memset_#t~loopctr17| 5), 3678#(<= |#Ultimate.C_memset_#t~loopctr17| 6), 3679#(<= |#Ultimate.C_memset_#t~loopctr17| 7)] [2018-02-02 10:46:25,921 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:46:25,921 INFO L409 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-02-02 10:46:25,921 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-02-02 10:46:25,922 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=63, Unknown=0, NotChecked=0, Total=110 [2018-02-02 10:46:25,922 INFO L87 Difference]: Start difference. First operand 120 states and 126 transitions. Second operand 11 states. [2018-02-02 10:46:25,946 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 10:46:25,946 INFO L93 Difference]: Finished difference Result 123 states and 129 transitions. [2018-02-02 10:46:25,946 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-02-02 10:46:25,947 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 41 [2018-02-02 10:46:25,947 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 10:46:25,947 INFO L225 Difference]: With dead ends: 123 [2018-02-02 10:46:25,947 INFO L226 Difference]: Without dead ends: 121 [2018-02-02 10:46:25,948 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:46:25,948 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 121 states. [2018-02-02 10:46:25,949 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 121 to 121. [2018-02-02 10:46:25,950 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 121 states. [2018-02-02 10:46:25,950 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 121 states to 121 states and 127 transitions. [2018-02-02 10:46:25,950 INFO L78 Accepts]: Start accepts. Automaton has 121 states and 127 transitions. Word has length 41 [2018-02-02 10:46:25,950 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 10:46:25,950 INFO L432 AbstractCegarLoop]: Abstraction has 121 states and 127 transitions. [2018-02-02 10:46:25,950 INFO L433 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-02-02 10:46:25,950 INFO L276 IsEmpty]: Start isEmpty. Operand 121 states and 127 transitions. [2018-02-02 10:46:25,951 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2018-02-02 10:46:25,951 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 10:46:25,951 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:46:25,951 INFO L371 AbstractCegarLoop]: === Iteration 16 === [ldv_kref_initErr0RequiresViolation, ldv_kref_initErr1RequiresViolation, ldv_kobject_createErr0RequiresViolation, ldv_kobject_createErr1RequiresViolation, ldv_atomic_sub_returnErr1RequiresViolation, ldv_atomic_sub_returnErr0RequiresViolation, ldv_atomic_sub_returnErr3RequiresViolation, ldv_atomic_sub_returnErr2RequiresViolation, ldv_kobject_cleanupErr4RequiresViolation, ldv_kobject_cleanupErr2RequiresViolation, ldv_kobject_cleanupErr5RequiresViolation, ldv_kobject_cleanupErr3RequiresViolation, ldv_kobject_cleanupErr0RequiresViolation, ldv_kobject_cleanupErr1RequiresViolation, mainErr0EnsuresViolation, LDV_INIT_LIST_HEADErr1RequiresViolation, LDV_INIT_LIST_HEADErr3RequiresViolation, LDV_INIT_LIST_HEADErr2RequiresViolation, LDV_INIT_LIST_HEADErr0RequiresViolation]=== [2018-02-02 10:46:25,951 INFO L82 PathProgramCache]: Analyzing trace with hash 2139576297, now seen corresponding path program 8 times [2018-02-02 10:46:25,952 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 10:46:25,959 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 10:46:25,960 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 10:46:26,074 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:46:26,075 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-02 10:46:26,078 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [12] total 12 [2018-02-02 10:46:26,078 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 10:46:26,079 INFO 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:46:26,079 INFO L182 omatonBuilderFactory]: Interpolants [3936#(<= |#Ultimate.C_memset_#t~loopctr17| 7), 3937#(<= |#Ultimate.C_memset_#t~loopctr17| 8), 3938#(<= |#Ultimate.C_memset_#amount| 8), 3927#true, 3928#false, 3929#(= |#Ultimate.C_memset_#t~loopctr17| 0), 3930#(<= |#Ultimate.C_memset_#t~loopctr17| 1), 3931#(<= |#Ultimate.C_memset_#t~loopctr17| 2), 3932#(<= |#Ultimate.C_memset_#t~loopctr17| 3), 3933#(<= |#Ultimate.C_memset_#t~loopctr17| 4), 3934#(<= |#Ultimate.C_memset_#t~loopctr17| 5), 3935#(<= |#Ultimate.C_memset_#t~loopctr17| 6)] [2018-02-02 10:46:26,079 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:46:26,079 INFO L409 AbstractCegarLoop]: Interpolant automaton has 12 states [2018-02-02 10:46:26,079 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2018-02-02 10:46:26,080 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=75, Unknown=0, NotChecked=0, Total=132 [2018-02-02 10:46:26,080 INFO L87 Difference]: Start difference. First operand 121 states and 127 transitions. Second operand 12 states. [2018-02-02 10:46:26,113 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 10:46:26,113 INFO L93 Difference]: Finished difference Result 124 states and 130 transitions. [2018-02-02 10:46:26,115 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-02-02 10:46:26,115 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 42 [2018-02-02 10:46:26,116 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 10:46:26,116 INFO L225 Difference]: With dead ends: 124 [2018-02-02 10:46:26,117 INFO L226 Difference]: Without dead ends: 122 [2018-02-02 10:46:26,117 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=61, Invalid=95, Unknown=0, NotChecked=0, Total=156 [2018-02-02 10:46:26,117 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 122 states. [2018-02-02 10:46:26,119 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 122 to 122. [2018-02-02 10:46:26,119 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 122 states. [2018-02-02 10:46:26,120 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 122 states to 122 states and 128 transitions. [2018-02-02 10:46:26,120 INFO L78 Accepts]: Start accepts. Automaton has 122 states and 128 transitions. Word has length 42 [2018-02-02 10:46:26,121 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 10:46:26,121 INFO L432 AbstractCegarLoop]: Abstraction has 122 states and 128 transitions. [2018-02-02 10:46:26,121 INFO L433 AbstractCegarLoop]: Interpolant automaton has 12 states. [2018-02-02 10:46:26,121 INFO L276 IsEmpty]: Start isEmpty. Operand 122 states and 128 transitions. [2018-02-02 10:46:26,121 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2018-02-02 10:46:26,121 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 10:46:26,122 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:46:26,122 INFO L371 AbstractCegarLoop]: === Iteration 17 === [ldv_kref_initErr0RequiresViolation, ldv_kref_initErr1RequiresViolation, ldv_kobject_createErr0RequiresViolation, ldv_kobject_createErr1RequiresViolation, ldv_atomic_sub_returnErr1RequiresViolation, ldv_atomic_sub_returnErr0RequiresViolation, ldv_atomic_sub_returnErr3RequiresViolation, ldv_atomic_sub_returnErr2RequiresViolation, ldv_kobject_cleanupErr4RequiresViolation, ldv_kobject_cleanupErr2RequiresViolation, ldv_kobject_cleanupErr5RequiresViolation, ldv_kobject_cleanupErr3RequiresViolation, ldv_kobject_cleanupErr0RequiresViolation, ldv_kobject_cleanupErr1RequiresViolation, mainErr0EnsuresViolation, LDV_INIT_LIST_HEADErr1RequiresViolation, LDV_INIT_LIST_HEADErr3RequiresViolation, LDV_INIT_LIST_HEADErr2RequiresViolation, LDV_INIT_LIST_HEADErr0RequiresViolation]=== [2018-02-02 10:46:26,122 INFO L82 PathProgramCache]: Analyzing trace with hash 1570799827, now seen corresponding path program 9 times [2018-02-02 10:46:26,123 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 10:46:26,134 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 10:46:26,135 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 10:46:26,199 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:46:26,199 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-02 10:46:26,199 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [13] total 13 [2018-02-02 10:46:26,199 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 10:46:26,199 INFO 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:46:26,200 INFO L182 omatonBuilderFactory]: Interpolants [4192#(<= |#Ultimate.C_memset_#t~loopctr17| 3), 4193#(<= |#Ultimate.C_memset_#t~loopctr17| 4), 4194#(<= |#Ultimate.C_memset_#t~loopctr17| 5), 4195#(<= |#Ultimate.C_memset_#t~loopctr17| 6), 4196#(<= |#Ultimate.C_memset_#t~loopctr17| 7), 4197#(<= |#Ultimate.C_memset_#t~loopctr17| 8), 4198#(<= |#Ultimate.C_memset_#t~loopctr17| 9), 4199#(<= |#Ultimate.C_memset_#amount| 9), 4187#true, 4188#false, 4189#(= |#Ultimate.C_memset_#t~loopctr17| 0), 4190#(<= |#Ultimate.C_memset_#t~loopctr17| 1), 4191#(<= |#Ultimate.C_memset_#t~loopctr17| 2)] [2018-02-02 10:46:26,200 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:46:26,200 INFO L409 AbstractCegarLoop]: Interpolant automaton has 13 states [2018-02-02 10:46:26,200 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2018-02-02 10:46:26,200 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=68, Invalid=88, Unknown=0, NotChecked=0, Total=156 [2018-02-02 10:46:26,200 INFO L87 Difference]: Start difference. First operand 122 states and 128 transitions. Second operand 13 states. [2018-02-02 10:46:26,221 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 10:46:26,222 INFO L93 Difference]: Finished difference Result 125 states and 131 transitions. [2018-02-02 10:46:26,222 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2018-02-02 10:46:26,222 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 43 [2018-02-02 10:46:26,222 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 10:46:26,223 INFO L225 Difference]: With dead ends: 125 [2018-02-02 10:46:26,223 INFO L226 Difference]: Without dead ends: 123 [2018-02-02 10:46:26,223 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:46:26,224 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 123 states. [2018-02-02 10:46:26,226 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 123 to 123. [2018-02-02 10:46:26,226 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 123 states. [2018-02-02 10:46:26,227 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 123 states to 123 states and 129 transitions. [2018-02-02 10:46:26,227 INFO L78 Accepts]: Start accepts. Automaton has 123 states and 129 transitions. Word has length 43 [2018-02-02 10:46:26,227 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 10:46:26,227 INFO L432 AbstractCegarLoop]: Abstraction has 123 states and 129 transitions. [2018-02-02 10:46:26,227 INFO L433 AbstractCegarLoop]: Interpolant automaton has 13 states. [2018-02-02 10:46:26,227 INFO L276 IsEmpty]: Start isEmpty. Operand 123 states and 129 transitions. [2018-02-02 10:46:26,227 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2018-02-02 10:46:26,228 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 10:46:26,228 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:46:26,228 INFO L371 AbstractCegarLoop]: === Iteration 18 === [ldv_kref_initErr0RequiresViolation, ldv_kref_initErr1RequiresViolation, ldv_kobject_createErr0RequiresViolation, ldv_kobject_createErr1RequiresViolation, ldv_atomic_sub_returnErr1RequiresViolation, ldv_atomic_sub_returnErr0RequiresViolation, ldv_atomic_sub_returnErr3RequiresViolation, ldv_atomic_sub_returnErr2RequiresViolation, ldv_kobject_cleanupErr4RequiresViolation, ldv_kobject_cleanupErr2RequiresViolation, ldv_kobject_cleanupErr5RequiresViolation, ldv_kobject_cleanupErr3RequiresViolation, ldv_kobject_cleanupErr0RequiresViolation, ldv_kobject_cleanupErr1RequiresViolation, mainErr0EnsuresViolation, LDV_INIT_LIST_HEADErr1RequiresViolation, LDV_INIT_LIST_HEADErr3RequiresViolation, LDV_INIT_LIST_HEADErr2RequiresViolation, LDV_INIT_LIST_HEADErr0RequiresViolation]=== [2018-02-02 10:46:26,228 INFO L82 PathProgramCache]: Analyzing trace with hash 1118598441, now seen corresponding path program 10 times [2018-02-02 10:46:26,229 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 10:46:26,247 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 10:46:26,248 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 10:46:26,331 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:46:26,331 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-02 10:46:26,331 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [14] total 14 [2018-02-02 10:46:26,331 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 10:46:26,331 INFO 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:46:26,332 INFO L182 omatonBuilderFactory]: Interpolants [4450#true, 4451#false, 4452#(= |#Ultimate.C_memset_#t~loopctr17| 0), 4453#(<= |#Ultimate.C_memset_#t~loopctr17| 1), 4454#(<= |#Ultimate.C_memset_#t~loopctr17| 2), 4455#(<= |#Ultimate.C_memset_#t~loopctr17| 3), 4456#(<= |#Ultimate.C_memset_#t~loopctr17| 4), 4457#(<= |#Ultimate.C_memset_#t~loopctr17| 5), 4458#(<= |#Ultimate.C_memset_#t~loopctr17| 6), 4459#(<= |#Ultimate.C_memset_#t~loopctr17| 7), 4460#(<= |#Ultimate.C_memset_#t~loopctr17| 8), 4461#(<= |#Ultimate.C_memset_#t~loopctr17| 9), 4462#(<= |#Ultimate.C_memset_#t~loopctr17| 10), 4463#(<= |#Ultimate.C_memset_#amount| 10)] [2018-02-02 10:46:26,332 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:46:26,332 INFO L409 AbstractCegarLoop]: Interpolant automaton has 14 states [2018-02-02 10:46:26,332 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2018-02-02 10:46:26,332 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=80, Invalid=102, Unknown=0, NotChecked=0, Total=182 [2018-02-02 10:46:26,332 INFO L87 Difference]: Start difference. First operand 123 states and 129 transitions. Second operand 14 states. [2018-02-02 10:46:26,359 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 10:46:26,359 INFO L93 Difference]: Finished difference Result 126 states and 132 transitions. [2018-02-02 10:46:26,359 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2018-02-02 10:46:26,359 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 44 [2018-02-02 10:46:26,359 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 10:46:26,360 INFO L225 Difference]: With dead ends: 126 [2018-02-02 10:46:26,360 INFO L226 Difference]: Without dead ends: 124 [2018-02-02 10:46:26,360 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:46:26,360 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 124 states. [2018-02-02 10:46:26,362 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 124 to 124. [2018-02-02 10:46:26,362 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 124 states. [2018-02-02 10:46:26,363 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 124 states to 124 states and 130 transitions. [2018-02-02 10:46:26,363 INFO L78 Accepts]: Start accepts. Automaton has 124 states and 130 transitions. Word has length 44 [2018-02-02 10:46:26,363 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 10:46:26,363 INFO L432 AbstractCegarLoop]: Abstraction has 124 states and 130 transitions. [2018-02-02 10:46:26,363 INFO L433 AbstractCegarLoop]: Interpolant automaton has 14 states. [2018-02-02 10:46:26,364 INFO L276 IsEmpty]: Start isEmpty. Operand 124 states and 130 transitions. [2018-02-02 10:46:26,364 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2018-02-02 10:46:26,364 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 10:46:26,364 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:46:26,364 INFO L371 AbstractCegarLoop]: === Iteration 19 === [ldv_kref_initErr0RequiresViolation, ldv_kref_initErr1RequiresViolation, ldv_kobject_createErr0RequiresViolation, ldv_kobject_createErr1RequiresViolation, ldv_atomic_sub_returnErr1RequiresViolation, ldv_atomic_sub_returnErr0RequiresViolation, ldv_atomic_sub_returnErr3RequiresViolation, ldv_atomic_sub_returnErr2RequiresViolation, ldv_kobject_cleanupErr4RequiresViolation, ldv_kobject_cleanupErr2RequiresViolation, ldv_kobject_cleanupErr5RequiresViolation, ldv_kobject_cleanupErr3RequiresViolation, ldv_kobject_cleanupErr0RequiresViolation, ldv_kobject_cleanupErr1RequiresViolation, mainErr0EnsuresViolation, LDV_INIT_LIST_HEADErr1RequiresViolation, LDV_INIT_LIST_HEADErr3RequiresViolation, LDV_INIT_LIST_HEADErr2RequiresViolation, LDV_INIT_LIST_HEADErr0RequiresViolation]=== [2018-02-02 10:46:26,364 INFO L82 PathProgramCache]: Analyzing trace with hash -14742637, now seen corresponding path program 11 times [2018-02-02 10:46:26,365 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 10:46:26,377 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 10:46:26,378 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 10:46:26,467 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:46:26,467 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-02 10:46:26,467 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [15] total 15 [2018-02-02 10:46:26,467 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 10:46:26,468 INFO 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:46:26,468 INFO L182 omatonBuilderFactory]: Interpolants [4716#true, 4717#false, 4718#(= |#Ultimate.C_memset_#t~loopctr17| 0), 4719#(<= |#Ultimate.C_memset_#t~loopctr17| 1), 4720#(<= |#Ultimate.C_memset_#t~loopctr17| 2), 4721#(<= |#Ultimate.C_memset_#t~loopctr17| 3), 4722#(<= |#Ultimate.C_memset_#t~loopctr17| 4), 4723#(<= |#Ultimate.C_memset_#t~loopctr17| 5), 4724#(<= |#Ultimate.C_memset_#t~loopctr17| 6), 4725#(<= |#Ultimate.C_memset_#t~loopctr17| 7), 4726#(<= |#Ultimate.C_memset_#t~loopctr17| 8), 4727#(<= |#Ultimate.C_memset_#t~loopctr17| 9), 4728#(<= |#Ultimate.C_memset_#t~loopctr17| 10), 4729#(<= |#Ultimate.C_memset_#t~loopctr17| 11), 4730#(<= |#Ultimate.C_memset_#amount| 11)] [2018-02-02 10:46:26,468 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:46:26,468 INFO L409 AbstractCegarLoop]: Interpolant automaton has 15 states [2018-02-02 10:46:26,468 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2018-02-02 10:46:26,468 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=93, Invalid=117, Unknown=0, NotChecked=0, Total=210 [2018-02-02 10:46:26,469 INFO L87 Difference]: Start difference. First operand 124 states and 130 transitions. Second operand 15 states. [2018-02-02 10:46:26,506 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 10:46:26,506 INFO L93 Difference]: Finished difference Result 127 states and 133 transitions. [2018-02-02 10:46:26,507 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2018-02-02 10:46:26,507 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 45 [2018-02-02 10:46:26,507 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 10:46:26,508 INFO L225 Difference]: With dead ends: 127 [2018-02-02 10:46:26,508 INFO L226 Difference]: Without dead ends: 125 [2018-02-02 10:46:26,508 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:46:26,509 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 125 states. [2018-02-02 10:46:26,511 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 125 to 125. [2018-02-02 10:46:26,511 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 125 states. [2018-02-02 10:46:26,512 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 125 states to 125 states and 131 transitions. [2018-02-02 10:46:26,512 INFO L78 Accepts]: Start accepts. Automaton has 125 states and 131 transitions. Word has length 45 [2018-02-02 10:46:26,512 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 10:46:26,512 INFO L432 AbstractCegarLoop]: Abstraction has 125 states and 131 transitions. [2018-02-02 10:46:26,512 INFO L433 AbstractCegarLoop]: Interpolant automaton has 15 states. [2018-02-02 10:46:26,512 INFO L276 IsEmpty]: Start isEmpty. Operand 125 states and 131 transitions. [2018-02-02 10:46:26,513 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2018-02-02 10:46:26,513 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 10:46:26,513 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:46:26,513 INFO L371 AbstractCegarLoop]: === Iteration 20 === [ldv_kref_initErr0RequiresViolation, ldv_kref_initErr1RequiresViolation, ldv_kobject_createErr0RequiresViolation, ldv_kobject_createErr1RequiresViolation, ldv_atomic_sub_returnErr1RequiresViolation, ldv_atomic_sub_returnErr0RequiresViolation, ldv_atomic_sub_returnErr3RequiresViolation, ldv_atomic_sub_returnErr2RequiresViolation, ldv_kobject_cleanupErr4RequiresViolation, ldv_kobject_cleanupErr2RequiresViolation, ldv_kobject_cleanupErr5RequiresViolation, ldv_kobject_cleanupErr3RequiresViolation, ldv_kobject_cleanupErr0RequiresViolation, ldv_kobject_cleanupErr1RequiresViolation, mainErr0EnsuresViolation, LDV_INIT_LIST_HEADErr1RequiresViolation, LDV_INIT_LIST_HEADErr3RequiresViolation, LDV_INIT_LIST_HEADErr2RequiresViolation, LDV_INIT_LIST_HEADErr0RequiresViolation]=== [2018-02-02 10:46:26,513 INFO L82 PathProgramCache]: Analyzing trace with hash -788577687, now seen corresponding path program 12 times [2018-02-02 10:46:26,514 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 10:46:26,524 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 10:46:26,525 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 10:46:26,635 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:46:26,635 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-02 10:46:26,635 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [16] total 16 [2018-02-02 10:46:26,635 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 10:46:26,635 INFO 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:46:26,635 INFO L182 omatonBuilderFactory]: Interpolants [4992#(<= |#Ultimate.C_memset_#t~loopctr17| 5), 4993#(<= |#Ultimate.C_memset_#t~loopctr17| 6), 4994#(<= |#Ultimate.C_memset_#t~loopctr17| 7), 4995#(<= |#Ultimate.C_memset_#t~loopctr17| 8), 4996#(<= |#Ultimate.C_memset_#t~loopctr17| 9), 4997#(<= |#Ultimate.C_memset_#t~loopctr17| 10), 4998#(<= |#Ultimate.C_memset_#t~loopctr17| 11), 4999#(<= |#Ultimate.C_memset_#t~loopctr17| 12), 5000#(<= |#Ultimate.C_memset_#amount| 12), 4985#true, 4986#false, 4987#(= |#Ultimate.C_memset_#t~loopctr17| 0), 4988#(<= |#Ultimate.C_memset_#t~loopctr17| 1), 4989#(<= |#Ultimate.C_memset_#t~loopctr17| 2), 4990#(<= |#Ultimate.C_memset_#t~loopctr17| 3), 4991#(<= |#Ultimate.C_memset_#t~loopctr17| 4)] [2018-02-02 10:46:26,635 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:46:26,636 INFO L409 AbstractCegarLoop]: Interpolant automaton has 16 states [2018-02-02 10:46:26,636 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2018-02-02 10:46:26,636 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=107, Invalid=133, Unknown=0, NotChecked=0, Total=240 [2018-02-02 10:46:26,636 INFO L87 Difference]: Start difference. First operand 125 states and 131 transitions. Second operand 16 states. [2018-02-02 10:46:26,660 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 10:46:26,660 INFO L93 Difference]: Finished difference Result 128 states and 134 transitions. [2018-02-02 10:46:26,660 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2018-02-02 10:46:26,660 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 46 [2018-02-02 10:46:26,660 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 10:46:26,661 INFO L225 Difference]: With dead ends: 128 [2018-02-02 10:46:26,661 INFO L226 Difference]: Without dead ends: 126 [2018-02-02 10:46:26,661 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=111, Invalid=161, Unknown=0, NotChecked=0, Total=272 [2018-02-02 10:46:26,661 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 126 states. [2018-02-02 10:46:26,662 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 126 to 126. [2018-02-02 10:46:26,663 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 126 states. [2018-02-02 10:46:26,663 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 126 states to 126 states and 132 transitions. [2018-02-02 10:46:26,663 INFO L78 Accepts]: Start accepts. Automaton has 126 states and 132 transitions. Word has length 46 [2018-02-02 10:46:26,663 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 10:46:26,663 INFO L432 AbstractCegarLoop]: Abstraction has 126 states and 132 transitions. [2018-02-02 10:46:26,663 INFO L433 AbstractCegarLoop]: Interpolant automaton has 16 states. [2018-02-02 10:46:26,663 INFO L276 IsEmpty]: Start isEmpty. Operand 126 states and 132 transitions. [2018-02-02 10:46:26,664 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2018-02-02 10:46:26,664 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 10:46:26,664 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:46:26,664 INFO L371 AbstractCegarLoop]: === Iteration 21 === [ldv_kref_initErr0RequiresViolation, ldv_kref_initErr1RequiresViolation, ldv_kobject_createErr0RequiresViolation, ldv_kobject_createErr1RequiresViolation, ldv_atomic_sub_returnErr1RequiresViolation, ldv_atomic_sub_returnErr0RequiresViolation, ldv_atomic_sub_returnErr3RequiresViolation, ldv_atomic_sub_returnErr2RequiresViolation, ldv_kobject_cleanupErr4RequiresViolation, ldv_kobject_cleanupErr2RequiresViolation, ldv_kobject_cleanupErr5RequiresViolation, ldv_kobject_cleanupErr3RequiresViolation, ldv_kobject_cleanupErr0RequiresViolation, ldv_kobject_cleanupErr1RequiresViolation, mainErr0EnsuresViolation, LDV_INIT_LIST_HEADErr1RequiresViolation, LDV_INIT_LIST_HEADErr3RequiresViolation, LDV_INIT_LIST_HEADErr2RequiresViolation, LDV_INIT_LIST_HEADErr0RequiresViolation]=== [2018-02-02 10:46:26,664 INFO L82 PathProgramCache]: Analyzing trace with hash 992339539, now seen corresponding path program 13 times [2018-02-02 10:46:26,664 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 10:46:26,673 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 10:46:26,674 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 10:46:26,806 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:46:26,806 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-02 10:46:26,806 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [17] total 17 [2018-02-02 10:46:26,806 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 10:46:26,807 INFO 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:46:26,807 INFO L182 omatonBuilderFactory]: Interpolants [5257#true, 5258#false, 5259#(= |#Ultimate.C_memset_#t~loopctr17| 0), 5260#(<= |#Ultimate.C_memset_#t~loopctr17| 1), 5261#(<= |#Ultimate.C_memset_#t~loopctr17| 2), 5262#(<= |#Ultimate.C_memset_#t~loopctr17| 3), 5263#(<= |#Ultimate.C_memset_#t~loopctr17| 4), 5264#(<= |#Ultimate.C_memset_#t~loopctr17| 5), 5265#(<= |#Ultimate.C_memset_#t~loopctr17| 6), 5266#(<= |#Ultimate.C_memset_#t~loopctr17| 7), 5267#(<= |#Ultimate.C_memset_#t~loopctr17| 8), 5268#(<= |#Ultimate.C_memset_#t~loopctr17| 9), 5269#(<= |#Ultimate.C_memset_#t~loopctr17| 10), 5270#(<= |#Ultimate.C_memset_#t~loopctr17| 11), 5271#(<= |#Ultimate.C_memset_#t~loopctr17| 12), 5272#(<= |#Ultimate.C_memset_#t~loopctr17| 13), 5273#(<= |#Ultimate.C_memset_#amount| 13)] [2018-02-02 10:46:26,807 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:46:26,807 INFO L409 AbstractCegarLoop]: Interpolant automaton has 17 states [2018-02-02 10:46:26,807 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2018-02-02 10:46:26,807 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=122, Invalid=150, Unknown=0, NotChecked=0, Total=272 [2018-02-02 10:46:26,807 INFO L87 Difference]: Start difference. First operand 126 states and 132 transitions. Second operand 17 states. [2018-02-02 10:46:26,844 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 10:46:26,845 INFO L93 Difference]: Finished difference Result 129 states and 135 transitions. [2018-02-02 10:46:26,846 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2018-02-02 10:46:26,846 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 47 [2018-02-02 10:46:26,847 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 10:46:26,847 INFO L225 Difference]: With dead ends: 129 [2018-02-02 10:46:26,847 INFO L226 Difference]: Without dead ends: 127 [2018-02-02 10:46:26,847 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:46:26,848 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 127 states. [2018-02-02 10:46:26,850 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 127 to 127. [2018-02-02 10:46:26,850 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 127 states. [2018-02-02 10:46:26,850 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 127 states to 127 states and 133 transitions. [2018-02-02 10:46:26,850 INFO L78 Accepts]: Start accepts. Automaton has 127 states and 133 transitions. Word has length 47 [2018-02-02 10:46:26,853 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 10:46:26,853 INFO L432 AbstractCegarLoop]: Abstraction has 127 states and 133 transitions. [2018-02-02 10:46:26,853 INFO L433 AbstractCegarLoop]: Interpolant automaton has 17 states. [2018-02-02 10:46:26,853 INFO L276 IsEmpty]: Start isEmpty. Operand 127 states and 133 transitions. [2018-02-02 10:46:26,853 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2018-02-02 10:46:26,853 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 10:46:26,853 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:46:26,853 INFO L371 AbstractCegarLoop]: === Iteration 22 === [ldv_kref_initErr0RequiresViolation, ldv_kref_initErr1RequiresViolation, ldv_kobject_createErr0RequiresViolation, ldv_kobject_createErr1RequiresViolation, ldv_atomic_sub_returnErr1RequiresViolation, ldv_atomic_sub_returnErr0RequiresViolation, ldv_atomic_sub_returnErr3RequiresViolation, ldv_atomic_sub_returnErr2RequiresViolation, ldv_kobject_cleanupErr4RequiresViolation, ldv_kobject_cleanupErr2RequiresViolation, ldv_kobject_cleanupErr5RequiresViolation, ldv_kobject_cleanupErr3RequiresViolation, ldv_kobject_cleanupErr0RequiresViolation, ldv_kobject_cleanupErr1RequiresViolation, mainErr0EnsuresViolation, LDV_INIT_LIST_HEADErr1RequiresViolation, LDV_INIT_LIST_HEADErr3RequiresViolation, LDV_INIT_LIST_HEADErr2RequiresViolation, LDV_INIT_LIST_HEADErr0RequiresViolation]=== [2018-02-02 10:46:26,854 INFO L82 PathProgramCache]: Analyzing trace with hash 366198697, now seen corresponding path program 14 times [2018-02-02 10:46:26,854 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 10:46:26,866 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 10:46:26,868 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 10:46:26,995 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:46:26,995 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-02 10:46:26,995 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [18] total 18 [2018-02-02 10:46:26,995 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 10:46:26,996 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 10:46:26,996 INFO L182 omatonBuilderFactory]: Interpolants [5536#(<= |#Ultimate.C_memset_#t~loopctr17| 2), 5537#(<= |#Ultimate.C_memset_#t~loopctr17| 3), 5538#(<= |#Ultimate.C_memset_#t~loopctr17| 4), 5539#(<= |#Ultimate.C_memset_#t~loopctr17| 5), 5540#(<= |#Ultimate.C_memset_#t~loopctr17| 6), 5541#(<= |#Ultimate.C_memset_#t~loopctr17| 7), 5542#(<= |#Ultimate.C_memset_#t~loopctr17| 8), 5543#(<= |#Ultimate.C_memset_#t~loopctr17| 9), 5544#(<= |#Ultimate.C_memset_#t~loopctr17| 10), 5545#(<= |#Ultimate.C_memset_#t~loopctr17| 11), 5546#(<= |#Ultimate.C_memset_#t~loopctr17| 12), 5547#(<= |#Ultimate.C_memset_#t~loopctr17| 13), 5548#(<= |#Ultimate.C_memset_#t~loopctr17| 14), 5549#(<= |#Ultimate.C_memset_#amount| 14), 5532#true, 5533#false, 5534#(= |#Ultimate.C_memset_#t~loopctr17| 0), 5535#(<= |#Ultimate.C_memset_#t~loopctr17| 1)] [2018-02-02 10:46:26,996 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:46:26,996 INFO L409 AbstractCegarLoop]: Interpolant automaton has 18 states [2018-02-02 10:46:26,996 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2018-02-02 10:46:26,996 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=138, Invalid=168, Unknown=0, NotChecked=0, Total=306 [2018-02-02 10:46:26,997 INFO L87 Difference]: Start difference. First operand 127 states and 133 transitions. Second operand 18 states. [2018-02-02 10:46:27,037 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 10:46:27,037 INFO L93 Difference]: Finished difference Result 130 states and 136 transitions. [2018-02-02 10:46:27,039 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2018-02-02 10:46:27,039 INFO L78 Accepts]: Start accepts. Automaton has 18 states. Word has length 48 [2018-02-02 10:46:27,039 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 10:46:27,040 INFO L225 Difference]: With dead ends: 130 [2018-02-02 10:46:27,040 INFO L226 Difference]: Without dead ends: 128 [2018-02-02 10:46:27,040 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:46:27,040 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 128 states. [2018-02-02 10:46:27,042 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 128 to 128. [2018-02-02 10:46:27,042 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 128 states. [2018-02-02 10:46:27,043 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 128 states to 128 states and 134 transitions. [2018-02-02 10:46:27,043 INFO L78 Accepts]: Start accepts. Automaton has 128 states and 134 transitions. Word has length 48 [2018-02-02 10:46:27,043 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 10:46:27,043 INFO L432 AbstractCegarLoop]: Abstraction has 128 states and 134 transitions. [2018-02-02 10:46:27,043 INFO L433 AbstractCegarLoop]: Interpolant automaton has 18 states. [2018-02-02 10:46:27,043 INFO L276 IsEmpty]: Start isEmpty. Operand 128 states and 134 transitions. [2018-02-02 10:46:27,044 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2018-02-02 10:46:27,044 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 10:46:27,044 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:46:27,044 INFO L371 AbstractCegarLoop]: === Iteration 23 === [ldv_kref_initErr0RequiresViolation, ldv_kref_initErr1RequiresViolation, ldv_kobject_createErr0RequiresViolation, ldv_kobject_createErr1RequiresViolation, ldv_atomic_sub_returnErr1RequiresViolation, ldv_atomic_sub_returnErr0RequiresViolation, ldv_atomic_sub_returnErr3RequiresViolation, ldv_atomic_sub_returnErr2RequiresViolation, ldv_kobject_cleanupErr4RequiresViolation, ldv_kobject_cleanupErr2RequiresViolation, ldv_kobject_cleanupErr5RequiresViolation, ldv_kobject_cleanupErr3RequiresViolation, ldv_kobject_cleanupErr0RequiresViolation, ldv_kobject_cleanupErr1RequiresViolation, mainErr0EnsuresViolation, LDV_INIT_LIST_HEADErr1RequiresViolation, LDV_INIT_LIST_HEADErr3RequiresViolation, LDV_INIT_LIST_HEADErr2RequiresViolation, LDV_INIT_LIST_HEADErr0RequiresViolation]=== [2018-02-02 10:46:27,044 INFO L82 PathProgramCache]: Analyzing trace with hash -1864298221, now seen corresponding path program 15 times [2018-02-02 10:46:27,045 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 10:46:27,056 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 10:46:27,057 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 10:46:27,197 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:46:27,198 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-02 10:46:27,198 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [19] total 19 [2018-02-02 10:46:27,198 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 10:46:27,198 INFO 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:46:27,198 INFO L182 omatonBuilderFactory]: Interpolants [5824#(<= |#Ultimate.C_memset_#t~loopctr17| 12), 5825#(<= |#Ultimate.C_memset_#t~loopctr17| 13), 5826#(<= |#Ultimate.C_memset_#t~loopctr17| 14), 5827#(<= |#Ultimate.C_memset_#t~loopctr17| 15), 5828#(<= |#Ultimate.C_memset_#amount| 15), 5810#true, 5811#false, 5812#(= |#Ultimate.C_memset_#t~loopctr17| 0), 5813#(<= |#Ultimate.C_memset_#t~loopctr17| 1), 5814#(<= |#Ultimate.C_memset_#t~loopctr17| 2), 5815#(<= |#Ultimate.C_memset_#t~loopctr17| 3), 5816#(<= |#Ultimate.C_memset_#t~loopctr17| 4), 5817#(<= |#Ultimate.C_memset_#t~loopctr17| 5), 5818#(<= |#Ultimate.C_memset_#t~loopctr17| 6), 5819#(<= |#Ultimate.C_memset_#t~loopctr17| 7), 5820#(<= |#Ultimate.C_memset_#t~loopctr17| 8), 5821#(<= |#Ultimate.C_memset_#t~loopctr17| 9), 5822#(<= |#Ultimate.C_memset_#t~loopctr17| 10), 5823#(<= |#Ultimate.C_memset_#t~loopctr17| 11)] [2018-02-02 10:46:27,198 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:46:27,199 INFO L409 AbstractCegarLoop]: Interpolant automaton has 19 states [2018-02-02 10:46:27,199 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2018-02-02 10:46:27,199 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=155, Invalid=187, Unknown=0, NotChecked=0, Total=342 [2018-02-02 10:46:27,199 INFO L87 Difference]: Start difference. First operand 128 states and 134 transitions. Second operand 19 states. [2018-02-02 10:46:27,235 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 10:46:27,235 INFO L93 Difference]: Finished difference Result 131 states and 137 transitions. [2018-02-02 10:46:27,235 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2018-02-02 10:46:27,235 INFO L78 Accepts]: Start accepts. Automaton has 19 states. Word has length 49 [2018-02-02 10:46:27,235 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 10:46:27,236 INFO L225 Difference]: With dead ends: 131 [2018-02-02 10:46:27,236 INFO L226 Difference]: Without dead ends: 129 [2018-02-02 10:46:27,236 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:46:27,236 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 129 states. [2018-02-02 10:46:27,238 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 129 to 129. [2018-02-02 10:46:27,239 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 129 states. [2018-02-02 10:46:27,239 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 129 states to 129 states and 135 transitions. [2018-02-02 10:46:27,239 INFO L78 Accepts]: Start accepts. Automaton has 129 states and 135 transitions. Word has length 49 [2018-02-02 10:46:27,239 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 10:46:27,240 INFO L432 AbstractCegarLoop]: Abstraction has 129 states and 135 transitions. [2018-02-02 10:46:27,240 INFO L433 AbstractCegarLoop]: Interpolant automaton has 19 states. [2018-02-02 10:46:27,240 INFO L276 IsEmpty]: Start isEmpty. Operand 129 states and 135 transitions. [2018-02-02 10:46:27,240 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2018-02-02 10:46:27,240 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 10:46:27,240 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:46:27,240 INFO L371 AbstractCegarLoop]: === Iteration 24 === [ldv_kref_initErr0RequiresViolation, ldv_kref_initErr1RequiresViolation, ldv_kobject_createErr0RequiresViolation, ldv_kobject_createErr1RequiresViolation, ldv_atomic_sub_returnErr1RequiresViolation, ldv_atomic_sub_returnErr0RequiresViolation, ldv_atomic_sub_returnErr3RequiresViolation, ldv_atomic_sub_returnErr2RequiresViolation, ldv_kobject_cleanupErr4RequiresViolation, ldv_kobject_cleanupErr2RequiresViolation, ldv_kobject_cleanupErr5RequiresViolation, ldv_kobject_cleanupErr3RequiresViolation, ldv_kobject_cleanupErr0RequiresViolation, ldv_kobject_cleanupErr1RequiresViolation, mainErr0EnsuresViolation, LDV_INIT_LIST_HEADErr1RequiresViolation, LDV_INIT_LIST_HEADErr3RequiresViolation, LDV_INIT_LIST_HEADErr2RequiresViolation, LDV_INIT_LIST_HEADErr0RequiresViolation]=== [2018-02-02 10:46:27,241 INFO L82 PathProgramCache]: Analyzing trace with hash 2004741353, now seen corresponding path program 16 times [2018-02-02 10:46:27,241 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 10:46:27,253 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 10:46:27,254 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 10:46:27,414 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:46:27,414 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-02 10:46:27,414 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2018-02-02 10:46:27,414 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 10:46:27,415 INFO 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:46:27,415 INFO L182 omatonBuilderFactory]: Interpolants [6091#true, 6092#false, 6093#(= 0 |ldv_malloc_#t~malloc4.offset|), 6094#(= 0 |ldv_malloc_#res.offset|), 6095#(= 0 |ldv_kobject_create_#t~ret14.offset|), 6096#(= 0 ldv_kobject_create_~kobj~1.offset), 6097#(or (<= (+ |#Ultimate.C_memset_#ptr.offset| |#Ultimate.C_memset_#amount|) (select |#length| |#Ultimate.C_memset_#ptr.base|)) (not (= |#Ultimate.C_memset_#ptr.offset| 0))), 6098#(and (= 0 ldv_kobject_create_~kobj~1.offset) (<= 16 (select |#length| ldv_kobject_create_~kobj~1.base))), 6099#(and (= 0 |ldv_kobject_init_#in~kobj.offset|) (<= 16 (select |#length| |ldv_kobject_init_#in~kobj.base|))), 6100#(and (= 0 ldv_kobject_init_~kobj.offset) (<= 16 (select |#length| ldv_kobject_init_~kobj.base))), 6101#(and (<= 16 (select |#length| |ldv_kobject_init_internal_#in~kobj.base|)) (= 0 |ldv_kobject_init_internal_#in~kobj.offset|)), 6102#(and (<= 16 (select |#length| ldv_kobject_init_internal_~kobj.base)) (= ldv_kobject_init_internal_~kobj.offset 0)), 6103#(and (<= (+ |ldv_kref_init_#in~kref.offset| 4) (select |#length| |ldv_kref_init_#in~kref.base|)) (<= 12 |ldv_kref_init_#in~kref.offset|)), 6104#(and (<= 12 ldv_kref_init_~kref.offset) (<= (+ ldv_kref_init_~kref.offset 4) (select |#length| ldv_kref_init_~kref.base)))] [2018-02-02 10:46:27,415 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:46:27,415 INFO L409 AbstractCegarLoop]: Interpolant automaton has 14 states [2018-02-02 10:46:27,415 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2018-02-02 10:46:27,416 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=156, Unknown=0, NotChecked=0, Total=182 [2018-02-02 10:46:27,416 INFO L87 Difference]: Start difference. First operand 129 states and 135 transitions. Second operand 14 states. [2018-02-02 10:46:27,603 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 10:46:27,603 INFO L93 Difference]: Finished difference Result 128 states and 134 transitions. [2018-02-02 10:46:27,604 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2018-02-02 10:46:27,604 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 50 [2018-02-02 10:46:27,604 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 10:46:27,604 INFO L225 Difference]: With dead ends: 128 [2018-02-02 10:46:27,604 INFO L226 Difference]: Without dead ends: 128 [2018-02-02 10:46:27,604 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:46:27,605 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 128 states. [2018-02-02 10:46:27,606 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 128 to 128. [2018-02-02 10:46:27,606 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 128 states. [2018-02-02 10:46:27,606 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 128 states to 128 states and 134 transitions. [2018-02-02 10:46:27,606 INFO L78 Accepts]: Start accepts. Automaton has 128 states and 134 transitions. Word has length 50 [2018-02-02 10:46:27,606 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 10:46:27,606 INFO L432 AbstractCegarLoop]: Abstraction has 128 states and 134 transitions. [2018-02-02 10:46:27,606 INFO L433 AbstractCegarLoop]: Interpolant automaton has 14 states. [2018-02-02 10:46:27,607 INFO L276 IsEmpty]: Start isEmpty. Operand 128 states and 134 transitions. [2018-02-02 10:46:27,607 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2018-02-02 10:46:27,607 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 10:46:27,607 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:46:27,607 INFO L371 AbstractCegarLoop]: === Iteration 25 === [ldv_kref_initErr0RequiresViolation, ldv_kref_initErr1RequiresViolation, ldv_kobject_createErr0RequiresViolation, ldv_kobject_createErr1RequiresViolation, ldv_atomic_sub_returnErr1RequiresViolation, ldv_atomic_sub_returnErr0RequiresViolation, ldv_atomic_sub_returnErr3RequiresViolation, ldv_atomic_sub_returnErr2RequiresViolation, ldv_kobject_cleanupErr4RequiresViolation, ldv_kobject_cleanupErr2RequiresViolation, ldv_kobject_cleanupErr5RequiresViolation, ldv_kobject_cleanupErr3RequiresViolation, ldv_kobject_cleanupErr0RequiresViolation, ldv_kobject_cleanupErr1RequiresViolation, mainErr0EnsuresViolation, LDV_INIT_LIST_HEADErr1RequiresViolation, LDV_INIT_LIST_HEADErr3RequiresViolation, LDV_INIT_LIST_HEADErr2RequiresViolation, LDV_INIT_LIST_HEADErr0RequiresViolation]=== [2018-02-02 10:46:27,607 INFO L82 PathProgramCache]: Analyzing trace with hash -194054402, now seen corresponding path program 1 times [2018-02-02 10:46:27,608 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 10:46:27,616 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 10:46:27,616 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 10:46:27,670 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:46:27,670 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-02 10:46:27,670 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2018-02-02 10:46:27,670 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 10:46:27,670 INFO 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:46:27,670 INFO L182 omatonBuilderFactory]: Interpolants [6369#true, 6370#false, 6371#(= 1 (select |#valid| |#Ultimate.C_memset_#ptr.base|)), 6372#(= 1 (select |#valid| ldv_kobject_create_~kobj~1.base)), 6373#(= 1 (select |#valid| |ldv_kobject_init_#in~kobj.base|)), 6374#(= 1 (select |#valid| ldv_kobject_init_~kobj.base)), 6375#(= 1 (select |#valid| |ldv_kobject_init_internal_#in~kobj.base|)), 6376#(= 1 (select |#valid| ldv_kobject_init_internal_~kobj.base)), 6377#(= 1 (select |#valid| |LDV_INIT_LIST_HEAD_#in~list.base|)), 6378#(= 1 (select |#valid| LDV_INIT_LIST_HEAD_~list.base))] [2018-02-02 10:46:27,670 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:46:27,670 INFO L409 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-02-02 10:46:27,671 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-02-02 10:46:27,671 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=73, Unknown=0, NotChecked=0, Total=90 [2018-02-02 10:46:27,671 INFO L87 Difference]: Start difference. First operand 128 states and 134 transitions. Second operand 10 states. [2018-02-02 10:46:27,805 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 10:46:27,805 INFO L93 Difference]: Finished difference Result 126 states and 132 transitions. [2018-02-02 10:46:27,805 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-02-02 10:46:27,805 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 55 [2018-02-02 10:46:27,805 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 10:46:27,805 INFO L225 Difference]: With dead ends: 126 [2018-02-02 10:46:27,805 INFO L226 Difference]: Without dead ends: 126 [2018-02-02 10:46:27,806 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:46:27,806 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 126 states. [2018-02-02 10:46:27,808 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 126 to 126. [2018-02-02 10:46:27,808 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 126 states. [2018-02-02 10:46:27,808 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 126 states to 126 states and 132 transitions. [2018-02-02 10:46:27,808 INFO L78 Accepts]: Start accepts. Automaton has 126 states and 132 transitions. Word has length 55 [2018-02-02 10:46:27,809 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 10:46:27,809 INFO L432 AbstractCegarLoop]: Abstraction has 126 states and 132 transitions. [2018-02-02 10:46:27,809 INFO L433 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-02-02 10:46:27,809 INFO L276 IsEmpty]: Start isEmpty. Operand 126 states and 132 transitions. [2018-02-02 10:46:27,809 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2018-02-02 10:46:27,809 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 10:46:27,809 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:46:27,810 INFO L371 AbstractCegarLoop]: === Iteration 26 === [ldv_kref_initErr0RequiresViolation, ldv_kref_initErr1RequiresViolation, ldv_kobject_createErr0RequiresViolation, ldv_kobject_createErr1RequiresViolation, ldv_atomic_sub_returnErr1RequiresViolation, ldv_atomic_sub_returnErr0RequiresViolation, ldv_atomic_sub_returnErr3RequiresViolation, ldv_atomic_sub_returnErr2RequiresViolation, ldv_kobject_cleanupErr4RequiresViolation, ldv_kobject_cleanupErr2RequiresViolation, ldv_kobject_cleanupErr5RequiresViolation, ldv_kobject_cleanupErr3RequiresViolation, ldv_kobject_cleanupErr0RequiresViolation, ldv_kobject_cleanupErr1RequiresViolation, mainErr0EnsuresViolation, LDV_INIT_LIST_HEADErr1RequiresViolation, LDV_INIT_LIST_HEADErr3RequiresViolation, LDV_INIT_LIST_HEADErr2RequiresViolation, LDV_INIT_LIST_HEADErr0RequiresViolation]=== [2018-02-02 10:46:27,810 INFO L82 PathProgramCache]: Analyzing trace with hash -194054401, now seen corresponding path program 1 times [2018-02-02 10:46:27,811 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 10:46:27,824 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 10:46:27,825 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 10:46:27,975 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:46:27,975 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-02 10:46:27,975 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2018-02-02 10:46:27,975 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 10:46:27,975 INFO 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:46:27,976 INFO L182 omatonBuilderFactory]: Interpolants [6637#true, 6638#false, 6639#(= 0 |ldv_malloc_#t~malloc4.offset|), 6640#(= 0 |ldv_malloc_#res.offset|), 6641#(= 0 |ldv_kobject_create_#t~ret14.offset|), 6642#(= 0 ldv_kobject_create_~kobj~1.offset), 6643#(or (<= (+ |#Ultimate.C_memset_#ptr.offset| |#Ultimate.C_memset_#amount|) (select |#length| |#Ultimate.C_memset_#ptr.base|)) (not (= |#Ultimate.C_memset_#ptr.offset| 0))), 6644#(and (= 0 ldv_kobject_create_~kobj~1.offset) (<= 16 (select |#length| ldv_kobject_create_~kobj~1.base))), 6645#(and (= 0 |ldv_kobject_init_#in~kobj.offset|) (<= 16 (select |#length| |ldv_kobject_init_#in~kobj.base|))), 6646#(and (= 0 ldv_kobject_init_~kobj.offset) (<= 16 (select |#length| ldv_kobject_init_~kobj.base))), 6647#(and (<= 16 (select |#length| |ldv_kobject_init_internal_#in~kobj.base|)) (= 0 |ldv_kobject_init_internal_#in~kobj.offset|)), 6648#(and (<= 16 (select |#length| ldv_kobject_init_internal_~kobj.base)) (= ldv_kobject_init_internal_~kobj.offset 0)), 6649#(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|))), 6650#(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:46:27,976 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:46:27,976 INFO L409 AbstractCegarLoop]: Interpolant automaton has 14 states [2018-02-02 10:46:27,976 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2018-02-02 10:46:27,976 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=156, Unknown=0, NotChecked=0, Total=182 [2018-02-02 10:46:27,977 INFO L87 Difference]: Start difference. First operand 126 states and 132 transitions. Second operand 14 states. [2018-02-02 10:46:28,154 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 10:46:28,154 INFO L93 Difference]: Finished difference Result 124 states and 130 transitions. [2018-02-02 10:46:28,155 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2018-02-02 10:46:28,155 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 55 [2018-02-02 10:46:28,155 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 10:46:28,155 INFO L225 Difference]: With dead ends: 124 [2018-02-02 10:46:28,155 INFO L226 Difference]: Without dead ends: 124 [2018-02-02 10:46:28,155 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:46:28,156 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 124 states. [2018-02-02 10:46:28,157 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 124 to 124. [2018-02-02 10:46:28,157 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 124 states. [2018-02-02 10:46:28,158 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 124 states to 124 states and 130 transitions. [2018-02-02 10:46:28,158 INFO L78 Accepts]: Start accepts. Automaton has 124 states and 130 transitions. Word has length 55 [2018-02-02 10:46:28,158 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 10:46:28,158 INFO L432 AbstractCegarLoop]: Abstraction has 124 states and 130 transitions. [2018-02-02 10:46:28,158 INFO L433 AbstractCegarLoop]: Interpolant automaton has 14 states. [2018-02-02 10:46:28,158 INFO L276 IsEmpty]: Start isEmpty. Operand 124 states and 130 transitions. [2018-02-02 10:46:28,158 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2018-02-02 10:46:28,158 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 10:46:28,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] [2018-02-02 10:46:28,158 INFO L371 AbstractCegarLoop]: === Iteration 27 === [ldv_kref_initErr0RequiresViolation, ldv_kref_initErr1RequiresViolation, ldv_kobject_createErr0RequiresViolation, ldv_kobject_createErr1RequiresViolation, ldv_atomic_sub_returnErr1RequiresViolation, ldv_atomic_sub_returnErr0RequiresViolation, ldv_atomic_sub_returnErr3RequiresViolation, ldv_atomic_sub_returnErr2RequiresViolation, ldv_kobject_cleanupErr4RequiresViolation, ldv_kobject_cleanupErr2RequiresViolation, ldv_kobject_cleanupErr5RequiresViolation, ldv_kobject_cleanupErr3RequiresViolation, ldv_kobject_cleanupErr0RequiresViolation, ldv_kobject_cleanupErr1RequiresViolation, mainErr0EnsuresViolation, LDV_INIT_LIST_HEADErr1RequiresViolation, LDV_INIT_LIST_HEADErr3RequiresViolation, LDV_INIT_LIST_HEADErr2RequiresViolation, LDV_INIT_LIST_HEADErr0RequiresViolation]=== [2018-02-02 10:46:28,159 INFO L82 PathProgramCache]: Analyzing trace with hash 1776850097, now seen corresponding path program 1 times [2018-02-02 10:46:28,159 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 10:46:28,166 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 10:46:28,166 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 10:46:28,201 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:46:28,201 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-02 10:46:28,201 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2018-02-02 10:46:28,201 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 10:46:28,201 INFO 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:46:28,201 INFO L182 omatonBuilderFactory]: Interpolants [6912#(not (= ldv_kobject_create_~kobj~1.base 0)), 6913#(= ldv_kobject_init_~kobj.base |ldv_kobject_init_#in~kobj.base|), 6914#(= 0 |ldv_kobject_init_#in~kobj.base|), 6907#true, 6908#false, 6909#(not (= |ldv_malloc_#t~malloc4.base| 0)), 6910#(not (= |ldv_malloc_#res.base| 0)), 6911#(not (= |ldv_kobject_create_#t~ret14.base| 0))] [2018-02-02 10:46:28,201 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:46:28,201 INFO L409 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-02-02 10:46:28,202 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-02-02 10:46:28,202 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2018-02-02 10:46:28,202 INFO L87 Difference]: Start difference. First operand 124 states and 130 transitions. Second operand 8 states. [2018-02-02 10:46:28,229 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 10:46:28,230 INFO L93 Difference]: Finished difference Result 126 states and 131 transitions. [2018-02-02 10:46:28,230 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-02-02 10:46:28,230 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 60 [2018-02-02 10:46:28,230 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 10:46:28,230 INFO L225 Difference]: With dead ends: 126 [2018-02-02 10:46:28,230 INFO L226 Difference]: Without dead ends: 124 [2018-02-02 10:46:28,230 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:46:28,231 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 124 states. [2018-02-02 10:46:28,232 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 124 to 124. [2018-02-02 10:46:28,232 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 124 states. [2018-02-02 10:46:28,232 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 124 states to 124 states and 129 transitions. [2018-02-02 10:46:28,232 INFO L78 Accepts]: Start accepts. Automaton has 124 states and 129 transitions. Word has length 60 [2018-02-02 10:46:28,233 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 10:46:28,233 INFO L432 AbstractCegarLoop]: Abstraction has 124 states and 129 transitions. [2018-02-02 10:46:28,233 INFO L433 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-02-02 10:46:28,233 INFO L276 IsEmpty]: Start isEmpty. Operand 124 states and 129 transitions. [2018-02-02 10:46:28,233 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2018-02-02 10:46:28,233 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 10:46:28,233 INFO L351 BasicCegarLoop]: trace histogram [16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-02 10:46:28,233 INFO L371 AbstractCegarLoop]: === Iteration 28 === [ldv_kref_initErr0RequiresViolation, ldv_kref_initErr1RequiresViolation, ldv_kobject_createErr0RequiresViolation, ldv_kobject_createErr1RequiresViolation, ldv_atomic_sub_returnErr1RequiresViolation, ldv_atomic_sub_returnErr0RequiresViolation, ldv_atomic_sub_returnErr3RequiresViolation, ldv_atomic_sub_returnErr2RequiresViolation, ldv_kobject_cleanupErr4RequiresViolation, ldv_kobject_cleanupErr2RequiresViolation, ldv_kobject_cleanupErr5RequiresViolation, ldv_kobject_cleanupErr3RequiresViolation, ldv_kobject_cleanupErr0RequiresViolation, ldv_kobject_cleanupErr1RequiresViolation, mainErr0EnsuresViolation, LDV_INIT_LIST_HEADErr1RequiresViolation, LDV_INIT_LIST_HEADErr3RequiresViolation, LDV_INIT_LIST_HEADErr2RequiresViolation, LDV_INIT_LIST_HEADErr0RequiresViolation]=== [2018-02-02 10:46:28,233 INFO L82 PathProgramCache]: Analyzing trace with hash -1832725770, now seen corresponding path program 1 times [2018-02-02 10:46:28,234 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 10:46:28,242 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 10:46:28,242 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 10:46:28,322 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:46:28,322 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-02 10:46:28,322 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2018-02-02 10:46:28,323 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 10:46:28,323 INFO 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:46:28,323 INFO L182 omatonBuilderFactory]: Interpolants [7169#true, 7170#false, 7171#(not (= |ldv_malloc_#t~malloc4.base| 0)), 7172#(not (= |ldv_malloc_#res.base| 0)), 7173#(not (= |ldv_kobject_create_#t~ret14.base| 0)), 7174#(not (= ldv_kobject_create_~kobj~1.base 0)), 7175#(= ldv_kobject_init_~kobj.base |ldv_kobject_init_#in~kobj.base|), 7176#(= ldv_kobject_init_internal_~kobj.base |ldv_kobject_init_internal_#in~kobj.base|), 7177#(= 0 |ldv_kobject_init_internal_#in~kobj.base|), 7178#(= 0 |ldv_kobject_init_#in~kobj.base|)] [2018-02-02 10:46:28,323 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:46:28,324 INFO L409 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-02-02 10:46:28,324 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-02-02 10:46:28,324 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=73, Unknown=0, NotChecked=0, Total=90 [2018-02-02 10:46:28,324 INFO L87 Difference]: Start difference. First operand 124 states and 129 transitions. Second operand 10 states. [2018-02-02 10:46:28,374 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 10:46:28,374 INFO L93 Difference]: Finished difference Result 128 states and 132 transitions. [2018-02-02 10:46:28,375 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-02-02 10:46:28,375 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 65 [2018-02-02 10:46:28,375 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 10:46:28,375 INFO L225 Difference]: With dead ends: 128 [2018-02-02 10:46:28,375 INFO L226 Difference]: Without dead ends: 124 [2018-02-02 10:46:28,375 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:46:28,376 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 124 states. [2018-02-02 10:46:28,377 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 124 to 124. [2018-02-02 10:46:28,377 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 124 states. [2018-02-02 10:46:28,377 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 124 states to 124 states and 128 transitions. [2018-02-02 10:46:28,377 INFO L78 Accepts]: Start accepts. Automaton has 124 states and 128 transitions. Word has length 65 [2018-02-02 10:46:28,377 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 10:46:28,377 INFO L432 AbstractCegarLoop]: Abstraction has 124 states and 128 transitions. [2018-02-02 10:46:28,377 INFO L433 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-02-02 10:46:28,377 INFO L276 IsEmpty]: Start isEmpty. Operand 124 states and 128 transitions. [2018-02-02 10:46:28,378 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 77 [2018-02-02 10:46:28,378 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 10:46:28,378 INFO L351 BasicCegarLoop]: trace histogram [16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-02 10:46:28,378 INFO L371 AbstractCegarLoop]: === Iteration 29 === [ldv_kref_initErr0RequiresViolation, ldv_kref_initErr1RequiresViolation, ldv_kobject_createErr0RequiresViolation, ldv_kobject_createErr1RequiresViolation, ldv_atomic_sub_returnErr1RequiresViolation, ldv_atomic_sub_returnErr0RequiresViolation, ldv_atomic_sub_returnErr3RequiresViolation, ldv_atomic_sub_returnErr2RequiresViolation, ldv_kobject_cleanupErr4RequiresViolation, ldv_kobject_cleanupErr2RequiresViolation, ldv_kobject_cleanupErr5RequiresViolation, ldv_kobject_cleanupErr3RequiresViolation, ldv_kobject_cleanupErr0RequiresViolation, ldv_kobject_cleanupErr1RequiresViolation, mainErr0EnsuresViolation, LDV_INIT_LIST_HEADErr1RequiresViolation, LDV_INIT_LIST_HEADErr3RequiresViolation, LDV_INIT_LIST_HEADErr2RequiresViolation, LDV_INIT_LIST_HEADErr0RequiresViolation]=== [2018-02-02 10:46:28,378 INFO L82 PathProgramCache]: Analyzing trace with hash 1936088896, now seen corresponding path program 1 times [2018-02-02 10:46:28,379 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 10:46:28,387 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 10:46:28,388 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 10:46:28,584 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:46:28,584 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-02 10:46:28,585 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [20] imperfect sequences [] total 20 [2018-02-02 10:46:28,585 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 10:46:28,585 INFO 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:46:28,585 INFO L182 omatonBuilderFactory]: Interpolants [7456#(= 1 (select |#valid| |ldv_atomic_sub_return_#in~v.base|)), 7457#(= 1 (select |#valid| ldv_atomic_sub_return_~v.base)), 7437#true, 7438#false, 7439#(= ldv_kobject_init_~kobj.base |ldv_kobject_init_#in~kobj.base|), 7440#(= ldv_kobject_init_internal_~kobj.base |ldv_kobject_init_internal_#in~kobj.base|), 7441#(= LDV_INIT_LIST_HEAD_~list.base |LDV_INIT_LIST_HEAD_#in~list.base|), 7442#(and (= 1 (select |#valid| LDV_INIT_LIST_HEAD_~list.base)) (= LDV_INIT_LIST_HEAD_~list.base |LDV_INIT_LIST_HEAD_#in~list.base|)), 7443#(= 1 (select |#valid| |LDV_INIT_LIST_HEAD_#in~list.base|)), 7444#(= 1 (select |#valid| |ldv_kobject_init_internal_#in~kobj.base|)), 7445#(= 1 (select |#valid| |ldv_kobject_init_#in~kobj.base|)), 7446#(= 1 (select |#valid| ldv_kobject_create_~kobj~1.base)), 7447#(= 1 (select |#valid| |ldv_kobject_create_#res.base|)), 7448#(= 1 (select |#valid| |entry_point_#t~ret16.base|)), 7449#(= 1 (select |#valid| entry_point_~kobj~2.base)), 7450#(= 1 (select |#valid| |ldv_kobject_put_#in~kobj.base|)), 7451#(= 1 (select |#valid| ldv_kobject_put_~kobj.base)), 7452#(= 1 (select |#valid| |ldv_kref_put_#in~kref.base|)), 7453#(= 1 (select |#valid| ldv_kref_put_~kref.base)), 7454#(= 1 (select |#valid| |ldv_kref_sub_#in~kref.base|)), 7455#(= 1 (select |#valid| ldv_kref_sub_~kref.base))] [2018-02-02 10:46:28,585 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:46:28,586 INFO L409 AbstractCegarLoop]: Interpolant automaton has 21 states [2018-02-02 10:46:28,586 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2018-02-02 10:46:28,586 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=41, Invalid=379, Unknown=0, NotChecked=0, Total=420 [2018-02-02 10:46:28,586 INFO L87 Difference]: Start difference. First operand 124 states and 128 transitions. Second operand 21 states. [2018-02-02 10:46:28,902 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 10:46:28,902 INFO L93 Difference]: Finished difference Result 152 states and 163 transitions. [2018-02-02 10:46:28,902 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2018-02-02 10:46:28,902 INFO L78 Accepts]: Start accepts. Automaton has 21 states. Word has length 76 [2018-02-02 10:46:28,902 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 10:46:28,903 INFO L225 Difference]: With dead ends: 152 [2018-02-02 10:46:28,903 INFO L226 Difference]: Without dead ends: 152 [2018-02-02 10:46:28,903 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 57 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=69, Invalid=687, Unknown=0, NotChecked=0, Total=756 [2018-02-02 10:46:28,904 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 152 states. [2018-02-02 10:46:28,906 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 152 to 147. [2018-02-02 10:46:28,907 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 147 states. [2018-02-02 10:46:28,907 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 147 states to 147 states and 159 transitions. [2018-02-02 10:46:28,908 INFO L78 Accepts]: Start accepts. Automaton has 147 states and 159 transitions. Word has length 76 [2018-02-02 10:46:28,908 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 10:46:28,908 INFO L432 AbstractCegarLoop]: Abstraction has 147 states and 159 transitions. [2018-02-02 10:46:28,908 INFO L433 AbstractCegarLoop]: Interpolant automaton has 21 states. [2018-02-02 10:46:28,908 INFO L276 IsEmpty]: Start isEmpty. Operand 147 states and 159 transitions. [2018-02-02 10:46:28,908 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 77 [2018-02-02 10:46:28,909 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 10:46:28,909 INFO L351 BasicCegarLoop]: trace histogram [16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-02 10:46:28,909 INFO L371 AbstractCegarLoop]: === Iteration 30 === [ldv_kref_initErr0RequiresViolation, ldv_kref_initErr1RequiresViolation, ldv_kobject_createErr0RequiresViolation, ldv_kobject_createErr1RequiresViolation, ldv_atomic_sub_returnErr1RequiresViolation, ldv_atomic_sub_returnErr0RequiresViolation, ldv_atomic_sub_returnErr3RequiresViolation, ldv_atomic_sub_returnErr2RequiresViolation, ldv_kobject_cleanupErr4RequiresViolation, ldv_kobject_cleanupErr2RequiresViolation, ldv_kobject_cleanupErr5RequiresViolation, ldv_kobject_cleanupErr3RequiresViolation, ldv_kobject_cleanupErr0RequiresViolation, ldv_kobject_cleanupErr1RequiresViolation, mainErr0EnsuresViolation, LDV_INIT_LIST_HEADErr1RequiresViolation, LDV_INIT_LIST_HEADErr3RequiresViolation, LDV_INIT_LIST_HEADErr2RequiresViolation, LDV_INIT_LIST_HEADErr0RequiresViolation]=== [2018-02-02 10:46:28,909 INFO L82 PathProgramCache]: Analyzing trace with hash 1936088897, now seen corresponding path program 1 times [2018-02-02 10:46:28,910 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 10:46:28,925 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 10:46:28,926 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 10:46:29,154 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:46:29,155 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-02 10:46:29,155 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [18] imperfect sequences [] total 18 [2018-02-02 10:46:29,155 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 10:46:29,155 INFO 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:46:29,155 INFO L182 omatonBuilderFactory]: Interpolants [7776#(= 0 ldv_kobject_create_~kobj~1.offset), 7777#(or (<= (+ |#Ultimate.C_memset_#ptr.offset| |#Ultimate.C_memset_#amount|) (select |#length| |#Ultimate.C_memset_#ptr.base|)) (not (= |#Ultimate.C_memset_#ptr.offset| 0))), 7778#(and (= 0 ldv_kobject_create_~kobj~1.offset) (<= 16 (select |#length| ldv_kobject_create_~kobj~1.base))), 7779#(and (= 0 |ldv_kobject_create_#res.offset|) (<= 16 (select |#length| |ldv_kobject_create_#res.base|))), 7780#(and (<= 16 (select |#length| |entry_point_#t~ret16.base|)) (= 0 |entry_point_#t~ret16.offset|)), 7781#(and (= 0 entry_point_~kobj~2.offset) (<= 16 (select |#length| entry_point_~kobj~2.base))), 7782#(and (<= 16 (select |#length| |ldv_kobject_put_#in~kobj.base|)) (= 0 |ldv_kobject_put_#in~kobj.offset|)), 7783#(and (= ldv_kobject_put_~kobj.offset 0) (<= 16 (select |#length| ldv_kobject_put_~kobj.base))), 7784#(and (<= 12 |ldv_kref_put_#in~kref.offset|) (<= (+ |ldv_kref_put_#in~kref.offset| 4) (select |#length| |ldv_kref_put_#in~kref.base|))), 7785#(and (<= 12 ldv_kref_put_~kref.offset) (<= (+ ldv_kref_put_~kref.offset 4) (select |#length| ldv_kref_put_~kref.base))), 7786#(and (<= (+ |ldv_kref_sub_#in~kref.offset| 4) (select |#length| |ldv_kref_sub_#in~kref.base|)) (<= 12 |ldv_kref_sub_#in~kref.offset|)), 7787#(and (<= (+ ldv_kref_sub_~kref.offset 4) (select |#length| ldv_kref_sub_~kref.base)) (<= 12 ldv_kref_sub_~kref.offset)), 7788#(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|)), 7789#(and (<= (+ ldv_atomic_sub_return_~v.offset 4) (select |#length| ldv_atomic_sub_return_~v.base)) (<= 12 ldv_atomic_sub_return_~v.offset)), 7771#true, 7772#false, 7773#(= 0 |ldv_malloc_#t~malloc4.offset|), 7774#(= 0 |ldv_malloc_#res.offset|), 7775#(= 0 |ldv_kobject_create_#t~ret14.offset|)] [2018-02-02 10:46:29,155 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:46:29,155 INFO L409 AbstractCegarLoop]: Interpolant automaton has 19 states [2018-02-02 10:46:29,156 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2018-02-02 10:46:29,156 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=306, Unknown=0, NotChecked=0, Total=342 [2018-02-02 10:46:29,156 INFO L87 Difference]: Start difference. First operand 147 states and 159 transitions. Second operand 19 states. [2018-02-02 10:46:29,451 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 10:46:29,451 INFO L93 Difference]: Finished difference Result 145 states and 155 transitions. [2018-02-02 10:46:29,452 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2018-02-02 10:46:29,452 INFO L78 Accepts]: Start accepts. Automaton has 19 states. Word has length 76 [2018-02-02 10:46:29,452 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 10:46:29,452 INFO L225 Difference]: With dead ends: 145 [2018-02-02 10:46:29,452 INFO L226 Difference]: Without dead ends: 145 [2018-02-02 10:46:29,453 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:46:29,453 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 145 states. [2018-02-02 10:46:29,454 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 145 to 145. [2018-02-02 10:46:29,455 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 145 states. [2018-02-02 10:46:29,455 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 145 states to 145 states and 155 transitions. [2018-02-02 10:46:29,455 INFO L78 Accepts]: Start accepts. Automaton has 145 states and 155 transitions. Word has length 76 [2018-02-02 10:46:29,455 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 10:46:29,455 INFO L432 AbstractCegarLoop]: Abstraction has 145 states and 155 transitions. [2018-02-02 10:46:29,455 INFO L433 AbstractCegarLoop]: Interpolant automaton has 19 states. [2018-02-02 10:46:29,455 INFO L276 IsEmpty]: Start isEmpty. Operand 145 states and 155 transitions. [2018-02-02 10:46:29,456 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 80 [2018-02-02 10:46:29,456 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 10:46:29,456 INFO L351 BasicCegarLoop]: trace histogram [16, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-02 10:46:29,456 INFO L371 AbstractCegarLoop]: === Iteration 31 === [ldv_kref_initErr0RequiresViolation, ldv_kref_initErr1RequiresViolation, ldv_kobject_createErr0RequiresViolation, ldv_kobject_createErr1RequiresViolation, ldv_atomic_sub_returnErr1RequiresViolation, ldv_atomic_sub_returnErr0RequiresViolation, ldv_atomic_sub_returnErr3RequiresViolation, ldv_atomic_sub_returnErr2RequiresViolation, ldv_kobject_cleanupErr4RequiresViolation, ldv_kobject_cleanupErr2RequiresViolation, ldv_kobject_cleanupErr5RequiresViolation, ldv_kobject_cleanupErr3RequiresViolation, ldv_kobject_cleanupErr0RequiresViolation, ldv_kobject_cleanupErr1RequiresViolation, mainErr0EnsuresViolation, LDV_INIT_LIST_HEADErr1RequiresViolation, LDV_INIT_LIST_HEADErr3RequiresViolation, LDV_INIT_LIST_HEADErr2RequiresViolation, LDV_INIT_LIST_HEADErr0RequiresViolation]=== [2018-02-02 10:46:29,456 INFO L82 PathProgramCache]: Analyzing trace with hash -1236824510, now seen corresponding path program 1 times [2018-02-02 10:46:29,456 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 10:46:29,464 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 10:46:29,465 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 10:46:29,530 INFO L134 CoverageAnalysis]: Checked inductivity of 140 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 137 trivial. 0 not checked. [2018-02-02 10:46:29,530 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-02 10:46:29,531 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [11] total 11 [2018-02-02 10:46:29,531 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 10:46:29,531 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-02-02 10:46:29,531 INFO L182 omatonBuilderFactory]: Interpolants [8096#(not (= |ldv_kobject_create_#t~ret14.base| 0)), 8097#(not (= ldv_kobject_create_~kobj~1.base 0)), 8098#(not (= |ldv_kobject_create_#res.base| 0)), 8099#(not (= |entry_point_#t~ret16.base| 0)), 8100#(not (= entry_point_~kobj~2.base 0)), 8101#(= ldv_kobject_put_~kobj.base |ldv_kobject_put_#in~kobj.base|), 8102#(= 0 |ldv_kobject_put_#in~kobj.base|), 8092#true, 8093#false, 8094#(not (= |ldv_malloc_#t~malloc4.base| 0)), 8095#(not (= |ldv_malloc_#res.base| 0))] [2018-02-02 10:46:29,531 INFO L134 CoverageAnalysis]: Checked inductivity of 140 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 137 trivial. 0 not checked. [2018-02-02 10:46:29,532 INFO L409 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-02-02 10:46:29,532 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-02-02 10:46:29,532 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=91, Unknown=0, NotChecked=0, Total=110 [2018-02-02 10:46:29,532 INFO L87 Difference]: Start difference. First operand 145 states and 155 transitions. Second operand 11 states. [2018-02-02 10:46:29,595 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 10:46:29,595 INFO L93 Difference]: Finished difference Result 146 states and 152 transitions. [2018-02-02 10:46:29,595 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-02-02 10:46:29,595 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 79 [2018-02-02 10:46:29,595 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 10:46:29,596 INFO L225 Difference]: With dead ends: 146 [2018-02-02 10:46:29,596 INFO L226 Difference]: Without dead ends: 142 [2018-02-02 10:46:29,596 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:46:29,596 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 142 states. [2018-02-02 10:46:29,597 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 142 to 142. [2018-02-02 10:46:29,597 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 142 states. [2018-02-02 10:46:29,598 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 142 states to 142 states and 148 transitions. [2018-02-02 10:46:29,598 INFO L78 Accepts]: Start accepts. Automaton has 142 states and 148 transitions. Word has length 79 [2018-02-02 10:46:29,598 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 10:46:29,598 INFO L432 AbstractCegarLoop]: Abstraction has 142 states and 148 transitions. [2018-02-02 10:46:29,598 INFO L433 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-02-02 10:46:29,598 INFO L276 IsEmpty]: Start isEmpty. Operand 142 states and 148 transitions. [2018-02-02 10:46:29,598 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 91 [2018-02-02 10:46:29,599 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 10:46:29,599 INFO L351 BasicCegarLoop]: trace histogram [16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-02 10:46:29,599 INFO L371 AbstractCegarLoop]: === Iteration 32 === [ldv_kref_initErr0RequiresViolation, ldv_kref_initErr1RequiresViolation, ldv_kobject_createErr0RequiresViolation, ldv_kobject_createErr1RequiresViolation, ldv_atomic_sub_returnErr1RequiresViolation, ldv_atomic_sub_returnErr0RequiresViolation, ldv_atomic_sub_returnErr3RequiresViolation, ldv_atomic_sub_returnErr2RequiresViolation, ldv_kobject_cleanupErr4RequiresViolation, ldv_kobject_cleanupErr2RequiresViolation, ldv_kobject_cleanupErr5RequiresViolation, ldv_kobject_cleanupErr3RequiresViolation, ldv_kobject_cleanupErr0RequiresViolation, ldv_kobject_cleanupErr1RequiresViolation, mainErr0EnsuresViolation, LDV_INIT_LIST_HEADErr1RequiresViolation, LDV_INIT_LIST_HEADErr3RequiresViolation, LDV_INIT_LIST_HEADErr2RequiresViolation, LDV_INIT_LIST_HEADErr0RequiresViolation]=== [2018-02-02 10:46:29,599 INFO L82 PathProgramCache]: Analyzing trace with hash 2027437998, now seen corresponding path program 1 times [2018-02-02 10:46:29,600 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 10:46:29,608 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 10:46:29,609 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 10:46:29,858 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:46:29,858 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-02 10:46:29,858 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [24] imperfect sequences [] total 24 [2018-02-02 10:46:29,859 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 10:46:29,859 INFO 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:46:29,859 INFO L182 omatonBuilderFactory]: Interpolants [8397#true, 8398#false, 8399#(= ldv_kobject_init_~kobj.base |ldv_kobject_init_#in~kobj.base|), 8400#(= ldv_kobject_init_internal_~kobj.base |ldv_kobject_init_internal_#in~kobj.base|), 8401#(= LDV_INIT_LIST_HEAD_~list.base |LDV_INIT_LIST_HEAD_#in~list.base|), 8402#(and (= 1 (select |#valid| LDV_INIT_LIST_HEAD_~list.base)) (= LDV_INIT_LIST_HEAD_~list.base |LDV_INIT_LIST_HEAD_#in~list.base|)), 8403#(= 1 (select |#valid| |LDV_INIT_LIST_HEAD_#in~list.base|)), 8404#(= 1 (select |#valid| |ldv_kobject_init_internal_#in~kobj.base|)), 8405#(= 1 (select |#valid| |ldv_kobject_init_#in~kobj.base|)), 8406#(= 1 (select |#valid| ldv_kobject_create_~kobj~1.base)), 8407#(= 1 (select |#valid| |ldv_kobject_create_#res.base|)), 8408#(= 1 (select |#valid| |entry_point_#t~ret16.base|)), 8409#(= 1 (select |#valid| entry_point_~kobj~2.base)), 8410#(= 1 (select |#valid| |ldv_kobject_put_#in~kobj.base|)), 8411#(= 1 (select |#valid| ldv_kobject_put_~kobj.base)), 8412#(= 1 (select |#valid| |ldv_kref_put_#in~kref.base|)), 8413#(= 1 (select |#valid| ldv_kref_put_~kref.base)), 8414#(= 1 (select |#valid| |ldv_kref_sub_#in~kref.base|)), 8415#(= 1 (select |#valid| ldv_kref_sub_~kref.base)), 8416#(= 1 (select |#valid| |##fun~$Pointer$~TO~VOID_#in~kref.base|)), 8417#(= 1 (select |#valid| |##fun~$Pointer$~TO~VOID_#~kref.base|)), 8418#(= 1 (select |#valid| |ldv_kobject_release_#in~kref.base|)), 8419#(= 1 (select |#valid| ldv_kobject_release_~kobj~0.base)), 8420#(= 1 (select |#valid| |ldv_kobject_cleanup_#in~kobj.base|)), 8421#(= 1 (select |#valid| ldv_kobject_cleanup_~kobj.base))] [2018-02-02 10:46:29,859 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:46:29,859 INFO L409 AbstractCegarLoop]: Interpolant automaton has 25 states [2018-02-02 10:46:29,859 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2018-02-02 10:46:29,860 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=49, Invalid=551, Unknown=0, NotChecked=0, Total=600 [2018-02-02 10:46:29,860 INFO L87 Difference]: Start difference. First operand 142 states and 148 transitions. Second operand 25 states. [2018-02-02 10:46:30,271 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 10:46:30,271 INFO L93 Difference]: Finished difference Result 152 states and 161 transitions. [2018-02-02 10:46:30,271 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2018-02-02 10:46:30,271 INFO L78 Accepts]: Start accepts. Automaton has 25 states. Word has length 90 [2018-02-02 10:46:30,271 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 10:46:30,272 INFO L225 Difference]: With dead ends: 152 [2018-02-02 10:46:30,272 INFO L226 Difference]: Without dead ends: 152 [2018-02-02 10:46:30,272 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 33 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 32 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 82 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=85, Invalid=1037, Unknown=0, NotChecked=0, Total=1122 [2018-02-02 10:46:30,272 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 152 states. [2018-02-02 10:46:30,274 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 152 to 148. [2018-02-02 10:46:30,274 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 148 states. [2018-02-02 10:46:30,274 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 148 states to 148 states and 158 transitions. [2018-02-02 10:46:30,274 INFO L78 Accepts]: Start accepts. Automaton has 148 states and 158 transitions. Word has length 90 [2018-02-02 10:46:30,275 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 10:46:30,275 INFO L432 AbstractCegarLoop]: Abstraction has 148 states and 158 transitions. [2018-02-02 10:46:30,275 INFO L433 AbstractCegarLoop]: Interpolant automaton has 25 states. [2018-02-02 10:46:30,275 INFO L276 IsEmpty]: Start isEmpty. Operand 148 states and 158 transitions. [2018-02-02 10:46:30,275 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 91 [2018-02-02 10:46:30,275 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 10:46:30,275 INFO L351 BasicCegarLoop]: trace histogram [16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-02 10:46:30,275 INFO L371 AbstractCegarLoop]: === Iteration 33 === [ldv_kref_initErr0RequiresViolation, ldv_kref_initErr1RequiresViolation, ldv_kobject_createErr0RequiresViolation, ldv_kobject_createErr1RequiresViolation, ldv_atomic_sub_returnErr1RequiresViolation, ldv_atomic_sub_returnErr0RequiresViolation, ldv_atomic_sub_returnErr3RequiresViolation, ldv_atomic_sub_returnErr2RequiresViolation, ldv_kobject_cleanupErr4RequiresViolation, ldv_kobject_cleanupErr2RequiresViolation, ldv_kobject_cleanupErr5RequiresViolation, ldv_kobject_cleanupErr3RequiresViolation, ldv_kobject_cleanupErr0RequiresViolation, ldv_kobject_cleanupErr1RequiresViolation, mainErr0EnsuresViolation, LDV_INIT_LIST_HEADErr1RequiresViolation, LDV_INIT_LIST_HEADErr3RequiresViolation, LDV_INIT_LIST_HEADErr2RequiresViolation, LDV_INIT_LIST_HEADErr0RequiresViolation]=== [2018-02-02 10:46:30,275 INFO L82 PathProgramCache]: Analyzing trace with hash 2027437999, now seen corresponding path program 1 times [2018-02-02 10:46:30,276 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 10:46:30,288 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 10:46:30,289 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 10:46:30,671 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:46:30,671 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-02 10:46:30,671 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [24] imperfect sequences [] total 24 [2018-02-02 10:46:30,672 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 10:46:30,672 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 10:46:30,672 INFO L182 omatonBuilderFactory]: Interpolants [8740#true, 8741#false, 8742#(= 0 |ldv_malloc_#t~malloc4.offset|), 8743#(= 0 |ldv_malloc_#res.offset|), 8744#(= 0 |ldv_kobject_create_#t~ret14.offset|), 8745#(= 0 ldv_kobject_create_~kobj~1.offset), 8746#(= 0 |ldv_kobject_create_#res.offset|), 8747#(= 0 |entry_point_#t~ret16.offset|), 8748#(= 0 entry_point_~kobj~2.offset), 8749#(= 0 |ldv_kobject_put_#in~kobj.offset|), 8750#(= ldv_kobject_put_~kobj.offset 0), 8751#(<= 12 |ldv_kref_put_#in~kref.offset|), 8752#(<= 12 ldv_kref_put_~kref.offset), 8753#(<= 12 |ldv_kref_sub_#in~kref.offset|), 8754#(<= 12 ldv_kref_sub_~kref.offset), 8755#(and (<= |ldv_atomic_sub_return_#in~v.offset| ldv_atomic_sub_return_~v.offset) (= ldv_atomic_sub_return_~v.base |ldv_atomic_sub_return_#in~v.base|)), 8756#(and (<= (+ |ldv_atomic_sub_return_#in~v.offset| 4) (select |#length| ldv_atomic_sub_return_~v.base)) (= ldv_atomic_sub_return_~v.base |ldv_atomic_sub_return_#in~v.base|)), 8757#(<= (+ |ldv_atomic_sub_return_#in~v.offset| 4) (select |#length| |ldv_atomic_sub_return_#in~v.base|)), 8758#(and (<= (+ ldv_kref_sub_~kref.offset 4) (select |#length| ldv_kref_sub_~kref.base)) (<= 12 ldv_kref_sub_~kref.offset)), 8759#(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|))), 8760#(and (<= 12 |##fun~$Pointer$~TO~VOID_#~kref.offset|) (<= (+ |##fun~$Pointer$~TO~VOID_#~kref.offset| 4) (select |#length| |##fun~$Pointer$~TO~VOID_#~kref.base|))), 8761#(and (<= 12 |ldv_kobject_release_#in~kref.offset|) (<= (+ |ldv_kobject_release_#in~kref.offset| 4) (select |#length| |ldv_kobject_release_#in~kref.base|))), 8762#(and (<= (+ ldv_kobject_release_~kobj~0.offset 16) (select |#length| ldv_kobject_release_~kobj~0.base)) (<= 0 ldv_kobject_release_~kobj~0.offset)), 8763#(and (<= (+ |ldv_kobject_cleanup_#in~kobj.offset| 16) (select |#length| |ldv_kobject_cleanup_#in~kobj.base|)) (<= 0 |ldv_kobject_cleanup_#in~kobj.offset|)), 8764#(and (<= 0 ldv_kobject_cleanup_~kobj.offset) (<= (+ ldv_kobject_cleanup_~kobj.offset 16) (select |#length| ldv_kobject_cleanup_~kobj.base)))] [2018-02-02 10:46:30,672 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:46:30,672 INFO L409 AbstractCegarLoop]: Interpolant automaton has 25 states [2018-02-02 10:46:30,672 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2018-02-02 10:46:30,673 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=49, Invalid=551, Unknown=0, NotChecked=0, Total=600 [2018-02-02 10:46:30,673 INFO L87 Difference]: Start difference. First operand 148 states and 158 transitions. Second operand 25 states. [2018-02-02 10:46:30,988 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 10:46:30,988 INFO L93 Difference]: Finished difference Result 147 states and 156 transitions. [2018-02-02 10:46:30,988 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2018-02-02 10:46:30,988 INFO L78 Accepts]: Start accepts. Automaton has 25 states. Word has length 90 [2018-02-02 10:46:30,988 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 10:46:30,989 INFO L225 Difference]: With dead ends: 147 [2018-02-02 10:46:30,989 INFO L226 Difference]: Without dead ends: 147 [2018-02-02 10:46:30,989 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 36 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 33 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 65 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=92, Invalid=1098, Unknown=0, NotChecked=0, Total=1190 [2018-02-02 10:46:30,990 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 147 states. [2018-02-02 10:46:30,992 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 147 to 147. [2018-02-02 10:46:30,992 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 147 states. [2018-02-02 10:46:30,992 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 147 states to 147 states and 156 transitions. [2018-02-02 10:46:30,993 INFO L78 Accepts]: Start accepts. Automaton has 147 states and 156 transitions. Word has length 90 [2018-02-02 10:46:30,993 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 10:46:30,993 INFO L432 AbstractCegarLoop]: Abstraction has 147 states and 156 transitions. [2018-02-02 10:46:30,993 INFO L433 AbstractCegarLoop]: Interpolant automaton has 25 states. [2018-02-02 10:46:30,993 INFO L276 IsEmpty]: Start isEmpty. Operand 147 states and 156 transitions. [2018-02-02 10:46:30,993 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 93 [2018-02-02 10:46:30,993 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 10:46:30,993 INFO L351 BasicCegarLoop]: trace histogram [16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-02 10:46:30,994 INFO L371 AbstractCegarLoop]: === Iteration 34 === [ldv_kref_initErr0RequiresViolation, ldv_kref_initErr1RequiresViolation, ldv_kobject_createErr0RequiresViolation, ldv_kobject_createErr1RequiresViolation, ldv_atomic_sub_returnErr1RequiresViolation, ldv_atomic_sub_returnErr0RequiresViolation, ldv_atomic_sub_returnErr3RequiresViolation, ldv_atomic_sub_returnErr2RequiresViolation, ldv_kobject_cleanupErr4RequiresViolation, ldv_kobject_cleanupErr2RequiresViolation, ldv_kobject_cleanupErr5RequiresViolation, ldv_kobject_cleanupErr3RequiresViolation, ldv_kobject_cleanupErr0RequiresViolation, ldv_kobject_cleanupErr1RequiresViolation, mainErr0EnsuresViolation, LDV_INIT_LIST_HEADErr1RequiresViolation, LDV_INIT_LIST_HEADErr3RequiresViolation, LDV_INIT_LIST_HEADErr2RequiresViolation, LDV_INIT_LIST_HEADErr0RequiresViolation]=== [2018-02-02 10:46:30,994 INFO L82 PathProgramCache]: Analyzing trace with hash -1547234289, now seen corresponding path program 1 times [2018-02-02 10:46:30,994 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 10:46:31,003 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 10:46:31,004 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 10:46:31,199 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:46:31,200 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-02 10:46:31,200 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [21] imperfect sequences [] total 21 [2018-02-02 10:46:31,200 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 10:46:31,200 INFO 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:46:31,200 INFO L182 omatonBuilderFactory]: Interpolants [9088#(= 0 |ldv_kobject_put_#in~kobj.offset|), 9089#(= ldv_kobject_put_~kobj.offset 0), 9090#(<= |ldv_kref_put_#in~kref.offset| 12), 9091#(<= ldv_kref_put_~kref.offset 12), 9092#(<= |ldv_kref_sub_#in~kref.offset| 12), 9093#(<= ldv_kref_sub_~kref.offset 12), 9094#(<= |##fun~$Pointer$~TO~VOID_#in~kref.offset| 12), 9095#(<= |##fun~$Pointer$~TO~VOID_#~kref.offset| 12), 9096#(<= |ldv_kobject_release_#in~kref.offset| 12), 9097#(<= ldv_kobject_release_~kobj~0.offset 0), 9098#(<= |ldv_kobject_cleanup_#in~kobj.offset| 0), 9099#(<= ldv_kobject_cleanup_~kobj.offset 0), 9100#(and (<= 0 ldv_kobject_cleanup_~kobj.offset) (<= ldv_kobject_cleanup_~kobj.offset 0)), 9079#true, 9080#false, 9081#(= 0 |ldv_malloc_#t~malloc4.offset|), 9082#(= 0 |ldv_malloc_#res.offset|), 9083#(= 0 |ldv_kobject_create_#t~ret14.offset|), 9084#(= 0 ldv_kobject_create_~kobj~1.offset), 9085#(= 0 |ldv_kobject_create_#res.offset|), 9086#(= 0 |entry_point_#t~ret16.offset|), 9087#(= 0 entry_point_~kobj~2.offset)] [2018-02-02 10:46:31,200 INFO L134 CoverageAnalysis]: Checked inductivity of 136 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 136 trivial. 0 not checked. [2018-02-02 10:46:31,200 INFO L409 AbstractCegarLoop]: Interpolant automaton has 22 states [2018-02-02 10:46:31,201 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2018-02-02 10:46:31,201 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=42, Invalid=420, Unknown=0, NotChecked=0, Total=462 [2018-02-02 10:46:31,201 INFO L87 Difference]: Start difference. First operand 147 states and 156 transitions. Second operand 22 states. [2018-02-02 10:46:31,459 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 10:46:31,459 INFO L93 Difference]: Finished difference Result 146 states and 155 transitions. [2018-02-02 10:46:31,459 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2018-02-02 10:46:31,460 INFO L78 Accepts]: Start accepts. Automaton has 22 states. Word has length 92 [2018-02-02 10:46:31,460 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 10:46:31,460 INFO L225 Difference]: With dead ends: 146 [2018-02-02 10:46:31,460 INFO L226 Difference]: Without dead ends: 146 [2018-02-02 10:46:31,461 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:46:31,461 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 146 states. [2018-02-02 10:46:31,462 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 146 to 146. [2018-02-02 10:46:31,462 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 146 states. [2018-02-02 10:46:31,462 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 146 states to 146 states and 155 transitions. [2018-02-02 10:46:31,463 INFO L78 Accepts]: Start accepts. Automaton has 146 states and 155 transitions. Word has length 92 [2018-02-02 10:46:31,463 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 10:46:31,463 INFO L432 AbstractCegarLoop]: Abstraction has 146 states and 155 transitions. [2018-02-02 10:46:31,463 INFO L433 AbstractCegarLoop]: Interpolant automaton has 22 states. [2018-02-02 10:46:31,463 INFO L276 IsEmpty]: Start isEmpty. Operand 146 states and 155 transitions. [2018-02-02 10:46:31,463 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 95 [2018-02-02 10:46:31,464 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 10:46:31,464 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:46:31,464 INFO L371 AbstractCegarLoop]: === Iteration 35 === [ldv_kref_initErr0RequiresViolation, ldv_kref_initErr1RequiresViolation, ldv_kobject_createErr0RequiresViolation, ldv_kobject_createErr1RequiresViolation, ldv_atomic_sub_returnErr1RequiresViolation, ldv_atomic_sub_returnErr0RequiresViolation, ldv_atomic_sub_returnErr3RequiresViolation, ldv_atomic_sub_returnErr2RequiresViolation, ldv_kobject_cleanupErr4RequiresViolation, ldv_kobject_cleanupErr2RequiresViolation, ldv_kobject_cleanupErr5RequiresViolation, ldv_kobject_cleanupErr3RequiresViolation, ldv_kobject_cleanupErr0RequiresViolation, ldv_kobject_cleanupErr1RequiresViolation, mainErr0EnsuresViolation, LDV_INIT_LIST_HEADErr1RequiresViolation, LDV_INIT_LIST_HEADErr3RequiresViolation, LDV_INIT_LIST_HEADErr2RequiresViolation, LDV_INIT_LIST_HEADErr0RequiresViolation]=== [2018-02-02 10:46:31,464 INFO L82 PathProgramCache]: Analyzing trace with hash -833465104, now seen corresponding path program 1 times [2018-02-02 10:46:31,465 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 10:46:31,528 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 10:46:31,529 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 10:46:31,545 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:46:31,549 INFO L168 Benchmark]: Toolchain (without parser) took 8352.34 ms. Allocated memory was 397.9 MB in the beginning and 848.3 MB in the end (delta: 450.4 MB). Free memory was 354.8 MB in the beginning and 410.0 MB in the end (delta: -55.2 MB). Peak memory consumption was 395.2 MB. Max. memory is 5.3 GB. [2018-02-02 10:46:31,550 INFO L168 Benchmark]: CDTParser took 0.15 ms. Allocated memory is still 397.9 MB. Free memory is still 361.4 MB. There was no memory consumed. Max. memory is 5.3 GB. [2018-02-02 10:46:31,554 INFO L168 Benchmark]: CACSL2BoogieTranslator took 188.66 ms. Allocated memory is still 397.9 MB. Free memory was 354.8 MB in the beginning and 340.3 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:46:31,554 INFO L168 Benchmark]: Boogie Preprocessor took 31.71 ms. Allocated memory is still 397.9 MB. Free memory was 340.3 MB in the beginning and 339.0 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:46:31,555 INFO L168 Benchmark]: RCFGBuilder took 340.89 ms. Allocated memory is still 397.9 MB. Free memory was 339.0 MB in the beginning and 306.3 MB in the end (delta: 32.6 MB). Peak memory consumption was 32.6 MB. Max. memory is 5.3 GB. [2018-02-02 10:46:31,555 INFO L168 Benchmark]: TraceAbstraction took 7787.87 ms. Allocated memory was 397.9 MB in the beginning and 848.3 MB in the end (delta: 450.4 MB). Free memory was 306.3 MB in the beginning and 410.0 MB in the end (delta: -103.7 MB). Peak memory consumption was 346.7 MB. Max. memory is 5.3 GB. [2018-02-02 10:46:31,557 INFO L344 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.15 ms. Allocated memory is still 397.9 MB. Free memory is still 361.4 MB. There was no memory consumed. Max. memory is 5.3 GB. * CACSL2BoogieTranslator took 188.66 ms. Allocated memory is still 397.9 MB. Free memory was 354.8 MB in the beginning and 340.3 MB in the end (delta: 14.5 MB). Peak memory consumption was 14.5 MB. Max. memory is 5.3 GB. * Boogie Preprocessor took 31.71 ms. Allocated memory is still 397.9 MB. Free memory was 340.3 MB in the beginning and 339.0 MB in the end (delta: 1.3 MB). Peak memory consumption was 1.3 MB. Max. memory is 5.3 GB. * RCFGBuilder took 340.89 ms. Allocated memory is still 397.9 MB. Free memory was 339.0 MB in the beginning and 306.3 MB in the end (delta: 32.6 MB). Peak memory consumption was 32.6 MB. Max. memory is 5.3 GB. * TraceAbstraction took 7787.87 ms. Allocated memory was 397.9 MB in the beginning and 848.3 MB in the end (delta: 450.4 MB). Free memory was 306.3 MB in the beginning and 410.0 MB in the end (delta: -103.7 MB). Peak memory consumption was 346.7 MB. Max. memory is 5.3 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - ExceptionOrErrorResult: UnsupportedOperationException: Unknown lemma type! de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: UnsupportedOperationException: Unknown lemma type!: de.uni_freiburg.informatik.ultimate.smtinterpol.interpolate.Interpolator.walkLeafNode(Interpolator.java:299) RESULT: Ultimate could not prove your program: Toolchain returned no result. Written .csv to /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/memleaks_test22_3_false-valid-deref.i_svcomp-DerefFreeMemtrack-32bit-Automizer_SmtInterpol_NoArray.epf_AutomizerC.xml/Csv-Benchmark-0-2018-02-02_10-46-31-564.csv Received shutdown request...